- chain
- compact
- difference
- elem
- empty
- every
- filter
- filterMap
- insert
- intersection
- isEmpty
- isSubset
- map
- partition
- partitionMap
- remove
- separate
- size
- some
subset(deprecated)- toggle
- union
export declare const getDifferenceMagma: <A>(E: Eq<A>) => Magma<Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getEq: <A>(E: Eq<A>) => Eq<Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getIntersectionSemigroup: <A>(E: Eq<A>) => Semigroup<Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getShow: <A>(S: Show<A>) => Show<Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getUnionMonoid: <A>(E: Eq<A>) => Monoid<Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getUnionSemigroup: <A>(E: Eq<A>) => Semigroup<Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Create a set with one element
export declare const singleton: <A>(a: A) => Set<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Create a set from an array
export declare const fromArray: <A>(E: Eq<A>) => (as: A[]) => Set<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Get a sorted Array
of the values contained in a Set
.
export declare const toArray: <A>(O: Ord<A>) => (set: Set<A>) => A[]
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const foldMap: <A, M>(O: Ord<A>, M: Monoid<M>) => (f: (a: A) => M) => (fa: Set<A>) => M
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const reduce: <A>(O: Ord<A>) => <B>(b: B, f: (b: B, a: A) => B) => (fa: Set<A>) => B
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const reduceRight: <A>(O: Ord<A>) => <B>(b: B, f: (a: A, b: B) => B) => (fa: Set<A>) => B
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Composes computations in sequence, using the return value of one computation to determine the next computation.
export declare function chain<B>(E: Eq<B>): <A>(f: (x: A) => Set<B>) => (set: Set<A>) => Set<B>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const compact: <A>(E: Eq<A>) => (fa: Set<Option<A>>) => Set<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Form the set difference (x
- y
)
export declare function difference<A>(E: Eq<A>): {
(that: Set<A>): (me: Set<A>) => Set<A>
(me: Set<A>, that: Set<A>): Set<A>
}
- Added in 0.1.0
import { difference } from '@fp-tx/core/Set'
import * as N from '@fp-tx/core/number'
import { pipe } from '@fp-tx/core/function'
assert.deepStrictEqual(pipe(new Set([1, 2]), difference(N.Eq)(new Set([1, 3]))), new Set([2]))
- MIT – Copyright (c) 2017-present Giulio Canti
Test if a value is a member of a set
export declare const elem: <A>(E: Eq<A>) => {
(a: A): (set: Set<A>) => boolean
(a: A, set: Set<A>): boolean
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const empty: Set<never>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const every: {
<A, B extends A>(refinement: Refinement<A, B>): Refinement<Set<A>, Set<B>>
<A>(predicate: Predicate<A>): Predicate<Set<A>>
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function filter<A, B extends A>(refinement: Refinement<A, B>): (set: Set<A>) => Set<B>
export declare function filter<A>(predicate: Predicate<A>): <B extends A>(set: Set<B>) => Set<B>
export declare function filter<A>(predicate: Predicate<A>): (set: Set<A>) => Set<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function filterMap<B>(E: Eq<B>): <A>(f: (a: A) => Option<B>) => (fa: Set<A>) => Set<B>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Insert a value into a set
export declare function insert<A>(E: Eq<A>): (a: A) => (set: Set<A>) => Set<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
The set of elements which are in both the first and second set
export declare function intersection<A>(E: Eq<A>): {
(that: Set<A>): (me: Set<A>) => Set<A>
(me: Set<A>, that: Set<A>): Set<A>
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Test whether a Set
is empty.
export declare const isEmpty: <A>(set: Set<A>) => boolean
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const isSubset: <A>(E: Eq<A>) => (that: Set<A>) => (me: Set<A>) => boolean
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
map
can be used to turn functions (a: A) => B
into functions (fa: F<A>) => F<B>
whose argument and return types use the type constructor F
to represent some computational context.
export declare function map<B>(E: Eq<B>): <A>(f: (x: A) => B) => (set: Set<A>) => Set<B>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function partition<A, B extends A>(
refinement: Refinement<A, B>,
): (set: Set<A>) => Separated<Set<A>, Set<B>>
export declare function partition<A>(predicate: Predicate<A>): <B extends A>(set: Set<B>) => Separated<Set<B>, Set<B>>
export declare function partition<A>(predicate: Predicate<A>): (set: Set<A>) => Separated<Set<A>, Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function partitionMap<B, C>(
EB: Eq<B>,
EC: Eq<C>,
): <A>(f: (a: A) => Either<B, C>) => (set: Set<A>) => Separated<Set<B>, Set<C>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Delete a value from a set
export declare const remove: <A>(E: Eq<A>) => (a: A) => (set: Set<A>) => Set<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function separate<E, A>(EE: Eq<E>, EA: Eq<A>): (fa: Set<Either<E, A>>) => Separated<Set<E>, Set<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Calculate the number of elements in a Set
.
export declare const size: <A>(set: Set<A>) => number
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const some: <A>(predicate: Predicate<A>) => (set: Set<A>) => boolean
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Use isSubset
instead.
export declare const subset: <A>(E: Eq<A>) => {
(that: Set<A>): (me: Set<A>) => boolean
(me: Set<A>, that: Set<A>): boolean
}
- Added in 0.1.0
- Deprecated
- MIT – Copyright (c) 2017-present Giulio Canti
Checks an element is a member of a set; If yes, removes the value from the set If no, inserts the value to the set
export declare const toggle: <A>(E: Eq<A>) => (a: A) => (set: Set<A>) => Set<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Form the union of two sets
export declare function union<A>(E: Eq<A>): {
(that: Set<A>): (me: Set<A>) => Set<A>
(me: Set<A>, that: Set<A>): Set<A>
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti