- chain
- compact
- difference
- elem
- empty
- every
- filter
- filterMap
- foldMap
fromArray(deprecated)- insert
- intersection
- isEmpty
- isSubset
- map
- partition
- partitionMap
- reduce
- remove
- separate
- size
- some
- toggle
- union
export declare const getDifferenceMagma: <A>(E: Eq<A>) => Magma<ReadonlySet<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function getEq<A>(E: Eq<A>): Eq<ReadonlySet<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getIntersectionSemigroup: <A>(E: Eq<A>) => Semigroup<ReadonlySet<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function getShow<A>(S: Show<A>): Show<ReadonlySet<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getUnionMonoid: <A>(E: Eq<A>) => Monoid<ReadonlySet<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const getUnionSemigroup: <A>(E: Eq<A>) => Semigroup<ReadonlySet<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) => ReadonlySet<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Create a ReadonlySet
from a ReadonlyArray
export declare const fromReadonlyArray: <A>(E: Eq<A>) => (as: readonly A[]) => ReadonlySet<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const fromSet: <A>(s: Set<A>) => ReadonlySet<A>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Get a sorted ReadonlyArray
of the values contained in a ReadonlySet
.
export declare const toReadonlyArray: <A>(O: Ord<A>) => (set: ReadonlySet<A>) => readonly A[]
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function toSet<A>(s: ReadonlySet<A>): Set<A>
- 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: ReadonlySet<A>) => B
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export type URI = typeof URI
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const URI = 'ReadonlySet'
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function chain<B>(E: Eq<B>): <A>(f: (x: A) => ReadonlySet<B>) => (set: ReadonlySet<A>) => ReadonlySet<B>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const compact: <A>(E: Eq<A>) => (fa: ReadonlySet<Option<A>>) => ReadonlySet<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: ReadonlySet<A>): (me: ReadonlySet<A>) => ReadonlySet<A>
(me: ReadonlySet<A>, that: ReadonlySet<A>): ReadonlySet<A>
}
- Added in 0.1.0
import { difference } from '@fp-tx/core/ReadonlySet'
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 function elem<A>(E: Eq<A>): {
(a: A): (set: ReadonlySet<A>) => boolean
(a: A, set: ReadonlySet<A>): boolean
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const empty: ReadonlySet<never>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function every<A, B extends A>(refinement: Refinement<A, B>): Refinement<ReadonlySet<A>, ReadonlySet<B>>
export declare function every<A>(predicate: Predicate<A>): Predicate<ReadonlySet<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: ReadonlySet<A>) => ReadonlySet<B>
export declare function filter<A>(predicate: Predicate<A>): <B extends A>(set: ReadonlySet<B>) => ReadonlySet<B>
export declare function filter<A>(predicate: Predicate<A>): (set: ReadonlySet<A>) => ReadonlySet<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: ReadonlySet<A>) => ReadonlySet<B>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function foldMap<A, M>(O: Ord<A>, M: Monoid<M>): (f: (a: A) => M) => (fa: ReadonlySet<A>) => M
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Use fromReadonlyArray
instead.
export declare const fromArray: <A>(E: Eq<A>) => (as: ReadonlyArray<A>) => ReadonlySet<A>
- Added in 0.1.0
- Deprecated
- MIT – Copyright (c) 2017-present Giulio Canti
Insert a value into a set
export declare function insert<A>(E: Eq<A>): (a: A) => (set: ReadonlySet<A>) => ReadonlySet<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: ReadonlySet<A>): (me: ReadonlySet<A>) => ReadonlySet<A>
(me: ReadonlySet<A>, that: ReadonlySet<A>): ReadonlySet<A>
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Test whether a ReadonlySet
is empty.
export declare const isEmpty: <A>(set: ReadonlySet<A>) => boolean
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
true
if and only if every element in the first set is an element of the second set
export declare function isSubset<A>(E: Eq<A>): {
(that: ReadonlySet<A>): (me: ReadonlySet<A>) => boolean
(me: ReadonlySet<A>, that: ReadonlySet<A>): boolean
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Projects a Set through a function
export declare function map<B>(E: Eq<B>): <A>(f: (x: A) => B) => (set: ReadonlySet<A>) => ReadonlySet<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: ReadonlySet<A>) => Separated<ReadonlySet<A>, ReadonlySet<B>>
export declare function partition<A>(
predicate: Predicate<A>,
): <B extends A>(set: ReadonlySet<B>) => Separated<ReadonlySet<B>, ReadonlySet<B>>
export declare function partition<A>(
predicate: Predicate<A>,
): (set: ReadonlySet<A>) => Separated<ReadonlySet<A>, ReadonlySet<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: ReadonlySet<A>) => Separated<ReadonlySet<B>, ReadonlySet<C>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare function reduce<A>(O: Ord<A>): <B>(b: B, f: (b: B, a: A) => B) => (fa: ReadonlySet<A>) => B
- 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: ReadonlySet<A>) => ReadonlySet<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: ReadonlySet<Either<E, A>>) => Separated<ReadonlySet<E>, ReadonlySet<A>>
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
Calculate the number of elements in a ReadonlySet
.
export declare const size: <A>(set: ReadonlySet<A>) => number
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti
export declare const some: <A>(predicate: Predicate<A>) => (set: ReadonlySet<A>) => boolean
- Added in 0.1.0
- 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: ReadonlySet<A>) => ReadonlySet<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: ReadonlySet<A>): (me: ReadonlySet<A>) => ReadonlySet<A>
(me: ReadonlySet<A>, that: ReadonlySet<A>): ReadonlySet<A>
}
- Added in 0.1.0
- MIT – Copyright (c) 2017-present Giulio Canti