Defined in awkward.operations.ak_argcombinations on line 11.
- ak.argcombinations(array, n, *, replacement=False, axis=1, fields=None, parameters=None, with_name=None, highlevel=True, behavior=None)#
array – Array-like data (anything
n (int) – The number of items to choose from each list:
2chooses unique pairs,
3chooses unique triples, etc.
replacement (bool) – If True, combinations that include the same item more than once are allowed; otherwise each item in a combinations is strictly unique.
axis (int) – The dimension at which this operation is applied. The outermost dimension is
0, followed by
1, etc., and negative values count backward from the innermost:
-1is the innermost dimension,
-2is the next level up, etc.
fields (None or list of str) – If None, the pairs/triples/etc. are tuples with unnamed fields; otherwise, these
fieldsname the fields. The number of
fieldsmust be equal to
parameters (None or dict) – Parameters for the new
ak.contents.RecordArraynode that is created by this operation.
with_name (None or str) – Assigns a
"__record__"name to the new
ak.contents.RecordArraynode that is created by this operation (overriding
parameters, if necessary).
highlevel (bool) – If True, return an
ak.Array; otherwise, return a low-level
behavior (None or dict) – Custom
ak.behaviorfor the output array, if high-level.
Computes a Cartesian product (i.e. cross product) of
array with itself
that is restricted to combinations sampled without replacement,
ak.combinations, but returning integer indexes for
The motivation and uses of this function are similar to those of
ak.argcartesian for a more