elm::stree::MarkerBuilder< K, T, C > Class Template Reference

#include <elm/stree/MarkerBuilder.h>

Inheritance diagram for elm::stree::MarkerBuilder< K, T, C >:

Public Member Functions
void	add (const K &mark, const T &val)
void	make (stree::Tree< K, T, C > &tree)

Additional Inherited Members
Protected Types inherited from elm::stree::Builder< K, T, C >
typedef Tree< K, T, C >::node_t	node_t
Protected Member Functions inherited from elm::stree::Builder< K, T, C >
node_t *	allocate (t::uint32 n)
int	make (node_t *nodes, int &s, int start, int end)

Detailed Description

template<class K, class T, class C = Comparator<K>>
class elm::stree::MarkerBuilder< K, T, C >

Efficient and easy builder for elm::stree::Tree class thatjust records segments and their value.

Parameters

K	Key type.
T	Retrieven item type.
C	Comparator to compare keys (default to Comparator<K>).

Member Function Documentation

template<class K , class T , class C = Comparator<K>>

void elm::stree::MarkerBuilder< K, T, C >::add	(	const K &	mark,
		const T &	val
	)

Add a segment starting at the given mark, containing the given value and spanning the next upper given mark. It must be noticed that the value of the greater mark is not used.

Parameters

mark	Mark to add.
val	Value of the segment.

template<class K , class T , class C = Comparator<K>>

void elm::stree::MarkerBuilder< K, T, C >::make

(

stree::Tree< K, T, C > &

tree

)

Build the segmented tree from the markers and values.

Parameters

tree	Tree to initialize.

References elm::stree::Builder< K, T, C >::allocate(), elm::stree::Tree< K, T, C >::node_t::data, elm::Pair< T1, T2 >::fst, elm::stree::Builder< K, T, C >::make(), elm::stree::Tree< K, T, C >::set(), and elm::Pair< T1, T2 >::snd.

---

The documentation for this class was generated from the following files:

• include/elm/stree/MarkerBuilder.h
• src/stree_Tree.cpp