Classes
struct	block

struct	empty_callback

struct	ninfo

struct	node

struct	result_pair_type

struct	result_triple_type

Public Types
enum	error_code { CEDAR_NO_VALUE = NO_VALUE, CEDAR_NO_PATH = NO_PATH, CEDAR_VALUE_LIMIT = 2147483647, CEDAR_NO_VALUE = NO_VALUE, CEDAR_NO_PATH = NO_PATH }

enum	error_code { CEDAR_NO_VALUE = NO_VALUE, CEDAR_NO_PATH = NO_PATH, CEDAR_VALUE_LIMIT = 2147483647, CEDAR_NO_VALUE = NO_VALUE, CEDAR_NO_PATH = NO_PATH }

typedef value_type	result_type

typedef value_type	result_type

Public Member Functions
size_t	capacity () const

size_t	size () const

size_t	total_size () const

size_t	unit_size () const

size_t	nonzero_size () const

size_t	num_keys () const

template<typename T >
T	exactMatchSearch (const char *key) const

template<typename T >
T	exactMatchSearch (const char *key, size_t len, size_t from=0) const

template<typename T >
size_t	commonPrefixSearch (const char key, T result, size_t result_len) const

template<typename T >
size_t	commonPrefixSearch (const char key, T result, size_t result_len, size_t len, size_t from=0) const

template<typename T >
size_t	commonPrefixPredict (const char key, T result, size_t result_len)

template<typename T >
size_t	commonPrefixPredict (const char key, T result, size_t result_len, size_t len, size_t from=0)

void	suffix (char *key, size_t len, size_t to) const

value_type	traverse (const char *key, size_t &from, size_t &pos) const

value_type	traverse (const char *key, size_t &from, size_t &pos, size_t len) const

value_type &	update (const char *key)

value_type &	update (const char *key, size_t len, value_type val=value_type(0))

value_type &	update (const char *key, size_t &from, size_t &pos, size_t len, value_type val=value_type(0))

template<typename T >
value_type &	update (const char *key, size_t &from, size_t &pos, size_t len, value_type val, T &cf)

int	erase (const char *key)

int	erase (const char *key, size_t len, size_t from=0)

void	erase (size_t from)

int	build (size_t num, const char *key, const size_t len=0, const value_type *val=0)

template<typename T >
void	dump (T *result, const size_t result_len)

int	save (const char fn, const char mode="wb") const

int	open (const char fn, const char mode="rb", const size_t offset=0, size_t size_=0)

void	restore ()

void	set_array (void *p, size_t size_=0)

const void *	array () const

void	clear (const bool reuse=true)

int	begin (size_t &from, size_t &len)

int	next (size_t &from, size_t &len, const size_t root=0)

void	test (const size_t from=0) const

size_t	capacity () const

size_t	size () const

size_t	length () const

size_t	total_size () const

size_t	unit_size () const

size_t	nonzero_size () const

size_t	nonzero_length () const

size_t	num_keys () const

template<typename T >
T	exactMatchSearch (const char *key) const

template<typename T >
T	exactMatchSearch (const char *key, size_t len, npos_t from=0) const

template<typename T >
size_t	commonPrefixSearch (const char key, T result, size_t result_len) const

template<typename T >
size_t	commonPrefixSearch (const char key, T result, size_t result_len, size_t len, npos_t from=0) const

template<typename T >
size_t	commonPrefixPredict (const char key, T result, size_t result_len)

template<typename T >
size_t	commonPrefixPredict (const char key, T result, size_t result_len, size_t len, npos_t from=0)

void	suffix (char *key, size_t len, npos_t to) const

value_type	traverse (const char *key, npos_t &from, size_t &pos) const

value_type	traverse (const char *key, npos_t &from, size_t &pos, size_t len) const

value_type &	update (const char *key)

value_type &	update (const char *key, size_t len, value_type val=value_type(0))

value_type &	update (const char *key, npos_t &from, size_t &pos, size_t len, value_type val=value_type(0))

template<typename T >
value_type &	update (const char *key, npos_t &from, size_t &pos, size_t len, value_type val, T &cf)

int	erase (const char *key)

int	erase (const char *key, size_t len, npos_t from=0)

int	build (size_t num, const char *key, const size_t len=0, const value_type *val=0)

template<typename T >
void	dump (T *result, const size_t result_len)

void	shrink_tail ()

int	save (const char fn, const char mode, const bool shrink)

int	save (const char fn, const char mode="wb") const

int	open (const char fn, const char mode="rb", const size_t offset=0, size_t size_=0)

void	restore ()

void	set_array (void *p, size_t size_=0)

const void *	array () const

void	clear (const bool reuse=true)

int	begin (npos_t &from, size_t &len)

int	next (npos_t &from, size_t &len, const npos_t root=0)

Public Attributes
size_t	tracking_node [NUM_TRACKING_NODES+1]

npos_t	tracking_node [NUM_TRACKING_NODES+1]

char *	_tail

int *	_length

int *	_tail0

int *	_length0

Detailed Description

template<typename value_type, const int NO_VALUE = NaN <value_type>::N1, const int NO_PATH = NaN <value_type>::N2, const bool ORDERED = true, const int MAX_TRIAL = 1, const size_t NUM_TRACKING_NODES = 0>
class cedar::da< value_type, NO_VALUE, NO_PATH, ORDERED, MAX_TRIAL, NUM_TRACKING_NODES >

Definition at line 35 of file cedar.h.

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

/home/sella/digitalgenesis/libutil++/releases/rpm/BUILD/libutil++-1.9.3/src/sella/container/cedar.h
/home/sella/digitalgenesis/libutil++/releases/rpm/BUILD/libutil++-1.9.3/src/sella/container/cedarpp.h

Classes

Public Types

Public Member Functions

Public Attributes

Detailed Description

template<typename value_type, const int NO_VALUE = NaN <value_type>::N1, const int NO_PATH = NaN <value_type>::N2, const bool ORDERED = true, const int MAX_TRIAL = 1, const size_t NUM_TRACKING_NODES = 0> class cedar::da< value_type, NO_VALUE, NO_PATH, ORDERED, MAX_TRIAL, NUM_TRACKING_NODES >

template<typename value_type, const int NO_VALUE = NaN <value_type>::N1, const int NO_PATH = NaN <value_type>::N2, const bool ORDERED = true, const int MAX_TRIAL = 1, const size_t NUM_TRACKING_NODES = 0>
class cedar::da< value_type, NO_VALUE, NO_PATH, ORDERED, MAX_TRIAL, NUM_TRACKING_NODES >