export declare const singleton: <A>(a: A) => Set<A>

export declare const fromArray: <A>(E: Eq<A>) => (as: A[]) => Set<A>

export declare const toArray: <A>(O: Ord<A>) => (set: Set<A>) => A[]

export declare const foldMap: <A, M>(O: Ord<A>, M: Monoid<M>) => (f: (a: A) => M) => (fa: Set<A>) => M

export declare const reduce: <A>(O: Ord<A>) => <B>(b: B, f: (b: B, a: A) => B) => (fa: Set<A>) => B

export declare const reduceRight: <A>(O: Ord<A>) => <B>(b: B, f: (a: A, b: B) => B) => (fa: Set<A>) => B

export declare const getDifferenceMagma: <A>(E: Eq<A>) => Magma<Set<A>>

export declare const getEq: <A>(E: Eq<A>) => Eq<Set<A>>

export declare const getIntersectionSemigroup: <A>(E: Eq<A>) => Semigroup<Set<A>>

export declare const getShow: <A>(S: Show<A>) => Show<Set<A>>

export declare const getUnionMonoid: <A>(E: Eq<A>) => Monoid<Set<A>>

export declare const getUnionSemigroup: <A>(E: Eq<A>) => Semigroup<Set<A>>

export declare function chain<B>(E: Eq<B>): <A>(f: (x: A) => Set<B>) => (set: Set<A>) => Set<B>

export declare const compact: <A>(E: Eq<A>) => (fa: Set<Option<A>>) => Set<A>

export declare function difference<A>(E: Eq<A>): {
  (that: Set<A>): (me: Set<A>) => Set<A>
  (me: Set<A>, that: Set<A>): Set<A>
}

import { difference } from 'fp-ts/Set'
import * as N from 'fp-ts/number'
import { pipe } from 'fp-ts/function'

assert.deepStrictEqual(pipe(new Set([1, 2]), difference(N.Eq)(new Set([1, 3]))), new Set([2]))

export declare const elem: <A>(E: Eq<A>) => { (a: A): (set: Set<A>) => boolean; (a: A, set: Set<A>): boolean }

export declare const empty: Set<never>

export declare const every: {
  <A, B extends A>(refinement: Refinement<A, B>): Refinement<Set<A>, Set<B>>
  <A>(predicate: Predicate<A>): Predicate<Set<A>>
}

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>

export declare function filterMap<B>(E: Eq<B>): <A>(f: (a: A) => Option<B>) => (fa: Set<A>) => Set<B>

export declare function insert<A>(E: Eq<A>): (a: A) => (set: Set<A>) => Set<A>

export declare function intersection<A>(E: Eq<A>): {
  (that: Set<A>): (me: Set<A>) => Set<A>
  (me: Set<A>, that: Set<A>): Set<A>
}

export declare const isEmpty: <A>(set: Set<A>) => boolean

export declare const isSubset: <A>(E: Eq<A>) => (that: Set<A>) => (me: Set<A>) => boolean

export declare function map<B>(E: Eq<B>): <A>(f: (x: A) => B) => (set: Set<A>) => Set<B>

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>>

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>>

export declare const remove: <A>(E: Eq<A>) => (a: A) => (set: Set<A>) => Set<A>

export declare function separate<E, A>(EE: Eq<E>, EA: Eq<A>): (fa: Set<Either<E, A>>) => Separated<Set<E>, Set<A>>

export declare const size: <A>(set: Set<A>) => number

export declare const some: <A>(predicate: Predicate<A>) => (set: Set<A>) => boolean

export declare const toggle: <A>(E: Eq<A>) => (a: A) => (set: Set<A>) => Set<A>

export declare function union<A>(E: Eq<A>): {
  (that: Set<A>): (me: Set<A>) => Set<A>
  (me: Set<A>, that: Set<A>): Set<A>
}

export declare const subset: <A>(E: Eq<A>) => {
  (that: Set<A>): (me: Set<A>) => boolean
  (me: Set<A>, that: Set<A>): boolean
}