Boost C++ Libraries Home Libraries People FAQ More

Next

Chapter 1. Boost.SegmentedTree 1.0

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

Table of Contents

Motivation
Getting started
How to use
Example needle in a haystack
Implementation
Representation
Searching
Inserting
Erasing
Reference
Header <boost/segmented_tree/seq.hpp>
Performance

The standard library provides sequence containers that offer efficient insertion at at the end (std::vector), efficient insertition at the front and the end (std::deque), but offers no solution for efficient random access insertion.

Boost.SegmentedTree was designed to fill this use case.

[Note] Note

Boost.SegmentedTree is not currently a part of Boost.

Last revised: November 14, 2015 at 03:58:58 GMT


Next