slsets - Lists of symbols as sets

Age	Commit message (Collapse)	Author
6 days	Actually use both different sets	Peter Bex
	The original implementation just diffed the same set with itself, and needed a workaround for srfi-1's shortcut on the identical list. Since we're comparing to other implementations with differing sets, it makes sense to do the same here. We actually started doing this but ended up just redefining the same list...
6 days	Add benchmarks for Ruby, Python and Clojure	Peter Bex
	Ruby is about the same speed as slets. Clojure (babashka) and Python are goddamn fast. Python is 10 times as fast. Clojure is twice as slow as Python but that still outperforms Ruby and slsets.
7 days	Disable interrupts	Peter Bex
	Doesn't do that much, but it's a good idea for slsets as well because it makes it unlikely that plist changes are ever observed, because there's no thread switching.
7 days	Add custom hash table implementation to compare direct hash-table-as-set	Peter Bex
	This uses hash-tables directly instead of creating the hash table from the lset every time. It's faster than using srfi-69 because it can be inlined better.
7 days	Add hacky cache for symbol hash	Peter Bex
	Makes a bit of an impact - about 20% faster
7 days	Initial implementation of slsets egg	Peter Bex
	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.