Containers-KeyedTree
KeyedTree
An implementation of a data structure used to store hierarchical data in Smalltalk.
An implementation of KeyedTree
0 stars
2 watching
1 forks
Language: Smalltalk
last commit: about 4 years ago
Linked from 1 awesome list
collectionspharo
Related projects:
Repository | Description | Stars |
---|---|---|
| An implementation of a hash table data structure in Pharo Smalltalk | 1 |
| A simple implementation of a stack data structure | 0 |
| A Smalltalk implementation of an AVL tree data structure | 4 |
| A Smalltalk implementation of a trie data structure used in searching and indexing | 3 |
| An implementation of a BTree data structure for use in Smalltalk programming | 0 |
| A data structure providing ordered unique elements with a complete API of Set and OrderedCollection | 4 |
| An implementation of multiple dictionaries preserving the order of addition of elements in Smalltalk. | 0 |
| A Smalltalk class optimized for storing sequences of repeating values | 1 |
| A Smalltalk library for loading and managing datasets as data frames. | 9 |
| A data structure implementation for efficient grid organization of items | 3 |
| An implementation of MongoDB client for the Pharo Smalltalk platform. | 19 |
| A Smalltalk binding for the popular SQLite3 database engine. | 22 |
| A Smalltalk library for dynamically adding and removing behavior to objects without modifying classes. | 23 |
| A Smalltalk implementation of the K-means clustering algorithm | 3 |
| A file-per-class format for monticello repositories in Smalltalk. | 32 |