Trie Class

A trie is a tree structure that implements a radix search. Each node of the tree has a sub-node for each possible next byte.

For a list of all members of this type, see Trie Members.

System.Object
bedrock.collections.Trie
bedrock.collections.IndexedTrie

[Visual Basic]

<RCS(State:="Exp", Revision:="1.1", Version:=1.1, Date:=13/06/2003 9.16.14, DateString:="13/06/2003 9.16.14", Author:="Administrator", Archive:="D:\\CVSROOT/TIMP2/jabber-net/bedrock/collections/Trie.cs,v"), _ DefaultMember(MemberName:="Item")>

Public Class Trie

Implements IDictionary, ICollection, IEnumerable

[C#]

[RCS(State="Exp", Revision="1.1", Version=1.1, Date=13/06/2003 9.16.14, DateString="13/06/2003 9.16.14", Author="Administrator", Archive="D:\\CVSROOT/TIMP2/jabber-net/bedrock/collections/Trie.cs,v")]

[DefaultMember(MemberName="Item")]

public class Trie : IDictionary, ICollection, IEnumerable

Thread Safety

Public static (Shared in Visual Basic) members of this type are safe for multithreaded operations. Instance members are not guaranteed to be thread-safe.

Requirements

Namespace: bedrock.collections

Assembly: tipic.xmpp (in tipic.xmpp.dll)

Trie Class

Thread Safety

Requirements

See Also