Lines Matching refs:OrderedPredicate
191 struct OrderedPredicate { struct
192 OrderedPredicate(const std::pair<Position *, Qualifier *> &ip) in OrderedPredicate() function
194 OrderedPredicate(const PositionalPredicate &ip) in OrderedPredicate() argument
219 bool operator<(const OrderedPredicate &other) const { in operator <() argument
239 static OrderedPredicate getEmptyKey() { return Base::getEmptyKey(); } in getEmptyKey()
240 static OrderedPredicate getTombstoneKey() { return Base::getTombstoneKey(); } in getTombstoneKey()
241 static bool isEqual(const OrderedPredicate &lhs, in isEqual()
242 const OrderedPredicate &rhs) { in isEqual()
245 static unsigned getHashValue(const OrderedPredicate &p) { in getHashValue()
256 DenseSet<OrderedPredicate *> predicates;
263 static bool isSamePredicate(MatcherNode *node, OrderedPredicate *predicate) { in isSamePredicate()
271 OrderedPredicate *predicate, in getOrCreateChild()
288 std::vector<OrderedPredicate *>::iterator current, in propagatePattern()
289 std::vector<OrderedPredicate *>::iterator end) { in propagatePattern()
371 DenseSet<OrderedPredicate, OrderedPredicateDenseInfo> uniqued; in generateMatcherTree()
386 OrderedPredicate *orderedPredicate = &*uniqued.find(predicate); in generateMatcherTree()
408 std::vector<OrderedPredicate *> ordered; in generateMatcherTree()
414 [](OrderedPredicate *lhs, OrderedPredicate *rhs) { return *lhs < *rhs; }); in generateMatcherTree()