RadixTree.insert

Insert key.

  1. bool insert(K key, V value)
    struct RadixTree(K, V)
    @nogc
    bool
    insert
    (
    in K key
    ,
    in V value
    )
  2. bool insert(K key)

Return Value

Type: bool

true if key wasn't previously added, false otherwise.

Meta