class Immutable::Map::Trie(K, V)

• Immutable::Map::Trie(K, V)
• Reference
• Object

Included Modules

• Enumerable({K, V})

Defined in:

Constant Summary

BITS_PER_LEVEL = 5_u32

BLOCK_SIZE = (2 ** BITS_PER_LEVEL).to_u32

INDEX_MASK = BLOCK_SIZE - 1

Constructors

• .new(children : Array(Trie(K, V)), values : Values(K, V), bitmap : UInt32, levels : Int32, owner : UInt64 | Nil = nil)

Class Method Summary

• .empty(owner : UInt64 | Nil = nil)

Instance Method Summary

• #clear_owner!
• #delete(key : K) : Trie(K, V)
• #delete!(key : K, from : UInt64) : Trie(K, V)
• #each(&)

  Must yield this collection's elements to the block.

• #each
• #empty?

  Returns true if self is empty, false otherwise.

• #fetch(key : K, &block : K -> _)
• #find_entry(key : K) : Entry(K, V) | Nil
• #get(key : K) : V
• #has_key?(key : K) : Bool
• #levels
• #set(key : K, value : V) : Trie(K, V)
• #set!(key : K, value : V, from : UInt64) : Trie(K, V)
• #size

  Returns the number of elements in the collection.

Constructor Detail

Class Method Detail

Instance Method Detail

([] of Int32).empty? # => true
([1]).empty?         # => false

[1, 2, 3, 4].size # => 4