PackagesReroutesAboutlamdera.com

truqu/elm-dictset/1.0.3

NOTE: this package is not compatible with Elm 0.19.1

READMEAboutVersionsSourceModules

DictSet

A set of unique values. The values can be any type, and the comparison is done using a function compare : value -> comparable.

Insert, remove, and query operations all take O(log n) time.

Sets

type alias DictSet comparable a =
DictSet comparable a

Represents a set of unique values together with the compare function

Build

empty : (a -> comparable) -> DictSet comparable a

Create an empty set

singleton : (a -> comparable) -> a -> DictSet comparable a

Create a set with one value

insert : a -> DictSet comparable a -> DictSet comparable a

Insert a new value into a set

remove : a -> DictSet comparable a -> DictSet comparable a

Remove a value from a set

Query

isEmpty : DictSet comparable a -> Bool

Determine if a set is empty

member : a -> DictSet comparable a -> Bool

Determine if a value is in a set

size : DictSet comparable a -> Int

Determine the number of elements in a set

Combine

DictSet comparable a
-> DictSet comparable a
-> DictSet comparable a

Get the union of two sets. Keep all values.

DictSet comparable a
-> DictSet comparable a
-> DictSet comparable a

Get the intersection of two sets. Keeps values that appear in both sets.

DictSet comparable a
-> DictSet comparable a
-> DictSet comparable a

Get the difference between the first set and the second. Keeps values that do not appear in the second set.

Lists

toList : DictSet comparable a -> List a

Convert a set into a list.

fromList : (a -> comparable) -> List a -> DictSet comparable a

Convert a list into a set, removing any duplicates.

Transform

map :
(b -> comparable)
-> (a -> b)
-> DictSet comparable a
-> DictSet comparable b

Map a function onto a set, creating a new set with no duplicates.

foldl : (a -> b -> b) -> b -> DictSet comparable a -> b

Fold over the values in a set, in order from lowest to highest.

foldr : (a -> b -> b) -> b -> DictSet comparable a -> b

Fold over the values in a set, in order from highest to lowest.

filter : (a -> Bool) -> DictSet comparable a -> DictSet comparable a

Create a new set consisting only of elements which satisfy a predicate.

(a -> Bool)
-> DictSet comparable a
-> ( DictSet comparable a, DictSet comparable a )

Create two new sets; the first consisting of elements which satisfy a

Modules

About this package serverReroutesreroutes.json
Pages and docs rendering from package.elm-lang.org, © 2012-2020 Evan Czaplicki. © 2026 Lamdera