com.foursquare.geo.quadtree.ShapefileGeo

ShapeTrieNode

class ShapeTrieNode extends KeyShape

A node of the Quadtree

Note that this is a more flexible interpretretation of a Quadtree node because each level need not be (2 x 2). It can be (N x N) Also, there is a limited number of levels. When the deepest level is reached, all remaining shapes are placed on the list and independently queried.

Linear Supertypes
KeyShape, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ShapeTrieNode
  2. KeyShape
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ShapeTrieNode(level: Int, bounds: GeoBounds, alwaysCheckGeometry: Boolean)

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. def addFeature(path: List[(Int, Int)], keyVal: String, geometry: Geometry, levelSizes: Array[Int]): Unit

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  13. def getNearest(geoLat: Double, geoLong: Double, fudger: Option[Fudger] = None): Option[String]

  14. def getNearestList(geoLat: Double, geoLong: Double, fudger: Option[Fudger] = None): List[String]

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  17. def keyValue: Option[String]

    Some if all elems at level have same key value.

    Some if all elems at level have same key value. Avoids unecessary point-in-plane computation

    Definition Classes
    ShapeTrieNode → KeyShape

  18. def makeSubGrid(levelSizes: Array[Int]): Unit

  19. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  20. def nodeBounds: GeoBounds

  21. def nodeLevel: Int

  22. final def notify(): Unit

    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  24. def shape: Geometry

    Definition Classes
    ShapeTrieNode → KeyShape

  25. var subGrid: Option[Array[Array[ShapeTrieNode]]]

    Some if there are deeper levels

  26. def subGridSize: (Int, Int)

  27. var subList: List[ShapeLeafNode]

    Some if the deepest level reached, but muliple keyValues point-in-plane called on each element

  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  29. def toString(): String

    Definition Classes
    AnyRef → Any

  30. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  31. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  32. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from KeyShape

Inherited from AnyRef

Inherited from Any

Ungrouped