<p>Hi there people! I have recently implemented a PATRICIA tree in Go and since I started, I've been enhancing it performance-wise.</p>
<p>The core objective of that project was to create a backbone algorithm for a HTTP router/multiplexer (I know, many already exist, mainly in Go, but I wanted to learn how to create one). Because of that, this trie has a feature where it can find named parameters, given a placeholder to search (and a delimiter, if desired).</p>
<p>Since its goal has been fulfilled for me, I understand someone could eventually use this project for their own goals. So, if anyone is interested in it, please check out <a href="https://github.com/gbrlsnchs/patricia" rel="nofollow">the repository</a>. Suggestions, PRs and issues are very welcome!</p>
