Copyright © 2014, 2015 Chris Clearwater
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
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.
Boost.SegmentedTree is not currently a part of Boost.
Last revised: November 14, 2015 at 03:58:58 GMT