Santhosh Janardhanan
de2d83092e
- Delete old Vite+Svelte frontend - Initialize new SvelteKit project with TypeScript - Configure Tailwind CSS v4 + DaisyUI - Implement JWT authentication with auto-refresh - Create login page with form validation (Zod) - Add protected route guards - Update Docker configuration for single-stage build - Add E2E tests with Playwright (6/11 passing) - Fix Svelte 5 reactivity with $state() runes Known issues: - 5 E2E tests failing (timing/async issues) - Token refresh implementation needs debugging - Validation error display timing
634 lines
14 KiB
TypeScript
634 lines
14 KiB
TypeScript
/**
|
|
* @since 2.0.0
|
|
*/
|
|
import type * as Chunk from "./Chunk.js"
|
|
import type * as HashSet from "./HashSet.js"
|
|
import * as internal from "./internal/stm/tSet.js"
|
|
import type * as Option from "./Option.js"
|
|
import type { Predicate } from "./Predicate.js"
|
|
import type * as STM from "./STM.js"
|
|
import type * as TMap from "./TMap.js"
|
|
import type * as Types from "./Types.js"
|
|
|
|
/**
|
|
* @since 2.0.0
|
|
* @category symbols
|
|
*/
|
|
export const TSetTypeId: unique symbol = internal.TSetTypeId
|
|
|
|
/**
|
|
* @since 2.0.0
|
|
* @category symbols
|
|
*/
|
|
export type TSetTypeId = typeof TSetTypeId
|
|
|
|
/**
|
|
* Transactional set implemented on top of `TMap`.
|
|
*
|
|
* @since 2.0.0
|
|
* @category models
|
|
*/
|
|
export interface TSet<in out A> extends TSet.Variance<A> {}
|
|
/**
|
|
* @internal
|
|
* @since 2.0.0
|
|
*/
|
|
export interface TSet<in out A> {
|
|
/** @internal */
|
|
readonly tMap: TMap.TMap<A, void>
|
|
}
|
|
|
|
/**
|
|
* @since 2.0.0
|
|
*/
|
|
export declare namespace TSet {
|
|
/**
|
|
* @since 2.0.0
|
|
* @category models
|
|
*/
|
|
export interface Variance<in out A> {
|
|
readonly [TSetTypeId]: {
|
|
readonly _A: Types.Invariant<A>
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Stores new element in the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const add: {
|
|
/**
|
|
* Stores new element in the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(value: A): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Stores new element in the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(self: TSet<A>, value: A): STM.STM<void>
|
|
} = internal.add
|
|
|
|
/**
|
|
* Atomically transforms the set into the difference of itself and the
|
|
* provided set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const difference: {
|
|
/**
|
|
* Atomically transforms the set into the difference of itself and the
|
|
* provided set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(other: TSet<A>): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Atomically transforms the set into the difference of itself and the
|
|
* provided set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(self: TSet<A>, other: TSet<A>): STM.STM<void>
|
|
} = internal.difference
|
|
|
|
/**
|
|
* Makes an empty `TSet`.
|
|
*
|
|
* @since 2.0.0
|
|
* @category constructors
|
|
*/
|
|
export const empty: <A>() => STM.STM<TSet<A>> = internal.empty
|
|
|
|
/**
|
|
* Atomically performs transactional-effect for each element in set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category elements
|
|
*/
|
|
export const forEach: {
|
|
/**
|
|
* Atomically performs transactional-effect for each element in set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category elements
|
|
*/
|
|
<A, R, E>(f: (value: A) => STM.STM<void, E, R>): (self: TSet<A>) => STM.STM<void, E, R>
|
|
/**
|
|
* Atomically performs transactional-effect for each element in set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category elements
|
|
*/
|
|
<A, R, E>(self: TSet<A>, f: (value: A) => STM.STM<void, E, R>): STM.STM<void, E, R>
|
|
} = internal.forEach
|
|
|
|
/**
|
|
* Creates a new `TSet` from an iterable collection of values.
|
|
*
|
|
* @since 2.0.0
|
|
* @category constructors
|
|
*/
|
|
export const fromIterable: <A>(iterable: Iterable<A>) => STM.STM<TSet<A>> = internal.fromIterable
|
|
|
|
/**
|
|
* Tests whether or not set contains an element.
|
|
*
|
|
* @since 2.0.0
|
|
* @category elements
|
|
*/
|
|
export const has: {
|
|
/**
|
|
* Tests whether or not set contains an element.
|
|
*
|
|
* @since 2.0.0
|
|
* @category elements
|
|
*/
|
|
<A>(value: A): (self: TSet<A>) => STM.STM<boolean>
|
|
/**
|
|
* Tests whether or not set contains an element.
|
|
*
|
|
* @since 2.0.0
|
|
* @category elements
|
|
*/
|
|
<A>(self: TSet<A>, value: A): STM.STM<boolean>
|
|
} = internal.has
|
|
|
|
/**
|
|
* Atomically transforms the set into the intersection of itself and the
|
|
* provided set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const intersection: {
|
|
/**
|
|
* Atomically transforms the set into the intersection of itself and the
|
|
* provided set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(other: TSet<A>): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Atomically transforms the set into the intersection of itself and the
|
|
* provided set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(self: TSet<A>, other: TSet<A>): STM.STM<void>
|
|
} = internal.intersection
|
|
|
|
/**
|
|
* Tests if the set is empty or not
|
|
*
|
|
* @since 2.0.0
|
|
* @category getters
|
|
*/
|
|
export const isEmpty: <A>(self: TSet<A>) => STM.STM<boolean> = internal.isEmpty
|
|
|
|
/**
|
|
* Makes a new `TSet` that is initialized with specified values.
|
|
*
|
|
* @since 2.0.0
|
|
* @category constructors
|
|
*/
|
|
export const make: <Elements extends Array<any>>(
|
|
...elements: Elements
|
|
) => STM.STM<TSet<Elements[number]>> = internal.make
|
|
|
|
/**
|
|
* Atomically folds using a pure function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category folding
|
|
*/
|
|
export const reduce: {
|
|
/**
|
|
* Atomically folds using a pure function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category folding
|
|
*/
|
|
<Z, A>(zero: Z, f: (accumulator: Z, value: A) => Z): (self: TSet<A>) => STM.STM<Z>
|
|
/**
|
|
* Atomically folds using a pure function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category folding
|
|
*/
|
|
<Z, A>(self: TSet<A>, zero: Z, f: (accumulator: Z, value: A) => Z): STM.STM<Z>
|
|
} = internal.reduce
|
|
|
|
/**
|
|
* Atomically folds using a transactional function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category folding
|
|
*/
|
|
export const reduceSTM: {
|
|
/**
|
|
* Atomically folds using a transactional function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category folding
|
|
*/
|
|
<Z, A, R, E>(zero: Z, f: (accumulator: Z, value: A) => STM.STM<Z, E, R>): (self: TSet<A>) => STM.STM<Z, E, R>
|
|
/**
|
|
* Atomically folds using a transactional function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category folding
|
|
*/
|
|
<Z, A, R, E>(self: TSet<A>, zero: Z, f: (accumulator: Z, value: A) => STM.STM<Z, E, R>): STM.STM<Z, E, R>
|
|
} = internal.reduceSTM
|
|
|
|
/**
|
|
* Removes a single element from the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const remove: {
|
|
/**
|
|
* Removes a single element from the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(value: A): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Removes a single element from the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(self: TSet<A>, value: A): STM.STM<void>
|
|
} = internal.remove
|
|
|
|
/**
|
|
* Removes elements from the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const removeAll: {
|
|
/**
|
|
* Removes elements from the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(iterable: Iterable<A>): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Removes elements from the set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(self: TSet<A>, iterable: Iterable<A>): STM.STM<void>
|
|
} = internal.removeAll
|
|
|
|
/**
|
|
* Removes entries from a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const removeIf: {
|
|
/**
|
|
* Removes entries from a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
predicate: Predicate<A>,
|
|
options: {
|
|
readonly discard: true
|
|
}
|
|
): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Removes entries from a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
predicate: Predicate<A>,
|
|
options?: {
|
|
readonly discard: false
|
|
}
|
|
): (self: TSet<A>) => STM.STM<Array<A>>
|
|
/**
|
|
* Removes entries from a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
self: TSet<A>,
|
|
predicate: Predicate<A>,
|
|
options: {
|
|
readonly discard: true
|
|
}
|
|
): STM.STM<void>
|
|
/**
|
|
* Removes entries from a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
self: TSet<A>,
|
|
predicate: Predicate<A>,
|
|
options?: {
|
|
readonly discard: false
|
|
}
|
|
): STM.STM<Array<A>>
|
|
} = internal.removeIf
|
|
|
|
/**
|
|
* Retains entries in a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const retainIf: {
|
|
/**
|
|
* Retains entries in a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
predicate: Predicate<A>,
|
|
options: {
|
|
readonly discard: true
|
|
}
|
|
): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Retains entries in a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
predicate: Predicate<A>,
|
|
options?: {
|
|
readonly discard: false
|
|
}
|
|
): (self: TSet<A>) => STM.STM<Array<A>>
|
|
/**
|
|
* Retains entries in a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
self: TSet<A>,
|
|
predicate: Predicate<A>,
|
|
options: {
|
|
readonly discard: true
|
|
}
|
|
): STM.STM<void>
|
|
/**
|
|
* Retains entries in a `TSet` that satisfy the specified predicate and returns the removed entries
|
|
* (or `void` if `discard = true`).
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(
|
|
self: TSet<A>,
|
|
predicate: Predicate<A>,
|
|
options?: {
|
|
readonly discard: false
|
|
}
|
|
): STM.STM<Array<A>>
|
|
} = internal.retainIf
|
|
|
|
/**
|
|
* Returns the set's cardinality.
|
|
*
|
|
* @since 2.0.0
|
|
* @category getters
|
|
*/
|
|
export const size: <A>(self: TSet<A>) => STM.STM<number> = internal.size
|
|
|
|
/**
|
|
* Takes the first matching value, or retries until there is one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const takeFirst: {
|
|
/**
|
|
* Takes the first matching value, or retries until there is one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B>(pf: (a: A) => Option.Option<B>): (self: TSet<A>) => STM.STM<B>
|
|
/**
|
|
* Takes the first matching value, or retries until there is one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B>(self: TSet<A>, pf: (a: A) => Option.Option<B>): STM.STM<B>
|
|
} = internal.takeFirst
|
|
|
|
/**
|
|
* Takes the first matching value, or retries until there is one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const takeFirstSTM: {
|
|
/**
|
|
* Takes the first matching value, or retries until there is one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B, E, R>(pf: (a: A) => STM.STM<B, Option.Option<E>, R>): (self: TSet<A>) => STM.STM<B, E, R>
|
|
/**
|
|
* Takes the first matching value, or retries until there is one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B, E, R>(self: TSet<A>, pf: (a: A) => STM.STM<B, Option.Option<E>, R>): STM.STM<B, E, R>
|
|
} = internal.takeFirstSTM
|
|
|
|
/**
|
|
* Takes all matching values, or retries until there is at least one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const takeSome: {
|
|
/**
|
|
* Takes all matching values, or retries until there is at least one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B>(pf: (a: A) => Option.Option<B>): (self: TSet<A>) => STM.STM<[B, ...Array<B>]>
|
|
/**
|
|
* Takes all matching values, or retries until there is at least one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B>(self: TSet<A>, pf: (a: A) => Option.Option<B>): STM.STM<[B, ...Array<B>]>
|
|
} = internal.takeSome
|
|
|
|
/**
|
|
* Takes all matching values, or retries until there is at least one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const takeSomeSTM: {
|
|
/**
|
|
* Takes all matching values, or retries until there is at least one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B, E, R>(pf: (a: A) => STM.STM<B, Option.Option<E>, R>): (self: TSet<A>) => STM.STM<[B, ...Array<B>], E, R>
|
|
/**
|
|
* Takes all matching values, or retries until there is at least one.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, B, E, R>(self: TSet<A>, pf: (a: A) => STM.STM<B, Option.Option<E>, R>): STM.STM<[B, ...Array<B>], E, R>
|
|
} = internal.takeSomeSTM
|
|
|
|
/**
|
|
* Collects all elements into a `Chunk`.
|
|
*
|
|
* @since 2.0.0
|
|
* @category destructors
|
|
*/
|
|
export const toChunk: <A>(self: TSet<A>) => STM.STM<Chunk.Chunk<A>> = internal.toChunk
|
|
|
|
/**
|
|
* Collects all elements into a `HashSet`.
|
|
*
|
|
* @since 2.0.0
|
|
* @category destructors
|
|
*/
|
|
export const toHashSet: <A>(self: TSet<A>) => STM.STM<HashSet.HashSet<A>> = internal.toHashSet
|
|
|
|
/**
|
|
* Collects all elements into a `Array`.
|
|
*
|
|
* @since 2.0.0
|
|
* @category destructors
|
|
*/
|
|
export const toArray: <A>(self: TSet<A>) => STM.STM<Array<A>> = internal.toArray
|
|
|
|
/**
|
|
* Collects all elements into a `ReadonlySet`.
|
|
*
|
|
* @since 2.0.0
|
|
* @category destructors
|
|
*/
|
|
export const toReadonlySet: <A>(self: TSet<A>) => STM.STM<ReadonlySet<A>> = internal.toReadonlySet
|
|
|
|
/**
|
|
* Atomically updates all elements using a pure function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const transform: {
|
|
/**
|
|
* Atomically updates all elements using a pure function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(f: (a: A) => A): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Atomically updates all elements using a pure function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(self: TSet<A>, f: (a: A) => A): STM.STM<void>
|
|
} = internal.transform
|
|
|
|
/**
|
|
* Atomically updates all elements using a transactional function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const transformSTM: {
|
|
/**
|
|
* Atomically updates all elements using a transactional function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, R, E>(f: (a: A) => STM.STM<A, E, R>): (self: TSet<A>) => STM.STM<void, E, R>
|
|
/**
|
|
* Atomically updates all elements using a transactional function.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A, R, E>(self: TSet<A>, f: (a: A) => STM.STM<A, E, R>): STM.STM<void, E, R>
|
|
} = internal.transformSTM
|
|
|
|
/**
|
|
* Atomically transforms the set into the union of itself and the provided
|
|
* set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
export const union: {
|
|
/**
|
|
* Atomically transforms the set into the union of itself and the provided
|
|
* set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(other: TSet<A>): (self: TSet<A>) => STM.STM<void>
|
|
/**
|
|
* Atomically transforms the set into the union of itself and the provided
|
|
* set.
|
|
*
|
|
* @since 2.0.0
|
|
* @category mutations
|
|
*/
|
|
<A>(self: TSet<A>, other: TSet<A>): STM.STM<void>
|
|
} = internal.union
|