Return-Path: Delivered-To: apmail-lucene-java-dev-archive@www.apache.org Received: (qmail 77719 invoked from network); 7 Dec 2006 23:10:26 -0000 Received: from hermes.apache.org (HELO mail.apache.org) (140.211.11.2) by minotaur.apache.org with SMTP; 7 Dec 2006 23:10:26 -0000 Received: (qmail 73428 invoked by uid 500); 7 Dec 2006 23:10:32 -0000 Delivered-To: apmail-lucene-java-dev-archive@lucene.apache.org Received: (qmail 73397 invoked by uid 500); 7 Dec 2006 23:10:31 -0000 Mailing-List: contact java-dev-help@lucene.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: java-dev@lucene.apache.org Delivered-To: mailing list java-dev@lucene.apache.org Received: (qmail 73386 invoked by uid 99); 7 Dec 2006 23:10:31 -0000 Received: from herse.apache.org (HELO herse.apache.org) (140.211.11.133) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 07 Dec 2006 15:10:31 -0800 X-ASF-Spam-Status: No, hits=0.0 required=10.0 tests= X-Spam-Check-By: apache.org Received-SPF: neutral (herse.apache.org: local policy) Received: from [169.229.70.167] (HELO rescomp.berkeley.edu) (169.229.70.167) by apache.org (qpsmtpd/0.29) with ESMTP; Thu, 07 Dec 2006 15:10:21 -0800 Received: by rescomp.berkeley.edu (Postfix, from userid 1007) id 421915B78C; Thu, 7 Dec 2006 15:09:59 -0800 (PST) Received: from localhost (localhost [127.0.0.1]) by rescomp.berkeley.edu (Postfix) with ESMTP id 393517F403 for ; Thu, 7 Dec 2006 15:09:59 -0800 (PST) Date: Thu, 7 Dec 2006 15:09:59 -0800 (PST) From: Chris Hostetter To: java-dev@lucene.apache.org Subject: Re: non-overlapping Span queries In-Reply-To: <200612072332.12843.paul.elschot@xs4all.nl> Message-ID: References: <45788E3D.20004@istandfor.com> <200612072332.12843.paul.elschot@xs4all.nl> MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Virus-Checked: Checked by ClamAV on apache.org : > Brooklyn High which is in Brooklyn, NY : : That requires a minimum distance between the matches of the : subqueries, and that is not yet implemented. I was about to suggest that adding that seems like it would be fairly easy, just add a new "int minDistance" to SpanNearQuery and then use it in NearSpansOrdered.docSpansOrdered to ensure that "end1 + minDistance <= start2" and in NearSpansUnordered.atMatch to test that "min.end() + minDistance <= max.start()" ... but then it orruced to me that the whole issue isn't thatsimple when you have a SpanNearQuery with more then two clauses. I'm not even sure what a three clause SpanNearQuery with a miDistance of N would even mean .. is that the min distance between each clause, or between the outer most? Paul: you under stand Span queries a lot better then i do: if you had a two clause SpanNear would my suggestion make sense? we could allways add minDistance to SpanNearQuery, but make it private only only setable from a new constructor that explicitly only takes in two SpanQuery clauses (instead of an array). -Hoss --------------------------------------------------------------------- To unsubscribe, e-mail: java-dev-unsubscribe@lucene.apache.org For additional commands, e-mail: java-dev-help@lucene.apache.org