ShapeLuceneRDD

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def ++(other: RDD[(K, V)]): RDD[(K, V)]

   

   Definition Classes

   RDD

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

   

   Definition Classes

   AnyRef → Any

5. lazy val Config: Config

   

   Definition Classes

   Configurable

6. val DefaultFacetNum: Int

   

   Attributes

   protected

   Definition Classes

   LuceneRDDConfigurable

7. val DefaultTopK: Int

   

   Default value for topK queries

   Default value for topK queries

   Attributes

   protected

   Definition Classes

   LuceneRDDConfigurable

8. val MaxDefaultTopKValue: Int

   

   Attributes

   protected

   Definition Classes

   LuceneRDDConfigurable

9. val StringFieldsAnalyzed: Boolean

   

   Attributes

   protected

   Definition Classes

   LuceneRDDConfigurable

10. val StringFieldsIndexOptions: IndexOptions

    

    Attributes

    protected

    Definition Classes

    LuceneRDDConfigurable

11. val StringFieldsOmitNorms: Boolean

    

    Attributes

    protected

    Definition Classes

    LuceneRDDConfigurable

12. val StringFieldsStoreTermPositions: Boolean

    

    Attributes

    protected

    Definition Classes

    LuceneRDDConfigurable

13. val StringFieldsStoreTermVector: Boolean

    

    Attributes

    protected

    Definition Classes

    LuceneRDDConfigurable

