| /dports/devel/estd/estd-0.4.0/test/tuple/ |
| H A D | fold.cpp | 43 REQUIRE(foldl(std::tuple<>(), 5, sum) == 5);
47 REQUIRE(foldl(std::tuple(5), mul) == 5);
51 REQUIRE(foldl(std::tuple(1, 2, 3, 4), sum) == 1 + 2 + 3 + 4);
52 REQUIRE(foldl(std::tuple(1, 2, 3, 4), mul) == 1 * 2 * 3 * 4);
56 REQUIRE(foldl(std::tuple(1, 2, 3, 4), 10, sum) == 10 + 1 + 2 + 3 + 4);
57 REQUIRE(foldl(std::tuple(1, 2, 3, 4), 10, mul) == 10 * 1 * 2 * 3 * 4);
61 REQUIRE(foldl(std::tuple(1, 2.0, 3.f, 4), 10, sum) == 10.0 + 1 + 2 + 3 + 4);
68 REQUIRE(foldl(std::tuple(1.0, 2, 3, 4.0), 10, drop_right) == 10);
69 REQUIRE(foldl(std::tuple(1 , 2, 3, 4.0), drop_right) == 1);
73 REQUIRE(foldl(std::tuple(1, 2, 3, 4.0), 10, drop_left) == 4.0);
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/metaparse/doc/ |
| H A D | foldl.qbk | 1 [#foldl]
2 [section foldl]
7 struct foldl;
20 `foldl` applies `P` on the input string repeatedly as long as `P` accepts the
25 When `P` rejects the input for the first time, `foldl` still accepts the input
28 Here is a diagram showing how `foldl` works by example:
35 Further details can be found in the [link introducing-foldl Introducing foldl]
40 #include <boost/metaparse/foldl.hpp>
47 foldl<p, t, f>::apply<s, pos>
64 #include <boost/metaparse/foldl.hpp>
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/metaparse/doc/ |
| H A D | foldl.qbk | 1 [#foldl]
2 [section foldl]
7 struct foldl;
20 `foldl` applies `P` on the input string repeatedly as long as `P` accepts the
25 When `P` rejects the input for the first time, `foldl` still accepts the input
28 Here is a diagram showing how `foldl` works by example:
35 Further details can be found in the [link introducing-foldl Introducing foldl]
40 #include <boost/metaparse/foldl.hpp>
47 foldl<p, t, f>::apply<s, pos>
64 #include <boost/metaparse/foldl.hpp>
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/metaparse/doc/ |
| H A D | foldl.qbk | 1 [#foldl]
2 [section foldl]
7 struct foldl;
20 `foldl` applies `P` on the input string repeatedly as long as `P` accepts the
25 When `P` rejects the input for the first time, `foldl` still accepts the input
28 Here is a diagram showing how `foldl` works by example:
35 Further details can be found in the [link introducing-foldl Introducing foldl]
40 #include <boost/metaparse/foldl.hpp>
47 foldl<p, t, f>::apply<s, pos>
64 #include <boost/metaparse/foldl.hpp>
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/metaparse/doc/ |
| H A D | foldl.qbk | 1 [#foldl]
2 [section foldl]
7 struct foldl;
20 `foldl` applies `P` on the input string repeatedly as long as `P` accepts the
25 When `P` rejects the input for the first time, `foldl` still accepts the input
28 Here is a diagram showing how `foldl` works by example:
35 Further details can be found in the [link introducing-foldl Introducing foldl]
40 #include <boost/metaparse/foldl.hpp>
47 foldl<p, t, f>::apply<s, pos>
64 #include <boost/metaparse/foldl.hpp>
[all …]
|
| /dports/databases/couchdb3/apache-couchdb-3.2.1/src/couch/src/ |
| H A D | couch_bt_engine_stream.erl | 16 foldl/3,
24 foldl({_Fd, []}, _Fun, Acc) -> function
27 foldl({Fd, [{Pos, _} | Rest]}, Fun, Acc) -> function
28 foldl({Fd, [Pos | Rest]}, Fun, Acc);
30 foldl({Fd, [Bin | Rest]}, Fun, Acc) when is_binary(Bin) -> function
33 foldl({Fd, Rest}, Fun, Fun(Bin, Acc));
35 foldl({Fd, [Pos | Rest]}, Fun, Acc) when is_integer(Pos) -> function
37 foldl({Fd, Rest}, Fun, Fun(Bin, Acc)).
|
| H A D | couch_stream.erl | 27 foldl/3,
28 foldl/4,
79 foldl(Src, fun(Bin, _) ->
94 foldl({Engine, EngineState}, Fun, Acc) -> function
95 Engine:foldl(EngineState, Fun, Acc).
98 foldl(Engine, <<>>, Fun, Acc) -> function
99 foldl(Engine, Fun, Acc);
100 foldl(Engine, Md5, UserFun, UserAcc) -> function
102 {Md5Acc, _, OutAcc} = foldl(Engine, fun foldl_md5/2, InitAcc),
113 {_, _, UserAcc2} = foldl(Engine, Md5, fun foldl_decode/2, InitAcc),
[all …]
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/monoid-subclasses-1.1/src/Data/Semigroup/ |
| H A D | Factorial.hs | 88 foldl f f0 = List.foldl f f0 . factors function
141 foldl f a0 (x, y) = foldl f2 (foldl f1 a0 x) y function
173 foldl f s0 (a, b, c) = foldl f3 (foldl f2 (foldl f1 s0 a) b) c function
216 foldl f s0 (a, b, c, d) = foldl f4 (foldl f3 (foldl f2 (foldl f1 s0 a) b) c) d function
277 foldl f = ByteString.foldl f' function
299 foldl f = Text.foldl f' function
312 foldl f = LazyText.foldl f' function
357 foldl f = IntSet.foldl f' function
370 foldl f = Foldable.foldl f' function
385 foldl f = Foldable.foldl f' function
[all …]
|
| /dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/diameter/test/ |
| H A D | diameter_enum.erl | 75 foldl/3,
157 [Ord | Divs] = lists:foldl(fun(F,[D|_] = A) -> [F(0)*D | A] end, [1], L),
166 {Vs, []} = lists:foldl(fun(F, {A, [D|Ds]}) ->
201 [Ord | Os] = lists:foldl(fun(E, [N|_] = A) -> [N+E(0)|A] end, [0], Es),
308 foldl(fun(N,ok) -> Fun(N), ok end, ok, E).
317 foldl(Fun, Acc, E) -> function
318 foldl(E(0), 1, Fun, Acc, E).
320 foldl(M, N, _, Acc, _) function
323 foldl(M, N, Fun, Acc, E) -> function
324 foldl(M, N+1, Fun, Fun(E(N), Acc), E).
[all …]
|
| /dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/diameter/test/ |
| H A D | diameter_enum.erl | 75 foldl/3,
157 [Ord | Divs] = lists:foldl(fun(F,[D|_] = A) -> [F(0)*D | A] end, [1], L),
166 {Vs, []} = lists:foldl(fun(F, {A, [D|Ds]}) ->
201 [Ord | Os] = lists:foldl(fun(E, [N|_] = A) -> [N+E(0)|A] end, [0], Es),
308 foldl(fun(N,ok) -> Fun(N), ok end, ok, E).
317 foldl(Fun, Acc, E) -> function
318 foldl(E(0), 1, Fun, Acc, E).
320 foldl(M, N, _, Acc, _) function
323 foldl(M, N, Fun, Acc, E) -> function
324 foldl(M, N+1, Fun, Fun(E(N), Acc), E).
[all …]
|
| /dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/diameter/test/ |
| H A D | diameter_enum.erl | 75 foldl/3,
157 [Ord | Divs] = lists:foldl(fun(F,[D|_] = A) -> [F(0)*D | A] end, [1], L),
166 {Vs, []} = lists:foldl(fun(F, {A, [D|Ds]}) ->
201 [Ord | Os] = lists:foldl(fun(E, [N|_] = A) -> [N+E(0)|A] end, [0], Es),
308 foldl(fun(N,ok) -> Fun(N), ok end, ok, E).
317 foldl(Fun, Acc, E) -> function
318 foldl(E(0), 1, Fun, Acc, E).
320 foldl(M, N, _, Acc, _) function
323 foldl(M, N, Fun, Acc, E) -> function
324 foldl(M, N+1, Fun, Fun(E(N), Acc), E).
[all …]
|
| /dports/lang/erlang-wx/otp-OTP-24.1.7/lib/diameter/test/ |
| H A D | diameter_enum.erl | 75 foldl/3,
157 [Ord | Divs] = lists:foldl(fun(F,[D|_] = A) -> [F(0)*D | A] end, [1], L),
166 {Vs, []} = lists:foldl(fun(F, {A, [D|Ds]}) ->
201 [Ord | Os] = lists:foldl(fun(E, [N|_] = A) -> [N+E(0)|A] end, [0], Es),
308 foldl(fun(N,ok) -> Fun(N), ok end, ok, E).
317 foldl(Fun, Acc, E) -> function
318 foldl(E(0), 1, Fun, Acc, E).
320 foldl(M, N, _, Acc, _) function
323 foldl(M, N, Fun, Acc, E) -> function
324 foldl(M, N+1, Fun, Fun(E(N), Acc), E).
[all …]
|
| /dports/lang/erlang/otp-OTP-24.1.7/lib/diameter/test/ |
| H A D | diameter_enum.erl | 75 foldl/3,
157 [Ord | Divs] = lists:foldl(fun(F,[D|_] = A) -> [F(0)*D | A] end, [1], L),
166 {Vs, []} = lists:foldl(fun(F, {A, [D|Ds]}) ->
201 [Ord | Os] = lists:foldl(fun(E, [N|_] = A) -> [N+E(0)|A] end, [0], Es),
308 foldl(fun(N,ok) -> Fun(N), ok end, ok, E).
317 foldl(Fun, Acc, E) -> function
318 foldl(E(0), 1, Fun, Acc, E).
320 foldl(M, N, _, Acc, _) function
323 foldl(M, N, Fun, Acc, E) -> function
324 foldl(M, N+1, Fun, Fun(E(N), Acc), E).
[all …]
|
| /dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/diameter/test/ |
| H A D | diameter_enum.erl | 75 foldl/3,
157 [Ord | Divs] = lists:foldl(fun(F,[D|_] = A) -> [F(0)*D | A] end, [1], L),
166 {Vs, []} = lists:foldl(fun(F, {A, [D|Ds]}) ->
201 [Ord | Os] = lists:foldl(fun(E, [N|_] = A) -> [N+E(0)|A] end, [0], Es),
308 foldl(fun(N,ok) -> Fun(N), ok end, ok, E).
317 foldl(Fun, Acc, E) -> function
318 foldl(E(0), 1, Fun, Acc, E).
320 foldl(M, N, _, Acc, _) function
323 foldl(M, N, Fun, Acc, E) -> function
324 foldl(M, N+1, Fun, Fun(E(N), Acc), E).
[all …]
|
| /dports/lang/erlang-java/otp-OTP-24.1.7/lib/diameter/test/ |
| H A D | diameter_enum.erl | 75 foldl/3,
157 [Ord | Divs] = lists:foldl(fun(F,[D|_] = A) -> [F(0)*D | A] end, [1], L),
166 {Vs, []} = lists:foldl(fun(F, {A, [D|Ds]}) ->
201 [Ord | Os] = lists:foldl(fun(E, [N|_] = A) -> [N+E(0)|A] end, [0], Es),
308 foldl(fun(N,ok) -> Fun(N), ok end, ok, E).
317 foldl(Fun, Acc, E) -> function
318 foldl(E(0), 1, Fun, Acc, E).
320 foldl(M, N, _, Acc, _) function
323 foldl(M, N, Fun, Acc, E) -> function
324 foldl(M, N+1, Fun, Fun(E(N), Acc), E).
[all …]
|
| /dports/math/teyjus/teyjus-2.1-7-ge63f40a/source/test/system_tests/funs/ |
| H A D | funs.mod | 6 type foldl (A -> B -> A) -> A -> list B -> A -> o.
23 % "fold" a list to the left. That is, foldl atoms of the following
25 % foldl F Init (X1 :: X2 :: ... :: Xn :: nil)
28 foldl F X nil X.
29 (foldl F X (W :: L) (F Y W)) :- (foldl F X L Y).
|
| /dports/math/teyjus/teyjus-2.1-7-ge63f40a/examples/misc/ |
| H A D | funs.mod | 5 type foldl (A -> B -> A) -> A -> list B -> A -> o.
22 % "fold" a list to the left. That is, foldl atoms of the following
24 % foldl F Init (X1 :: X2 :: ... :: Xn :: nil)
27 foldl F X nil X.
28 (foldl F X (W :: L) (F Y W)) :- (foldl F X L Y).
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/ghc-exactprint-0.6.4/tests/examples/ghc710/ |
| H A D | Undefined3.hs | 60 import Prelude hiding (foldl, foldr, foldl1, foldr1, mapM_, sequence_,
63 import qualified Prelude (foldl, foldr, foldl1, foldr1)
116 foldr' f z0 xs = foldl f' id xs z0
122 foldl :: (b -> a -> b) -> b -> t a -> b
150 (foldl mf Nothing xs)
162 foldl _ z Nothing = z function
163 foldl f z (Just x) = f z x function
167 foldl = Prelude.foldl function
186 foldl f z = Prelude.foldl f z . elems function
197 foldl _ z _ = z function
[all …]
|
| /dports/benchmarks/tsung/tsung-1.7.0/src/tsung_controller/ |
| H A D | ts_config.erl | 106 lists:foldl(fun parse/2,
119 lists:foldl(fun parse/2,
184 lists:foldl(fun parse/2,
285 lists:foldl(fun parse/2,
314 lists:foldl(fun parse/2,
334 lists:foldl(fun parse/2,
349 lists:foldl(fun parse/2,
392 lists:foldl(fun parse/2,
425 lists:foldl(fun parse/2,
455 lists:foldl(fun parse/2,
[all …]
|
| /dports/lang/mosml/mosml-ver-2.10.1/src/doc/helpsigs/ |
| H A D | Parsspec.sml | 48 :: foldl conbind res cbs
55 VALspec vs => foldl valdesc res vs
56 | PRIM_VALspec pvs => foldl pvaldesc res pvs
57 | TYPEDESCspec (tnEqu, tyds) => foldl typdesc res tyds
58 | TYPEspec tybs => foldl typbind res tybs
60 foldl datbind (foldl typbind res (getOpt(tybsOpt, []))) dbs
62 | EXCEPTIONspec eds => foldl exdesc res eds
82 val res = foldl (processSpec is str) initialbase specs
|
| /dports/www/hs-postgrest/postgrest-8.0.0/_cabal_deps/bytestring-tree-builder-0.2.7.9/library/ByteString/TreeBuilder/ |
| H A D | Tree.hs | 3 import ByteString.TreeBuilder.Prelude hiding (foldl, foldr, foldlM, length)
18 foldl :: (a -> ByteString -> a) -> a -> Tree -> a
19 foldl step init = function
26 foldl step (foldl step init tree1) tree2
|
| /dports/lang/ghc/ghc-8.10.7/libraries/base/Data/ |
| H A D | Foldable.hs | 164 foldr' f z0 xs = foldl f' id xs z0
304 foldl _ z Nothing = z function
305 foldl f z (Just x) = f z x function
310 foldl = List.foldl function
326 foldl f z (a :| as) = List.foldl f (f z a) as function
373 foldl = foldlElems function
390 foldl _ z _ = z function
405 foldl = coerce function
424 foldl = coerce function
443 foldl = coerce function
[all …]
|
| /dports/devel/hs-hoogle/hoogle-5.0.18.2/_cabal_deps/ListLike-4.7.3/src/Data/ListLike/ |
| H A D | FoldableLL.hs | 34 import Prelude hiding (foldl, foldr, foldr1, sequence_, mapM_, foldMap)
48 foldl :: (a -> item -> a) -> a -> full -> a
61 (foldl mf Nothing xs)
70 foldr' f a xs = foldl f' id xs a
91 foldl = L.foldl function
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/test/CodeGenCXX/ |
| H A D | cxx1z-fold-expression.cpp | 5 template<int ...N> void foldl(A<(... + N)>);
10 foldl<1, 2, 3>({}); in use()
26 template<int ...B> void foldl(Foldl<A..., B..., A..., B...>);
32 p.foldl<3, 4>({}); in use()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/hana/benchmark/fold_left/ |
| H A D | compile.cexpr.recursive.erb.cpp | 24 constexpr auto foldl(F f, State s, list<X, Xs...> xs) in foldl() function
25 { return foldl(f, f(s, head(xs)), tail(xs)); } in foldl()
28 constexpr auto foldl(F, State s, list<>) in foldl() function
51 constexpr auto result = foldl(f{}, state{}, xs); in main()
|