GeoPointTree

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(x: IVector2): IGeoPoint

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def -(x: IGeoPoint): IVector2

def -(x: IVector2): IGeoPoint

def /:[B](z: B)(op: (B, T) ⇒ B): B

def :\[B](z: B)(op: (T, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

def appendPoint(point: T): Unit

Append point to set

def appendPoints(points: TraversableOnce[T]): Unit

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

lazy val circumradius: Double

Get a spherical crown to hash block

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def companion: GenericCompanion[Iterable]

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def count(p: (T) ⇒ Boolean): Int

val dataList: ArrayBuffer[T]

def directionTo(point: IGeoPoint): Double

Get the direction from this to target point in unit of Degree

def drop(n: Int): Iterable[T]

def dropRight(n: Int): Iterable[T]

def dropWhile(p: (T) ⇒ Boolean): Iterable[T]

final def eq(arg0: AnyRef): Boolean

def equals(o: Any): Boolean

Avoid duplication in Set or key of the Map

def exists(p: (T) ⇒ Boolean): Boolean

def filter(p: (T) ⇒ Boolean): Iterable[T]

def filterNot(p: (T) ⇒ Boolean): Iterable[T]

def find(p: (T) ⇒ Boolean): Option[T]

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Boolean): Boolean

def foreach[U](f: (T) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

val geoBox: GeoBox

Get bound box of this block

def geoFrechet(points: TraversableOnce[IGeoPoint], searchRadius: Double = 0.5): TraversableOnce[Double]

Get geo distance of nearest point in set

def geoFrechetSimilarity(points: Iterable[IGeoPoint], searchRadius: Double = 0.5): Double

Get similarity of the route and set

def geoNear(point: IGeoPoint, maxDistance: Double): Option[T]

草稿： 给每个Block评分，优先在符合条件的，且最近的Block里面找， 找到的符合条件的最近点的distance作为maxDistanceLimit传入下一个Block， 本质上是一个状态机 这样找最快(单核条件下)，但是并行度低

final def geoTo(point: IGeoPoint): Double

Get distance from this to point or point to this (should be same)

def geoWithin(point: IGeoPoint, maxDistance: Double = 1.0): Iterable[T]

Search all points in radius of maxDistance

def geoWithinRing(point: IGeoPoint, minDistance: Double, maxDistance: Double): Iterable[T]

Search point within ring

def getBoundaryPoints(point: IGeoPoint): Iterable[IGeoPoint]

Get points on boundary maybe the min/max distance

def getCenterPoint: IGeoPoint

Get center point of the hash block

final def getClass(): Class[_]

def getGeoHashAccuracy: Long

Accuracy to mesh earth into N*N parts

def getIndexCode: Long

Get a unique indexCode as type T

def getIndexCodeTuple: (Long, Long)

decompose code tuple from code

def getLatitude: Double

Get latitude recommended in WGS84 format

def getLatitudeTuple: Long

Get latitude part of decomposed code

def getLongitude: Double

Get longitude recommended in WGS84 format

def getLongitudeTuple: Long

Get longitude part of decomposed code

def getMaxDistance(x: IGeoPoint): Double

get max distance from block to point

def getMaxDistance(x: IHashableGeoBlock): Double

Get max distance from block to this block

def getMinDistance(x: IGeoPoint): Double

get min distance from block to point

def getMinDistance(x: IHashableGeoBlock): Double

Get min distance from block to this block

def getPoints: Iterable[T]

Query all points in set

def groupBy[K](f: (T) ⇒ K): Map[K, Iterable[T]]

def grouped(size: Int): Iterator[Iterable[T]]

def hasDefiniteSize: Boolean

def hashCode(): Int

Create a hashCode to accelerate operations in HashSet or HashMap ect.

def head: T

def headOption: Option[T]

def init: Iterable[T]

def inits: Iterator[Iterable[T]]

lazy val inradius: Double

Get an inner circle in hash block

def isEmpty: Boolean

def isEqual(x: IHashedIndex[Long]): Boolean

isEqual function

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

def lastOption: Option[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[T, Iterable[T]]

val nextLayer: Map[IHashableGeoBlock, GeoPointTree[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[T]

def parCombiner: Combiner[T, ParIterable[T]]

def partition(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

def product[B >: T](implicit num: Numeric[B]): B

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

def repr: Iterable[T]

def reversed: List[T]

def sameElements[B >: T](that: GenIterable[B]): Boolean

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[T], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[T], B, That]): That

def seq: Iterable[T]

def size: Int

def slice(from: Int, until: Int): Iterable[T]

def sliding(size: Int, step: Int): Iterator[Iterable[T]]

def sliding(size: Int): Iterator[Iterable[T]]

def span(p: (T) ⇒ Boolean): (Iterable[T], Iterable[T])

def splitAt(n: Int): (Iterable[T], Iterable[T])

def stringPrefix: String

def sum[B >: T](implicit num: Numeric[B]): B

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

def tail: Iterable[T]

def tails: Iterator[Iterable[T]]

def take(n: Int): Iterable[T]

def takeRight(n: Int): Iterable[T]

def takeWhile(p: (T) ⇒ Boolean): Iterable[T]

def thisCollection: Iterable[T]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: T]: Buffer[B]

def toCollection(repr: Iterable[T]): Iterable[T]

def toGeoBox: GeoBox

Get boundary box of hash block

def toGeoJSON: JSONObject

Get scala original JSON object, JSON object deprecated in Scala 2.12 but still using in 2.10

def toGeoJSONString: String

final def toIVector2: IVector2

Get Mercator projection potision as vector2

final def toIVector3: IVector3

Get vector3 in R3 on 2d sphere

def toIndexedSeq: IndexedSeq[T]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def verifyLatitude: Unit

Verify is latitude value is legal

def verifyLongitude: Unit

Verify is longitude value is legal

def verifyValues: Unit

Verify is latitude & longitude values are legal

def view(from: Int, until: Int): IterableView[T, Iterable[T]]

def view: IterableView[T, Iterable[T]]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Iterable[T]]

def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[T], (A1, B), That]): That

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[Iterable[T], (A1, Int), That]): That

final def ~>(point: IGeoPoint): Double

Alias of geoTo

def finalize(): Unit