160 void swapIterators(T &First, T &FirstEnd, T &Second, T &SecondEnd) {  in swapIterators()  argument
161   std::swap(First, Second);  in swapIterators()
177   iterator Second = RHS.begin();  in unite()  local
186   if (Min == First->From() && Min == Second->From()) {  in unite()
187     if (First->To() > Second->To()) {  in unite()
194       if (++Second == SecondEnd)  in unite()
232     if (First->From() > Second->From())  in unite()
233       swapIterators(First, FirstEnd, Second, SecondEnd);  in unite()
247       while (First->To() >= Second->To()) {  in unite()
249         if (++Second == SecondEnd) {  in unite()
268       if (First->To() < Second->From() - One)  in unite()
282         Result.emplace_back(UnionStart, Second->To());  in unite()
286         return AppendTheRest(++Second, SecondEnd);  in unite()
295       swapIterators(First, FirstEnd, Second, SecondEnd);  in unite()
311       return AppendTheRest(Second, SecondEnd);  in unite()
521   const_iterator First = LHS.begin(), Second = RHS.begin(),  in intersect()  local
527   while (First != FirstEnd && Second != SecondEnd) {  in intersect()
532     if (Second->From() < First->From())  in intersect()
533       swapIterators(First, FirstEnd, Second, SecondEnd);  in intersect()
543       if (Second->From() > First->To()) {  in intersect()
559       const llvm::APSInt &IntersectionStart = Second->From();  in intersect()
564       if (Second->To() > First->To()) {  in intersect()
567         swapIterators(First, FirstEnd, Second, SecondEnd);  in intersect()
581       Result.push_back(Range(IntersectionStart, Second->To()));  in intersect()
582       ++Second;  in intersect()
585     } while (Second != SecondEnd);  in intersect()
923                                                      SymbolRef Second);
950                SymbolRef Second);
953                EquivalenceClass First, EquivalenceClass Second);
966                                                        EquivalenceClass Second);
968   areEqual(ProgramStateRef State, SymbolRef First, SymbolRef Second);
1034                        EquivalenceClass First, EquivalenceClass Second);
1109                                          SecondTy Second, RestTy... Tail);
1148                                          RangeSet Second, RestTy... Tail) {  in intersect()  argument
1151   return intersect(F, F.intersect(Head, Second), Tail...);  in intersect()
1156                                          SecondTy Second, RestTy... Tail) {  in intersect()  argument
1157   if (Second) {  in intersect()
1159     return intersect(F, Head, *Second, Tail...);  in intersect()
1188     intersect(RangeSet::Factory &F, HeadTy Head, SecondTy Second,  in intersect()  argument
1191     return intersect(F, *Head, Second, Tail...);  in intersect()
1193   return intersect(F, Second, Tail...);  in intersect()
2244                                                SymbolRef Second) {  in merge()  argument
2246   EquivalenceClass SecondClass = find(State, Second);  in merge()
2425                                                       SymbolRef Second) {  in markDisequal()  argument
2426   return markDisequal(RF, State, find(State, First), find(State, Second));  in markDisequal()
2432                                                       EquivalenceClass Second) {  in markDisequal()  argument
2433   return First.markDisequal(RF, State, Second);  in markDisequal()
2468     EquivalenceClass Second) {  in addToDisequalityInfo()  argument
2478   NewSet = CF.add(NewSet, Second);  in addToDisequalityInfo()
2487   if (const RangeSet *SecondConstraint = Constraints.lookup(Second))  in addToDisequalityInfo()
2515                                                  EquivalenceClass Second) {  in areEqual()  argument
2517   if (First == Second)  in areEqual()
2523   if (DisequalToFirst.contains(Second))  in areEqual()