@thi.ng/associative
Advanced tools
Comparing version 6.3.56 to 6.3.57
@@ -1,6 +0,6 @@ | ||
import type { Comparator, Fn, IClear, ICopy, IEmpty, IEquiv, IGet, IInto, Predicate2 } from "@thi.ng/api"; | ||
import type { Comparator, Fn, IClear, ICopy, IEmpty, IEquiv, IGet, IInto, Maybe, Predicate2 } from "@thi.ng/api"; | ||
import type { IRandom } from "@thi.ng/random"; | ||
export interface IEquivSet<T> extends Set<T>, IClear, ICopy<IEquivSet<T>>, IEmpty<IEquivSet<T>>, IEquiv, IGet<T, T>, IInto<T, IEquivSet<T>> { | ||
disj(xs: Iterable<T>): this; | ||
first(): T | undefined; | ||
first(): Maybe<T>; | ||
} | ||
@@ -7,0 +7,0 @@ export interface EquivSetConstructor<T> { |
@@ -1,2 +0,2 @@ | ||
import type { Fn3, Pair } from "@thi.ng/api"; | ||
import type { Fn3, Maybe, Pair } from "@thi.ng/api"; | ||
import type { EquivSetOpts, IEquivSet } from "./api.js"; | ||
@@ -26,3 +26,3 @@ /** | ||
clear(): void; | ||
first(): T | undefined; | ||
first(): Maybe<T>; | ||
add(key: T): this; | ||
@@ -38,3 +38,3 @@ into(keys: Iterable<T>): this; | ||
*/ | ||
get(key: T, notFound?: T): T | undefined; | ||
get(key: T, notFound?: T): Maybe<T>; | ||
delete(key: T): boolean; | ||
@@ -41,0 +41,0 @@ disj(keys: Iterable<T>): this; |
# Change Log | ||
- **Last updated**: 2024-04-11T12:32:44Z | ||
- **Last updated**: 2024-04-20T14:42:45Z | ||
- **Generator**: [thi.ng/monopub](https://thi.ng/monopub) | ||
@@ -12,2 +12,8 @@ | ||
### [6.3.57](https://github.com/thi-ng/umbrella/tree/@thi.ng/associative@6.3.57) (2024-04-20) | ||
#### ♻️ Refactoring | ||
- update type usage ([6274bf1](https://github.com/thi-ng/umbrella/commit/6274bf1)) | ||
### [6.3.55](https://github.com/thi-ng/umbrella/tree/@thi.ng/associative@6.3.55) (2024-04-08) | ||
@@ -14,0 +20,0 @@ |
@@ -1,2 +0,2 @@ | ||
import type { Fn3, ICopy, IEmpty, IEquiv, IObjectOf, Pair } from "@thi.ng/api"; | ||
import type { Fn3, ICopy, IEmpty, IEquiv, IObjectOf, Maybe, Pair } from "@thi.ng/api"; | ||
import type { EquivMapOpts } from "./api.js"; | ||
@@ -34,3 +34,3 @@ export declare class EquivMap<K, V> extends Map<K, V> implements Iterable<Pair<K, V>>, ICopy<EquivMap<K, V>>, IEmpty<EquivMap<K, V>>, IEquiv { | ||
forEach(fn: Fn3<V, K, Map<K, V>, void>, thisArg?: any): void; | ||
get(key: K, notFound?: V): V | undefined; | ||
get(key: K, notFound?: V): Maybe<V>; | ||
has(key: K): boolean; | ||
@@ -37,0 +37,0 @@ set(key: K, value: V): this; |
@@ -1,2 +0,2 @@ | ||
import type { Fn, Fn3, ICopy, IEmpty, IEquiv, IObjectOf, Pair, Predicate2 } from "@thi.ng/api"; | ||
import type { Fn, Fn3, ICopy, IEmpty, IEquiv, IObjectOf, Maybe, Pair, Predicate2 } from "@thi.ng/api"; | ||
import type { HashMapOpts } from "./api.js"; | ||
@@ -56,3 +56,3 @@ interface HashMapState<K, V> { | ||
has(key: K): boolean; | ||
get(key: K, notFound?: V): V | undefined; | ||
get(key: K, notFound?: V): Maybe<V>; | ||
set(key: K, val: V): this; | ||
@@ -59,0 +59,0 @@ delete(key: K): boolean; |
@@ -1,2 +0,2 @@ | ||
import type { Fn3, Pair } from "@thi.ng/api"; | ||
import type { Fn3, Maybe, Pair } from "@thi.ng/api"; | ||
import type { EquivSetOpts, IEquivSet } from "./api.js"; | ||
@@ -27,3 +27,3 @@ /** | ||
clear(): void; | ||
first(): T | undefined; | ||
first(): Maybe<T>; | ||
add(key: T): this; | ||
@@ -39,3 +39,3 @@ into(keys: Iterable<T>): this; | ||
*/ | ||
get(key: T, notFound?: T): T | undefined; | ||
get(key: T, notFound?: T): Maybe<T>; | ||
delete(key: T): boolean; | ||
@@ -42,0 +42,0 @@ disj(keys: Iterable<T>): this; |
@@ -1,2 +0,2 @@ | ||
import type { Fn0, IObjectOf, Nullable, Pair } from "@thi.ng/api"; | ||
import type { Fn0, IObjectOf, Maybe, Nullable, Pair } from "@thi.ng/api"; | ||
export interface MultiTrieOpts<V> { | ||
@@ -22,3 +22,3 @@ /** | ||
hasPrefix(prefix: K): boolean; | ||
get(key: K): Set<V> | undefined; | ||
get(key: K): Maybe<Set<V>>; | ||
find(key: K): MultiTrie<K, V> | undefined; | ||
@@ -25,0 +25,0 @@ /** |
{ | ||
"name": "@thi.ng/associative", | ||
"version": "6.3.56", | ||
"version": "6.3.57", | ||
"description": "Alternative Map and Set implementations with customizable equality semantics & supporting operations, plain object utilities", | ||
@@ -39,12 +39,12 @@ "type": "module", | ||
"dependencies": { | ||
"@thi.ng/api": "^8.10.1", | ||
"@thi.ng/arrays": "^2.9.3", | ||
"@thi.ng/binary": "^3.4.22", | ||
"@thi.ng/checks": "^3.6.1", | ||
"@thi.ng/compare": "^2.3.2", | ||
"@thi.ng/dcons": "^3.2.109", | ||
"@thi.ng/equiv": "^2.1.55", | ||
"@thi.ng/errors": "^2.5.4", | ||
"@thi.ng/random": "^3.7.3", | ||
"@thi.ng/transducers": "^9.0.1", | ||
"@thi.ng/api": "^8.11.0", | ||
"@thi.ng/arrays": "^2.9.4", | ||
"@thi.ng/binary": "^3.4.23", | ||
"@thi.ng/checks": "^3.6.2", | ||
"@thi.ng/compare": "^2.3.3", | ||
"@thi.ng/dcons": "^3.2.110", | ||
"@thi.ng/equiv": "^2.1.56", | ||
"@thi.ng/errors": "^2.5.5", | ||
"@thi.ng/random": "^3.7.4", | ||
"@thi.ng/transducers": "^9.0.2", | ||
"tslib": "^2.6.2" | ||
@@ -202,3 +202,3 @@ }, | ||
}, | ||
"gitHead": "18a0c063a7b33d790e5bc2486c106f45f663ac28\n" | ||
"gitHead": "8339d05ecc857e529c7325a9839c0063b89e728d\n" | ||
} |
@@ -195,6 +195,6 @@ <!-- This file is generated - DO NOT EDIT! --> | ||
```html | ||
<script type="module" src="https://cdn.skypack.dev/@thi.ng/associative"></script> | ||
<script type="module" src="https://esm.run/@thi.ng/associative"></script> | ||
``` | ||
[Skypack documentation](https://docs.skypack.dev/) | ||
[JSDelivr documentation](https://www.jsdelivr.com/) | ||
@@ -201,0 +201,0 @@ For Node.js REPL: |
@@ -1,2 +0,2 @@ | ||
import type { Fn3, IObjectOf, Pair } from "@thi.ng/api"; | ||
import type { Fn3, IObjectOf, Maybe, Pair } from "@thi.ng/api"; | ||
import type { Reduced, ReductionFn } from "@thi.ng/transducers"; | ||
@@ -9,6 +9,6 @@ import type { SortedMapOpts } from "./api.js"; | ||
level: number; | ||
next: Node<K, V> | undefined; | ||
prev: Node<K, V> | undefined; | ||
up: Node<K, V> | undefined; | ||
down: Node<K, V> | undefined; | ||
next: Maybe<Node<K, V>>; | ||
prev: Maybe<Node<K, V>>; | ||
up: Maybe<Node<K, V>>; | ||
down: Maybe<Node<K, V>>; | ||
constructor(k?: K | undefined, v?: V | undefined, level?: number); | ||
@@ -69,3 +69,3 @@ } | ||
first(): (V | (K & ({} | null)) | undefined)[] | undefined; | ||
get(key: K, notFound?: V): V | undefined; | ||
get(key: K, notFound?: V): Maybe<V>; | ||
has(key: K): boolean; | ||
@@ -72,0 +72,0 @@ set(key: K, val: V): this; |
@@ -1,2 +0,2 @@ | ||
import type { Fn3, ICompare, Pair } from "@thi.ng/api"; | ||
import type { Fn3, ICompare, Maybe, Pair } from "@thi.ng/api"; | ||
import type { IReducible, Reduced, ReductionFn } from "@thi.ng/transducers"; | ||
@@ -54,3 +54,3 @@ import type { IEquivSet, SortedSetOpts } from "./api.js"; | ||
has(key: T): boolean; | ||
get(key: T, notFound?: T): T | undefined; | ||
get(key: T, notFound?: T): Maybe<T>; | ||
opts(): SortedSetOpts<T>; | ||
@@ -57,0 +57,0 @@ } |
@@ -1,2 +0,2 @@ | ||
import type { IObjectOf, Pair } from "@thi.ng/api"; | ||
import type { IObjectOf, Maybe, Pair } from "@thi.ng/api"; | ||
export declare class TrieMap<T> { | ||
@@ -14,3 +14,3 @@ protected next: IObjectOf<TrieMap<T>>; | ||
hasPrefix(prefix: string): boolean; | ||
get(key: string, notFound?: T): T | undefined; | ||
get(key: string, notFound?: T): Maybe<T>; | ||
find(key: string): TrieMap<T> | undefined; | ||
@@ -17,0 +17,0 @@ /** |
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
160973
Updated@thi.ng/api@^8.11.0
Updated@thi.ng/arrays@^2.9.4
Updated@thi.ng/binary@^3.4.23
Updated@thi.ng/checks@^3.6.2
Updated@thi.ng/compare@^2.3.3
Updated@thi.ng/dcons@^3.2.110
Updated@thi.ng/equiv@^2.1.56
Updated@thi.ng/errors@^2.5.5
Updated@thi.ng/random@^3.7.4
Updated@thi.ng/transducers@^9.0.2