Documentation of 'org.ddogleg.nn.alg.StandardKdTreeSearchNTests' Java class
StandardKdTreeSearchNTests
org.ddogleg.nn.alg

Class StandardKdTreeSearchNTests

    • Constructor Detail

      • StandardKdTreeSearchNTests

        public StandardKdTreeSearchNTests()
    • Method Detail

      • createAlg

        public abstract KdTreeSearchN createAlg()
        Creates a KdTreeSearch which will produce optimal results
      • findClosest_basic_1

        public void findClosest_basic_1()
        Try several searches and see if they all produce good results. Just fine the nearest-neighbor
      • findClosest_nullLeaf

        public void findClosest_nullLeaf()
        See if it can handle a null leaf
      • randomTests

        public void randomTests()
        Randomly generate several searches and check the result
      • findClosest_empty

        public void findClosest_empty()
        The tree is empty and it should always fail
      • findClosest_leaf

        public void findClosest_leaf()
        The tree is a leaf and should always return the same result
      • findClosest_maxDistance

        public void findClosest_maxDistance()
        See if max distance is being respected
      • checkDistance

        public void checkDistance()
        Make sure the distance it returns is correct
      • checkDuplicates

        public void checkDuplicates()
        See of it can handle duplicate values correctly
      • createTreeDuplicates

        public static KdTree createTreeDuplicates()

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.