lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "David Smiley (JIRA)" <>
Subject [jira] [Updated] (LUCENE-4645) Implement spatial CONTAINS for RecursivePrefixTree
Date Mon, 01 Apr 2013 21:23:15 GMT


David Smiley updated LUCENE-4645:

    Attachment: LUCENE-4645__Spatial_Contains.patch

The attached patch implements the Contains algorithm for RecursivePrefixTreeStrategy; includes

Unlike Intersects & Within, this one doesn't share the same tree visiting code, but it
is also a recursive trie algorithm.  I expect for typical use cases that it'll be quite scalable
and fast, though it does have to traverse all the way to the bottom detail at least once.

The existing test infrastructure made testing this easy.  The ~260 lines of often complicated
code that implements the algorithm and miraculously it passed right away.  I upped the test
repetitions to 1000 and set some break points at key points and indeed, it appears to work.
 Today is a good day :-)

[~ryantxu], you seemed interested in getting ahold of this algorithm.  Do you want to test
it on your data?  

I'll commit this in a couple days.
> Implement spatial CONTAINS for RecursivePrefixTree
> --------------------------------------------------
>                 Key: LUCENE-4645
>                 URL:
>             Project: Lucene - Core
>          Issue Type: New Feature
>          Components: modules/spatial
>            Reporter: David Smiley
>            Assignee: David Smiley
>             Fix For: 4.3
>         Attachments: LUCENE-4645__Spatial_Contains.patch

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see:

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message