Home
last modified time | relevance | path

Searched refs:binaryFun (Results 1 – 24 of 24) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
H A Dsearching.d382 BoyerMooreFinder!(binaryFun!(pred), Range) boyerMooreFinder
430 is(typeof(binaryFun!pred(r1.front, r2.front))))
440 if (!binaryFun!pred(r1[i], r2[i]))
453 !r1.empty && !r2.empty && binaryFun!pred(r1.front, r2.front);
469 is(typeof(binaryFun!pred(r1.front, r2.front))))
480 if (!binaryFun!pred(f, r2.front))
625 is(typeof(binaryFun!pred(haystack.front, needle)) : bool))
627 bool pred2(ElementType!Range a) { return binaryFun!pred(a, needle); }
680 is(typeof(binaryFun!pred(haystack.front, needle.front)) : bool))
790 if (binaryFun!pred(haystack.front, needles[0].front))
[all …]
H A Dsorting.d174 if (!binaryFun!less(r[i + 1], r[i])) continue;
176 !binaryFun!less(r[i], r[i + 1]),
190 if (!binaryFun!less(ahead.front, r.front)) continue;
193 !binaryFun!less(r.front, ahead.front),
258 return findAdjacent!((a,b) => !binaryFun!less(a,b))(r).empty;
316 if ((T.length == 2 && is(typeof(binaryFun!less(values[1], values[0])) : bool))
324 if (binaryFun!less(values[i + 1], values[i]))
326 assert(!binaryFun!less(values[i], values[i + 1]),
340 if (!binaryFun!less(values[i], values[i + 1]))
344 assert(!binaryFun!less(values[i + 1], values[i]),
[all …]
H A Dcomparison.d94 import std.functional : binaryFun;
95 if (binaryFun!pred(value, v)) return i + 1;
616 if (binaryFun!pred(a, b)) return -1;
617 if (binaryFun!pred(b, a)) return 1;
639 return binaryFun!pred(b, a) ? 1 : binaryFun!pred(a, b) ? -1 : 0; in threeWay()
648 return binaryFun!pred(b, a) ? 1 : binaryFun!pred(a, b) ? -1 : 0; in threeWayInt()
807 if (!binaryFun!(pred)(r1.front, r2.front)) return false;
817 if (!binaryFun!(pred)(r1.front, r2.front)) return false;
1215 alias eq = binaryFun!(equals);
1327 Levenshtein!(Range1, binaryFun!(equals)) lev;
[all …]
H A Diteration.d876 is(typeof(binaryFun!BinaryArgs(0, R.init.front)));
891 cast(void) binaryFun!BinaryArgs(i, a);
920 cast(void) binaryFun!BinaryArgs(i, r.front);
949 cast(void) binaryFun!BinaryArgs(i, e);
1433 private alias comp = binaryFun!pred;
1607 alias fun = binaryFun!pred;
1629 static if (is(typeof(binaryFun!pred(ElementType!Range.init, in ChunkByImplIsUnary()
1649 alias eq = binaryFun!((a, b) => unaryFun!pred(a) == unaryFun!pred(b));
1651 alias eq = binaryFun!pred;
1715 alias eq = binaryFun!((a, b) => unaryFun!pred(a) == unaryFun!pred(b));
[all …]
H A Dsetops.d839 private alias comp = binaryFun!less; in MultiwayMerge()
1011 alias comp = binaryFun!(less);
1131 alias comp = binaryFun!less;
1310 alias comp = binaryFun!(less);
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/algorithm/
H A Dsearching.d105 import std.functional : unaryFun, binaryFun;
398 BoyerMooreFinder!(binaryFun!(pred), Range) boyerMooreFinder
446 is(typeof(binaryFun!pred(r1.front, r2.front))))
456 if (!binaryFun!pred(r1[i], r2[i]))
469 !r1.empty && !r2.empty && binaryFun!pred(r1.front, r2.front);
485 is(typeof(binaryFun!pred(r1.front, r2.front))))
496 if (!binaryFun!pred(f, r2.front))
641 is(typeof(binaryFun!pred(haystack.front, needle))))
643 bool pred2(ElementType!Range a) { return binaryFun!pred(a, needle); }
696 is(typeof(binaryFun!pred(haystack.front, needle.front))))
[all …]
H A Dsorting.d81 import std.functional : unaryFun, binaryFun;
178 if (!binaryFun!less(r[i + 1], r[i])) continue;
180 !binaryFun!less(r[i], r[i + 1]),
194 if (!binaryFun!less(ahead.front, r.front)) continue;
197 !binaryFun!less(r.front, ahead.front),
262 return findAdjacent!((a,b) => !binaryFun!less(a,b))(r).empty;
320 if ((T.length == 2 && is(typeof(binaryFun!less(values[1], values[0])) : bool))
328 if (binaryFun!less(values[i + 1], values[i]))
330 assert(!binaryFun!less(values[i], values[i + 1]),
344 if (!binaryFun!less(values[i], values[i + 1]))
[all …]
H A Dcomparison.d61 import std.functional : unaryFun, binaryFun, lessThan, greaterThan;
94 import std.functional : binaryFun;
95 if (binaryFun!pred(value, v)) return i + 1;
759 if (binaryFun!pred(a, b)) return -1;
760 if (binaryFun!pred(b, a)) return 1;
775 if (binaryFun!pred(c2, c1)) return 1;
776 if (binaryFun!pred(c1, c2)) return -1;
960 && is(typeof(binaryFun!pred(rs[0].front, rs[1].front)))
1034 if (r.empty || !binaryFun!pred(rs[0].front, r.front)) in equalLoop()
1453 alias eq = binaryFun!(equals);
[all …]
H A Diteration.d75 import std.functional : unaryFun, binaryFun;
874 is(typeof(binaryFun!BinaryArgs(0, R.init.front)));
889 cast(void) binaryFun!BinaryArgs(i, a);
895 cast(void) binaryFun!fun(a, b);
937 static if (!is(typeof(binaryFun!BinaryArgs(i, r.front)) == Flag!"each"))
939 cast(void) binaryFun!BinaryArgs(i, r.front);
943 if (binaryFun!BinaryArgs(i, r.front) == No.each) return No.each;
997 static if (!is(typeof(binaryFun!fun(a, b)) == Flag!"each"))
999 cast(void) binaryFun!fun(a, b);
1003 if (binaryFun!fun(a, b) == No.each) return No.each;
[all …]
H A Dsetops.d52 import std.functional : unaryFun, binaryFun;
876 private alias comp = binaryFun!less;
1060 alias comp = binaryFun!(less);
1182 alias comp = binaryFun!less;
1362 alias comp = binaryFun!(less);
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/
H A Dfunctional.d186 template binaryFun(alias fun, string parm1Name = "a",
196 auto binaryFun(ElementType1, ElementType2) in binaryFun() function
207 alias binaryFun = fun.opCall; variable
211 alias binaryFun = fun; variable
218 alias less = binaryFun!("a < b");
220 alias greater = binaryFun!("a > b");
227 static assert(is(typeof(binaryFun!(f1)(1, "2")) == int));
228 assert(binaryFun!(f1)(41, "a") == 42);
230 static assert(is(typeof(binaryFun!(f2)(1, "1")) == string));
231 assert(binaryFun!(f2)(1, "4") == "42");
[all …]
H A Dparallelism.d234 alias ReduceType = typeof(binaryFun!fun(E.init, ElementType!R.init)); in ReduceType()
317 alias reduceAdjoin = binaryFun!(functions[0]); in reduceAdjoin()
323 alias funs = staticMap!(binaryFun, functions); in reduceAdjoin()
339 alias reduceFinish = binaryFun!(functions[0]); in reduceFinish()
345 alias funs = staticMap!(binaryFun, functions); in reduceFinish()
2484 typeof(adjoin!(staticMap!(binaryFun, functions))(e, e)) seed = void; in reduce()
H A Dnumeric.d2193 import std.functional : binaryFun;
2215 if (binaryFun!(comp)(si, t[j]))
H A Duni.d1685 import std.functional : binaryFun; in sharMethod()
1687 alias pred = binaryFun!_pred; in sharMethod()
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/
H A Dfunctional.d206 template binaryFun(alias fun, string parm1Name = "a",
216 auto binaryFun(ElementType1, ElementType2) in binaryFun() function
227 alias binaryFun = fun.opCall; variable
231 alias binaryFun = fun; variable
238 alias less = binaryFun!("a < b");
240 alias greater = binaryFun!("a > b");
247 static assert(is(typeof(binaryFun!(f1)(1, "2")) == int));
248 assert(binaryFun!(f1)(41, "a") == 42);
250 static assert(is(typeof(binaryFun!(f2)(1, "1")) == string));
251 assert(binaryFun!(f2)(1, "4") == "42");
[all …]
H A Dparallelism.d218 alias ReduceType = typeof(binaryFun!fun(E.init, ElementType!R.init)); in ReduceType()
301 alias reduceAdjoin = binaryFun!(functions[0]); in reduceAdjoin()
307 alias funs = staticMap!(binaryFun, functions); in reduceAdjoin()
323 alias reduceFinish = binaryFun!(functions[0]); in reduceFinish()
329 alias funs = staticMap!(binaryFun, functions); in reduceFinish()
2593 typeof(adjoin!(staticMap!(binaryFun, functions))(e, e)) seed = void; in reduce()
H A Dnumeric.d2519 import std.functional : binaryFun;
2541 if (binaryFun!(comp)(si, t[j]))
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/container/
H A Drbtree.d60 import std.functional : binaryFun;
739 if (is(typeof(binaryFun!less(T.init, T.init))))
746 alias _less = binaryFun!less;
1843 if (is(typeof(binaryFun!less(E.init, E.init))))
1850 if (is(typeof(binaryFun!less(E.init, E.init))))
1855 return new RedBlackTree!(E, binaryFun!less, allowDuplicates)(elems);
1874 if ( is(typeof(binaryFun!less((ElementType!Stuff).init, (ElementType!Stuff).init)))
1882 if ( is(typeof(binaryFun!less((ElementType!Stuff).init, (ElementType!Stuff).init)))
1888 return new RedBlackTree!(ElementType!Stuff, binaryFun!less, allowDuplicates)(range);
H A Dbinaryheap.d72 import std.functional : binaryFun;
94 private alias comp = binaryFun!(less);
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/container/
H A Drbtree.d60 import std.functional : binaryFun;
746 if (is(typeof(binaryFun!less(T.init, T.init))))
753 alias _less = binaryFun!less;
1991 if (is(typeof(binaryFun!less(E.init, E.init))))
1998 if (is(typeof(binaryFun!less(E.init, E.init))))
2003 return new RedBlackTree!(E, binaryFun!less, allowDuplicates)(elems);
2022 if ( is(typeof(binaryFun!less((ElementType!Stuff).init, (ElementType!Stuff).init)))
2030 if ( is(typeof(binaryFun!less((ElementType!Stuff).init, (ElementType!Stuff).init)))
2036 return new RedBlackTree!(ElementType!Stuff, binaryFun!less, allowDuplicates)(range);
H A Dbinaryheap.d72 import std.functional : binaryFun;
94 private alias comp = binaryFun!(less);
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/range/
H A Dpackage.d4974 import std.functional : binaryFun; in Recurrence()
4990 _state[_n % stateSize] = cast(StateType) binaryFun!(fun, "a", "n")( in Recurrence()
5081 import std.functional : binaryFun; in Sequence()
5083 alias compute = binaryFun!(fun, "a", "n"); in Sequence()
9436 import std.functional : binaryFun;
9438 private alias predFun = binaryFun!pred;
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/range/
H A Dpackage.d5914 import std.functional : binaryFun;
5930 _state[_n % stateSize] = cast(StateType) binaryFun!(fun, "a", "n")(
6021 import std.functional : binaryFun;
6023 alias compute = binaryFun!(fun, "a", "n");
10768 import std.functional : binaryFun;
10770 private alias predFun = binaryFun!pred;
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/uni/
H A Dpackage.d1655 import std.functional : binaryFun; in sharMethod()
1657 alias pred = binaryFun!_pred; in sharMethod()