Overview

SEMI-PRECIOUS is a grab bag of simple algorithms/data structures common enough, yet
not deserving a separate library due to their size. It is written in Common Lisp.

Currently includes:
  • a dependency graph mechanism, DEPSOLVER
  • a distrimination tree implementation, DISCRIMINATION
  • one-dimensional octree data structure, OCTREE-1D
  • a somewhat generic state machine, STATE
  • a circular list, Peter Norvig-style, CIRCULAR
  • an early evaluator, EARLY-EVAL

Issue tracking

View all issues

Members

Manager: _deepfire