Combinatorics<T> class abstract

The base class for the other classes in this library.

Implementers

• Amalgams
• Combinations
• Compositions
• Compounds
• Permutations
• Subsets

Constructors

Combinatorics()

Properties

hashCode → int

The hash code for this object.

no setter, inherited

items → List<T>

The list from which the objects are selected

no setter

iterable → Iterable

An Iterable object that "contains" all the arrangements.

no setter

length → BigInt

The number of arrangements "contained" in this pseudo-list.

no setter

runtimeType → Type

A representation of the runtime type of the object.

no setter, inherited

Methods

call([Object? fromTo, Object? to]) → Iterable<List<T>>

contains(List<T> arrangement) → bool

Whether the structure contains arrangement.

indexOf(List<T> arrangement, [BigInt? start]) → BigInt

The index of arrangement.

noSuchMethod(Invocation invocation) → dynamic

Invoked when a nonexistent method or property is accessed.

inherited

range(Object fromTo, [Object? to]) → Iterable<List<T>>

Returns a range of arrangements.

sample(int n, {int? seed, bool withReplacement = false}) → Iterable

Generates a random sample of arrangements from this pseudo-list.

toString() → String

A string representation of this object.

inherited

Operators

operator ==(Object other) → bool

The equality operator.

inherited

operator [](Object k) → List<T>

The kth arrangement.