|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Entry | |
---|---|
net.sourceforge.hatbox |
Uses of Entry in net.sourceforge.hatbox |
---|
Methods in net.sourceforge.hatbox that return Entry | |
---|---|
Entry |
Node.getEntry(int i)
|
Entry |
Node.getMyEntry()
|
protected Entry |
RTree.pickNext(java.util.List<Entry> entryList,
Envelope e1,
Envelope e2)
Pick the entry that has the biggest difference in affinity for the two groups |
protected Entry[] |
RTree.pickSeeds(java.util.List<Entry> entryList)
Choose the most wasteful pair of entries to have in the same node and make them the seeds for each of the split nodes. |
Methods in net.sourceforge.hatbox with parameters of type Entry | |
---|---|
void |
Node.addEntry(Entry entry)
|
void |
Node.changeEntryEnvelope(Entry entry)
Find the entry for this id and change its bounds |
void |
RTree.delete(Entry entry)
Delete an entry from the index. |
void |
RTree.insert(Entry entry)
Insert a new index entry |
Method parameters in net.sourceforge.hatbox with type arguments of type Entry | |
---|---|
protected Entry |
RTree.pickNext(java.util.List<Entry> entryList,
Envelope e1,
Envelope e2)
Pick the entry that has the biggest difference in affinity for the two groups |
protected Entry[] |
RTree.pickSeeds(java.util.List<Entry> entryList)
Choose the most wasteful pair of entries to have in the same node and make them the seeds for each of the split nodes. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |