Lines Matching defs:start
104 [0, n): the sorted leaf nodes that we start with.
152 static void Reverse(uint8_t* v, size_t start, size_t end) {
154 while (start < end) {
155 uint8_t tmp = v[start];
156 v[start] = v[end];
158 ++start;
191 size_t start = *tree_size;
203 Reverse(tree, start, *tree_size);
204 Reverse(extra_bits_data, start, *tree_size);
227 size_t start = *tree_size;
239 Reverse(tree, start, *tree_size);
240 Reverse(extra_bits_data, start, *tree_size);