/**
 * @since 1.0.0
 */
import type * as Option from "@effect/data/Option";
import type { Predicate } from "@effect/data/Predicate";
import type * as STM from "@effect/stm/STM";
/**
 * @since 1.0.0
 * @category symbols
 */
export declare const TDequeueTypeId: unique symbol;
/**
 * @since 1.0.0
 * @category symbols
 */
export type TDequeueTypeId = typeof TDequeueTypeId;
/**
 * @since 1.0.0
 * @category symbols
 */
export declare const TEnqueueTypeId: unique symbol;
/**
 * @since 1.0.0
 * @category symbols
 */
export type TEnqueueTypeId = typeof TEnqueueTypeId;
/**
 * @since 1.0.0
 * @category models
 */
export interface TQueue<A> extends TEnqueue<A>, TDequeue<A> {
}
/**
 * @since 1.0.0
 * @category models
 */
export interface TEnqueue<A> extends TQueue.TEnqueueVariance<A>, BaseTQueue {
    /**
     * Places one value in the queue.
     */
    offer(value: A): STM.STM<never, never, boolean>;
    /**
     * For Bounded TQueue: uses the `BackPressure` Strategy, places the values in
     * the queue and always returns true. If the queue has reached capacity, then
     * the fiber performing the `offerAll` will be suspended until there is room
     * in the queue.
     *
     * For Unbounded TQueue: Places all values in the queue and returns true.
     *
     * For Sliding TQueue: uses `Sliding` Strategy If there is room in the queue,
     * it places the values otherwise it removes the old elements and enqueues the
     * new ones. Always returns true.
     *
     * For Dropping TQueue: uses `Dropping` Strategy, It places the values in the
     * queue but if there is no room it will not enqueue them and return false.
     */
    offerAll(iterable: Iterable<A>): STM.STM<never, never, boolean>;
}
/**
 * @since 1.0.0
 * @category models
 */
export interface TDequeue<A> extends TQueue.TDequeueVariance<A>, BaseTQueue {
    /**
     * Views the next element in the queue without removing it, retrying if the
     * queue is empty.
     */
    readonly peek: STM.STM<never, never, A>;
    /**
     * Views the next element in the queue without removing it, returning `None`
     * if the queue is empty.
     */
    readonly peekOption: STM.STM<never, never, Option.Option<A>>;
    /**
     * Takes the oldest value in the queue. If the queue is empty, this will return
     * a computation that resumes when an item has been added to the queue.
     */
    readonly take: STM.STM<never, never, A>;
    /**
     * Takes all the values in the queue and returns the values. If the queue is
     * empty returns an empty collection.
     */
    readonly takeAll: STM.STM<never, never, Array<A>>;
    /**
     * Takes up to max number of values from the queue.
     */
    takeUpTo(max: number): STM.STM<never, never, Array<A>>;
}
/**
 * The base interface that all `TQueue`s must implement.
 *
 * @since 1.0.0
 * @category models
 */
export interface BaseTQueue {
    /**
     * Returns the number of elements the queue can hold.
     */
    capacity(): number;
    /**
     * Retrieves the size of the queue, which is equal to the number of elements
     * in the queue. This may be negative if fibers are suspended waiting for
     * elements to be added to the queue.
     */
    readonly size: STM.STM<never, never, number>;
    /**
     * Returns `true` if the `TQueue` contains at least one element, `false`
     * otherwise.
     */
    readonly isFull: STM.STM<never, never, boolean>;
    /**
     * Returns `true` if the `TQueue` contains zero elements, `false` otherwise.
     */
    readonly isEmpty: STM.STM<never, never, boolean>;
    /**
     * Interrupts any fibers that are suspended on `offer` or `take`. Future calls
     * to `offer*` and `take*` will be interrupted immediately.
     */
    readonly shutdown: STM.STM<never, never, void>;
    /**
     * Returns `true` if `shutdown` has been called, otherwise returns `false`.
     */
    readonly isShutdown: STM.STM<never, never, boolean>;
    /**
     * Waits until the queue is shutdown. The `STM` returned by this method will
     * not resume until the queue has been shutdown. If the queue is already
     * shutdown, the `STM` will resume right away.
     */
    readonly awaitShutdown: STM.STM<never, never, void>;
}
/**
 * @since 1.0.0
 */
