This is a follow-up of 'any' class implementation 'any' class implementation. After posting my answer my answer, I kept working on the code towards parameterizing with respect to memory management as I had promised. I ended up in some pretty non-trivial piece of code that I decided to post here as a new question for review.
This is a follow-up of 'any' class implementation. After posting my answer, I kept working on the code towards parameterizing with respect to memory management as I had promised. I ended up in some pretty non-trivial piece of code that I decided to post here as a new question for review.
This is a follow-up of 'any' class implementation. After posting my answer, I kept working on the code towards parameterizing with respect to memory management as I had promised. I ended up in some pretty non-trivial piece of code that I decided to post here as a new question for review.
Templated on a memory-management object that is roughly what an allocator is for STL containers, yet with a different, custom interface.
Default "allocator" type provides customizable storage space on stack. Similarly to shortsmall string optimization, and without run-time overhead, objects not larger than this space are placed on stack; larger ones on the free store.
Templated on a memory-management object that is roughly what an allocator is for STL containers, yet with a different, custom interface.
Default "allocator" type provides customizable storage space on stack. Similarly to short string optimization, and without run-time overhead, objects not larger than this space are placed on stack; larger ones on the free store.
Templated on a memory-management object that is roughly what an allocator is for STL containers, yet with a different, custom interface.
Default "allocator" type provides customizable storage space on stack. Similarly to small string optimization, and without run-time overhead, objects not larger than this space are placed on stack; larger ones on the free store.
Yet another 'any' class implementation, named 'some'
This is a follow-up of 'any' class implementation. After posting my answer, I kept working on the code towards parametrizingparameterizing with respect to memory management as I had promised. I ended up in some pretty non-trivial piece of code that I decided to post here as a new question for review.
Basically, with a number of differences, this is quite close to boost::any , with a number of differences. AtFrom my own eyes at least,perspective it could be a complete replacement to boost::any, that I like to call some.
Yet another 'any'
This is a follow-up of 'any' class implementation. After posting my answer, I kept working on the code towards parametrizing with respect to memory management as I had promised. I ended up in some pretty non-trivial piece of code that I decided to post here as a new question for review.
Basically, with a number of differences, this is quite close to boost::any. At my own eyes at least, it could be a complete replacement to boost::any, that I like to call some.
Yet another 'any' class implementation, named 'some'
This is a follow-up of 'any' class implementation. After posting my answer, I kept working on the code towards parameterizing with respect to memory management as I had promised. I ended up in some pretty non-trivial piece of code that I decided to post here as a new question for review.
Basically, this is quite close to boost::any , with a number of differences. From my perspective it could be a complete replacement to boost::any, that I like to call some.