|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectmtree.utils.Search
public class Search
Constructor Summary | |
---|---|
Search()
|
Method Summary | |
---|---|
static int |
divideObjectUsingPivots(messif.objects.LocalAbstractObject o,
messif.objects.LocalAbstractObject p,
float r)
Decides whether an object o is placed inside a region determined by a pivot p and a radius r on the basis of precomputed distances to pivots without any additional distance computations. |
static int |
divideObjectUsingPivots(messif.objects.LocalAbstractObject o,
messif.objects.LocalAbstractObject p1,
messif.objects.LocalAbstractObject p2)
Decides whether the distance of an object o to a pivot p1 is farther than the distance to a pivot p2 on the basis of precomputed distances to pivots without any additional distance computations. |
static boolean |
filterApproxNodeEntry(NodeEntry ne,
float oParentDist,
messif.objects.LocalAbstractObject q,
float qParentDist,
float r)
Decides whether the specified node entry could be filtered. |
static boolean |
filterNodeEntry(NodeEntry ne,
float oParentDist,
messif.objects.LocalAbstractObject q,
float qParentDist,
float r)
Decides whether the specified node entry could be filtered. |
static boolean |
filterNodeEntryUsingPivots(NodeEntry ne,
messif.objects.LocalAbstractObject q,
float r)
Decides whether the specified node entry could be filtered in the sense of filtering using HR array. |
static java.util.List<InternalNode> |
findLastInternalNodes(Node n)
Looks for all internal nodes with node level 1 (descendants are leaves). |
static java.util.List<LeafNode> |
findLeavesByQuery(Node n,
messif.objects.LocalAbstractObject q,
float r)
Looks for all leaves which are incident to the region R(q, r). |
static java.util.List<LeafNode> |
findLeavesByQuery(Node n,
messif.objects.LocalAbstractObject q,
float r,
java.util.Map<messif.objects.LocalAbstractObject,java.lang.Float> pd)
Looks for all leaves which are incident to the region R(q, r). |
static void |
getAllBuckets(Node n,
java.util.Collection<messif.buckets.LocalBucket> buckets)
Looks for all buckets stored in all leaves of the subtree determined by node n. |
static void |
getAllLeaves(Node n,
java.util.List<LeafNode> leaves)
Looks for all leaves of the subtree determined by node n. |
static messif.objects.LocalAbstractObject |
setPrecompDistances(messif.objects.LocalAbstractObject q,
messif.objects.LocalAbstractObject[] pivots)
Creates the parent distance filter and the fixed array of precomputed distances to the pivots (in both cases the filters are created only if they are not presented within the object q). |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public Search()
Method Detail |
---|
public static messif.objects.LocalAbstractObject setPrecompDistances(messif.objects.LocalAbstractObject q, messif.objects.LocalAbstractObject[] pivots)
public static boolean filterNodeEntry(NodeEntry ne, float oParentDist, messif.objects.LocalAbstractObject q, float qParentDist, float r)
ne
- node entry to be filteredoParentDist
- the distance between the object stored in node entry ne and its parent pivotq
- query objectqParentDist
- the distance between the query object and its parent pivotr
- query radius
public static boolean filterNodeEntryUsingPivots(NodeEntry ne, messif.objects.LocalAbstractObject q, float r)
public static int divideObjectUsingPivots(messif.objects.LocalAbstractObject o, messif.objects.LocalAbstractObject p1, messif.objects.LocalAbstractObject p2)
public static int divideObjectUsingPivots(messif.objects.LocalAbstractObject o, messif.objects.LocalAbstractObject p, float r)
public static boolean filterApproxNodeEntry(NodeEntry ne, float oParentDist, messif.objects.LocalAbstractObject q, float qParentDist, float r)
oParentDist
- the distance between the object stored in node entry ne and its parent pivotqParentDist
- the distance between the query object and its parent pivot
public static void getAllLeaves(Node n, java.util.List<LeafNode> leaves)
public static void getAllBuckets(Node n, java.util.Collection<messif.buckets.LocalBucket> buckets)
public static java.util.List<InternalNode> findLastInternalNodes(Node n)
public static java.util.List<LeafNode> findLeavesByQuery(Node n, messif.objects.LocalAbstractObject q, float r)
public static java.util.List<LeafNode> findLeavesByQuery(Node n, messif.objects.LocalAbstractObject q, float r, java.util.Map<messif.objects.LocalAbstractObject,java.lang.Float> pd)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |