TreeMap.findFor

Finds the deepest Node that contains the given position. @return Maybe!Node @see Unittest on how to use it.

  1. Maybe findFor(double x, double y)
    class TreeMap
    findFor
    (
    double x
    ,
    double y
    )
  2. Maybe findFor(double x, double y, Node n)

Meta