Class Dictionary<K, V>

Type Parameters

Constructors

Properties

_key: null | DictionaryKey<K>
_map: Map<string, V>
_value: null | DictionaryValue<V>
Keys: {
    Address: (() => DictionaryKey<Address>);
    BigInt: ((bits) => DictionaryKey<bigint>);
    BigUint: ((bits) => DictionaryKey<bigint>);
    BitString: ((bits) => DictionaryKey<BitString>);
    Buffer: ((bytes) => DictionaryKey<Buffer>);
    Int: ((bits) => DictionaryKey<number>);
    Uint: ((bits) => DictionaryKey<number>);
} = ...

Type declaration

Values: {
    Address: (() => DictionaryValue<Address>);
    BigInt: ((bits) => DictionaryValue<bigint>);
    BigUint: ((bits) => DictionaryValue<bigint>);
    BigVarInt: ((bits) => DictionaryValue<bigint>);
    BigVarUint: ((bits) => DictionaryValue<bigint>);
    BitString: ((bits) => DictionaryValue<BitString>);
    Bool: (() => DictionaryValue<boolean>);
    Buffer: ((bytes) => DictionaryValue<Buffer>);
    Cell: (() => DictionaryValue<Cell>);
    Dictionary: (<K, V>(key, value) => DictionaryValue<Dictionary<K, V>>);
    Int: ((bits) => DictionaryValue<number>);
    Uint: ((bits) => DictionaryValue<number>);
} = ...

Type declaration

Accessors

Methods

  • Generate merkle proof for multiple keys in the dictionary

    Parameters

    • keys: K[]

      an array of the keys

    Returns Cell

    generated merkle proof cell

  • Low level method for generating pruned dictionary directly. The result can be used as a part of a bigger merkle proof

    Parameters

    • keys: K[]

      an array of the keys

    Returns Cell

    cell that contains the pruned dictionary