DistinctListModule

Returns the refined value as a standard list.

Admits a list, failing when it holds duplicates.

Removes duplicates rather than rejecting them, preserving first-seen order. Total.

The list with no items.

Returns the number of items as a plain int.

Returns whether the item is present.

Builds a map keyed by a projection of each item, failing when the projection sends two items to the same key. Distinct items do not imply distinct projections.

Builds a map from a distinct list of pairs, failing when two pairs share a key.

Builds a set. Total and lossless — this is the operation that justifies the type, because distinct items always produce a set of the same size, while Set.ofList on an ordinary list silently collapses duplicates.

Adds an item, ignoring it when already present. Total.

Removes an item. Total.

Returns the items of either list, without duplicates. Total.

Returns the items present in both lists. Total.

Returns the items of the first list absent from the second. Total.

Keeps the matching items. Total — filtering cannot introduce duplicates.

Applies a mapping and removes any duplicates it introduces, since a mapping need not be injective. Total.

Keeps the chosen items, removing any duplicates the chooser introduces. Total.

Reorders the items. Total — reordering cannot introduce duplicates.

Reorders the items by a projected key. Total.

Reverses the order of the items. Total.

Keeps at most the first count items. Total.

Returns whether the list has no items.

Returns the first item, if any. Distinctness says nothing about emptiness.

Returns whether any item satisfies the predicate.

Returns whether every item satisfies the predicate.

Returns the first matching item, if any.

Returns the first item the chooser accepts, if any.

Applies an action to every item.

Folds over the items from an explicit seed.

Adds every item, matching List.sum.

Adds a projection of every item, matching List.sumBy.