Containers-Trie
trie library
A Smalltalk implementation of a trie data structure used in searching and indexing
A trie implementation (original version from Benoit St-Jean).
3 stars
3 watching
5 forks
Language: Smalltalk
last commit: almost 2 years agoLinked from 1 awesome list
pharo
pharo-open-documentation/awesome-pharoRelated projects:
| Repository | Description | Stars |
|---|---|---|
| pharo-containers/containers-stack | A simple implementation of a stack data structure | 0 |
| pharo-containers/containers-hashtable | An implementation of a hash table data structure in Pharo Smalltalk | 1 |
| pharo-containers/avl | A Smalltalk implementation of an AVL tree data structure | 4 |
| pharo-containers/btree | An implementation of a BTree data structure for use in Smalltalk programming | 0 |
| pharo-containers/containers-keyedtree | An implementation of a data structure used to store hierarchical data in Smalltalk. | 0 |
| pharo-containers/containers-orderedset | A data structure providing ordered unique elements with a complete API of Set and OrderedCollection | 4 |
 pharo-ai/datasets | A Smalltalk library for loading and managing datasets as data frames. | 9 |
 pharo-rdbms/pharo-sqlite3 | A Smalltalk binding for the popular SQLite3 database engine. | 22 |
| pharo-containers/containers-orderpreservingdictionary | An implementation of multiple dictionaries preserving the order of addition of elements in Smalltalk. | 0 |
 pharo-ide/telepharo | Tools and software for remotely managing and developing Pharo images using Smalltalk | 42 |
| pharo-containers/containers-runarray | A Smalltalk class optimized for storing sequences of repeating values | 1 |
 ducasse/containers-grid | A data structure implementation for efficient grid organization of items | 3 |
 astares/pharo-os-unix | A Pharo package providing improved support for Unix systems | 2 |
 pharo-vcs/tonel | A file-per-class format for monticello repositories in Smalltalk. | 32 |
 mumez/tarantalk | A Tarantool client library for Pharo Smalltalk that enables storing and retrieving tuples in a dynamic environment. | 15 |