export declare namespace TQueue {
    /**
     * @since 1.0.0
     * @category models
     */
    interface TEnqueueVariance<A> {
        readonly [TEnqueueTypeId]: {
            readonly _In: (_: A) => void;
        };
    }
    /**
     * @since 1.0.0
     * @category models
     */
    interface TDequeueVariance<A> {
        readonly [TDequeueTypeId]: {
            readonly _Out: (_: never) => A;
        };
    }
}
/**
 * Returns `true` if the specified value is a `TQueue`, `false` otherwise.
 *
 * @since 1.0.0
 * @category refinements
 */
export declare const isTQueue: (u: unknown) => u is TQueue<unknown>;
/**
 * Returns `true` if the specified value is a `TDequeue`, `false` otherwise.
 *
 * @since 1.0.0
 * @category refinements
 */
export declare const isTDequeue: (u: unknown) => u is TDequeue<unknown>;
/**
 * Returns `true` if the specified value is a `TEnqueue`, `false` otherwise.
 *
 * @since 1.0.0
 * @category refinements
 */
export declare const isTEnqueue: (u: unknown) => u is TEnqueue<unknown>;
/**
 * Waits until the queue is shutdown. The `STM` returned by this method will
 * not resume until the queue has been shutdown. If the queue is already
 * shutdown, the `STM` will resume right away.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const awaitShutdown: <A>(self: TQueue<A>) => STM.STM<never, never, void>;
/**
 * Creates a bounded queue with the back pressure strategy. The queue will
 * retain values until they have been taken, applying back pressure to
 * offerors if the queue is at capacity.
 *
 * For best performance use capacities that are powers of two.
 *
 * @since 1.0.0
 * @category constructors
 */
export declare const bounded: <A>(requestedCapacity: number) => STM.STM<never, never, TQueue<A>>;
/**
 * Returns the number of elements the queue can hold.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const capacity: <A>(self: TQueue<A>) => number;
/**
 * Creates a bounded queue with the dropping strategy. The queue will drop new
 * values if the queue is at capacity.
 *
 * For best performance use capacities that are powers of two.
 *
 * @since 1.0.0
 * @category constructors
 */
