732   int idx2;  member
803                              int idx2, double threshold) {  in HistoQueuePush()  argument
811   if (idx1 > idx2) {  in HistoQueuePush()
812     const int tmp = idx2;  in HistoQueuePush()
813     idx2 = idx1;  in HistoQueuePush()
817   pair.idx2 = idx2;  in HistoQueuePush()
819   h2 = histograms[idx2];  in HistoQueuePush()
867     const int idx2 = histo_queue.queue[0].idx2;  in HistogramCombineGreedy()  local
868     HistogramAdd(histograms[idx2], histograms[idx1], histograms[idx1]);  in HistogramCombineGreedy()
872     HistogramSetRemoveHistogram(image_histo, idx2, num_used);  in HistogramCombineGreedy()
877       if (p->idx1 == idx1 || p->idx2 == idx1 ||  in HistogramCombineGreedy()
878           p->idx1 == idx2 || p->idx2 == idx2) {  in HistogramCombineGreedy()
903 static int PairComparison(const void* idx1, const void* idx2) {  in PairComparison()  argument
905   return (*(int*) idx1 - *(int*) idx2);  in PairComparison()
961       uint32_t idx2 = tmp % (*num_used - 1);  in HistogramCombineStochastic()  local
962       if (idx2 >= idx1) ++idx2;  in HistogramCombineStochastic()
964       idx2 = mappings[idx2];  in HistogramCombineStochastic()
968           HistoQueuePush(&histo_queue, histograms, idx1, idx2, best_cost);  in HistogramCombineStochastic()
979     best_idx2 = histo_queue.queue[0].idx2;  in HistogramCombineStochastic()
997       const int is_idx2_best = p->idx2 == best_idx1 || p->idx2 == best_idx2;  in HistogramCombineStochastic()
1011         p->idx2 = best_idx1;  in HistogramCombineStochastic()
1015       if (p->idx1 > p->idx2) {  in HistogramCombineStochastic()
1016         const int tmp = p->idx2;  in HistogramCombineStochastic()
1017         p->idx2 = p->idx1;  in HistogramCombineStochastic()
1022         HistoQueueUpdatePair(histograms[p->idx1], histograms[p->idx2], 0., p);  in HistogramCombineStochastic()