Tree | /mod.ts | btreemap@0.1.0

class Tree

implements Map<K, V>

import { Tree } from "https://deno.land/x/btreemap@0.1.0/mod.ts";

Constructors

new

Tree()

new

Tree(entries: readonly (readonly [K, V])[] | null)

new

Tree(degree: number)

new

Tree(degree: number, entries: readonly (readonly [K, V])[] | null)

new

Tree(degree?: number | readonly (readonly [K, V])[] | null, entries?: readonly (readonly [K, V])[] | null)

readonly

root

readonly

size: number

readonly

[Symbol.toStringTag]: string

clear(): void

delete(_: K): boolean

entries(): IterableIterator<[K, V]>

forEach(callbackfn: (

value: V,

key: K,

map: Tree<K, V>,

) => void, thisArg?: unknown): void

get(key: K): V | undefined

has(key: K): boolean

keys(): IterableIterator<K>

set(key: K, value: V): this

values(): IterableIterator<V>

[Symbol.iterator](): IterableIterator<[K, V]>

isTree(value: unknown): value is Tree<unknown, unknown>