export declare const dropping: <A>(requestedCapacity: number) => STM.STM<never, never, TQueue<A>>;
/**
 * Returns `true` if the `TQueue` contains zero elements, `false` otherwise.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const isEmpty: <A>(self: TQueue<A>) => STM.STM<never, never, boolean>;
/**
 * Returns `true` if the `TQueue` contains at least one element, `false`
 * otherwise.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const isFull: <A>(self: TQueue<A>) => STM.STM<never, never, boolean>;
/**
 * Returns `true` if `shutdown` has been called, otherwise returns `false`.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const isShutdown: <A>(self: TQueue<A>) => STM.STM<never, never, boolean>;
/**
 * Places one value in the queue.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const offer: {
    <A>(value: A): (self: TEnqueue<A>) => STM.STM<never, never, void>;
    <A>(self: TEnqueue<A>, value: A): STM.STM<never, never, void>;
};
/**
 * For Bounded TQueue: uses the `BackPressure` Strategy, places the values in
 * the queue and always returns true. If the queue has reached capacity, then
 * the fiber performing the `offerAll` will be suspended until there is room
 * in the queue.
 *
 * For Unbounded TQueue: Places all values in the queue and returns true.
 *
 * For Sliding TQueue: uses `Sliding` Strategy If there is room in the queue,
 * it places the values otherwise it removes the old elements and enqueues the
 * new ones. Always returns true.
 *
 * For Dropping TQueue: uses `Dropping` Strategy, It places the values in the
 * queue but if there is no room it will not enqueue them and return false.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const offerAll: {
    <A>(iterable: Iterable<A>): (self: TEnqueue<A>) => STM.STM<never, never, boolean>;
    <A>(self: TEnqueue<A>, iterable: Iterable<A>): STM.STM<never, never, boolean>;
};
/**
 * Views the next element in the queue without removing it, retrying if the
 * queue is empty.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const peek: <A>(self: TDequeue<A>) => STM.STM<never, never, A>;
/**
 * Views the next element in the queue without removing it, returning `None`
 * if the queue is empty.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const peekOption: <A>(self: TDequeue<A>) => STM.STM<never, never, Option.Option<A>>;
/**
 * Takes a single element from the queue, returning `None` if the queue is
 * empty.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const poll: <A>(self: TDequeue<A>) => STM.STM<never, never, Option.Option<A>>;
/**
 * Drops elements from the queue while they do not satisfy the predicate,
 * taking and returning the first element that does satisfy the predicate.
 * Retries if no elements satisfy the predicate.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const seek: {
    <A>(predicate: Predicate<A>): (self: TDequeue<A>) => STM.STM<never, never, A>;
    <A>(self: TDequeue<A>, predicate: Predicate<A>): STM.STM<never, never, A>;
};
/**
 * Interrupts any fibers that are suspended on `offer` or `take`. Future calls
 * to `offer*` and `take*` will be interrupted immediately.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const shutdown: <A>(self: TQueue<A>) => STM.STM<never, never, void>;
/**
 * Retrieves the size of the queue, which is equal to the number of elements
 * in the queue. This may be negative if fibers are suspended waiting for
 * elements to be added to the queue.
 *
 * @since 1.0.0
 * @category getters
 */
export declare const size: <A>(self: TQueue<A>) => STM.STM<never, never, number>;
/**
 * Creates a bounded queue with the sliding strategy. The queue will add new
 * values and drop old values if the queue is at capacity.
 *
 * For best performance use capacities that are powers of two.
 *
 * @since 1.0.0
 * @category constructors
 */
export declare const sliding: <A>(requestedCapacity: number) => STM.STM<never, never, TQueue<A>>;
/**
 * Takes the oldest value in the queue. If the queue is empty, this will return
 * a computation that resumes when an item has been added to the queue.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const take: <A>(self: TDequeue<A>) => STM.STM<never, never, A>;
/**
 * Takes all the values in the queue and returns the values. If the queue is
 * empty returns an empty collection.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const takeAll: <A>(self: TDequeue<A>) => STM.STM<never, never, Array<A>>;
/**
 * Takes a number of elements from the queue between the specified minimum and
 * maximum. If there are fewer than the minimum number of elements available,
 * retries until at least the minimum number of elements have been collected.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const takeBetween: {
    (min: number, max: number): <A>(self: TDequeue<A>) => STM.STM<never, never, Array<A>>;
    <A>(self: TDequeue<A>, min: number, max: number): STM.STM<never, never, Array<A>>;
};
/**
 * Takes the specified number of elements from the queue. If there are fewer
 * than the specified number of elements available, it retries until they
 * become available.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const takeN: {
    (n: number): <A>(self: TDequeue<A>) => STM.STM<never, never, Array<A>>;
    <A>(self: TDequeue<A>, n: number): STM.STM<never, never, Array<A>>;
};
/**
 * Takes up to max number of values from the queue.
 *
 * @since 1.0.0
 * @category mutations
 */
export declare const takeUpTo: {
    (max: number): <A>(self: TDequeue<A>) => STM.STM<never, never, Array<A>>;
    <A>(self: TDequeue<A>, max: number): STM.STM<never, never, Array<A>>;
};
/**
 * Creates an unbounded queue.
 *
 * @since 1.0.0
 * @category constructors
 */
export declare const unbounded: <A>() => STM.STM<never, never, TQueue<A>>;
//# sourceMappingURL=TQueue.d.ts.map