733   int idx2;  member
804                              int idx2, double threshold) {  in HistoQueuePush()  argument
812   if (idx1 > idx2) {  in HistoQueuePush()
813     const int tmp = idx2;  in HistoQueuePush()
814     idx2 = idx1;  in HistoQueuePush()
818   pair.idx2 = idx2;  in HistoQueuePush()
820   h2 = histograms[idx2];  in HistoQueuePush()
868     const int idx2 = histo_queue.queue[0].idx2;  in HistogramCombineGreedy()  local
869     HistogramAdd(histograms[idx2], histograms[idx1], histograms[idx1]);  in HistogramCombineGreedy()
873     HistogramSetRemoveHistogram(image_histo, idx2, num_used);  in HistogramCombineGreedy()
878       if (p->idx1 == idx1 || p->idx2 == idx1 ||  in HistogramCombineGreedy()
879           p->idx1 == idx2 || p->idx2 == idx2) {  in HistogramCombineGreedy()
904 static int PairComparison(const void* idx1, const void* idx2) {  in PairComparison()  argument
906   return (*(int*) idx1 - *(int*) idx2);  in PairComparison()
962       uint32_t idx2 = tmp % (*num_used - 1);  in HistogramCombineStochastic()  local
963       if (idx2 >= idx1) ++idx2;  in HistogramCombineStochastic()
965       idx2 = mappings[idx2];  in HistogramCombineStochastic()
969           HistoQueuePush(&histo_queue, histograms, idx1, idx2, best_cost);  in HistogramCombineStochastic()
980     best_idx2 = histo_queue.queue[0].idx2;  in HistogramCombineStochastic()
998       const int is_idx2_best = p->idx2 == best_idx1 || p->idx2 == best_idx2;  in HistogramCombineStochastic()
1012         p->idx2 = best_idx1;  in HistogramCombineStochastic()
1016       if (p->idx1 > p->idx2) {  in HistogramCombineStochastic()
1017         const int tmp = p->idx2;  in HistogramCombineStochastic()
1018         p->idx2 = p->idx1;  in HistogramCombineStochastic()
1023         HistoQueueUpdatePair(histograms[p->idx1], histograms[p->idx2], 0., p);  in HistogramCombineStochastic()