maxSize archive modifying function now works with extensions

Add a Gitter chat badge to README.md

.gitignore

@@ -1,3 +1,4 @@
 .idea/
+.vs/
 build/
 cmake-build-debug/

.travis.yml

@@ -0,0 +1,23 @@
+language: cpp
+
+compiler:
+  - gcc
+  # clang
+
+before_install:
+  # C++14
+  - sudo add-apt-repository -y ppa:ubuntu-toolchain-r/test
+  - sudo apt-get update -qq
+
+install: 
+  - sudo apt-get install -qq g++-5 lcov
+  - sudo update-alternatives --install /usr/bin/g++ g++ /usr/bin/g++-5 90
+  - sudo update-alternatives --install /usr/bin/gcc gcc /usr/bin/gcc-5 90
+
+before_script:
+  - mkdir build
+  - cd build
+  - cmake ..
+
+script: make && make test
+

CHANGELOG.md

@@ -1 +1,118 @@
-#
+# [4.0.0](https://github.com/fraillt/bitsery/compare/v3.0.0...v4.0.0) (2017-10-13)
+
+I feel that current library public API is complete, and should be stable for long time.
+Most changes was made to improve performance or/and make library usage easier.
+
+### Features
+
+* new **flexible** syntax similar to *cereal* library.
+This syntax no longer requires to specify explicit fundamental type sizes and container maxsize (container max size can be enforced by special function *maxSize*).
+Be careful when using deserializing untrusted data and make sure to enforce fundamental type sizes when using on multiple platforms.
+(use helper function *assertFundamentalTypeSizes* to enforce type sizes for multiple platforms)
+* added streaming support, by introducing new **adapter** concept. Two adapter implementations is available: stream adapter, or buffer adapter.
+* added missing std containers support: forward_list, deque, stack, queue, priority_queue, set, multiset, unordered_set, unordered_multiset.
+
+### Breaking changes
+
+* a lot of classes and files were renamed.
+* improved error messages.
+* traits reworked:
+  * ContainerTraits get **isContiguous**.
+  * TextTraits is separate from ContainerTraits, only has **length**, and **addNUL**.
+  * buffer traits renamed to **BufferAdapterTraits** and removed difference type.
+  * added **TValue** to all trait types, this is used to diagnose better errors.
+* BasicBufferReader/Writer is split in two different types: **AdapterReader/Writer** and separate type that enables bit-packing operations  **AdapterBitPacking(Reader/Writer)Wrapper**.
+* Serializer/Deserializer reworked
+  * No longer copyable, because it stores adapter writer/reader.
+  * Removed boolByte, boolBit, and added **boolValue** and it writes bit or byte, depeding on if bit-packing is enabled or not.
+  * Bit-packing is enabled by calling **enableBitPacking**, if bitpacking is already enabled, this method will return same instance.
+* changed defaults for *DefaultConfig*, BufferSessionsEnabled is false by default, because it doesn't work with input streams.
+* serialization config no longer needs typedef *Buffer*.
+
+# [3.0.0](https://github.com/fraillt/bitsery/compare/v2.0.1...v3.0.0) (2017-09-21)
+
+### Features
+
+* refactored interface, now works with C++11 compiler.
+* new new extension **Growable**, that allows to have forward/backward compatability within this functions serialization flow. It only allows to append new data at the end of to existing flow without breaking old consumers.
+  * old consumer: correctly read old interfce and ignore new data.
+  * new consumer: get defaults (zero values) for new fields, when reading old data.
+* added new extension for associative *map* containers **ContainerMap**.
+* friendly static_assert message when serializing **object**, that doesn't have **serialize** function defined.
+* added **object** overload, that invokes user function/lambda with object. It is the same as calling user function directly, but makes more consistent API.
+* Serializer/Deserializer now have optional *context* parameter, that might be required in some specific serialization cases.
+* added traits for custom types specialization, in *details/traits.h*
+* improved serialization performance: added support for fixed size buffer for BufferWriter for best performance.
+* improved performance for reading/writing container sizes.
+* added new method to BufferReader **getError** which returns on of three values: NO_ERROR, BUFFER_OVERFLOW, INVALID_BUFFER_DATA, also added setError method, that is only used by Deserializer.
+
+
+### Breaking changes
+
+* now all serializer/deserializer functions return void, to avoid undefined behaviour for functions parameters evaluation when using method chaining. There was no benefits apart from *nicer* syntax, but could have undefined behaviour when building complex serialization flows.
+* removed **SERIALIZE** macro, and changed interface for all functions that use custom lambdas, to work with C++11. Now lambda function must capture serializer/deserializer.
+* to make serializer a little bit *lighter* removed advanced features and made available as extensions via **extend** method
+  * removed **range** method, instead added **ValueRange** extension.
+  * removed **substitution** method, instead added **Entropy** extension, to sound more familiar to *entropy encoding* term.
+* removed **array**, instead added fixed sizes overloads for **container**.
+* removed **isValid** method from Deserializer, only BufferReader/Writer store states.
+* container and text sizes representation changed, to allow much faster size reads/writes for small values.
+* renamed functions:
+  * **ext** to **extend** and changed its interface, to make it more easy to extend.
+  * alias functions that write bytes directly no has *b* (meaning bytes) at the end of the name eg. *value4* now is *value4b*.
+* changed BufferWriter/Reader behaviour:
+  * added support for fixed size buffers for better serializer performance (more than 50% improvement). Default config is resizable buffer (*std::vector<uint8_t>*).
+  * after serialization, call *getWrittenRange* to get valid range written to buffer, because BufferWritter for resizable buffer now always resize to *capacity* to avoid using *back_insert_iterator* for better performance.
+  * BufferReader has constructor with iterators (range), and raw value type pointers (begin, end).
+* renamed BufferReader **isCompleted** to  **isCompletedSuccessfully**, that returns true only when there is no errors and buffer is fully read.
+
+### Bug fixes
+
+* **readBytes** was reading in aligned mode, when scratch value from previous bit operations was zero.
+* **writeBits** had incorrect assert when writing negative int64_t.
+
+<a name="2.0.1"></a>
+# [2.0.1](https://github.com/fraillt/bitsery/compare/v2.0.0...v2.0.1) (2017-08-12)
+
+### Other notes
+* added travis build status
+
+<a name="2.0.0"></a>
+# [2.0.0](https://github.com/fraillt/bitsery/compare/v1.1.1...v2.0.0) (2017-07-25)
+
+### Features
+
+* endianness support, default network configuration is *little endian*
+* added user extensible function **ext**, to work with objects that require different serialization/deserialization path (e.g. pointers)
+* **optional** extension (for *ext* function), to work with *std::optional* types
+
+### Bug Fixes
+* *align* method fixed in *BufferReader*
+
+### Breaking changes
+
+* file structure changed, added *details* folder.
+* no longer support for implicit size converions for all functions (*value*, *array*, *container*), instead added helper functions with specific size, to avoid typing *s.template value<1>...* within serialization function body
+* changed parameters order for all functions that use custom function (lambda)
+* *BufferReader* and *BufferWriter* is now alias types for real types *BasicBufferReader/Writer&lt;DefaultConfig&gt;* (*DefaultConfig* is defined in *common.h*)
+
+
+<a name="1.1.1"></a>
+# [1.1.1](https://github.com/fraillt/bitsery/compare/v1.0.0...v1.1.1) (2017-02-23)
+
+### Notes
+* changed folder structure
+* added more BufferReader constructors
+
+# 1.0.0 (2017-02-22)
+
+### Features
+
+Serialization functions:
+* **value** - [fundamental types](doc/design/fundamental_types.md)
+* **container** - dynamic size containers
+* **array** - fixed size containers
+* **text** - for c-array and std::string
+* **range** - compresion for fundamental types (e.g. int between [255..512] will take up 8bits
+* **substitution** - default value from list (e.g. 4d vector, that is most of the time equals to [0,0,0,1] can store only 1bit)
+* **boolBit**/**boolByte** - serialize bool, as 1bit or 1byte.

CMakeLists.txt

@@ -3,7 +3,7 @@ cmake_minimum_required(VERSION 3.2)
 project(bitsery)
 
 set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall")
-set(CMAKE_CXX_STANDARD 14)
+set(CMAKE_CXX_STANDARD 11)
 set(CMAKE_CXX_STANDARD_REQUIRED ON)
 
 add_subdirectory(examples)

CONTRIBUTING.md

@@ -0,0 +1,27 @@
+# Contributing to Bitsery
+
+So you want to contribute something to Bitsery? That's great!
+Contributions are always very much appreciated, whether it's a bug fix, a new feature or documentation.
+However, to make sure the process of accepting patches goes smoothly, you should try to follow these few simple guidelines when
+you contribute:
+
+1. Fork the repository.
+2. Create new branch based on the *master* branch (`git checkout -b your_branch master`). If your contribution is a bug fix, you should name your branch `bugfix/xxx`; for a feature, it should be `feature/xxx`. Otherwise, just use your good judgment. Consistent naming of branches is appreciated since it makes the output of `git branch` easier to understand with a single glance.
+3. Do your modifications on that branch. Except for special cases, your contribution should include proper unit tests and documentation.
+4. Make sure your modifications did not break anything by building, running tests and checking code coverage (test coverage should not be less than 100%):
+  ```shell
+  mkdir build
+  cd build
+  cmake ..
+  make
+  ctest
+  make tests_coverage
+  x-www-browser ./coverage/index.html
+  ```
+5. Commit your changes, and push to your fork (`git push origin your_branch`). Commit message should be one line short description. When applicable, please squash adjacent *wip* commits into a single *logical* commit.
+6. Open a pull request against Bitsery *master* branch. Currently ongoing development is on *master*. At some point an integration branch will be set-up, and pull-requests should target that, but for now its all against master. You may see feature branches come and go, too.
+
+
+## Style guide
+
+Just use your own judgment and stick to the style of the surrounding code.

README.md

@@ -1,77 +1,107 @@
 # Bitsery
 
+[![Build Status](https://travis-ci.org/fraillt/bitsery.svg?branch=master)](https://travis-ci.org/fraillt/bitsery)
+[![Join the chat at https://gitter.im/bitsery/Lobby](https://badges.gitter.im/bitsery/Lobby.svg)](https://gitter.im/bitsery/Lobby)
+
 Header only C++ binary serialization library.
-It is designed around the networking requirements for multiplayer real-time fast paced games as first person shooters.
-All cross-platform requirements are enforced at compile time, so serialized data do not store any run-time type information and is as small as possible.
+It is designed around the networking requirements for real-time data delivery, especially for games.
 
-## Status
+All cross-platform requirements are enforced at compile time, so serialized data do not store any meta-data information and is as small as possible.
 
-**bitsery** is in pre-release state and is looking for your feedback. 
-It has basic features, serialize arithmetic types, enums, containers and text, and few advanced features like value ranges and default values (substitution), but is still missing functions for delta changes and geometry compression.
-> Current version do not handle Big/Little Endianness.
-> Error handling on deserialization is not tested.
+> **bitsery** is looking for your feedback on [gitter](https://gitter.im/bitsery/Lobby)
 
-## Example
+## Features
+
+* Cross-platform compatible.
+* Optimized for speed and space.
+* Allows flexible or/and verbose syntax for better serialization control.
+* No code generation required: no IDL or metadata, just use your types directly.
+* Runtime error checking on deserialization.
+* Supports forward/backward compatibility for your types.
+* 2-in-1 declarative control flow, same code for serialization and deserialization.
+* Allows fine-grained bit-level serialization control.
+* Can read/write from any source: stream (file, network stream. etc... ), or buffer (vector, c-array, etc...).
+* Easily extendable for any type.
+* Configurable endianess support.
+* No macros.
+
+## Why to use bitsery
+
+Look at the numbers and features list, and decide yourself.
+
+|                              | binary size | data size | serialize   | deserialize |
+|------------------------------|-------------|-----------|-------------|-------------|
+| **test_bitsery**             | 64704       | **7565**  | **1229 ms** | **1086 ms** |
+| **test_bitsery_compression** | 44000       | **4784**  | **1370 ms** | **2463 ms** |
+| test_yas                     | 63864       | 11311     | 1616 ms     | 1712 ms     |
+| test_yas_compression         | 72688       | 8523      | 2387 ms     | 2890 ms     |
+| test_cereal                  | 74848       | 11261     | 6708 ms     | 6799 ms     |
+| test_flatbuffers             | 67032       | 16100     | 8793 ms     | 3028 ms     |
+
+*benchmarked on Ubuntu with GCC 7.1.0, more details can be found [here](https://github.com/fraillt/cpp_serializers_benchmark.git)*
+
+If still not convinced read more in library [motivation](doc/design/README.md) section.
+
+## Usage example
 ```cpp
-#include <iostream>
-#include <vector>
 #include <bitsery/bitsery.h>
+#include <bitsery/adapter/buffer.h>
+#include <bitsery/traits/vector.h>
 
-
-enum class MyEnum { V1,V2,V3 };
+enum class MyEnum:uint16_t { V1,V2,V3 };
 struct MyStruct {
-    int i;
+    uint32_t i;
     MyEnum e;
     std::vector<float> fs;
 };
 
-//define how object should be serialized/deserialized
-SERIALIZE(MyStruct) {
-    return s.
-            value(o.i).
-            value(o.e).
-            container(o.fs, 100);
-}
+template <typename S>
+void serialize(S& s, MyStruct& o) {
+    s.value4b(o.i);
+    s.value2b(o.e);
+    s.container4b(o.fs, 10);
+};
 
 using namespace bitsery;
 
+using Buffer = std::vector<uint8_t>;
+using OutputAdapter = OutputBufferAdapter<Buffer>;
+using InputAdapter = InputBufferAdapter<Buffer>;
+
 int main() {
-    //set some random data
     MyStruct data{8941, MyEnum::V2, {15.0f, -8.5f, 0.045f}};
     MyStruct res{};
 
-    //create serializer
-    //1) create buffer to store data
-    std::vector<uint8_t> buffer;
-    //2) create buffer writer that is able to write bytes or bits to buffer
-    BufferWriter bw{buffer};
-    //3) create serializer
-    Serializer<BufferWriter> ser{bw};
+    Buffer buffer;
 
-    //serialize object, can also be invoked like this: serialize(ser, data)
-    ser.object(data);
+    auto writtenSize = quickSerialization<OutputAdapter>(buffer, data);
 
-    //flush to buffer, before creating buffer reader
-    bw.flush();
+    auto state = quickDeserialization<InputAdapter>({buffer.begin(), writtenSize}, res);
 
-    //create deserializer
-    //1) create buffer reader
-    BufferReader br{buffer};
-    //2) create deserializer
-    Deserializer<BufferReader> des{br};
-
-    //deserialize same object, can also be invoked like this: serialize(des, data)
-    des.object(res);
-
-    //check is equal
-    std::cout << "is equal: " << (data.fs == res.fs && data.i == res.i && data.e == res.e) << std::endl;
+    assert(state.first == ReaderError::NoError && state.second);
+    assert(data.fs == res.fs && data.i == res.i && data.e == res.e);
 }
 ```
+For more details go directly to [quick start](doc/tutorial/hello_world.md) tutorial.
+
+## How to use it
+This documentation comprises these parts:
+* [Tutorial](doc/tutorial/README.md) - getting started.
+* [Reference section](doc/README.md) - all the details.
+
+*documentation is in progress, most parts are empty, but [contributions](CONTRIBUTING.md) are welcome.*
+
+## Requirements
+
+Works with C++11 compiler, no additional dependencies, include `<bitsery/bitsery.h>` and you're done.
 
 ## Platforms
 
 This library was tested on
-* Windows: Visual Studio 2015, MinGW (gcc 5.2)
+* Windows: Visual Studio 2015, MinGW (GCC 5.2)
 * Linux: GCC 5.4, GCC 6.2, Clang 3.9
 * OS X Mavericks: AppleClang 8
 
+## License
+
+**bitsery** is licensed under the [MIT license](LICENSE).

doc/README.md

@@ -0,0 +1,66 @@
+To get the most out of **Bitsery**, start with the [tutorial](tutorial/README.md).
+Once you're familiar with the library consider the following reference material.
+
+Library design:
+* `fundamental types`
+* `valueNb instead of value`
+* `flexible syntax`
+* `serializer/deserializer functions overloads`
+* `extending library functionality`
+* `errors handling`
+* `forward/backward compatibility via Growable extension`
+
+
+Core Serializer/Deserializer functions (alphabetical order):
+* `align`
+* `boolValue`
+* `container`
+* `ext`
+* `context`
+* `object`
+* `text`
+* `value`
+
+Serializer/Deserializer extensions via `ext` method (alphabetical order):
+* `Entropy`
+* `Growable`
+* `StdMap`
+* `StdOptional`
+* `StdQueue`
+* `StdSet`
+* `StdStack`
+* `ValueRange`
+
+AdapterWriter/Reader functions:
+* `writeBits/readBits`
+* `writeBytes/readBytes`
+* `writeBuffer/readBuffer`
+* `align`
+* `beginSession/endSession`
+* `flush (writer only)`
+* `writtenBytesCount (writer only)`
+* `setError (reader only)`
+* `getError (reader only)`
+* `isCompletedSuccessfully (reader only)`
+
+Input adapters (buffer and stream) functions:
+* `read`
+* `error`
+* `setError`
+* `isCompletedSuccessfully`
+
+Output adapters (buffer and stream) functions:
+* `write`
+* `flush`
+* `writtenBytesCount`
+
+
+Tips and tricks:
+* if you're getting static assert "please define 'serialize' function", most likely it is because your **serialize** function is not defined in same namespace as object.
+
+Limitations:
+* max **text** or **container** size can be 2^(n-2) (where n = sizeof(std::size_t) * 8) for 32-bit systems it is 1073741823 (0x3FFFFFF).
+
+Other:
+* [Contributing](../CONTRIBUTING.md)
+* [Change log](../CHANGELOG.md)

doc/design/README.md

@@ -0,0 +1,71 @@
+## Motivation
+
+Inspiration to create **bitsery** came mainly because there aren't any good alternatives for C++.
+
+I wanted serializer that is easy to use like [cereal](http://uscilab.github.io/cereal/), is cross-platform compatible, and has support for forward/backward compatibility like [flatbuffers](https://google.github.io/flatbuffers/), is save to use with untrusted (malicious) data, and most importantly is fast and has small binary footprint.
+
+Furthermore I wanted full serialization control and ability to work on bit level, so I can further reduce data size. For example, serializing container of [quaternions](https://en.wikipedia.org/wiki/Quaternion) I can reduce size by large amount. *Size of orientation quaternion can be reduced from 128bits (4floats) down to 29bits using "smallest three" technique and still retaining decent precision*.
+
+Most well-known serialization libraries sacrifice memory and speed efficiency by supporting multiple data formats (binary, json, xml) and multiple languages (C++, C#, Javascript, etc..), these features also adds additional library complexity.
+
+## A word about JSON
+
+Often times people use C++ because they want speed and memory efficiency, and JSON is not on the list of efficient serialization format.
+Although JSON is very readable and very convenient when used together with dynamically typed languages such as JavaScript.
+When serializing data from statically typed languages, however, JSON not only has the obvious drawback of runtime inefficiency, but also forces you to write more code to access data (counterintuitively) due to its dynamic-typing serialization system.
+
+Adding optional support for JSON doesn't come for free either.
+To support JSON, additional metadata is required.
+In C++ it can be achieved by two ways:
+* with macros, that generate additional types like [cereal](http://uscilab.github.io/cereal/) does.
+* with code generation from IDL (interface definition language) like [flatbuffers](https://google.github.io/flatbuffers/) does.
+
+Both solutions adds additional complexity to the library. In the future C++ will get reflection system, currently static reflection was proposed to standard.
+
+So, to avoid unnecessary library complexity it is best to forget about JSON, and stick with what machines and C++ is good at, - binary format.
+
+# Bitsery
+
+Bitsery is designed to be lightweight and simple to use, yet powerful and extendable library.
+To ensure it works as intended it is unit tested, and has 100% code coverage.
+
+Now let's review features in more detail.
+
+* **Cross-platform compatible.** if same code compiles on Android, PS3 console, and your PC either x64 or x86 architecture, you are 100% sure it works.
+To achieve this, bitsery specifically defines size of underlying data, hence syntax is *value\<2\>* (alias function *value2b*)  instead or *value*, or *container2b* for element type of 16bits, eg int16_t.
+Bitsery also applies endianess transformation if nessesarry.
+* **Flexible syntax.** if you don't like like writing code with explicitly specifying underlying type size, like *container2b* or *value8b* you can use flexible syntax.
+Just include <bitsery/flexible.h> and can write like in [cereal](http://uscilab.github.io/cereal/).
+But do it on your own risk, and static assert using *assertFundamentalTypeSizes* function if you're planing to use it accross multiple platforms.
+* **Optimized for speed and space.** library itself doesn't do any allocations (except if you use backward/forward compatibility) so data writing/reading is fast as memcpy to/from your buffer.
+It also doesn't serialize any type information, all information needed is writen in your code!
+* **No code generation required: no IDL or metadata** since it doesn't support any other formats except binary, it doesn't need any metadata.
+* **Runtime error checking on deserialization** library designed to be save with untrusted network data, that's why all overloads that work on containers has *maxSize* value, unless container is static size like *std::array*, this way bitsery ensures that no malicious data crash you.
+* **Supports forward/backward compatibility for your types** library has optional forward/backward compatibility for types implemented in *BasicBufferReader/BasicBufferWriter* by allowing to have inner data sessions in inside buffer.
+This is the only functionality that requires dynamic memory allocation.
+*Glowable* extension use these sessions to add compatibility support for your types, in most basic form.
+You can implement your own extensions if you want to be able to add default values.
+* **2-in-1 declarative control flow, same code for serialization and deserialization.** only one function to define, for serialization and deserialization in same manner as *cereal* does.
+It might be handy to have separate *load* and *save* functions, but Bitsery explicitly doesn't support it, to avoid any serialization deserialization divergence, because it is very hard to catch an errors if you make a bug in one of these functions.
+The only way around this through extensions, write your custom flow once, and reuse where you need them.
+* **Allows fine-grained serialization control** this is a feature that no other libraries provides.
+Bitsery allows to use bit-level operations and has two extensions that use them:
+  * *ValueRange*,- if you have a *int16_t* data type, but you know that your object only stores values in \[0..1000\] range, it will write 10bits, instead of 16bits. ValueRanges also works with floats.
+  * *Entropy*,- full term is *entropy encoding*, which means that when you have most common value, or multiple values, it will write just few bits instead of full object.
+
+    Eg.: imagine that you have a struct Person{ int32_t Id; string Profession; }.
+    You might know that mostly there are young persons, so the most common value will be equal to: "Student", "Child", "NoProfession", in this case you'll pay 2bits for each record, but write no data if string matches.
+
+  Using these bit-level operations and extensions you can compose your own extensions for vectors, matrices or any other types.
+  Further more, all other operations will not align data automatically for you, so data will be compressed as much as possible.
+
+  * One more advanced and dangerous feature, is ability to have serialization context, so you can control your serialization flow at runtime, but make sure that these contexts are in sync between serializer and deserializer.
+    One possible use case for serialization context is to pass min/max ranges for *ValueRange* when your information changes at runtime.
+* **Easily extendable** library is designed to be easily extendable for any type and flow.
+You want to support your custom container, its fine there is *ContainerTraits* for this, only few methods required to implement.
+To use same container for buffer writing/reading add specialization to *BufferAdapterTraits*.
+You want to customize serialization flow - use extensions, only two methods to define, and *ExtensionTraits* to further customize usage.
+* **Configurable endianess support.** default is *Little Endian*, but if your primary target is PowerPC architecture, eg. PlayStation3, just change your configuration to be *Big Endian*.
+* **No macros.** Not so much to say, if you are like me, then it's a feature :)
+
+*project for performance benchmark will be added to separate github project, i'll give you a link to it when its done.*

doc/design/errors.md

@@ -0,0 +1,2 @@
+errors handling design
+usage of NotDefinedType, and how it helps to reduce error stack

doc/design/function_n.md

@@ -0,0 +1 @@
+valueN instead of value

doc/design/fundamental_types.md

@@ -0,0 +1 @@
+ints chars floats (except bool)

doc/reference/buf_get_error.md

@@ -0,0 +1,6 @@
+*document in progress*
+* NoError,
+* BUFFER_OVERFLOW,
+* INVALID_BUFFER_DATA
+* write what happens when data is corrupted
+* how growable effect error codes when deserializing old data format.

doc/reference/buf_is_completed_successfully.md

@@ -0,0 +1,7 @@
+### BufferReader.isCompletedSuccessfully()
+
+Returns true when buffer was fully read, and there was no [errors](buf_get_error.md).
+
+If buffer contains multiple serialized objects and you want to know deserialization state for each object, then use [getError](buf_get_error.md) after reading each object.
+
+Use this function when buffer contains one object, or you know that you read all data.

doc/tutorial/README.md

@@ -0,0 +1,8 @@
+The grand plan for this tutorial is to learn how to serialize/deserialize any object efficiently in time and space, so you could focus on other, more interesting things.
+
+This tutorial will cover these main topics:
+* `Hello World` write one control flow for both: serialization and deserialization.
+* `Composer` efficiently compose complex serialization flows.
+* `Squeeze Me!` compress your data when you know what it stores.
+* `Anything is Possible` extend library for custom container, compress geometry and more.
+* `Little or Big` change endianness if you want best performance on PowerPC.

doc/tutorial/composition.md

@@ -0,0 +1,3 @@
+*document in progress*
+* explain why *value* and *object* is fundamental functions.
+* write about *Growable* extension

doc/tutorial/hello_world.md

@@ -0,0 +1,127 @@
+# Quick Start
+
+This is a quick guide to get **bitsery** up and running in a matter of minutes.
+The only prerequisite for running bitsery is a modern C++11 compliant compiler, such as GCC 4.9.4, clang 3.4, MSVC 2015, or newer.
+Older versions might work, but it is not tested.
+
+## Get bitsery
+
+bitsery can be directly included in your project or installed anywhere you can access header files.
+Grab the latest version, and include directory `bitsery_base_dir/include/` to your project.
+There's nothing to build or make - **bitsery** is header only.
+
+## Include required headers and define some helper types
+
+```cpp
+#include <bitsery/bitsery.h>
+#include <bitsery/adapter/buffer.h>
+#include <bitsery/traits/vector.h>
+#include <bitsery/traits/string.h>
+
+using namespace bitsery;
+
+using Buffer = std::vector<uint8_t>;
+using OutputAdapter = OutputBufferAdapter<Buffer>;
+using InputAdapter = InputBufferAdapter<Buffer>;
+
+```
+
+**bitsery** is very lightweight, so we need to explicitly include what we need.
+* `<bitsery/bitsery.h>` is a core header, that includes our Serializer and Deserializer
+* `<bitsery/adapter/buffer.h>` in order to write/read data we need specific adapter, depending on what underlying buffer will be. In this example we'll be using std::vector as our buffer, so we include buffer adapter.
+* <bitsery/traits/...> traits tells library how efficiently serialize particular container.
+
+create alias types for *InputAdapter* and *OutputAdapter* using our vector as buffer.
+
+## Add serialization method for your type
+
+**bitsery** needs to know which data members to serialize in your classes.
+Let it know by implementing a serialize method for your type:
+
+```cpp
+struct MyStruct {
+    uint32_t i;
+    char str[6];
+    std::vector<float> fs;
+};
+
+template <typename S>
+void serialize(S& s, MyStruct& o) {
+    s.value4b(o.i);
+    s.text1b(o.str);
+    s.container4b(o.fs, 100);
+};
+```
+
+**bitsery** also allows to define serialize function in side your class, and can also serialize private class members, just make *friend bitsery::Access;*
+
+**bitsery** supports two ways how to describe your serialization flow: *verbose syntax* (as in example) or *flexible syntax*, similar to *cereal* library, just include `<bitsery/flexible.h>` to use it.
+
+This example we choosed probably unfamiliar verbose syntax, so lets explain core functionality that you'll use all the time:
+* **s.value4b(o.i);** serialize fundamental types (ints, floats, enums) value**4b** means, that data type is 4 bytes. If you use same code on different machines, if it compiles it means it is compatible.
+* **s.text1b(o.str);** serialize text (null-terminated) of char type, if you use *wchar* then you would write *text2b*.
+* **s.container4b(o.fs, 100);** serializes any container of fundamental types of size 4bytes, **100** is max size of container.
+**Bitsery** is designed to be save with untrusted (malicious) data from network, so for dynamic containers you always need to provide max possible size available, to avoid buffer-overflow attacks.
+**text** didn't had this max size specified, because it was serializing fixed size container.
+
+External serialization functions should be placed either in the same namespace as the types they serialize or in the **bitsery** namespace so that the compiler can find them properly.
+
+## Serialization and deserialization
+
+Create buffer and use helper functions for serialization and deserialization.
+
+```cpp
+Buffer buffer;
+
+auto writtenSize = quickSerialization<OutputAdapter>(buffer, data);
+
+auto state = quickDeserialization<InputAdapter>({buffer.begin(), writtenSize}, res);
+```
+
+These helper functions use default configuration *bitsery::DefaultConfig*
+* **quickSerialization** create serializer using output adapter, serializes data and returns written size.
+* **quickDeserialization** create deserializer using input adapter, deserializes to object, and returns deserialization state.
+deserialization state has two properties, error code and bool that indicates if buffer was fully read and there is no errors.
+
+## Full example code
+
+```cpp
+#include <bitsery/bitsery.h>
+#include <bitsery/adapter/buffer.h>
+#include <bitsery/traits/vector.h>
+#include <bitsery/traits/string.h>
+
+using namespace bitsery;
+
+using Buffer = std::vector<uint8_t>;
+using OutputAdapter = OutputBufferAdapter<Buffer>;
+using InputAdapter = InputBufferAdapter<Buffer>;
+
+struct MyStruct {
+    uint32_t i;
+    char str[6];
+    std::vector<float> fs;
+};
+
+template <typename S>
+void serialize(S& s, MyStruct& o) {
+    s.value4b(o.i);
+    s.text1b(o.str);
+    s.container4b(o.fs, 100);
+};
+
+int main() {
+    MyStruct data{8941, "hello", {15.0f, -8.5f, 0.045f}};
+    MyStruct res{};
+
+    Buffer buffer;
+    auto writtenSize = quickSerialization<OutputAdapter>(buffer, data);
+
+    auto state = quickDeserialization<InputAdapter>({buffer.begin(), writtenSize}, res);
+
+    assert(state.first == ReaderError::NoError && state.second);
+    assert(data.fs == res.fs && data.i == res.i && std::strcmp(data.str, res.str) == 0);
+}
+```
+
+**currently documentation and tutorial is progress, but for more usage examples see examples folder**

examples/basic_usage.cpp

@@ -1,75 +1,50 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-#include <iostream>
-#include <vector>
+//include bitsery.h to get serialization and deserialization classes
 #include <bitsery/bitsery.h>
+//in ordered to serialize/deserialize data to buffer, include buffer adapter
+#include <bitsery/adapter/buffer.h>
+//bitsery itself doesn't is lightweight, and doesnt include any unnessessary files,
+//traits helps library to know how to use types correctly,
+//in this case we'll be using vector both, to serialize/deserialize data and to store use as a buffer.
+#include <bitsery/traits/vector.h>
 
-
-enum class MyEnum { V1,V2,V3 };
+enum class MyEnum:uint16_t { V1,V2,V3 };
 struct MyStruct {
-    int i;
+    uint32_t i;
     MyEnum e;
     std::vector<float> fs;
 };
 
 //define how object should be serialized/deserialized
-SERIALIZE(MyStruct) {
-    return s.
-            value4(o.i).
-            value4(o.e).
-            container4(o.fs, 100);
-}
+template <typename S>
+void serialize(S& s, MyStruct& o) {
+    s.value4b(o.i);//fundamental types (ints, floats, enums) of size 4b
+    s.value2b(o.e);
+    s.container4b(o.fs, 10);//resizable containers also requires maxSize, to make it safe from buffer-overflow attacks
+};
 
 using namespace bitsery;
 
+//some helper types
+using Buffer = std::vector<uint8_t>;
+using OutputAdapter = OutputBufferAdapter<Buffer>;
+using InputAdapter = InputBufferAdapter<Buffer>;
+
 int main() {
     //set some random data
     MyStruct data{8941, MyEnum::V2, {15.0f, -8.5f, 0.045f}};
     MyStruct res{};
 
-    //create serializer
-    //1) create buffer to store data
-    std::vector<uint8_t> buffer;
-    //2) create buffer writer that is able to write bytes or bits to buffer
-    BufferWriter bw{buffer};
-    //3) create serializer
-    Serializer<BufferWriter> ser{bw};
+    //create buffer to store data
+    Buffer buffer;
+    //use quick serialization function,
+    //it will use default configuration to setup all the nesessary steps
+    //and serialize data to container
+    auto writtenSize = quickSerialization<OutputAdapter>(buffer, data);
 
-    //serialize object, can also be invoked like this: serialize(ser, data)
-    ser.object(data);
+    //same as serialization, but returns deserialization state as a pair
+    //first = error code, second = is buffer was successfully read from begin to the end.
+    auto state = quickDeserialization<InputAdapter>({buffer.begin(), writtenSize}, res);
 
-    //flush to buffer, before creating buffer reader
-    bw.flush();
-
-    //create deserializer
-    //1) create buffer reader
-    BufferReader br{buffer};
-    //2) create deserializer
-    Deserializer<BufferReader> des{br};
-
-    //deserialize same object, can also be invoked like this: serialize(des, data)
-    des.object(res);
-
-    //check is equal
-    std::cout << "is equal: " << (data.fs == res.fs && data.i == res.i && data.e == res.e) << std::endl;
-}
+    assert(state.first == ReaderError::NoError && state.second);
+    assert(data.fs == res.fs && data.i == res.i && data.e == res.e);
+}

examples/complex_flow.cpp

@@ -0,0 +1,103 @@
+#include <bitsery/bitsery.h>
+#include <bitsery/adapter/buffer.h>
+//include traits for types, that we'll be using
+#include <bitsery/traits/string.h>
+#include <bitsery/traits/array.h>
+#include <bitsery/traits/vector.h>
+//include extension that will allow to have backward/forward compatibility
+#include <bitsery/ext/growable.h>
+
+namespace MyTypes {
+
+    //define data
+    enum Color:uint8_t { Red, Green, Blue };
+
+    struct Vec3 { float x, y, z; };
+
+    struct Weapon {
+        std::string name;
+        int16_t damage;
+    private:
+        //define serialize function as private, and give access to bitsery
+        friend bitsery::Access;
+        template <typename S>
+        void serialize (S& s) {
+            //forward/backward compatibility for monsters
+            s.ext(*this, bitsery::ext::Growable{}, [&s](Weapon& o1) {
+                s.text1b(o1.name, 20);
+                s.value2b(o1.damage);
+            });
+        }
+    };
+
+    struct Monster {
+        Vec3 pos;
+        int16_t mana;
+        int16_t hp;
+        std::string name;
+        std::vector<uint8_t> inventory;
+        Color color;
+        std::vector<Weapon> weapons;
+        Weapon equipped;
+        std::vector<Vec3> path;
+    };
+
+    template <typename S>
+    void serialize(S& s, Vec3& o) {
+        s.value4b(o.x);
+        s.value4b(o.y);
+        s.value4b(o.z);
+    }
+
+    template <typename S>
+    void serialize (S& s, Monster& o) {
+        //forward/backward compatibility for monsters
+        s.ext(o, bitsery::ext::Growable{}, [&s](Monster& o1) {
+            s.value1b(o1.color);
+            s.value2b(o1.mana);
+            s.value2b(o1.hp);
+            s.object(o1.equipped);
+            s.object(o1.pos);
+            s.container(o1.path, 1000);
+            s.container(o1.weapons, 100);
+            s.container1b(o1.inventory, 50);
+            s.text1b(o1.name, 20);
+        });
+    }
+}
+
+using namespace bitsery;
+
+//use fixed-size buffer
+using Buffer = std::array<uint8_t, 10000>;
+using OutputAdapter = OutputBufferAdapter<Buffer>;
+using InputAdapter = InputBufferAdapter<Buffer>;
+
+//create configuration that enables session support, to work with "growable" extension
+struct SessionsEnabled:public DefaultConfig {
+    static constexpr bool BufferSessionsEnabled = true;
+};
+
+int main() {
+    //set some random data
+    MyTypes::Monster data{};
+    data.name = "lew";
+    data.weapons.push_back(MyTypes::Weapon{"GoodWeapon", 100});
+
+    //create buffer to store data to
+    Buffer buffer{};
+    //since we're using different configuration, we cannot use quickSerialization function.
+    BasicSerializer<AdapterWriter<OutputAdapter, SessionsEnabled>> ser{OutputAdapter{buffer}};
+    ser.object(data);
+    auto& w = AdapterAccess::getWriter(ser);
+    w.flush();
+    auto writtenSize = w.writtenBytesCount();
+
+
+    MyTypes::Monster res{};
+    //deserialize
+    BasicDeserializer<AdapterReader<InputAdapter, SessionsEnabled>> des{InputAdapter{buffer.begin(), writtenSize}};
+    des.object(res);
+    auto& r = AdapterAccess::getReader(des);
+    assert(r.error() == ReaderError::NoError && r.isCompletedSuccessfully());
+}

examples/file_stream.cpp

@@ -0,0 +1,59 @@
+#include <bitsery/bitsery.h>
+//in order to work with streams include stream adapter
+#include <bitsery/adapter/stream.h>
+#include <fstream>
+#include <iostream>
+
+enum class MyEnum:uint16_t { V1,V2,V3 };
+struct MyStruct {
+    uint32_t i;
+    MyEnum e;
+    double f;
+};
+
+//define how object should be serialized/deserialized
+template <typename S>
+void serialize(S& s, MyStruct& o) {
+    s.value4b(o.i);
+    s.value2b(o.e);
+    s.value8b(o.f);
+};
+
+using namespace bitsery;
+
+//some helper types
+using Stream = std::fstream;
+using IOAdapter = IOStreamAdapter;
+
+int main() {
+    //set some random data
+    MyStruct data{8941, MyEnum::V2, 0.045};
+    MyStruct res{};
+
+    //open file stream for writing and reading
+    auto fileName = "test_file.bin";
+    Stream s{fileName, s.binary | s.trunc | s.out};
+    if (!s.is_open()) {
+        std::cout << "cannot open " << fileName << " for writing\n";
+        return 0;
+    }
+    //use same quick serialization function
+    //streams do not return written size
+    quickSerialization<IOAdapter>(s, data);
+
+    s.close();
+    //reopen for reading
+
+    s.open(fileName, s.binary | s.in);
+    if (!s.is_open()) {
+        std::cout << "cannot open " << fileName << " for reading\n";
+        return 0;
+    }
+
+    //same as serialization, but returns deserialization state as a pair
+    //first = error code, second = is buffer was successfully read from begin to the end.
+    auto state = quickDeserialization<IOAdapter>(s, res);
+
+    assert(state.first == ReaderError::NoError && state.second);
+    assert(data.f == res.f && data.i == res.i && data.e == res.e);
+}

examples/flexible_assert_linux_x64.cpp

@@ -0,0 +1,45 @@
+#include <bitsery/bitsery.h>
+#include <bitsery/adapter/buffer.h>
+#include <bitsery/flexible.h>
+#include <bitsery/flexible/vector.h>
+
+
+struct MyStruct {
+    int i;
+    unsigned short s;
+    std::vector<long> vl;
+    long long ll;
+
+    template <typename S>
+    void serialize(S& s) {
+        //now we can use flexible syntax with
+        //member function has same name as parameter
+        s.archive(this->s, i, vl, ll);
+    };
+
+};
+
+
+using namespace bitsery;
+
+//some helper types
+using Buffer = std::vector<uint8_t>;
+using OutputAdapter = OutputBufferAdapter<Buffer>;
+using InputAdapter = InputBufferAdapter<Buffer>;
+
+int main() {
+    //this will only work on linux or mac x64
+    bitsery::assertFundamentalTypeSizes<2,4,8,8>();
+    //set some random data
+    MyStruct data{8941, 3, {15l, -8l, 045l}, 8459845ll};
+    MyStruct res{};
+
+    //serialization, deserialization flow is unchanged as in basic usage
+    Buffer buffer;
+    auto writtenSize = quickSerialization<OutputAdapter>(buffer, data);
+
+    auto state = quickDeserialization<InputAdapter>({buffer.begin(), writtenSize}, res);
+
+    assert(state.first == ReaderError::NoError && state.second);
+    assert(data.vl == res.vl && data.s == res.s && data.i == res.i && data.ll == res.ll);
+}

examples/flexible_syntax.cpp

@@ -0,0 +1,47 @@
+#include <bitsery/bitsery.h>
+#include <bitsery/adapter/buffer.h>
+//include flexible header, to use flexible syntax
+#include <bitsery/flexible.h>
+//we also need additional traits to work with container types,
+//instead of including <bitsery/traits/vector.h> for vector traits, now we also need traits to work with flexible types.
+//so include everything from <bitsery/flexible/...> instead of <bitsery/traits/...>
+//otherwise we'll get static assert error, saying to define serialize function.
+#include <bitsery/flexible/vector.h>
+
+enum class MyEnum:uint16_t { V1,V2,V3 };
+struct MyStruct {
+    uint32_t i;
+    MyEnum e;
+    std::vector<float> fs;
+
+    //define serialize function as usual
+    template <typename S>
+    void serialize(S& s) {
+        //now we can use flexible syntax with
+        s.archive(i, e, fs);
+    };
+
+};
+
+
+using namespace bitsery;
+
+//some helper types
+using Buffer = std::vector<uint8_t>;
+using OutputAdapter = OutputBufferAdapter<Buffer>;
+using InputAdapter = InputBufferAdapter<Buffer>;
+
+int main() {
+    //set some random data
+    MyStruct data{8941, MyEnum::V2, {15.0f, -8.5f, 0.045f}};
+    MyStruct res{};
+
+    //serialization, deserialization flow is unchanged as in basic usage
+    Buffer buffer;
+    auto writtenSize = quickSerialization<OutputAdapter>(buffer, data);
+
+    auto state = quickDeserialization<InputAdapter>({buffer.begin(), writtenSize}, res);
+
+    assert(state.first == ReaderError::NoError && state.second);
+    assert(data.fs == res.fs && data.i == res.i && data.e == res.e);
+}

include/bitsery/adapter/buffer.h

@@ -0,0 +1,194 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_ADAPTERS_INPUT_BUFFER_ADAPTER_H
+#define BITSERY_ADAPTERS_INPUT_BUFFER_ADAPTER_H
+
+#include "../details/adapter_common.h"
+#include "../traits/core/traits.h"
+
+namespace bitsery {
+
+    //base class that stores container iterators, and is required for session support (for reading sessions data)
+    template <typename Buffer>
+    class BufferIterators {
+    protected:
+        using TIterator = typename traits::BufferAdapterTraits<Buffer>::TIterator;
+
+        BufferIterators(TIterator begin, TIterator end)
+                :posIt{begin},
+                 endIt{end}
+        {
+        }
+
+        friend details::SessionAccess;
+
+        TIterator posIt;
+        TIterator endIt;
+    };
+
+
+    template <typename Buffer>
+    class InputBufferAdapter: public BufferIterators<Buffer> {
+    public:
+
+        using TIterator = typename BufferIterators<Buffer>::TIterator;
+        using TValue = typename traits::BufferAdapterTraits<Buffer>::TValue;
+        static_assert(details::IsDefined<TValue>::value, "Please define BufferAdapterTraits or include from <bitsery/traits/...>");
+
+        InputBufferAdapter(TIterator begin, TIterator end): BufferIterators<Buffer>(begin, end)
+        {
+        }
+
+        InputBufferAdapter(TIterator begin, size_t size)
+                :InputBufferAdapter(begin, std::next(begin, size))
+        {
+        }
+
+        void read(TValue* data, size_t size) {
+            //for optimization
+            auto tmp = this->posIt;
+            this->posIt += size;
+            if (std::distance(this->posIt, this->endIt) >= 0) {
+                std::memcpy(data, std::addressof(*tmp), size);
+            } else {
+                this->posIt -= size;
+                //set everything to zeros
+                std::memset(data, 0, size);
+
+                if (error() == ReaderError::NoError)
+                    setError(ReaderError::DataOverflow);
+            }
+        }
+
+        ReaderError error() const {
+            auto res = std::distance(this->endIt, this->posIt);
+            if (res > 0) {
+                auto err = static_cast<ReaderError>(res);
+                return err;
+            }
+            return ReaderError::NoError;
+        }
+
+        void setError(ReaderError error) {
+            this->endIt = this->posIt;
+            //to avoid creating temporary for error state, mark an error by passing posIt after the endIt
+            std::advance(this->posIt, static_cast<size_t>(error));
+        }
+
+        bool isCompletedSuccessfully() const {
+            return this->posIt == this->endIt;
+        }
+    };
+
+
+    template<typename Container>
+    class OutputBufferAdapter {
+    public:
+
+        using TIterator = typename traits::BufferAdapterTraits<Container>::TIterator;
+        using TValue = typename traits::BufferAdapterTraits<Container>::TValue;
+
+        static_assert(details::IsDefined<TValue>::value, "Please define BufferAdapterTraits or include from <bitsery/traits/...>");
+
+        OutputBufferAdapter(Container &buffer)
+                : _buffer{buffer}
+        {
+
+            init(TResizable{});
+        }
+
+
+        void write(const TValue *data, size_t size) {
+            writeInternal(data, size, TResizable{});
+        }
+
+        void flush() {
+            //this function might be useful for stream adapters
+        }
+
+        size_t writtenBytesCount() const {
+            return static_cast<size_t>(std::distance(std::begin(_buffer), _outIt));
+        }
+
+    private:
+        using TResizable = std::integral_constant<bool, traits::ContainerTraits<Container>::isResizable>;
+
+        Container &_buffer;
+        TIterator _outIt;
+        TIterator _end;
+
+        /*
+         * resizable buffer
+         */
+
+        void init(std::true_type) {
+            //resize buffer immediately, because we need output iterator at valid position
+            if (traits::ContainerTraits<Container>::size(_buffer) == 0u) {
+                traits::BufferAdapterTraits<Container>::increaseBufferSize(_buffer);
+            }
+            _end = std::end(_buffer);
+            _outIt = std::begin(_buffer);
+        }
+
+        void writeInternal(const TValue *data, const size_t size, std::true_type) {
+            //optimization
+            auto tmp = _outIt;
+            _outIt += size;
+            if (std::distance(_outIt , _end) >= 0) {
+                std::memcpy(std::addressof(*tmp), data, size);
+            } else {
+                _outIt -= size;
+                //get current position before invalidating iterators
+                const auto pos = std::distance(std::begin(_buffer), _outIt);
+                //increase container size
+                traits::BufferAdapterTraits<Container>::increaseBufferSize(_buffer);
+                //restore iterators
+                _end = std::end(_buffer);
+                _outIt = std::next(std::begin(_buffer), pos);
+
+                writeInternal(data, size, std::true_type{});
+            }
+        }
+
+        /*
+         * non resizable buffer
+         */
+        void init(std::false_type) {
+            _outIt = std::begin(_buffer);
+            _end = std::end(_buffer);
+        }
+
+        void writeInternal(const TValue *data, size_t size, std::false_type) {
+            //optimization
+            auto tmp = _outIt;
+            _outIt += size;
+            assert(std::distance(_outIt, _end) >= 0);
+            memcpy(std::addressof(*tmp), data, size);
+        }
+    };
+
+
+}
+
+#endif //BITSERY_ADAPTERS_INPUT_BUFFER_ADAPTER_H

include/bitsery/adapter/stream.h

@@ -0,0 +1,122 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_ADAPTERS_DYNAMIC_STREAM_H
+#define BITSERY_ADAPTERS_DYNAMIC_STREAM_H
+
+#include "../details/adapter_common.h"
+#include "../traits/core/traits.h"
+#include <ios>
+
+
+namespace bitsery {
+
+    template <typename TChar, typename CharTraits>
+    class BasicInputStreamAdapter {
+    public:
+        using TValue = TChar;
+        using TIterator = void;//TIterator is used with sessions, but streams cannot be used with sessions
+
+        BasicInputStreamAdapter(std::basic_ios<TChar, CharTraits>& istream)
+                :_ios{istream} {}
+
+        void read(TValue* data, size_t size) {
+            if (static_cast<size_t>(_ios.rdbuf()->sgetn( data , size )) != size)
+                *data = {};
+        }
+
+        ReaderError error() const {
+            if (_ios.good())
+                return ReaderError::NoError;
+            return _ios.eof()
+                   ? ReaderError::DataOverflow
+                   : ReaderError::ReadingError;
+        }
+        bool isCompletedSuccessfully() const {
+            if (error() == ReaderError::NoError) {
+                return _ios.rdbuf()->sgetc() == CharTraits::eof();
+            }
+            return false;
+        }
+        void setError(ReaderError error) {
+            //has no effect when using
+        }
+
+    private:
+        std::basic_ios<TChar, CharTraits>& _ios;
+    };
+
+    template <typename TChar, typename CharTraits>
+    class BasicOutputStreamAdapter {
+    public:
+        using TValue = TChar;
+        using TIterator = void;//TIterator is used with sessions, but streams cannot be used with sessions
+
+        BasicOutputStreamAdapter(std::basic_ios<TChar, CharTraits>& ostream):_ios{ostream} {}
+
+        void write(const TValue* data, size_t size) {
+            //for optimization
+            _ios.rdbuf()->sputn( data , size );
+        }
+
+        void flush() {
+            if (auto ostream = dynamic_cast<std::basic_ostream<TChar, CharTraits>*>(&_ios))
+                ostream->flush();
+        }
+
+        size_t writtenBytesCount() const {
+            //streaming doesn't return written bytes
+            return 0;
+        }
+
+        //this method is only for stream writing
+        bool isValidState() const {
+            return !_ios.bad();
+        }
+
+    private:
+        std::basic_ios<TChar, CharTraits>& _ios;
+    };
+
+    template <typename TChar, typename CharTraits>
+    class BasicIOStreamAdapter:public BasicInputStreamAdapter<TChar, CharTraits>, public BasicOutputStreamAdapter<TChar, CharTraits> {
+    public:
+        using TValue = TChar;
+        using TIterator = void;//TIterator is used with sessions, but streams cannot be used with sessions
+
+        //both bases contain reference to same iostream, so no need to do anything
+        BasicIOStreamAdapter(std::basic_ios<TChar, CharTraits>& iostream)
+                :BasicInputStreamAdapter<TChar, CharTraits>{iostream},
+                 BasicOutputStreamAdapter<TChar, CharTraits>{iostream} {
+
+        }
+    };
+
+
+    //helper types for most common implementations for std streams
+    using OutputStreamAdapter = BasicOutputStreamAdapter<char, std::char_traits<char>>;
+    using InputStreamAdapter = BasicInputStreamAdapter<char, std::char_traits<char>>;
+    using IOStreamAdapter = BasicIOStreamAdapter<char, std::char_traits<char>>;
+}
+
+#endif //BITSERY_ADAPTERS_DYNAMIC_STREAM_H

include/bitsery/adapter_reader.h

@@ -0,0 +1,269 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+
+#ifndef BITSERY_BASIC_READER_H
+#define BITSERY_BASIC_READER_H
+
+#include "details/sessions.h"
+#include <algorithm>
+#include <cstring>
+
+
+namespace bitsery {
+
+    template <typename TReader>
+    class AdapterReaderBitPackingWrapper;
+
+    template<typename InputAdapter, typename Config>
+    struct AdapterReader {
+        //this is required by deserializer
+        static constexpr bool BitPackingEnabled = false;
+
+        using TValue = typename InputAdapter::TValue;
+
+        static_assert(details::IsDefined<TValue>::value, "Please define adapter traits or include from <bitsery/traits/...>");
+
+        using TIterator = typename InputAdapter::TIterator;// used by session reader
+
+        explicit AdapterReader(InputAdapter&& adapter)
+                : _inputAdapter{std::move(adapter)},
+                  _session{*this, _inputAdapter}
+        {
+        }
+
+        AdapterReader(const AdapterReader &) = delete;
+
+        AdapterReader &operator=(const AdapterReader &) = delete;
+
+        //todo add conditional noexcept
+        AdapterReader(AdapterReader &&) = default;
+
+        AdapterReader &operator=(AdapterReader &&) = default;
+
+        ~AdapterReader() noexcept = default;
+
+
+        template<size_t SIZE, typename T>
+        void readBytes(T &v) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            directRead(&v, 1);
+        }
+
+        template<size_t SIZE, typename T>
+        void readBuffer(T *buf, size_t count) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            directRead(buf, count);
+        }
+
+        template<typename T>
+        void readBits(T &, size_t ) {
+            static_assert(std::is_void<T>::value,
+                          "Bit-packing is not enabled.\nEnable by call to `enableBitPacking`) or create Deserializer with bit packing enabled.");
+        }
+
+        void align() {
+        }
+
+        bool isCompletedSuccessfully() const {
+            return _inputAdapter.isCompletedSuccessfully() && !_session.hasActiveSessions();
+        }
+
+        ReaderError error() const {
+            auto err = _inputAdapter.error();
+            if (err == ReaderError::DataOverflow && _session.hasActiveSessions())
+                return ReaderError::NoError;
+            return err;
+        }
+
+        void setError(ReaderError error) {
+            return _inputAdapter.setError(error);
+        }
+
+        void beginSession() {
+            if (error() == ReaderError::NoError) {
+                _session.begin();
+            }
+        }
+
+        void endSession() {
+            if (error() == ReaderError::NoError) {
+                _session.end();
+            }
+        }
+
+        const InputAdapter& adapter() const {
+            return _inputAdapter;
+        }
+
+    private:
+        friend class AdapterReaderBitPackingWrapper<AdapterReader<InputAdapter, Config>>;
+
+        InputAdapter _inputAdapter;
+        typename std::conditional<Config::BufferSessionsEnabled,
+                session::SessionsReader<AdapterReader<InputAdapter, Config>>,
+                session::DisabledSessionsReader<AdapterReader<InputAdapter, Config>>>::type
+                _session;
+
+        template<typename T>
+        void directRead(T *v, size_t count) {
+            static_assert(!std::is_const<T>::value, "");
+            _inputAdapter.read(reinterpret_cast<TValue *>(v), sizeof(T) * count);
+            //swap each byte if nessesarry
+            _swapDataBits(v, count, std::integral_constant<bool,
+                    Config::NetworkEndianness != details::getSystemEndianness()>{});
+        }
+
+        template<typename T>
+        void _swapDataBits(T *v, size_t count, std::true_type) {
+            std::for_each(v, std::next(v, count), [this](T &x) { x = details::swap(x); });
+        }
+
+        template<typename T>
+        void _swapDataBits(T *v, size_t count, std::false_type) {
+            //empty function because no swap is required
+        }
+
+    };
+
+    template<typename TReader>
+    struct AdapterReaderBitPackingWrapper {
+        //this is required by deserializer
+        static constexpr bool BitPackingEnabled = true;
+        //make TValue unsigned for bitpacking
+        using UnsignedValue = typename std::make_unsigned<typename TReader::TValue>::type;
+        using ScratchType = typename details::ScratchType<UnsignedValue>::type;
+        static_assert(details::IsDefined<ScratchType>::value, "Underlying adapter value type is not supported");
+
+        explicit AdapterReaderBitPackingWrapper(TReader& reader):_reader{reader}
+        {
+        }
+
+        AdapterReaderBitPackingWrapper(const AdapterReaderBitPackingWrapper&) = delete;
+        AdapterReaderBitPackingWrapper& operator = (const AdapterReaderBitPackingWrapper&) = delete;
+
+        AdapterReaderBitPackingWrapper(AdapterReaderBitPackingWrapper&& ) noexcept = default;
+        AdapterReaderBitPackingWrapper& operator = (AdapterReaderBitPackingWrapper&& ) noexcept = default;
+
+        ~AdapterReaderBitPackingWrapper() {
+            align();
+        }
+
+        template<size_t SIZE, typename T>
+        void readBytes(T &v) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            using UT = typename std::make_unsigned<T>::type;
+            if (!m_scratchBits)
+                _reader.template readBytes<SIZE,T>(v);
+            else
+                readBits(reinterpret_cast<UT &>(v), details::BitsSize<T>::value);
+        }
+
+        template<size_t SIZE, typename T>
+        void readBuffer(T *buf, size_t count) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+
+            if (!m_scratchBits) {
+                _reader.template readBuffer<SIZE,T>(buf, count);
+            } else {
+                using UT = typename std::make_unsigned<T>::type;
+                //todo improve implementation
+                const auto end = buf + count;
+                for (auto it = buf; it != end; ++it)
+                    readBits(reinterpret_cast<UT &>(*it), details::BitsSize<T>::value);
+            }
+        }
+
+
+        template<typename T>
+        void readBits(T &v, size_t bitsCount) {
+            static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
+            readBitsInternal(v, bitsCount);
+        }
+
+        void align() {
+            if (m_scratchBits) {
+                ScratchType tmp{};
+                readBitsInternal(tmp, m_scratchBits);
+                if (tmp)
+                    setError(ReaderError::InvalidData);
+            }
+        }
+
+        bool isCompletedSuccessfully() const {
+            return _reader.isCompletedSuccessfully();
+        }
+
+        ReaderError error() const {
+            return _reader.error();
+        }
+
+        void setError(ReaderError error) {
+            _reader.setError(error);
+        }
+
+        void beginSession() {
+            align();
+            _reader.beginSession();
+        }
+
+        void endSession() {
+            align();
+            _reader.endSession();
+        }
+
+    private:
+        TReader& _reader;
+        ScratchType m_scratch{};
+        size_t m_scratchBits{};
+
+        template<typename T>
+        void readBitsInternal(T &v, size_t size) {
+            auto bitsLeft = size;
+            T res{};
+            while (bitsLeft > 0) {
+                auto bits = std::min(bitsLeft, details::BitsSize<UnsignedValue>::value);
+                if (m_scratchBits < bits) {
+                    UnsignedValue tmp;
+                    _reader.template readBytes<sizeof(UnsignedValue), UnsignedValue>(tmp);
+                    m_scratch |= static_cast<ScratchType>(tmp) << m_scratchBits;
+                    m_scratchBits += details::BitsSize<UnsignedValue>::value;
+                }
+                auto shiftedRes =
+                        static_cast<T>(m_scratch & ((static_cast<ScratchType>(1) << bits) - 1)) << (size - bitsLeft);
+                res |= shiftedRes;
+                m_scratch >>= bits;
+                m_scratchBits -= bits;
+                bitsLeft -= bits;
+            }
+            v = res;
+        }
+
+    };
+}
+
+#endif //BITSERY_BUFFER_READER_H

include/bitsery/adapter_writer.h

@@ -0,0 +1,337 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+
+#ifndef BITSERY_BASIC_WRITER_H
+#define BITSERY_BASIC_WRITER_H
+
+#include "details/sessions.h"
+
+#include <cassert>
+#include <utility>
+
+
+namespace bitsery {
+
+    struct MeasureSize {
+        //measure class is bit-packing enabled, no need to create wrapper for it
+        static constexpr bool BitPackingEnabled = true;
+
+        template<size_t SIZE, typename T>
+        void writeBytes(const T &) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            _bitsCount += details::BitsSize<T>::value;
+        }
+
+        template<typename T>
+        void writeBits(const T &, size_t bitsCount) {
+            static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
+            assert(bitsCount <= details::BitsSize<T>::value);
+            _bitsCount += bitsCount;
+        }
+
+        template<size_t SIZE, typename T>
+        void writeBuffer(const T *, size_t count) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            _bitsCount += details::BitsSize<T>::value * count;
+        }
+
+        void align() {
+            auto _scratch = (_bitsCount % 8);
+            _bitsCount += (8 - _scratch) % 8;
+        }
+
+        void flush() {
+            align();
+            //flush sessions count
+            if (_sessionsBytesCount > 0) {
+                _bitsCount += (_sessionsBytesCount + 4) * 8;
+                _sessionsBytesCount = 0;
+            }
+        }
+
+        void beginSession() {
+
+        }
+
+        void endSession() {
+            auto endPos = writtenBytesCount();
+            details::writeSize(*this, endPos);
+            auto sessionEndBytesCount = writtenBytesCount() - endPos;
+            //remove written bytes, because we'll write them at the end
+            _bitsCount -= sessionEndBytesCount * 8;
+            _sessionsBytesCount += sessionEndBytesCount;
+        }
+
+        //get size in bytes
+        size_t writtenBytesCount() const {
+            return _bitsCount / 8;
+        }
+
+    private:
+        size_t _bitsCount{};
+        size_t _sessionsBytesCount{};
+    };
+
+
+    template <typename TWriter>
+    class AdapterWriterBitPackingWrapper;
+
+    template<typename OutputAdapter, typename Config>
+    struct AdapterWriter {
+        //this is required by serializer
+        static constexpr bool BitPackingEnabled = false;
+
+        using TValue = typename OutputAdapter::TValue;
+
+        static_assert(details::IsDefined<TValue>::value, "Please define adapter traits or include from <bitsery/traits/...>");
+
+        explicit AdapterWriter(OutputAdapter&& adapter)
+                : _outputAdapter{std::move(adapter)}
+        {
+        }
+
+        AdapterWriter(const AdapterWriter &) = delete;
+
+        AdapterWriter &operator=(const AdapterWriter &) = delete;
+
+        //todo add conditional noexcept
+        AdapterWriter(AdapterWriter &&) = default;
+
+        AdapterWriter &operator=(AdapterWriter &&) = default;
+
+        ~AdapterWriter() {
+            flush();
+        }
+
+        template<size_t SIZE, typename T>
+        void writeBytes(const T &v) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            directWrite(&v, 1);
+
+        }
+
+        template<size_t SIZE, typename T>
+        void writeBuffer(const T *buf, size_t count) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            directWrite(buf, count);
+        }
+
+        template<typename T>
+        void writeBits(const T &, size_t ) {
+            static_assert(std::is_void<T>::value,
+                          "Bit-packing is not enabled.\nEnable by call to `enableBitPacking`) or create Serializer with bit packing enabled.");
+        }
+
+        //to have the same interface as bitpackingwriter
+        void align() {
+
+        }
+
+        void flush() {
+            _session.flushSessions(*this);
+            _outputAdapter.flush();
+        }
+
+        size_t writtenBytesCount() const {
+            return _outputAdapter.writtenBytesCount();
+        }
+
+        void beginSession() {
+            _session.begin(*this);
+        }
+
+        void endSession() {
+            _session.end(*this);
+        }
+
+        const OutputAdapter& adapter() const {
+            return _outputAdapter;
+        }
+
+    private:
+        friend class AdapterWriterBitPackingWrapper<AdapterWriter<OutputAdapter, Config>>;
+        template<typename T>
+        void directWrite(T &&v, size_t count) {
+            _directWriteSwapTag(std::forward<T>(v), count, std::integral_constant<bool,
+                    Config::NetworkEndianness != details::getSystemEndianness()>{});
+        }
+
+        template<typename T>
+        void _directWriteSwapTag(const T *v, size_t count, std::true_type) {
+            std::for_each(v, std::next(v, count), [this](const T &v) {
+                const auto res = details::swap(v);
+                _outputAdapter.write(reinterpret_cast<const TValue *>(&res), sizeof(T));
+            });
+        }
+
+        template<typename T>
+        void _directWriteSwapTag(const T *v, size_t count, std::false_type) {
+            _outputAdapter.write(reinterpret_cast<const TValue *>(v), count * sizeof(T));
+        }
+
+        OutputAdapter _outputAdapter;
+        typename std::conditional<Config::BufferSessionsEnabled,
+                session::SessionsWriter<AdapterWriter<OutputAdapter, Config >>,
+                session::DisabledSessionsWriter<AdapterWriter<OutputAdapter, Config>>>::type
+                _session{};
+    };
+
+    //this class is used as wrapper for real AdapterWriter, it doesn't store writer itself just a reference
+    template<typename TWriter>
+    class AdapterWriterBitPackingWrapper {
+    public:
+        //this is required by serializer
+        static constexpr bool BitPackingEnabled = true;
+
+        //make TValue unsigned for bit packing
+        using UnsignedType = typename std::make_unsigned<typename TWriter::TValue>::type;
+        using ScratchType = typename details::ScratchType<UnsignedType>::type;
+        static_assert(details::IsDefined<ScratchType>::value, "Underlying adapter value type is not supported");
+
+        explicit AdapterWriterBitPackingWrapper(TWriter &writer)
+                : _writer{writer}
+        {
+        }
+
+        AdapterWriterBitPackingWrapper(const AdapterWriterBitPackingWrapper&) = delete;
+        AdapterWriterBitPackingWrapper& operator = (const AdapterWriterBitPackingWrapper&) = delete;
+
+        AdapterWriterBitPackingWrapper(AdapterWriterBitPackingWrapper&& ) noexcept = default;
+        AdapterWriterBitPackingWrapper& operator = (AdapterWriterBitPackingWrapper&& ) noexcept = default;
+
+        ~AdapterWriterBitPackingWrapper() {
+            align();
+        }
+
+        template<size_t SIZE, typename T>
+        void writeBytes(const T &v) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+
+            if (!_scratchBits) {
+                _writer.template writeBytes<SIZE,T>(v);
+            } else {
+                using UT = typename std::make_unsigned<T>::type;
+                writeBitsInternal(reinterpret_cast<const UT &>(v), details::BitsSize<T>::value);
+            }
+        }
+
+        template<size_t SIZE, typename T>
+        void writeBuffer(const T *buf, size_t count) {
+            static_assert(std::is_integral<T>(), "");
+            static_assert(sizeof(T) == SIZE, "");
+            if (!_scratchBits) {
+                _writer.template writeBuffer<SIZE,T>(buf, count);
+            } else {
+                using UT = typename std::make_unsigned<T>::type;
+                //todo improve implementation
+                const auto end = buf + count;
+                for (auto it = buf; it != end; ++it)
+                    writeBitsInternal(reinterpret_cast<const UT &>(*it), details::BitsSize<T>::value);
+            }
+        }
+
+        template<typename T>
+        void writeBits(const T &v, size_t bitsCount) {
+            static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
+            assert(0 < bitsCount && bitsCount <= details::BitsSize<T>::value);
+            assert(v <= (bitsCount < 64
+                         ? (1ULL << bitsCount) - 1
+                         : (1ULL << (bitsCount-1)) + ((1ULL << (bitsCount-1)) -1)));
+            writeBitsInternal(v, bitsCount);
+        }
+
+        void align() {
+            writeBitsInternal(UnsignedType{}, (details::BitsSize<UnsignedType>::value - _scratchBits) % 8);
+        }
+
+        void flush() {
+            align();
+            _writer._session.flushSessions(_writer);
+        }
+
+        size_t writtenBytesCount() const {
+            return _writer.writtenBytesCount();
+        }
+
+        void beginSession() {
+            align();
+            _writer._session.begin(_writer);
+        }
+
+        void endSession() {
+            align();
+            _writer._session.end(_writer);
+        }
+
+    private:
+
+        template<typename T>
+        void writeBitsInternal(const T &v, size_t size) {
+            constexpr size_t valueSize = details::BitsSize<UnsignedType>::value;
+            auto value = v;
+            auto bitsLeft = size;
+            while (bitsLeft > 0) {
+                auto bits = std::min(bitsLeft, valueSize);
+                _scratch |= static_cast<ScratchType>( value ) << _scratchBits;
+                _scratchBits += bits;
+                if (_scratchBits >= valueSize) {
+                    auto tmp = static_cast<UnsignedType>(_scratch & _MASK);
+                    _writer.template writeBytes<sizeof(UnsignedType), UnsignedType >(tmp);
+                    _scratch >>= valueSize;
+                    _scratchBits -= valueSize;
+
+                    value >>= valueSize;
+                }
+                bitsLeft -= bits;
+            }
+        }
+
+        //overload for TValue, for better performance
+        void writeBitsInternal(const UnsignedType &v, size_t size) {
+            if (size > 0) {
+                _scratch |= static_cast<ScratchType>( v ) << _scratchBits;
+                _scratchBits += size;
+                if (_scratchBits >= details::BitsSize<UnsignedType>::value) {
+                    auto tmp = static_cast<UnsignedType>(_scratch & _MASK);
+                    _writer.template writeBytes<sizeof(UnsignedType), UnsignedType>(tmp);
+                    _scratch >>= details::BitsSize<UnsignedType>::value;
+                    _scratchBits -= details::BitsSize<UnsignedType>::value;
+                }
+            }
+        }
+
+        const UnsignedType _MASK = std::numeric_limits<UnsignedType>::max();
+        ScratchType _scratch{};
+        size_t _scratchBits{};
+        TWriter& _writer;
+
+    };
+}
+
+#endif //BITSERY_BASIC_WRITER_H

include/bitsery/bitsery.h

@@ -24,9 +24,9 @@
 #ifndef BITSERY_BITSERY_H
 #define BITSERY_BITSERY_H
 
-#define BITSERY_MAJOR_VERSION 1
-#define BITSERY_MINOR_VERSION 1
-#define BITSERY_PATCH_VERSION 1
+#define BITSERY_MAJOR_VERSION 4
+#define BITSERY_MINOR_VERSION 0
+#define BITSERY_PATCH_VERSION 0
 
 #define BITSERY_QUOTE_MACRO(name) #name
 #define BITSERY_BUILD_VERSION_STR(major,minor, patch) \
@@ -37,9 +37,6 @@ BITSERY_QUOTE_MACRO(patch)
 #define BITSERY_VERSION \
 BITSERY_BUILD_VERSION_STR(BITSERY_MAJOR_VERSION, BITSERY_MINOR_VERSION, BITSERY_PATCH_VERSION)
 
-
-#include "buffer_writer.h"
-#include "buffer_reader.h"
 #include "serializer.h"
 #include "deserializer.h"
 

include/bitsery/buffer_reader.h

@@ -1,178 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-
-#ifndef BITSERY_BUFFER_READER_H
-#define BITSERY_BUFFER_READER_H
-
-#include "common.h"
-
-#include <cassert>
-#include <algorithm>
-
-namespace bitsery {
-
-    template <typename Config>
-    struct BasicBufferReader {
-        using ValueType = typename Config::BufferValueType;
-        using ScratchType = typename Config::BufferScrathType;
-
-        BasicBufferReader(const ValueType* data, size_t size) : _pos{data}, _end{data + size}
-        {
-            static_assert(std::is_unsigned<ValueType>(), "Config::BufferValueType must be unsigned");
-            static_assert(std::is_unsigned<ScratchType>(), "Config::BufferScrathType must be unsigned");
-            static_assert(sizeof(ValueType)*2 == sizeof(ScratchType), "ScratchType must be 2x bigger than value type");
-            static_assert(sizeof(ValueType) == 1, "currently only supported BufferValueType is 1 byte");
-        }
-
-        explicit BasicBufferReader(const std::vector<ValueType> &buf) : BasicBufferReader(buf.data(), buf.size()) {
-        }
-
-        template <size_t N>
-        explicit BasicBufferReader(const ValueType (&data)[N]): BasicBufferReader(data, N)
-        {
-        }
-
-        BasicBufferReader(const BasicBufferReader&) = delete;
-        BasicBufferReader& operator=(const BasicBufferReader& ) = delete;
-        BasicBufferReader(BasicBufferReader&&) noexcept = default;
-        BasicBufferReader& operator=(BasicBufferReader&&) noexcept = default;
-        ~BasicBufferReader() noexcept = default;
-
-
-        template<size_t SIZE, typename T>
-        bool readBytes(T &v) {
-            static_assert(std::is_integral<T>(), "");
-            static_assert(sizeof(T) == SIZE, "");
-            using UT = typename std::make_unsigned<T>::type;
-            return !m_scratch
-                   ? directRead(&v, 1)
-                   : readBits(reinterpret_cast<UT &>(v), details::BITS_SIZE<T>);
-        }
-
-        template<size_t SIZE, typename T>
-        bool readBuffer(T *buf, size_t count) {
-            static_assert(std::is_integral<T>(), "");
-            static_assert(sizeof(T) == SIZE, "");
-
-            if (!m_scratchBits)
-                return directRead(buf, count);
-
-            using UT = typename std::make_unsigned<T>::type;
-            //todo improve implementation
-            const auto end = buf + count;
-            for (auto it = buf; it != end; ++it) {
-                if (!readBits(reinterpret_cast<UT &>(*it), details::BITS_SIZE<T>))
-                    return false;
-            }
-            return true;
-        }
-
-
-        template<typename T>
-        bool readBits(T &v, size_t bitsCount) {
-            static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
-            assert(bitsCount <= details::BITS_SIZE<T>);
-
-            const auto bytesRequired = bitsCount > m_scratchBits
-                                       ? ((bitsCount - 1 - m_scratchBits) >> 3) + 1u
-                                       : 0u;
-            if (static_cast<size_t>(std::distance(_pos, _end)) < bytesRequired)
-                return false;
-            readBitsInternal(v, bitsCount);
-            return true;
-        }
-
-        bool align() {
-            if (m_scratchBits) {
-                ScratchType tmp{};
-                readBitsInternal(tmp, m_scratchBits);
-                return tmp == 0;
-            }
-            return true;
-        }
-
-        bool isCompleted() const {
-            return _pos == _end;
-        }
-
-    private:
-        const ValueType* _pos;
-        const ValueType* _end;
-
-        template<typename T>
-        bool directRead(T *v, size_t count) {
-            static_assert(!std::is_const<T>::value, "");
-            const auto bytesCount = sizeof(T) * count;
-            if (static_cast<size_t>(std::distance(_pos, _end)) < bytesCount)
-                return false;
-            //read from buffer, to data ptr,
-            std::copy_n(_pos, bytesCount, reinterpret_cast<ValueType *>(v));
-            std::advance(_pos, bytesCount);
-            //swap each byte if nessesarry
-            _swapDataBits(v, count, std::integral_constant<bool,
-                    Config::NetworkEndianness != details::getSystemEndianness()>{});
-            return true;
-        }
-
-        template<typename T>
-        void _swapDataBits(T *v, size_t count, std::true_type) {
-            std::for_each(v, std::next(v, count), [this](T& v) { v = details::swap(v); });
-        }
-
-        template<typename T>
-        void _swapDataBits(T *v, size_t count, std::false_type) {
-            //empty function because no swap is required
-        }
-
-        template<typename T>
-        void readBitsInternal(T &v, size_t size) {
-            auto bitsLeft = size;
-            T res{};
-            while (bitsLeft > 0) {
-                auto bits = std::min(bitsLeft, details::BITS_SIZE<ValueType>);
-                if (m_scratchBits < bits) {
-                    ValueType tmp;
-                    directRead(&tmp, 1);
-                    m_scratch |= static_cast<ScratchType>(tmp) << m_scratchBits;
-                    m_scratchBits += details::BITS_SIZE<ValueType>;
-                }
-                auto shiftedRes =
-                        static_cast<T>(m_scratch & ((static_cast<ScratchType>(1) << bits) - 1)) << (size - bitsLeft);
-                res |= shiftedRes;
-                m_scratch >>= bits;
-                m_scratchBits -= bits;
-                bitsLeft -= bits;
-            }
-            v = res;
-        }
-
-        ScratchType m_scratch{};
-        size_t m_scratchBits{};                                    ///< Number of bits currently in the scratch buffer. If the user wants to read more bits than this, we have to go fetch another dword from memory.
-
-    };
-    //helper type
-    using BufferReader = BasicBufferReader<DefaultConfig>;
-}
-
-#endif //BITSERY_BUFFER_READER_H

include/bitsery/buffer_writer.h

@@ -1,205 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-
-#ifndef BITSERY_BUFFER_WRITER_H
-#define BITSERY_BUFFER_WRITER_H
-
-#include "common.h"
-#include <cassert>
-#include <algorithm>
-#include <iterator>
-#include <utility>
-
-namespace bitsery {
-
-    struct MeasureSize {
-
-        template<size_t SIZE, typename T>
-        void writeBytes(const T &) {
-            static_assert(std::is_integral<T>(), "");
-            static_assert(sizeof(T) == SIZE, "");
-            _bitsCount += details::BITS_SIZE<T>;
-        }
-
-        template<typename T>
-        void writeBits(const T &, size_t bitsCount) {
-            static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
-            assert(bitsCount <= details::BITS_SIZE<T>);
-            _bitsCount += bitsCount;
-        }
-
-        template<size_t SIZE, typename T>
-        void writeBuffer(const T *, size_t count) {
-            static_assert(std::is_integral<T>(), "");
-            static_assert(sizeof(T) == SIZE, "");
-            _bitsCount += details::BITS_SIZE<T> * count;
-        }
-
-        //get size in bytes
-        size_t getSize() const {
-            return _bitsCount / 8;
-        }
-
-    private:
-        size_t _bitsCount{};
-
-    };
-
-    template <typename Config>
-    struct BasicBufferWriter {
-        using ValueType = typename Config::BufferValueType;
-        using ScratchType = typename Config::BufferScrathType;
-
-        explicit BasicBufferWriter(std::vector<ValueType> &buffer) : _outIt{std::back_inserter(buffer)} {
-            static_assert(std::is_unsigned<ValueType>(), "Config::BufferValueType must be unsigned");
-            static_assert(std::is_unsigned<ScratchType>(), "Config::BufferScrathType must be unsigned");
-            static_assert(sizeof(ValueType)*2 == sizeof(ScratchType), "ScratchType must be 2x bigger than value type");
-            static_assert(sizeof(ValueType) == 1, "currently only supported BufferValueType is 1 byte");
-        }
-
-        BasicBufferWriter(const BasicBufferWriter&) = delete;
-        BasicBufferWriter& operator=(const BasicBufferWriter& ) = delete;
-        BasicBufferWriter(BasicBufferWriter&&) noexcept = default;
-        BasicBufferWriter& operator=(BasicBufferWriter&&) noexcept = default;
-        ~BasicBufferWriter() noexcept = default;
-
-        template<size_t SIZE, typename T>
-        void writeBytes(const T &v) {
-            static_assert(std::is_integral<T>(), "");
-            static_assert(sizeof(T) == SIZE, "");
-
-            if (!_scratchBits) {
-                directWrite(&v, 1);
-            } else {
-                using UT = typename std::make_unsigned<T>::type;
-                writeBits(reinterpret_cast<const UT &>(v), details::BITS_SIZE<T>);
-            }
-        }
-
-        template<size_t SIZE, typename T>
-        void writeBuffer(const T *buf, size_t count) {
-            static_assert(std::is_integral<T>(), "");
-            static_assert(sizeof(T) == SIZE, "");
-            if (!_scratchBits) {
-                directWrite(buf, count);
-            } else {
-                using UT = typename std::make_unsigned<T>::type;
-                //todo improve implementation
-                const auto end = buf + count;
-                for (auto it = buf; it != end; ++it)
-                    writeBits(reinterpret_cast<const UT &>(*it), details::BITS_SIZE<T>);
-            }
-        }
-
-        template<typename T>
-        void writeBits(const T &v, size_t bitsCount) {
-            static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
-            assert(0 < bitsCount && bitsCount <= details::BITS_SIZE<T>);
-            assert(v <= ((1ULL << bitsCount) - 1));
-            writeBitsInternal(v, bitsCount);
-        }
-
-        void align() {
-            if (_scratchBits)
-                writeBitsInternal(ValueType{}, details::BITS_SIZE<ValueType> - _scratchBits);
-        }
-
-        void flush() {
-            if (_scratchBits) {
-                auto tmp = static_cast<ValueType>( _scratch & _MASK );
-                directWrite(&tmp, 1);
-                _scratch >>= _scratchBits;
-                _scratchBits -= _scratchBits;
-            }
-        }
-
-
-    private:
-
-        template<typename T>
-        void directWrite(T&& v, size_t count) {
-            _directWriteSwapTag(std::forward<T>(v), count, std::integral_constant<bool,
-                    Config::NetworkEndianness != details::getSystemEndianness()>{});
-        }
-
-        template<typename T>
-        void _directWriteSwapTag(const T *v, size_t count, std::true_type) {
-            std::for_each(v, std::next(v, count), [this](const T& v) {
-                const auto res = details::swap(v);
-                std::copy_n(reinterpret_cast<const ValueType*>(&res), sizeof(T), _outIt);
-            });
-        }
-
-        template<typename T>
-        void _directWriteSwapTag(const T *v, size_t count, std::false_type) {
-            std::copy_n(reinterpret_cast<const ValueType*>(v), count * sizeof(T), _outIt);
-        }
-
-        template<typename T>
-        void writeBitsInternal(const T &v, size_t size) {
-            constexpr size_t valueSize = details::BITS_SIZE<ValueType>;
-            auto value = v;
-            auto bitsLeft = size;
-            while (bitsLeft > 0) {
-                auto bits = std::min(bitsLeft, valueSize);
-                _scratch |= static_cast<ScratchType>( value ) << _scratchBits;
-                _scratchBits += bits;
-                if (_scratchBits >= valueSize) {
-                    auto tmp = static_cast<ValueType>(_scratch & _MASK);
-                    directWrite(&tmp, 1);
-                    _scratch >>= valueSize;
-                    _scratchBits -= valueSize;
-
-                    value >>= valueSize;
-                }
-                bitsLeft -= bits;
-            }
-        }
-
-        //overload for ValueType, for better performance
-        void writeBitsInternal(const ValueType &v, size_t size) {
-            if (size > 0) {
-                _scratch |= static_cast<ScratchType>( v ) << _scratchBits;
-                _scratchBits += size;
-                if (_scratchBits >= details::BITS_SIZE<ValueType>) {
-                    auto tmp = static_cast<ValueType>(_scratch & _MASK);
-                    directWrite(&tmp, 1);
-                    _scratch >>= details::BITS_SIZE<ValueType>;
-                    _scratchBits -= details::BITS_SIZE<ValueType>;
-                }
-            }
-        }
-
-
-        const ValueType _MASK = std::numeric_limits<ValueType>::max();
-        std::back_insert_iterator<std::vector<ValueType>> _outIt;
-        ScratchType _scratch{};
-        size_t _scratchBits{};
-    };
-
-    //helper type
-    using BufferWriter = BasicBufferWriter<DefaultConfig>;
-}
-
-#endif //BITSERY_BUFFER_WRITER_H

include/bitsery/common.h

@@ -24,24 +24,26 @@
 #ifndef BITSERY_COMMON_H
 #define BITSERY_COMMON_H
 
-#include "bitsery/details/buffer_common.h"
-
 namespace bitsery {
 
-    struct DefaultConfig {
-        static constexpr EndiannessType NetworkEndianness = EndiannessType::LittleEndian;
-        using BufferValueType = uint8_t;
-        using BufferScrathType = uint16_t;
+/*
+ * endianess
+ */
+    enum class EndiannessType {
+        LittleEndian,
+        BigEndian
     };
 
-/*
- * serializer macro, serialize function specialization that accepts T& and const T&
- */
+    //default configuration for buffer writing/reading operations
+    struct DefaultConfig {
+        //data will be stored in little endian, independant of host.
+        static constexpr EndiannessType NetworkEndianness = EndiannessType::LittleEndian;
+        //this functionality allows to support backward/forward compatibility
+        //however reading from streams is not supported, because this functionality requires random access to buffer.
+        static constexpr bool BufferSessionsEnabled = false;
 
-
-#define SERIALIZE(ObjectType) \
-template <typename S, typename T, typename std::enable_if<std::is_same<T, ObjectType>::value || std::is_same<T, const ObjectType>::value>::type* = nullptr> \
-S& serialize(S& s, T& o)
+    };
 
 }
+
 #endif //BITSERY_COMMON_H

include/bitsery/delta_deserializer.h

@@ -1,220 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-
-#ifndef BITSERY_DELTADESERIALIZER_H
-#define BITSERY_DELTADESERIALIZER_H
-
-#include <array>
-#include <stack>
-#include <algorithm>
-#include "deserializer.h"
-
-namespace bitsery {
-
-    template<typename Reader, typename TObj>
-    class DeltaDeserializer {
-    public:
-        DeltaDeserializer(Reader &r, const TObj &oldObj, const TObj &newObj)
-                : _deserializer{r},
-                  _reader{r},
-                  _oldObj{oldObj},
-                  _newObj{newObj},
-                  _objMemPos(std::deque<details::ObjectMemoryPosition>(1, details::ObjectMemoryPosition{oldObj, newObj})),
-                  _isNewElement{false} {
-        };
-
-        template<size_t SIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
-        DeltaDeserializer &value(T &v) {
-            if (getChangedState(v)) {
-                constexpr size_t ValueSize = SIZE == 0 ? sizeof(T) : SIZE;
-                _reader.template readBytes<ValueSize>(v);
-            }
-            return *this;
-        }
-
-        template<typename T>
-        DeltaDeserializer &object(T &&obj) {
-            if (getChangedState(obj))
-                return serialize(*this, std::forward<T>(obj));
-            return *this;
-        }
-
-        template<size_t VSIZE = 1, typename T>
-        DeltaDeserializer &text(std::basic_string<T> &str, size_t maxSize) {
-            if (getChangedState(str)) {
-                _deserializer.template text<VSIZE>(str, maxSize);
-            }
-            return *this;
-        }
-
-        template<size_t VSIZE = 1, typename T, size_t N>
-        DeltaDeserializer &text(T (&str)[N]) {
-            if (getChangedState(str)) {
-                _deserializer.template text<VSIZE>(str);
-            }
-            return *this;
-        }
-
-
-        template<typename T, size_t N, typename Fnc>
-        DeltaDeserializer &array(std::array<T, N> &arr, Fnc &&fnc) {
-            if (getChangedState(arr)) {
-                if (!_isNewElement) {
-                    const auto old = *_objMemPos.top().getOldObjectField(arr);
-                    processContainer(std::begin(old), std::end(old), std::begin(arr), std::end(arr), fnc);
-                } else {
-                    for (auto &v:arr)
-                        fnc(*this, v);
-                }
-            }
-            return *this;
-        }
-
-
-        template<typename T, size_t N, typename Fnc>
-        DeltaDeserializer &array(T (&arr)[N], Fnc &&fnc) {
-            if (getChangedState(arr)) {
-                if (!_isNewElement) {
-                    const auto old = *_objMemPos.top().getOldObjectField(arr);
-                    T *tmp = arr;
-                    processContainer(old, old + N, tmp, tmp + N, fnc);
-                } else {
-                    T *tmp = arr;
-                    for (auto i = 0u; i < N; ++i, ++tmp)
-                        fnc(*this, *tmp);
-                }
-            }
-            return *this;
-        }
-
-        template<typename T, typename Fnc>
-        DeltaDeserializer &container(T &obj, size_t maxSize, Fnc &&fnc) {
-            if (getChangedState(obj)) {
-                size_t newSize{};
-                _reader.readBits(newSize, 32);
-                if (!_isNewElement) {
-                    auto old = *_objMemPos.top().getOldObjectField(obj);
-                    if (old.size() != newSize)
-                        obj.resize(newSize);
-                    processContainer(std::begin(old), std::end(old), std::begin(obj), std::end(obj),
-                                     std::forward<Fnc>(fnc));
-                } else {
-                    obj.resize(newSize);
-                    for (auto &v:obj)
-                        fnc(*this, v);
-                }
-            }
-            return *this;
-        }
-
-    private:
-        Deserializer <Reader> _deserializer;
-        Reader &_reader;
-
-        const TObj &_oldObj;
-        const TObj &_newObj;
-        std::stack<details::ObjectMemoryPosition> _objMemPos;
-        bool _isNewElement;
-
-        template<typename T>
-        bool getChangedState(T &obj) {
-            if (!_isNewElement) {
-                if (!readChangedState()) {
-                    obj = *_objMemPos.top().getOldObjectField(obj);
-                    return false;
-                }
-            }
-            return true;
-        }
-
-        template<typename T, size_t N>
-        bool getChangedState(T (&arr)[N]) {
-            if (!_isNewElement) {
-                if (!readChangedState()) {
-                    auto old = *_objMemPos.top().getOldObjectField(arr);
-                    auto end = arr + N;
-                    auto pOld = old;
-                    for (auto p = arr; p != end; ++p, ++pOld)
-                        *p = *pOld;
-                    return false;
-                }
-            }
-            return true;
-        }
-
-        template<typename TConstIt, typename TIt, typename Fnc>
-        bool processContainer(TConstIt oldBegin, TConstIt oldEnd, TIt begin, TIt end, Fnc &&fnc) {
-            auto offset = readIndexOffset();
-            auto p = begin;
-            auto pOld = oldBegin;
-            for (; p != end && pOld != oldEnd; ++p, ++pOld) {
-                if (offset) {
-                    *p = *pOld;
-                    --offset;
-                } else {
-                    _objMemPos.emplace(details::ObjectMemoryPosition{*pOld, *p});
-                    fnc(*this, *p);
-                    _objMemPos.pop();
-                    offset = readIndexOffset();
-                }
-            }
-            if (offset != 0 && pOld != oldEnd)
-                return false;
-            _isNewElement = true;
-            for (; p != end; ++p, --offset)
-                fnc(*this, *p);
-            _isNewElement = false;
-            return offset == 0;
-
-        }
-
-        bool readChangedState() {
-            unsigned char res{};
-            _reader.readBits(res, 1);
-            return res;
-        }
-
-
-        size_t readIndexOffset() {
-            //special case, if items are updated sequentialy
-            unsigned char tmp{};
-            _reader.readBits(tmp, 1);
-            if (tmp) {
-                return 0u;
-            } else {
-                size_t res{};
-                _reader.readBits(tmp, 1);
-                if (tmp > 0)
-                    _reader.readBits(res, 4);
-                else
-                    _reader.readBits(res, 32);
-                return res;
-            }
-
-        }
-
-    };
-
-}
-#endif //BITSERY_DELTADESERIALIZER_H

include/bitsery/delta_serializer.h

@@ -1,220 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-
-#ifndef BITSERY_DELTASERIALIZER_H
-#define BITSERY_DELTASERIALIZER_H
-
-#include <array>
-#include <stack>
-#include <algorithm>
-#include "serializer.h"
-
-namespace bitsery {
-
-    template<typename Writter, typename TObj>
-    class DeltaSerializer {
-    public:
-        DeltaSerializer(Writter &w, const TObj &oldObj, const TObj &newObj)
-                : _serializer{w},
-                  _writter{w},
-                  _oldObj{oldObj},
-                  _newObj{newObj},
-                  _objMemPos(std::deque<details::ObjectMemoryPosition>(1, details::ObjectMemoryPosition{oldObj, newObj})),
-                  _isNewElement{false} {
-
-        };
-
-        template<size_t SIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
-        DeltaSerializer &value(const T &v) {
-            if (setChangedState(v)) {
-                constexpr size_t ValueSize = SIZE == 0 ? sizeof(T) : SIZE;
-                _writter.template writeBytes<ValueSize>(v);
-            }
-            return *this;
-        }
-
-        template<typename T>
-        DeltaSerializer &object(T &&obj) {
-            if (setChangedState(obj)) {
-                serialize(*this, std::forward<T>(obj));
-            }
-            return *this;
-        }
-
-        template<size_t VSIZE = 1, typename T>
-        DeltaSerializer &text(const std::basic_string<T> &str, size_t maxSize) {
-            if (setChangedState(str)) {
-                _serializer.template text<VSIZE>(str, maxSize);
-            }
-            return *this;
-
-        }
-
-        template<size_t VSIZE = 1, typename T, size_t N>
-        DeltaSerializer &text(const T (&str)[N]) {
-            if (setChangedState(str)) {
-                _serializer.template text<VSIZE>(str);
-            }
-            return *this;
-
-        }
-
-        template<typename T, size_t N, typename Fnc>
-        DeltaSerializer &array(const std::array<T, N> &arr, Fnc &&fnc) {
-            if (setChangedState(arr)) {
-                if (!_isNewElement) {
-                    const auto &old = *_objMemPos.top().getOldObjectField(arr);
-                    processContainer(std::begin(old), std::end(old), std::begin(arr), std::end(arr), fnc);
-                } else {
-                    for (auto &v:arr)
-                        fnc(*this, v);
-                }
-            }
-            return *this;
-        }
-
-
-        template<typename T, size_t N, typename Fnc>
-        DeltaSerializer &array(const T (&arr)[N], Fnc &&fnc) {
-            if (setChangedState(arr)) {
-                if (!_isNewElement) {
-                    auto old = *_objMemPos.top().getOldObjectField(arr);
-                    const T *tmp = arr;
-                    processContainer(old, old + N, tmp, tmp + N, fnc);
-                } else {
-                    const T *tmp = arr;
-                    for (auto i = 0u; i < N; ++i, ++tmp)
-                        fnc(*this, *tmp);
-                }
-            }
-            return *this;
-        }
-
-        template<typename T, typename Fnc>
-        DeltaSerializer &container(T &&obj, size_t maxSize, Fnc &&fnc) {
-            if (setChangedState(obj)) {
-                _writter.writeBits(obj.size(), 32);
-                if (!_isNewElement) {
-                    auto old = *_objMemPos.top().getOldObjectField(obj);
-                    processContainer(std::begin(old), std::end(old), std::begin(obj), std::end(obj),
-                                     std::forward<Fnc>(fnc));
-                } else {
-                    for (auto &v:obj)
-                        fnc(*this, v);
-                }
-            }
-            return *this;
-        }
-
-    private:
-        Serializer <Writter> _serializer;
-        Writter &_writter;
-        const TObj &_oldObj;
-        const TObj &_newObj;
-        std::stack<details::ObjectMemoryPosition> _objMemPos;
-        bool _isNewElement;
-
-        template<typename T>
-        bool setChangedState(const T &obj) {
-            if (!_isNewElement) {
-                auto res = !_objMemPos.top().isFieldsEquals(obj);
-                writeChangedState(res);
-                return res;
-            }
-            return true;
-        }
-
-        template<typename T, size_t N>
-        bool setChangedState(const T (&arr)[N]) {
-            if (!_isNewElement) {
-                auto old = *_objMemPos.top().getOldObjectField(arr);
-                auto end = arr + N;
-                bool changed{};
-                for (auto p = arr, pOld = old; p != end; ++p, ++pOld) {
-                    if (!(*p == *pOld)) {
-                        changed = true;
-                        break;
-                    }
-                }
-                writeChangedState(changed);
-                return changed;
-            }
-            return true;
-        }
-
-
-        template<typename T, typename Fnc>
-        void processContainer(const T oldBegin, const T oldEnd, const T begin, const T end, Fnc &&fnc) {
-            auto misMatch = std::mismatch(oldBegin, oldEnd, begin, end);
-            auto lastChanged = begin;
-            while (misMatch.first != oldEnd && misMatch.second != end) {
-                writeIndexOffset(std::distance(lastChanged, misMatch.second));
-                _objMemPos.emplace(details::ObjectMemoryPosition{*misMatch.first, *misMatch.second});
-                fnc(*this, *misMatch.second);
-                _objMemPos.pop();
-                ++misMatch.first;
-                ++misMatch.second;
-                lastChanged = misMatch.second;
-                misMatch = std::mismatch(misMatch.first, oldEnd, misMatch.second, end);
-            }
-            auto p = misMatch.second;
-            //write items left
-            writeIndexOffset(std::distance(lastChanged, end));
-            //write old elements
-            for (auto pOld = misMatch.first; p != end && pOld != oldEnd; ++p, ++pOld) {
-                _objMemPos.emplace(details::ObjectMemoryPosition{*pOld, *p});
-                fnc(*this, *p);
-                _objMemPos.pop();
-            }
-
-            //write new elements
-            _isNewElement = true;
-            for (; p != end; ++p)
-                fnc(*this, *p);
-            _isNewElement = false;
-        }
-
-        void writeChangedState(bool state) {
-            _writter.writeBits(state ? 1u : 0u, 1);
-        }
-
-        void writeIndexOffset(const size_t offset) {
-            //special case, if items are updated sequentialy
-            if (offset == 0) {
-                _writter.writeBits(1u, 1);
-            } else {
-                _writter.writeBits(0u, 1);
-                auto smallOffset = offset < 16;
-                _writter.writeBits(smallOffset ? 1u : 0u, 1);
-                if (smallOffset)
-                    _writter.writeBits(offset, 4);
-                else
-                    _writter.writeBits(offset, 32);
-            }
-        }
-
-    };
-
-}
-#endif //BITSERY_DELTASERIALIZER_H

include/bitsery/deserializer.h

@@ -24,328 +24,309 @@
 #ifndef BITSERY_DESERIALIZER_H
 #define BITSERY_DESERIALIZER_H
 
-#include "common.h"
 #include "details/serialization_common.h"
+#include "adapter_reader.h"
 #include <utility>
 
 namespace bitsery {
 
 
-    template<typename Reader>
-    class Deserializer {
+    template<typename TAdapterReader>
+    class BasicDeserializer {
     public:
-        Deserializer(Reader& r):_reader{r}, _isValid{true} {};
+        //this is used by AdapterAccess class
+        using TReader = TAdapterReader;
+        //helper type, that always returns bit-packing enabled type, useful inside serialize function when enabling bitpacking
+        using BPEnabledType = BasicDeserializer<typename std::conditional<TAdapterReader::BitPackingEnabled,
+                TAdapterReader, AdapterReaderBitPackingWrapper<TAdapterReader>>::type>;
 
-        template <typename T>
-        Deserializer& object(T&& obj) {
-            return serialize(*this, std::forward<T>(obj));
-        }
 
-        //in c++17 change "class" to typename
-        template <template <typename> class Extension, typename TValue, typename Fnc>
-        Deserializer& ext(TValue& v, Fnc&& fnc) {
-            static_assert(!std::is_const<TValue>(), "");
-            Extension<TValue> ext{v};
-            ext.deserialize(*this, std::forward<Fnc>(fnc));
-            return *this;
+        template <typename ReaderParam>
+        explicit BasicDeserializer(ReaderParam&& r, void* context = nullptr)
+                : _reader{std::forward<ReaderParam>(r)},
+                  _context{context}
+        {
         };
 
+        //copying disabled
+        BasicDeserializer(const BasicDeserializer&) = delete;
+        BasicDeserializer& operator = (const BasicDeserializer&) = delete;
+
+        //move enabled
+        BasicDeserializer(BasicDeserializer&& ) = default;
+        BasicDeserializer& operator = (BasicDeserializer&& ) = default;
+
         /*
-         * value overloads
+         * get serialization context.
+         * this is optional, but might be required for some specific deserialization flows.
          */
-
-        template<size_t VSIZE, typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
-        Deserializer& value(T& v) {
-            static_assert(std::numeric_limits<T>::is_iec559, "");
-            if (_isValid) {
-                _isValid = _reader.template readBytes<VSIZE>(reinterpret_cast<details::SAME_SIZE_UNSIGNED<T>&>(v));
-            }
-            return *this;
-        }
-
-        template<size_t VSIZE, typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
-        Deserializer& value(T& v) {
-            using UT = std::underlying_type_t<T>;
-            if (_isValid) {
-                _isValid = _reader.template readBytes<VSIZE>(reinterpret_cast<UT&>(v));
-            }
-            return *this;
-        }
-
-        template<size_t VSIZE, typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
-        Deserializer& value(T& v) {
-            if (_isValid) {
-                _isValid = _reader.template readBytes<VSIZE>(v);
-            }
-            return *this;
+        void* context() {
+            return _context;
         }
 
         /*
-         * bool
+         * object function
          */
 
-        Deserializer& boolBit(bool& v) {
-            if (_isValid) {
-                unsigned char tmp;
-                _isValid = _reader.readBits(tmp, 1);
-                v = tmp == 1;
-            }
-            return *this;
+        template<typename T>
+        void object(T &&obj) {
+            details::SerializeFunction<BasicDeserializer, T>::invoke(*this, std::forward<T>(obj));
         }
 
-        Deserializer& boolByte(bool& v) {
-            if (_isValid) {
-                unsigned char tmp;
-                _isValid = _reader.template readBytes<1>(tmp);
-                if (_isValid)
-                    _isValid = tmp < 2;
-                v = tmp == 1;
-            }
-            return *this;
+        template<typename T, typename Fnc>
+        void object(T &&obj, Fnc &&fnc) {
+            fnc(std::forward<T>(obj));
+        };
+
+        /*
+         * functionality, that enables simpler serialization syntax, by including additional header
+         */
+        template<typename T, typename ... TArgs>
+        void archive(T &&head, TArgs &&... tail) {
+            //serialize object
+            details::ArchiveFunction<BasicDeserializer, T>::invoke(*this, std::forward<T>(head));
+            //expand other elements
+            archive(std::forward<TArgs>(tail)...);
         }
 
         /*
-         * range
+         * value
          */
 
-        template <typename T>
-        Deserializer& range(T& v, const RangeSpec<T>& range) {
-            if (_isValid) {
-                _isValid = _reader.readBits(reinterpret_cast<details::SAME_SIZE_UNSIGNED<T>&>(v), range.bitsRequired);
-                details::setRangeValue(v, range);
-                if (_isValid)
-                    _isValid = details::isRangeValid(v, range);
-            }
-            return *this;
+        template<size_t VSIZE, typename T, typename std::enable_if<details::IsFundamentalType<T>::value>::type * = nullptr>
+        void value(T &v) {
+            using TValue = typename details::IntegralFromFundamental<T>::TValue;
+            _reader.template readBytes<VSIZE>(reinterpret_cast<TValue &>(v));
         }
 
         /*
-         * substitution overloads
+         * enable bit-packing
          */
-        template<typename T, size_t N, typename Fnc>
-        Deserializer& substitution(T& v, const std::array<T,N>& expectedValues, Fnc&& fnc) {
-            size_t index;
-            range(index, {{}, N + 1});
-            if (_isValid) {
-                if (index)
-                    v = expectedValues[index-1];
-                else
-                    fnc(*this, v);
-            }
-            return *this;
+        template <typename Fnc>
+        void enableBitPacking(Fnc&& fnc) {
+            procEnableBitPacking(std::forward<Fnc>(fnc), std::integral_constant<bool, TAdapterReader::BitPackingEnabled>{});
+        }
+
+        /*
+         * extension functions
+         */
+
+        template<typename T, typename Ext, typename Fnc>
+        void ext(T &obj, const Ext &extension, Fnc &&fnc) {
+            static_assert(details::IsExtensionTraitsDefined<Ext, T>::value, "Please define ExtensionTraits");
+            static_assert(traits::ExtensionTraits<Ext,T>::SupportLambdaOverload,
+                          "extension doesn't support overload with lambda");
+            extension.deserialize(*this, _reader, obj, std::forward<Fnc>(fnc));
         };
 
-        template<size_t VSIZE, typename T, size_t N>
-        Deserializer& substitution(T& v, const std::array<T,N>& expectedValues) {
-            size_t index;
-            range(index, {{}, N + 1});
-            if (_isValid) {
-                if (index)
-                    v = expectedValues[index-1];
-                else
-                    value<VSIZE>(v);
-            }
-            return *this;
+        template<size_t VSIZE, typename T, typename Ext>
+        void ext(T &obj, const Ext &extension) {
+            static_assert(details::IsExtensionTraitsDefined<Ext, T>::value, "Please define ExtensionTraits");
+            static_assert(traits::ExtensionTraits<Ext,T>::SupportValueOverload,
+                          "extension doesn't support overload with `value<N>`");
+            using ExtVType = typename traits::ExtensionTraits<Ext, T>::TValue;
+            using VType = typename std::conditional<std::is_void<ExtVType>::value, details::DummyType, ExtVType>::type;
+            extension.deserialize(*this, _reader, obj, [this](VType &v) { value<VSIZE>(v);});
         };
 
-        template<typename T, size_t N>
-        Deserializer& substitution(T& v, const std::array<T,N>& expectedValues) {
-            size_t index;
-            range(index, {{}, N + 1});
-            if (_isValid) {
-                if (index)
-                    v = expectedValues[index-1];
-                else
-                    object(v);
-            }
-            return *this;
+        template<typename T, typename Ext>
+        void ext(T &obj, const Ext &extension) {
+            static_assert(details::IsExtensionTraitsDefined<Ext, T>::value, "Please define ExtensionTraits");
+            static_assert(traits::ExtensionTraits<Ext,T>::SupportObjectOverload,
+                          "extension doesn't support overload with `object`");
+            using ExtVType = typename traits::ExtensionTraits<Ext, T>::TValue;
+            using VType = typename std::conditional<std::is_void<ExtVType>::value, details::DummyType, ExtVType>::type;
+            extension.deserialize(*this, _reader, obj, [this](VType &v) { object(v); });
         };
 
+        /*
+         * boolValue
+         */
+        void boolValue(bool &v) {
+            procBoolValue(v, std::integral_constant<bool, TAdapterReader::BitPackingEnabled>{});
+        }
+
         /*
          * text overloads
          */
 
-        template <size_t VSIZE, typename T>
-        Deserializer& text(std::basic_string<T>& str, size_t maxSize) {
-            size_t size;
-            readSize(size, maxSize);
-            if (_isValid) {
-                str.resize(size);
-                procContainer<VSIZE>(std::begin(str), std::end(str), std::true_type{});
-            }
-            return *this;
+        template<size_t VSIZE, typename T>
+        void text(T &str, size_t maxSize) {
+            static_assert(details::IsTextTraitsDefined<T>::value,
+                          "Please define TextTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use text(T&) overload without `maxSize` for static containers");
+            size_t length;
+            details::readSize(_reader, length, maxSize);
+            traits::ContainerTraits<T>::resize(str, length + (traits::TextTraits<T>::addNUL ? 1u : 0u));
+            procText<VSIZE>(str, length);
         }
 
-        template<size_t VSIZE, typename T, size_t N>
-        Deserializer& text(T (&str)[N]) {
-            size_t size;
-            readSize(size, N-1);
-            if (_isValid) {
-                auto first = std::begin(str);
-                procContainer<VSIZE>(first, std::next(first, size), std::true_type{});
-                //null-terminated string
-                str[size] = {};
-            }
-            return *this;
+        template<size_t VSIZE, typename T>
+        void text(T &str) {
+            static_assert(details::IsTextTraitsDefined<T>::value,
+                          "Please define TextTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use text(T&, size_t) overload with `maxSize` for dynamic containers");
+            size_t length;
+            details::readSize(_reader, length, traits::ContainerTraits<T>::size(str));
+            procText<VSIZE>(str, length);
         }
 
         /*
          * container overloads
          */
 
-        template <typename T, typename Fnc>
-        Deserializer& container(T&& obj, size_t maxSize, Fnc&& fnc) {
-            decltype(obj.size()) size{};
-            readSize(size, maxSize);
-            if (_isValid) {
-                obj.resize(size);
-                procContainer(std::begin(obj), std::end(obj), std::forward<Fnc>(fnc));
-            }
-            return *this;
+        //dynamic size containers
+
+        template<typename T, typename Fnc>
+        void container(T &obj, size_t maxSize, Fnc &&fnc) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use container(T&) overload without `maxSize` for static containers");
+            size_t size{};
+            details::readSize(_reader, size, maxSize);
+            traits::ContainerTraits<T>::resize(obj, size);
+            procContainer(std::begin(obj), std::end(obj), std::forward<Fnc>(fnc));
         }
 
-        template <size_t VSIZE, typename T>
-        Deserializer& container(T& obj, size_t maxSize) {
-            decltype(obj.size()) size{};
-            readSize(size, maxSize);
-            if (_isValid) {
-                obj.resize(size);
-                procContainer<VSIZE>(std::begin(obj), std::end(obj), std::false_type{});
-            }
-            return *this;
+        template<size_t VSIZE, typename T>
+        void container(T &obj, size_t maxSize) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use container(T&) overload without `maxSize` for static containers");
+            size_t size{};
+            details::readSize(_reader, size, maxSize);
+            traits::ContainerTraits<T>::resize(obj, size);
+            procContainer<VSIZE>(std::begin(obj), std::end(obj), std::integral_constant<bool, traits::ContainerTraits<T>::isContiguous>{});
         }
 
-        template <typename T>
-        Deserializer& container(T& obj, size_t maxSize) {
-            decltype(obj.size()) size{};
-            readSize(size, maxSize);
-            if (_isValid) {
-                obj.resize(size);
-                procContainer(std::begin(obj), std::end(obj));
-            }
-            return *this;
+        template<typename T>
+        void container(T &obj, size_t maxSize) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use container(T&) overload without `maxSize` for static containers");
+            size_t size{};
+            details::readSize(_reader, size, maxSize);
+            traits::ContainerTraits<T>::resize(obj, size);
+            procContainer(std::begin(obj), std::end(obj));
+        }
+        //fixed size containers
+
+        template<typename T, typename Fnc, typename std::enable_if<!std::is_integral<Fnc>::value>::type * = nullptr>
+        void container(T &obj, Fnc &&fnc) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use container(T&, size_t, Fnc) overload with `maxSize` for dynamic containers");
+            procContainer(std::begin(obj), std::end(obj), std::forward<Fnc>(fnc));
         }
 
-        /*
-         * array overloads (fixed size array (std::array, and c-style array))
-         */
-
-        //std::array overloads
-
-        template<typename T, size_t N, typename Fnc>
-        Deserializer&  array(std::array<T,N> &arr, Fnc && fnc) {
-            procContainer(std::begin(arr), std::end(arr), std::forward<Fnc>(fnc));
-            return *this;
+        template<size_t VSIZE, typename T>
+        void container(T &obj) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use container(T&, size_t) overload with `maxSize` for dynamic containers");
+            static_assert(VSIZE > 0, "");
+            procContainer<VSIZE>(std::begin(obj), std::end(obj), std::integral_constant<bool, traits::ContainerTraits<T>::isContiguous>{});
         }
 
-        template<size_t VSIZE, typename T, size_t N>
-        Deserializer&  array(std::array<T,N> &arr) {
-            procContainer<VSIZE>(std::begin(arr), std::end(arr), std::true_type{});
-            return *this;
+        template<typename T>
+        void container(T &obj) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use container(T&, size_t) overload with `maxSize` for dynamic containers");
+            procContainer(std::begin(obj), std::end(obj));
         }
 
-        template<typename T, size_t N>
-        Deserializer&  array(std::array<T,N> &arr) {
-            procContainer(std::begin(arr), std::end(arr));
-            return *this;
-        }
-
-        //c-style array overloads
-
-        template<typename T, size_t N, typename Fnc>
-        Deserializer& array(T (&arr)[N], Fnc&& fnc) {
-            procContainer(std::begin(arr), std::end(arr), std::forward<Fnc>(fnc));
-            return *this;
-        }
-
-        template<size_t VSIZE, typename T, size_t N>
-        Deserializer& array(T (&arr)[N]) {
-            procContainer<VSIZE>(std::begin(arr), std::end(arr), std::true_type{});
-            return *this;
-        }
-
-        template<typename T, size_t N>
-        Deserializer& array(T (&arr)[N]) {
-            procContainer(std::begin(arr), std::end(arr));
-            return *this;
-        }
-        bool isValid() const {
-            return _isValid;
-        }
-
-        Deserializer& align() {
+        void align() {
             _reader.align();
-            return *this;
         }
 
         //overloads for functions with explicit type size
-        template<typename T> Deserializer& value1(T &&v) { return value<1>(std::forward<T>(v)); }
-        template<typename T> Deserializer& value2(T &&v) { return value<2>(std::forward<T>(v)); }
-        template<typename T> Deserializer& value4(T &&v) { return value<4>(std::forward<T>(v)); }
-        template<typename T> Deserializer& value8(T &&v) { return value<8>(std::forward<T>(v)); }
 
-        template<typename T, size_t N> Deserializer& substitution1
-                (T &v, const std::array<T, N> &expectedValues) { return substitution<1>(v, expectedValues); };
-        template<typename T, size_t N> Deserializer& substitution2
-                (T &v, const std::array<T, N> &expectedValues) { return substitution<2>(v, expectedValues); };
-        template<typename T, size_t N> Deserializer& substitution4
-                (T &v, const std::array<T, N> &expectedValues) { return substitution<4>(v, expectedValues); };
-        template<typename T, size_t N> Deserializer& substitution8
-                (T &v, const std::array<T, N> &expectedValues) { return substitution<8>(v, expectedValues); };
+        template<typename T>
+        void value1b(T &&v) { value<1>(std::forward<T>(v)); }
 
-        template<typename T> Deserializer& text1(std::basic_string<T> &str, size_t maxSize) {
-            return text<1>(str, maxSize); }
-        template<typename T> Deserializer& text2(std::basic_string<T> &str, size_t maxSize) {
-            return text<2>(str, maxSize); }
-        template<typename T> Deserializer& text4(std::basic_string<T> &str, size_t maxSize) {
-            return text<4>(str, maxSize); }
+        template<typename T>
+        void value2b(T &&v) { value<2>(std::forward<T>(v)); }
 
-        template<typename T, size_t N> Deserializer& text1(T (&str)[N]) { return text<1>(str); }
-        template<typename T, size_t N> Deserializer& text2(T (&str)[N]) { return text<2>(str); }
-        template<typename T, size_t N> Deserializer& text4(T (&str)[N]) { return text<4>(str); }
+        template<typename T>
+        void value4b(T &&v) { value<4>(std::forward<T>(v)); }
 
-        template<typename T> Deserializer& container1(T &&obj, size_t maxSize) {
-            return container<1>(std::forward<T>(obj), maxSize); }
-        template<typename T> Deserializer& container2(T &&obj, size_t maxSize) {
-            return container<2>(std::forward<T>(obj), maxSize); }
-        template<typename T> Deserializer& container4(T &&obj, size_t maxSize) {
-            return container<4>(std::forward<T>(obj), maxSize); }
-        template<typename T> Deserializer& container8(T &&obj, size_t maxSize) {
-            return container<8>(std::forward<T>(obj), maxSize); }
+        template<typename T>
+        void value8b(T &&v) { value<8>(std::forward<T>(v)); }
+
+        template<typename T, typename Ext>
+        void ext1b(T &v, Ext &&extension) { ext<1, T, Ext>(v, std::forward<Ext>(extension)); };
+
+        template<typename T, typename Ext>
+        void ext2b(T &v, Ext &&extension) { ext<2, T, Ext>(v, std::forward<Ext>(extension)); };
+
+        template<typename T, typename Ext>
+        void ext4b(T &v, Ext &&extension) { ext<4, T, Ext>(v, std::forward<Ext>(extension)); };
+
+        template<typename T, typename Ext>
+        void ext8b(T &v, Ext &&extension) { ext<8, T, Ext>(v, std::forward<Ext>(extension)); };
+
+        template<typename T>
+        void text1b(T &str, size_t maxSize) { text<1>(str, maxSize); }
+
+        template<typename T>
+        void text2b(T &str, size_t maxSize) { text<2>(str, maxSize); }
+
+        template<typename T>
+        void text4b(T &str, size_t maxSize) { text<4>(str, maxSize); }
+
+        template<typename T>
+        void text1b(T &str) { text<1>(str); }
+
+        template<typename T>
+        void text2b(T &str) { text<2>(str); }
+
+        template<typename T>
+        void text4b(T &str) { text<4>(str); }
+
+        template<typename T>
+        void container1b(T &&obj, size_t maxSize) { container<1>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container2b(T &&obj, size_t maxSize) { container<2>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container4b(T &&obj, size_t maxSize) { container<4>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container8b(T &&obj, size_t maxSize) { container<8>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container1b(T &&obj) { container<1>(std::forward<T>(obj)); }
+
+        template<typename T>
+        void container2b(T &&obj) { container<2>(std::forward<T>(obj)); }
+
+        template<typename T>
+        void container4b(T &&obj) { container<4>(std::forward<T>(obj)); }
+
+        template<typename T>
+        void container8b(T &&obj) { container<8>(std::forward<T>(obj)); }
 
     private:
-        Reader& _reader;
-        bool _isValid;
-        void readSize(size_t &size, size_t maxSize) {
-            size = {};
-            if (_isValid) {
-                unsigned char firstBit;
-                _isValid = _reader.readBits(firstBit, 1);
-                if (_isValid) {
-                    if (firstBit) {
-                        _isValid = _reader.readBits(size, 7);
-                    } else {
-                        unsigned char secondBit;
-                        _isValid = _reader.readBits(secondBit, 1);
-                        if (_isValid) {
-                            if (secondBit) {
-                                _isValid = _reader.readBits(size,14);
-                            } else {
-                                _isValid = _reader.readBits(size,30);
-                            }
-                        }
-                    }
-                }
-                if (_isValid)
-                    _isValid = size <= maxSize;
-            }
-        }
+        friend AdapterAccess;
+
+        TAdapterReader _reader;
+        void* _context;
 
         //process value types
         //false_type means that we must process all elements individually
         template<size_t VSIZE, typename It>
         void procContainer(It first, It last, std::false_type) {
-            for (;_isValid && first != last; ++first)
+            for (; first != last; ++first)
                 value<VSIZE>(*first);
         };
 
@@ -353,26 +334,94 @@ namespace bitsery {
         //true_type means, that we can copy whole buffer
         template<size_t VSIZE, typename It>
         void procContainer(It first, It last, std::true_type) {
-            if (_isValid && first != last)
-                _isValid = _reader.template readBuffer<VSIZE>(&(*first), std::distance(first, last));
+            using TValue = typename std::decay<decltype(*first)>::type;
+            using TIntegral = typename details::IntegralFromFundamental<TValue>::TValue;
+            if (first != last)
+                _reader.template readBuffer<VSIZE>(reinterpret_cast<TIntegral*>(&(*first)), std::distance(first, last));
         };
 
         //process by calling functions
         template<typename It, typename Fnc>
         void procContainer(It first, It last, Fnc fnc) {
-            for (;_isValid && first != last; ++first)
-                fnc(*this, *first);
+            for (; first != last; ++first)
+                fnc(*first);
         };
 
         //process object types
         template<typename It>
         void procContainer(It first, It last) {
-            for (;_isValid && first != last; ++first)
+            for (; first != last; ++first)
                 object(*first);
         };
 
+        template <size_t VSIZE, typename T>
+        void procText(T& str, size_t length) {
+            auto begin = std::begin(str);
+            //end of string, not end of container
+            auto end = std::next(begin, length);
+            procContainer<VSIZE>(begin, end, std::integral_constant<bool, traits::ContainerTraits<T>::isContiguous>{});
+            //null terminated character at the end
+            if (traits::TextTraits<T>::addNUL)
+                *end = {};
+        }
+
+        //proc bool writing bit or byte, depending on if BitPackingEnabled or not
+        void procBoolValue(bool &v, std::true_type) {
+            uint8_t tmp{};
+            _reader.readBits(tmp, 1);
+            v = tmp == 1;
+        }
+
+        void procBoolValue(bool &v, std::false_type) {
+            unsigned char tmp;
+            _reader.template readBytes<1>(tmp);
+            if (tmp > 1)
+                _reader.setError(ReaderError::InvalidData);
+            v = tmp == 1;
+        }
+
+
+        //enable bit-packing or do nothing if it is already enabled
+        template <typename Fnc>
+        void procEnableBitPacking(const Fnc& fnc, std::true_type) {
+            fnc(*this);
+        }
+
+        template <typename Fnc>
+        void procEnableBitPacking(const Fnc& fnc, std::false_type) {
+            //create serializer using bitpacking wrapper
+            BasicDeserializer<AdapterReaderBitPackingWrapper<TAdapterReader>> tmp(_reader, _context);
+            fnc(tmp);
+        }
+
+        //these are dummy functions for extensions that have TValue = void
+        void object(details::DummyType&) {
+
+        }
+
+        template <size_t VSIZE>
+        void value(details::DummyType&) {
+
+        }
+
+        //dummy function, that stops archive variadic arguments expansion
+        void archive() {
+        }
+
     };
 
+    //helper type
+    template <typename Adapter>
+    using Deserializer = BasicDeserializer<AdapterReader<Adapter, DefaultConfig>>;
+
+    //helper function that set ups all the basic steps and after deserialziation returns status
+    template <typename Adapter, typename T>
+    std::pair<ReaderError, bool> quickDeserialization(Adapter adapter, T& value) {
+        Deserializer<Adapter> des{std::move(adapter)};
+        des.object(value);
+        auto& r = AdapterAccess::getReader(des);
+        return {r.error(), r.isCompletedSuccessfully()};
+    };
 
 }
 

include/bitsery/details/adapter_common.h

@@ -20,28 +20,34 @@
 //OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 //SOFTWARE.
 
-#ifndef BITSERY_BUFFER_COMMON_H
-#define BITSERY_BUFFER_COMMON_H
+#ifndef BITSERY_DETAILS_BUFFER_COMMON_H
+#define BITSERY_DETAILS_BUFFER_COMMON_H
+
+#include <algorithm>
+#include <utility>
+#include <cassert>
+#include <vector>
+#include <stack>
+#include <cstring>
+#include "adapter_utils.h"
+#include "not_defined_type.h"
+
+#include "../common.h"
 
 namespace bitsery {
 
-/*
- * endianess
- */
-    enum class EndiannessType {
-        LittleEndian,
-        BigEndian
-    };
-
     namespace details {
+
         template<typename T>
-        constexpr size_t BITS_SIZE = sizeof(T) << 3;
+        struct BitsSize:public std::integral_constant<size_t, sizeof(T) * 8> {
+
+        };
 
         //add swap functions to class, to avoid compilation warning about unused functions
-        struct swapImpl {
+        struct SwapImpl {
             static uint64_t exec(uint64_t value) {
 #ifdef __GNUC__
-                return __builtin_bswap64( value );
+                return __builtin_bswap64(value);
 #else
                 value = ( value & 0x00000000FFFFFFFF ) << 32 | ( value & 0xFFFFFFFF00000000 ) >> 32;
             value = ( value & 0x0000FFFF0000FFFF ) << 16 | ( value & 0xFFFF0000FFFF0000 ) >> 16;
@@ -50,18 +56,16 @@ namespace bitsery {
 #endif
             }
 
-            static uint32_t exec(uint32_t value)
-            {
+            static uint32_t exec(uint32_t value) {
 #ifdef __GNUC__
-                return __builtin_bswap32( value );
+                return __builtin_bswap32(value);
 #else
                 return ( value & 0x000000ff ) << 24 | ( value & 0x0000ff00 ) << 8 | ( value & 0x00ff0000 ) >> 8 | ( value & 0xff000000 ) >> 24;
 #endif
             }
 
-            static uint16_t exec(uint16_t value)
-            {
-                return ( value & 0x00ff ) << 8 | ( value & 0xff00 ) >> 8;
+            static uint16_t exec(uint16_t value) {
+                return (value & 0x00ff) << 8 | (value & 0xff00) >> 8;
             }
 
             static uint8_t exec(uint8_t value) {
@@ -69,28 +73,55 @@ namespace bitsery {
             }
         };
 
-        template <typename TValue>
+        template<typename TValue>
         TValue swap(TValue value) {
             constexpr size_t TSize = sizeof(TValue);
             using UT = typename std::conditional<TSize == 1, uint8_t,
                     typename std::conditional<TSize == 2, uint16_t,
-                            typename std::conditional<TSize == 4, uint32_t , uint64_t>::type>::type>::type;
-            return swapImpl::exec(static_cast<UT>(value));
+                            typename std::conditional<TSize == 4, uint32_t, uint64_t>::type>::type>::type;
+            return SwapImpl::exec(static_cast<UT>(value));
         }
 
         //add test data in separate struct, because some compilers only support constexpr functions with return-only body
         struct EndiannessTestData {
             static constexpr uint32_t _sample4Bytes = 0x01020304;
-            static constexpr uint8_t _sample1stByte = (const uint8_t&)_sample4Bytes;
+            static constexpr uint8_t _sample1stByte = (const uint8_t &) _sample4Bytes;
         };
 
         constexpr EndiannessType getSystemEndianness() {
-            static_assert(EndiannessTestData::_sample1stByte == 0x04 || EndiannessTestData::_sample1stByte == 0x01, "system must be either little or big endian");
-            return EndiannessTestData::_sample1stByte == 0x04 ? EndiannessType::LittleEndian : EndiannessType::BigEndian;
+            static_assert(EndiannessTestData::_sample1stByte == 0x04 || EndiannessTestData::_sample1stByte == 0x01,
+                          "system must be either little or big endian");
+            return EndiannessTestData::_sample1stByte == 0x04 ? EndiannessType::LittleEndian
+                                                              : EndiannessType::BigEndian;
         }
 
+
+        template<typename T>
+        struct ScratchType {
+            using type = NotDefinedType;
+        };
+
+        template<>
+        struct ScratchType<uint8_t> {
+            using type = uint16_t;
+        };
+
+        /*
+         * class used by session reader, to access underlying iterators of buffer
+         */
+        struct SessionAccess {
+            template <typename TReader, typename Iterator>
+            static Iterator& posIteratorRef(TReader& r) {
+                return r.posIt;
+            }
+            template <typename TReader, typename Iterator>
+            static Iterator& endIteratorRef(TReader& r) {
+                return r.endIt;
+            }
+        };
+
     }
 }
 
 
-#endif //BITSERY_BUFFER_COMMON_H
+#endif //BITSERY_DETAILS_BUFFER_COMMON_H

include/bitsery/details/adapter_utils.h

@@ -0,0 +1,86 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_DETAILS_BOTH_COMMON_H
+#define BITSERY_DETAILS_BOTH_COMMON_H
+
+#include <cassert>
+#include <cstdint>
+#include <cstddef>
+
+namespace bitsery {
+
+    enum class ReaderError {
+        NoError,
+        ReadingError, // this might be used with stream adapter
+        DataOverflow,
+        InvalidData
+    };
+
+    namespace details {
+/*
+ * size read/write functions
+ */
+        template <typename Reader>
+        void readSize(Reader& r, size_t& size, size_t maxSize) {
+            uint8_t hb{};
+            r.template readBytes<1>(hb);
+            if (hb < 0x80u) {
+                size = hb;
+            } else {
+                uint8_t lb{};
+                r.template readBytes<1>(lb);
+                if (hb & 0x40u) {
+                    uint16_t lw{};
+                    r.template readBytes<2>(lw);
+                    size = ((((hb & 0x3Fu) << 8) | lb) << 16) | lw;
+                } else {
+                    size = ((hb & 0x7Fu) << 8) | lb;
+                }
+            }
+            if (size > maxSize) {
+                r.setError(ReaderError::InvalidData);
+                size = {};
+            }
+        }
+
+        template <typename Writter>
+        void writeSize(Writter& w, const size_t size) {
+            if (size < 0x80u) {
+                w.template writeBytes<1>(static_cast<uint8_t>(size));
+            } else {
+                if (size < 0x4000u) {
+                    w.template writeBytes<1>(static_cast<uint8_t>((size >> 8) | 0x80u));
+                    w.template writeBytes<1>(static_cast<uint8_t>(size));
+                } else {
+                    assert(size < 0x40000000u);
+                    w.template writeBytes<1>(static_cast<uint8_t>((size >> 24) | 0xC0u));
+                    w.template writeBytes<1>(static_cast<uint8_t>(size >> 16));
+                    w.template writeBytes<2>(static_cast<uint16_t>(size));
+                }
+            }
+        }
+
+    }
+}
+
+#endif //BITSERY_DETAILS_BOTH_COMMON_H

include/bitsery/details/flexible_common.h

@@ -0,0 +1,149 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_DETAILS_FLEXIBLE_COMMON_H
+#define BITSERY_DETAILS_FLEXIBLE_COMMON_H
+
+#include "../traits/core/traits.h"
+#include <limits>
+
+namespace bitsery {
+    namespace flexible {
+
+        //these function overloads is required to apply maxSize, and optimize for fundamental types
+        //for contigous arrays of fundamenal types, memcpy will be applied
+
+        template<typename S, typename T, typename std::enable_if<
+                details::IsFundamentalType<typename traits::ContainerTraits<T>::TValue>::value
+                && traits::ContainerTraits<T>::isResizable
+        >::type * = nullptr>
+        void processContainer(S &s, T &c, size_t maxSize = std::numeric_limits<size_t>::max()) {
+            using TValue = typename traits::ContainerTraits<T>::TValue;
+            s.template container<sizeof(TValue)>(c, maxSize);
+        }
+
+        template<typename S, typename T, typename std::enable_if<
+                !details::IsFundamentalType<typename traits::ContainerTraits<T>::TValue>::value
+                && traits::ContainerTraits<T>::isResizable
+        >::type * = nullptr>
+        void processContainer(S &s, T &c, size_t maxSize = std::numeric_limits<size_t>::max()) {
+            s.container(c, maxSize);
+        }
+
+        template<typename S, typename T, typename std::enable_if<
+                details::IsFundamentalType<typename traits::ContainerTraits<T>::TValue>::value
+                && !traits::ContainerTraits<T>::isResizable
+        >::type * = nullptr>
+        void processContainer(S &s, T &c) {
+            using TValue = typename traits::ContainerTraits<T>::TValue;
+            s.template container<sizeof(TValue)>(c);
+        }
+
+        template<typename S, typename T, typename std::enable_if<
+                !details::IsFundamentalType<typename traits::ContainerTraits<T>::TValue>::value
+                && !traits::ContainerTraits<T>::isResizable
+        >::type * = nullptr>
+        void processContainer(S &s, T &c) {
+            s.container(c);
+        }
+
+        //overloads for text processing to apply maxSize
+
+        template<typename S, typename T, typename std::enable_if<
+                traits::ContainerTraits<T>::isResizable>::type * = nullptr>
+        void processText(S &s, T &c, size_t maxSize = std::numeric_limits<size_t>::max()) {
+            using TValue = typename traits::ContainerTraits<T>::TValue;
+            s.template text<sizeof(TValue)>(c, maxSize);
+        }
+
+        template<typename S, typename T, typename std::enable_if<
+                !traits::ContainerTraits<T>::isResizable>::type * = nullptr>
+        void processText(S &s, T &c) {
+            using TValue = typename traits::ContainerTraits<T>::TValue;
+            s.template text<sizeof(TValue)>(c);
+        }
+
+
+        //all wrapper functions, that modify behaviour, should inherit from this
+        struct ArchiveWrapperFnc {
+
+        };
+
+        //this type is used to differentiate between container and text behaviour
+        template<typename T, size_t N, bool isText>
+        struct CArray : public ArchiveWrapperFnc {
+            CArray(T (&data_)[N]) : data{data_} {};
+            T (&data)[N];
+        };
+
+        template<typename S, typename T, size_t N>
+        void serialize(S &s, CArray<T, N, true> &str) {
+            processText(s, str.data);
+        }
+
+        template<typename S, typename T, size_t N>
+        void serialize(S &s, CArray<T, N, false> &obj) {
+            processContainer(s, obj.data);
+        }
+
+        //used to set max container size
+        template<typename T>
+        struct MaxSize : public ArchiveWrapperFnc {
+            MaxSize(T &data_, size_t maxSize_) : data{data_}, maxSize{maxSize_} {};
+            T &data;
+            size_t maxSize;
+        };
+
+        //if container, then call procesContainer, this memcpy for fundamental types contiguous container
+        template<typename S, typename T>
+        void processMaxSize(S &s, T& data, size_t maxSize, std::true_type) {
+            processContainer(s, data, maxSize);
+        };
+
+        //overload for const T&
+        template<typename S, typename T>
+        void processMaxSize(S &s, const T& data, size_t maxSize, std::true_type) {
+            processContainer(s, const_cast<T&>(data), maxSize);
+        };
+
+
+        //try to call serialize overload with maxsize, extensions use this technique
+        template<typename S, typename T>
+        void processMaxSize(S &s, T& data, size_t maxSize, std::false_type) {
+            serialize(s, data, maxSize);
+        };
+
+        //overload for const T&
+        template<typename S, typename T>
+        void processMaxSize(S &s, const T& data, size_t maxSize, std::false_type) {
+            serialize(s, const_cast<T&>(data), maxSize);
+        };
+
+        template<typename S, typename T>
+        void serialize(S &s, const MaxSize<T> &ms) {
+            processMaxSize(s, ms.data, ms.maxSize, details::IsContainerTraitsDefined<typename std::decay<T>::type>{});
+        };
+
+    }
+}
+
+#endif //BITSERY_DETAILS_FLEXIBLE_COMMON_H

include/bitsery/details/not_defined_type.h

@@ -0,0 +1,78 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_TRAITS_CORE_NOT_DEFINED_TYPE_H
+#define BITSERY_TRAITS_CORE_NOT_DEFINED_TYPE_H
+
+#include <iterator>
+
+namespace bitsery {
+    namespace details {
+        //this type is used to show clearer error messages
+        struct NotDefinedType {
+            //just swallow anything that is passed during creating
+            template <typename ... T>
+            NotDefinedType(T&& ...){};
+            NotDefinedType() = default;
+            //define operators so that we also swallow deeper errors, to reduce error stack
+            //this time will be used as iterator, so define all operators nessesarry to work with iterators
+            friend bool operator == (const NotDefinedType&, const NotDefinedType&) {
+                return true;
+            }
+            friend bool operator != (const NotDefinedType&, const NotDefinedType&) {
+                return false;
+            }
+            NotDefinedType& operator += (int) {
+                return *this;
+            }
+            NotDefinedType& operator -= (int) {
+                return *this;
+            }
+
+            friend int operator - (const NotDefinedType&, const NotDefinedType&) {
+                return 0;
+            }
+            int& operator*() {
+                return data;
+            }
+            int data;
+        };
+
+        template <typename T>
+        struct IsDefined:public std::integral_constant<bool, !std::is_same<NotDefinedType, T>::value> {
+        };
+    }
+}
+
+namespace std {
+    //define iterator traits to work with standart algorithms
+    template <>
+    struct iterator_traits<bitsery::details::NotDefinedType> {
+        using difference_type = int;
+        using value_type = int;
+        using pointer = int*;
+        using reference = int&;
+        using iterator_category = std::random_access_iterator_tag;
+    };
+}
+#endif //BITSERY_TRAITS_CORE_NOT_DEFINED_TYPE_H

include/bitsery/details/serialization_common.h

@@ -20,220 +20,174 @@
 //OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 //SOFTWARE.
 
-#ifndef BITSERY_SERIALIZATION_COMMON_H
-#define BITSERY_SERIALIZATION_COMMON_H
+#ifndef BITSERY_DETAILS_SERIALIZATION_COMMON_H
+#define BITSERY_DETAILS_SERIALIZATION_COMMON_H
 
-#include <cstdint>
 #include <type_traits>
-#include <array>
+#include <utility>
+#include "adapter_utils.h"
+#include "../traits/core/traits.h"
 
 namespace bitsery {
 
+    //this allows to call private serialize method for the class
+    //just make friend it to that class
+    struct Access {
+        template<typename S, typename T>
+        static auto serialize(S &s, T &obj) -> decltype(obj.serialize(s)) {
+            obj.serialize(s);
+        }
+    };
+
+    //serializer/deserializer, does not public interface to get underlying writer/reader
+    //to prevent users from using writer/reader directly, because they have different interface
+    //and they cannot be used describing serialization flows.: use extensions for this reason.
+    //this class allows to get underlying adapter writer/reader, and only should be used outside serialization functions.
+    struct AdapterAccess {
+        template <typename Serializer>
+        static typename Serializer::TWriter& getWriter(Serializer& s) {
+            return s._writer;
+        }
+
+        template <typename Deserializer>
+        static typename Deserializer::TReader& getReader(Deserializer& s) {
+            return s._reader;
+        }
+    };
+
     namespace details {
 
-        template<typename T, typename Enable = void>
-        struct SAME_SIZE_UNSIGNED_TYPE {
-            typedef std::make_unsigned_t<T> type;
+        //helper types for error handling
+        template <typename T>
+        struct IsContainerTraitsDefined:public IsDefined<typename traits::ContainerTraits<T>::TValue> {
         };
 
-        template<typename T>
-        struct SAME_SIZE_UNSIGNED_TYPE<T, typename std::enable_if<std::is_enum<T>::value>::type> {
-            typedef std::make_unsigned_t<std::underlying_type_t<T>> type;
-        };
-
-        template<typename T>
-        struct SAME_SIZE_UNSIGNED_TYPE<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
-            typedef std::conditional_t<std::is_same<T, float>::value, uint32_t, uint64_t> type;
-        };
-
-        template<typename T>
-        using SAME_SIZE_UNSIGNED = typename SAME_SIZE_UNSIGNED_TYPE<T>::type;
-
         template <typename T>
-        constexpr size_t getSize(T v, size_t s) {
-            return v > 0 ? getSize(v / 2, s + 1) : s;
-        }
+        struct IsTextTraitsDefined:public IsDefined<typename traits::TextTraits<T>::TValue> {
+        };
+
+        template <typename Ext, typename T>
+        struct IsExtensionTraitsDefined:public IsDefined<typename traits::ExtensionTraits<Ext, T>::TValue> {
+        };
+
+        //helper metafunction, that is added to c++17
+        template<typename... Ts>
+        struct make_void {
+            typedef void type;
+        };
+        template<typename... Ts>
+        using void_t = typename make_void<Ts...>::type;
+
+        template <typename, typename, typename = void>
+        struct HasSerializeFunction:std::false_type {};
+
+        template <typename S, typename T>
+        struct HasSerializeFunction<S,T,
+                void_t<decltype(serialize(std::declval<S &>(), std::declval<T &>()))>
+        > : std::true_type {};
+
+
+        template <typename, typename, typename = void>
+        struct HasSerializeMethod:std::false_type {};
+
+        template <typename S, typename T>
+        struct HasSerializeMethod<S,T,
+                void_t<decltype(Access::serialize(std::declval<S &>(), std::declval<T &>()))>
+        > : std::true_type {};
+
+        template <typename, typename, typename = void>
+        struct IsFlexibleIncluded:std::false_type {};
+
+        template <typename S, typename T>
+        struct IsFlexibleIncluded<S,T,
+                void_t<decltype(archiveProcess(std::declval<S &>(), std::declval<T &&>()))>
+        > : std::true_type {};
+
+        //used for extensions, when extension TValue = void
+        struct DummyType {
+        };
+
+/*
+ * this includes all integral types floats and enums(except bool)
+ */
+        template<typename T>
+        struct IsFundamentalType : std::integral_constant<bool,
+                std::is_enum<T>::value
+                || std::is_floating_point<T>::value
+                || std::is_integral<T>::value> {
+        };
+
+        template<typename T, typename Integral = void>
+        struct IntegralFromFundamental {
+            using TValue = T;
+        };
 
         template<typename T>
-        constexpr size_t calcRequiredBits(T min, T max) {
-            //call recursive function, because some compilers only support constexpr functions with return-only body
-            return getSize(max - min, 0);
-        }
-
-    }
-
-/*
- * range functions in bitsery namespace because these are used by user
- */
-
-    template<typename T, typename Enable = void>
-    struct RangeSpec {
-
-        constexpr RangeSpec(T minValue, T maxValue)
-                : min{minValue},
-                  max{maxValue},
-                  bitsRequired{details::calcRequiredBits(min, max)} {
-        }
-
-        const T min;
-        const T max;
-        const size_t bitsRequired;
-    };
-
-
-    template<typename T>
-    struct RangeSpec<T, typename std::enable_if<std::is_enum<T>::value>::type> {
-
-        constexpr RangeSpec(T minValue, T maxValue) :
-                min{minValue},
-                max{maxValue},
-                bitsRequired{details::calcRequiredBits(
-                        static_cast<std::underlying_type_t<T>>(min),
-                        static_cast<std::underlying_type_t<T>>(max))} {
-        }
-
-        const T min;
-        const T max;
-        const size_t bitsRequired;
-    };
-
-//this class is used to make default RangeSpec float specialization always prefer constructor with precision
-    struct BitsConstraint {
-        explicit constexpr BitsConstraint(size_t bits) : value{bits} {}
-
-        const size_t value;
-    };
-
-    template<typename T>
-    struct RangeSpec<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
-
-        constexpr RangeSpec(T minValue, T maxValue, BitsConstraint bits) :
-                min{minValue},
-                max{maxValue},
-                bitsRequired{bits.value} {
-        }
-
-        constexpr RangeSpec(T minValue, T maxValue, T precision) :
-                min{minValue},
-                max{maxValue},
-                bitsRequired{details::calcRequiredBits<details::SAME_SIZE_UNSIGNED<T>>({}, ((max - min) / precision))} {
-
-        }
-
-        const T min;
-        const T max;
-        const size_t bitsRequired;
-    };
-
-    namespace details {
-
-/*
- * functions for range
- */
-
-        template<typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
-        auto getRangeValue(const T &v, const RangeSpec<T> &r) {
-            return static_cast<SAME_SIZE_UNSIGNED<T>>(v - r.min);
+        struct IntegralFromFundamental<T, typename std::enable_if<std::is_enum<T>::value>::type> {
+            using TValue = typename std::underlying_type<T>::type;
         };
 
-        template<typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
-        auto getRangeValue(const T &v, const RangeSpec<T> &r) {
-            return static_cast<SAME_SIZE_UNSIGNED<T>>(v) - static_cast<SAME_SIZE_UNSIGNED<T>>(r.min);
+        template<typename T>
+        struct IntegralFromFundamental<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
+            using TValue = typename std::conditional<std::is_same<T, float>::value, uint32_t, uint64_t>::type;
         };
 
-        template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type * = nullptr>
-        auto getRangeValue(const T &v, const RangeSpec<T> &r) {
-            using VT = SAME_SIZE_UNSIGNED<T>;
-            const VT maxUint = (static_cast<VT>(1) << r.bitsRequired) - 1;
-            const auto ratio = (v - r.min) / (r.max - r.min);
-            return static_cast<VT>(ratio * maxUint);
+        template<typename T>
+        struct UnsignedFromFundamental {
+            using type = typename std::make_unsigned<typename IntegralFromFundamental<T>::TValue>::type;
         };
 
-        template<typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
-        void setRangeValue(T& v, const RangeSpec<T>& r) {
-            v += r.min;
-        };
-
-        template<typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
-        void setRangeValue(T& v, const RangeSpec<T>& r) {
-            using VT = std::underlying_type_t<T>;
-            reinterpret_cast<VT&>(v) += static_cast<VT>(r.min);
-        };
-
-        template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
-        void setRangeValue(T& v, const RangeSpec<T>& r) {
-            using UIT = SAME_SIZE_UNSIGNED<T>;
-            const auto intRep = reinterpret_cast<UIT&>(v);
-            const UIT maxUint = (static_cast<UIT>(1) << r.bitsRequired) - 1;
-            v = r.min + (static_cast<T>(intRep) / maxUint) * (r.max - r.min);
-        };
-
-        template<typename T, typename std::enable_if<std::is_arithmetic<T>::value>::type * = nullptr>
-        bool isRangeValid(const T &v, const RangeSpec<T> &r) {
-            return !(r.min > v || v > r.max);
-        }
-
-        template<typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
-        bool isRangeValid(const T &v, const RangeSpec<T> &r) {
-            using VT = std::underlying_type_t<T>;
-            return !(static_cast<VT>(r.min) > static_cast<VT>(v)
-                     || static_cast<VT>(v) > static_cast<VT>(r.max));
-        }
-
-/*
- * functions for substitution
- */
-
-        template<typename T, size_t N>
-        size_t findSubstitutionIndex(const T &v, const std::array<T, N> &defValues) {
-            auto index{1u};
-            for (auto &d:defValues) {
-                if (d == v)
-                    return index;
-                ++index;
-            }
-            return 0u;
-        };
+        template<typename T>
+        using SameSizeUnsigned = typename UnsignedFromFundamental<T>::type;
 
 
 /*
- * delta functions
+ * functions for object serialization
  */
 
-        class ObjectMemoryPosition {
-        public:
+        template<typename S, typename T>
+        struct SerializeFunction {
 
-            template<typename T>
-            ObjectMemoryPosition(const T &oldObj, const T &newObj)
-                    :ObjectMemoryPosition{reinterpret_cast<const char *>(&oldObj), reinterpret_cast<const char *>(&newObj),
-                                          sizeof(T)} {
+            static void invoke(S &s, T &v) {
+                static_assert(HasSerializeFunction<S,T>::value || HasSerializeMethod<S,T>::value,
+                              "\nPlease define 'serialize' function for your type (inside or outside of class):\n"
+                                      "  template<typename S>\n"
+                                      "  void serialize(S& s)\n"
+                                      "  {\n"
+                                      "    ...\n"
+                                      "  }\n");
+                static_assert(!(HasSerializeFunction<S,T>::value && HasSerializeMethod<S,T>::value),
+                              "\nPlease define only one 'serialize' function (member OR free), not both.");
+                internalInvoke(s,v, HasSerializeMethod<S,T>{});
             }
-
-            template<typename T>
-            bool isFieldsEquals(const T &newObjField) {
-                return *getOldObjectField(newObjField) == newObjField;
-            }
-
-            template<typename T>
-            const T *getOldObjectField(const T &field) {
-                auto offset = reinterpret_cast<const char *>(&field) - newObj;
-                return reinterpret_cast<const T *>(oldObj + offset);
-            }
-
         private:
-
-            ObjectMemoryPosition(const char *objOld, const char *objNew, size_t)
-                    : oldObj{objOld},
-                      newObj{objNew} {
+            static void internalInvoke(S& s, T& v,std::true_type) {
+                Access::serialize(s,v);
+            }
+            static void internalInvoke(S& s, T& v,std::false_type) {
+                serialize(s,v);
             }
-
-            const char *oldObj;
-            const char *newObj;
         };
 
+/*
+ * functions for object serialization
+ */
+
+        template<typename S, typename T, typename Enabled = void>
+        struct ArchiveFunction {
+
+            static void invoke(S &s, T&& obj) {
+                static_assert(IsFlexibleIncluded<S,T>::value,
+                              "\nPlease include '<bitsery/flexible.h>' to use 'archive' function:\n");
+//                static_assert(HasSerializeFunction<S,T>::value || HasSerializeMethod<S,T>::value,
+//                              "\nPlease define 'serialize' function or include '<bitsery/flexible/...>' to use with 'archive'\n");
+
+                archiveProcess(s, std::forward<T>(obj));
+            }
+        };
 
     }
 
 }
 
-#endif //BITSERY_SERIALIZATION_COMMON_H
+#endif //BITSERY_DETAILS_SERIALIZATION_COMMON_H

include/bitsery/details/sessions.h

@@ -0,0 +1,209 @@
+//
+// Created by fraillt on 17.10.5.
+//
+
+#ifndef BITSERY_BUFFER_SESSIONS_H
+#define BITSERY_BUFFER_SESSIONS_H
+
+#include <vector>
+#include <stack>
+#include "adapter_common.h"
+
+namespace bitsery {
+
+    namespace session {
+        /*
+         * writer/reader implementations that disable session support
+         */
+        template <typename TWriter>
+        struct DisabledSessionsWriter {
+            void begin(TWriter& ) {
+                static_assert(std::is_void<TWriter>::value, "Sessions is disabled, enable it via configuration");
+            }
+            void end(TWriter& ) {
+                static_assert(std::is_void<TWriter>::value, "Sessions is disabled, enable it via configuration");
+            }
+            void flushSessions(TWriter& ) {
+            }
+        };
+
+        template <typename TReader>
+        struct DisabledSessionsReader {
+            template <typename TBufferContext>
+            DisabledSessionsReader(TReader& , TBufferContext& ) {
+            }
+
+            void begin() {
+                static_assert(std::is_void<TReader>::value, "Sessions is disabled, enable it via configuration");
+            }
+
+            void end() {
+                static_assert(std::is_void<TReader>::value, "Sessions is disabled, enable it via configuration");
+            }
+
+            bool hasActiveSessions() const {
+                return false;
+            }
+        };
+
+        /*
+         * writer/reader real implementations
+         * sessions reading requires to have random access iterators, so it cannot be used with streams
+         */
+        template <typename TWriter>
+        class SessionsWriter {
+        public:
+
+            void begin(TWriter& ) {
+                //write position
+                _sessionIndex.push(_sessions.size());
+                _sessions.emplace_back(0);
+            }
+
+            void end(TWriter& writer) {
+                assert(!_sessionIndex.empty());
+                //change position to session end
+                auto sessionIt = std::next(std::begin(_sessions), _sessionIndex.top());
+                _sessionIndex.pop();
+                *sessionIt = writer.writtenBytesCount();
+            }
+
+            void flushSessions(TWriter& writer) {
+                if (_sessions.size()) {
+                    assert(_sessionIndex.empty());
+                    auto dataSize = writer.writtenBytesCount();
+                    for(auto& s:_sessions) {
+                        details::writeSize(writer, s);
+                    }
+                    _sessions.clear();
+
+                    auto totalSize = writer.writtenBytesCount();
+                    //write offset where actual data ends
+                    auto sessionsOffset = totalSize - dataSize + 4;//4 bytes for offset data
+                    writer.template writeBytes<4>(static_cast<uint32_t>(sessionsOffset));
+                }
+            }
+        private:
+            std::vector<size_t> _sessions{};
+            std::stack<size_t> _sessionIndex;
+        };
+
+        template <typename TReader>
+        struct SessionsReader {
+            using TIterator = typename TReader::TIterator;
+
+            template <typename InputAdapter>
+            SessionsReader(TReader& r, InputAdapter& adapter)
+                    :_reader{r},
+                     _beginIt{details::SessionAccess::posIteratorRef<InputAdapter, TIterator>(adapter)},
+                     _posItRef{details::SessionAccess::posIteratorRef<InputAdapter, TIterator>(adapter)},
+                     _endItRef{details::SessionAccess::endIteratorRef<InputAdapter, TIterator>(adapter)}
+            {
+            }
+            void begin() {
+                if (_sessions.empty()) {
+                    if (!initializeSessions())
+                        return;
+                }
+
+                //save end position for current session
+                _sessionsStack.push(_endItRef);
+                if (_nextSessionIt != std::end(_sessions)) {
+                    if (std::distance(_posItRef, _endItRef) > 0) {
+                        //set end position for new session
+                        auto newEnd = std::next(_beginIt, *_nextSessionIt);
+                        if (std::distance(newEnd, _endItRef) < 0)
+                        {
+                            //new session cannot end further than current end
+                            _reader.setError(ReaderError::InvalidData);
+                            return;
+                        }
+                        _endItRef = newEnd;
+                        ++_nextSessionIt;
+                    }
+                    //if we reached the end, means that there is no more data to read, hence there is no more sessions to advance to
+                } else {
+                    //there is no data to read anymore
+                    //pos == end or buffer overflow while session is active
+                    if (!(_posItRef == _endItRef || _reader.error() == ReaderError::NoError)) {
+                        _reader.setError(ReaderError::InvalidData);
+                    }
+                }
+            }
+
+            void end() {
+                if (!_sessionsStack.empty()) {
+                    //move position to the end of session
+                    //can additionaly be checked for session data versioning
+                    //_pos == _end : same versions
+                    //distance(_pos,_end) > 0: reading newer version
+                    //error() == BUFFER_OVERFLOW: reading older version
+                    auto dist = std::distance(_posItRef, _endItRef);
+                    if (dist > 0) {
+                        //newer version might have some inner sessions, try to find the one after current ends
+                        auto currPos = static_cast<size_t>(std::distance(_beginIt, _endItRef));
+                        for (; _nextSessionIt != std::end(_sessions); ++_nextSessionIt) {
+                            if (*_nextSessionIt > currPos)
+                                break;
+                        }
+                    }
+                    _posItRef = _endItRef;
+                    //restore end position
+                    _endItRef = _sessionsStack.top();
+                    _sessionsStack.pop();
+                }
+            }
+
+            bool hasActiveSessions() const {
+                return _sessionsStack.size() > 0;
+            }
+
+        private:
+            TReader& _reader;
+            TIterator _beginIt;
+            TIterator& _posItRef;
+            TIterator& _endItRef;
+            std::vector<size_t> _sessions{};
+            std::vector<size_t>::iterator _nextSessionIt{};
+            std::stack<TIterator> _sessionsStack{};
+
+            bool initializeSessions() {
+                //save current position
+                auto currPos = _posItRef;
+                //read size
+                if (std::distance(_posItRef, _endItRef) < 4) {
+                    _reader.setError(ReaderError::InvalidData);
+                    return false;
+                }
+                auto endSessionsSizesIt = std::next(_endItRef, -4);
+                _posItRef = endSessionsSizesIt;
+                uint32_t sessionsOffset{};
+                _reader.template readBytes<4>(sessionsOffset);
+
+                auto bufferSize = std::distance(_beginIt, _endItRef);
+                if (static_cast<size_t>(bufferSize) < sessionsOffset) {
+                    _reader.setError(ReaderError::InvalidData);
+                    return false;
+                }
+                //we can initialy resizes to this value, and we'll shrink it after reading
+                //read session sizes
+                auto sessionsIt = std::back_inserter(_sessions);
+                _posItRef = std::next(_endItRef, -static_cast<int32_t>(sessionsOffset));
+                while (std::distance(_posItRef, endSessionsSizesIt) > 0) {
+                    size_t size;
+                    details::readSize(_reader, size, bufferSize);
+                    *sessionsIt++ = size;
+                }
+                _sessions.shrink_to_fit();
+                //set iterators to data
+                _posItRef = currPos;
+                _endItRef = std::next(_endItRef, -static_cast<int32_t>(sessionsOffset));
+                _nextSessionIt = std::begin(_sessions);//set before first session;
+                return true;
+            }
+        };
+
+    }
+}
+
+#endif //BITSERY_BUFFER_SESSIONS_H

include/bitsery/ext/entropy.h

@@ -0,0 +1,102 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_EXT_ENTROPY_H
+#define BITSERY_EXT_ENTROPY_H
+
+#include "value_range.h"
+
+namespace bitsery {
+
+    namespace details {
+        template<typename TValue, typename TContainer>
+        size_t findEntropyIndex(const TValue &v, const TContainer &defValues) {
+            size_t index{1u};
+            for (auto &d:defValues) {
+                if (d == v)
+                    return index;
+                ++index;
+            }
+            return 0u;
+        };
+    }
+
+    namespace ext {
+
+        template<typename TContainer>
+        class Entropy {
+        public:
+
+            /**
+             * Allows entropy-encoding technique, by writing few bits for most common values
+             * @param values list of most common values
+             * @param alignBeforeData only makes sense when bit-packing enabled, by default aligns after writing bits for index
+             */
+            constexpr Entropy(TContainer& values, bool alignBeforeData=true)
+                    : _values{values},
+                      _alignBeforeData{alignBeforeData} {
+            };
+
+            template<typename Ser, typename Writer, typename T, typename Fnc>
+            void serialize(Ser &s, Writer &writer, const T &obj, Fnc &&fnc) const {
+                assert(traits::ContainerTraits<TContainer>::size(_values) > 0);
+                auto index = details::findEntropyIndex(obj, _values);
+                s.ext(index, ext::ValueRange<size_t>{0u, traits::ContainerTraits<TContainer>::size(_values)});
+                if (_alignBeforeData)
+                    s.align();
+                if (!index)
+                    fnc(const_cast<T &>(obj));
+            }
+
+            template<typename Des, typename Reader, typename T, typename Fnc>
+            void deserialize(Des &d, Reader &reader, T &obj, Fnc &&fnc) const {
+                assert(traits::ContainerTraits<TContainer>::size(_values) > 0);
+                size_t index{};
+                d.ext(index, ext::ValueRange<size_t>{0u, traits::ContainerTraits<TContainer>::size(_values)});
+                if (_alignBeforeData)
+                    d.align();
+                if (index)
+                    obj = *std::next(std::begin(_values), index-1);
+                else
+                    fnc(obj);
+            }
+
+        private:
+            TContainer& _values;
+            bool _alignBeforeData;
+        };
+    }
+
+    namespace traits {
+        template<typename TContainer, typename T>
+        struct ExtensionTraits<ext::Entropy<TContainer>, T> {
+            using TValue = T;
+            static constexpr bool SupportValueOverload = true;
+            static constexpr bool SupportObjectOverload = true;
+            static constexpr bool SupportLambdaOverload = true;
+        };
+    }
+
+}
+
+
+#endif //BITSERY_EXT_ENTROPY_H

include/bitsery/ext/growable.h

@@ -20,48 +20,46 @@
 //OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 //SOFTWARE.
 
-
-#ifndef BITSERY_EXT_OPTIONAL_H
-#define BITSERY_EXT_OPTIONAL_H
+#ifndef BITSERY_EXT_GROWABLE_H
+#define BITSERY_EXT_GROWABLE_H
 
 namespace bitsery {
+
     namespace ext {
 
-        template <typename T>
-        using std_optional = ::std::optional<T>;
-
-        template <typename T>
-        class optional {
+        /*
+         * enables to add additional serialization methods at the end of method, without breaking existing older code
+         */
+        class Growable {
         public:
-            explicit optional(T& v):_value{v} {
-                using TOpt = typename std::remove_cv<T>::type;
-                using TVal = typename TOpt::value_type;
-                static_assert(std::is_same<TOpt, std_optional<TVal>>(), "");
-            };
-            template <typename TSerializer, typename Fnc>
-            void serialize(TSerializer& ser, const Fnc& fnc) {
-                ser.boolByte(static_cast<bool>(_value));
-                if (_value)
-                    fnc(ser, *_value);
-            }
-            template <typename TSerializer, typename Fnc>
-            void deserialize(TSerializer& ser, const Fnc& fnc) {
-                bool exists{};
-                ser.boolByte(exists);
-                if (exists) {
-                    typename T::value_type tmp{};
-                    fnc(ser, tmp);
-                    _value = tmp;
-                } else {
-                    _value = T{};
-                }
-            }
-        private:
-            T& _value;
-        };
 
+            template<typename Ser, typename Writer, typename T, typename Fnc>
+            void serialize(Ser &s, Writer &writer, const T &obj, Fnc &&fnc) const {
+                writer.beginSession();
+                fnc(const_cast<T&>(obj));
+                writer.endSession();
+            }
+
+            template<typename Des, typename Reader, typename T, typename Fnc>
+            void deserialize(Des &d, Reader &reader, T &obj, Fnc &&fnc) const {
+                reader.beginSession();
+                fnc(obj);
+                reader.endSession();
+            }
+        };
     }
+
+    namespace traits {
+        template<typename T>
+        struct ExtensionTraits<ext::Growable, T> {
+            using TValue = T;
+            static constexpr bool SupportValueOverload = false;
+            static constexpr bool SupportObjectOverload = true;
+            static constexpr bool SupportLambdaOverload = true;
+        };
+    }
+
 }
 
 
-#endif //BITSERY_EXT_OPTIONAL_H
+#endif //BITSERY_EXT_GROWABLE_H

include/bitsery/ext/std_map.h

@@ -0,0 +1,83 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_EXT_STD_MAP_H
+#define BITSERY_EXT_STD_MAP_H
+
+#include "../details/adapter_utils.h"
+
+namespace bitsery {
+    namespace ext {
+
+        class StdMap {
+        public:
+
+            constexpr explicit StdMap(size_t maxSize):_maxSize{maxSize} {}
+
+            template<typename Ser, typename Writer, typename T, typename Fnc>
+            void serialize(Ser &, Writer &writer, const T &obj, Fnc &&fnc) const {
+                using TKey = typename T::key_type;
+                using TValue = typename T::mapped_type;
+                auto size = obj.size();
+                assert(size <= _maxSize);
+                details::writeSize(writer, size);
+
+                for (auto &v:obj)
+                    fnc(const_cast<TKey &>(v.first), const_cast<TValue &>(v.second));
+            }
+
+            template<typename Des, typename Reader, typename T, typename Fnc>
+            void deserialize(Des &, Reader &reader, T &obj, Fnc &&fnc) const {
+                using TKey = typename T::key_type;
+                using TValue = typename T::mapped_type;
+
+                size_t size{};
+                details::readSize(reader, size, _maxSize);
+                auto hint = obj.begin();
+                obj.clear();
+
+                for (auto i = 0u; i < size; ++i) {
+                    TKey key;
+                    TValue value;
+                    fnc(key, value);
+                    hint = obj.emplace_hint(hint, std::move(key), std::move(value));
+                }
+            }
+        private:
+            size_t _maxSize;
+        };
+    }
+
+    namespace traits {
+        template<typename T>
+        struct ExtensionTraits<ext::StdMap, T> {
+            using TValue = void;
+            static constexpr bool SupportValueOverload = false;
+            static constexpr bool SupportObjectOverload = false;
+            static constexpr bool SupportLambdaOverload = true;
+        };
+    }
+
+}
+
+
+#endif //BITSERY_EXT_STD_MAP_H

include/bitsery/ext/std_optional.h

@@ -0,0 +1,103 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_EXT_STD_OPTIONAL_H
+#define BITSERY_EXT_STD_OPTIONAL_H
+
+
+//this module do not include optional, but expects it to be declared in std::optional
+//if you're using experimental optional from <experimental/optional>
+//add it in std namespace like this:
+//namespace std {
+//    template <typename T>
+//    using optional = experimental::optional<T>;
+//}
+#include <type_traits>
+
+namespace bitsery {
+    namespace ext {
+
+        template<typename T>
+        using std_optional = ::std::optional<T>;
+
+        class StdOptional {
+        public:
+
+            /**
+             * Works with std::optional types
+             * @param alignBeforeData only makes sense when bit-packing enabled, by default aligns after writing/reading bool state of optional
+             */
+            explicit StdOptional(bool alignBeforeData=true):_alignBeforeData{alignBeforeData} {}
+            template<typename T>
+            constexpr void assertType() const {
+                using TOpt = typename std::remove_cv<T>::type;
+                using TVal = typename TOpt::value_type;
+                static_assert(std::is_same<TOpt, std_optional<TVal>>(), "");
+                static_assert(std::is_default_constructible<TVal>::value, "");
+            };
+
+            template<typename Ser, typename Writer, typename T, typename Fnc>
+            void serialize(Ser &ser, Writer &, const T &obj, Fnc &&fnc) const {
+                assertType<T>();
+                ser.boolValue(static_cast<bool>(obj));
+                if (_alignBeforeData)
+                    ser.align();
+                if (obj)
+                    fnc(const_cast<typename T::value_type & >(*obj));
+            }
+
+            template<typename Des, typename Reader, typename T, typename Fnc>
+            void deserialize(Des &des, Reader &, T &obj, Fnc &&fnc) const {
+                assertType<T>();
+                bool exists{};
+                des.boolValue(exists);
+                if (_alignBeforeData)
+                    des.align();
+                if (exists) {
+                    typename T::value_type tmp{};
+                    fnc(tmp);
+                    obj = tmp;
+                } else {
+                    //experimental optional doesnt have .reset method
+                    obj = T{};
+                }
+            }
+        private:
+            bool _alignBeforeData;
+        };
+    }
+
+    namespace traits {
+        template<typename T>
+        struct ExtensionTraits<ext::StdOptional, T> {
+            using TValue = typename T::value_type;
+            static constexpr bool SupportValueOverload = true;
+            static constexpr bool SupportObjectOverload = true;
+            static constexpr bool SupportLambdaOverload = true;
+        };
+    }
+
+}
+
+
+#endif //BITSERY_EXT_STD_OPTIONAL_H

include/bitsery/ext/std_queue.h

@@ -0,0 +1,111 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_EXT_STD_QUEUE_H
+#define BITSERY_EXT_STD_QUEUE_H
+
+#include <type_traits>
+#include <queue>
+//include type traits for deque and vector, because they are defaults for queue and priority_queue
+#include "../traits/deque.h"
+#include "../traits/vector.h"
+
+namespace bitsery {
+    namespace ext {
+
+        class StdQueue {
+        private:
+            //inherit from queue so we could take underlying container
+            template <typename T, typename C>
+            struct QueueCnt : public std::queue<T, C>
+            {
+                static const C& getContainer(const std::queue<T, C>& s )
+                {
+                    //get address of underlying container
+                    return s.*(&QueueCnt::c);
+                }
+                static C& getContainer(std::queue<T, C>& s )
+                {
+                    //get address of underlying container
+                    return s.*(&QueueCnt::c);
+                }
+            };
+            //inherit from queue so we could take underlying container
+            template <typename T, typename C>
+            struct PriorityQueueCnt : public std::priority_queue<T, C>
+            {
+                static const C& getContainer(const std::priority_queue<T, C>& s )
+                {
+                    //get address of underlying container
+                    return s.*(&PriorityQueueCnt::c);
+                }
+                static C& getContainer(std::priority_queue<T, C>& s )
+                {
+                    //get address of underlying container
+                    return s.*(&PriorityQueueCnt::c);
+                }
+            };
+
+            size_t _maxSize;
+        public:
+            explicit StdQueue(size_t maxSize):_maxSize{maxSize} {};
+
+            //for queue
+            template<typename Ser, typename Writer, typename T, typename C, typename Fnc>
+            void serialize(Ser &ser, Writer &, const std::queue<T,C> &obj, Fnc &&fnc) const {
+                ser.container(QueueCnt<T,C>::getContainer(obj), _maxSize, std::forward<Fnc>(fnc));
+            }
+
+            template<typename Des, typename Reader, typename T, typename C, typename Fnc>
+            void deserialize(Des &des, Reader &, std::queue<T,C> &obj, Fnc &&fnc) const {
+                des.container(QueueCnt<T,C>::getContainer(obj), _maxSize, std::forward<Fnc>(fnc));
+            }
+
+            //for priority_queue
+            template<typename Ser, typename Writer, typename T, typename C, typename Fnc>
+            void serialize(Ser &ser, Writer &, const std::priority_queue<T,C> &obj, Fnc &&fnc) const {
+                ser.container(PriorityQueueCnt<T,C>::getContainer(obj), _maxSize, std::forward<Fnc>(fnc));
+            }
+
+            template<typename Des, typename Reader, typename T, typename C, typename Fnc>
+            void deserialize(Des &des, Reader &, std::priority_queue<T,C> &obj, Fnc &&fnc) const {
+                des.container(PriorityQueueCnt<T,C>::getContainer(obj), _maxSize, std::forward<Fnc>(fnc));
+            }
+
+        };
+    }
+
+    namespace traits {
+        template<typename T>
+        struct ExtensionTraits<ext::StdQueue, T> {
+            using TValue = typename T::value_type;
+            static constexpr bool SupportValueOverload = true;
+            static constexpr bool SupportObjectOverload = true;
+            static constexpr bool SupportLambdaOverload = true;
+        };
+    }
+
+}
+
+
+#endif //BITSERY_EXT_STD_QUEUE_H

include/bitsery/ext/std_set.h

@@ -0,0 +1,97 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_EXT_STD_SET_H
+#define BITSERY_EXT_STD_SET_H
+
+#include <cassert>
+#include "../details/adapter_utils.h"
+//we need this, so we could
+#include <unordered_set>
+
+namespace bitsery {
+    namespace ext {
+
+        class StdSet {
+        public:
+
+            constexpr explicit StdSet(size_t maxSize):_maxSize{maxSize} {}
+
+            template<typename Ser, typename Writer, typename T, typename Fnc>
+            void serialize(Ser &, Writer &writer, const T &obj, Fnc &&fnc) const {
+                using TKey = typename T::key_type;
+                auto size = obj.size();
+                assert(size <= _maxSize);
+                details::writeSize(writer, size);
+
+                for (auto &v:obj)
+                    fnc(const_cast<TKey &>(v));
+            }
+
+            template<typename Des, typename Reader, typename T, typename Fnc>
+            void deserialize(Des &, Reader &reader, T &obj, Fnc &&fnc) const {
+                using TKey = typename T::key_type;
+
+                size_t size{};
+                details::readSize(reader, size, _maxSize);
+                auto hint = obj.begin();
+                obj.clear();
+                reserve(obj, size);
+
+                for (auto i = 0u; i < size; ++i) {
+                    TKey key;
+                    fnc(key);
+                    hint = obj.emplace_hint(hint, std::move(key));
+                }
+            }
+        private:
+
+            template <typename T>
+            void reserve(std::unordered_set<T>& obj, size_t size) const {
+                obj.reserve(size);
+            }
+            template <typename T>
+            void reserve(std::unordered_multiset<T>& obj, size_t size) const {
+                obj.reserve(size);
+            }
+            template <typename T>
+            void reserve(T obj, size_t size) const {
+                //for ordered container do nothing
+            }
+            size_t _maxSize;
+        };
+    }
+
+    namespace traits {
+        template<typename T>
+        struct ExtensionTraits<ext::StdSet, T> {
+            using TValue = typename T::key_type;
+            static constexpr bool SupportValueOverload = true;
+            static constexpr bool SupportObjectOverload = true;
+            static constexpr bool SupportLambdaOverload = true;
+        };
+    }
+
+}
+
+
+#endif //BITSERY_EXT_STD_SET_H

include/bitsery/ext/std_stack.h

@@ -0,0 +1,82 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_EXT_STD_STACK_H
+#define BITSERY_EXT_STD_STACK_H
+
+#include <type_traits>
+#include <stack>
+//include type traits for deque, because stack default underlying container is deque
+#include "../traits/deque.h"
+
+namespace bitsery {
+    namespace ext {
+
+        class StdStack {
+        private:
+            //inherit from stack so we could take underlying container
+            template <typename T, typename C>
+            struct StackCnt : public std::stack<T, C>
+            {
+                static const C& getContainer(const std::stack<T, C>& s )
+                {
+                    //get address of underlying container
+                    return s.*(&StackCnt::c);
+                }
+                static C& getContainer(std::stack<T, C>& s )
+                {
+                    //get address of underlying container
+                    return s.*(&StackCnt::c);
+                }
+            };
+            size_t _maxSize;
+        public:
+            explicit StdStack(size_t maxSize):_maxSize{maxSize} {};
+
+            template<typename Ser, typename Writer, typename T, typename C, typename Fnc>
+            void serialize(Ser &ser, Writer &, const std::stack<T,C> &obj, Fnc &&fnc) const {
+                ser.container(StackCnt<T,C>::getContainer(obj), _maxSize, std::forward<Fnc>(fnc));
+            }
+
+            template<typename Des, typename Reader, typename T, typename C, typename Fnc>
+            void deserialize(Des &des, Reader &, std::stack<T,C> &obj, Fnc &&fnc) const {
+                des.container(StackCnt<T,C>::getContainer(obj), _maxSize, std::forward<Fnc>(fnc));
+            }
+
+        };
+    }
+
+    namespace traits {
+        template<typename T>
+        struct ExtensionTraits<ext::StdStack, T> {
+            using TValue = typename T::value_type;
+            static constexpr bool SupportValueOverload = true;
+            static constexpr bool SupportObjectOverload = true;
+            static constexpr bool SupportLambdaOverload = true;
+        };
+    }
+
+}
+
+
+#endif //BITSERY_EXT_STD_STACK_H

include/bitsery/ext/value_range.h

@@ -0,0 +1,206 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_EXT_VALUE_RANGE_H
+#define BITSERY_EXT_VALUE_RANGE_H
+
+#include "../details/serialization_common.h"
+#include "../details/adapter_common.h"
+#include <cassert>
+
+namespace bitsery {
+
+    namespace ext {
+        //this class is used to make default RangeSpec float specialization always prefer constructor with precision
+        struct BitsConstraint {
+            explicit constexpr BitsConstraint(size_t bits) : value{bits} {}
+
+            const size_t value;
+        };
+    }
+
+    //implementation details for range functionality
+    namespace details {
+
+        template<typename T>
+        constexpr size_t getSize(T v, size_t s) {
+            return v > 0 ? getSize(v / 2, s + 1) : s;
+        }
+
+        template<typename T>
+        constexpr size_t calcRequiredBits(T min, T max) {
+            //call recursive function, because some compilers only support constexpr functions with return-only body
+            return getSize(max - min, 0);
+        }
+
+        template<typename T, typename Enable = void>
+        struct RangeSpec {
+
+            constexpr RangeSpec(T minValue, T maxValue)
+                    : min{minValue},
+                      max{maxValue},
+                      bitsRequired{calcRequiredBits(min, max)} {
+            }
+
+            const T min;
+            const T max;
+            const size_t bitsRequired;
+        };
+
+
+        template<typename T>
+        struct RangeSpec<T, typename std::enable_if<std::is_enum<T>::value>::type> {
+
+            constexpr RangeSpec(T minValue, T maxValue) :
+                    min{minValue},
+                    max{maxValue},
+                    bitsRequired{calcRequiredBits(
+                            static_cast<typename std::underlying_type<T>::type>(min),
+                            static_cast<typename std::underlying_type<T>::type>(max))} {
+            }
+
+            const T min;
+            const T max;
+            const size_t bitsRequired;
+        };
+
+
+        template<typename T>
+        struct RangeSpec<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
+
+            constexpr RangeSpec(T minValue, T maxValue, ext::BitsConstraint bits) :
+                    min{minValue},
+                    max{maxValue},
+                    bitsRequired{bits.value} {
+            }
+
+            constexpr RangeSpec(T minValue, T maxValue, T precision) :
+                    min{minValue},
+                    max{maxValue},
+                    bitsRequired{calcRequiredBits<details::SameSizeUnsigned<T>>({}, ((max - min) / precision))} {
+
+            }
+
+            const T min;
+            const T max;
+            const size_t bitsRequired;
+        };
+
+        template<typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
+        details::SameSizeUnsigned<T> getRangeValue(const T &v, const RangeSpec<T> &r) {
+            return static_cast<details::SameSizeUnsigned<T>>(v - r.min);
+        };
+
+        template<typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
+        details::SameSizeUnsigned<T> getRangeValue(const T &v, const RangeSpec<T> &r) {
+            using VT = details::SameSizeUnsigned<T>;
+            return static_cast<VT>(static_cast<VT>(v) - static_cast<VT>(r.min));
+        };
+
+        template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type * = nullptr>
+        details::SameSizeUnsigned<T> getRangeValue(const T &v, const RangeSpec<T> &r) {
+            using VT = details::SameSizeUnsigned<T>;
+            const VT maxUint = (static_cast<VT>(1) << r.bitsRequired) - 1;
+            const auto ratio = (v - r.min) / (r.max - r.min);
+            return static_cast<VT>(ratio * maxUint);
+        };
+
+        template<typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
+        void setRangeValue(T &v, const RangeSpec<T> &r) {
+            v += r.min;
+        };
+
+        template<typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
+        void setRangeValue(T &v, const RangeSpec<T> &r) {
+            using VT = typename std::underlying_type<T>::type;
+            reinterpret_cast<VT &>(v) += static_cast<VT>(r.min);
+        };
+
+        template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type * = nullptr>
+        void setRangeValue(T &v, const RangeSpec<T> &r) {
+            using UIT = details::SameSizeUnsigned<T>;
+            const auto intRep = reinterpret_cast<UIT &>(v);
+            const UIT maxUint = (static_cast<UIT>(1) << r.bitsRequired) - 1;
+            v = r.min + (static_cast<T>(intRep) / maxUint) * (r.max - r.min);
+        };
+
+        template<typename T, typename std::enable_if<std::is_arithmetic<T>::value>::type * = nullptr>
+        bool isRangeValid(const T &v, const RangeSpec<T> &r) {
+            return !(r.min > v || v > r.max);
+        }
+
+        template<typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
+        bool isRangeValid(const T &v, const RangeSpec<T> &r) {
+            using VT = typename std::underlying_type<T>::type;
+            return !(static_cast<VT>(r.min) > static_cast<VT>(v)
+                     || static_cast<VT>(v) > static_cast<VT>(r.max));
+        }
+    }
+
+    namespace ext {
+
+        template<typename TValue>
+        class ValueRange {
+        public:
+
+            template<typename ... Args>
+            explicit constexpr ValueRange(Args &&... args):_range{std::forward<Args>(args)...} {};
+
+            template<typename Ser, typename Writer, typename T, typename Fnc>
+            void serialize(Ser &, Writer &writer, const T &v, Fnc &&) const {
+                assert(details::isRangeValid(v, _range));
+                using BT = decltype(details::getRangeValue(v, _range));
+                writer.template writeBits<BT>(details::getRangeValue(v, _range), _range.bitsRequired);
+            }
+
+            template<typename Des, typename Reader, typename T, typename Fnc>
+            void deserialize(Des &, Reader &reader, T &v, Fnc &&) const {
+                reader.readBits(reinterpret_cast<details::SameSizeUnsigned<T> &>(v), _range.bitsRequired);
+                details::setRangeValue(v, _range);
+                if (!details::isRangeValid(v, _range)) {
+                    reader.setError(ReaderError::InvalidData);
+                    v = _range.min;
+                }
+            }
+
+            constexpr size_t getRequiredBits() const {
+                return _range.bitsRequired;
+            };
+        private:
+            details::RangeSpec<TValue> _range;
+        };
+    }
+
+    namespace traits {
+        template<typename T>
+        struct ExtensionTraits<ext::ValueRange<T>, T> {
+            using TValue = void;
+            static constexpr bool SupportValueOverload = false;
+            static constexpr bool SupportObjectOverload = true;
+            static constexpr bool SupportLambdaOverload = false;
+        };
+    }
+
+}
+
+
+#endif //BITSERY_EXT_VALUE_RANGE_H

include/bitsery/flexible.h

@@ -0,0 +1,110 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_H
+#define BITSERY_FLEXIBLE_H
+
+#include "details/serialization_common.h"
+#include "details/flexible_common.h"
+
+namespace bitsery {
+
+    namespace flexible {
+
+        //overload when T is reference type
+        template<typename S, typename T>
+        void archiveProcessImpl(S &s, T &&head, std::true_type) {
+            s.object(std::forward<T>(head));
+        };
+
+        //overload when T is rvalue type, only allowable for behaviour modifying functions for deserializer
+        template<typename S, typename T>
+        void archiveProcessImpl(S &s, T &&head, std::false_type) {
+            static_assert(std::is_base_of<ArchiveWrapperFnc, T>::value,
+                          "\nOnly archive behaviour modifying functions can be passed by rvalue to deserializer\n");
+            serialize(s, head);
+        };
+
+    }
+
+    //define function that enables s.archive(....) usage
+    template<typename S, typename T>
+    void archiveProcess(S &s, T &&head) {
+        flexible::archiveProcessImpl(s, std::forward<T>(head), std::is_reference<T>{});
+    }
+
+    //wrapper functions that enables to serialize as container or string
+    template<typename T, size_t N>
+    flexible::CArray<T, N, true> asText(T (&str)[N]) {
+        return {str};
+    };
+
+    template<typename T, size_t N>
+    flexible::CArray<T, N, false> asContainer(T (&obj)[N]) {
+        return {obj};
+    };
+
+    template <typename T>
+    flexible::MaxSize<T> maxSize(T& obj, size_t max) {
+        return {obj, max};
+    }
+
+//define serialize function for fundamental types
+    template<typename S>
+    void serialize(S &s, bool &v) {
+        s.boolValue(v);
+    }
+
+    template<typename S, typename T, typename std::enable_if<details::IsFundamentalType<T>::value>::type * = nullptr>
+    void serialize(S &s, T &v) {
+        s.template value<sizeof(T)>(v);
+    };
+
+//define serialization for c-style container
+
+    //if array is integral type, specify explicitly how to process: as text or container
+    template<typename S, typename T, size_t N, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
+    void serialize(S &s, T (&obj)[N]) {
+        static_assert(N == 0,
+                      "\nPlease use 'asText(obj)' or 'asContainer(obj)' when using c-style array with integral types\n");
+    };
+
+    template<typename S, typename T, size_t N, typename std::enable_if<!std::is_integral<T>::value>::type * = nullptr>
+    void serialize(S &s, T (&obj)[N]) {
+        flexible::processContainer(s, obj);
+    };
+
+    //this is a helper class that enforce fundamental type sizes, when used on multiple platforms
+    template <size_t TShort, size_t TInt, size_t TLong, size_t TLongLong>
+    void assertFundamentalTypeSizes() {
+        //http://en.cppreference.com/w/cpp/language/types
+        static_assert(sizeof(short) == TShort, "");
+        static_assert(sizeof(int) == TInt, "");
+        static_assert(sizeof(long) == TLong, "");
+        static_assert(sizeof(long long) == TLongLong, "");
+        //for completion we also need pointer type size, but serializer doesn't support pointer serialization.
+    };
+
+}
+
+#endif //BITSERY_FLEXIBLE_H

include/bitsery/flexible/array.h

@@ -0,0 +1,37 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_ARRAY_H
+#define BITSERY_FLEXIBLE_TYPE_STD_ARRAY_H
+
+#include "../traits/array.h"
+#include "../details/flexible_common.h"
+
+namespace bitsery {
+    template<typename S, typename T, size_t N>
+    void serialize(S &s, std::array<T, N> &obj) {
+        flexible::processContainer(s, obj);
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_ARRAY_H

include/bitsery/flexible/deque.h

@@ -0,0 +1,37 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_DEQUE_H
+#define BITSERY_FLEXIBLE_TYPE_STD_DEQUE_H
+
+#include "../traits/deque.h"
+#include "../details/flexible_common.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::deque<TArgs... > &obj) {
+        flexible::processContainer(s, obj);
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_DEQUE_H

include/bitsery/flexible/forward_list.h

@@ -0,0 +1,37 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_FORWARD_LIST_H
+#define BITSERY_FLEXIBLE_TYPE_STD_FORWARD_LIST_H
+
+#include "../traits/forward_list.h"
+#include "../details/flexible_common.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::forward_list<TArgs... > &obj) {
+        flexible::processContainer(s, obj);
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_FORWARD_LIST_H

include/bitsery/flexible/list.h

@@ -0,0 +1,37 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_LIST_H
+#define BITSERY_FLEXIBLE_TYPE_STD_LIST_H
+
+#include "../traits/list.h"
+#include "../details/flexible_common.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::list<TArgs... > &obj) {
+        flexible::processContainer(s, obj);
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_LIST_H

include/bitsery/flexible/map.h

@@ -0,0 +1,54 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_MAP_H
+#define BITSERY_FLEXIBLE_TYPE_STD_MAP_H
+
+#include <map>
+#include "../ext/std_map.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::map<TArgs ... > &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        using TKey = typename std::map<TArgs...>::key_type;
+        using TValue = typename std::map<TArgs...>::mapped_type;
+        s.ext(obj, ext::StdMap{maxSize},
+              [&s](TKey& key, TValue& value) {
+                  s.object(key);
+                  s.object(value);
+              });
+    }
+
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::multimap<TArgs ... > &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        using TKey = typename std::multimap<TArgs...>::key_type;
+        using TValue = typename std::multimap<TArgs...>::mapped_type;
+        s.ext(obj, ext::StdMap{maxSize},
+              [&s](TKey& key, TValue& value) {
+                  s.object(key);
+                  s.object(value);
+              });
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_MAP_H

include/bitsery/flexible/queue.h

@@ -0,0 +1,42 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_QUEUE_H
+#define BITSERY_FLEXIBLE_TYPE_STD_QUEUE_H
+
+#include "../ext/std_queue.h"
+
+namespace bitsery {
+    template<typename S, typename T, typename C>
+    void serialize(S &s, std::queue<T, C> &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        s.ext(obj, ext::StdQueue{maxSize});
+    }
+
+    template<typename S, typename T, typename C, typename Comp>
+    void serialize(S &s, std::priority_queue<T, C, Comp> &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        s.ext(obj, ext::StdQueue{maxSize});
+    }
+
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_QUEUE_H

include/bitsery/flexible/set.h

@@ -0,0 +1,43 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_SET_H
+#define BITSERY_FLEXIBLE_TYPE_STD_SET_H
+
+#include <set>
+#include "../ext/std_set.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::set<TArgs...> &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        s.ext(obj, ext::StdSet{maxSize});
+    }
+
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::multiset<TArgs...> &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        s.ext(obj, ext::StdSet{maxSize});
+    }
+
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_SET_H

include/bitsery/flexible/stack.h

@@ -0,0 +1,36 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_STACK_H
+#define BITSERY_FLEXIBLE_TYPE_STD_STACK_H
+
+#include "../ext/std_stack.h"
+
+namespace bitsery {
+    template<typename S, typename T, typename C>
+    void serialize(S &s, std::stack<T, C> &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        s.ext(obj, ext::StdStack{maxSize});
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_STACK_H

include/bitsery/flexible/string.h

@@ -0,0 +1,37 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_STRING_H
+#define BITSERY_FLEXIBLE_TYPE_STD_STRING_H
+
+#include "../traits/string.h"
+#include "../details/flexible_common.h"
+
+namespace bitsery {
+    template<typename S, typename T, typename ... TArgs>
+    void serialize(S &s, std::basic_string<T, TArgs...> &str) {
+        flexible::processContainer(s, str);
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_STRING_H

include/bitsery/flexible/unordered_map.h

@@ -0,0 +1,55 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_UNORDERED_MAP_H
+#define BITSERY_FLEXIBLE_TYPE_STD_UNORDERED_MAP_H
+
+#include <unordered_map>
+#include "../ext/std_map.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::unordered_map<TArgs ... > &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        using TKey = typename std::unordered_map<TArgs...>::key_type;
+        using TValue = typename std::unordered_map<TArgs...>::mapped_type;
+        s.ext(obj, ext::StdMap{maxSize},
+              [&s](TKey& key, TValue& value) {
+                  s.object(key);
+                  s.object(value);
+              });
+    }
+
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::unordered_multimap<TArgs ... > &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        using TKey = typename std::unordered_multimap<TArgs...>::key_type;
+        using TValue = typename std::unordered_multimap<TArgs...>::mapped_type;
+        s.ext(obj, ext::StdMap{maxSize},
+              [&s](TKey& key, TValue& value) {
+                  s.object(key);
+                  s.object(value);
+              });
+    }
+
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_UNORDERED_MAP_H

include/bitsery/flexible/unordered_set.h

@@ -0,0 +1,43 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_UNORDERED_SET_H
+#define BITSERY_FLEXIBLE_TYPE_STD_UNORDERED_SET_H
+
+#include <unordered_set>
+#include "../ext/std_set.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::unordered_set<TArgs...> &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        s.ext(obj, ext::StdSet{maxSize});
+    }
+
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::unordered_multiset<TArgs...> &obj, size_t maxSize = std::numeric_limits<size_t>::max()) {
+        s.ext(obj, ext::StdSet{maxSize});
+    }
+
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_UNORDERED_SET_H

include/bitsery/flexible/vector.h

@@ -0,0 +1,37 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_FLEXIBLE_TYPE_STD_VECTOR_H
+#define BITSERY_FLEXIBLE_TYPE_STD_VECTOR_H
+
+#include "../traits/vector.h"
+#include "../details/flexible_common.h"
+
+namespace bitsery {
+    template<typename S, typename ... TArgs>
+    void serialize(S &s, std::vector<TArgs... > &obj) {
+        flexible::processContainer(s, obj);
+    }
+}
+
+#endif //BITSERY_FLEXIBLE_TYPE_STD_VECTOR_H

include/bitsery/serializer.h

@@ -21,284 +21,308 @@
 //SOFTWARE.
 
 
-
 #ifndef BITSERY_SERIALIZER_H
 #define BITSERY_SERIALIZER_H
 
-#include "common.h"
-#include <array>
 #include "details/serialization_common.h"
+#include "adapter_writer.h"
+#include <cassert>
 
 namespace bitsery {
 
-    template<typename Writter>
-    class Serializer {
+    template<typename TAdapterWriter>
+    class BasicSerializer {
     public:
-        Serializer(Writter &w) : _writter{w} {};
+        //this is used by AdapterAccess class
+        using TWriter = TAdapterWriter;
+        //helper type, that always returns bit-packing enabled type, useful inside serialize function when enabling bitpacking
+        using BPEnabledType = BasicSerializer<typename std::conditional<TAdapterWriter::BitPackingEnabled,
+                TAdapterWriter, AdapterWriterBitPackingWrapper<TAdapterWriter>>::type>;
 
-        template<typename T>
-        Serializer& object(const T &obj) {
-            return serialize(*this, obj);
-        }
-
-        //in c++17 change "class" to typename
-        template <template <typename> class Extension, typename TValue, typename Fnc>
-        Serializer& ext(const TValue& v, Fnc&& fnc ) {
-            Extension<const TValue> ext{v};
-            ext.serialize(*this, std::forward<Fnc>(fnc));
-            return *this;
+        template <typename WriterParam>
+        explicit BasicSerializer(WriterParam&& w, void* context = nullptr)
+                : _writer{std::forward<WriterParam>(w)},
+                  _context{context}
+        {
         };
 
+        //copying disabled
+        BasicSerializer(const BasicSerializer&) = delete;
+        BasicSerializer& operator = (const BasicSerializer&) = delete;
+
+        //move enabled
+        BasicSerializer(BasicSerializer&& ) = default;
+        BasicSerializer& operator = (BasicSerializer&& ) = default;
+
+        /*
+         * get serialization context.
+         * this is optional, but might be required for some specific serialization flows.
+         */
+        void* context() {
+            return _context;
+        }
+
+        /*
+         * object function
+         */
+        template<typename T>
+        void object(const T &obj) {
+            details::SerializeFunction<BasicSerializer, T>::invoke(*this, const_cast<T& >(obj));
+        }
+
+        template<typename T, typename Fnc>
+        void object(const T &obj, Fnc &&fnc) {
+            fnc(const_cast<T& >(obj));
+        };
+
+        /*
+         * functionality, that enables simpler serialization syntax, by including additional header
+         */
+        template<typename T, typename ... TArgs>
+        void archive(T &&head, TArgs &&... tail) {
+            //serialize object
+            details::ArchiveFunction<BasicSerializer, T>::invoke(*this, std::forward<T>(head));
+            //expand other elements
+            archive(std::forward<TArgs>(tail)...);
+        }
 
         /*
          * value overloads
          */
 
-        template<size_t VSIZE, typename T, typename std::enable_if<std::is_floating_point<T>::value>::type * = nullptr>
-        Serializer& value(const T &v) {
-            static_assert(std::numeric_limits<T>::is_iec559, "");
-            _writter.template writeBytes<VSIZE>(reinterpret_cast<const details::SAME_SIZE_UNSIGNED<T> &>(v));
-            return *this;
-        }
-
-        template<size_t VSIZE, typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
-        Serializer& value(const T &v) {
-            _writter.template writeBytes<VSIZE>(reinterpret_cast<const std::underlying_type_t<T> &>(v));
-            return *this;
-        }
-
-        template<size_t VSIZE, typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
-        Serializer& value(const T &v) {
-            _writter.template writeBytes<VSIZE>(v);
-            return *this;
+        template<size_t VSIZE, typename T, typename std::enable_if<details::IsFundamentalType<T>::value>::type * = nullptr>
+        void value(const T &v) {
+            using TValue = typename details::IntegralFromFundamental<T>::TValue;
+            _writer.template writeBytes<VSIZE>(reinterpret_cast<const TValue &>(v));
         }
 
         /*
-         * bool
+         * enable bit-packing
          */
-
-        Serializer& boolBit(bool v) {
-            _writter.writeBits(static_cast<unsigned char>(v ? 1 : 0), 1);
-            return *this;
-        }
-
-        Serializer& boolByte(bool v) {
-            _writter.template writeBytes<1>(static_cast<unsigned char>(v ? 1 : 0));
-            return *this;
+        template <typename Fnc>
+        void enableBitPacking(Fnc&& fnc) {
+            procEnableBitPacking(std::forward<Fnc>(fnc), std::integral_constant<bool, TAdapterWriter::BitPackingEnabled>{});
         }
 
         /*
-         * range
+         * extension functions
          */
 
-        template<typename T>
-        Serializer& range(const T &v, const RangeSpec<T> &range) {
-            assert(details::isRangeValid(v, range));
-            _writter.template writeBits<decltype(details::getRangeValue(v, range))>(details::getRangeValue(v, range), range.bitsRequired);
-            return *this;
-        }
+        template<typename T, typename Ext, typename Fnc>
+        void ext(const T &obj, const Ext &extension, Fnc &&fnc) {
+            static_assert(details::IsExtensionTraitsDefined<Ext, T>::value, "Please define ExtensionTraits");
+            static_assert(traits::ExtensionTraits<Ext,T>::SupportLambdaOverload,
+                          "extension doesn't support overload with lambda");
+            extension.serialize(*this, _writer, obj, std::forward<Fnc>(fnc));
+        };
+
+        template<size_t VSIZE, typename T, typename Ext>
+        void ext(const T &obj, const Ext &extension) {
+            static_assert(details::IsExtensionTraitsDefined<Ext, T>::value, "Please define ExtensionTraits");
+            static_assert(traits::ExtensionTraits<Ext,T>::SupportValueOverload,
+                          "extension doesn't support overload with `value<N>`");
+            using ExtVType = typename traits::ExtensionTraits<Ext, T>::TValue;
+            using VType = typename std::conditional<std::is_void<ExtVType>::value, details::DummyType, ExtVType>::type;
+            extension.serialize(*this, _writer, obj, [this](VType &v) { value<VSIZE>(v); });
+        };
+
+        template<typename T, typename Ext>
+        void ext(const T &obj, const Ext &extension) {
+            static_assert(details::IsExtensionTraitsDefined<Ext, T>::value, "Please define ExtensionTraits");
+            static_assert(traits::ExtensionTraits<Ext,T>::SupportObjectOverload,
+                          "extension doesn't support overload with `object`");
+            using ExtVType = typename traits::ExtensionTraits<Ext, T>::TValue;
+            using VType = typename std::conditional<std::is_void<ExtVType>::value, details::DummyType, ExtVType>::type;
+            extension.serialize(*this, _writer, obj, [this](VType &v) { object(v); });
+        };
 
         /*
-         * substitution overloads
+         * boolValue
          */
-        template<typename T, size_t N, typename Fnc>
-        Serializer& substitution(const T &v, const std::array<T, N> &expectedValues, Fnc &&fnc) {
-            auto index = details::findSubstitutionIndex(v, expectedValues);
-            range(index, {{}, N +1});
-            if (!index)
-                fnc(*this, v);
-            return *this;
-        };
 
-        template<size_t VSIZE, typename T, size_t N>
-        Serializer& substitution(const T &v, const std::array<T, N> &expectedValues) {
-            auto index = details::findSubstitutionIndex(v, expectedValues);
-            range(index, {{}, N +1});
-            if (!index)
-                value<VSIZE>(v);
-            return *this;
-        };
-
-        template<typename T, size_t N>
-        Serializer& substitution(const T &v, const std::array<T, N> &expectedValues) {
-            auto index = details::findSubstitutionIndex(v, expectedValues);
-            range(index, {{}, N +1});
-            if (!index)
-                object(v);
-            return *this;
-        };
+        void boolValue(bool v) {
+            procBoolValue(v, std::integral_constant<bool, TAdapterWriter::BitPackingEnabled>{});
+        }
 
         /*
          * text overloads
          */
 
         template<size_t VSIZE, typename T>
-        Serializer& text(const std::basic_string<T> &str, size_t maxSize) {
-            assert(str.size() <= maxSize);
-            auto first = std::begin(str);
-            auto last = std::end(str);
-            writeSize(std::distance(first, last));
-            procContainer<VSIZE>(first, last, std::true_type{});
-            return *this;
+        void text(const T &str, size_t maxSize) {
+            static_assert(details::IsTextTraitsDefined<T>::value,
+                          "Please define TextTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use text(const T&) overload without `maxSize` for static container");
+            procText<VSIZE>(str, maxSize);
         }
 
-        template<size_t VSIZE, typename T, size_t N>
-        Serializer& text(const T (&str)[N]) {
-            auto first = std::begin(str);
-            auto last = std::next(first, std::min(std::char_traits<T>::length(str), N - 1));
-            writeSize(std::distance(first, last));
-            procContainer<VSIZE>(first, last, std::true_type{});
-            return *this;
+        template<size_t VSIZE, typename T>
+        void text(const T &str) {
+            static_assert(details::IsTextTraitsDefined<T>::value,
+                          "Please define TextTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use text(const T&, size_t) overload with `maxSize` for dynamic containers");
+            procText<VSIZE>(str, traits::ContainerTraits<T>::size(str));
         }
 
         /*
          * container overloads
          */
 
+        //dynamic size containers
+
         template<typename T, typename Fnc>
-        Serializer& container(const T &obj, size_t maxSize, Fnc &&fnc) {
-            assert(obj.size() <= maxSize);
-            writeSize(obj.size());
+        void container(const T &obj, size_t maxSize, Fnc &&fnc) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use container(const T&, Fnc) overload without `maxSize` for static containers");
+            auto size = traits::ContainerTraits<T>::size(obj);
+            assert(size <= maxSize);
+            details::writeSize(_writer, size);
             procContainer(std::begin(obj), std::end(obj), std::forward<Fnc>(fnc));
-            return *this;
         }
 
         template<size_t VSIZE, typename T>
-        Serializer& container(const T &obj, size_t maxSize) {
+        void container(const T &obj, size_t maxSize) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use container(const T&) overload without `maxSize` for static containers");
             static_assert(VSIZE > 0, "");
-            assert(obj.size() <= maxSize);
-            writeSize(obj.size());
-            //todo optimisation is possible for contigous containers, but currently there is no compile-time check for this
-            procContainer<VSIZE>(std::begin(obj), std::end(obj), std::false_type{});
-            return *this;
+            auto size = traits::ContainerTraits<T>::size(obj);
+            assert(size <= maxSize);
+            details::writeSize(_writer, size);
+
+            procContainer<VSIZE>(std::begin(obj), std::end(obj), std::integral_constant<bool, traits::ContainerTraits<T>::isContiguous>{});
         }
 
         template<typename T>
-        Serializer& container(const T &obj, size_t maxSize) {
-            assert(obj.size() <= maxSize);
-            writeSize(obj.size());
+        void container(const T &obj, size_t maxSize) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(traits::ContainerTraits<T>::isResizable,
+                          "use container(const T&) overload without `maxSize` for static containers");
+            auto size = traits::ContainerTraits<T>::size(obj);
+            assert(size <= maxSize);
+            details::writeSize(_writer, size);
             procContainer(std::begin(obj), std::end(obj));
-            return *this;
         }
 
-        /*
-         * array overloads (fixed size array (std::array, and c-style array))
-         */
+        //fixed size containers
 
-        //std::array overloads
-
-        template<typename T, size_t N, typename Fnc>
-        Serializer& array(const std::array<T, N> &arr, Fnc &&fnc) {
-            procContainer(std::begin(arr), std::end(arr), std::forward<Fnc>(fnc));
-            return *this;
+        template<typename T, typename Fnc, typename std::enable_if<!std::is_integral<Fnc>::value>::type * = nullptr>
+        void container(const T &obj, Fnc &&fnc) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use container(const T&, size_t, Fnc) overload with `maxSize` for dynamic containers");
+            procContainer(std::begin(obj), std::end(obj), std::forward<Fnc>(fnc));
         }
 
-        template<size_t VSIZE, typename T, size_t N>
-        Serializer& array(const std::array<T, N> &arr) {
+        template<size_t VSIZE, typename T>
+        void container(const T &obj) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use container(const T&, size_t) overload with `maxSize` for dynamic containers");
             static_assert(VSIZE > 0, "");
-            procContainer<VSIZE>(std::begin(arr), std::end(arr), std::true_type{});
-            return *this;
+            procContainer<VSIZE>(std::begin(obj), std::end(obj), std::integral_constant<bool, traits::ContainerTraits<T>::isContiguous>{});
         }
 
-        template<typename T, size_t N>
-        Serializer& array(const std::array<T, N> &arr) {
-            procContainer(std::begin(arr), std::end(arr));
-            return *this;
+        template<typename T>
+        void container(const T &obj) {
+            static_assert(details::IsContainerTraitsDefined<T>::value,
+                          "Please define ContainerTraits or include from <bitsery/traits/...>");
+            static_assert(!traits::ContainerTraits<T>::isResizable,
+                          "use container(const T&, size_t) overload with `maxSize` for dynamic containers");
+            procContainer(std::begin(obj), std::end(obj));
         }
 
-        //c-style array overloads
-
-        template<typename T, size_t N, typename Fnc>
-        Serializer& array(const T (&arr)[N], Fnc &&fnc) {
-            procContainer(std::begin(arr), std::end(arr), std::forward<Fnc>(fnc));
-            return *this;
-        }
-
-        template<size_t VSIZE, typename T, size_t N>
-        Serializer& array(const T (&arr)[N]) {
-            static_assert(VSIZE > 0, "");
-            procContainer<VSIZE>(std::begin(arr), std::end(arr), std::true_type{});
-            return *this;
-        }
-
-        template<typename T, size_t N>
-        Serializer& array(const T (&arr)[N]) {
-            procContainer(std::begin(arr), std::end(arr));
-            return *this;
-        }
-
-        Serializer& align() {
-            _writter.align();
-            return *this;
+        void align() {
+            _writer.align();
         }
 
         //overloads for functions with explicit type size
-        template<typename T> Serializer& value1(T &&v) { return value<1>(std::forward<T>(v)); }
-        template<typename T> Serializer& value2(T &&v) { return value<2>(std::forward<T>(v)); }
-        template<typename T> Serializer& value4(T &&v) { return value<4>(std::forward<T>(v)); }
-        template<typename T> Serializer& value8(T &&v) { return value<8>(std::forward<T>(v)); }
 
-        template<typename T, size_t N> Serializer& substitution1
-                (const T &v, const std::array<T, N> &expectedValues) { return substitution<1>(v, expectedValues); };
-        template<typename T, size_t N> Serializer& substitution2
-                (const T &v, const std::array<T, N> &expectedValues) { return substitution<2>(v, expectedValues); };
-        template<typename T, size_t N> Serializer& substitution4
-                (const T &v, const std::array<T, N> &expectedValues) { return substitution<4>(v, expectedValues); };
-        template<typename T, size_t N> Serializer& substitution8
-                (const T &v, const std::array<T, N> &expectedValues) { return substitution<8>(v, expectedValues); };
+        template<typename T>
+        void value1b(T &&v) { value<1>(std::forward<T>(v)); }
 
-        template<typename T> Serializer& text1(const std::basic_string<T> &str, size_t maxSize) {
-            return text<1>(str, maxSize); }
-        template<typename T> Serializer& text2(const std::basic_string<T> &str, size_t maxSize) {
-            return text<2>(str, maxSize); }
-        template<typename T> Serializer& text4(const std::basic_string<T> &str, size_t maxSize) {
-            return text<4>(str, maxSize); }
+        template<typename T>
+        void value2b(T &&v) { value<2>(std::forward<T>(v)); }
 
-        template<typename T, size_t N> Serializer& text1(const T (&str)[N]) { return text<1>(str); }
-        template<typename T, size_t N> Serializer& text2(const T (&str)[N]) { return text<2>(str); }
-        template<typename T, size_t N> Serializer& text4(const T (&str)[N]) { return text<4>(str); }
+        template<typename T>
+        void value4b(T &&v) { value<4>(std::forward<T>(v)); }
 
-        template<typename T> Serializer& container1(T &&obj, size_t maxSize) {
-            return container<1>(std::forward<T>(obj), maxSize); }
-        template<typename T> Serializer& container2(T &&obj, size_t maxSize) {
-            return container<2>(std::forward<T>(obj), maxSize); }
-        template<typename T> Serializer& container4(T &&obj, size_t maxSize) {
-            return container<4>(std::forward<T>(obj), maxSize); }
-        template<typename T> Serializer& container8(T &&obj, size_t maxSize) {
-            return container<8>(std::forward<T>(obj), maxSize); }
+        template<typename T>
+        void value8b(T &&v) { value<8>(std::forward<T>(v)); }
 
-        template<typename T, size_t N> Serializer& array1(const std::array<T, N> &arr) { return array<1>(arr); }
-        template<typename T, size_t N> Serializer& array2(const std::array<T, N> &arr) { return array<2>(arr); }
-        template<typename T, size_t N> Serializer& array4(const std::array<T, N> &arr) { return array<4>(arr); }
-        template<typename T, size_t N> Serializer& array8(const std::array<T, N> &arr) { return array<8>(arr); }
+        template<typename T, typename Ext>
+        void ext1b(const T &v, Ext &&extension) { ext<1, T, Ext>(v, std::forward<Ext>(extension)); };
 
-        template<typename T, size_t N> Serializer& array1(const T (&arr)[N]) { return array<1>(arr); }
-        template<typename T, size_t N> Serializer& array2(const T (&arr)[N]) { return array<2>(arr); }
-        template<typename T, size_t N> Serializer& array4(const T (&arr)[N]) { return array<4>(arr); }
-        template<typename T, size_t N> Serializer& array8(const T (&arr)[N]) { return array<8>(arr); }
+        template<typename T, typename Ext>
+        void ext2b(const T &v, Ext &&extension) { ext<2, T, Ext>(v, std::forward<Ext>(extension)); };
+
+        template<typename T, typename Ext>
+        void ext4b(const T &v, Ext &&extension) { ext<4, T, Ext>(v, std::forward<Ext>(extension)); };
+
+        template<typename T, typename Ext>
+        void ext8b(const T &v, Ext &&extension) { ext<8, T, Ext>(v, std::forward<Ext>(extension)); };
+
+        template<typename T>
+        void text1b(const T &str, size_t maxSize) { text<1>(str, maxSize); }
+
+        template<typename T>
+        void text2b(const T &str, size_t maxSize) { text<2>(str, maxSize); }
+
+        template<typename T>
+        void text4b(const T &str, size_t maxSize) { text<4>(str, maxSize); }
+
+        template<typename T>
+        void text1b(const T &str) { text<1>(str); }
+
+        template<typename T>
+        void text2b(const T &str) { text<2>(str); }
+
+        template<typename T>
+        void text4b(const T &str) { text<4>(str); }
+
+        template<typename T>
+        void container1b(T &&obj, size_t maxSize) { container<1>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container2b(T &&obj, size_t maxSize) { container<2>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container4b(T &&obj, size_t maxSize) { container<4>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container8b(T &&obj, size_t maxSize) { container<8>(std::forward<T>(obj), maxSize); }
+
+        template<typename T>
+        void container1b(T &&obj) { container<1>(std::forward<T>(obj)); }
+
+        template<typename T>
+        void container2b(T &&obj) { container<2>(std::forward<T>(obj)); }
+
+        template<typename T>
+        void container4b(T &&obj) { container<4>(std::forward<T>(obj)); }
+
+        template<typename T>
+        void container8b(T &&obj) { container<8>(std::forward<T>(obj)); }
 
     private:
-        Writter &_writter;
+        friend AdapterAccess;
 
-        void writeSize(const size_t size) {
-            if (size < 0x80u) {
-                _writter.writeBits(1u, 1);
-                _writter.writeBits(size, 7);
-            } else if (size < 0x4000u) {
-                _writter.writeBits(2u,2);
-                _writter.writeBits(size, 14);
-            } else {
-                assert(size < 0x40000000u);
-                _writter.writeBits(0u,2);
-                _writter.writeBits(size, 30);
-            }
-        }
+        TAdapterWriter _writer;
+        void* _context;
 
         //process value types
         //false_type means that we must process all elements individually
         template<size_t VSIZE, typename It>
         void procContainer(It first, It last, std::false_type) {
-            for (;first != last; ++first)
+            for (; first != last; ++first)
                 value<VSIZE>(*first);
         };
 
@@ -306,25 +330,99 @@ namespace bitsery {
         //true_type means, that we can copy whole buffer
         template<size_t VSIZE, typename It>
         void procContainer(It first, It last, std::true_type) {
-            if (first != last)
-                _writter.template writeBuffer<VSIZE>(&(*first), std::distance(first, last));
+            using TValue = typename std::decay<decltype(*first)>::type;
+            using TIntegral = typename details::IntegralFromFundamental<TValue>::TValue;
+			if (first != last)
+				_writer.template writeBuffer<VSIZE>(reinterpret_cast<const TIntegral*>(&(*first)),
+                                                    static_cast<size_t>(std::distance(first, last)));
         };
 
         //process by calling functions
         template<typename It, typename Fnc>
         void procContainer(It first, It last, Fnc fnc) {
-            for (;first != last; ++first)
-                fnc(*this, *first);
+            using TValue = typename std::decay<decltype(*first)>::type;
+            for (; first != last; ++first) {
+                fnc(const_cast<TValue&>(*first));
+            }
+        };
+
+        //process text,
+        template<size_t VSIZE, typename T>
+        void procText(const T& str, size_t maxSize) {
+            auto length = traits::TextTraits<T>::length(str);
+            assert((length + (traits::TextTraits<T>::addNUL ? 1u : 0u)) <= maxSize);
+            details::writeSize(_writer, length);
+            auto begin = std::begin(str);
+            procContainer<VSIZE>(begin, std::next(begin, length), std::integral_constant<bool, traits::ContainerTraits<T>::isContiguous>{});
         };
 
         //process object types
         template<typename It>
         void procContainer(It first, It last) {
-            for (;first != last; ++first)
+            for (; first != last; ++first)
                 object(*first);
         };
 
+        //proc bool writing bit or byte, depending on if BitPackingEnabled or not
+        void procBoolValue(bool v, std::true_type) {
+            _writer.writeBits(static_cast<unsigned char>(v ? 1 : 0), 1);
+        }
+
+        void procBoolValue(bool v, std::false_type) {
+            _writer.template writeBytes<1>(static_cast<unsigned char>(v ? 1 : 0));
+        }
+
+        //enable bit-packing or do nothing if it is already enabled
+        template <typename Fnc>
+        void procEnableBitPacking(const Fnc& fnc, std::true_type) {
+            fnc(*this);
+        }
+
+        template <typename Fnc>
+        void procEnableBitPacking(const Fnc& fnc, std::false_type) {
+            //create serializer using bitpacking wrapper
+            BasicSerializer<AdapterWriterBitPackingWrapper<TAdapterWriter>> tmp(_writer, _context);
+            fnc(tmp);
+        }
+
+        //these are dummy functions for extensions that have TValue = void
+        void object(const details::DummyType&) {
+
+        }
+
+        template <size_t VSIZE>
+        void value(const details::DummyType&) {
+
+        }
+
+        //dummy function, that stops archive variadic arguments expansion
+        void archive() {
+        }
+
     };
 
+    //helper type
+    template <typename Adapter>
+    using Serializer = BasicSerializer<AdapterWriter<Adapter, DefaultConfig>>;
+
+    //helper function that set ups all the basic steps and after serialziation returns serialized bytes count
+    template <typename Adapter, typename T>
+    size_t quickSerialization(Adapter adapter, const T& value) {
+        Serializer<Adapter> ser{std::move(adapter)};
+        ser.object(value);
+        auto& w = AdapterAccess::getWriter(ser);
+        w.flush();
+        return w.writtenBytesCount();
+    };
+
+    template <typename T>
+    size_t quickMeasureSize(const T& value) {
+        BasicSerializer<MeasureSize> ser {nullptr};
+        ser.object(value);
+        auto& w = AdapterAccess::getWriter(ser);
+        w.flush();
+        return w.writtenBytesCount();
+    }
+
 }
 #endif //BITSERY_SERIALIZER_H

include/bitsery/traits/array.h

@@ -0,0 +1,44 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_TRAITS_STD_ARRAY_H
+#define BITSERY_TRAITS_STD_ARRAY_H
+
+#include "core/std_defaults.h"
+#include <array>
+
+namespace bitsery {
+
+    namespace traits {
+        template<typename T, size_t N>
+        struct ContainerTraits<std::array<T, N>>
+                :public StdContainer<std::array<T, N>, false, true> {};
+
+        template<typename T, size_t N>
+        struct BufferAdapterTraits<std::array<T, N>>
+                :public StdContainerForBufferAdapter<std::array<T, N>> {};
+    }
+
+}
+
+#endif //BITSERY_TYPE_TRAITS_STD_ARRAY_H

include/bitsery/traits/core/std_defaults.h

@@ -0,0 +1,85 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_TRAITS_HELPER_STD_DEFAULTS_H
+#define BITSERY_TRAITS_HELPER_STD_DEFAULTS_H
+
+#include "traits.h"
+#include <iostream>
+
+namespace bitsery {
+    namespace traits {
+
+        /*
+         * these are helper types, to easier write specializations for std types
+         */
+
+        template<typename T, bool Resizable, bool Contiguous>
+        struct StdContainer {
+            using TValue = typename T::value_type;
+            static constexpr bool isResizable = Resizable;
+            static constexpr bool isContiguous = Contiguous;
+            static size_t size(const T& container) {
+                return container.size();
+            }
+        };
+
+        //specialization for resizable
+        template<typename T, bool Contiguous>
+        struct StdContainer<T, true, Contiguous> {
+            using TValue = typename T::value_type;
+            static constexpr bool isResizable = true;
+            static constexpr bool isContiguous = Contiguous;
+            static size_t size(const T& container) {
+                return container.size();
+            }
+            static void resize(T& container, size_t size) {
+                container.resize(size);
+            }
+        };
+
+        template <typename T, bool Resizable = ContainerTraits<T>::isResizable>
+        struct StdContainerForBufferAdapter {
+            using TIterator = typename T::iterator;
+            using TValue = typename ContainerTraits<T>::TValue;
+        };
+
+        //specialization for resizable buffers
+        template <typename T>
+        struct StdContainerForBufferAdapter<T, true> {
+
+            static void increaseBufferSize(T& container) {
+                //since we're writing to buffer use different resize strategy than default implementation
+                //when small size grow faster, to avoid thouse 2/4/8/16... byte allocations
+                auto newSize = static_cast<size_t>(container.size() * 1.5 + 128);
+                //make data cache friendly
+                newSize -= newSize % 64;//64 is cache line size
+                container.resize(std::max(newSize, container.capacity()));
+            }
+            using TIterator = typename T::iterator;
+            using TValue = typename ContainerTraits<T>::TValue;
+        };
+
+    }
+}
+
+#endif //BITSERY_TRAITS_HELPER_STD_DEFAULTS_H

include/bitsery/traits/core/traits.h

@@ -0,0 +1,159 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#ifndef BITSERY_TRAITS_CORE_TRAITS_H
+#define BITSERY_TRAITS_CORE_TRAITS_H
+
+#include <type_traits>
+#include "../../details/not_defined_type.h"
+
+namespace bitsery {
+    namespace traits {
+
+        /*
+         * core library traits, used to extend library for custom types
+         */
+
+        //traits for extension
+        template<typename Extension, typename T>
+        struct ExtensionTraits {
+            //this type is used, when using extesion without custom lambda
+            // eg.: extension4b>(obj, myextension{}) will call s.value4b(obj) for TValue
+            // or extesion(obj, myextension{})  will call s.object(obj) for TValue
+            //when this is void, it will compile, but value and object overloads will do nothing.
+            using TValue = details::NotDefinedType;
+
+            //does extension support ext<N>(...) syntax, by calling value<N> with TValue
+            static constexpr bool SupportValueOverload = false;
+            //does extension support ext(...) syntax, by calling object with TValue
+            static constexpr bool SupportObjectOverload = false;
+            //does extension support ext(..., lambda)
+            static constexpr bool SupportLambdaOverload = false;
+        };
+
+        //primary traits for containers
+        template<typename T>
+        struct ContainerTraits {
+
+            using TValue = details::NotDefinedType;
+
+            static constexpr bool isResizable = false;
+            //contiguous arrays has oppurtunity to memcpy whole buffer directly when using funtamental types
+            //contiguous doesn't nesessary equal to random access iterator.
+            //contiguous hopefully will be available in c++20
+            static constexpr bool isContiguous = false;
+            //resize function, called only if container is resizable
+            static void resize(T& container, size_t size) {
+                static_assert(std::is_void<T>::value,
+                              "Define ContainerTraits or include from <bitsery/traits/...> to use as container");
+            }
+            //get container size
+            static size_t size(const T& container) {
+                static_assert(std::is_void<T>::value,
+                              "Define ContainerTraits or include from <bitsery/traits/...> to use as container");
+                return 0u;
+            }
+        };
+
+        //specialization for C style array
+        template<typename T, size_t N>
+        struct ContainerTraits<T[N]> {
+            using TValue = T;
+            static constexpr bool isResizable = false;
+            static constexpr bool isContiguous = true;
+            static size_t size(const T (&container)[N]) {
+                return N;
+            }
+        };
+
+        //specialization for initializer list, even though it cannot be deserialized to.
+        template<typename T>
+        struct ContainerTraits<std::initializer_list<T>> {
+            using TValue = T;
+            static constexpr bool isResizable = false;
+            static constexpr bool isContiguous = true;
+            static size_t size(const std::initializer_list<T>& container) {
+                return container.size();
+            }
+        };
+
+
+
+        //traits for text, default adds null-terminated character at the end
+        template<typename T>
+        struct TextTraits {
+            using TValue = details::NotDefinedType;
+            //if container is not null-terminated by default, add NUL at the end
+            static constexpr bool addNUL = true;
+
+            //get length of null terminated container
+            static size_t length(const T& container) {
+                static_assert(std::is_void<T>::value,
+                              "Define TextTraits or include from <bitsery/traits/...> to use as text");
+                return 0u;
+            }
+        };
+
+        //traits only for buffer adapters
+        template <typename T>
+        struct BufferAdapterTraits {
+            //this function is only applies to resizable containers
+
+            //this function is only used by Writer, when writing data to buffer,
+            //it is called only current buffer size is not enough to write.
+            //it is used to dramaticaly improve performance by updating buffer directly
+            //instead of using back_insert_iterator to append each byte to buffer.
+            //thats why Writer return range iterators
+
+            static void increaseBufferSize(T& container) {
+                static_assert(std::is_void<T>::value,
+                              "Define BufferAdapterTraits or include from <bitsery/traits/...> to use as buffer adapter container");
+            }
+
+            using TIterator = details::NotDefinedType;
+            using TValue = typename ContainerTraits<T>::TValue;
+        };
+
+        //specialization for c-style buffer
+        template <typename T, size_t N>
+        struct BufferAdapterTraits<T[N]> {
+            using TIterator = T*;
+            using TValue = T;
+        };
+
+        //specialization for pointer type buffer
+        template <typename T>
+        struct BufferAdapterTraits<const T*> {
+            using TIterator = const T*;
+            using TValue = T;
+        };
+
+        template <typename T>
+        struct BufferAdapterTraits<T*> {
+            using TIterator = T*;
+            using TValue = T;
+        };
+
+    }
+}
+
+#endif //BITSERY_TRAITS_CORE_TRAITS_H

include/bitsery/traits/deque.h

@@ -0,0 +1,42 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_TRAITS_STD_DEQUE_H
+#define BITSERY_TRAITS_STD_DEQUE_H
+
+#include "core/std_defaults.h"
+#include <deque>
+
+namespace bitsery {
+
+    namespace traits {
+
+        template<typename ... TArgs>
+        struct ContainerTraits<std::deque<TArgs...>>
+                : public StdContainer<std::deque<TArgs...>, true, false> {};
+
+    }
+
+}
+
+#endif //BITSERY_TRAITS_STD_DEQUE_H

include/bitsery/traits/forward_list.h

@@ -0,0 +1,49 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_TRAITS_STD_FORWARD_LIST_H
+#define BITSERY_TRAITS_STD_FORWARD_LIST_H
+
+#include <forward_list>
+
+namespace bitsery {
+
+    namespace traits {
+
+        template<typename ... TArgs>
+        struct ContainerTraits<std::forward_list<TArgs...>> {
+            using TValue = typename std::forward_list<TArgs...>::value_type;
+            static constexpr bool isResizable = true;
+            static constexpr bool isContiguous = false;
+            static size_t size(const std::forward_list<TArgs...>& container) {
+                return static_cast<size_t>(std::distance(container.begin(), container.end()));
+            }
+            static void resize(std::forward_list<TArgs...>& container, size_t size) {
+                container.resize(size);
+            }
+        };
+    }
+}
+
+
+#endif //BITSERY_TRAITS_STD_FORWARD_LIST_H

include/bitsery/traits/list.h

@@ -0,0 +1,42 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_TRAITS_STD_LIST_H
+#define BITSERY_TRAITS_STD_LIST_H
+
+#include "core/std_defaults.h"
+#include <list>
+
+namespace bitsery {
+
+    namespace traits {
+
+        template<typename ... TArgs>
+        struct ContainerTraits<std::list<TArgs...>>
+                : public StdContainer<std::list<TArgs...>, true, false> {};
+
+    }
+
+}
+
+#endif //BITSERY_TRAITS_STD_LIST_H

include/bitsery/traits/string.h

@@ -0,0 +1,71 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_TRAITS_STD_STRING_H
+#define BITSERY_TRAITS_STD_STRING_H
+
+#include "core/std_defaults.h"
+#include <string>
+
+namespace bitsery {
+
+    namespace traits {
+
+        // specialization for string, because string is already included for std::char_traits
+
+        template<typename ... TArgs>
+        struct ContainerTraits<std::basic_string<TArgs...>>
+            :public StdContainer<std::basic_string<TArgs...>, true, true> {};
+
+        template <typename ... TArgs>
+        struct TextTraits<std::basic_string<TArgs...>> {
+            using TValue = typename ContainerTraits<std::basic_string<TArgs...>>::TValue;
+            //string is automatically null-terminated
+            static constexpr bool addNUL = false;
+
+            //is is not 100% accurate, but for performance reasons assume that string stores text, not binary data
+            static size_t length(const std::basic_string<TArgs...>& str) {
+                return str.size();
+            }
+        };
+
+        //specialization for c-array
+        template <typename T, size_t N>
+        struct TextTraits<T[N]> {
+            using TValue = T;
+            static constexpr bool addNUL = true;
+
+            static size_t length(const T (&container)[N]) {
+                return std::char_traits<T>::length(container);
+            }
+        };
+
+        template<typename ... TArgs>
+        struct BufferAdapterTraits<std::basic_string<TArgs...>>
+                :public StdContainerForBufferAdapter<std::basic_string<TArgs...>> {};
+
+    }
+
+}
+
+#endif //BITSERY_TRAITS_VECTOR_H

include/bitsery/traits/vector.h

@@ -0,0 +1,50 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#ifndef BITSERY_TRAITS_STD_VECTOR_H
+#define BITSERY_TRAITS_STD_VECTOR_H
+
+#include "core/std_defaults.h"
+#include <vector>
+
+namespace bitsery {
+
+    namespace traits {
+        template<typename ... TArgs>
+        struct ContainerTraits<std::vector<TArgs...>>
+                :public StdContainer<std::vector<TArgs...>, true, true> {};
+
+        //bool vector is not contiguous, do not copy it directly to buffer
+        template<typename Allocator>
+        struct ContainerTraits<std::vector<bool, Allocator>>
+                :public StdContainer<std::vector<bool, Allocator>, true, false> {};
+
+        template<typename ... TArgs>
+        struct BufferAdapterTraits<std::vector<TArgs...>>
+                :public StdContainerForBufferAdapter<std::vector<TArgs...>> {};
+
+    }
+
+}
+
+#endif //BITSERY_TRAITS_STD_VECTOR_H

tests/CMakeLists.txt

@@ -44,7 +44,7 @@ file(GLOB TestSourceFiles ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
 
 if ("${CMAKE_CXX_COMPILER_ID}" STREQUAL "MSVC")
     message(WARNING "extension tests for optional is disable for VS, because VS currenty doesn't have <optional>")
-    list(REMOVE_ITEM TestSourceFiles ${CMAKE_CURRENT_SOURCE_DIR}/serialization_ext_optional.cpp)
+    list(REMOVE_ITEM TestSourceFiles ${CMAKE_CURRENT_SOURCE_DIR}/serialization_ext_std_optional.cpp)
 endif()
 
 include(${ExtCMakeFilesDir}/LinkTestLib.cmake)
@@ -52,7 +52,7 @@ include(${ExtCMakeFilesDir}/LinkTestLib.cmake)
 FOREACH(TestFile ${TestSourceFiles})
     get_filename_component(TestName ${TestFile} NAME_WE)
     set(TestName TEST_${TestName})
-    add_executable(${TestName} ${TestFile} ${IncludeHeaders})
+    add_executable(${TestName} ${TestFile} ${IncludeHeaders} serialization_test_utils.h)
     LinkTestLib(${TestName})
 
     add_test(NAME ${TestName} COMMAND $<TARGET_FILE:${TestName}>)

tests/adapter_stream.cpp

@@ -0,0 +1,109 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include <bitsery/adapter/stream.h>
+#include <bitsery/adapter_writer.h>
+#include <bitsery/adapter_reader.h>
+#include <sstream>
+
+//some helper types
+using Stream = std::stringstream;
+using OutputAdapter = bitsery::OutputStreamAdapter;
+using InputAdapter = bitsery::InputStreamAdapter ;
+using Writer = bitsery::AdapterWriter<bitsery::OutputStreamAdapter, bitsery::DefaultConfig>;
+using Reader = bitsery::AdapterReader<bitsery::InputStreamAdapter, bitsery::DefaultConfig>;
+
+using testing::Eq;
+
+TEST(AdapterIOStream, WrittenBytesCountReturns0) {
+    //setup data
+    uint8_t t1 = 111;
+
+    Stream buf{};
+    Writer w{{buf}};
+    w.writeBytes<1>(t1);
+    w.flush();
+
+    EXPECT_THAT(buf.str().size(), Eq(1));
+    EXPECT_THAT(w.writtenBytesCount(), Eq(0));
+}
+
+TEST(AdapterIOStream, CorrectlyReturnsIsCompletedSuccessfully) {
+    //setup data
+    uint8_t t1 = 111;
+
+    Stream buf{};
+    Writer w{{buf}};
+    w.writeBytes<1>(t1);
+    w.flush();
+
+    Reader r{{buf}};
+
+    uint8_t r1{};
+    EXPECT_THAT(r.isCompletedSuccessfully(), Eq(false));
+    r.readBytes<1>(r1);
+    EXPECT_THAT(r.isCompletedSuccessfully(), Eq(true));
+    EXPECT_THAT(r1, Eq(t1));
+}
+
+TEST(AdapterIOStream, ReadingMoreThanAvailableReturnsZero) {
+    //setup data
+    uint8_t t1 = 111;
+
+    Stream buf{};
+    Writer w{{buf}};
+    w.writeBytes<1>(t1);
+    w.flush();
+
+    Reader r{{buf}};
+
+    uint8_t r1{};
+    r.readBytes<1>(r1);
+    r.readBytes<1>(r1);
+    EXPECT_THAT(r1, Eq(0));
+}
+
+//this is strange, but probably stringstream doesnt use any of the base methods that sets io_base::iostate flags
+TEST(AdapterIOStream, WhenReadingStringStreamThenErrorCodeAlwaysReturnsNoError) {
+    //setup data
+    uint8_t t1 = 111;
+
+    Stream buf{};
+    Writer w{{buf}};
+    w.writeBytes<1>(t1);
+    w.flush();
+
+    Reader r{{buf}};
+
+    uint8_t r1{};
+    EXPECT_THAT(r.isCompletedSuccessfully(), Eq(false));
+    EXPECT_THAT(r.error(), Eq(bitsery::ReaderError::NoError));
+    r.readBytes<1>(r1);
+    EXPECT_THAT(r.isCompletedSuccessfully(), Eq(true));
+    EXPECT_THAT(r.error(), Eq(bitsery::ReaderError::NoError));
+    EXPECT_THAT(r1, Eq(t1));
+    r.readBytes<1>(r1);
+    EXPECT_THAT(r1, Eq(0));
+    //should by overflow error, but it all iostate flags are set to false...
+    EXPECT_THAT(r.error(), Eq(bitsery::ReaderError::NoError));
+}

tests/buffer_bits_op.cpp

@@ -1,205 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-#include <gmock/gmock.h>
-#include <bitsery/buffer_writer.h>
-#include <bitsery/buffer_reader.h>
-#include <bitsery/details/serialization_common.h>
-
-using testing::Eq;
-using testing::ContainerEq;
-using bitsery::BufferWriter;
-using bitsery::BufferReader;
-using Buffer = std::vector<bitsery::DefaultConfig::BufferValueType>;
-
-struct IntegralUnsignedTypes {
-    uint32_t a;
-    uint16_t b;
-    uint8_t c;
-    uint8_t d;
-    uint64_t e;
-};
-
-template <typename T>
-constexpr size_t getBits(T v) {
-    return bitsery::details::calcRequiredBits<T>({}, v);
-};
-
-TEST(BufferBitsOperations, WriteAndReadBits) {
-    //setup data
-    constexpr IntegralUnsignedTypes data{
-        485454,//bits 19
-        45978,//bits 16
-        0,//bits 1
-        36,//bits 6
-        479845648946//bits 39
-    };
-
-    constexpr size_t aBITS = getBits(data.a) + 2;
-    constexpr size_t bBITS = getBits(data.b) + 0;
-    constexpr size_t cBITS = getBits(data.c) + 2;
-    constexpr size_t dBITS = getBits(data.d) + 1;
-    constexpr size_t eBITS = getBits(data.e) + 8;
-
-    //create and write to buffer
-    Buffer buf;
-    BufferWriter bw{buf};
-
-    bw.writeBits(data.a, aBITS);
-    bw.writeBits(data.b, bBITS);
-    bw.writeBits(data.c, cBITS);
-    bw.writeBits(data.d, dBITS);
-    bw.writeBits(data.e, eBITS);
-    bw.flush();
-    auto bytesCount = ((aBITS + bBITS + cBITS + dBITS + eBITS) / 8) +1 ;
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(bytesCount));
-    //read from buffer
-    BufferReader br{buf};
-    IntegralUnsignedTypes res;
-
-    br.readBits(res.a, aBITS);
-    br.readBits(res.b, bBITS);
-    br.readBits(res.c, cBITS);
-    br.readBits(res.d, dBITS);
-    br.readBits(res.e, eBITS);
-
-    EXPECT_THAT(res.a, Eq(data.a));
-    EXPECT_THAT(res.b, Eq(data.b));
-    EXPECT_THAT(res.c, Eq(data.c));
-    EXPECT_THAT(res.d, Eq(data.d));
-    EXPECT_THAT(res.e, Eq(data.e));
-
-}
-
-TEST(BufferBitsOperations, WhenFinishedFlushWriter) {
-
-    Buffer buf;
-    BufferWriter bw{buf};
-
-    bw.writeBits(3u, 2);
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(0));
-    bw.flush();
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(1));
-
-}
-
-TEST(BufferBitsOperations, BufferSizeIsCountedPerByteNotPerBit) {
-    //setup data
-
-    //create and write to buffer
-    Buffer buf;
-    BufferWriter bw{buf};
-
-    bw.writeBits(7u,3);
-    bw.flush();
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(1));
-
-    //read from buffer
-    BufferReader br{buf};
-    uint16_t tmp;
-    EXPECT_THAT(br.readBits(tmp,4), Eq(true));
-    EXPECT_THAT(br.readBits(tmp,2), Eq(true));
-    EXPECT_THAT(br.readBits(tmp,2), Eq(true));
-    EXPECT_THAT(br.readBits(tmp,2), Eq(false));
-
-    //part of next byte
-    BufferReader br1{buf};
-    EXPECT_THAT(br1.readBits(tmp,2), Eq(true));
-    EXPECT_THAT(br1.readBits(tmp,7), Eq(false));
-
-    //bigger than byte
-    BufferReader br2{buf};
-    EXPECT_THAT(br2.readBits(tmp,9), Eq(false));
-}
-
-TEST(BufferBitsOperations, ConsecutiveCallsToAlignHasNoEffect) {
-    Buffer buf;
-    BufferWriter bw{buf};
-
-    bw.writeBits(3u, 2);
-    //3 calls to align after 1st data
-    bw.align();
-    bw.align();
-    bw.align();
-    bw.writeBits(7u, 3);
-    //1 call to align after 2nd data
-    bw.align();
-    bw.writeBits(15u, 4);
-    bw.flush();
-
-    unsigned char tmp;
-    BufferReader br{buf};
-    EXPECT_THAT(br.readBits(tmp,2), Eq(true));
-    EXPECT_THAT(tmp, Eq(3u));
-    EXPECT_THAT(br.align(), Eq(true));
-
-    EXPECT_THAT(br.readBits(tmp,3), Eq(true));
-    EXPECT_THAT(tmp, Eq(7u));
-    EXPECT_THAT(br.align(), Eq(true));
-    EXPECT_THAT(br.align(), Eq(true));
-    EXPECT_THAT(br.align(), Eq(true));
-
-    EXPECT_THAT(br.readBits(tmp,4), Eq(true));
-    EXPECT_THAT(tmp, Eq(15u));
-}
-
-
-
-TEST(BufferBitsOperations, WhenAlignedFlushHasNoEffect) {
-    //setup data
-
-    //create and write to buffer
-    Buffer buf;
-    BufferWriter bw{buf};
-
-    bw.writeBits(3u, 2);
-    bw.align();
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(1));
-    bw.flush();
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(1));
-}
-
-
-TEST(BufferBitsOperations, AlignMustWriteZerosBits) {
-    //setup data
-
-    //create and write to buffer
-    Buffer buf;
-    BufferWriter bw{buf};
-
-    //write 2 bits and align
-    bw.writeBits(3u, 2);
-    bw.align();
-
-    unsigned char tmp;
-    BufferReader br1{buf};
-    br1.readBits(tmp,2);
-    //read aligned bits
-    EXPECT_THAT(br1.readBits(tmp,6), Eq(true));
-    EXPECT_THAT(tmp, Eq(0));
-
-    BufferReader br2{buf};
-    //read 2 bits
-    br2.readBits(tmp,2);
-    EXPECT_THAT(br2.align(), Eq(true));
-}

tests/buffer_bytes_op.cpp

@@ -1,274 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-#include <gmock/gmock.h>
-#include <bitsery/buffer_writer.h>
-#include <bitsery/buffer_reader.h>
-#include <list>
-#include <bitset>
-
-using testing::Eq;
-using testing::ContainerEq;
-using bitsery::BufferWriter;
-using bitsery::BufferReader;
-using Buffer = std::vector<bitsery::DefaultConfig::BufferValueType>;
-
-struct IntegralTypes {
-    int64_t a;
-    uint32_t b;
-    int16_t c;
-    uint8_t d;
-    int8_t e;
-    int8_t f[2];
-};
-
-IntegralTypes getInitializedIntegralTypes() {
-    IntegralTypes data;
-    data.a = -4894541654564;
-    data.b = 94545646;
-    data.c = -8778;
-    data.d = 200;
-    data.e = -98;
-    data.f[0] = 43;
-    data.f[1] = -45;
-    return data;
-}
-
-void writeIntegralTypesToBuffer(BufferWriter& bw, const IntegralTypes& data) {
-    bw.writeBytes<4>(data.b);
-    bw.writeBytes<1>(data.f[0]);
-    bw.writeBytes<2>(data.c);
-    bw.writeBytes<1>(data.d);
-    bw.writeBytes<8>(data.a);
-    bw.writeBytes<1>(data.e);
-    bw.writeBytes<1>(data.f[1]);
-}
-
-
-TEST(BufferBytesOperations, WriteAndReadBytes) {
-    //setup data
-    auto data =getInitializedIntegralTypes();
-    //create and write to buffer
-    Buffer buf{};
-    BufferWriter bw{buf};
-    writeIntegralTypesToBuffer(bw, data);
-
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(18));
-    //read from buffer
-    BufferReader br{buf};
-    IntegralTypes res{};
-    EXPECT_THAT(br.readBytes<4>(res.b), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.f[0]), Eq(true));
-    EXPECT_THAT(br.readBytes<2>(res.c), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.d), Eq(true));
-    EXPECT_THAT(br.readBytes<8>(res.a), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.e), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.f[1]), Eq(true));
-    //assert results
-
-    EXPECT_THAT(data.a, Eq(res.a));
-    EXPECT_THAT(data.b, Eq(res.b));
-    EXPECT_THAT(data.c, Eq(res.c));
-    EXPECT_THAT(data.d, Eq(res.d));
-    EXPECT_THAT(data.e, Eq(res.e));
-    EXPECT_THAT(data.f, ContainerEq(res.f));
-
-}
-
-TEST(BufferBytesOperations, BufferReaderUsingDataPlusSizeCtor) {
-    //setup data
-    auto data =getInitializedIntegralTypes();
-    //create and write to buffer
-    Buffer buf{};
-    BufferWriter bw{buf};
-    writeIntegralTypesToBuffer(bw, data);
-
-    EXPECT_THAT(std::distance(buf.begin(), buf.end()), Eq(18));
-    //read from buffer
-    BufferReader br{buf.data(), buf.size()};
-    IntegralTypes res{};
-    EXPECT_THAT(br.readBytes<4>(res.b), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.f[0]), Eq(true));
-    EXPECT_THAT(br.readBytes<2>(res.c), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.d), Eq(true));
-    EXPECT_THAT(br.readBytes<8>(res.a), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.e), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.f[1]), Eq(true));
-    //assert results
-
-    EXPECT_THAT(data.a, Eq(res.a));
-    EXPECT_THAT(data.b, Eq(res.b));
-    EXPECT_THAT(data.c, Eq(res.c));
-    EXPECT_THAT(data.d, Eq(res.d));
-    EXPECT_THAT(data.e, Eq(res.e));
-    EXPECT_THAT(data.f, ContainerEq(res.f));
-}
-
-TEST(BufferBytesOperations, BufferReaderUsingCArrayCtor) {
-    //setup data
-    auto data =getInitializedIntegralTypes();
-    //create and write to buffer
-    Buffer buf{};
-    BufferWriter bw{buf};
-    writeIntegralTypesToBuffer(bw, data);
-
-    ASSERT_THAT(std::distance(buf.begin(), buf.end()), Eq(18));
-    uint8_t cArrBuf[18];
-    std::copy(buf.begin(), buf.end(), cArrBuf);
-    //read from buffer
-    BufferReader br{cArrBuf};
-    IntegralTypes res{};
-    EXPECT_THAT(br.readBytes<4>(res.b), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.f[0]), Eq(true));
-    EXPECT_THAT(br.readBytes<2>(res.c), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.d), Eq(true));
-    EXPECT_THAT(br.readBytes<8>(res.a), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.e), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.f[1]), Eq(true));
-    //assert results
-
-    EXPECT_THAT(data.a, Eq(res.a));
-    EXPECT_THAT(data.b, Eq(res.b));
-    EXPECT_THAT(data.c, Eq(res.c));
-    EXPECT_THAT(data.d, Eq(res.d));
-    EXPECT_THAT(data.e, Eq(res.e));
-    EXPECT_THAT(data.f, ContainerEq(res.f));
-}
-
-
-
-TEST(BufferBytesOperations, ReadReturnsFalseIfNotEnoughBufferSize) {
-    //setup data
-    uint8_t a = 111;
-
-    //create and write to buffer
-    Buffer buf{};
-    BufferWriter bw{buf};
-
-    bw.writeBytes<1>(a);
-    bw.writeBytes<1>(a);
-    bw.writeBytes<1>(a);
-    //read from buffer
-    BufferReader br{buf};
-    int16_t b;
-    int32_t c;
-    EXPECT_THAT(br.readBytes<4>(c), Eq(false));
-    EXPECT_THAT(br.readBytes<2>(b), Eq(true));
-    EXPECT_THAT(br.readBytes<2>(b), Eq(false));
-    EXPECT_THAT(br.readBytes<1>(a), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(a), Eq(false));
-    EXPECT_THAT(br.readBytes<2>(b), Eq(false));
-    EXPECT_THAT(br.readBytes<4>(c), Eq(false));
-
-}
-
-
-TEST(BufferBytesOperations, ReadIsCompletedWhenAllBytesAreRead) {
-    //setup data
-    IntegralTypes data;
-    data.b = 94545646;
-    data.c = -8778;
-    data.d = 200;
-
-    //create and write to buffer
-    Buffer buf{};
-    BufferWriter bw{buf};
-
-    bw.writeBytes<4>(data.b);
-    bw.writeBytes<2>(data.c);
-    bw.writeBytes<1>(data.d);
-    //read from buffer
-    BufferReader br{buf};
-    IntegralTypes res;
-    EXPECT_THAT(br.readBytes<4>(res.b), Eq(true));
-    EXPECT_THAT(br.readBytes<2>(res.c), Eq(true));
-    EXPECT_THAT(br.isCompleted(), Eq(false));
-    EXPECT_THAT(br.readBytes<1>(res.d), Eq(true));
-    EXPECT_THAT(br.isCompleted(), Eq(true));
-    EXPECT_THAT(br.readBytes<1>(res.d), Eq(false));
-    EXPECT_THAT(br.isCompleted(), Eq(true));
-
-    BufferReader br1{buf};
-    EXPECT_THAT(br1.readBytes<4>(res.b), Eq(true));
-    EXPECT_THAT(br1.readBytes<2>(res.c), Eq(true));
-    EXPECT_THAT(br1.isCompleted(), Eq(false));
-    EXPECT_THAT(br1.readBytes<2>(res.c), Eq(false));
-    EXPECT_THAT(br1.isCompleted(), Eq(false));
-    EXPECT_THAT(br1.readBytes<1>(res.d), Eq(true));
-    EXPECT_THAT(br1.isCompleted(), Eq(true));
-
-}
-
-TEST(BufferBytesOperations, ReadWriteBufferFncCanAcceptSignedData) {
-    //setup data
-    constexpr size_t DATA_SIZE = 3;
-    int16_t src[DATA_SIZE] {54,-4877,30067};
-    //create and write to buffer
-    Buffer buf{};
-    BufferWriter bw{buf};
-    bw.writeBuffer<2>(src, DATA_SIZE);
-    bw.flush();
-    //read from buffer
-    BufferReader br1{buf};
-    int16_t dst[DATA_SIZE]{};
-    EXPECT_THAT(br1.readBuffer<2>(dst, DATA_SIZE), Eq(true));
-    EXPECT_THAT(dst, ContainerEq(src));
-
-    //read more than available
-    BufferReader br2{buf};
-    int16_t dstMore[DATA_SIZE+1]{};
-    EXPECT_THAT(br2.readBuffer<2>(dstMore, DATA_SIZE+1), Eq(false));
-}
-
-TEST(BufferBytesOperations, ReadWriteBufferCanWorkOnUnalignedData) {
-    //setup data
-    constexpr size_t DATA_SIZE = 3;
-    int16_t src[DATA_SIZE] {54,-4877,30067};
-    //create and write to buffer
-    Buffer buf{};
-    BufferWriter bw{buf};
-    bw.writeBits(15u, 4);
-    bw.writeBuffer<2>(src, DATA_SIZE);
-    bw.writeBits(12u, 4);
-    bw.flush();
-    EXPECT_THAT(buf.size(), Eq(sizeof(src) + 1));
-
-    //read from buffer
-    BufferReader br1{buf};
-    int16_t dst[DATA_SIZE]{};
-    uint8_t tmp{};
-    br1.readBits(tmp, 4);
-    EXPECT_THAT(tmp, Eq(15));
-    EXPECT_THAT(br1.readBuffer<2>(dst, DATA_SIZE), Eq(true));
-    EXPECT_THAT(dst, ContainerEq(src));
-    br1.readBits(tmp, 4);
-    EXPECT_THAT(tmp, Eq(12));
-
-    //read more than available
-    BufferReader br2{buf};
-    br2.readBits(tmp, 4);
-    int16_t dstMore[DATA_SIZE+1]{};
-    EXPECT_THAT(tmp, Eq(15));
-    EXPECT_THAT(br2.readBuffer<2>(dstMore, DATA_SIZE+1), Eq(false));
-}
-

tests/data_endianness.cpp

@@ -22,15 +22,15 @@
 
 
 #include <gmock/gmock.h>
-#include <bitsery/buffer_writer.h>
-#include <bitsery/buffer_reader.h>
-#include <bitsery/details/serialization_common.h>
+#include <bitsery/adapter_writer.h>
+#include <bitsery/adapter_reader.h>
+#include <bitsery/ext/value_range.h>
+#include "serialization_test_utils.h"
 
 using testing::Eq;
 using testing::ContainerEq;
 using bitsery::EndiannessType;
 using bitsery::DefaultConfig;
-using Buffer = std::vector<bitsery::DefaultConfig::BufferValueType>;
 
 constexpr EndiannessType getInverseEndianness(EndiannessType e) {
     return e == EndiannessType::LittleEndian
@@ -38,10 +38,8 @@ constexpr EndiannessType getInverseEndianness(EndiannessType e) {
            : EndiannessType::LittleEndian;
 }
 
-struct InverseEndiannessConfig {
+struct InverseEndiannessConfig:public DefaultConfig {
     static constexpr bitsery::EndiannessType NetworkEndianness = getInverseEndianness(DefaultConfig::NetworkEndianness);
-    using BufferValueType = DefaultConfig::BufferValueType;
-    using BufferScrathType = DefaultConfig::BufferScrathType;
 };
 
 struct IntegralTypes {
@@ -52,8 +50,10 @@ struct IntegralTypes {
     int8_t e;
 };
 
+using InverseReader = bitsery::AdapterReader<InputAdapter, InverseEndiannessConfig>;
 
-TEST(BufferEndianness, WhenWriteBytesThenBytesAreSwapped) {
+
+TEST(DataEndianness, WhenWriteBytesThenBytesAreSwapped) {
     //fill initial values
     IntegralTypes src{};
     src.a = 0x1122334455667788;
@@ -72,7 +72,7 @@ TEST(BufferEndianness, WhenWriteBytesThenBytesAreSwapped) {
 
     //create and write to buffer
     Buffer buf{};
-    bitsery::BasicBufferWriter<DefaultConfig> bw{buf};
+    Writer bw{buf};
     bw.writeBytes<8>(src.a);
     bw.writeBytes<4>(src.b);
     bw.writeBytes<2>(src.c);
@@ -80,7 +80,7 @@ TEST(BufferEndianness, WhenWriteBytesThenBytesAreSwapped) {
     bw.writeBytes<1>(src.e);
     bw.flush();
     //read from buffer using inverse endianness config
-    bitsery::BasicBufferReader<InverseEndiannessConfig> br{buf};
+    InverseReader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
     IntegralTypes res{};
     br.readBytes<8>(res.a);
     br.readBytes<4>(res.b);
@@ -95,25 +95,25 @@ TEST(BufferEndianness, WhenWriteBytesThenBytesAreSwapped) {
     EXPECT_THAT(res.e, Eq(resInv.e));
 }
 
-TEST(BufferEndianness, WhenWriteBuffer1ByteValuesThenEndiannessIsIgnored) {
+TEST(DataEndianness, WhenWrite1ByteValuesThenEndiannessIsIgnored) {
     //fill initial values
     constexpr size_t SIZE = 4;
     uint8_t src[SIZE] = {0xAA, 0xBB, 0xCC, 0xDD};
     uint8_t res[SIZE] = {};
     //create and write to buffer
     Buffer buf{};
-    bitsery::BasicBufferWriter<DefaultConfig> bw{buf};
+    Writer bw{buf};
     bw.writeBuffer<1>(src, SIZE);
     bw.flush();
     //read from buffer using inverse endianness config
-    bitsery::BasicBufferReader<InverseEndiannessConfig> br{buf};
+    InverseReader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
     br.readBuffer<1>(res, SIZE);
     //result is identical, because we write separate values, of size 1byte, that requires no swapping
     //check results
     EXPECT_THAT(res, ContainerEq(src));
 }
 
-TEST(BufferEndianness, WhenWriteBufferMoreThan1ByteValuesThenValuesAreSwapped) {
+TEST(DataEndianness, WhenWriteMoreThan1ByteValuesThenValuesAreSwapped) {
     //fill initial values
     constexpr size_t SIZE = 4;
     uint16_t src[SIZE] = {0xAA00, 0xBB11, 0xCC22, 0xDD33};
@@ -121,11 +121,11 @@ TEST(BufferEndianness, WhenWriteBufferMoreThan1ByteValuesThenValuesAreSwapped) {
     uint16_t res[SIZE] = {};
     //create and write to buffer
     Buffer buf{};
-    bitsery::BasicBufferWriter<DefaultConfig> bw{buf};
+    Writer bw{buf};
     bw.writeBuffer<2>(src, SIZE);
     bw.flush();
     //read from buffer using inverse endianness config
-    bitsery::BasicBufferReader<InverseEndiannessConfig> br{buf};
+    InverseReader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
     br.readBuffer<2>(res, SIZE);
     //result is identical, because we write separate values, of size 1byte, that requires no swapping
     //check results
@@ -145,15 +145,13 @@ struct IntegralUnsignedTypes {
     uint8_t d;
 };
 
-TEST(BufferEndianness, WhenBufferValueTypeIs1ByteThenBitOperationsIsNotAffectedByEndianness) {
-    //fill initial values
-    static_assert(sizeof(DefaultConfig::BufferValueType) == 1, "currently only 1 byte size, value size is supported");
+TEST(DataEndianness, WhenValueTypeIs1ByteThenBitOperationsIsNotAffectedByEndianness) {
     //fill initial values
     constexpr IntegralUnsignedTypes src {
-            0x0000334455667788,//bits 19
-            0x00CCDDEE,//bits 16
-            0x00DD,//bits 1
-            0x0F,//bits 6
+            0x0000334455667788,
+            0x00CCDDEE,
+            0x00DD,
+            0x0F,
     };
 
     constexpr size_t aBITS = getBits(src.a) + 8;
@@ -162,19 +160,21 @@ TEST(BufferEndianness, WhenBufferValueTypeIs1ByteThenBitOperationsIsNotAffectedB
     constexpr size_t dBITS = getBits(src.d) + 2;
     //create and write to buffer
     Buffer buf{};
-    bitsery::BasicBufferWriter<DefaultConfig> bw{buf};
-    bw.writeBits(src.a, aBITS);
-    bw.writeBits(src.b, bBITS);
-    bw.writeBits(src.c, cBITS);
-    bw.writeBits(src.d, dBITS);
-    bw.flush();
+    Writer bw{buf};
+    bitsery::AdapterWriterBitPackingWrapper<Writer> bpw{bw};
+    bpw.writeBits(src.a, aBITS);
+    bpw.writeBits(src.b, bBITS);
+    bpw.writeBits(src.c, cBITS);
+    bpw.writeBits(src.d, dBITS);
+    bpw.flush();
     //read from buffer using inverse endianness config
-    bitsery::BasicBufferReader<InverseEndiannessConfig> br{buf};
+    InverseReader br{InputAdapter{buf.begin(), bpw.writtenBytesCount()}};
+    bitsery::AdapterReaderBitPackingWrapper<InverseReader> bpr{br};
     IntegralUnsignedTypes res{};
-    br.readBits(res.a, aBITS);
-    br.readBits(res.b, bBITS);
-    br.readBits(res.c, cBITS);
-    br.readBits(res.d, dBITS);
+    bpr.readBits(res.a, aBITS);
+    bpr.readBits(res.b, bBITS);
+    bpr.readBits(res.c, cBITS);
+    bpr.readBits(res.d, dBITS);
     //check results
     EXPECT_THAT(res.a, Eq(src.a));
     EXPECT_THAT(res.b, Eq(src.b));

tests/data_operations.cpp

@@ -0,0 +1,360 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <bitsery/ext/value_range.h>
+
+using testing::Eq;
+using testing::ContainerEq;
+
+using AdapterBitPackingWriter = bitsery::AdapterWriterBitPackingWrapper<Writer>;
+using AdapterBitPackingReader = bitsery::AdapterReaderBitPackingWrapper<Reader>;
+
+
+struct IntegralUnsignedTypes {
+    uint32_t a;
+    uint16_t b;
+    uint8_t c;
+    uint8_t d;
+    uint64_t e;
+};
+
+template <typename T>
+constexpr size_t getBits(T v) {
+    return bitsery::details::calcRequiredBits<T>({}, v);
+};
+
+// *** bits operations
+
+TEST(DataBitsAndBytesOperations, WriteAndReadBitsMaxTypeValues) {
+    Buffer buf;
+    Writer bw{buf};
+    AdapterBitPackingWriter bpw{bw};
+    bpw.writeBits(std::numeric_limits<uint64_t>::max(), 64);
+    bpw.writeBits(std::numeric_limits<uint32_t>::max(), 32);
+    bpw.writeBits(std::numeric_limits<uint16_t>::max(), 16);
+    bpw.writeBits(std::numeric_limits<uint8_t>::max(), 8);
+    bpw.flush();
+
+    Reader br{InputAdapter{buf.begin(), bpw.writtenBytesCount()}};
+    AdapterBitPackingReader bpr{br};
+    uint64_t v64{};
+    uint32_t v32{};
+    uint16_t v16{};
+    uint8_t v8{};
+    bpr.readBits(v64, 64);
+    bpr.readBits(v32, 32);
+    bpr.readBits(v16, 16);
+    bpr.readBits(v8, 8);
+
+    EXPECT_THAT(v64, Eq(std::numeric_limits<uint64_t>::max()));
+    EXPECT_THAT(v32, Eq(std::numeric_limits<uint32_t>::max()));
+    EXPECT_THAT(v16, Eq(std::numeric_limits<uint16_t>::max()));
+    EXPECT_THAT(v8, Eq(std::numeric_limits<uint8_t>::max()));
+}
+
+TEST(DataBitsAndBytesOperations, WriteAndReadBits) {
+    //setup data
+    constexpr IntegralUnsignedTypes data{
+        485454,//bits 19
+        45978,//bits 16
+        0,//bits 1
+        36,//bits 6
+        479845648946//bits 39
+    };
+
+    constexpr size_t aBITS = getBits(data.a) + 2;
+    constexpr size_t bBITS = getBits(data.b) + 0;
+    constexpr size_t cBITS = getBits(data.c) + 2;
+    constexpr size_t dBITS = getBits(data.d) + 1;
+    constexpr size_t eBITS = getBits(data.e) + 8;
+
+    //create and write to buffer
+    Buffer buf;
+    Writer bw{buf};
+    AdapterBitPackingWriter bpw{bw};
+
+    bpw.writeBits(data.a, aBITS);
+    bpw.writeBits(data.b, bBITS);
+    bpw.writeBits(data.c, cBITS);
+    bpw.writeBits(data.d, dBITS);
+    bpw.writeBits(data.e, eBITS);
+    bpw.flush();
+    auto writtenSize = bpw.writtenBytesCount();
+    auto bytesCount = ((aBITS + bBITS + cBITS + dBITS + eBITS) / 8) +1 ;
+    EXPECT_THAT(writtenSize, Eq(bytesCount));
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), writtenSize}};
+    AdapterBitPackingReader bpr{br};
+
+    IntegralUnsignedTypes res{};
+
+    bpr.readBits(res.a, aBITS);
+    bpr.readBits(res.b, bBITS);
+    bpr.readBits(res.c, cBITS);
+    bpr.readBits(res.d, dBITS);
+    bpr.readBits(res.e, eBITS);
+
+    EXPECT_THAT(res.a, Eq(data.a));
+    EXPECT_THAT(res.b, Eq(data.b));
+    EXPECT_THAT(res.c, Eq(data.c));
+    EXPECT_THAT(res.d, Eq(data.d));
+    EXPECT_THAT(res.e, Eq(data.e));
+
+}
+
+TEST(DataBitsAndBytesOperations, WrittenSizeIsCountedPerByteNotPerBit) {
+    //setup data
+
+    //create and write to buffer
+    Buffer buf;
+    Writer bw{buf};
+    AdapterBitPackingWriter bpw{bw};
+
+    bpw.writeBits(7u,3);
+    bpw.flush();
+    auto writtenSize = bpw.writtenBytesCount();
+    EXPECT_THAT(writtenSize, Eq(1));
+
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), writtenSize}};
+    AdapterBitPackingReader bpr{br};
+    uint16_t tmp;
+    bpr.readBits(tmp,4);
+    bpr.readBits(tmp,2);
+    bpr.readBits(tmp,2);
+    EXPECT_THAT(bpr.error(), Eq(bitsery::ReaderError::NoError));
+    bpr.readBits(tmp,2);
+    EXPECT_THAT(bpr.error(), Eq(bitsery::ReaderError::DataOverflow));//false
+
+    //part of next byte
+    Reader br1{InputAdapter{buf.begin(), writtenSize}};
+    AdapterBitPackingReader bpr1{br1};
+    bpr1.readBits(tmp,2);
+    EXPECT_THAT(bpr1.error(), Eq(bitsery::ReaderError::NoError));
+    bpr1.readBits(tmp,7);
+    EXPECT_THAT(bpr1.error(), Eq(bitsery::ReaderError::DataOverflow));//false
+
+    //bigger than byte
+    Reader br2{InputAdapter{buf.begin(), writtenSize}};
+    AdapterBitPackingReader bpr2{br2};
+    bpr2.readBits(tmp,9);
+    EXPECT_THAT(bpr2.error(), Eq(bitsery::ReaderError::DataOverflow));//false
+}
+
+TEST(DataBitsAndBytesOperations, ConsecutiveCallsToAlignHasNoEffect) {
+    Buffer buf;
+    Writer bw{buf};
+    AdapterBitPackingWriter bpw{bw};
+
+    bpw.writeBits(3u, 2);
+    //3 calls to align after 1st data
+    bpw.align();
+    bpw.align();
+    bpw.align();
+    bpw.writeBits(7u, 3);
+    //1 call to align after 2nd data
+    bpw.align();
+    bpw.writeBits(15u, 4);
+    bpw.flush();
+
+    unsigned char tmp;
+    Reader br{InputAdapter{buf.begin(), bpw.writtenBytesCount()}};
+    AdapterBitPackingReader bpr{br};
+    bpr.readBits(tmp,2);
+    EXPECT_THAT(tmp, Eq(3u));
+    bpr.align();
+    EXPECT_THAT(bpr.error(), Eq(bitsery::ReaderError::NoError));
+    bpr.readBits(tmp,3);
+    bpr.align();
+    bpr.align();
+    bpr.align();
+    EXPECT_THAT(tmp, Eq(7u));
+    EXPECT_THAT(bpr.error(), Eq(bitsery::ReaderError::NoError));
+
+    bpr.readBits(tmp,4);
+    EXPECT_THAT(tmp, Eq(15u));
+    EXPECT_THAT(bpr.error(), Eq(bitsery::ReaderError::NoError));
+}
+
+TEST(DataBitsAndBytesOperations, AlignWritesZerosBits) {
+    //setup data
+
+    //create and write to buffer
+    Buffer buf;
+    Writer bw{buf};
+    AdapterBitPackingWriter bpw{bw};
+
+    //write 2 bits and align
+    bpw.writeBits(3u, 2);
+    bpw.align();
+    bpw.flush();
+    auto writtenSize = bpw.writtenBytesCount();
+    EXPECT_THAT(writtenSize, Eq(1));
+    unsigned char tmp;
+    Reader br1{InputAdapter{buf.begin(), writtenSize}};
+    AdapterBitPackingReader bpr1{br1};
+    bpr1.readBits(tmp,2);
+    //read aligned bits
+    bpr1.readBits(tmp,6);
+    EXPECT_THAT(tmp, Eq(0));
+
+    Reader br2{InputAdapter{buf.begin(), writtenSize}};
+    AdapterBitPackingReader bpr2{br2};
+    //read 2 bits
+    bpr2.readBits(tmp,2);
+    bpr2.align();
+    EXPECT_THAT(bpr2.error(), Eq(bitsery::ReaderError::NoError));
+}
+
+
+// *** bytes operations
+
+struct IntegralTypes {
+    int64_t a;
+    uint32_t b;
+    int16_t c;
+    uint8_t d;
+    int8_t e;
+    int8_t f[2];
+};
+
+TEST(DataBitsAndBytesOperations, WriteAndReadBytes) {
+    //setup data
+    IntegralTypes data;
+    data.a = -4894541654564;
+    data.b = 94545646;
+    data.c = -8778;
+    data.d = 200;
+    data.e = -98;
+    data.f[0] = 43;
+    data.f[1] = -45;
+
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+    bw.writeBytes<4>(data.b);
+    bw.writeBytes<2>(data.c);
+    bw.writeBytes<1>(data.d);
+    bw.writeBytes<8>(data.a);
+    bw.writeBytes<1>(data.e);
+    bw.writeBuffer<1>(data.f, 2);
+    bw.flush();
+    auto writtenSize = bw.writtenBytesCount();
+
+    EXPECT_THAT(writtenSize, Eq(18));
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), writtenSize}};
+    IntegralTypes res{};
+    br.readBytes<4>(res.b);
+    br.readBytes<2>(res.c);
+    br.readBytes<1>(res.d);
+    br.readBytes<8>(res.a);
+    br.readBytes<1>(res.e);
+    br.readBuffer<1>(res.f, 2);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::NoError));
+    //assert results
+
+    EXPECT_THAT(data.a, Eq(res.a));
+    EXPECT_THAT(data.b, Eq(res.b));
+    EXPECT_THAT(data.c, Eq(res.c));
+    EXPECT_THAT(data.d, Eq(res.d));
+    EXPECT_THAT(data.e, Eq(res.e));
+    EXPECT_THAT(data.f, ContainerEq(res.f));
+
+}
+
+TEST(DataBitsAndBytesOperations, ReadWriteFncCanAcceptSignedData) {
+    //setup data
+    constexpr size_t DATA_SIZE = 3;
+    int16_t src[DATA_SIZE] {54,-4877,30067};
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+    bw.writeBuffer<2>(src, DATA_SIZE);
+    bw.flush();
+    //read from buffer
+    Reader br1{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    int16_t dst[DATA_SIZE]{};
+    br1.readBuffer<2>(dst, DATA_SIZE);
+    EXPECT_THAT(br1.error(), Eq(bitsery::ReaderError::NoError));
+    EXPECT_THAT(dst, ContainerEq(src));
+}
+
+TEST(DataBitsAndBytesOperations, ReadWriteCanWorkOnUnalignedData) {
+    //setup data
+    constexpr size_t DATA_SIZE = 3;
+    int16_t src[DATA_SIZE] {54,-4877,30067};
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+    AdapterBitPackingWriter bpw{bw};
+    bpw.writeBits(15u, 4);
+    bpw.writeBuffer<2>(src, DATA_SIZE);
+    bpw.writeBits(12u, 4);
+    bpw.flush();
+    auto writtenSize = bpw.writtenBytesCount();
+    EXPECT_THAT(writtenSize, Eq(sizeof(src) + 1));
+
+    //read from buffer
+    Reader br1{InputAdapter{buf.begin(), writtenSize}};
+    AdapterBitPackingReader bpr1{br1};
+    int16_t dst[DATA_SIZE]{};
+    uint8_t tmp{};
+    bpr1.readBits(tmp, 4);
+    EXPECT_THAT(tmp, Eq(15));
+    bpr1.readBuffer<2>(dst, DATA_SIZE);
+    EXPECT_THAT(bpr1.error(), Eq(bitsery::ReaderError::NoError));
+    EXPECT_THAT(dst, ContainerEq(src));
+    bpr1.readBits(tmp, 4);
+    EXPECT_THAT(tmp, Eq(12));
+}
+
+TEST(DataBitsAndBytesOperations, RegressionTestReadBytesAfterReadBitsWithLotsOfZeroBits) {
+    //setup data
+    int16_t data[2]{0x0000, 0x7FFF};
+    int16_t res[2]{};
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+    AdapterBitPackingWriter bpw{bw};
+    bpw.writeBits(2u, 2);
+    bpw.writeBytes<2>(data[0]);
+    bpw.writeBytes<2>(data[1]);
+    bpw.align();
+    bpw.flush();
+
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), bpw.writtenBytesCount()}};
+    AdapterBitPackingReader bpr{br};
+    uint8_t tmp{};
+    bpr.readBits(tmp, 2);
+    EXPECT_THAT(tmp, Eq(2));
+    bpr.readBytes<2>(res[0]);
+    bpr.readBytes<2>(res[1]);
+    bpr.align();
+    EXPECT_THAT(res[0], Eq(data[0]));
+    EXPECT_THAT(res[1], Eq(data[1]));
+}
+

tests/data_reading.cpp

@@ -0,0 +1,155 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <list>
+#include <bitset>
+
+using testing::Eq;
+
+struct IntegralTypes {
+    int64_t a;
+    uint32_t b;
+    int16_t c;
+    uint8_t d;
+    int8_t e;
+    int8_t f[2];
+};
+
+TEST(DataReading, WhenReadingMoreThanAvailableThenEmptyBufferError) {
+    //setup data
+    uint8_t a = 111;
+
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+
+    bw.writeBytes<1>(a);
+    bw.writeBytes<1>(a);
+    bw.writeBytes<1>(a);
+    bw.flush();
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    int32_t c;
+    br.readBytes<4>(c);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::DataOverflow));
+}
+
+TEST(DataReading, WhenErrorOccursThenAllOtherOperationsFailsForSameError) {
+    //setup data
+    uint8_t a = 111;
+
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+
+    bw.writeBytes<1>(a);
+    bw.writeBytes<1>(a);
+    bw.writeBytes<1>(a);
+    bw.flush();
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    int32_t c;
+    br.readBytes<4>(c);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::DataOverflow));
+    br.readBytes<1>(a);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::DataOverflow));
+}
+
+
+TEST(DataReading, ReadIsCompletedSuccessfullyWhenAllBytesAreReadWithoutErrors) {
+    //setup data
+    IntegralTypes data;
+    data.b = 94545646;
+    data.c = -8778;
+    data.d = 200;
+
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+
+    bw.writeBytes<4>(data.b);
+    bw.writeBytes<2>(data.c);
+    bw.writeBytes<1>(data.d);
+    bw.flush();
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    IntegralTypes res;
+    br.readBytes<4>(res.b);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::NoError));
+    br.readBytes<2>(res.c);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::NoError));
+    EXPECT_THAT(br.isCompletedSuccessfully(), Eq(false));
+    br.readBytes<1>(res.d);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::NoError));
+    EXPECT_THAT(br.isCompletedSuccessfully(), Eq(true));
+    br.readBytes<1>(res.d);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::DataOverflow));
+    EXPECT_THAT(br.isCompletedSuccessfully(), Eq(false));
+
+    Reader br1{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    br1.readBytes<4>(res.b);
+    EXPECT_THAT(br1.error(), Eq(bitsery::ReaderError::NoError));
+    br1.readBytes<2>(res.c);
+    EXPECT_THAT(br1.error(), Eq(bitsery::ReaderError::NoError));
+    EXPECT_THAT(br1.isCompletedSuccessfully(), Eq(false));
+    br1.readBytes<2>(res.c);
+    EXPECT_THAT(br1.error(), Eq(bitsery::ReaderError::DataOverflow));
+    EXPECT_THAT(br1.isCompletedSuccessfully(), Eq(false));
+    br1.readBytes<1>(res.d);
+    EXPECT_THAT(br1.error(), Eq(bitsery::ReaderError::DataOverflow));
+    EXPECT_THAT(br1.isCompletedSuccessfully(), Eq(false));
+}
+
+TEST(DataReading, WhenReaderHasErrorsAllOperationsReadsReturnZero) {
+    //setup data
+    uint8_t a = 111;
+
+    //create and write to buffer
+    Buffer buf{};
+    Writer bw{buf};
+
+    bw.writeBytes<1>(a);
+    bw.writeBytes<1>(a);
+    bw.writeBytes<1>(a);
+    bw.flush();
+    //read from buffer
+    Reader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    bitsery::AdapterReaderBitPackingWrapper<Reader> bpr{br};
+    int32_t c;
+    bpr.readBytes<4>(c);
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::DataOverflow));
+
+    int16_t r1= {-645};
+    uint32_t r2[2] = {54898,87854};
+    uint8_t r3 = 0xFF;
+
+    bpr.readBytes<2>(r1);
+    bpr.readBuffer<4>(r2, 2);
+    bpr.readBits(r3, 7);
+    EXPECT_THAT(r1, Eq(0));
+    EXPECT_THAT(r2[0], Eq(0u));
+    EXPECT_THAT(r2[1], Eq(0u));
+    EXPECT_THAT(r3, Eq(0u));
+}

tests/data_reading_errors.cpp

@@ -0,0 +1,121 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <bitsery/traits/string.h>
+
+using testing::Eq;
+using SessionsEnabledWriter = bitsery::AdapterWriter<OutputAdapter, SessionsEnabledConfig>;
+using SessionsEnabledReader = bitsery::AdapterReader<InputAdapter, SessionsEnabledConfig>;
+
+TEST(DataReadingErrors, WhenContainerOrTextSizeIsMoreThanMaxThenInvalidDataError) {
+    SerializationContext ctx;
+    std::string tmp = "larger text then allowed";
+    ctx.createSerializer().text1b(tmp,100);
+    ctx.createDeserializer().text1b(tmp, 10);
+    EXPECT_THAT(ctx.br->error(), Eq(bitsery::ReaderError::InvalidData));
+}
+
+TEST(DataReadingErrors, WhenReadingBoolByteReadsMoreThanOneThenInvalidBufferDataErrorAndResultIsFalse) {
+    SerializationContext ctx;
+    auto& ser = ctx.createSerializer();
+    ser.value1b(uint8_t{1});
+    ser.value1b(uint8_t{2});
+    bool res{};
+    auto& des = ctx.createDeserializer();
+    des.boolValue(res);
+    EXPECT_THAT(res, Eq(true));
+    des.boolValue(res);
+    EXPECT_THAT(res, Eq(false));
+    EXPECT_THAT(ctx.br->error(), Eq(bitsery::ReaderError::InvalidData));
+}
+
+TEST(DataReadingErrors, WhenReadingAlignHasNonZerosThenInvalidDataError) {
+    Buffer buf{};
+    Writer bw{buf};
+    uint8_t tmp{0xFF};
+    bw.writeBytes<1>(tmp);
+    bw.flush();
+
+    Reader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    bitsery::AdapterReaderBitPackingWrapper<Reader> bpr{br};
+
+    bpr.readBits(tmp,3);
+    bpr.align();
+    EXPECT_THAT(bpr.error(), Eq(bitsery::ReaderError::InvalidData));
+}
+
+TEST(DataReadingErrors, WhenReadingNewSessionInMiddleOfOldDataThenInvalidDataError) {
+    uint8_t tmp{0xFF};
+    Buffer buf{};
+    SessionsEnabledWriter bw{buf};
+    for (auto i = 0; i < 2; ++i) {
+        bw.beginSession();
+        bw.writeBytes<1>(tmp);
+        bw.writeBytes<1>(tmp);
+        bw.endSession();
+    }
+    bw.flush();
+    SessionsEnabledReader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    for (auto i = 0; i < 2; ++i) {
+        br.beginSession();
+        br.readBytes<1>(tmp);
+        br.beginSession();
+        br.readBytes<1>(tmp);
+        br.endSession();
+        br.endSession();
+    }
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::InvalidData));
+}
+
+
+TEST(DataReadingErrors, WhenInitializingSessionsWhenNotEnoughDataThenInvalidData) {
+    uint8_t tmp1{0xFF};
+    Buffer buf1{};
+    SessionsEnabledWriter bw1{buf1};
+    bw1.writeBytes<1>(tmp1);
+    bw1.flush();
+    SessionsEnabledReader br1{InputAdapter{buf1.begin(), bw1.writtenBytesCount()}};
+    br1.beginSession();
+    EXPECT_THAT(br1.error(), Eq(bitsery::ReaderError::InvalidData));
+
+    Buffer buf2{};
+    SessionsEnabledWriter bw2{buf2};
+    uint16_t tmp2{0x8000};
+    bw2.writeBytes<2>(tmp2);
+    bw2.flush();
+    SessionsEnabledReader br2{InputAdapter{buf2.begin(), bw2.writtenBytesCount()}};
+    br2.beginSession();
+    EXPECT_THAT(br2.error(), Eq(bitsery::ReaderError::InvalidData));
+}
+
+TEST(DataReadingErrors, WhenInitializingSessionsWhereSessionsDataOffsetIsCorruptedThenInvalidData) {
+    Buffer buf{};
+    SessionsEnabledWriter bw{buf};
+    bw.writeBytes<1>(uint8_t{1});
+    bw.writeBytes<1>(uint8_t{1});
+    bw.writeBytes<2>(uint16_t{10});
+    SessionsEnabledReader br{InputAdapter{buf.begin(), bw.writtenBytesCount()}};
+    br.beginSession();
+    EXPECT_THAT(br.error(), Eq(bitsery::ReaderError::InvalidData));
+}

tests/data_writing.cpp

@@ -0,0 +1,110 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <bitsery/details/serialization_common.h>
+#include <bitsery/traits/array.h>
+
+using testing::Eq;
+using testing::ContainerEq;
+using bitsery::EndiannessType;
+
+template <typename BufType>
+class DataWriting:public testing::Test {
+public:
+    using TWriter = bitsery::AdapterWriter<bitsery::OutputBufferAdapter<BufType>, bitsery::DefaultConfig>;
+    using TBuffer = BufType;
+};
+
+using NonFixedContainer = std::vector<uint8_t>;
+using FixedContainer = std::array<uint8_t, 100>;
+
+using ContainerTypes = ::testing::Types<FixedContainer,NonFixedContainer>;
+
+TYPED_TEST_CASE(DataWriting, ContainerTypes);
+
+static constexpr size_t DATA_SIZE = 14u;
+
+template <typename BW>
+void writeData(BW& bw) {
+    uint16_t tmp1{45}, tmp2{6543}, tmp3{46533};
+    uint32_t tmp4{8979445}, tmp5{7987564};
+    bw.template writeBytes<2>(tmp1);
+    bw.template writeBytes<2>(tmp2);
+    bw.template writeBytes<2>(tmp3);
+    bw.template writeBytes<4>(tmp4);
+    bw.template writeBytes<4>(tmp5);
+}
+
+TYPED_TEST(DataWriting, GetWrittenBytesCountReturnsActualBytesWritten) {
+    using TWriter = typename TestFixture::TWriter;
+    using TBuffer = typename TestFixture::TBuffer;
+    TBuffer buf{};
+    TWriter bw{buf};
+    writeData(bw);
+    bw.flush();
+    auto writtenSize = bw.writtenBytesCount();
+    EXPECT_THAT(writtenSize, DATA_SIZE);
+    EXPECT_THAT(buf.size(), ::testing::Ge(DATA_SIZE));
+}
+
+TYPED_TEST(DataWriting, WhenWritingBitsThenMustFlushWriter) {
+    using TWriter = typename TestFixture::TWriter;
+    using TBuffer = typename TestFixture::TBuffer;
+    TBuffer buf{};
+    TWriter bw{buf};
+    bitsery::AdapterWriterBitPackingWrapper<TWriter> bpw{bw};
+    bpw.writeBits(3u, 2);
+    auto writtenSize1 = bpw.writtenBytesCount();
+    bpw.flush();
+    auto writtenSize2 = bpw.writtenBytesCount();
+    EXPECT_THAT(writtenSize1, Eq(0));
+    EXPECT_THAT(writtenSize2, Eq(1));
+}
+
+TYPED_TEST(DataWriting, WhenDataAlignedThenFlushHasNoEffect) {
+    using TWriter = typename TestFixture::TWriter;
+    using TBuffer = typename TestFixture::TBuffer;
+    TBuffer buf{};
+    TWriter bw{buf};
+    bitsery::AdapterWriterBitPackingWrapper<TWriter> bpw{bw};
+    bpw.writeBits(3u, 2);
+    bpw.align();
+    auto writtenSize1 = bpw.writtenBytesCount();
+    bpw.flush();
+    auto writtenSize2 = bpw.writtenBytesCount();
+    EXPECT_THAT(writtenSize1, Eq(1));
+    EXPECT_THAT(writtenSize2, Eq(1));
+
+}
+
+TEST(DataWritingNonFixedBufferContainer, ContainerIsAlwaysResizedToCapacity) {
+    NonFixedContainer buf{};
+    bitsery::AdapterWriter<bitsery::OutputBufferAdapter<NonFixedContainer>, bitsery::DefaultConfig> bw{buf};
+    for (auto i = 0; i < 5; ++i) {
+        uint32_t tmp{};
+        bw.writeBytes<4>(tmp);
+        bw.writeBytes<4>(tmp);
+        EXPECT_TRUE(buf.size() == buf.capacity());
+    }
+}

tests/flexible_syntax.cpp

@@ -0,0 +1,386 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <bitsery/flexible.h>
+
+#include <bitsery/flexible/string.h>
+#include <bitsery/flexible/array.h>
+#include <bitsery/flexible/vector.h>
+#include <bitsery/flexible/list.h>
+#include <bitsery/flexible/forward_list.h>
+#include <bitsery/flexible/deque.h>
+#include <bitsery/flexible/queue.h>
+#include <bitsery/flexible/stack.h>
+#include <bitsery/flexible/map.h>
+#include <bitsery/flexible/unordered_map.h>
+#include <bitsery/flexible/set.h>
+#include <bitsery/flexible/unordered_set.h>
+
+using testing::Eq;
+
+TEST(FlexibleSyntax, FundamentalTypesAndBool) {
+    int ti = 8745;
+    MyEnumClass te = MyEnumClass::E4;
+    float tf = 485.042f;
+    double_t td = -454184.48445;
+    bool tb=true;
+    SerializationContext ctx;
+    ctx.createSerializer().archive(ti,te,tf,td,tb);
+
+    //result
+    int ri{};
+    MyEnumClass re{};
+    float rf{};
+    double_t rd{};
+    bool rb{};
+    ctx.createDeserializer().archive(ri,re,rf,rd,rb);
+
+    //test
+    EXPECT_THAT(ri, Eq(ti));
+    EXPECT_THAT(re, Eq(te));
+    EXPECT_THAT(rf, Eq(tf));
+    EXPECT_THAT(rd, Eq(td));
+    EXPECT_THAT(rb, Eq(tb));
+}
+
+TEST(FlexibleSyntax, UseObjectFncInsteadOfValueN) {
+    int ti = 8745;
+    MyEnumClass te = MyEnumClass::E4;
+    float tf = 485.042f;
+    double_t td = -454184.48445;
+    bool tb=true;
+    SerializationContext ctx;
+    auto& ser = ctx.createSerializer();
+    ser.object(ti);
+    ser.object(te);
+    ser.object(tf);
+    ser.object(td);
+    ser.object(tb);
+
+    //result
+    int ri{};
+    MyEnumClass re{};
+    float rf{};
+    double_t rd{};
+    bool rb{};
+    auto& des = ctx.createDeserializer();
+    des.object(ri);
+    des.object(re);
+    des.object(rf);
+    des.object(rd);
+    des.object(rb);
+
+    //test
+    EXPECT_THAT(ri, Eq(ti));
+    EXPECT_THAT(re, Eq(te));
+    EXPECT_THAT(rf, Eq(tf));
+    EXPECT_THAT(rd, Eq(td));
+    EXPECT_THAT(rb, Eq(tb));
+}
+
+TEST(FlexibleSyntax, MixDifferentSyntax) {
+    int ti = 8745;
+    MyEnumClass te = MyEnumClass::E4;
+    float tf = 485.042f;
+    double_t td = -454184.48445;
+    bool tb=true;
+    SerializationContext ctx;
+    auto& ser = ctx.createSerializer();
+    ser.value<sizeof(ti)>(ti);
+    ser.archive(te, tf, td);
+    ser.object(tb);
+
+    //result
+    int ri{};
+    MyEnumClass re{};
+    float rf{};
+    double_t rd{};
+    bool rb{};
+    auto& des = ctx.createDeserializer();
+    des.archive(ri, re, rf);
+    des.value8b(rd);
+    des.object(rb);
+
+    //test
+    EXPECT_THAT(ri, Eq(ti));
+    EXPECT_THAT(re, Eq(te));
+    EXPECT_THAT(rf, Eq(tf));
+    EXPECT_THAT(rd, Eq(td));
+    EXPECT_THAT(rb, Eq(tb));
+}
+
+
+template <typename T>
+T procArchive(const T& testData) {
+    SerializationContext ctx;
+    ctx.createSerializer().archive(testData);
+    T res;
+    ctx.createDeserializer().archive(res);
+    return res;
+}
+
+template <typename T>
+T procArchiveWithMaxSize(const T& testData) {
+    SerializationContext ctx;
+    ctx.createSerializer().archive(bitsery::maxSize(testData, 100));
+    T res;
+    ctx.createDeserializer().archive(bitsery::maxSize(res, 100));
+    return res;
+}
+
+TEST(FlexibleSyntax, CStyleArrayForValueTypesAsContainer) {
+    const int t1[3]{8748,-484,45};
+    int r1[3]{0,0,0};
+
+    SerializationContext ctx;
+    ctx.createSerializer().archive(bitsery::asContainer(t1));
+    ctx.createDeserializer().archive(bitsery::asContainer(r1));
+
+    EXPECT_THAT(r1, ::testing::ContainerEq(t1));
+}
+
+TEST(FlexibleSyntax, CStyleArrayForIntegralTypesAsText) {
+    const char t1[3]{"hi"};
+    char r1[3]{0,0,0};
+
+    SerializationContext ctx;
+    ctx.createSerializer().archive(bitsery::asText(t1));
+    ctx.createDeserializer().archive(bitsery::asText(r1));
+
+    EXPECT_THAT(r1, ::testing::ContainerEq(t1));
+}
+
+TEST(FlexibleSyntax, CStyleArray) {
+    const MyEnumClass t1[3]{MyEnumClass::E1, MyEnumClass::E4, MyEnumClass::E2};
+    MyEnumClass r1[3]{};
+
+    SerializationContext ctx;
+    ctx.createSerializer().archive(t1);
+    ctx.createDeserializer().archive(r1);
+
+    EXPECT_THAT(r1, ::testing::ContainerEq(t1));
+}
+
+
+TEST(FlexibleSyntax, StdString) {
+    std::string t1{"my nice string"};
+    std::string t2{};
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchive(t2), Eq(t2));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t2), Eq(t2));
+}
+
+TEST(FlexibleSyntax, StdArray) {
+    std::array<int, 3> t1{8748,-484,45};
+    std::array<int, 0> t2{};
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchive(t2), Eq(t2));
+
+}
+
+TEST(FlexibleSyntax, StdVector) {
+    std::vector<int> t1{8748,-484,45};
+    std::vector<float> t2{5.f,0.198f};
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchive(t2), Eq(t2));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t2), Eq(t2));
+
+}
+
+TEST(FlexibleSyntax, StdList) {
+    std::list<int> t1{8748,-484,45};
+    std::list<float> t2{5.f,0.198f};
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchive(t2), Eq(t2));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t2), Eq(t2));
+
+}
+
+TEST(FlexibleSyntax, StdForwardList) {
+    std::forward_list<int> t1{8748,-484,45};
+    std::forward_list<float> t2{5.f,0.198f};
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchive(t2), Eq(t2));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t2), Eq(t2));
+
+}
+
+TEST(FlexibleSyntax, StdDeque) {
+    std::deque<int> t1{8748,-484,45};
+    std::deque<float> t2{5.f,0.198f};
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchive(t2), Eq(t2));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t2), Eq(t2));
+
+}
+
+TEST(FlexibleSyntax, StdQueue) {
+    std::queue<std::string> t1;
+    t1.push("first");
+    t1.push("second string");
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+
+}
+
+TEST(FlexibleSyntax, StdPriorityQueue) {
+    std::priority_queue<std::string> t1;
+    t1.push("first");
+    t1.push("second string");
+    t1.push("third");
+    t1.push("fourth");
+    auto r1 = procArchive(t1);
+    //we cannot compare priority queue directly
+
+    EXPECT_THAT(r1.size(), Eq(t1.size()));
+    for (auto i = 0u; i < r1.size(); ++i) {
+        EXPECT_THAT(r1.top(), Eq(t1.top()));
+        r1.pop();
+        t1.pop();
+    }
+
+}
+
+TEST(FlexibleSyntax, StdStack) {
+    std::stack<std::string> t1;
+    t1.push("first");
+    t1.push("second string");
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+
+}
+
+TEST(FlexibleSyntax, StdUnorderedMap) {
+    std::unordered_map<int, int> t1;
+    t1.emplace(3423,624);
+    t1.emplace(-5484,-845);
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+}
+
+TEST(FlexibleSyntax, StdUnorderedMultiMap) {
+    std::unordered_multimap<std::string, int> t1;
+    t1.emplace("one",624);
+    t1.emplace("two",-845);
+    t1.emplace("one",897);
+
+    EXPECT_TRUE(procArchive(t1) == t1);
+    EXPECT_TRUE(procArchiveWithMaxSize(t1) == t1);
+}
+
+TEST(FlexibleSyntax, StdMap) {
+    std::map<int, int> t1;
+    t1.emplace(3423,624);
+    t1.emplace(-5484,-845);
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+}
+
+TEST(FlexibleSyntax, StdMultiMap) {
+    std::multimap<std::string, int> t1;
+    t1.emplace("one",624);
+    t1.emplace("two",-845);
+    t1.emplace("one",897);
+
+    auto res = procArchive(t1);
+    //same key values is not ordered, and operator == compares each element at same position
+    //so we need to compare our selves
+    EXPECT_THAT(res.size(), Eq(3));
+    for (auto it = t1.begin(); it != t1.end();) {
+        const auto lr = t1.equal_range(it->first);
+        const auto rr = res.equal_range(it->first);
+        EXPECT_TRUE(std::distance(lr.first, lr.second) == std::distance(rr.first, rr.second));
+        EXPECT_TRUE(std::is_permutation(lr.first, lr.second, rr.first));
+        it = lr.second;
+    }
+}
+
+TEST(FlexibleSyntax, StdUnorderedSet) {
+    std::unordered_set<std::string> t1;
+    t1.emplace("one");
+    t1.emplace("two");
+    t1.emplace("three");
+
+    EXPECT_TRUE(procArchive(t1) == t1);
+    EXPECT_TRUE(procArchiveWithMaxSize(t1) == t1);
+}
+
+TEST(FlexibleSyntax, StdUnorderedMultiSet) {
+    std::unordered_multiset<std::string> t1;
+    t1.emplace("one");
+    t1.emplace("two");
+    t1.emplace("three");
+    t1.emplace("one");
+
+    EXPECT_TRUE(procArchive(t1) == t1);
+    EXPECT_TRUE(procArchiveWithMaxSize(t1) == t1);
+}
+
+TEST(FlexibleSyntax, StdSet) {
+    std::set<std::string> t1;
+    t1.emplace("one");
+    t1.emplace("two");
+    t1.emplace("three");
+
+    EXPECT_TRUE(procArchive(t1) == t1);
+    EXPECT_TRUE(procArchiveWithMaxSize(t1) == t1);
+}
+
+TEST(FlexibleSyntax, StdMultiSet) {
+    std::multiset<std::string> t1;
+    t1.emplace("one");
+    t1.emplace("two");
+    t1.emplace("three");
+    t1.emplace("one");
+    t1.emplace("two");
+
+    EXPECT_TRUE(procArchive(t1) == t1);
+    EXPECT_TRUE(procArchiveWithMaxSize(t1) == t1);
+}
+
+
+TEST(FlexibleSyntax, NestedTypes) {
+    std::unordered_map<std::string, std::vector<std::string>> t1;
+    t1.emplace("my key", std::vector<std::string>{"very", "nice", "string"});
+    t1.emplace("other key", std::vector<std::string>{"just a string"});
+
+    EXPECT_THAT(procArchive(t1), Eq(t1));
+    EXPECT_THAT(procArchiveWithMaxSize(t1), Eq(t1));
+}

tests/serialization_bool.cpp

@@ -26,15 +26,28 @@
 
 using testing::Eq;
 
+using Serializer = bitsery::BasicSerializer<bitsery::AdapterWriterBitPackingWrapper<Writer>>;
+
+using Deserializer = bitsery::BasicDeserializer<bitsery::AdapterReaderBitPackingWrapper<Reader>>;
+
 
 TEST(SerializeBooleans, BoolAsBit) {
+
     SerializationContext ctx;
     bool t1{true};
     bool t2{false};
     bool res1;
     bool res2;
-    ctx.createSerializer().boolBit(t1).boolBit(t2);
-    ctx.createDeserializer().boolBit(res1).boolBit(res2);
+    auto& ser = ctx.createSerializer();
+    ser.enableBitPacking([&t1, &t2](Serializer& sbp) {
+        sbp.boolValue(t1);
+        sbp.boolValue(t2);
+    });
+    auto& des = ctx.createDeserializer();
+    des.enableBitPacking([&res1, &res2](Deserializer& sbp) {
+        sbp.boolValue(res1);
+        sbp.boolValue(res2);
+    });
 
     EXPECT_THAT(res1, Eq(t1));
     EXPECT_THAT(res2, Eq(t2));
@@ -47,8 +60,12 @@ TEST(SerializeBooleans, BoolAsByte) {
     bool t2{false};
     bool res1;
     bool res2;
-    ctx.createSerializer().boolByte(t1).boolByte(t2);
-    ctx.createDeserializer().boolByte(res1).boolByte(res2);
+    auto& ser = ctx.createSerializer();
+    ser.boolValue(t1);
+    ser.boolValue(t2);
+    auto& des = ctx.createDeserializer();
+    des.boolValue(res1);
+    des.boolValue(res2);
 
     EXPECT_THAT(res1, Eq(t1));
     EXPECT_THAT(res2, Eq(t2));

tests/serialization_container.cpp

@@ -23,10 +23,14 @@
 
 
 #include <gmock/gmock.h>
-#include "serialization_test_utils.h"
+#include <algorithm>
 #include <numeric>
-#include <deque>
-#include <list>
+
+#include "serialization_test_utils.h"
+#include <bitsery/traits/array.h>
+#include <bitsery/traits/list.h>
+#include <bitsery/traits/deque.h>
+#include <bitsery/traits/forward_list.h>
 
 using testing::ContainerEq;
 using testing::Eq;
@@ -36,29 +40,29 @@ using testing::Eq;
  * overload to get container of types
  */
 
-template <typename Container>
+template<typename Container>
 Container getFilledContainer() {
-    return {1,2,3,4,5,78,456,8,54};
+    return {1, 2, 3, 4, 5, 78, 456, 8, 54};
 }
 
-template <>
+template<>
 std::vector<MyStruct1> getFilledContainer<std::vector<MyStruct1>>() {
     return {
-            {0,1},
-            {2,3},
-            {4,5},
-            {6,7},
-            {8,9},
-            {11,34},
-            {5134,1532}
+            {0,    1},
+            {2,    3},
+            {4,    5},
+            {6,    7},
+            {8,    9},
+            {11,   34},
+            {5134, 1532}
     };
 }
 
-template <>
+template<>
 std::list<MyStruct2> getFilledContainer<std::list<MyStruct2>>() {
     return {
-            {MyStruct2::V1, {0,1}} ,
-            {MyStruct2::V3, {-45,45}}
+            {MyStruct2::V1, {0,   1}},
+            {MyStruct2::V3, {-45, 45}}
     };
 }
 
@@ -66,28 +70,30 @@ std::list<MyStruct2> getFilledContainer<std::list<MyStruct2>>() {
  * start testing session
  */
 
-template <typename T>
-class SerializeContainerArthmeticTypes:public testing::Test {
+template<typename T>
+class SerializeContainerDynamicSizeArthmeticTypes : public testing::Test {
 public:
     using TContainer = T;
     using TValue = typename T::value_type;
 
-    const TContainer src= getFilledContainer<TContainer>() ;
+    const TContainer src = getFilledContainer<TContainer>();
     TContainer res{};
 
-    size_t getExpectedBufSize(const SerializationContext& ctx) const {
-        return ctx.containerSizeSerializedBytesCount(src.size()) + src.size() * sizeof(TValue);
+    size_t getExpectedBufSize(const SerializationContext &ctx) const {
+        auto size = bitsery::traits::ContainerTraits<TContainer>::size(src);
+        return ctx.containerSizeSerializedBytesCount(size) + size * sizeof(TValue);
     }
 };
 //std::forward_list is not supported, because it doesn't have size() method
 using SequenceContainersWithArthmeticTypes = ::testing::Types<
         std::vector<int>,
         std::list<float>,
+        std::forward_list<int>,
         std::deque<unsigned short>>;
 
-TYPED_TEST_CASE(SerializeContainerArthmeticTypes, SequenceContainersWithArthmeticTypes);
+TYPED_TEST_CASE(SerializeContainerDynamicSizeArthmeticTypes, SequenceContainersWithArthmeticTypes);
 
-TYPED_TEST(SerializeContainerArthmeticTypes, Values) {
+TYPED_TEST(SerializeContainerDynamicSizeArthmeticTypes, Values) {
     SerializationContext ctx{};
     using TValue = typename TestFixture::TValue;
 
@@ -98,53 +104,51 @@ TYPED_TEST(SerializeContainerArthmeticTypes, Values) {
     EXPECT_THAT(this->res, ContainerEq(this->src));
 }
 
-TYPED_TEST(SerializeContainerArthmeticTypes, CustomFunctionIncrements) {
+TYPED_TEST(SerializeContainerDynamicSizeArthmeticTypes, CustomFunctionIncrements) {
     SerializationContext ctx{};
+    using TValue = typename TestFixture::TValue;
 
-    auto ser = ctx.createSerializer();
-    ser.container(this->src, 1000, [](auto &s, auto v) {
-        //increment by 1 before writing
-        v++;
-        s.template value<sizeof(v)>(v);
+    auto& ser = ctx.createSerializer();
+    ser.container(this->src, 1000, [&ser](TValue& v) {
+        ser.template value<sizeof(v)>(v);
     });
-    auto des = ctx.createDeserializer();
-    des.container(this->res, 1000, [](auto &s, auto&v ) {
-        s.template value<sizeof(v)>(v);
+    auto& des = ctx.createDeserializer();
+    des.container(this->res, 1000, [&des](TValue &v) {
+        des.template value<sizeof(v)>(v);
         //increment by 1 after reading
         v++;
     });
-    //decrement result by 2, before comparing for eq
-    for(auto& v:this->res)
-        v -= 2;
+    //decrement result by 1, before comparing for eq
+    for (auto &v:this->res)
+        v -= 1;
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(this->getExpectedBufSize(ctx)));
     EXPECT_THAT(this->res, ContainerEq(this->src));
 }
 
 
-
-
-template <typename T>
-class SerializeContainerCompositeTypes:public testing::Test {
+template<typename T>
+class SerializeContainerDynamicSizeCompositeTypes : public testing::Test {
 public:
     using TContainer = T;
     using TValue = typename T::value_type;
 
-    const TContainer src= getFilledContainer<TContainer>();
+    const TContainer src = getFilledContainer<TContainer>();
     TContainer res{};
-    size_t getExpectedBufSize(const SerializationContext& ctx) const {
+
+    size_t getExpectedBufSize(const SerializationContext &ctx) const {
         return ctx.containerSizeSerializedBytesCount(src.size()) + src.size() * TValue::SIZE;
     }
 };
 
 
-using SequenceContainersWithCompositeTypes = ::testing::Types<
+using SerializeContainerDynamicSizeWithCompositeTypes = ::testing::Types<
         std::vector<MyStruct1>,
         std::list<MyStruct2>>;
 
-TYPED_TEST_CASE(SerializeContainerCompositeTypes, SequenceContainersWithCompositeTypes);
+TYPED_TEST_CASE(SerializeContainerDynamicSizeCompositeTypes, SerializeContainerDynamicSizeWithCompositeTypes);
 
-TYPED_TEST(SerializeContainerCompositeTypes, DefaultSerializeFunction) {
+TYPED_TEST(SerializeContainerDynamicSizeCompositeTypes, DefaultSerializeFunction) {
     SerializationContext ctx{};
 
     ctx.createSerializer().container(this->src, 1000);
@@ -155,15 +159,95 @@ TYPED_TEST(SerializeContainerCompositeTypes, DefaultSerializeFunction) {
 }
 
 
-TYPED_TEST(SerializeContainerCompositeTypes, CustomFunctionThatDoNothing) {
+TYPED_TEST(SerializeContainerDynamicSizeCompositeTypes, CustomFunctionThatDoNothing) {
     SerializationContext ctx{};
+    using TValue = typename TestFixture::TValue;
 
-
-    auto emptyFnc = [](auto& s, auto& v) {};
+    auto emptyFnc = [](TValue &v) {};
     ctx.createSerializer().container(this->src, 1000, emptyFnc);
     ctx.createDeserializer().container(this->res, 1000, emptyFnc);
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(ctx.containerSizeSerializedBytesCount(this->src.size())));
 }
 
+template<typename T>
+class SerializeContainerFixedSizeArithmeticTypes : public testing::Test {
+public:
+    using TContainer = T;
+
+    size_t getContainerSize() {
+        T tmp{};
+        return static_cast<size_t>(std::distance(std::begin(tmp), std::end(tmp)));
+    }
+};
+
+using StaticContainersWithIntegralTypes = ::testing::Types<
+        std::array<int16_t, 4>,
+        int16_t[4]>;
+
+TYPED_TEST_CASE(SerializeContainerFixedSizeArithmeticTypes, StaticContainersWithIntegralTypes);
+
+TYPED_TEST(SerializeContainerFixedSizeArithmeticTypes, ArithmeticValues) {
+    using Container = typename TestFixture::TContainer;
+    Container src{5, 9, 15, -459};
+    Container res{};
+
+    SerializationContext ctx;
+    ctx.createSerializer().container<2>(src);
+    ctx.createDeserializer().container<2>(res);
+
+    EXPECT_THAT(ctx.getBufferSize(), Eq(this->getContainerSize() * 2));
+    EXPECT_THAT(res, ContainerEq(src));
+
+}
+
+
+template<typename T>
+class SerializeContainerFixedSizeCompositeTypes : public SerializeContainerFixedSizeArithmeticTypes<T> {
+
+};
+
+using StaticContainersWithCompositeTypes = ::testing::Types<
+        std::array<MyStruct1, 4>, MyStruct1[4]>;
+
+TYPED_TEST_CASE(SerializeContainerFixedSizeCompositeTypes, StaticContainersWithCompositeTypes);
+
+TYPED_TEST(SerializeContainerFixedSizeCompositeTypes, DefaultSerializationFunction) {
+    using Container = typename TestFixture::TContainer;
+    Container src{MyStruct1{0, 1}, MyStruct1{8, 9}, MyStruct1{11, 34}, MyStruct1{5134, 1532}};
+    Container res{};
+
+    SerializationContext ctx;
+    ctx.createSerializer().container(src);
+    ctx.createDeserializer().container(res);
+
+    EXPECT_THAT(ctx.getBufferSize(), Eq(this->getContainerSize() * MyStruct1::SIZE));
+    EXPECT_THAT(res, ContainerEq(src));
+}
+
+TYPED_TEST(SerializeContainerFixedSizeCompositeTypes, CustomFunctionThatSerializesAnEmptyByteEveryElement) {
+    using Container = typename TestFixture::TContainer;
+    Container src{MyStruct1{0, 1}, MyStruct1{2, 3}, MyStruct1{4, 5}, MyStruct1{5134, 1532}};
+    Container res{};
+
+    using TValue = decltype(*std::begin(res));
+
+    SerializationContext ctx;
+    auto& ser = ctx.createSerializer();
+    ser.container(src, [&ser](TValue &v) {
+        char tmp{};
+        ser.object(v);
+        ser.value1b(tmp);
+    });
+    auto& des = ctx.createDeserializer();
+    des.container(res, [&des](TValue &v) {
+        char tmp{};
+        des.object(v);
+        des.value1b(tmp);
+    });
+
+    EXPECT_THAT(ctx.getBufferSize(), Eq(this->getContainerSize() * (MyStruct1::SIZE + sizeof(char))));
+    EXPECT_THAT(res, ContainerEq(src));
+}
+
 

tests/serialization_ext_entropy.cpp

@@ -0,0 +1,200 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <bitsery/ext/entropy.h>
+#include <bitsery/traits/list.h>
+
+using namespace testing;
+
+using bitsery::ext::Entropy;
+
+using BPSer = bitsery::BasicSerializer<bitsery::AdapterWriterBitPackingWrapper<Writer>>;
+using BPDes = bitsery::BasicDeserializer<bitsery::AdapterReaderBitPackingWrapper<Reader>>;
+
+
+TEST(SerializeExtensionEntropy, WhenEntropyEncodedThenOnlyWriteIndexUsingMinRequiredBits) {
+    int32_t v = 4849;
+    int32_t res;
+    constexpr size_t N = 3;
+    int32_t values[3] = {485,4849,89};
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&v, &values](BPSer& ser) {
+        ser.ext4b(v, Entropy<int32_t[3]>{values});
+    });
+    ctx.createDeserializer().enableBitPacking([&res, &values](BPDes& des) {
+        des.ext4b(res, Entropy<int32_t[3]>{values});
+    });
+
+    EXPECT_THAT(res, Eq(v));
+    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
+
+    SerializationContext ctx1;
+    ctx1.createSerializer().enableBitPacking([&v, &values](BPSer& ser) {
+        ser.ext4b(v, Entropy<int32_t[3]>{values});
+    });
+    ctx1.createDeserializer().enableBitPacking([&res](BPDes& des) {
+       des.ext(res, bitsery::ext::ValueRange<int32_t>{0, static_cast<int32_t>(N + 1)});
+    });
+    EXPECT_THAT(res, Eq(2));
+}
+
+TEST(SerializeExtensionEntropy, WhenNoEntropyEncodedThenWriteZeroBitsAndValueOrObject) {
+    int16_t v = 8945;
+    int16_t res;
+    std::initializer_list<int> values{485,4849,89};
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&v, &values](BPSer& ser) {
+        ser.ext2b(v, Entropy<std::initializer_list<int>>{values});
+    });
+    ctx.createDeserializer().enableBitPacking([&res, &values](BPDes& des) {
+        des.ext2b(res, Entropy<std::initializer_list<int>>{values});
+    });
+
+    EXPECT_THAT(res, Eq(v));
+    EXPECT_THAT(ctx.getBufferSize(), Eq(sizeof(int16_t)+1));
+}
+
+TEST(SerializeExtensionEntropy, CustomTypeEntropyEncoded) {
+    MyStruct1 v = {12,10};
+    MyStruct1 res;
+    constexpr size_t N = 4;
+
+    MyStruct1 values[N]{
+                    MyStruct1{12, 10}, MyStruct1{485, 454},
+                    MyStruct1{4849, 89}, MyStruct1{0, 1}};
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&v, &values](BPSer& ser) {
+        ser.ext(v, Entropy<MyStruct1[N]>{values});
+    });
+    ctx.createDeserializer().enableBitPacking([&res, &values](BPDes& des) {
+        des.ext(res, Entropy<MyStruct1[N]>{values});
+    });
+    EXPECT_THAT(res, Eq(v));
+    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
+}
+
+TEST(SerializeExtensionEntropy, CustomTypeNotEntropyEncoded) {
+    MyStruct1 v = {8945,4456};
+    MyStruct1 res;
+
+    std::initializer_list<MyStruct1> values {
+            MyStruct1{12,10}, MyStruct1{485, 454},
+            MyStruct1{4849,89}, MyStruct1{0,1}};
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&v, &values](BPSer& ser) {
+        ser.ext(v, Entropy<std::initializer_list<MyStruct1>>{values});
+    });
+    ctx.createDeserializer().enableBitPacking([&res, &values](BPDes& des) {
+        des.ext(res, Entropy<std::initializer_list<MyStruct1>>{values});
+    });
+
+    EXPECT_THAT(res, Eq(v));
+    EXPECT_THAT(ctx.getBufferSize(), Eq(MyStruct1::SIZE + 1));
+}
+
+TEST(SerializeExtensionEntropy, CustomFunctionNotEntropyEncodedWithNoAlignBeforeData) {
+    MyStruct1 v = {8945,4456};
+    MyStruct1 res;
+    constexpr size_t N = 4;
+
+    std::vector<MyStruct1> values{
+            MyStruct1{12,10}, MyStruct1{485, 454},
+            MyStruct1{4849,89}, MyStruct1{0,1}};
+
+    auto rangeForValue = bitsery::ext::ValueRange<int>{0, 10000};
+
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&v, &values, &rangeForValue](BPSer& ser){
+        //lambdas differ only in capture clauses, it would make sense to use std::bind, but debugger crashes when it sees std::bind...
+        auto serLambda = [&ser, &rangeForValue](MyStruct1& data) {
+            ser.ext(data.i1, rangeForValue);
+            ser.ext(data.i2, rangeForValue);
+        };
+        ser.ext(v, Entropy<std::vector<MyStruct1>>(values, false), serLambda);
+    });
+
+    ctx.createDeserializer().enableBitPacking([&res, &values, &rangeForValue](BPDes& des) {
+        auto desLambda = [&des, &rangeForValue](MyStruct1& data) {
+            des.ext(data.i1, rangeForValue);
+            des.ext(data.i2, rangeForValue);
+        };
+        des.ext(res, Entropy<std::vector<MyStruct1>>(values, false), desLambda);
+    });
+
+    EXPECT_THAT(res, Eq(v));
+    auto rangeForIndex = bitsery::ext::ValueRange<size_t>{0u, N+1};
+    EXPECT_THAT(ctx.getBufferSize(), Eq((rangeForIndex.getRequiredBits() + rangeForValue.getRequiredBits() * 2 - 1) / 8 + 1 ));
+}
+
+TEST(SerializeExtensionEntropy, CustomFunctionNotEntropyEncodedWithAlignBeforeData) {
+    MyStruct1 v = {8945,4456};
+    MyStruct1 res;
+
+    std::vector<MyStruct1> values{
+            MyStruct1{12,10}, MyStruct1{485, 454},
+            MyStruct1{4849,89}, MyStruct1{0,1}};
+
+    auto rangeForValue = bitsery::ext::ValueRange<int>{0, 10000};
+
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&v, &values, &rangeForValue](BPSer& ser){
+        //lambdas differ only in capture clauses, it would make sense to use std::bind, but debugger crashes when it sees std::bind...
+        auto serLambda = [&ser, &rangeForValue](MyStruct1& data) {
+            ser.ext(data.i1, rangeForValue);
+            ser.ext(data.i2, rangeForValue);
+        };
+        ser.ext(v, Entropy<std::vector<MyStruct1>>(values, true), serLambda);
+    });
+    ctx.createDeserializer().enableBitPacking([&res, &values, &rangeForValue](BPDes& des) {
+        auto desLambda = [&des, &rangeForValue](MyStruct1& data) {
+            des.ext(data.i1, rangeForValue);
+            des.ext(data.i2, rangeForValue);
+        };
+        des.ext(res, Entropy<std::vector<MyStruct1>>(values, true), desLambda);
+    });
+
+    EXPECT_THAT(res, Eq(v));
+    auto bitsForIndex = 8; //because aligned
+    EXPECT_THAT(ctx.getBufferSize(), Eq((bitsForIndex + rangeForValue.getRequiredBits() * 2 - 1) / 8 + 1 ));
+}
+
+TEST(SerializeExtensionEntropy, WhenEntropyEncodedThenCustomFunctionNotInvoked) {
+    MyStruct1 v = {4849,89};
+    MyStruct1 res;
+
+    std::list<MyStruct1> values {MyStruct1{12,10}, MyStruct1{485, 454},
+                                 MyStruct1{4849,89}, MyStruct1{0,1}};
+
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&v, &values](BPSer& ser) {
+        ser.ext(v, Entropy<std::list<MyStruct1>>{values}, [](MyStruct1& ) {});
+    });
+    ctx.createDeserializer().enableBitPacking([&res, &values](BPDes& des) {
+        des.ext(res, Entropy<std::list<MyStruct1>>{values}, []( MyStruct1& ) {});
+    });
+
+    EXPECT_THAT(res, Eq(v));
+    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
+}

tests/serialization_ext_growable.cpp

@@ -0,0 +1,421 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <bitsery/ext/growable.h>
+
+using namespace testing;
+
+using bitsery::ext::Growable;
+
+struct DataV1 {
+    int32_t v1;
+};
+
+struct DataV2 {
+    int32_t v1;
+    int32_t v2;
+};
+
+struct DataV3 {
+    int32_t v1;
+    int32_t v2;
+    int32_t v3;
+};
+
+
+TEST(SerializeExtensionGrowable, WriteSessionsDataAtBufferEndAfterFlush) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    ctx.createSerializer().ext(int8_t{}, Growable{}, [] (int8_t& v) { });
+    EXPECT_THAT(ctx.getBufferSize(), Eq(0));
+    ctx.bw->flush();
+    EXPECT_THAT(ctx.getBufferSize(), Gt(0));
+}
+
+
+TEST(SerializeExtensionGrowable, SessionDataConsistOfSessionsEndPosAnd4BytesSessionsDataOffset) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+
+
+    constexpr size_t DATA_SIZE = 4;
+    int32_t data{};
+
+    auto& ser = ctx.createSerializer();
+    ser.ext(data, Growable{}, [&ser](int32_t & v) { ser.value4b(v);});
+    ctx.createDeserializer();//to flush data and create buffer reader
+
+    EXPECT_THAT(ctx.getBufferSize(), Eq(1+4 + DATA_SIZE));
+
+    //read value back
+    auto& br = *(ctx.br);
+    br.readBytes<DATA_SIZE>(data);
+
+    size_t sessionEnd{};
+    //there should start session data with first size of session
+    bitsery::details::readSize(br, sessionEnd, 1000000u);
+    EXPECT_THAT(sessionEnd, Eq(DATA_SIZE));
+    //this is the the offset from the end of buffer where actual data ends
+    uint32_t sessionsOffset{};//bufferEnd - sessionsOffset = dataEnd
+    br.readBytes<4>(sessionsOffset);
+    EXPECT_THAT(sessionsOffset, Eq(1+4));//1byte for session info, 4 bytes for session offset variable
+    auto writtenSize = ctx.bw->writtenBytesCount();
+    auto dSize = writtenSize - sessionsOffset;
+    EXPECT_THAT(dSize, Eq(DATA_SIZE));
+}
+
+TEST(SerializeExtensionGrowable, WhenNestedSessionsThenStoreEachDepthAndSize) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV3 data{19457,846, 498418};
+    ctx.createSerializer();
+    ctx.bw->beginSession();
+        ctx.bw->writeBytes<4>(data.v1);
+        ctx.bw->beginSession();
+            ctx.bw->writeBytes<4>(data.v2);
+        ctx.bw->endSession();
+        ctx.bw->beginSession();
+            ctx.bw->writeBytes<4>(data.v3);
+        ctx.bw->endSession();
+    ctx.bw->endSession();
+    DataV3 res{};
+    ctx.createDeserializer();//to flush data and create buffer reader
+    ctx.br->readBytes<4>(res.v1);
+    ctx.br->readBytes<4>(res.v2);
+    ctx.br->readBytes<4>(res.v3);
+    //read data correctly
+    EXPECT_THAT(res.v1, Eq(data.v1));
+    EXPECT_THAT(res.v2, Eq(data.v2));
+    EXPECT_THAT(res.v3, Eq(data.v3));
+    size_t sessionEnd[3];
+    //read sessions sizes
+    bitsery::details::readSize(*(ctx.br), sessionEnd[0],10000000u);
+    bitsery::details::readSize(*(ctx.br), sessionEnd[1],10000000u);
+    bitsery::details::readSize(*(ctx.br), sessionEnd[2],10000000u);
+    EXPECT_THAT(sessionEnd[0], Eq(12));
+    EXPECT_THAT(sessionEnd[1], Eq(8));
+    EXPECT_THAT(sessionEnd[2], Eq(12));
+}
+
+TEST(SerializeExtensionGrowable, MultipleSessionsReadSameVersionData) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV2 data{8454,987451};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 10; ++i) {
+        bw.beginSession();
+        bw.writeBytes<4>(data.v1);
+        bw.writeBytes<4>(data.v2);
+        bw.endSession();
+    }
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV2 res{};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 10; ++i) {
+        br.beginSession();
+        br.readBytes<4>(res.v1);
+        br.readBytes<4>(res.v2);
+        br.endSession();
+        EXPECT_THAT(res.v1, Eq(data.v1));
+        EXPECT_THAT(res.v2, Eq(data.v2));
+    }
+    EXPECT_THAT(ctx.br->isCompletedSuccessfully(), Eq(true));
+}
+
+TEST(SerializeExtensionGrowable, MultipleSessionsReadNewerVersionData) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV3 data{8454,987451,54};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 10; ++i) {
+        bw.beginSession();
+        bw.writeBytes<4>(data.v1);
+        bw.writeBytes<4>(data.v2);
+        bw.writeBytes<4>(data.v3);
+        bw.endSession();
+    }
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV2 res{};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 10; ++i) {
+        br.beginSession();
+        br.readBytes<4>(res.v1);
+        br.readBytes<4>(res.v2);
+        br.endSession();
+        EXPECT_THAT(res.v1, Eq(data.v1));
+        EXPECT_THAT(res.v2, Eq(data.v2));
+    }
+    EXPECT_THAT(br.isCompletedSuccessfully(), Eq(true));
+}
+
+TEST(SerializeExtensionGrowable, MultipleSessionsReadOlderVersionData) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV2 data{8454,987451};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 10; ++i) {
+        bw.beginSession();
+        bw.writeBytes<4>(data.v1);
+        bw.writeBytes<4>(data.v2);
+        bw.endSession();
+    }
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV3 res{4798,657891,985};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 10; ++i) {
+        br.beginSession();
+        br.readBytes<4>(res.v1);
+        br.readBytes<4>(res.v2);
+        br.readBytes<4>(res.v3);
+        br.endSession();
+        EXPECT_THAT(res.v1, Eq(data.v1));
+        EXPECT_THAT(res.v2, Eq(data.v2));
+        EXPECT_THAT(res.v3, Eq(0));
+    }
+    EXPECT_THAT(ctx.br->isCompletedSuccessfully(), Eq(true));
+}
+
+TEST(SerializeExtensionGrowable, MultipleNestedSessionsReadSameVersionData) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV2 data{8454,987451};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 2; ++i) {
+        bw.beginSession();
+            bw.writeBytes<4>(data.v1);
+            bw.writeBytes<4>(data.v2);
+            bw.beginSession();
+                bw.writeBytes<4>(data.v1);
+                bw.writeBytes<4>(data.v2);
+            bw.endSession();
+        bw.endSession();
+    }
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV2 res{};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 2; ++i) {
+        br.beginSession();
+            br.readBytes<4>(res.v1);
+            br.readBytes<4>(res.v2);
+            EXPECT_THAT(res.v1, Eq(data.v1));
+            EXPECT_THAT(res.v2, Eq(data.v2));
+            br.beginSession();
+                br.readBytes<4>(res.v1);
+                br.readBytes<4>(res.v2);
+                EXPECT_THAT(res.v1, Eq(data.v1));
+                EXPECT_THAT(res.v2, Eq(data.v2));
+            br.endSession();
+        br.endSession();
+    }
+    EXPECT_THAT(ctx.br->isCompletedSuccessfully(), Eq(true));
+}
+
+TEST(SerializeExtensionGrowable, MultipleNestedSessionsReadOlderVersionData) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV2 data{8454,987451};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 5; ++i) {
+        bw.beginSession();
+            bw.writeBytes<4>(data.v1);
+        bw.endSession();
+        bw.writeBytes<4>(data.v2);
+    }
+
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV3 res{};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 5; ++i) {
+        br.beginSession();
+            br.readBytes<4>(res.v1);
+            EXPECT_THAT(res.v1, Eq(data.v1));
+            //new flow
+            br.beginSession();
+                br.readBytes<4>(res.v3);
+                EXPECT_THAT(res.v3, Eq(0));
+                br.beginSession();
+                    br.readBytes<4>(res.v3);
+                    EXPECT_THAT(res.v3, Eq(0));
+                br.endSession();
+            br.endSession();
+            br.beginSession();
+                br.readBytes<4>(res.v3);
+                EXPECT_THAT(res.v3, Eq(0));
+            br.endSession();
+        br.endSession();
+        br.readBytes<4>(res.v2);
+        EXPECT_THAT(res.v2, Eq(data.v2));
+    }
+    EXPECT_THAT(ctx.br->isCompletedSuccessfully(), Eq(true));
+}
+
+TEST(SerializeExtensionGrowable, MultipleNestedSessionsReadNewerVersionData1) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV3 data{8454,987451,54};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 2; ++i) {
+        bw.beginSession();
+        {
+            bw.writeBytes<4>(data.v1);
+            bw.writeBytes<4>(data.v2);
+            //new flow
+            bw.beginSession();
+            {
+                bw.writeBytes<4>(data.v3);
+            }
+            bw.endSession();
+            bw.beginSession();
+            {
+                bw.writeBytes<4>(data.v3);
+                bw.beginSession();
+                {
+                    bw.beginSession();
+                    {
+                        bw.writeBytes<4>(data.v3);
+                        bw.writeBytes<4>(data.v3);
+                    }
+                    bw.endSession();
+                    bw.writeBytes<4>(data.v3);
+                }
+                bw.endSession();
+            }
+            bw.endSession();
+            bw.writeBytes<4>(data.v3);
+        }
+        bw.endSession();
+        bw.writeBytes<4>(data.v2);
+    }
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV2 res{};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 2; ++i) {
+        br.beginSession();
+        {
+            br.readBytes<4>(res.v1);
+            br.readBytes<4>(res.v2);
+            EXPECT_THAT(res.v1, Eq(data.v1));
+            EXPECT_THAT(res.v2, Eq(data.v2));
+        }
+        br.endSession();
+        br.readBytes<4>(res.v2);
+        EXPECT_THAT(res.v2, Eq(data.v2));
+    }
+    EXPECT_THAT(ctx.br->isCompletedSuccessfully(), Eq(true));
+}
+
+TEST(SerializeExtensionGrowable, MultipleNestedSessionsReadNewerVersionData2) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV3 data{8454,987451,54};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 2; ++i) {
+        bw.beginSession();
+            bw.writeBytes<4>(data.v1);
+            bw.writeBytes<4>(data.v2);
+            bw.beginSession();
+                bw.writeBytes<4>(data.v1);
+                bw.writeBytes<4>(data.v2);
+
+                //new flow
+                bw.beginSession();
+                    bw.writeBytes<4>(data.v3);
+                bw.endSession();
+                bw.beginSession();
+                    bw.writeBytes<4>(data.v3);
+                    bw.beginSession();
+                        bw.beginSession();
+                            bw.writeBytes<4>(data.v3);
+                            bw.writeBytes<4>(data.v3);
+                        bw.endSession();
+                        bw.writeBytes<4>(data.v3);
+                    bw.endSession();
+                bw.endSession();
+                bw.writeBytes<4>(data.v3);
+            bw.endSession();
+            bw.writeBytes<4>(data.v2);
+
+            //new flow
+            bw.writeBytes<4>(data.v3);
+            bw.beginSession();
+                bw.writeBytes<4>(data.v3);
+            bw.endSession();
+            bw.writeBytes<4>(data.v3);
+        bw.endSession();
+    }
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV2 res{};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 2; ++i) {
+        br.beginSession();
+            br.readBytes<4>(res.v1);
+            br.readBytes<4>(res.v2);
+            EXPECT_THAT(res.v1, Eq(data.v1));
+            EXPECT_THAT(res.v2, Eq(data.v2));
+            br.beginSession();
+                br.readBytes<4>(res.v1);
+                br.readBytes<4>(res.v2);
+                EXPECT_THAT(res.v1, Eq(data.v1));
+                EXPECT_THAT(res.v2, Eq(data.v2));
+            br.endSession();
+            br.readBytes<4>(res.v2);
+            EXPECT_THAT(res.v2, Eq(data.v2));
+        br.endSession();
+    }
+    EXPECT_THAT(ctx.br->isCompletedSuccessfully(), Eq(true));
+}
+
+TEST(SerializeExtensionGrowable, SessionsStartsAtEndOfSerialization) {
+    BasicSerializationContext<SessionsEnabledConfig> ctx;
+    DataV2 data{8454,987451};
+    ctx.createSerializer();
+    auto& bw = (*ctx.bw);
+    for (auto i = 0; i < 100; ++i)
+        bw.writeBytes<4>(data.v1);
+    for (auto i = 0; i < 10; ++i) {
+        bw.beginSession();
+        bw.writeBytes<4>(data.v1);
+        bw.writeBytes<4>(data.v2);
+        bw.endSession();
+    }
+    //create more sessions that can fit in 2 bytes
+    ctx.createDeserializer();//to flush data and create buffer reader
+    DataV2 res{};
+    auto& br = (*ctx.br);
+    for (auto i = 0; i < 100; ++i)
+        br.readBytes<4>(res.v1);
+    for (auto i = 0; i < 10; ++i) {
+        br.beginSession();
+        br.readBytes<4>(res.v1);
+        br.readBytes<4>(res.v2);
+        br.endSession();
+        EXPECT_THAT(res.v1, Eq(data.v1));
+        EXPECT_THAT(res.v2, Eq(data.v2));
+    }
+    EXPECT_THAT(ctx.br->isCompletedSuccessfully(), Eq(true));
+}

tests/serialization_ext_std_map.cpp

@@ -0,0 +1,139 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+
+#include <bitsery/ext/std_map.h>
+#include <bitsery/ext/entropy.h>
+#include <unordered_map>
+#include <bitsery/traits/string.h>
+
+using StdMap = bitsery::ext::StdMap;
+
+using testing::Eq;
+
+template<typename Container>
+Container createData() {
+    return {};
+}
+
+template<>
+std::unordered_map<std::string, MyStruct1> createData<std::unordered_map<std::string, MyStruct1>>() {
+    return {
+            std::make_pair("some key", MyStruct1{874,456}),
+            std::make_pair("other key", MyStruct1{-34,8645}),
+            std::make_pair("secret key", MyStruct1{-4878,3468975})
+    };
+}
+
+template<>
+std::unordered_multimap<int32_t, float> createData<std::unordered_multimap<int32_t, float>>() {
+    return {
+            std::pair<int32_t , float>(545, 45.485f),
+            std::pair<int32_t , float>(6748, -7891.5f),
+            std::pair<int32_t , float>(845, -457.0f)
+    };
+}
+
+template<>
+std::map<MyEnumClass, MyStruct1> createData<std::map<MyEnumClass, MyStruct1>>() {
+    return {
+            std::make_pair(MyEnumClass::E3, MyStruct1{874,456}),
+            std::make_pair(MyEnumClass::E6, MyStruct1{-34,8645}),
+            std::make_pair(MyEnumClass::E2, MyStruct1{-4878,3468975})
+    };
+}
+
+template<>
+std::multimap<int32_t ,int64_t> createData<std::multimap<int32_t ,int64_t>>() {
+    return {//these are optimized with range and entropy
+            std::pair<int32_t, int64_t>(-45, -984196845ll),
+            std::pair<int32_t, int64_t>(54, 1ll),
+            std::pair<int32_t, int64_t>(98, 3ll)
+    };
+}
+
+template<typename T>
+class SerializeExtensionStdMap : public testing::Test {
+public:
+    using TContainer = T;
+
+    const TContainer src = createData<TContainer>();
+    TContainer res{};
+};
+
+using SerializeExtensionStdMapTypes = ::testing::Types<
+        std::unordered_map<std::string, MyStruct1>,
+        std::unordered_multimap<int32_t, float>,
+        std::map<MyEnumClass , MyStruct1>,
+        std::multimap<int32_t ,int64_t>
+>;
+
+TYPED_TEST_CASE(SerializeExtensionStdMap, SerializeExtensionStdMapTypes);
+
+namespace bitsery {
+
+    template <typename S>
+    void serialize(S& s, std::unordered_map<std::string, MyStruct1>& o) {
+        s.ext(o, StdMap{10}, [&s](std::string& key, MyStruct1& value) {
+            s.text1b(key, 100);
+            s.object(value);
+        });
+    }
+
+    template <typename S>
+    void serialize(S& s, std::unordered_multimap<int32_t, float>& o) {
+        s.ext(o, StdMap{10}, [&s](int32_t& key, float& value) {
+            s.value4b(key);
+            s.value4b(value);
+        });
+    }
+
+    template <typename S>
+    void serialize(S& s, std::map<MyEnumClass , MyStruct1>& o) {
+        s.ext(o, StdMap{10}, [&s](MyEnumClass& key, MyStruct1& value) {
+            s.value4b(key);
+            s.object(value);
+        });
+    }
+
+    template <typename S>
+    void serialize(S& s, std::multimap<int32_t ,int64_t>& o) {
+        s.ext(o, StdMap{10}, [&s](int32_t& key, int64_t& value) {
+            s.enableBitPacking([&key, &value](typename S::BPEnabledType& sbp) {
+                int64_t values[3]{1ll, 2ll, 3ll};
+                sbp.ext(key, bitsery::ext::ValueRange<int32_t>{-100,100});
+                sbp.ext8b(value, bitsery::ext::Entropy<int64_t[3]>{values});
+            });
+        });
+    }
+
+
+}
+
+TYPED_TEST(SerializeExtensionStdMap, SerializeAndDeserializeEquals) {
+    SerializationContext ctx1;
+    ctx1.createSerializer().object(this->src);
+    ctx1.createDeserializer().object(this->res);
+    EXPECT_THAT(this->res, Eq(this->src));
+}

tests/serialization_ext_std_optional.cpp

@@ -0,0 +1,128 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+
+
+#if __cplusplus > 201402L
+
+#include <optional>
+#include <bitsery/ext/std_optional.h>
+#include <bitsery/ext/value_range.h>
+
+
+using StdOptional = bitsery::ext::StdOptional;
+
+using testing::Eq;
+
+using BPSer = bitsery::BasicSerializer<Writer, true>;
+using BPDes = bitsery::BasicDeserializer<Reader, true>;
+
+template <typename T>
+void test(SerializationContext& ctx, const T& v, T& r) {
+    ctx.createSerializer().ext4b(v, StdOptional{});
+    ctx.createDeserializer().ext4b(r, StdOptional{});
+}
+
+TEST(SerializeExtensionStdOptional, EmptyOptional) {
+    std::optional<int32_t> t1{};
+    std::optional<int32_t> r1{};
+
+    SerializationContext ctx1;
+    test(ctx1,t1, r1);
+    EXPECT_THAT(ctx1.getBufferSize(), Eq(1));
+    EXPECT_THAT(t1, Eq(r1));
+
+
+    r1 = 3;
+    SerializationContext ctx2;
+    test(ctx2,t1, r1);
+    EXPECT_THAT(ctx2.getBufferSize(), Eq(1));
+    EXPECT_THAT(t1, Eq(r1));
+}
+
+TEST(SerializeExtensionStdOptional, OptionalHasValue) {
+    std::optional<int32_t> t1{43};
+    std::optional<int32_t> r1{52};
+
+    SerializationContext ctx1;
+    test(ctx1,t1, r1);
+    EXPECT_THAT(ctx1.getBufferSize(), Eq(1 + sizeof(int)));
+    EXPECT_THAT(t1.value(), Eq(r1.value()));
+
+    r1 = std::optional<int>{};
+    SerializationContext ctx2;
+    test(ctx2,t1, r1);
+    EXPECT_THAT(ctx2.getBufferSize(), Eq(1 + sizeof(int)));
+    EXPECT_THAT(t1.value(), Eq(r1.value()));
+
+}
+
+TEST(SerializeExtensionStdOptional, AlignAfterStateWriteRead) {
+    std::optional<int32_t> t1{43};
+    std::optional<int32_t> r1{52};
+    auto range = bitsery::ext::ValueRange<int>{40,60};
+
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&t1, &range](BPSer& ser) {
+
+        ser.ext(t1, StdOptional(true), [&ser, &range](int32_t& v) {
+            ser.ext(v, range);
+        });
+    });
+    ctx.createDeserializer().enableBitPacking([&r1, &range](BPDes& des) {
+        des.ext(r1, StdOptional(true), [&des, &range](int32_t& v) {
+            des.ext(v, range);
+        });
+    });
+
+    EXPECT_THAT(ctx.getBufferSize(), Eq(2));//1byte for index + 1byte for value
+    EXPECT_THAT(t1.value(), Eq(r1.value()));
+}
+
+TEST(SerializeExtensionStdOptional, NoAlignAfterStateWriteRead) {
+    std::optional<int32_t> t1{43};
+    std::optional<int32_t> r1{52};
+    auto range = bitsery::ext::ValueRange<int>{40,60};
+
+    SerializationContext ctx;
+    ctx.createSerializer().enableBitPacking([&t1, &range](BPSer& ser) {
+        ser.ext(t1, StdOptional(false), [&ser, &range](int32_t& v) {
+            ser.ext(v, range);
+        });
+    });
+    ctx.createDeserializer().enableBitPacking([&r1, &range](BPDes& des) {
+        des.ext(r1, StdOptional(false), [&des, &range](int32_t& v) {
+            des.ext(v, range);
+        });
+    });
+
+
+    EXPECT_THAT(range.getRequiredBits() + 1, ::testing::Lt(8));
+    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
+    EXPECT_THAT(t1.value(), Eq(r1.value()));
+}
+
+
+
+#endif

tests/serialization_ext_std_queue.cpp

@@ -0,0 +1,99 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+#include <bitsery/ext/std_queue.h>
+
+using StdQueue = bitsery::ext::StdQueue;
+
+using testing::Eq;
+
+//inherit from queue so we could take underlying container, because priority queue doesn't have equal operator defined
+template <typename T, typename C>
+struct PriorityQueueCnt : public std::priority_queue<T, C>
+{
+    static const C& getContainer(const std::priority_queue<T, C>& s )
+    {
+        //get address of underlying container
+        return s.*(&PriorityQueueCnt::c);
+    }
+    static C& getContainer(std::priority_queue<T, C>& s )
+    {
+        //get address of underlying container
+        return s.*(&PriorityQueueCnt::c);
+    }
+};
+
+template <typename T>
+void test(SerializationContext& ctx, const T& v, T& r) {
+    ctx.createSerializer().ext4b(v, StdQueue{10});
+    ctx.createDeserializer().ext4b(r, StdQueue{10});
+}
+
+TEST(SerializeExtensionStdQueue, QueueDefaultContainer) {
+    std::queue<int32_t> t1{};
+    t1.push(3);
+    t1.push(-4854);
+    std::queue<int32_t> r1{};
+
+    SerializationContext ctx1;
+    test(ctx1,t1, r1);
+    EXPECT_THAT(t1, Eq(r1));
+}
+
+TEST(SerializeExtensionStdQueue, QueueVectorContainer) {
+    std::queue<int32_t, std::vector<int32_t>> t1{};
+    t1.push(3);
+    t1.push(-4854);
+    std::queue<int32_t, std::vector<int32_t>> r1{};
+
+    SerializationContext ctx1;
+    test(ctx1,t1, r1);
+    EXPECT_THAT(t1, Eq(r1));
+}
+
+TEST(SerializeExtensionStdQueue, PriorityQueueDefaultContainer) {
+    std::priority_queue<int32_t> t1{};
+    t1.push(3);
+    t1.push(-4854);
+    std::priority_queue<int32_t> r1{};
+
+    SerializationContext ctx1;
+    test(ctx1,t1, r1);
+    auto & ct1 = PriorityQueueCnt<int32_t, std::vector<int32_t>>::getContainer(t1);
+    auto & cr1 = PriorityQueueCnt<int32_t, std::vector<int32_t>>::getContainer(r1);
+    EXPECT_THAT(ct1, Eq(cr1));
+}
+
+TEST(SerializeExtensionStdQueue, PriorityQueueDequeContainer) {
+    std::priority_queue<int32_t, std::deque<int32_t>> t1{};
+    t1.push(678);
+    t1.push(-44);
+    std::priority_queue<int32_t, std::deque<int32_t>> r1{};
+
+    SerializationContext ctx1;
+    test(ctx1,t1, r1);
+    auto & ct1 = PriorityQueueCnt<int32_t, std::deque<int32_t>>::getContainer(t1);
+    auto & cr1 = PriorityQueueCnt<int32_t, std::deque<int32_t>>::getContainer(r1);
+    EXPECT_THAT(ct1, Eq(cr1));
+}

tests/serialization_ext_std_set.cpp

@@ -0,0 +1,78 @@
+//MIT License
+//
+//Copyright (c) 2017 Mindaugas Vinkelis
+//
+//Permission is hereby granted, free of charge, to any person obtaining a copy
+//of this software and associated documentation files (the "Software"), to deal
+//in the Software without restriction, including without limitation the rights
+//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+//copies of the Software, and to permit persons to whom the Software is
+//furnished to do so, subject to the following conditions:
+//
+//The above copyright notice and this permission notice shall be included in all
+//copies or substantial portions of the Software.
+//
+//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+//SOFTWARE.
+
+#include <gmock/gmock.h>
+#include "serialization_test_utils.h"
+
+#include <bitsery/ext/std_set.h>
+#include <set>
+
+using StdSet = bitsery::ext::StdSet;
+
+using testing::Eq;
+
+template<typename T>
+class SerializeExtensionStdSet : public testing::Test {
+public:
+    using TContainer = T;
+    const TContainer src = {4, 8, 48, 4, 9845, 64, 8};
+    TContainer res{};
+};
+
+using SerializeExtensionStdSetTypes = ::testing::Types<
+        std::unordered_set<int32_t>,
+        std::unordered_multiset<int32_t>,
+        std::set<int32_t>,
+        std::multiset<int32_t>>;
+
+TYPED_TEST_CASE(SerializeExtensionStdSet, SerializeExtensionStdSetTypes);
+
+TYPED_TEST(SerializeExtensionStdSet, ValuesSyntaxDifferentSetTypes) {
+    SerializationContext ctx1;
+    ctx1.createSerializer().ext4b(this->src, StdSet{10});
+    ctx1.createDeserializer().ext4b(this->res, StdSet{10});
+    EXPECT_THAT(this->res, Eq(this->src));
+}
+
+TEST(SerializeExtensionStdSet, ObjectSyntax) {
+    SerializationContext ctx1;
+    std::set<MyStruct1> t1{MyStruct1{874 ,456}, MyStruct1{-874, -456}, MyStruct1{4894,0}};
+    std::set<MyStruct1> r1{};
+    ctx1.createSerializer().ext(t1, StdSet{10});
+    ctx1.createDeserializer().ext(r1, StdSet{10});
+    EXPECT_THAT(r1, Eq(t1));
+}
+
+TEST(SerializeExtensionStdSet, FunctionSyntax) {
+    SerializationContext ctx1;
+    std::unordered_multiset<int32_t> t1{54,-484,841,79};
+    std::unordered_multiset<int32_t> r1{};
+    auto& ser = ctx1.createSerializer();
+    ser.ext(t1, StdSet{10}, [&ser](int32_t& v) {
+        ser.value4b(v);
+    });
+    auto& des = ctx1.createDeserializer();
+    des.ext(r1, StdSet{10}, [&des](int32_t& v) {
+        des.value4b(v);
+    });
+    EXPECT_THAT(r1, Eq(t1));
+}

tests/serialization_ext_std_stack.cpp

@@ -22,65 +22,37 @@
 
 #include <gmock/gmock.h>
 #include "serialization_test_utils.h"
+#include <bitsery/ext/std_stack.h>
 
-#if __cplusplus > 201402L
-#  include<optional>
-#else
-#  include <experimental/optional>
-    namespace std {
-        template <typename T>
-        using optional = experimental::optional<T>;
-    }
-#endif
-
-#include <bitsery/ext/optional.h>
-
-
-template <typename T>
-using extoptional = bitsery::ext::optional<T>;
+using StdStack = bitsery::ext::StdStack;
 
 using testing::Eq;
 
 
 template <typename T>
 void test(SerializationContext& ctx, const T& v, T& r) {
-    auto fnc = [](auto ser, auto& v) {
-        ser.template value<sizeof(v)>(v);
-    };
-    ctx.createSerializer().ext<extoptional>(v, fnc);
-    ctx.createDeserializer().ext<extoptional>(r, fnc);
+    ctx.createSerializer().ext4b(v, StdStack{10});
+    ctx.createDeserializer().ext4b(r, StdStack{10});
 }
 
-TEST(SerializeExtensionOptional, EmptyOptional) {
-    std::optional<int> t1{};
-    std::optional<int> r1{};
+TEST(SerializeExtensionStdStack, DefaultContainer) {
+    std::stack<int32_t> t1{};
+    t1.push(3);
+    t1.push(-4854);
+    std::stack<int32_t> r1{};
 
     SerializationContext ctx1;
     test(ctx1,t1, r1);
-    EXPECT_THAT(ctx1.getBufferSize(), Eq(1));
-    EXPECT_THAT(t1, Eq(r1));
-
-
-    r1 = 3;
-    SerializationContext ctx2;
-    test(ctx2,t1, r1);
-    EXPECT_THAT(ctx2.getBufferSize(), Eq(1));
     EXPECT_THAT(t1, Eq(r1));
 }
 
-TEST(SerializeExtensionOptional, OptionalHasValue) {
-    std::optional<int> t1{43};
-    std::optional<int> r1{52};
+TEST(SerializeExtensionStdStack, VectorContainer) {
+    std::stack<int32_t, std::vector<int32_t>> t1{};
+    t1.push(3);
+    t1.push(-4854);
+    std::stack<int32_t, std::vector<int32_t>> r1{};
 
     SerializationContext ctx1;
     test(ctx1,t1, r1);
-    EXPECT_THAT(ctx1.getBufferSize(), Eq(1 + sizeof(int)));
-    EXPECT_THAT(t1.value(), Eq(r1.value()));
-
-    r1 = std::optional<int>{};
-    SerializationContext ctx2;
-    test(ctx2,t1, r1);
-    EXPECT_THAT(ctx2.getBufferSize(), Eq(1 + sizeof(int)));
-    EXPECT_THAT(t1.value(), Eq(r1.value()));
-
+    EXPECT_THAT(t1, Eq(r1));
 }

tests/serialization_ext_value_range.cpp

@@ -23,11 +23,15 @@
 
 #include <gmock/gmock.h>
 #include "serialization_test_utils.h"
+#include <bitsery/ext/value_range.h>
 using namespace testing;
-using bitsery::RangeSpec;
-using bitsery::BitsConstraint;
+using bitsery::details::RangeSpec;
+using bitsery::ext::BitsConstraint;
+using bitsery::ext::ValueRange;
 
-TEST(SerializeRange, RequiredBitsIsConstexpr) {
+#if __cplusplus > 201402L
+
+TEST(SerializeExtensionValueRange, RequiredBitsIsConstexpr) {
     constexpr RangeSpec<int> r1{0, 31};
     static_assert(r1.bitsRequired == 5, "r1.bitsRequired == 5");
 
@@ -43,112 +47,162 @@ TEST(SerializeRange, RequiredBitsIsConstexpr) {
 
 }
 
-TEST(SerializeRange, IntegerNegative) {
+#endif
+
+using BPSer = bitsery::BasicSerializer<bitsery::AdapterWriterBitPackingWrapper<Writer>>;
+using BPDes = bitsery::BasicDeserializer<bitsery::AdapterReaderBitPackingWrapper<Reader>>;
+
+
+TEST(SerializeExtensionValueRange, IntegerNegative) {
     SerializationContext ctx;
-    constexpr RangeSpec<int> r1{-50, 50};
+    ValueRange<int> r1{-50, 50};
     int t1{-8};
     int res1;
-
-    ctx.createSerializer().range(t1, r1);
-    ctx.createDeserializer().range(res1, r1);
+    ctx.createSerializer().enableBitPacking([&t1, &r1](BPSer& ser) {
+        ser.ext(t1, r1);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(1));
     EXPECT_THAT(res1, Eq(t1));
 
 }
 
-TEST(SerializeRange, IntegerPositive) {
+TEST(SerializeExtensionValueRange, IntegerPositive) {
     SerializationContext ctx;
-    constexpr RangeSpec<unsigned> r1{4, 10};
+    ValueRange<unsigned> r1{4u, 10u};
     unsigned t1{8};
     unsigned res1;
 
-    ctx.createSerializer().range(t1, r1);
-    ctx.createDeserializer().range(res1, r1);
+    ctx.createSerializer().enableBitPacking([&t1, &r1](BPSer& ser) {
+        ser.ext(t1, r1);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(1));
     EXPECT_THAT(res1, Eq(t1));
 
 }
 
-TEST(SerializeRange, EnumTypes) {
+TEST(SerializeExtensionValueRange, EnumTypes) {
     SerializationContext ctx;
-    constexpr RangeSpec<MyEnumClass> r1{MyEnumClass::E2, MyEnumClass::E4};
+    ValueRange<MyEnumClass> r1{MyEnumClass::E2, MyEnumClass::E4};
     MyEnumClass t1{MyEnumClass::E2};
     MyEnumClass res1;
 
-    ctx.createSerializer().range(t1, r1);
-    ctx.createDeserializer().range(res1, r1);
+    ctx.createSerializer().enableBitPacking([&t1, &r1](BPSer& ser) {
+        ser.ext(t1, r1);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(1));
     EXPECT_THAT(res1, Eq(t1));
 
 }
 
-TEST(SerializeRange, FloatUsingPrecisionConstraint1) {
+TEST(SerializeExtensionValueRange, FloatUsingPrecisionConstraint1) {
     SerializationContext ctx;
     constexpr float precision{0.01f};
     constexpr float min{-1.0f};
     constexpr float max{1.0f};
     float t1{0.5f};
-    constexpr RangeSpec<float> r1{min, max, precision};
+    ValueRange<float> r1{min, max, precision};
 
     float res1;
 
-    ctx.createSerializer().range(t1, r1);
-    ctx.createDeserializer().range(res1, r1);
+    ctx.createSerializer().enableBitPacking([&t1, &r1](BPSer& ser) {
+        ser.ext(t1, r1);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(1));
     EXPECT_THAT(res1, ::testing::FloatNear(t1, (max - min) * precision));
 }
 
-TEST(SerializeRange, DoubleUsingPrecisionConstraint2) {
+TEST(SerializeExtensionValueRange, DoubleUsingPrecisionConstraint2) {
     SerializationContext ctx;
     constexpr double precision{0.000002};
     constexpr double min{50.0};
     constexpr double max{100000.0};
     double t1{38741.0};
-    constexpr RangeSpec<double> r1{min, max, precision};
+    ValueRange<double> r1{min, max, precision};
 
     double res1;
 
-    ctx.createSerializer().range(t1, r1);
-    ctx.createDeserializer().range(res1, r1);
+    ctx.createSerializer().enableBitPacking([&t1, &r1](BPSer& ser) {
+        ser.ext(t1, r1);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(5));
     EXPECT_THAT(res1, ::testing::DoubleNear(t1, (max - min) * precision));
 }
 
-TEST(SerializeRange, FloatUsingBitsSizeConstraint1) {
+TEST(SerializeExtensionValueRange, FloatUsingBitsSizeConstraint1) {
     SerializationContext ctx;
     constexpr size_t bits = 8;
     constexpr float min{-1.0f};
     constexpr float max{1.0f};
     float t1{0.5f};
-    constexpr RangeSpec<float> r1{min, max, BitsConstraint(bits)};
+    ValueRange<float> r1{min, max, BitsConstraint(bits)};
 
     float res1;
 
-    ctx.createSerializer().range(t1, r1);
-    ctx.createDeserializer().range(res1, r1);
+    ctx.createSerializer().enableBitPacking([&t1, &r1](BPSer& ser) {
+        ser.ext(t1, r1);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(1));
-    EXPECT_THAT(res1, ::testing::FloatNear(t1, (max - min) / (static_cast<bitsery::details::SAME_SIZE_UNSIGNED<float>>(1) << bits)));
+    EXPECT_THAT(res1, ::testing::FloatNear(t1, (max - min) / (static_cast<bitsery::details::SameSizeUnsigned<float>>(1) << bits)));
 }
 
-TEST(SerializeRange, DoubleUsingBitsSizeConstraint2) {
+TEST(SerializeExtensionValueRange, DoubleUsingBitsSizeConstraint2) {
     SerializationContext ctx;
     constexpr size_t bits = 50;
     constexpr double min{50.0};
     constexpr double max{100000.0};
     double t1{38741};
-    constexpr RangeSpec<double> r1{min, max, BitsConstraint(bits)};
+    ValueRange<double> r1{min, max, BitsConstraint(bits)};
 
     double res1;
 
-    ctx.createSerializer().range(t1, r1);
-    ctx.createDeserializer().range(res1, r1);
+    ctx.createSerializer().enableBitPacking([&t1, &r1](BPSer& ser) {
+        ser.ext(t1, r1);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
 
     EXPECT_THAT(ctx.getBufferSize(), Eq(7));
-    EXPECT_THAT(res1, ::testing::DoubleNear(t1, (max - min) / (static_cast<bitsery::details::SAME_SIZE_UNSIGNED<double>>(1) << bits)));
+    EXPECT_THAT(res1, ::testing::DoubleNear(t1, (max - min) / (static_cast<bitsery::details::SameSizeUnsigned<double>>(1) << bits)));
+}
+
+TEST(SerializeExtensionValueRange, WhenDataIsInvalidThenReturnMinimumRangeValue) {
+    SerializationContext ctx;
+    ValueRange<int> r1{4, 10};//6 is max, but 3bits required
+    int res1;
+    uint8_t tmp{0xFF};//write all 1 so when reading 3 bits we get 7
+
+    ctx.createSerializer().enableBitPacking([&tmp](BPSer& ser) {
+        ser.value1b(tmp);
+    });
+    ctx.createDeserializer().enableBitPacking([&res1, &r1](BPDes& des) {
+        des.ext(res1, r1);
+    });
+
+    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
+    EXPECT_THAT(res1, Eq(4));
 }

tests/serialization_fixed_size_array.cpp

@@ -1,131 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-#include <gmock/gmock.h>
-#include "serialization_test_utils.h"
-#include <type_traits>
-
-using testing::ContainerEq;
-using testing::Eq;
-
-TEST(SerializeFSArrayStdArray, ArithmeticValues) {
-    SerializationContext ctx;
-    std::array<int, 4> src{5,9,15,-459};
-    std::array<int, 4> res{};
-
-    ctx.createSerializer().array<sizeof(int)>(src);
-    ctx.createDeserializer().array<sizeof(int)>(res);
-
-    EXPECT_THAT(ctx.getBufferSize(), Eq(src.size() * sizeof(int)));
-    EXPECT_THAT(res, ContainerEq(src));
-
-}
-
-TEST(SerializeFSArrayStdArray, CompositeTypes) {
-    SerializationContext ctx;
-    std::array<MyStruct1, 7> src{
-            MyStruct1{0,1}, MyStruct1{2,3}, MyStruct1{4,5}, MyStruct1{6,7},
-            MyStruct1{8,9}, MyStruct1{11,34}, MyStruct1{5134,1532}};
-    std::array<MyStruct1, 7> res{};
-
-    ctx.createSerializer().array(src);
-    ctx.createDeserializer().array(res);
-
-    EXPECT_THAT(ctx.getBufferSize(), Eq(src.size() * MyStruct1::SIZE));
-    EXPECT_THAT(res, ContainerEq(src));
-}
-//
-//
-TEST(SerializeFSArrayStdArray, CustomFunctionThatSerializesAnEmptyByteEveryElement) {
-    SerializationContext ctx;
-    std::array<MyStruct1, 7> src{
-            MyStruct1{0,1}, MyStruct1{2,3}, MyStruct1{4,5}, MyStruct1{6,7},
-            MyStruct1{8,9}, MyStruct1{11,34}, MyStruct1{5134,1532}};
-    std::array<MyStruct1, 7> res{};
-
-
-    auto ser = ctx.createSerializer();
-    ser.array(src, [](auto &s, auto& v) {
-        char tmp{};
-        s.object(v).value1(tmp);
-    });
-    auto des = ctx.createDeserializer();
-    des.array(res, [](auto &s, auto& v) {
-        char tmp{};
-        s.object(v).value1(tmp);
-    });
-
-    EXPECT_THAT(ctx.getBufferSize(), Eq(src.size() * (MyStruct1::SIZE + sizeof(char))));
-    EXPECT_THAT(res, ContainerEq(src));
-}
-
-TEST(SerializeFSArrayCArray, ArithmeticValuesSettingValueSizeExplicitly) {
-    SerializationContext ctx;
-    int src[4]{5,9,15,-459};
-    int res[4]{};
-
-    ctx.createSerializer().array<sizeof(int)>(src);
-    ctx.createDeserializer().array<sizeof(int)>(res);
-
-    EXPECT_THAT(ctx.getBufferSize(), Eq(std::extent<decltype(src)>::value * sizeof(int)));
-    EXPECT_THAT(res, ContainerEq(src));
-
-}
-
-TEST(SerializeFSArrayCArray, CompositeTypes) {
-    SerializationContext ctx;
-    MyStruct1 src[]{
-            MyStruct1{0,1}, MyStruct1{2,3}, MyStruct1{4,5}, MyStruct1{6,7},
-            MyStruct1{8,9}, MyStruct1{11,34}, MyStruct1{5134,1532}};
-    MyStruct1 res[7]{};
-
-    ctx.createSerializer().array(src);
-    ctx.createDeserializer().array(res);
-
-    EXPECT_THAT(ctx.getBufferSize(), Eq(std::extent<decltype(src)>::value * MyStruct1::SIZE));
-    EXPECT_THAT(res, ContainerEq(src));
-}
-//
-//
-TEST(SerializeFSArrayCArray, CustomFunctionThatSerializesAnEmptyByteEveryElement) {
-    SerializationContext ctx;
-    MyStruct1 src[]{
-            MyStruct1{0,1}, MyStruct1{2,3}, MyStruct1{4,5}, MyStruct1{6,7},
-            MyStruct1{8,9}, MyStruct1{11,34}, MyStruct1{5134,1532}};
-    MyStruct1 res[7]{};
-
-
-    auto ser = ctx.createSerializer();
-    ser.array(src, [](auto& s, auto& v) {
-        char tmp{};
-        s.object(v).value1(tmp);
-    });
-    auto des = ctx.createDeserializer();
-    des.array(res, [](auto& s, auto& v) {
-        char tmp{};
-        s.object(v).value1(tmp);
-    });
-
-    EXPECT_THAT(ctx.getBufferSize(), Eq(std::extent<decltype(src)>::value * (MyStruct1::SIZE + sizeof(char))));
-    EXPECT_THAT(res, ContainerEq(src));
-}

tests/serialization_objects.cpp

@@ -23,13 +23,8 @@
 
 #include <gmock/gmock.h>
 #include "serialization_test_utils.h"
-
-#include <bitsery/delta_serializer.h>
-#include <bitsery/delta_deserializer.h>
-
-#include <list>
-
-
+#include <bitsery/traits/string.h>
+#include <bitsery/traits/array.h>
 
 using testing::Eq;
 using testing::StrEq;
@@ -56,28 +51,29 @@ struct Y {
 struct Z { X x{}; Y y{}; };
 
 
-SERIALIZE(Z)
+template <typename S>
+void serialize(S& s, Z& o)
 {
 	s.object(o.x);
 	s.object(o.y);
-	return s;
 }
 
-SERIALIZE(X)
+template <typename S>
+void serialize(S& s, X& o)
 {
-	return s.template value<sizeof(o.x)>(o.x)
-		.template text<1>(o.s, 1000);
+	s.template value<sizeof(o.x)>(o.x);
+	s.template text<1>(o.s, 1000);
 }
 
-SERIALIZE(Y)
+template <typename S>
+void serialize(S& s, Y& o)
 {
-	auto writeInt = [](auto& s, auto& v) { s.template value<sizeof(v)>(v); };
+	auto writeInt = [&s]( int& v) { s.template value<sizeof(v)>(v); };
 	s.template text<1>(o.s, 10000);
 	s.template value<sizeof(o.y)>(o.y);
-	s.array(o.arr, writeInt);
-	s.array(o.carr, writeInt);
-	s.container(o.vx, 10000, [](auto& s, auto& v) { s.object(v); });
-	return s;
+	s.container(o.arr, writeInt);
+	s.container(o.carr, writeInt);
+	s.container(o.vx, 10000, [&s](X& v) { s.object(v); });
 }
 
 
@@ -102,7 +98,7 @@ TEST(SerializeObject, GeneralConceptTest) {
 	z.x = X{ 234 };
 	
 
-	auto ser = ctx.createSerializer();
+	auto& ser = ctx.createSerializer();
 	ser.object(y);
 	ser.object(z);
 
@@ -110,7 +106,7 @@ TEST(SerializeObject, GeneralConceptTest) {
 	Y yres{};
 	Z zres{};
 
-	auto des = ctx.createDeserializer();
+	auto& des = ctx.createDeserializer();
 	des.object(yres);
 	des.object(zres);
 
@@ -128,49 +124,4 @@ TEST(SerializeObject, GeneralConceptTest) {
 	EXPECT_THAT(zres.x.s, StrEq(z.x.s));
 	EXPECT_THAT(zres.x.x, Eq(z.x.x));
 
-}
-
-TEST(DeltaSerializer, GeneralConceptTest) {
-	//std::string buf;
-	Y y{};
-	y.y = 3423;
-	y.arr[0] = 111;
-	y.arr[1] = 222;
-	y.arr[2] = 333;
-	y.carr[0] = 123;
-	y.carr[1] = 456;
-	y.carr[2] = 789;
-	y.vx.push_back(X(234));
-	y.vx.push_back(X(6245));
-	y.vx.push_back(X(613461));
-	y.s = "labal diena";
-	y.vx[0].s = "very nice";
-	y.vx[1].s = "very nice string, that is a little bit longer that previous";
-
-	Y yRead = y;
-	Y yNew = y;	
-	yNew.y = 111111;
-	yNew.arr[2] = 0xFFFFFFFF;
-	yNew.carr[1] = 0xFFFFFFFF;
-	yNew.s = "labas dienaABC";
-	yNew.vx[0].s = "very opapa";
-	yNew.vx[1].s = "bla";
-	yNew.vx.push_back(X{ 3 });
-
-	std::vector<bitsery::DefaultConfig::BufferValueType> buf;
-	bitsery::BufferWriter bw{ buf };
-	bitsery::DeltaSerializer<bitsery::BufferWriter, Y> ser(bw, y, yNew);
-	serialize(ser, yNew);
-	bw.flush();
-
-	bitsery::BufferReader br{ buf };
-	bitsery::DeltaDeserializer<bitsery::BufferReader, Y> des(br, y, yRead);
-	serialize(des, yRead);
-
-	EXPECT_THAT(yRead.y, Eq(yNew.y));
-	EXPECT_THAT(yRead.vx, ContainerEq(yNew.vx));
-	EXPECT_THAT(yRead.arr, ContainerEq(yNew.arr));
-	EXPECT_THAT(yRead.carr, ContainerEq(yNew.carr));
-	EXPECT_THAT(yRead.s, StrEq(yNew.s));
-}
-
+}

tests/serialization_size.cpp

@@ -28,9 +28,9 @@ using testing::Eq;
 
 bool SerializeDeserializeContainerSize(SerializationContext& ctx, const size_t size) {
     std::vector<char> t1(size);
-    ctx.createSerializer().container(t1, size+1, [](auto , auto ){});
+    ctx.createSerializer().container(t1, size+1, []( char& ){});
     t1.clear();
-    ctx.createDeserializer().container(t1, size+1, [](auto , auto ){});
+    ctx.createDeserializer().container(t1, size+1, []( char& ){});
     return t1.size() == size;
 }
 

tests/serialization_substitution.cpp

@@ -1,135 +0,0 @@
-//MIT License
-//
-//Copyright (c) 2017 Mindaugas Vinkelis
-//
-//Permission is hereby granted, free of charge, to any person obtaining a copy
-//of this software and associated documentation files (the "Software"), to deal
-//in the Software without restriction, including without limitation the rights
-//to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-//copies of the Software, and to permit persons to whom the Software is
-//furnished to do so, subject to the following conditions:
-//
-//The above copyright notice and this permission notice shall be included in all
-//copies or substantial portions of the Software.
-//
-//THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-//IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-//FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-//AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-//LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-//OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-//SOFTWARE.
-
-
-#include <gmock/gmock.h>
-#include "serialization_test_utils.h"
-using namespace testing;
-
-TEST(SerializeSubstitution, WhenSubstitutedThenOnlyWriteIndexUsingMinRequiredBits) {
-    int32_t v = 4849;
-    int32_t res;
-    constexpr size_t N = 3;
-    std::array<int32_t,N> subsitution{485,4849,89};
-    SerializationContext ctx;
-    ctx.createSerializer().substitution<4>(v, subsitution);
-    ctx.createDeserializer().substitution<4>(res, subsitution);
-
-    EXPECT_THAT(res, Eq(v));
-    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
-
-    SerializationContext ctx1;
-    ctx1.createSerializer().substitution<4>(v, subsitution);
-    auto des = ctx1.createDeserializer();
-    des.range(res, {0, N + 1});
-    EXPECT_THAT(res, Eq(2));
-}
-
-TEST(SerializeSubstitution, WhenNoSubstitutionThenWriteZeroBitsAndValueOrObject) {
-    int16_t v = 8945;
-    int16_t res;
-    std::array<int16_t,3> subsitution{485,4849,89};
-    SerializationContext ctx;
-    ctx.createSerializer().substitution<2>(v, subsitution);
-    ctx.createDeserializer().substitution<2>(res, subsitution);
-
-    EXPECT_THAT(res, Eq(v));
-    EXPECT_THAT(ctx.getBufferSize(), Eq(sizeof(int16_t)+1));
-}
-
-TEST(SerializeSubstitution, CustomTypeSubstituted) {
-    MyStruct1 v = {12,10};
-    MyStruct1 res;
-    constexpr size_t N = 4;
-    std::array<MyStruct1, N> subsitution = {
-            MyStruct1{12,10}, MyStruct1{485, 454},
-            MyStruct1{4849,89}, MyStruct1{0,1}};
-    SerializationContext ctx;
-    ctx.createSerializer().substitution(v, subsitution);
-    ctx.createDeserializer().substitution(res, subsitution);
-
-    EXPECT_THAT(res, Eq(v));
-    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
-}
-
-TEST(SerializeSubstitution, CustomTypeNotSubstituted) {
-    MyStruct1 v = {8945,4456};
-    MyStruct1 res;
-    constexpr size_t N = 4;
-    std::array<MyStruct1, N> subsitution = {
-            MyStruct1{12,10}, MyStruct1{485, 454},
-            MyStruct1{4849,89}, MyStruct1{0,1}};
-    SerializationContext ctx;
-    ctx.createSerializer().substitution(v, subsitution);
-    ctx.createDeserializer().substitution(res, subsitution);
-
-    EXPECT_THAT(res, Eq(v));
-    EXPECT_THAT(ctx.getBufferSize(), Eq(MyStruct1::SIZE + 1));
-}
-
-TEST(SerializeSubstitution, CustomFunctionNotSubstituted) {
-    MyStruct1 v = {8945,4456};
-    MyStruct1 res;
-    constexpr size_t N = 4;
-    std::array<MyStruct1, N> subsitution = {
-            MyStruct1{12,10}, MyStruct1{485, 454},
-            MyStruct1{4849,89}, MyStruct1{0,1}};
-
-    auto rangeForValue = bitsery::RangeSpec<int>(0, 10000);
-    auto rangeForIndex = bitsery::RangeSpec<size_t>{0, N+1};
-
-    SerializationContext ctx;
-    auto ser = ctx.createSerializer();
-
-    //lambdas differ only in capture clauses, it would make sense to use std::bind, but debugger crashes when it sees std::bind...
-    auto serLambda = [rangeForValue](auto& s, const MyStruct1& v) {
-        s.range(v.i1, rangeForValue);
-        s.range(v.i2, rangeForValue);
-    };
-    ser.substitution(v, subsitution, serLambda);
-
-    auto des = ctx.createDeserializer();
-    auto desLambda = [rangeForValue](auto& s, MyStruct1& v) {
-        s.range(v.i1, rangeForValue);
-        s.range(v.i2, rangeForValue);
-    };
-    des.substitution(res, subsitution, desLambda);
-
-    EXPECT_THAT(res, Eq(v));
-    EXPECT_THAT(ctx.getBufferSize(), Eq((rangeForIndex.bitsRequired + rangeForValue.bitsRequired * 2 - 1) / 8 + 1 ));
-}
-
-TEST(SerializeSubstitution, WhenSubstitutedThenCustomFunctionNotInvoked) {
-    MyStruct1 v = {4849,89};
-    MyStruct1 res;
-    constexpr size_t N = 4;
-    std::array<MyStruct1, N> subsitution = {
-            MyStruct1{12,10}, MyStruct1{485, 454},
-            MyStruct1{4849,89}, MyStruct1{0,1}};
-
-    SerializationContext ctx;
-    ctx.createSerializer().substitution(v, subsitution, [](bitsery::Serializer<bitsery::BufferWriter>& ,const MyStruct1& ) {});
-    ctx.createDeserializer().substitution(res, subsitution, [](bitsery::Deserializer<bitsery::BufferReader>&, MyStruct1& ) {});
-
-    EXPECT_THAT(res, Eq(v));
-    EXPECT_THAT(ctx.getBufferSize(), Eq(1));
-}

tests/serialization_test_utils.h

@@ -21,35 +21,43 @@
 //SOFTWARE.
 
 
-#ifndef BITSERY_SERIALIZERTESTS_H
-#define BITSERY_SERIALIZERTESTS_H
+#ifndef BITSERY_SERIALIZER_TEST_UTILS_H
+#define BITSERY_SERIALIZER_TEST_UTILS_H
 
-#include <bitsery/bitsery.h>
 #include <memory>
-
+#include <bitsery/bitsery.h>
+#include <bitsery/traits/vector.h>
+#include <bitsery/adapter/buffer.h>
 
 /*
  * define some types for testing
  */
 
 struct MyStruct1 {
-    MyStruct1(int v1, int v2):i1{v1}, i2{v2} {}
-    MyStruct1():MyStruct1{0,0} {}
+    MyStruct1(int32_t v1, int32_t v2) : i1{v1}, i2{v2} {}
+
+    MyStruct1() : MyStruct1{0, 0} {}
+
     int i1;
     int i2;
-    bool operator == (const MyStruct1& rhs) const {
+
+    bool operator==(const MyStruct1 &rhs) const {
         return i1 == rhs.i1 && i2 == rhs.i2;
     }
+    friend bool operator < (const MyStruct1 &lhs, const MyStruct1 &rhs) {
+        return lhs.i1 < rhs.i1 || (lhs.i1 == rhs.i1 && lhs.i2 < rhs.i2);
+    }
+
     static constexpr size_t SIZE = sizeof(MyStruct1::i1) + sizeof(MyStruct1::i2);
 };
 
-SERIALIZE(MyStruct1) {
-    return s.
-            template value<sizeof(o.i1)>(o.i1).
-            template value<sizeof(o.i2)>(o.i2);
+template <typename S>
+void serialize(S& s, MyStruct1& o) {
+    s.template value<sizeof(o.i1)>(o.i1);
+    s.template value<sizeof(o.i2)>(o.i2);
 }
 
-enum class MyEnumClass {
+enum class MyEnumClass:int32_t {
     E1, E2, E3, E4, E5, E6
 };
 
@@ -58,37 +66,70 @@ struct MyStruct2 {
         V1, V2, V3, V4, V5, V6
     };
 
-    MyStruct2(MyEnum e, MyStruct1 s):e1{e}, s1{s} {}
-    MyStruct2():MyStruct2{V1,{0,0}} {}
+    MyStruct2(MyEnum e, MyStruct1 s) : e1{e}, s1{s} {}
+
+    MyStruct2() : MyStruct2{V1, {0, 0}} {}
 
     MyEnum e1;
     MyStruct1 s1;
-    bool operator == (const MyStruct2& rhs) const {
+
+    bool operator==(const MyStruct2 &rhs) const {
         return e1 == rhs.e1 && s1 == rhs.s1;
     }
+
     static constexpr size_t SIZE = MyStruct1::SIZE + sizeof(MyStruct2::e1);
 };
 
-SERIALIZE(MyStruct2) {
-    return s.
-            template value<sizeof(o.e1)>(o.e1).
-            object(o.s1);
+template <typename S>
+void serialize(S&s, MyStruct2& o) {
+    s.template value<sizeof(o.e1)>(o.e1);
+    s.object(o.s1);
 }
 
+struct SessionsEnabledConfig: public bitsery::DefaultConfig {
+    static constexpr bool BufferSessionsEnabled = true;
+};
 
-class SerializationContext {
-    std::vector<bitsery::DefaultConfig::BufferValueType> buf{};
-    std::unique_ptr<bitsery::BufferWriter> bw;
-    std::unique_ptr<bitsery::BufferReader> br;
+using Buffer = std::vector<char>;
+using InputAdapter = bitsery::InputBufferAdapter<Buffer>;
+using OutputAdapter = bitsery::OutputBufferAdapter<Buffer>;
+using Writer = bitsery::AdapterWriter<OutputAdapter, bitsery::DefaultConfig>;
+using Reader = bitsery::AdapterReader<InputAdapter, bitsery::DefaultConfig>;
+
+
+template <typename Config = bitsery::DefaultConfig>
+class BasicSerializationContext {
 public:
-    bitsery::Serializer<bitsery::BufferWriter> createSerializer() {
-        bw = std::make_unique<bitsery::BufferWriter>(buf);
-        return {*bw};
+    Buffer buf;
+    using TWriter = bitsery::AdapterWriter<OutputAdapter, Config>;
+    using TReader = bitsery::AdapterReader<InputAdapter, Config>;
+    std::unique_ptr<bitsery::BasicSerializer<TWriter>> ser;
+    std::unique_ptr<bitsery::BasicDeserializer<TReader>> des;
+    TWriter* bw;
+    TReader* br;
+
+    bitsery::BasicSerializer<TWriter>& createSerializer() {
+        if (!ser) {
+            ser = std::unique_ptr<bitsery::BasicSerializer<TWriter>>(new bitsery::BasicSerializer<TWriter>(OutputAdapter{buf}));
+            bw = &bitsery::AdapterAccess::getWriter(*ser);
+        }
+        return *ser;
+    };
+
+    bitsery::BasicDeserializer<bitsery::AdapterReader<InputAdapter, Config>>& createDeserializer() {
+        bw->flush();
+        if (!des) {
+            des = std::unique_ptr<bitsery::BasicDeserializer<TReader>>(
+                    new bitsery::BasicDeserializer<TReader>(InputAdapter{buf.begin(), bw->writtenBytesCount()}));
+            br = &bitsery::AdapterAccess::getReader(*des);
+        }
+        return *des;
     };
 
     size_t getBufferSize() const {
-        return buf.size();
+        return bw->writtenBytesCount();
     }
+
     //since all containers .size() method returns size_t, it cannot be directly serialized, because size_t is platform dependant
     //this function returns number of bytes writen to buffer, when reading/writing size of container
     static size_t containerSizeSerializedBytesCount(size_t elemsCount) {
@@ -99,11 +140,9 @@ public:
         return 4;
     }
 
-    bitsery::Deserializer<bitsery::BufferReader> createDeserializer() {
-        bw->flush();
-        br = std::make_unique<bitsery::BufferReader>(buf);
-        return {*br};
-    };
 };
 
-#endif //BITSERY_SERIALIZERTESTS_H
+//helper type
+using SerializationContext = BasicSerializationContext<bitsery::DefaultConfig>;
+
+#endif //BITSERY_SERIALIZER_TEST_UTILS_H

tests/serialization_text.cpp

@@ -23,6 +23,8 @@
 
 #include <gmock/gmock.h>
 #include "serialization_test_utils.h"
+#include <bitsery/traits/string.h>
+
 using namespace testing;
 
 TEST(SerializeText, BasicString) {
@@ -108,17 +110,10 @@ TEST(SerializeText, CArraySerializesTextLength) {
     EXPECT_THAT(r1, ContainerEq(t1));
 }
 
-TEST(SerializeText, WhenCArrayNotNullterminatedThenMakeItNullterminated) {
+TEST(SerializeText, WhenCArrayNotNullterminatedThenAssert) {
     SerializationContext ctx;
     char16_t t1[CARR_LENGTH]{u"some text"};
     //make last character not nullterminated
     t1[CARR_LENGTH-1] = 'x';
-    char16_t r1[CARR_LENGTH]{};
-
-    ctx.createSerializer().text<2>(t1);
-    ctx.createDeserializer().text<2>(r1);
-
-    EXPECT_THAT(ctx.getBufferSize(), Eq(ctx.containerSizeSerializedBytesCount(CARR_LENGTH) +
-                                                (CARR_LENGTH - 1) * 2));
-    EXPECT_THAT(r1[CARR_LENGTH-1], Eq(0));
+    EXPECT_DEATH(ctx.createSerializer().text<2>(t1), "");
 }

tests/serialization_values.cpp

@@ -65,8 +65,8 @@ TEST(SerializeValues, ValueSizeOverload1Byte) {
     constexpr size_t TSIZE = sizeof(v);
 
     SerializationContext ctx;
-    ctx.createSerializer().value1(v);
-    ctx.createDeserializer().value1(res);
+    ctx.createSerializer().value1b(v);
+    ctx.createDeserializer().value1b(res);
 
     EXPECT_THAT(res, Eq(v));
     EXPECT_THAT(TSIZE, Eq(ctx.getBufferSize()));
@@ -78,8 +78,8 @@ TEST(SerializeValues, ValueSizeOverload2Byte) {
     constexpr size_t TSIZE = sizeof(v);
 
     SerializationContext ctx;
-    ctx.createSerializer().value2(v);
-    ctx.createDeserializer().value2(res);
+    ctx.createSerializer().value2b(v);
+    ctx.createDeserializer().value2b(res);
 
     EXPECT_THAT(res, Eq(v));
     EXPECT_THAT(TSIZE, Eq(ctx.getBufferSize()));
@@ -91,8 +91,8 @@ TEST(SerializeValues, ValueSizeOverload4Byte) {
     constexpr size_t TSIZE = sizeof(v);
 
     SerializationContext ctx;
-    ctx.createSerializer().value4(v);
-    ctx.createDeserializer().value4(res);
+    ctx.createSerializer().value4b(v);
+    ctx.createDeserializer().value4b(res);
 
     EXPECT_THAT(res, Eq(v));
     EXPECT_THAT(TSIZE, Eq(ctx.getBufferSize()));
@@ -104,8 +104,8 @@ TEST(SerializeValues, ValueSizeOverload8Byte) {
     constexpr size_t TSIZE = sizeof(v);
 
     SerializationContext ctx;
-    ctx.createSerializer().value8(v);
-    ctx.createDeserializer().value8(res);
+    ctx.createSerializer().value8b(v);
+    ctx.createDeserializer().value8b(res);
 
     EXPECT_THAT(res, Eq(v));
     EXPECT_THAT(TSIZE, Eq(ctx.getBufferSize()));