| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 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. | |||
 |
index : slsets | |
| Lists of symbols as sets |
| summaryrefslogtreecommitdiff |