| commit | 0c8643845555805048f50c783e118762e2c43a26 | |
| author | Richard M Kreuter <kreuter@users.sourceforge.net> | |
| Thu, 11 Sep 2008 15:52:49 +0000 (11 15:52 +0000) | ||
| committer | Richard M Kreuter <kreuter@users.sourceforge.net> | |
| Thu, 11 Sep 2008 15:52:49 +0000 (11 15:52 +0000) | ||
| tree | 2cafb8013372cc8a0e762d87905d459444bd900d | treesnapshot (tar.gz zip) |
| parent | 447a67e0ac2a274d524e6fa0aa11daff906ed91e | commitdiff |
1.0.20.4: Use a new set implementation for constraint propagation.
* Introduce an interface layer called "CONSET" into CP. CONSETs
mostly like SSETs, except that a few destructive operations return
no value.
* Introduce a CONSET implementation that uses a bit-vector and some
bookkeeping instead of an SSET. This tends to improve run time real
time for compilation of many Lisp systems.
* Introduce an interface layer called "CONSET" into CP. CONSETs
mostly like SSETs, except that a few destructive operations return
no value.
* Introduce a CONSET implementation that uses a bit-vector and some
bookkeeping instead of an SSET. This tends to improve run time real
time for compilation of many Lisp systems.