But I haven’t written a clear note about how to handle mismatched alignment between end of key and nibble
-
-
However I think with some care we can avoid stepping on the rakes in the grass :-)
1 reply 0 retweets 0 likes -
I will maybe write something about it - this week is dedicated to qp hacking when I am not in the beer festival :-) :-)

1 reply 0 retweets 0 likes -
Cool :) I'd be glad to update my Rust implementation :)
2 replies 0 retweets 0 likes -
BTW current thoughts about tuning for DNS at https://dotat.at/cgi/git/qp.git/blob/2e9b3c750ff4703f0279477370a7c2fb2073fb6a:/notes-dns.md …
1 reply 0 retweets 0 likes -
I want to try it for v6 prefixes, a writeup would be appreciated! I'm still not sure how to best store mask for the trailing bits
1 reply 0 retweets 0 likes -
OK I have hammered out some notes - https://dotat.at/prog/qp/notes-bitstrings-prefixes.html …
1 reply 0 retweets 0 likes -
You should also follow the link to my previous review of a couple of papers - https://dotat.at/prog/qp/blog-2016-02-23.html … - and look at the poptrie paper
1 reply 0 retweets 0 likes -
Oh wow, thanks
I skimmed through the poptrie paper before, but the only implementation has closed license so I don't event want to look1 reply 0 retweets 0 likes -
The leaf compression idea in the poptrie paper is very clever - you should use it if you are writing an IP prefix matcher :-)
1 reply 0 retweets 1 like
-
-
I guess I shouldn't be lazy then and write a second implementation, thanks for pointers anyway!0 replies 0 retweets 1 likeThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.