/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 171 member_iterator MI = findLeader(V); 180 member_iterator MI = findLeader(insert(V)); 203 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 171 member_iterator MI = findLeader(V); 180 member_iterator MI = findLeader(insert(V)); 203 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
H A D | EquivalenceClasses.h | 172 member_iterator MI = findLeader(V); 181 member_iterator MI = findLeader(insert(V)); 204 /// findLeader - Given a value in the set, return a member iterator for the 208 member_iterator findLeader(iterator I) const { function in class:llvm::EquivalenceClasses 212 member_iterator findLeader(const ElemTy &V) const { function in class:llvm::EquivalenceClasses 213 return findLeader(TheMapping.find(V)); 220 return unionSets(findLeader(V1I), findLeader(V2I));
|
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
H A D | IntEqClasses.h | 57 /// findLeader(a) == findLeader(b). This requires an uncompressed map. 61 /// findLeader - Compute the leader of a's equivalence class. This is the 64 unsigned findLeader(unsigned a) const;
|