Lines Matching full:distance_
565 double distance_[NUM_DISTANCE_CODES];
613 NUM_DISTANCE_CODES, histo->distance_, m->distance_);
644 return m->distance_[code] + extra_bits;
930 // the minimum in cost_model->distance_. The case where the offset cost is 0
936 if (cost_model->distance_[i] != 0) {
938 offset_cost_min = cost_model->distance_[i];
939 } else if (cost_model->distance_[i] < offset_cost_min) {
940 offset_cost_min = cost_model->distance_[i];
944 // In case all the cost_model->distance_ is 0, the next non-zero cost we
1584 ++histos[i]->distance_[code_dist];