023538c19c
Summary: With a pool allocator, lookups in STL set and map are up to 50% faster. This is probably due to contiguous memory of pooled objects, i.e. nodes of those containers. In some cases, the lookup outperforms the SkipList. Insertions are also faster, though not as dramatically, up to 30%. This does make a significant difference when the STL containers are used in a single thread as they outperform the SkipList significantly. Reviewers: mferencevic, ipaljak Reviewed By: mferencevic Subscribers: pullbot Differential Revision: https://phabricator.memgraph.io/D2326 |
||
|---|---|---|
| .. | ||
| eval.cpp | ||
| execution.cpp | ||
| planner.cpp | ||
| profile.cpp | ||
| stripped.cpp | ||