Disk-backed STL container classes? [closed]

by

I have implemented some thing very similar. Implementing the iterators is the most challenging. I used boost::iterator_facade to implement the iterators. Using boost::iterator_facade you can easy adapt any cached on disk data structures to have a STL container interface.

Related Contents:

  1. Why does the C++ STL not provide any “tree” containers?
  2. Why is std::map implemented as a red-black tree?
  3. Throwing the fattest people off of an overloaded airplane.
  4. How do I clear the std::queue efficiently?
  5. Why would anyone use set instead of unordered_set?
  6. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  7. Where can I get a “useful” C++ binary search algorithm?
  8. std::back_inserter for a std::set?
  9. How to choose between map and unordered_map?
  10. LRU cache design
  11. Does the range-based ‘for’ loop deprecate many simple algorithms?
  12. Easiest way of using min priority queue with key update in C++
  13. Looking for C++ STL-like vector class but using stack storage
  14. std::transform() and toupper(), no matching function
  15. How to get a random element from a C++ container?
  16. Why there is no std::copy_if algorithm?
  17. what is the difference between set and unordered_set in C++?
  18. What is the right approach when using STL container for median calculation?
  19. Use of for_each on map elements
  20. Is there a nice way to assign std::minmax(a, b) to std::tie(a, b)?
  21. How does a sentinel node offer benefits over NULL?
  22. Relative performance of std::vector vs. std::list vs. std::slist?
  23. How can I sort an STL map by value?
  24. What algorithms are used in C++11 std::sort in different STL implementations?
  25. Suffix Array Algorithm
  26. Why do I have to always specify the range in STL’s algorithm functions explicitly, even if I want to work on the whole container?
  27. Given a 1 TB data set on disk with around 1 KB per data record, how can I find duplicates using 512 MB RAM and infinite disk space?
  28. How do I iterate over a vector and also know the index of the element?
  29. Reorder vector using a vector of indices [duplicate]
  30. How to get the iterator for a successful binary_search? [duplicate]
  31. Efficiency of the STL priority_queue
  32. Which sorting algorithm is used by STL’s list::sort()?
  33. Does std::sort implement Quicksort? [duplicate]
  34. Initializing a static std::map in C++
  35. How to implement classic sorting algorithms in modern C++?
  36. Why use iterators instead of array indices?
  37. In STL maps, is it better to use map::insert than []?
  38. Why isn’t vector a STL container?
  39. std::string comparison (check whether string begins with another string)
  40. vector or map, which one to use?
  41. Google C++ style guide’s No-exceptions rule; STL?
  42. Convert a vector to initializer_list
  43. Difference between erase and remove
  44. Fast n choose k mod p for large n?
  45. size_t vs int warning
  46. C++ remove_if on a vector of objects
  47. How can I traverse/iterate an STL map?
  48. Does std::vector::swap invalidate iterators?
  49. Template class with template container
  50. Vectors, structs and std::find

Leave a Comment