Interface RadixTree<T>

interface RadixTree<T> {
    [toStringTag]: string;
    size: number;
    [iterator](): MapIterator<[string, T | RadixTree<T>]>;
    clear(): void;
    delete(key: string): boolean;
    entries(): MapIterator<[string, T | RadixTree<T>]>;
    forEach(callbackfn: ((value: T | RadixTree<T>, key: string, map: Map<string, T | RadixTree<T>>) => void), thisArg?: any): void;
    get(key: LeafType): undefined | T;
    get(key: string): undefined | RadixTree<T>;
    has(key: string): boolean;
    keys(): MapIterator<string>;
    set(key: LeafType, value: T): this;
    set(key: string, value: RadixTree<T>): this;
    values(): MapIterator<T | RadixTree<T>>;
}

Type Parameters

  • T

Hierarchy

Properties

[toStringTag] size

Methods

[iterator] clear delete entries forEach get has keys set values

Properties

Readonly[toStringTag]

[toStringTag]: string

Readonlysize

size: number

Returns

the number of elements in the Map.

Methods

[iterator]

  • [iterator](): MapIterator<[string, T | RadixTree<T>]>

  • Returns an iterable of entries in the map.

    Returns MapIterator<[string, T | RadixTree<T>]>

clear

  • clear(): void

  • Returns void

delete

  • delete(key): boolean

  • Parameters

    • key: string

    Returns boolean

    true if an element in the Map existed and has been removed, or false if the element does not exist.

entries

  • entries(): MapIterator<[string, T | RadixTree<T>]>

  • Returns an iterable of key, value pairs for every entry in the map.

    Returns MapIterator<[string, T | RadixTree<T>]>

forEach

  • forEach(callbackfn, thisArg?): void

  • Executes a provided function once per each key/value pair in the Map, in insertion order.

    Parameters

    • callbackfn: ((value: T | RadixTree<T>, key: string, map: Map<string, T | RadixTree<T>>) => void)
        • (value, key, map): void

        • Parameters

          Returns void

    • OptionalthisArg: any

    Returns void

get

  • get(key): undefined | T

  • Returns a specified element from the Map object. If the value that is associated to the provided key is an object, then you will get a reference to that object and any change made to that object will effectively modify it inside the Map.

    Parameters

    Returns undefined | T

    Returns the element associated with the specified key. If no element is associated with the specified key, undefined is returned.

  • get(key): undefined | RadixTree<T>

  • Returns a specified element from the Map object. If the value that is associated to the provided key is an object, then you will get a reference to that object and any change made to that object will effectively modify it inside the Map.

    Parameters

    • key: string

    Returns undefined | RadixTree<T>

    Returns the element associated with the specified key. If no element is associated with the specified key, undefined is returned.

has

  • has(key): boolean

  • Parameters

    • key: string

    Returns boolean

    boolean indicating whether an element with the specified key exists or not.

keys

  • keys(): MapIterator<string>

  • Returns an iterable of keys in the map

    Returns MapIterator<string>

set

  • set(key, value): this

  • Adds a new element with a specified key and value to the Map. If an element with the same key already exists, the element will be updated.

    Parameters

    Returns this

  • set(key, value): this

  • Adds a new element with a specified key and value to the Map. If an element with the same key already exists, the element will be updated.

    Parameters

    Returns this

values

  • values(): MapIterator<T | RadixTree<T>>

  • Returns an iterable of values in the map

    Returns MapIterator<T | RadixTree<T>>

Settings

Member Visibility

On This Page

Properties
Methods