factor/basis/dlists
Doug Coleman 3507b9bad7 classes:
- Allow methods to dispatch off union{ } and intersection{ } classes.
- Add not{ } anonymous-complement syntax.
- Define class-name for anonymous-union/intersection/complement and maybes, and clean up pprint.
- Change maybe: foo to maybe{ foo }
- Call sort-classes when making anonymous-union/anonymous-intersection classes so that they are canonicalized.
2012-05-03 19:45:30 -07:00
..
prettyprint Add a seq>dlist word and make a dlist literal DL{ 2011-10-29 01:05:37 -07:00
authors.txt Create basis vocab root 2008-07-28 22:03:13 -05:00
dlists-docs.factor Update documentation for new help lint check 2010-02-19 12:31:52 +13:00
dlists-tests.factor dlists: make a dlist-link tuple so you can "be the node" by subclassing it. this allows you go put a type on the obj>> slot. ensure that dlist nodes are returned with prev/next pointers set to f so they can be reused. dlist-filter used to work destructively on the dlist, make a new dlist instead because the combinator relied on using prev/next of deleted nodes. 2011-11-15 16:33:16 -08:00
dlists.factor classes: 2012-05-03 19:45:30 -07:00
summary.txt Create basis vocab root 2008-07-28 22:03:13 -05:00
tags.txt Create basis vocab root 2008-07-28 22:03:13 -05:00