114 bool is_permutation(SVIter first1, SVIter last1, SVIter first2)  in is_permutation()  argument
121     for (; first1 != last1; ++first1, ++first2)  in is_permutation()
123         xBuckets [first1->key]++;  in is_permutation()
124         xPayloads[first1->key] += first1->payload;  in is_permutation()
142 bool is_permutation(Iter1 first1, Iter1 last1, Iter2 first2)  in is_permutation()  argument
150     for (; first1 != last1; ++first1, ++first2)  in is_permutation()
152         xBuckets [*first1]++;  in is_permutation()
341 static bool compare_unique(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2)  in compare_unique()  argument
343     assert(first1 != last1 && first2 != last2);  in compare_unique()
344     if (*first1 != *first2) return false;  in compare_unique()
346     uint8_t last_value = *first1;  in compare_unique()
347     ++first1; ++first2;  in compare_unique()
348     while(first1 != last1 && first2 != last2)  in compare_unique()
351         while (*first1 == last_value)  in compare_unique()
352             if (++first1 == last1) return false;  in compare_unique()
353         if (*first1 != *first2) return false;  in compare_unique()
354         last_value = *first1;  in compare_unique()
355         ++first1; ++first2;  in compare_unique()
359     if (first1 == last1 && first2 != last2) return false;  in compare_unique()
362     while (first1 != last1)  in compare_unique()
364         if (*first1 != last_value) return false;  in compare_unique()
365         ++first1;  in compare_unique()