Getting started

How to use
Example needle in a haystack

The boost::segmented_tree::seq container supports the interfaces of std::vector and std::deque, it can be used in the same way as these containers with a few exceptions:

The time complexities of all operations may differ.
The iterator invalidation rules may differ.
The exception safety guarantees may differ.
reserve() and shrink_to_fit() are missing.
The standard library requires users to obtain an iterator to the middle of a sequence container by using "container.begin() + offset", doing this with boost::segmented_tree::seq is inefficient. Instead users should use boost::segmented_tree::seq::nth.

How to use

Boost.SegmentedTree is a header only C++11 library and it does not depend on any other Boost libraries. Simply include boost/segmented_tree/seq.hpp to start using it.

Example needle in a haystack

#include <algorithm>
#include <iostream>
#include <boost/segmented_tree/seq.hpp>

int main() {
  boost::segmented_tree::seq<std::string> haystack(100000, "hay");
  haystack.insert(haystack.nth(33333), "needle");
  auto first = haystack.begin();
  auto last = haystack.end();
  auto it = std::find(first, last, "needle");
  if (it != last) {
    std::cout << "Found needle at index: " << haystack.index_of(it) << "\n";
    haystack.erase(it);
  }
}