class abstract

Abstract TrieNode with a possible key and value.

Inheritance

Implementers

Constructors

children → Iterable<TrieNode<K, P, V>>: Ordered child nodes.
no setterinherited
entries → Iterable<MapEntry<K, V>>: An iterable over this node and all its children
no setterinherited
hasChildren → bool: Returns true, if the node has child nodes.
no setterinherited
hashCode → int: The hash code for this object.
no setterinherited
hasKeyAndValue ↔ bool: Returns true, if the node has a key and value.
getter/setter pairoverride-getter
key → K: Returns the key of the node, if this node has a key and value.
no setteroverride
parts → Iterable<P>: Parts of the child nodes.
no setterinherited
runtimeType → Type: A representation of the runtime type of the object.
no setterinherited
value → V: Returns the value of the node, if this node has a key and value.
no setteroverride

addChild(P part) → TrieNode<K, P, V>: Adds a new node with the provided part, or returns the existing one.
inherited
clearChildren() → void: Clears all the child nodes.
inherited
clearKeyAndValue() → void: Clears the key and value, if present.
override
getChild(P part) → TrieNode<K, P, V>?: Returns the node with the provided part, or null.
inherited
noSuchMethod(Invocation invocation) → dynamic: Invoked when a nonexistent method or property is accessed.
inherited
removeChild(P part) → TrieNode<K, P, V>?: Returns the removed node with the provided part, or null.
inherited
setKeyAndValue(K key, V value) → void: Sets (or replaces) the key and value.
override
toString() → String: A string representation of this object.
inherited