Still working on , and currently very busy with improving quality, most of the actual work done inside my library.

After finally supporting and , I now integrated to completely replace my previous stupid and naive hashing. I also added a more involved class as an alternative to the already existing . While the hashtable's size must be pre-configured and collissions are only ever resolved by storing linked lists, the new dictionary dynamically nests multiple hashtables (using different bits of a single hash value). I hope to achieve acceptable scaling while maintaining also acceptable memory overhead that way ...

already uses both container classes as appropriate.

Next I'll probably revisit poser's . I think I could replace condition variables by "simple" , which should also reduce overhead ...

github.com/Zirias/swad

0

If you have a fediverse account, you can quote this note from your own instance. Search https://mastodon.bsd.cafe/users/zirias/statuses/114336398944208565 on your instance and quote it. (Note that quoting is not supported in Mastodon.)