import { Eval, Kind } from '@fp4ts/core';
import { Monoid, Eq, Ord } from '@fp4ts/cats-kernel';
import { MonoidK } from '../../../monoid-k';
import { Applicative } from '../../../applicative';
import { Show } from '../../../show';
import { Option } from '../../option';
import { List } from '../list';
import { View } from '../view';
import { Map } from './algebra';
export declare const isEmpty: <K, V>(m: Map<K, V>) => boolean;
export declare const nonEmpty: <K, V>(m: Map<K, V>) => boolean;
export declare const head: <K, V>(m: Map<K, V>) => V;
export declare const headOption: <K, V>(m: Map<K, V>) => Option<V>;
export declare const tail: <K, V>(m: Map<K, V>) => Map<K, V>;
export declare const init: <K, V>(m: Map<K, V>) => Map<K, V>;
export declare const last: <K, V>(m: Map<K, V>) => V;
export declare const lastOption: <K, V>(m: Map<K, V>) => Option<V>;
export declare const toArray: <K, V>(m: Map<K, V>) => [K, V][];
export declare const toList: <K, V>(m: Map<K, V>) => List<[K, V]>;
export declare const view: <K, V>(m: Map<K, V>) => View<[K, V]>;
export declare const min: <K, V>(m: Map<K, V>) => Option<V>;
export declare const minWithKey: <K, V>(m0: Map<K, V>) => Option<[K, V]>;
export declare const max: <K, V>(m: Map<K, V>) => Option<V>;
export declare const maxWithKey: <K, V>(m0: Map<K, V>) => Option<[K, V]>;
export declare const popMin: <K, V>(m: Map<K, V>) => Option<[V, Map<K, V>]>;
export declare const popMinWithKey: <K, V>(m: Map<K, V>) => Option<[[K, V], Map<K, V>]>;
export declare const popMax: <K, V>(m: Map<K, V>) => Option<[V, Map<K, V>]>;
export declare const popMaxWithKey: <K, V>(m: Map<K, V>) => Option<[[K, V], Map<K, V>]>;
export declare const sequence: <G>(G: Applicative<G>) => <K, V>(m: Map<K, Kind<G, [V]>>) => Kind<G, [Map<K, V>]>;
export declare const count_: <K, V>(m: Map<K, V>, p: (v: V, k: K) => boolean) => number;
export declare const all_: <K, V>(m: Map<K, V>, p: (v: V, k: K) => boolean) => boolean;
export declare const any_: <K, V>(m: Map<K, V>, p: (v: V, k: K) => boolean) => boolean;
export declare const contains_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K) => boolean;
export declare const get_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K) => V;
export declare const lookup_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K) => Option<V>;
export declare const insert_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K, v: V) => Map<K, V>;
export declare const insertWith_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K, v: V, u: (v1: V, v2: V, k: K) => V) => Map<K, V>;
export declare const remove_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K) => Map<K, V>;
export declare const update_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K, u: (v: V, k: K) => V) => Map<K, V>;
export declare const union_: <K, V>(O: Ord<K>, m1: Map<K, V>, m2: Map<K, V>) => Map<K, V>;
export declare const unionWith_: <K, V>(O: Ord<K>, m1: Map<K, V>, m2: Map<K, V>, u: (v1: V, v2: V, k: K) => V) => Map<K, V>;
export declare const intersect_: <K, V1, V2>(O: Ord<K>, m1: Map<K, V1>, m2: Map<K, V2>) => Map<K, V1>;
export declare const intersectWith_: <K, V1, V2, C>(O: Ord<K>, m1: Map<K, V1>, m2: Map<K, V2>, u: (v1: V1, v2: V2, k: K) => C) => Map<K, C>;
export declare const difference_: <K, V, V2>(O: Ord<K>, m1: Map<K, V>, m2: Map<K, V2>) => Map<K, V>;
export declare const symmetricDifference_: <K, V>(O: Ord<K>, m1: Map<K, V>, m2: Map<K, V>) => Map<K, V>;
export declare const split_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K) => [Map<K, V>, Map<K, V>];
export declare const splitLookup_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K) => [Map<K, V>, Option<V>, Map<K, V>];
export declare const splitMember_: <K, V>(O: Ord<K>, m: Map<K, V>, k: K) => [Map<K, V>, boolean, Map<K, V>];
export declare const filter_: <K, V>(m: Map<K, V>, p: (v: V, k: K) => boolean) => Map<K, V>;
export declare const map_: <K, V, B>(m: Map<K, V>, f: (v: V, k: K) => B) => Map<K, B>;
export declare const tap_: <K, V>(m: Map<K, V>, f: (v: V, k: K) => unknown) => Map<K, V>;
export declare const collect_: <K, V, B>(m: Map<K, V>, f: (v: V, k: K) => Option<B>) => Map<K, B>;
export declare const forEach_: <K, V>(m: Map<K, V>, f: (v: V, k: K) => void) => void;
export declare const foldLeft_: <K, V, B>(m: Map<K, V>, z: B, f: (b: B, v: V, k: K) => B) => B;
export declare const foldLeft1_: <K, V>(m: Map<K, V>, f: (r: V, v: V) => V) => V;
export declare const foldRight_: <K, V, B>(m: Map<K, V>, ez: Eval<B>, f: (v: V, eb: Eval<B>, k: K) => Eval<B>) => Eval<B>;
export declare const foldRightStrict_: <K, V, B>(m: Map<K, V>, z: B, f: (v: V, b: B, k: K) => B) => B;
export declare const foldRight1_: <K, V>(m: Map<K, V>, f: (v: V, r: V) => V) => V;
export declare const foldMap_: <M>(M: Monoid<M>) => <K, V>(m: Map<K, V>, f: (v: V, k: K) => M) => M;
export declare const foldMapLeft_: <M>(M: Monoid<M>) => <K, V>(m: Map<K, V>, f: (v: V, k: K) => M) => M;
export declare const foldMapK_: <F>(F: MonoidK<F>) => <K, V, B>(m: Map<K, V>, f: (v: V, k: K) => Kind<F, [B]>) => Kind<F, [B]>;
export declare const traverse_: <G>(G: Applicative<G>) => <K, V, B>(m: Map<K, V>, f: (v: V, k: K) => Kind<G, [B]>) => Kind<G, [Map<K, B>]>;
export declare const show_: <K, V>(SK: Show<K>, SV: Show<V>, m: Map<K, V>) => string;
export declare const equals_: <K, V>(EK: Eq<K>, EV: Eq<V>, m1: Map<K, V>, m2: Map<K, V>) => boolean;
export declare const isValid: <K, V = never>(O: Ord<K>, m: Map<K, V>) => boolean;
export declare const isOrdered: <K, V>(O: Ord<K>, m: Map<K, V>) => boolean;
export declare const isBalanced: <K, V>(m: Map<K, V>) => boolean;
export declare const hasValidSize: <K, V>(m: Map<K, V>) => boolean;
export declare const _link: <K, V>(k: K, x: V, l: Map<K, V>, r: Map<K, V>) => Map<K, V>;
export declare const _insertMax: <K, V>(k: K, x: V, sa: Map<K, V>) => Map<K, V>;
//# sourceMappingURL=operators.d.ts.map