Skip to content

Commit 95f2f6b

Browse files
Update CTOptimizedTrieNode.class.st
1 parent 22a6f8b commit 95f2f6b

1 file changed

Lines changed: 3 additions & 3 deletions

File tree

src/Containers-Trie/CTOptimizedTrieNode.class.st

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -2,12 +2,12 @@
22
I am the node of a optimized Trie node, I have the children in an array as pairs.
33
I am used inside a CTOptimizedTrie
44
The first element is the key and the second the node.
5-
This nodes have a string as a key, not a single character.
5+
These nodes have a string as a key, not a single character.
66
77
My users should use:
88
9-
- #findChildWithString: to get my subnode that aplies to the given string, nil if there is not node.
10-
- #findChildWithString:storingAncestors:adding: to get my subnode that aplies to the given string, nil if there is not node. If the node does not exists, it will be added depending of the adding parameter. Also it will store the ancestors passed to reach the final node.
9+
- #findChildWithString: to get my subnode that applies to the given string, nil if there is no node.
10+
- #findChildWithString:storingAncestors:adding: to get my subnode that applies to the given string, nil if there is no node. If the node does not exist, it will be added depending on the adding parameter. Also it will store the ancestors passed to reach the final node.
1111
- #removeNode: Removes a node from my self.
1212
- #withAllChildrenDo: iterates over me and my children.
1313

0 commit comments

Comments
 (0)