On 16/05/2014, at 9:00 AM, John Meacham wrote: > Inspired by a conversation a while ago, I invented a byte stuffing > algorithm that has both the expected optimal 0.2% overhead _and_ is > prefix preserving, meaning values that are close to each other in > radix space before encoding stay close together afterwords.
However it isn't order preserving, right? Approximate order preserving? -- john skaller [email protected] http://felix-lang.org ------------------------------------------------------------------------------ "Accelerate Dev Cycles with Automated Cross-Browser Testing - For FREE Instantly run your Selenium tests across 300+ browser/OS combos. Get unparalleled scalability from the best Selenium testing platform available Simple to use. Nothing to install. Get started now for free." http://p.sf.net/sfu/SauceLabs _______________________________________________ Judy-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/judy-devel
