Searched refs:num_nodes_ (Results 1 – 7 of 7) sorted by relevance
50 num_nodes_ = *(reinterpret_cast<const uint32_t*>(raw_data_)); in StaticMap()53 raw_data_ + sizeof(num_nodes_)); in StaticMap()56 raw_data_ + (1 + num_nodes_) * sizeof(uint32_t)); in StaticMap()64 int end = num_nodes_; in find()85 int end = num_nodes_; in lower_bound()106 int end = num_nodes_; in upper_bound()134 if (num_nodes_) { in ValidateInMemoryStructure()135 uint64_t first_offset = sizeof(int32_t) * (num_nodes_ + 1) in ValidateInMemoryStructure()136 + sizeof(Key) * num_nodes_; in ValidateInMemoryStructure()148 for (node_index = 1; node_index < num_nodes_; ++node_index) { in ValidateInMemoryStructure()[all …]
50 num_nodes_ = *(reinterpret_cast<const int32_t*>(base_)); in StaticMapIterator()51 offsets_ = reinterpret_cast<const uint32_t*>(base_ + sizeof(num_nodes_)); in StaticMapIterator()53 base_ + (1 + num_nodes_) * sizeof(num_nodes_)); in StaticMapIterator()64 if (++index_ > num_nodes_) index_ = num_nodes_;76 if (++index_ > num_nodes_) index_ = num_nodes_;139 if (!base_ || index_ < 0 || index_ > num_nodes_) in IsValid()
89 num_nodes_(0), in StaticMap()95 inline bool empty() const { return num_nodes_ == 0; } in empty()96 inline unsigned int size() const { return num_nodes_; } in size()100 inline iterator last() const { return IteratorAtIndex(num_nodes_ - 1); } in last()101 inline iterator end() const { return IteratorAtIndex(num_nodes_); } in end()129 int32_t num_nodes_; variable
99 int32_t num_nodes_; variable
39 return (tree->num_nodes_ == tree->max_nodes_); in IsFull()44 HuffmanTreeNode* const children = tree->root_ + tree->num_nodes_; in AssignChildren()47 tree->num_nodes_ += 2; in AssignChildren()72 tree->num_nodes_ = 1; in TreeInit()83 tree->num_nodes_ = 0; in VP8LHuffmanTreeFree()
43 int num_nodes_; // number of currently occupied nodes member
720 if (htrees[RED].num_nodes_ > 1) return 0; in Is8bOptimizable()721 if (htrees[BLUE].num_nodes_ > 1) return 0; in Is8bOptimizable()722 if (htrees[ALPHA].num_nodes_ > 1) return 0; in Is8bOptimizable()