slset, branch 0.1Lists of symbols as sets
https://code.more-magic.net/slset/atom?h=0.12025-08-19T08:20:48ZAdd type annotations to ensure inlining of put! and get in C52025-08-19T08:20:48ZPeter Bexpeter@more-magic.net2025-08-19T08:20:48Zurn:sha1:8209645f45df43cb305691cae1b8653ab1c0efc5
Without these, we are doomed to have CPS calls to those procedures.
Use singular "slset" instead of plural "slsets"2025-08-19T08:17:33ZPeter Bexpeter@more-magic.net2025-08-19T08:17:33Zurn:sha1:1007f7aef69d3fe28942ad74cc002b49bd1eefaaAllow with-reified-slset to return values as well2025-08-18T12:29:48ZPeter Bexpeter@more-magic.net2025-08-18T12:29:48Zurn:sha1:66eb53e611256a163a0ff4623b889a8382948305
Otherwise, it'll be a bit awkward if we do have something more useful
to return. And we wouldn't be able to get at the slset's list so
easily.
Minor change in benchmark2025-08-18T11:39:32ZPeter Bexpeter@more-magic.net2025-08-15T11:34:27Zurn:sha1:a64d4e18ade6e0eca23806524f863852594f229d
Do not count list construction towards benchmark time.
This doesn't appear to make a big difference but it's good to pull
that out of the calculation.
Allow reification of slsets to get fast adjoin and membership testing2025-08-18T11:39:32ZPeter Bexpeter@more-magic.net2025-08-15T11:26:36Zurn:sha1:7fd4fc4bc759564db7714748646d5dc74f9e7a11Add slset-delete and slset-contains?2025-08-18T11:39:32ZPeter Bexpeter@more-magic.net2025-08-15T09:27:11Zurn:sha1:d3a425a4930fa4395246179ad0af504c783922fd
Not strictly needed, but could be helpful and completes the
operations. Also, if we ever reimplement it using some other
strategy, this might be more useful.
Change Scheme benchmark to allow graphing by measuring time and looping2025-08-18T11:39:32ZPeter Bexpeter@more-magic.net2025-08-15T07:22:08Zurn:sha1:fa8d354bc49b0adc77e6dd6d973c8bd2d33f2769Make sure lset-adjoin removes markings on the adjoined elements2025-08-18T11:39:32ZPeter Bexpeter@more-magic.net2025-08-06T12:20:38Zurn:sha1:a34b5dacb2b96ef0f534bef3ec130839544ab0c8
Add a test to ensure this won't happen again.
Actually use both different sets2025-08-18T11:39:32ZPeter Bexpeter@more-magic.net2025-08-05T09:01:40Zurn:sha1:098c6ba98e7cca7b0810d9283e2afd4a9ac5519b
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...
Add benchmarks for Ruby, Python and Clojure2025-08-18T11:39:32ZPeter Bexpeter@more-magic.net2025-08-05T08:37:58Zurn:sha1:12a4f8e2415a767c501898d3626663f78fb3c33d
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.