<A, V>(f: (value: V, key: string) => A): (self: Trie<V>) => Trie<A>
<V, A>(self: Trie<V>, f: (value: V, key: string) => A): Trie<A>Maps over the entries of the Trie using the specified function.
Example (Mapping entries)
import { Equal, Trie } from "effect"
import * as assert from "node:assert"
const trie = Trie.empty<number>().pipe(
Trie.insert("shells", 0),
Trie.insert("sells", 1),
Trie.insert("she", 2)
)
const trieMapV = Trie.empty<number>().pipe(
Trie.insert("shells", 1),
Trie.insert("sells", 2),
Trie.insert("she", 3)
)
const trieMapK = Trie.empty<number>().pipe(
Trie.insert("shells", 6),
Trie.insert("sells", 5),
Trie.insert("she", 3)
)
assert.equal(Equal.equals(Trie.map(trie, (v) => v + 1), trieMapV), true)
assert.equal(Equal.equals(Trie.map(trie, (_, k) => k.length), trieMapK), true)folding
Source effect/Trie.ts:6994 lines
export const const map: {
<A, V>(f: (value: V, key: string) => A): (
self: Trie<V>
) => Trie<A>
<V, A>(
self: Trie<V>,
f: (value: V, key: string) => A
): Trie<A>
}
Maps over the entries of the Trie using the specified function.
Example (Mapping entries)
import { Equal, Trie } from "effect"
import * as assert from "node:assert"
const trie = Trie.empty<number>().pipe(
Trie.insert("shells", 0),
Trie.insert("sells", 1),
Trie.insert("she", 2)
)
const trieMapV = Trie.empty<number>().pipe(
Trie.insert("shells", 1),
Trie.insert("sells", 2),
Trie.insert("she", 3)
)
const trieMapK = Trie.empty<number>().pipe(
Trie.insert("shells", 6),
Trie.insert("sells", 5),
Trie.insert("she", 3)
)
assert.equal(Equal.equals(Trie.map(trie, (v) => v + 1), trieMapV), true)
assert.equal(Equal.equals(Trie.map(trie, (_, k) => k.length), trieMapK), true)
map: {
<function (type parameter) A in <A, V>(f: (value: V, key: string) => A): (self: Trie<V>) => Trie<A>A, function (type parameter) V in <A, V>(f: (value: V, key: string) => A): (self: Trie<V>) => Trie<A>V>(f: (value: V, key: string) => Af: (value: Vvalue: function (type parameter) V in <A, V>(f: (value: V, key: string) => A): (self: Trie<V>) => Trie<A>V, key: stringkey: string) => function (type parameter) A in <A, V>(f: (value: V, key: string) => A): (self: Trie<V>) => Trie<A>A): (self: Trie<V>(parameter) self: {
pipe: { <A>(this: A): A; <A, B = never>(this: A, ab: (_: A) => B): B; <A, B = never, C = never>(this: A, ab: (_: A) => B, bc: (_: B) => C): C; <A, B = never, C = never, D = never>(this: A, ab: (_: A) => B, bc: (_: B) => C, cd: (_: C) => D): D; <…;
toString: () => string;
toJSON: () => unknown;
}
interface Trie<in out Value>An immutable string-keyed map optimized for prefix lookup. Iteration yields
[key, value] pairs in key order, and update operations such as insert and
remove return new Trie values.
Example (Using a trie for prefix search)
import { Trie } from "effect"
// Create a trie with string-to-number mappings
const trie: Trie.Trie<number> = Trie.make(
["apple", 1],
["app", 2],
["application", 3],
["banana", 4]
)
// Get values by exact key
console.log(Trie.get(trie, "apple")) // Some(1)
console.log(Trie.get(trie, "grape")) // None
// Find all keys with a prefix
console.log(Array.from(Trie.keysWithPrefix(trie, "app")))
// ["app", "apple", "application"]
// Iterate over all entries (sorted alphabetically)
for (const [key, value] of trie) {
console.log(`${key}: ${value}`)
}
// Output: "app: 2", "apple: 1", "application: 3", "banana: 4"
// Check if key exists
console.log(Trie.has(trie, "app")) // true
// Get size
console.log(Trie.size(trie)) // 4
Trie<function (type parameter) V in <A, V>(f: (value: V, key: string) => A): (self: Trie<V>) => Trie<A>V>) => interface Trie<in out Value>An immutable string-keyed map optimized for prefix lookup. Iteration yields
[key, value] pairs in key order, and update operations such as insert and
remove return new Trie values.
Example (Using a trie for prefix search)
import { Trie } from "effect"
// Create a trie with string-to-number mappings
const trie: Trie.Trie<number> = Trie.make(
["apple", 1],
["app", 2],
["application", 3],
["banana", 4]
)
// Get values by exact key
console.log(Trie.get(trie, "apple")) // Some(1)
console.log(Trie.get(trie, "grape")) // None
// Find all keys with a prefix
console.log(Array.from(Trie.keysWithPrefix(trie, "app")))
// ["app", "apple", "application"]
// Iterate over all entries (sorted alphabetically)
for (const [key, value] of trie) {
console.log(`${key}: ${value}`)
}
// Output: "app: 2", "apple: 1", "application: 3", "banana: 4"
// Check if key exists
console.log(Trie.has(trie, "app")) // true
// Get size
console.log(Trie.size(trie)) // 4
Trie<function (type parameter) A in <A, V>(f: (value: V, key: string) => A): (self: Trie<V>) => Trie<A>A>
<function (type parameter) V in <V, A>(self: Trie<V>, f: (value: V, key: string) => A): Trie<A>V, function (type parameter) A in <V, A>(self: Trie<V>, f: (value: V, key: string) => A): Trie<A>A>(self: Trie<V>(parameter) self: {
pipe: { <A>(this: A): A; <A, B = never>(this: A, ab: (_: A) => B): B; <A, B = never, C = never>(this: A, ab: (_: A) => B, bc: (_: B) => C): C; <A, B = never, C = never, D = never>(this: A, ab: (_: A) => B, bc: (_: B) => C, cd: (_: C) => D): D; <…;
toString: () => string;
toJSON: () => unknown;
}
interface Trie<in out Value>An immutable string-keyed map optimized for prefix lookup. Iteration yields
[key, value] pairs in key order, and update operations such as insert and
remove return new Trie values.
Example (Using a trie for prefix search)
import { Trie } from "effect"
// Create a trie with string-to-number mappings
const trie: Trie.Trie<number> = Trie.make(
["apple", 1],
["app", 2],
["application", 3],
["banana", 4]
)
// Get values by exact key
console.log(Trie.get(trie, "apple")) // Some(1)
console.log(Trie.get(trie, "grape")) // None
// Find all keys with a prefix
console.log(Array.from(Trie.keysWithPrefix(trie, "app")))
// ["app", "apple", "application"]
// Iterate over all entries (sorted alphabetically)
for (const [key, value] of trie) {
console.log(`${key}: ${value}`)
}
// Output: "app: 2", "apple: 1", "application: 3", "banana: 4"
// Check if key exists
console.log(Trie.has(trie, "app")) // true
// Get size
console.log(Trie.size(trie)) // 4
Trie<function (type parameter) V in <V, A>(self: Trie<V>, f: (value: V, key: string) => A): Trie<A>V>, f: (value: V, key: string) => Af: (value: Vvalue: function (type parameter) V in <V, A>(self: Trie<V>, f: (value: V, key: string) => A): Trie<A>V, key: stringkey: string) => function (type parameter) A in <V, A>(self: Trie<V>, f: (value: V, key: string) => A): Trie<A>A): interface Trie<in out Value>An immutable string-keyed map optimized for prefix lookup. Iteration yields
[key, value] pairs in key order, and update operations such as insert and
remove return new Trie values.
Example (Using a trie for prefix search)
import { Trie } from "effect"
// Create a trie with string-to-number mappings
const trie: Trie.Trie<number> = Trie.make(
["apple", 1],
["app", 2],
["application", 3],
["banana", 4]
)
// Get values by exact key
console.log(Trie.get(trie, "apple")) // Some(1)
console.log(Trie.get(trie, "grape")) // None
// Find all keys with a prefix
console.log(Array.from(Trie.keysWithPrefix(trie, "app")))
// ["app", "apple", "application"]
// Iterate over all entries (sorted alphabetically)
for (const [key, value] of trie) {
console.log(`${key}: ${value}`)
}
// Output: "app: 2", "apple: 1", "application: 3", "banana: 4"
// Check if key exists
console.log(Trie.has(trie, "app")) // true
// Get size
console.log(Trie.size(trie)) // 4
Trie<function (type parameter) A in <V, A>(self: Trie<V>, f: (value: V, key: string) => A): Trie<A>A>
} = import TRTR.const map: anymap