Home
last modified time | relevance | path

Searched refs:forest (Results 1 - 4 of 4) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h125 uint32_t* BROTLI_RESTRICT forest = self->forest_; in StoreAndFindMatches() local
127 /* The forest index of the rightmost node of the left subtree of the new in StoreAndFindMatches()
130 /* The forest index of the leftmost node of the right subtree of the new in StoreAndFindMatches()
148 forest[node_left] = self->invalid_pos_; in StoreAndFindMatches()
149 forest[node_right] = self->invalid_pos_; in StoreAndFindMatches()
169 forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)]; in StoreAndFindMatches()
170 forest[node_right] = forest[FN(RightChildIndex)(self, prev_ix)]; in StoreAndFindMatches()
177 forest[node_lef in StoreAndFindMatches()
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h125 uint32_t* BROTLI_RESTRICT forest = self->forest_; in StoreAndFindMatches() local
127 /* The forest index of the rightmost node of the left subtree of the new in StoreAndFindMatches()
130 /* The forest index of the leftmost node of the right subtree of the new in StoreAndFindMatches()
148 forest[node_left] = self->invalid_pos_; in StoreAndFindMatches()
149 forest[node_right] = self->invalid_pos_; in StoreAndFindMatches()
169 forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)]; in StoreAndFindMatches()
170 forest[node_right] = forest[FN(RightChildIndex)(self, prev_ix)]; in StoreAndFindMatches()
177 forest[node_lef in StoreAndFindMatches()
[all...]
/third_party/ffmpeg/tests/fate/
H A Ddemux.mak26 fate-bfstm: CMD = crc -i $(TARGET_SAMPLES)/bfstm/spl-forest-day.bfstm -c:a copy
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dcord.cc1155 // Insert sum into appropriate place in the forest in AddNode()
1213 CordForest forest(node->length); in Rebalance()
1214 forest.Build(node); in Rebalance()
1215 return forest.ConcatNodes(); in Rebalance()

Completed in 5 milliseconds