I'm looking for a concurrent trie implementation to do prefix matching for ids used to identify messages being sent across the components in my application.
MichaelMarcin:Message ids can be generated at runtime. Objects can subscribe/unsubscribe from the messenger dynamically which would mutate the trie. In general after initialization modifying the trie is expected to be much less frequent than reading it. The messenger can be accessed mutated concurrently from as many threads as the hardware can run concurrently. I would expect the trie to contain around a thousand keys but I have no evidence to back that up. Current ids are not limited in size or complexity but currently we have ids from 3 to 40 characters with 1 to 4 parts for prefix matching.