Right now, sets are implemented as lists. I'm thinking of implementing them as HashSets. The Rust standard library has that data structure already. The main issue is that every Symstatic object must be hashable, which means that ASTNodes must be hashable.
Right now, sets are implemented as lists. I'm thinking of implementing them as HashSets. The Rust standard library has that data structure already. The main issue is that every Symstatic object must be hashable, which means that ASTNodes must be hashable.