phobos-next ~master (2024-03-19T05:49:32Z)

RadixTree.insert

nxt container trie RadixTree

Insert key.

  1. bool insert(ElementType e)
  2. bool insert(MK key, V value)
  3. bool insert(MK key)
    struct RadixTree(K, V, A = Mallocator)
    @nogc
    static if(!(RawTree.hasValue))
    bool
    insert
    (
    const scope MK key
    )
    if (
    isTrieableKeyType!(K) &&
    isAllocator!A
    )

Return Value

Type: bool

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

Meta

Source

See Implementation

nxt container trie RadixTree aliasesconstructorsfunctionsstructs

Page generated by adrdox