: list list -> listval Stdlib.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Stdlib.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Stdlib.ListLabels.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Stdlib.ListLabels.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Alist.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val CList.concat : 'a list list -> 'a list
Like OCaml's List.concat but tail-recursive.
val Alist.flatten : 'a list list -> 'a list
An alias for concat.
val CList.flatten : 'a list list -> 'a list
Synonymous of concat
val BatList.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Tail-recursive.
val BatList.flatten : 'a list list -> 'a list
Same as concat.
val Core.List.join : 'a list list -> 'a list
join t is t >>= (fun t' -> t').
val Fmlib.List.join : 'a list list -> 'a list
join is the same as concat.
val Core.List.concat : 'a list list -> 'a list
Concatenates a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Tail recursive over outer and inner lists.
val Fsml.Tevents.merge : t list list -> t list
merge [st1; ...: stn] merges n sequences of TES wrt. clock cycles. In other words, merge [l1; l2; ...; ln] is l1 @@@ l2 @@@ ... @@@ ln.
val Util.List.concat : 'a list list -> 'a list
Like OCaml's List.concat but tail-recursive.
val Util.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Cpm.MyList.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Tail-recursive.
val Fmlib.List.concat : 'a list list -> 'a list
concat ll concatenates all lists contained in the list of lists ll.
val Util.List.flatten : 'a list list -> 'a list
Synonymous of concat
val Util.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val BatList.transpose : 'a list list -> 'a list list
Transposes a list of lists, turning rows of the input into columns of the output and vice versa.
val Cpm.MyList.flatten : 'a list list -> 'a list
Same as concat.
val Nonstd.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val B00_std.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val CList.combinations : 'a list list -> 'a list list
combinations l returns the list of n_1 * ... * n_p tuples [a11;...;ap1];...;[a1n_1;...;apn_pd] whenever l is a list [a11;..;a1n_1];...;[ap1;apn_p]; otherwise said, it is cartesians (::) [] l
val Nonstd.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val B00_std.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Exifutil.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Molenc.MyList.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Tail-recursive.
val Exifutil.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Molenc.MyList.flatten : 'a list list -> 'a list
Same as concat.
val Core.List.all_unit : unit list list -> unit list
Like all, but ensures that every monadic value in the list produces a unit value, all of which are discarded rather than being collected into a list.
val Ocsigen_lib.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Ocsigen_lib.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Core.List.concat_no_order : 'a list list -> 'a list
Like concat, but faster and without preserving any ordering (i.e., for lists that are essentially viewed as multi-sets).
val Cpm.MyList.transpose : 'a list list -> 'a list list
Transposes a list of lists, turning rows of the input into columns of the output and vice versa.
val Fmlib.List.transpose : 'a list list -> 'a list list
transpose list_of_rows returns the list of columns.
val Ppxx.Utils.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val BatList.n_cartesian_product : 'a list list -> 'a list list
Given n lists, return the n-way cartesian product of these lists. Given [a;b];[c];[d;e;f], returns [a;c;d];[a;c;e];[a;c;f];[b;c;d];[b;c;e];[b;c;f], all ways of choosing one element from each input list.
val Ocsigen_lib_base.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Ppxx.Utils.List.flatten : 'a list list -> 'a list
An alias for concat.
val Util.List.combinations : 'a list list -> 'a list list
combinations l returns the list of n_1 * ... * n_p tuples [a11;...;ap1];...;[a1n_1;...;apn_pd] whenever l is a list [a11;..;a1n_1];...;[ap1;apn_p]; otherwise said, it is cartesians (::) [] l
val Binsec.List_utils.rev_flatten : 'a list list -> 'a list
rev_flatten l reverses and flatten the list of list l at the same time. It is the same as doing List.flatten l |> List.rev but tail-recursive and more efficient. *
val Core.List.transpose_exn : 'a list list -> 'a list list
transpose_exn transposes the rows and columns of its argument, throwing an exception if the list is not rectangular.
val Molenc.MyList.transpose : 'a list list -> 'a list list
Transposes a list of lists, turning rows of the input into columns of the output and vice versa.
val Ocsigen_lib_base.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Patutil.Extra.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Utils.ListExt.cart_prodn : 'a list list -> 'a list list
gen_cart_prod computes the n-ary cartesian product of lists.
val Alcotest_stdlib_ext.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Patutil.Extra.List.flatten : 'a list list -> 'a list
An alias for concat.
val Alcotest_stdlib_ext.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val BatteriesExceptionless.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Tail-recursive.
val BatteriesExceptionless.List.flatten : 'a list list -> 'a list
Same as concat.
val Links_lens.Utility.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Cpm.MyList.n_cartesian_product : 'a list list -> 'a list list
Given n lists, return the n-way cartesian product of these lists. Given [a;b];[c];[d;e;f], returns [a;c;d];[a;c;e];[a;c;f];[b;c;d];[b;c;e];[b;c;f], all ways of choosing one element from each input list.
val Links_core.Notfound.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Links_lens.Utility.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Ocaml_webworker.Std.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Core.List.Cartesian_product.join : 'a list list -> 'a list
join t is t >>= (fun t' -> t').
val Links_core.Notfound.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Ocaml_webworker.Std.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Molenc.MyList.n_cartesian_product : 'a list list -> 'a list list
Given n lists, return the n-way cartesian product of these lists. Given [a;b];[c];[d;e;f], returns [a;c;d];[a;c;e];[a;c;f];[b;c;d];[b;c;e];[b;c;f], all ways of choosing one element from each input list.
val Ppx_deriving_yojson_runtime.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val OpamStd.Format.align_table : string list list -> string list list
Pads fields in a table with spaces for alignment.
val OpamStd.Format.align_table : string list list -> string list list
Pads fields in a table with spaces for alignment.
val Ppx_deriving_yojson_runtime.List.flatten : 'a list list -> 'a list
An alias for concat.
val Jhupllib_utils.cartesian_product_of_list : 'a list list -> 'a list list
Expands a list of lists as a Cartesian product. That is, the list
val Ppx_deriving_cmdliner_runtime.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Links_core.Notfound.ListLabels.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Ppx_deriving_cmdliner_runtime.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val BatteriesExceptionless.List.transpose : 'a list list -> 'a list list
Transposes a list of lists, turning rows of the input into columns of the output and vice versa.
val Irmin.Export_for_backends.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Links_core.Notfound.ListLabels.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Plebeia.Internal.Utils.List.concat : 'a list list -> 'a list
Tail recursive
val Core.List.Cartesian_product.all_unit : unit list list -> unit list
Like all, but ensures that every monadic value in the list produces a unit value, all of which are discarded rather than being collected into a list.
val Links_core.Lens.Utility.List.concat : 'a list list -> 'a list
Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list).
val Links_core.Lens.Utility.List.flatten : 'a list list -> 'a list
Same as concat. Not tail-recursive (length of the argument + length of the longest sub-list).
val Plebeia.Internal.Utils.List.rev_concat : 'a list list -> 'a list
Reversed versio of concat. Tail recursive
val Plebeia.Internal.Test_utils.List.concat : 'a list list -> 'a list
Tail recursive
val BatteriesExceptionless.List.n_cartesian_product : 'a list list -> 'a list list
Given n lists, return the n-way cartesian product of these lists. Given [a;b];[c];[d;e;f], returns [a;c;d];[a;c;e];[a;c;f];[b;c;d];[b;c;e];[b;c;f], all ways of choosing one element from each input list.
val Plebeia.Internal.Test_utils.List.rev_concat : 'a list list -> 'a list
Reversed versio of concat. Tail recursive
val Zmatching.PATTERN_CHECKER.matD : 'a Zmatching.pattern list list -> 'a Zmatching.pattern list list
Implementation of D(p) as described in the paper's first part.
val Irmin_traces.Trace_stat_summary_pp.Pb.matrix_with_column_spacers : PrintBox.t list list -> PrintBox.t list list
Dirty trick to only have vertical bars, and not the horizontal ones
val Orgeat.Misc.pp_tree : string -> string list list -> string list
pp_tree root_tag sub_trees prints a tree, from a tag for the root root_tag, and a list of sub-trees, each represented by its list of lines to print.
val Libzipperposition_calculi.Simplex.Make.apply_optims : (t -> optim list) list -> t -> optim list
Apply the given optimizations to the simplex.
val Ppxx.Graph.Make.div_by_components : G.t -> G.v list list -> (G.v list * G.v list list) list
Get edges of graph divided by components. Each components must be non empty. They must be distinct each other.
val Libzipperposition_calculi.Simplex.MakeHelp.apply_optims : (t -> optim list) list -> t -> optim list
Apply the given optimizations to the simplex.
val CList.cartesians : ('a -> 'b -> 'b) -> 'b -> 'a list list -> 'b list
cartesians op init l is an n-ary cartesian product: it builds the list of all op a1 .. (op an init) .. for a1, ..., an in the product of the elements of the lists
val Util.List.cartesians : ('a -> 'b -> 'b) -> 'b -> 'a list list -> 'b list
cartesians op init l is an n-ary cartesian product: it builds the list of all op a1 .. (op an init) .. for a1, ..., an in the product of the elements of the lists
val CList.cartesians_filter : ('a -> 'b -> 'b option) -> 'b -> 'a list list -> 'b list
Like cartesians op init l but keep only the tuples for which op returns Some _ on all the elements of the tuple.
val Util.List.cartesians_filter : ('a -> 'b -> 'b option) -> 'b -> 'a list list -> 'b list
Like cartesians op init l but keep only the tuples for which op returns Some _ on all the elements of the tuple.
val Core.List.transpose : 'a list list -> 'a list list option
transpose m transposes the rows and columns of the matrix m, considered as either a row of column lists or (dually) a column of row lists.
val Links_core.Graph.topo_sort_sccs : ('a * 'a list) list -> 'a list list
topo_sort_sccs: given a graph in adjacency-list representation, find all the sccs and topologically sort them; return the result as a list of sccs, the sccs represented as the list of their members.
val Tsort.find_strongly_connected_components : ('a * 'a list) list -> 'a list list
Partition a graph into its strongly-connected components: Two vertices u, v belong to the same component iff there's a path from u to v and there's a path from v to u.
val Tsort.sort_strongly_connected_components : ('a * 'a list) list -> 'a list list
Perform a topological sort on a directed graph that may have cycles. Uses find_strongly_connected_components and sort.
val Links_core.Graph.unroll_edges : ('a * 'b list) list -> ('a * 'b) list
unroll_edges: given an alist that maps an x to a list nbhd(x) of the same type, return a list of all the pairs (u, v) where v \in nbhd(u)
val Tsort.find_nonexistent_nodes : ('a * 'a list) list -> ('a * 'a list) list
Report nodes that have non-existent dependencies. This is useful for detecting user-entry errors, since the other functions of the module silently add missing nodes to the graph.
val Atd.Sort.Make.sort : (P.t * P.id list) list -> (bool * P.t list) list
Partition the nodes of a directed graph into groups and sort these groups such that all edges going from one group to another point to the right, and such that each group has a single element or is a cycle. A cyclic group is marked as true while non-cyclic singletons are marked as false.
val Ezxmlm.filter_attrs : string -> string -> (Xmlm.attribute list * nodes) list -> (Xmlm.attribute list * nodes) list
Given some selected attributes and nodes (usually from members_with_attr) return the ones that match the class and value supplied.
val Ezxmlm.filter_attr : string -> string -> (Xmlm.attribute list * nodes) list -> (Xmlm.attribute list * nodes)
Given some selected attributes and nodes (usually from members_with_attr) return the first that matches the class and value supplied. Raises Not_found if nothing matches.