Searched refs:total_count_ (Results 1 – 3 of 3) sorted by relevance
127 int total_count_; member138 if (t1->total_count_ > t2->total_count_) { in CompareHuffmanTrees()140 } else if (t1->total_count_ < t2->total_count_) { in CompareHuffmanTrees()220 tree[idx].total_count_ = count; in GenerateOptimalTree()237 count = tree_pool[tree_pool_size - 1].total_count_ + in GenerateOptimalTree()238 tree_pool[tree_pool_size - 2].total_count_; in GenerateOptimalTree()244 if (tree[k].total_count_ <= count) { in GenerateOptimalTree()249 tree[k].total_count_ = count; in GenerateOptimalTree()
125 if (t1->total_count_ > t2->total_count_) { in CompareHuffmanTrees()127 } else if (t1->total_count_ < t2->total_count_) { in CompareHuffmanTrees()201 tree[idx].total_count_ = count; in GenerateOptimalTree()218 count = tree_pool[tree_pool_size - 1].total_count_ + in GenerateOptimalTree()219 tree_pool[tree_pool_size - 2].total_count_; in GenerateOptimalTree()225 if (tree[k].total_count_ <= count) { in GenerateOptimalTree()230 tree[k].total_count_ = count; in GenerateOptimalTree()
38 uint32_t total_count_; // Symbol frequency. member