2
* @(#)GeneratorHeap.java 1.6 06/10/30
4
* Copyright (c) 2006 Sun Microsystems, Inc. All Rights Reserved.
5
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
7
* This code is free software; you can redistribute it and/or modify it
8
* under the terms of the GNU General Public License version 2 only, as
9
* published by the Free Software Foundation. Sun designates this
10
* particular file as subject to the "Classpath" exception as provided
11
* by Sun in the LICENSE file that accompanied this code.
13
* This code is distributed in the hope that it will be useful, but WITHOUT
14
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
15
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16
* version 2 for more details (a copy is included in the LICENSE file that
17
* accompanied this code).
19
* You should have received a copy of the GNU General Public License version
20
* 2 along with this work; if not, write to the Free Software Foundation,
21
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
23
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
24
* CA 95054 USA or visit www.sun.com if you need additional information or
30
* @author Jacek R. Ambroziak
31
* @group Sun Microsystems Laboratories
34
package com.sun.java.help.search;
38
private static final int InitSize = 128;
39
private int _heapSize = 0;
40
private ConceptGroupGenerator[] _heap;
41
private int _size = InitSize;
42
private int _free = 0;
44
public GeneratorHeap() {
45
_heap = new ConceptGroupGenerator[InitSize];
52
public void addGenerator(ConceptGroupGenerator gen)
56
ConceptGroupGenerator[] newArray =
57
new ConceptGroupGenerator[_size *= 2];
58
System.arraycopy(_heap, 0, newArray, 0, _free);
64
private void buildHeap()
66
for (int i = _heapSize/2; i >= 0; i--)
70
private void heapify(int i)
72
int r = (i + 1) << 1, l = r - 1;
73
int smallest = l<_heapSize&&_heap[l].position()<_heap[i].position()?l:i;
75
if (r < _heapSize && _heap[r].position() < _heap[smallest].position())
79
ConceptGroupGenerator temp = _heap[smallest];
80
_heap[smallest] = _heap[i];
86
public boolean start(RoleFiller[] array) throws Exception
88
if ((_heapSize = _free) > 0)
90
for (int i = 0; i < _free; i++)
93
_heap[0].generateFillers(array);
100
public boolean next(RoleFiller[] array) throws Exception
104
if (!_heap[0].next()) // no more
106
_heap[0] = _heap[--_heapSize];
113
_heap[0].generateFillers(array);