performance - Memory and processing efficient multi-dimensional data structure C++ -


what best way store multi-dimensional data in c++? looking dynamic data structure rather static multi-dimensional arrays, number of elements stored in structure can not pre-determined.

additionally, looking data structure can minimize memory cost , provide faster lookup. there ready made data structure or must implement multi-dimensional tree-based data structure?

edit: have store multi-dimensional stream data in data structure. e.g., data stream of form: (key1, key2, key3, value1), (key1, key2, key3, value2), (key1, key2, key3, value3), ...

later search data respect different keys.

i have store multi-dimensional stream data in data structure. e.g., data stream of form: (key1, key2, key3, value), (key1, key2, key3, value), (key1, key2, key3, value), ...

later search data respect different keys.

boost::multiindex allows add different kinds of indices container.

it's pretty complex library , can bit painful used it. that's worth trouble, because problem solves pretty common one.


Comments

Popular posts from this blog

Spring Boot + JPA + Hibernate: Unable to locate persister -

go - Golang: panic: runtime error: invalid memory address or nil pointer dereference using bufio.Scanner -

c - double free or corruption (fasttop) -