Data Structures in Smalltalk

$\,$

• 1. Object model
  • 1.1. An Object, simply
  • 1.2. nil, even more simpler
  • 1.3. true and false
  • 1.4. Object class and its superclasses
    • 1.4.1. Trait class
• 2. Hierarchies
  • 2.1. Magnitude hierarchy
    • 2.1.1. The character π
    • 2.1.2. DateAndTime, now
    • 2.1.3. The integer 13 in various representations
    • 2.1.4. The irrational π
    • 2.1.5. A (reflective) Association
    • 2.1.6. Some Fractions, with kisses by mediants
    • 2.1.7. Magnitude hierarchy, again
  • 2.2. Link hierarchy
  • 2.3. Collection hierarchy
    • 2.3.1. Lorem ipsum
    • 2.3.2. An Array of (generalized) Fibonacci numbers
    • 2.3.3. 2-Dimensional arrays
    • 2.3.4. Golden ratios
      • 2.3.4.1. One-to-Many descriptors
    • 2.3.5. Some ByteArrays
    • 2.3.6. Binary Reflected Gray Codes
    • 2.3.7. A Heap, step by step construction
    • 2.3.8. A Set
    • 2.3.9. A Dictionary
    • 2.3.10. A Bag
  • 2.4. Random hierarchy
    • 2.4.1. The uniform distribution
    • 2.4.2. The Bernoulli distribution
    • 2.4.3. The binomial distribution
    • 2.4.4. The geometric distribution
    • 2.4.5. The exponential distribution
    • 2.4.6. The gaussian distribution
    • 2.4.7. The bivariate gaussian distribution
  • 2.5. RBNode hierarchy
    • 2.5.1. A quine RBProgramNode
  • 2.6. A miscellanea of some objects
    • 2.6.1. A Point
    • 2.6.2. The Color gray, translucent
    • 2.6.3. A RSShape of a polygon, quoting itself
    • 2.6.4. A Context
    • 2.6.5. A Git repository
• 3. Bits
  • 3.1. Wizardry
    • 3.1.1. Average without overflow
    • 3.1.2. Toggling between values
    • 3.1.3. Next or previous even or odd value
• 4. Numbers
  • 4.1. Fibonacci numbers
    • 4.1.1. Exponential implementation
    • 4.1.2. Memoized implementation
    • 4.1.3. Tail-call implementation
  • 4.2. Multiplication
    • 4.2.1. Horner's method
    • 4.2.2. Estrin's method
    • 4.2.3. Karatsuba's method
    • 4.2.4. Factorials
  • 4.3. Quotients and remainders
  • 4.4. Greatest Common Divisor
  • 4.5. Diophantine equations
    • 4.5.1. Coprimes
    • 4.5.2. $\mathbb{Z}_{17}$ field
    • 4.5.3. $GCD(f_{n}, f_{n+1})$, where $f_{n}$ is the $n$-th Fibonacci number
    • 4.5.4. Kissing Fractions
  • 4.6. Skew Binary Canonical sparse representation
• 5. Randomization
  • 5.1. $k$-th element selection
• 6. Links
  • 6.1. Link objects
  • 6.2. ValueLink objects
    • 6.2.1. Topological sorting
• 7. Lists
  • 7.1. Linked
  • 7.2. Skip lists
• 8. Trees
  • 8.1. Search sets
  • 8.2. Red-Black sets
  • 8.3. Leftist heaps
  • 8.4. Binomial heaps
  • 8.5. Splay heaps
• 9. Storage pools
  • 9.1. Stack pool
  • 9.2. Queue pool
  • 9.3. CircularList pool
    • 9.3.1. Addition of polynomials
• 10. Computational geometry
  • 10.1. Parametric curves
    • 10.1.1. Neile parabola
    • 10.1.2. Butterfly curve
  • 10.2. Bezier curves
    • 10.2.1. Baricentric coordinates and affine transforms
    • 10.2.2. Closed control net
    • 10.2.3. Degree elevation
    • 10.2.4. Designing notes
• 11. Open topics
  • 11.1. Sorting
• 12. Bibliography

Moreover, have a look at the Index.