RadixTree.contains

  1. inout(V*) contains(K key)
  2. bool contains(K key)
    struct RadixTree(K, V)
    @nogc nothrow inout
    bool
    contains
    (
    in K key
    )

Return Value

Type: bool

true if key is stored, false otherwise.

Meta