Lines Matching defs:comp
59 Comparator& comp;
62 lexicographic(Comparator& _comp) : comp(_comp) { }
68 if (comp(p1.first, p2.first))
71 if (comp(p2.first, p1.first))
84 Comparator& comp;
87 lexicographic_reverse(Comparator& _comp) : comp(_comp) { }
93 if (comp(p2.first, p1.first))
96 if (comp(p1.first, p2.first))
118 * @param comp The ordering functor, defaults to std::less<T>.
126 Comparator comp = std::less<
139 lexicographic<value_type, int, Comparator> lcomp(comp);
140 lexicographic_reverse<value_type, int, Comparator> lrcomp(comp);
237 if (!comp(S(i)[a[i] - 1], *lmax))
333 if (!comp(S(i)[a[i] - 1], *maxleft))
344 if (comp(S(i)[b[i]], *minright))
372 * @param comp The ordering functor, defaults to std::less.
378 RankType& offset, Comparator comp = std::less<T>())
387 lexicographic<T, int, Comparator> lcomp(comp);
388 lexicographic_reverse<T, int, Comparator> lrcomp(comp);
473 if (comp(*lmax, S(i)[a[i] - 1])) //max
483 if (lmax && middle < ns[i] && comp(S(i)[middle], *lmax))
568 if (comp(maxleft, S(i)[a[i] - 1]))
582 if (comp(S(i)[b[i]], minright))
590 if (!maxleftset || comp(minright, maxleft))
604 comp) - S(i);