14. def aggregate[U](zeroValue: U)(seqOp: (U, (K, V)) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U

    

    Definition Classes

    RDD

15. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

16. def bboxSearch(lowerLeft: PointType, upperRight: PointType, k: Int, operationName: String): LuceneRDDResponse

    

    Bounding box search with rectangle

    Bounding box search with rectangle

    lowerLeft

    Lower left corner

    upperRight

    Upper right corner

    k

    Number of results

    operationName

    Intersect, contained, etc.

17. def bboxSearch(center: PointType, radius: Double, k: Int, operationName: String = SpatialOperation.Intersects.getName): LuceneRDDResponse

    

    Bounding box search with center and radius

    Bounding box search with center and radius

    center

    given as (x, y)

    radius

    in kilometers (KM)

18. def cache(): ShapeLuceneRDD.this.type

    

    Definition Classes

    ShapeLuceneRDD → RDD

19. def cartesian[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((K, V), U)]

    

    Definition Classes

    RDD

20. def checkpoint(): Unit

    

    Definition Classes

    RDD

21. def circleSearch(center: PointType, radius: Double, k: Int): LuceneRDDResponse

    

    Search for points within a circle

    Search for points within a circle

    center

    center of circle

    radius

    radius of circle in kilometers (KM)

    k

    number of points to return

22. def clearDependencies(): Unit

    

    Attributes

    protected

    Definition Classes

    RDD

23. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

24. def close(): Unit

    

25. def coalesce(numPartitions: Int, shuffle: Boolean, partitionCoalescer: Option[PartitionCoalescer])(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    

    Definition Classes

    RDD

26. def collect[U](f: PartialFunction[(K, V), U])(implicit arg0: ClassTag[U]): RDD[U]

    

    Definition Classes

    RDD

27. def collect(): Array[(K, V)]

    

    Definition Classes

    RDD

28. def compute(part: Partition, context: TaskContext): Iterator[(K, V)]

    

    RDD compute method.

    RDD compute method.

    Definition Classes

    ShapeLuceneRDD → RDD

29. def context: SparkContext

    

    Definition Classes

    RDD

30. def count(): Long

    

    Definition Classes

    ShapeLuceneRDD → RDD

31. def countApprox(timeout: Long, confidence: Double): PartialResult[BoundedDouble]

    

    Definition Classes

    RDD

32. def countApproxDistinct(relativeSD: Double): Long

    

    Definition Classes

    RDD

33. def countApproxDistinct(p: Int, sp: Int): Long

    

    Definition Classes

    RDD

34. def countByValue()(implicit ord: Ordering[(K, V)]): Map[(K, V), Long]

    

    Definition Classes

    RDD

35. def countByValueApprox(timeout: Long, confidence: Double)(implicit ord: Ordering[(K, V)]): PartialResult[Map[(K, V), BoundedDouble]]

    

    Definition Classes

    RDD

36. final def dependencies: Seq[Dependency[_]]

    

    Definition Classes

    RDD

37. def distinct(): RDD[(K, V)]

    

    Definition Classes

    RDD

38. def distinct(numPartitions: Int)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    

    Definition Classes

    RDD

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

    

    Definition Classes

    AnyRef

40. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

41. def exists(elem: K): Boolean

    

42. def filter(pred: (K, V) ⇒ Boolean): ShapeLuceneRDD[K, V]

    

43. def filter(f: ((K, V)) ⇒ Boolean): RDD[(K, V)]

    

    Definition Classes

    RDD

44. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

45. def first(): (K, V)

    

    Definition Classes

    RDD

46. def firstParent[U](implicit arg0: ClassTag[U]): RDD[U]

    

    Attributes

    protected[org.apache.spark]

    Definition Classes

    RDD

47. def flatMap[U](f: ((K, V)) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]

    

    Definition Classes

    RDD

48. def fold(zeroValue: (K, V))(op: ((K, V), (K, V)) ⇒ (K, V)): (K, V)

    

    Definition Classes

    RDD

49. def foreach(f: ((K, V)) ⇒ Unit): Unit

    

    Definition Classes

    RDD

50. def foreachPartition(f: (Iterator[(K, V)]) ⇒ Unit): Unit

    

    Definition Classes

    RDD

51. def getCheckpointFile: Option[String]

    

    Definition Classes

    RDD

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

    

    Definition Classes

    AnyRef → Any

53. def getDependencies: Seq[Dependency[_]]

    

    Attributes

    protected

    Definition Classes

    RDD

54. val getLinkerMethod: String

    

    Attributes

    protected

    Definition Classes

    LuceneRDDConfigurable

55. val getLocationFieldName: String

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDDConfigurable

56. final def getNumPartitions: Int

    

    Definition Classes

    RDD

    Annotations

    @Since( "1.6.0" )

57. def getPartitions: Array[Partition]

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDD → RDD

58. def getPreferredLocations(s: Partition): Seq[String]

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDD → RDD

59. val getPrefixTreeMaxDistErr: Double

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDDConfigurable

60. val getPrefixTreeMaxLevel: Int

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDDConfigurable

61. val getPrefixTreeName: String

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDDConfigurable

62. val getShapeFormat: String

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDDConfigurable

63. val getShapeLinkerMethod: String

    

    Attributes

    protected

    Definition Classes

    ShapeLuceneRDDConfigurable

64. def getStorageLevel: StorageLevel

    

    Definition Classes

    RDD

65. def glom(): RDD[Array[(K, V)]]

    

    Definition Classes

    RDD

66. def groupBy[K](f: ((K, V)) ⇒ K, p: Partitioner)(implicit kt: ClassTag[K], ord: Ordering[K]): RDD[(K, Iterable[(K, V)])]

    

    Definition Classes

    RDD

67. def groupBy[K](f: ((K, V)) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(K, V)])]

    

    Definition Classes

    RDD

68. def groupBy[K](f: ((K, V)) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(K, V)])]

    

    Definition Classes

    RDD

69. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

70. val id: Int

    

    Definition Classes

    RDD

71. val indexAnalyzerName: String

    

    Analyzer during indexing time

72. def initializeLogIfNecessary(isInterpreter: Boolean, silent: Boolean): Boolean

    

    Attributes

    protected

    Definition Classes

    Logging

73. def initializeLogIfNecessary(isInterpreter: Boolean): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

74. def intersection(other: RDD[(K, V)], numPartitions: Int): RDD[(K, V)]

    

    Definition Classes

    RDD

75. def intersection(other: RDD[(K, V)], partitioner: Partitioner)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

    

    Definition Classes

    RDD

