Repositories list

• Containers-Trie

  Public
  A trie implementation (original version from Benoit St-Jean).

  pharo

  pharo

  Smalltalk

  •7•4•0•0•Updated Mar 20, 2026Mar 20, 2026

• Containers-KeyedTree

  Public
  An implementation of KeyedTree

  collectionspharo

  collectionspharo

  Smalltalk

  •

  MIT License

  •4•0•2•0•Updated Mar 20, 2026Mar 20, 2026

• Containers-Array2D

  Public
  A better Array2D implementation

  collectionspharo

  collectionspharo

  Smalltalk

  •9•2•7•2•Updated Mar 20, 2026Mar 20, 2026

• Containers-OrderedSet

  Public
  A Set where an order of elements matters or an OrderedCollection with no duplicates. Supports the complete API of Set and OrderedCollection

  setcollectioncontainers+ 2

  setcollectioncontainersdata-structurespharo

  Smalltalk

  •

  MIT License

  •11•4•1•0•Updated Mar 20, 2026Mar 20, 2026

• Container-AVL

  Public
  AVL Tree from Roassal 3

  Smalltalk

  •

  MIT License

  •9•3•0•0•Updated Mar 10, 2026Mar 10, 2026

• Containers-Queue

  Public
  collectionspharo

  collectionspharo

  Smalltalk

  •6•0•1•1•Updated Jan 14, 2026Jan 14, 2026

• Containers-Deque

  Public
  Deque, or Double Ended Queue, is a generalized version of Queue data structure that allows insert and delete at both ends

  Smalltalk

  •

  MIT License

  •2•0•0•0•Updated Sep 25, 2025Sep 25, 2025

• Containers-BPlusTree

  Public
  MIT License

  •0•0•0•0•Updated Aug 27, 2025Aug 27, 2025

• Containers-RedBlackTree

  Public
  An Efficient Red Black Tree Implementation for Pharo

  Smalltalk

  •

  MIT License

  •2•0•0•0•Updated Aug 19, 2025Aug 19, 2025

• Containers-Buffer

  Public
  Circular buffer implementation with LIFO and FIFO variants

  Smalltalk

  •

  MIT License

  •2•2•1•0•Updated Jul 29, 2025Jul 29, 2025

• Containers-BinarySearchTree

  Public
  An Efficient Binary Search Tree Implementation for Pharo

  Smalltalk

  •

  MIT License

  •2•0•1•1•Updated Jul 27, 2025Jul 27, 2025

• Containers-Stack

  Public
  An Array-based Stack implementation with LIFO order (Last in, First Out)

  collectionstackdatastructures+ 2

  collectionstackdatastructurescontainerspharo

  Smalltalk

  •5•0•1•1•Updated Jul 23, 2025Jul 23, 2025

• Containers-HashTable

  Public
  an hashtable from moose

  pharodatastructure

  pharodatastructure

  Smalltalk

  •1•1•1•0•Updated Apr 16, 2025Apr 16, 2025

• Containers-UniqueOrdered

  Public
  To get unique (set) but ordered collection.

  collectionspharo

  collectionspharo

  Smalltalk

  •3•2•2•0•Updated Apr 16, 2025Apr 16, 2025

• Container-BTree

  Public
  BTree implementation imported from SqueakSource

  Smalltalk

  •

  MIT License

  •6•0•0•0•Updated Mar 26, 2025Mar 26, 2025

• Containers-SmallOrderedSet

  Public
  A small ordered set implementation

  Smalltalk

  •1•0•0•0•Updated Mar 6, 2025Mar 6, 2025

• Hashtable

  Public
  Smalltalk

  •

  MIT License

  •1•0•0•0•Updated May 22, 2024May 22, 2024

• Containers-ChainedDictionary

  Public
  A dictionary with lookup in parent dictionary

  Smalltalk

  •1•1•0•0•Updated Apr 5, 2023Apr 5, 2023

• Containers-RunArray

  Public
  A runarray is a collection optimized for sequence of repeating values.

  Smalltalk

  •2•1•4•1•Updated Jan 1, 2021Jan 1, 2021

• Containers-OrderPreservingDictionary

  Public
  An implementation of multiple dictionaries preserving the order of addition of elements.

  pharo

  pharo

  Smalltalk

  •3•0•1•0•Updated Jan 1, 2021Jan 1, 2021