Initial implementation of slsets egg

This implements sets of symbols *as lists*, like in the srfi-1 lset
operations.  It maintains the benefit of using lists for everything,
but not having to pay the quadratic performance penalty that srfi-1
entails.  We achieve this by using plist operations to "mark" items
so we have to visit the list "set" only a fixed number of times.

1 files changed, 8 insertions, 0 deletions

diff --git a/slsets.egg b/slsets.egg
new file mode 100644
index 0000000..fd2b6f3
--- /dev/null
+++ b/slsets.egg
@@ -0,0 +1,8 @@
+;;; slsets.egg -*- Scheme -*-
+
+((synopsis "Lists of symbols as sets")
+ (author "Peter Bex")
+ (category data)
+ (license "BSD")
+ (test-dependencies test)
+ (components (extension slsets (csc-options "-O3"))))