76. def intersection(other: RDD[(K, V)]): RDD[(K, V)]

    

    Definition Classes

    RDD

77. def isCheckpointed: Boolean

    

    Definition Classes

    RDD

78. def isEmpty(): Boolean

    

    Definition Classes

    RDD

79. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

80. def isTraceEnabled(): Boolean

    

    Attributes

    protected

    Definition Classes

    Logging

81. final def iterator(split: Partition, context: TaskContext): Iterator[(K, V)]

    

    Definition Classes

    RDD

82. def keyBy[K](f: ((K, V)) ⇒ K): RDD[(K, (K, V))]

    

    Definition Classes

    RDD

83. def knnSearch(queryPoint: PointType, k: Int, searchString: String = ...): LuceneRDDResponse

    

    K-nearest neighbors search

    K-nearest neighbors search

    queryPoint

    query point (X, Y)

    k

    number of nearest neighbor points to return

    searchString

    Lucene query string

84. def linkByKnn[T](that: RDD[T], pointFunctor: (T) ⇒ PointType, topK: Int = DefaultTopK, linkerMethod: String = getShapeLinkerMethod)(implicit arg0: ClassTag[T]): RDD[(T, Array[SparkScoreDoc])]

    

    Link entities based on k-nearest neighbors (Knn)

    Link entities based on k-nearest neighbors (Knn)

    Links this and that based on nearest neighbors, returns Knn

    T

    A type

    that

    An RDD of entities to be linked

    pointFunctor

    Function that generates a point from each element of other

    linkerMethod

    Method to perform linkage

    returns

    an RDD of Tuple2 that contains the linked results Note: Currently the query coordinates of the other RDD are collected to the driver and broadcast to the workers.

85. def linkByRadius[T](that: RDD[T], pointFunctor: (T) ⇒ PointType, radius: Double, topK: Int = DefaultTopK, spatialOp: String = SpatialOperation.Intersects.getName, linkerMethod: String = getShapeLinkerMethod)(implicit arg0: ClassTag[T]): RDD[(T, Array[SparkScoreDoc])]

    

    Link entities if their shapes are within a distance in kilometers (km)

    Link entities if their shapes are within a distance in kilometers (km)

    Links this and that based on distance threshold

    T

    A type

    that

    An RDD of entities to be linked

    pointFunctor

    Function that generates a point from each element of other

    linkerMethod

    Method to perform linkage

    returns

    an RDD of Tuple2 that contains the linked results Note: Currently the query coordinates of the other RDD are collected to the driver and broadcast to the workers.

86. def linkDataFrameByKnn(other: DataFrame, searchQueryGen: (Row) ⇒ PointType, topK: Int = DefaultTopK, linkerMethod: String = getShapeLinkerMethod): RDD[(Row, Array[SparkScoreDoc])]

    

    Link with DataFrame based on k-nearest neighbors (Knn)

    Link with DataFrame based on k-nearest neighbors (Knn)

    Links this and that based on nearest neighbors, returns Knn

    other

    DataFrame of entities to be linked

    searchQueryGen

    Function that generates a point from each element of other

    topK

    Number of linked items

    linkerMethod

    Method to perform linkage

87. def linkDataFrameByRadius(other: DataFrame, pointFunctor: (Row) ⇒ PointType, radius: Double, topK: Int = DefaultTopK, spatialOp: String = SpatialOperation.Intersects.getName, linkerMethod: String = getShapeLinkerMethod): RDD[(Row, Array[SparkScoreDoc])]

    

    Link entities if their shapes are within a distance in kilometers (km)

    Link entities if their shapes are within a distance in kilometers (km)

    Links this and that based on distance threshold

    other

    DataFrame of entities to be linked

    pointFunctor

    Function that generates a point from each element of other

    linkerMethod

    Method to perform linkage

    returns

    an RDD of Tuple2 that contains the linked results Note: Currently the query coordinates of the other RDD are collected to the driver and broadcast to the workers.

