Return-Path: Delivered-To: apmail-jakarta-lucene-dev-archive@apache.org Received: (qmail 33595 invoked from network); 5 Jun 2002 01:46:44 -0000 Received: from unknown (HELO nagoya.betaversion.org) (192.18.49.131) by daedalus.apache.org with SMTP; 5 Jun 2002 01:46:44 -0000 Received: (qmail 25353 invoked by uid 97); 5 Jun 2002 01:46:54 -0000 Delivered-To: qmlist-jakarta-archive-lucene-dev@jakarta.apache.org Received: (qmail 25283 invoked by uid 97); 5 Jun 2002 01:46:53 -0000 Mailing-List: contact lucene-dev-help@jakarta.apache.org; run by ezmlm Precedence: bulk List-Unsubscribe: List-Subscribe: List-Help: List-Post: List-Id: "Lucene Developers List" Reply-To: "Lucene Developers List" Delivered-To: mailing list lucene-dev@jakarta.apache.org Received: (qmail 25272 invoked by uid 97); 5 Jun 2002 01:46:52 -0000 X-Antivirus: nagoya (v4198 created Apr 24 2002) Date: 5 Jun 2002 01:46:39 -0000 Message-ID: <20020605014639.64661.qmail@icarus.apache.org> From: otis@apache.org To: jakarta-lucene-cvs@apache.org Subject: cvs commit: jakarta-lucene/src/java/org/apache/lucene/util PriorityQueue.java X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N otis 2002/06/04 18:46:39 Modified: src/java/org/apache/lucene/util PriorityQueue.java Log: - Fixed clear() method that wasn't setting the very last heap element to null, as reported at http://nagoya.apache.org/bugzilla/show_bug.cgi?id=9454. PR: 9454 Revision Changes Path 1.2 +7 -7 jakarta-lucene/src/java/org/apache/lucene/util/PriorityQueue.java Index: PriorityQueue.java =================================================================== RCS file: /home/cvs/jakarta-lucene/src/java/org/apache/lucene/util/PriorityQueue.java,v retrieving revision 1.1 retrieving revision 1.2 diff -u -r1.1 -r1.2 --- PriorityQueue.java 18 Sep 2001 16:30:00 -0000 1.1 +++ PriorityQueue.java 5 Jun 2002 01:46:39 -0000 1.2 @@ -72,9 +72,9 @@ heap = new Object[heapSize]; } - /** Adds an Object to a PriorityQueue in log(size) time. */ + /** Adds an Object to a PriorityQueue in log(size) time. */ public final void put(Object element) { - size++; + size++; heap[size] = element; upHeap(); } @@ -88,7 +88,7 @@ } /** Removes and returns the least element of the PriorityQueue in log(size) - time. */ + time. */ public final Object pop() { if (size > 0) { Object result = heap[1]; // save first value @@ -111,16 +111,16 @@ public final void adjustTop() { downHeap(); } - + /** Returns the number of elements currently stored in the PriorityQueue. */ public final int size() { return size; } - + /** Removes all entries from the PriorityQueue. */ public final void clear() { - for (int i = 0; i < size; i++) + for (int i = 0; i <= size; i++) heap[i] = null; size = 0; } @@ -136,7 +136,7 @@ } heap[i] = node; // install saved node } - + private final void downHeap() { int i = 1; Object node = heap[i]; // save top node -- To unsubscribe, e-mail: For additional commands, e-mail: