btree_seq.h File Reference

#include <assert.h>
#include <iterator>
#include <initializer_list>
#include <utility>
#include "btree_seq2.h"

Go to the source code of this file.

Classes
class	btree_seq< T, L, M, A >
	The fast sequence container, which behaves like std::vector takes O(log(N)) to insert/delete elements. More...
class	btree_seq< T, L, M, A >::iterator_base< TT >
	Iterator template for const_iterator and iterator. More...

Functions
template<typename T , int L, int M, typename A >
void	swap (btree_seq< T, L, M, A > &first, btree_seq< T, L, M, A > &second)
	Swap contents of two containers.
template<typename T , int L, int M, typename A >
bool	operator< (const btree_seq< T, L, M, A > &x, const btree_seq< T, L, M, A > &y)
	Lexicographical comparison.
template<typename T , int L, int M, typename A >
bool	operator> (const btree_seq< T, L, M, A > &x, const btree_seq< T, L, M, A > &y)
	Lexicographical comparison.
template<typename T , int L, int M, typename A >
bool	operator<= (const btree_seq< T, L, M, A > &x, const btree_seq< T, L, M, A > &y)
	Lexicographical comparison.
template<typename T , int L, int M, typename A >
bool	operator>= (const btree_seq< T, L, M, A > &x, const btree_seq< T, L, M, A > &y)
	Lexicographical comparison.
template<typename T , int L, int M, typename A >
bool	operator== (const btree_seq< T, L, M, A > &x, const btree_seq< T, L, M, A > &y)
	Equality of size and all elements.
template<typename T , int L, int M, typename A >
bool	operator!= (const btree_seq< T, L, M, A > &x, const btree_seq< T, L, M, A > &y)
	Inequality of size or any elements.

Detailed Description

Declaration of btree_seq container, sequence based on btree.