88. def localCheckpoint(): ShapeLuceneRDD.this.type

    

    Definition Classes

    RDD

89. def log: Logger

    

    Attributes

    protected

    Definition Classes

    Logging

90. def logDebug(msg: ⇒ String, throwable: Throwable): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

91. def logDebug(msg: ⇒ String): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

92. def logError(msg: ⇒ String, throwable: Throwable): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

93. def logError(msg: ⇒ String): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

94. def logInfo(msg: ⇒ String, throwable: Throwable): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

95. def logInfo(msg: ⇒ String): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

96. def logName: String

    

    Attributes

    protected

    Definition Classes

    Logging

97. def logTrace(msg: ⇒ String, throwable: Throwable): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

98. def logTrace(msg: ⇒ String): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

99. def logWarning(msg: ⇒ String, throwable: Throwable): Unit

    

    Attributes

    protected

    Definition Classes

    Logging

100. def logWarning(msg: ⇒ String): Unit

     

     Attributes

     protected

     Definition Classes

     Logging

101. def map[U](f: ((K, V)) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

     

     Definition Classes

     RDD

102. def mapPartitions[U](f: (Iterator[(K, V)]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

     

     Definition Classes

     RDD

103. def mapPartitionsWithIndex[U](f: (Int, Iterator[(K, V)]) ⇒ Iterator[U], preservesPartitioning: Boolean)(implicit arg0: ClassTag[U]): RDD[U]

     

     Definition Classes

     RDD

104. def max()(implicit ord: Ordering[(K, V)]): (K, V)

     

     Definition Classes

     RDD

105. def min()(implicit ord: Ordering[(K, V)]): (K, V)

     

     Definition Classes

     RDD

106. var name: String

     

     Definition Classes

     RDD

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

     

     Definition Classes

     AnyRef

108. final def notify(): Unit

     

     Definition Classes

     AnyRef

109. final def notifyAll(): Unit

     

     Definition Classes

     AnyRef

110. def parent[U](j: Int)(implicit arg0: ClassTag[U]): RDD[U]

     

     Attributes

     protected[org.apache.spark]

     Definition Classes

     RDD

111. val partitioner: Option[Partitioner]

     

     Definition Classes

     RDD

112. final def partitions: Array[Partition]

     

     Definition Classes

     RDD

113. def persist(newLevel: StorageLevel): ShapeLuceneRDD.this.type

     

     Definition Classes

     ShapeLuceneRDD → RDD

114. def persist(): ShapeLuceneRDD.this.type

     

     Definition Classes

     RDD

115. def pipe(command: Seq[String], env: Map[String, String], printPipeContext: ((String) ⇒ Unit) ⇒ Unit, printRDDElement: ((K, V), (String) ⇒ Unit) ⇒ Unit, separateWorkingDir: Boolean, bufferSize: Int, encoding: String): RDD[String]

     

     Definition Classes

     RDD

116. def pipe(command: String, env: Map[String, String]): RDD[String]

     

     Definition Classes

     RDD

117. def pipe(command: String): RDD[String]

     

     Definition Classes

     RDD

118. final def preferredLocations(split: Partition): Seq[String]

     

     Definition Classes

     RDD

119. val queryAnalyzerName: String

     

     Analyzer during query time

120. def randomSplit(weights: Array[Double], seed: Long): Array[RDD[(K, V)]]

     

     Definition Classes

     RDD

121. def reduce(f: ((K, V), (K, V)) ⇒ (K, V)): (K, V)

     

     Definition Classes

     RDD

122. def repartition(numPartitions: Int)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

     

     Definition Classes

     RDD

123. def sample(withReplacement: Boolean, fraction: Double, seed: Long): RDD[(K, V)]

     

     Definition Classes

     RDD

124. def saveAsObjectFile(path: String): Unit

     

     Definition Classes

     RDD

125. def saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit

     

     Definition Classes

     RDD

126. def saveAsTextFile(path: String): Unit

     

     Definition Classes

     RDD

127. def setName(_name: String): ShapeLuceneRDD.this.type

     

     Definition Classes

     ShapeLuceneRDD → RDD

128. val similarity: String

     

     Query similarity (TF-IDF / BM25)

129. def sortBy[K](f: ((K, V)) ⇒ K, ascending: Boolean, numPartitions: Int)(implicit ord: Ordering[K], ctag: ClassTag[K]): RDD[(K, V)]

     

     Definition Classes

     RDD

130. def sparkContext: SparkContext

     

     Definition Classes

     RDD

131. def spatialSearch(point: PointType, k: Int, operationName: String): LuceneRDDResponse

     

     Spatial search with a single Point

132. def spatialSearch(shapeWKT: String, k: Int, operationName: String = SpatialOperation.Intersects.getName): LuceneRDDResponse

     

     Spatial search with arbitrary shape

     Spatial search with arbitrary shape

     shapeWKT

     Shape in WKT format

     k

     Number of element to return

133. def subtract(other: RDD[(K, V)], p: Partitioner)(implicit ord: Ordering[(K, V)]): RDD[(K, V)]

     

     Definition Classes

     RDD

134. def subtract(other: RDD[(K, V)], numPartitions: Int): RDD[(K, V)]

     

     Definition Classes

     RDD

135. def subtract(other: RDD[(K, V)]): RDD[(K, V)]

     

     Definition Classes

     RDD

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

     

     Definition Classes

     AnyRef

137. def take(num: Int): Array[(K, V)]

     

     Definition Classes

     RDD

138. def takeOrdered(num: Int)(implicit ord: Ordering[(K, V)]): Array[(K, V)]

     

     Definition Classes

     RDD

139. def takeSample(withReplacement: Boolean, num: Int, seed: Long): Array[(K, V)]

     

     Definition Classes

     RDD

140. def toDebugString: String

     

     Definition Classes

     RDD

141. def toJavaRDD(): JavaRDD[(K, V)]

     

     Definition Classes

     RDD

142. def toLocalIterator: Iterator[(K, V)]

     

     Definition Classes

     RDD

143. def toString(): String

     

     Definition Classes

     RDD → AnyRef → Any

144. def top(num: Int)(implicit ord: Ordering[(K, V)]): Array[(K, V)]

     

     Definition Classes

     RDD

145. def treeAggregate[U](zeroValue: U)(seqOp: (U, (K, V)) ⇒ U, combOp: (U, U) ⇒ U, depth: Int)(implicit arg0: ClassTag[U]): U

     

     Definition Classes

     RDD

146. def treeReduce(f: ((K, V), (K, V)) ⇒ (K, V), depth: Int): (K, V)

     

     Definition Classes

     RDD

147. def union(other: RDD[(K, V)]): RDD[(K, V)]

     

     Definition Classes

     RDD

148. def unpersist(blocking: Boolean = true): ShapeLuceneRDD.this.type

     

     Definition Classes

     ShapeLuceneRDD → RDD

149. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

152. def zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((K, V), U)]

     

     Definition Classes

     RDD

153. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D])(f: (Iterator[(K, V)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]

     

     Definition Classes

     RDD

154. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D], preservesPartitioning: Boolean)(f: (Iterator[(K, V)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]

     

     Definition Classes

     RDD

155. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C])(f: (Iterator[(K, V)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

     

     Definition Classes

     RDD

156. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C], preservesPartitioning: Boolean)(f: (Iterator[(K, V)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

     

     Definition Classes

     RDD

157. def zipPartitions[B, V](rdd2: RDD[B])(f: (Iterator[(K, V)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

     

     Definition Classes

     RDD

158. def zipPartitions[B, V](rdd2: RDD[B], preservesPartitioning: Boolean)(f: (Iterator[(K, V)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

     

     Definition Classes

     RDD

159. def zipWithIndex(): RDD[((K, V), Long)]

     

     Definition Classes

     RDD

160. def zipWithUniqueId(): RDD[((K, V), Long)]

     

     Definition Classes

     RDD