Compile-time sets and hash tables

[Philippe Sigaud]

Hi,

I'm playing with parsers right now, and have to use a lot of 
(small) sets,  sets of sets and hash tables. I'm getting some 
strange behaviour from built-in AAs and I'm a bit blocked by them 
not working at compile-time.

I think I'm ready to code some small set and hash table for my 
own needs, but since I'm no expert in this, I just wanted to 
check if anyone here as some readily available code. My criteria:

- I'm not using millions of elements. The data I'm manipulating 
is more in the 10-1000s range. So much so that I might use 
T*[ubyte.max] as the underlying type.
- I need sets of sets.
- I'd greatly like for those sets or hash tables to be 
CTFE-compatible.

Does anyone have this?