momo::stdish Namespace Reference

Namespaces
	internal

Classes
class	map
	momo::stdish::map is similar to std::map, but much more efficient in memory usage. The implementation is based on a B-tree. More...
class	multimap
	momo::stdish::multimap is similar to std::multimap, but much more efficient in memory usage. The implementation is based on a B-tree. More...
class	multiset
	momo::stdish::multiset is similar to std::multiset, but much more efficient in memory usage. The implementation is based on a B-tree. More...
class	set
	momo::stdish::set is similar to std::set, but much more efficient in memory usage. The implementation is based on a B-tree. More...
class	unordered_map
	momo::stdish::unordered_map is similar to std::unordered_map, but much more efficient in memory usage. The implementation is based on hash table with buckets in the form of small arrays. More...
class	unordered_map_open
	momo::stdish::unordered_map_open is similar to std::unordered_map, but much more efficient in operation speed. The implementation is based on open addressing hash table. More...
class	unordered_multimap
	momo::stdish::unordered_multimap is similar to std::unordered_multimap, but much more efficient in memory usage. The implementation is based on hash table with buckets in the form of small arrays. More...
class	unordered_multimap_open
	momo::stdish::unordered_multimap_open is similar to std::unordered_multimap, but much more efficient in operation speed. The implementation is based on open addressing hash table. More...
class	unordered_set
	momo::stdish::unordered_set is similar to std::unordered_set, but much more efficient in memory usage. The implementation is based on hash table with buckets in the form of small arrays. More...
class	unordered_set_open
	momo::stdish::unordered_set_open is similar to std::unordered_set, but much more efficient in operation speed. The implementation is based on open addressing hash table. More...
class	unsynchronized_pool_allocator
	Allocator with a pool of memory for containers like std::list, std::forward_list, std::map, std::unordered_map. It makes no sense to use this allocator for classes momo::stdish. More...
class	vector
	momo::stdish::vector is similar to std::vector. More...

Typedefs
template<size_t tInternalCapacity, typename TValue , typename TAllocator = std::allocator<TValue>>
using	vector_intcap = vector< TValue, TAllocator, ArrayIntCap< tInternalCapacity, TValue, MemManagerStd< TAllocator > >>
	momo::stdish::vector_intcap is vector with internal capacity. This vector doesn't need dynamic memory while its size is not greater than user-defined constant. More...

Typedef Documentation

vector_intcap

template<size_t tInternalCapacity, typename TValue , typename TAllocator = std::allocator<TValue>>

using momo::stdish::vector_intcap = typedef vector<TValue, TAllocator, ArrayIntCap<tInternalCapacity, TValue, MemManagerStd<TAllocator> >>

momo::stdish::vector_intcap is vector with internal capacity. This vector doesn't need dynamic memory while its size is not greater than user-defined constant.

It is allowed to pass to functions push_back, insert, emplace_back and emplace references to items within the container. But in case of the function insert, receiving pair of iterators, it's not allowed to pass iterators pointing to the items within the container.