#include <darts.h>
|
| | DoubleArrayImpl () |
| virtual | ~DoubleArrayImpl () |
| void | set_result (value_type *result, value_type value, std::size_t) const |
| void | set_result (result_pair_type *result, value_type value, std::size_t length) const |
| void | set_array (const void *ptr, std::size_t size=0) |
| const void * | array () const |
| void | clear () |
| std::size_t | unit_size () const |
| std::size_t | size () const |
| std::size_t | total_size () const |
| std::size_t | nonzero_size () const |
| int | build (std::size_t num_keys, const key_type *const *keys, const std::size_t *lengths=NULL, const value_type *values=NULL, Details::progress_func_type progress_func=NULL) |
| int | open (const char *file_name, const char *mode="rb", std::size_t offset=0, std::size_t size=0) |
| int | save (const char *file_name, const char *mode="wb", std::size_t offset=0) const |
| template<class U> |
| void | exactMatchSearch (const key_type *key, U &result, std::size_t length=0, std::size_t node_pos=0) const |
| template<class U> |
| U | exactMatchSearch (const key_type *key, std::size_t length=0, std::size_t node_pos=0) const |
| template<class U> |
| std::size_t | commonPrefixSearch (const key_type *key, U *results, std::size_t max_num_results, std::size_t length=0, std::size_t node_pos=0) const |
| value_type | traverse (const key_type *key, std::size_t &node_pos, std::size_t &key_pos, std::size_t length=0) const |
◆ key_type
template<typename, typename, typename T, typename>
◆ result_type
template<typename, typename, typename T, typename>
◆ value_type
template<typename, typename, typename T, typename>
◆ DoubleArrayImpl()
template<typename, typename, typename T, typename>
◆ ~DoubleArrayImpl()
template<typename, typename, typename T, typename>
◆ array()
template<typename, typename, typename T, typename>
◆ build()
template<typename A, typename B, typename T, typename C>
◆ clear()
template<typename, typename, typename T, typename>
◆ commonPrefixSearch()
template<typename A, typename B, typename T, typename C>
template<typename U>
| std::size_t Darts::DoubleArrayImpl< A, B, T, C >::commonPrefixSearch |
( |
const key_type * | key, |
|
|
U * | results, |
|
|
std::size_t | max_num_results, |
|
|
std::size_t | length = 0, |
|
|
std::size_t | node_pos = 0 ) const |
|
inline |
◆ exactMatchSearch() [1/2]
template<typename A, typename B, typename T, typename C>
template<typename U>
◆ exactMatchSearch() [2/2]
template<typename, typename, typename T, typename>
template<class U>
| void Darts::DoubleArrayImpl< typename, typename, T, typename >::exactMatchSearch |
( |
const key_type * | key, |
|
|
U & | result, |
|
|
std::size_t | length = 0, |
|
|
std::size_t | node_pos = 0 ) const |
|
inline |
◆ nonzero_size()
template<typename, typename, typename T, typename>
◆ open()
template<typename A, typename B, typename T, typename C>
| int Darts::DoubleArrayImpl< A, B, T, C >::open |
( |
const char * | file_name, |
|
|
const char * | mode = "rb", |
|
|
std::size_t | offset = 0, |
|
|
std::size_t | size = 0 ) |
◆ save()
template<typename A, typename B, typename T, typename C>
| int Darts::DoubleArrayImpl< A, B, T, C >::save |
( |
const char * | file_name, |
|
|
const char * | mode = "wb", |
|
|
std::size_t | offset = 0 ) const |
◆ set_array()
template<typename, typename, typename T, typename>
| void Darts::DoubleArrayImpl< typename, typename, T, typename >::set_array |
( |
const void * | ptr, |
|
|
std::size_t | size = 0 ) |
|
inline |
◆ set_result() [1/2]
template<typename, typename, typename T, typename>
◆ set_result() [2/2]
template<typename, typename, typename T, typename>
◆ size()
template<typename, typename, typename T, typename>
◆ total_size()
template<typename, typename, typename T, typename>
◆ traverse()
template<typename A, typename B, typename T, typename C>
◆ unit_size()
template<typename, typename, typename T, typename>
The documentation for this class was generated from the following file: