| 109 | } |
| 110 | |
| 111 | int build(size_t key_size, |
| 112 | const std::vector<std::string> *key, |
| 113 | const size_t *length = 0, |
| 114 | const std::vector<value_type> *value = 0) |
| 115 | { |
| 116 | if (!key_size || !key) |
| 117 | return 0; |
| 118 | |
| 119 | key_ = key; |
| 120 | length_ = length; |
| 121 | key_size_ = key_size; |
| 122 | value_ = value; |
| 123 | progress_ = 0; |
| 124 | |
| 125 | resize(8192); |
| 126 | |
| 127 | array_[0].base = 1; |
| 128 | next_check_pos_ = 0; |
| 129 | |
| 130 | node_t root_node; |
| 131 | root_node.left = 0; |
| 132 | root_node.right = key_size; |
| 133 | root_node.depth = 0; |
| 134 | |
| 135 | std::vector<node_t> siblings; |
| 136 | fetch(root_node, siblings); |
| 137 | insert(siblings); |
| 138 | |
| 139 | delete[] used_; |
| 140 | used_ = 0; |
| 141 | |
| 142 | return error_; |
| 143 | } |
| 144 | |
| 145 | inline result_pair_type match_search(const char *key, |
| 146 | size_t len = 0, |
no outgoing calls
no test coverage detected