21 #ifndef ELM_STREE_BUILDER_H_
22 #define ELM_STREE_BUILDER_H_
24 #include <elm/stree/Tree.h>
26 namespace elm {
namespace stree {
28 template <
class K,
class T,
class C = Comparator<K> >
42 int m = (start + end) / 2,
43 l =
make(nodes, s, start, m),
44 u =
make(nodes, s, m + 1, end);
46 nodes[s++] =
node_t(nodes, l, u);
int make(node_t *nodes, int &s, int start, int end)
Definition: Builder.h:38
node_t * allocate(t::uint32 n)
Definition: Builder.h:33
Tree< K, T, C >::node_t node_t
Definition: Builder.h:31
Printable< T, M > p(const T &data, const M &man)
Definition: Output.h:302
t::uint32 leastUpperPowerOf2(t::uint32 v)
Definition: int.cpp:226
unsigned int uint32
Definition: arch.h:31