class
DenseNodesIterator extends Iterator[NodeEntity]
Instance Constructors
-
new
DenseNodesIterator(osmosisStringTable: StringTable, osmosisDenseNode: DenseNodes, latOffset: Long = 0, lonOffset: Long = 0, granularity: Int = 100)
Type Members
-
class
GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
-
trait
InfoIterator extends Iterator[Option[Info]]
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
++[B >: NodeEntity](that: ⇒ GenTraversableOnce[B]): Iterator[B]
-
def
/:[B](z: B)(op: (B, NodeEntity) ⇒ B): B
-
def
:\[B](z: B)(op: (NodeEntity, 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, NodeEntity) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
def
buffered: BufferedIterator[NodeEntity]
-
def
clone(): AnyRef
-
def
collect[B](pf: PartialFunction[NodeEntity, B]): Iterator[B]
-
def
collectFirst[B](pf: PartialFunction[NodeEntity, B]): Option[B]
-
def
contains(elem: Any): Boolean
-
def
copyToArray[B >: NodeEntity](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: NodeEntity](xs: Array[B]): Unit
-
def
copyToArray[B >: NodeEntity](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: NodeEntity](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenTraversableOnce[B])(p: (NodeEntity, B) ⇒ Boolean): Boolean
-
def
count(p: (NodeEntity) ⇒ Boolean): Int
-
def
decompressCoord(offSet: Long, delta: Long, currentValue: Double): Double
-
def
drop(n: Int): Iterator[NodeEntity]
-
def
dropWhile(p: (NodeEntity) ⇒ Boolean): Iterator[NodeEntity]
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
exists(p: (NodeEntity) ⇒ Boolean): Boolean
-
-
def
filterNot(p: (NodeEntity) ⇒ Boolean): Iterator[NodeEntity]
-
def
finalize(): Unit
-
-
def
flatMap[B](f: (NodeEntity) ⇒ GenTraversableOnce[B]): Iterator[B]
-
def
fold[A1 >: NodeEntity](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, NodeEntity) ⇒ B): B
-
def
foldRight[B](z: B)(op: (NodeEntity, B) ⇒ B): B
-
def
forall(p: (NodeEntity) ⇒ Boolean): Boolean
-
def
foreach[U](f: (NodeEntity) ⇒ U): Unit
-
final
def
getClass(): Class[_]
-
-
def
hasDefiniteSize: Boolean
-
def
hasNext: Boolean
-
def
hashCode(): Int
-
def
indexOf[B >: NodeEntity](elem: B): Int
-
def
indexWhere(p: (NodeEntity) ⇒ Boolean): Int
-
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
var
lastId: Long
-
var
lastLatitude: Double
-
var
lastLongitude: Double
-
def
length: Int
-
def
map[B](f: (NodeEntity) ⇒ B): Iterator[B]
-
def
max[B >: NodeEntity](implicit cmp: Ordering[B]): NodeEntity
-
def
maxBy[B](f: (NodeEntity) ⇒ B)(implicit cmp: Ordering[B]): NodeEntity
-
def
min[B >: NodeEntity](implicit cmp: Ordering[B]): NodeEntity
-
def
minBy[B](f: (NodeEntity) ⇒ B)(implicit cmp: Ordering[B]): NodeEntity
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
padTo[A1 >: NodeEntity](len: Int, elem: A1): Iterator[A1]
-
-
def
patch[B >: NodeEntity](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
-
def
product[B >: NodeEntity](implicit num: Numeric[B]): B
-
def
reduce[A1 >: NodeEntity](op: (A1, A1) ⇒ A1): A1
-
-
def
reduceLeftOption[B >: NodeEntity](op: (B, NodeEntity) ⇒ B): Option[B]
-
def
reduceOption[A1 >: NodeEntity](op: (A1, A1) ⇒ A1): Option[A1]
-
-
def
reduceRightOption[B >: NodeEntity](op: (NodeEntity, B) ⇒ B): Option[B]
-
-
def
sameElements(that: Iterator[_]): Boolean
-
def
scanLeft[B](z: B)(op: (B, NodeEntity) ⇒ B): Iterator[B]
-
def
scanRight[B](z: B)(op: (NodeEntity, B) ⇒ B): Iterator[B]
-
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterator[NodeEntity]
-
-
-
def
sum[B >: NodeEntity](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
take(n: Int): Iterator[NodeEntity]
-
def
takeWhile(p: (NodeEntity) ⇒ Boolean): Iterator[NodeEntity]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeEntity, Col[NodeEntity]]): Col[NodeEntity]
-
def
toArray[B >: NodeEntity](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: NodeEntity]: Buffer[B]
-
def
toIndexedSeq: IndexedSeq[NodeEntity]
-
def
toIterable: Iterable[NodeEntity]
-
def
toIterator: Iterator[NodeEntity]
-
-
def
toMap[T, U](implicit ev: <:<[NodeEntity, (T, U)]): Map[T, U]
-
-
def
toSet[B >: NodeEntity]: Set[B]
-
def
toStream: Stream[NodeEntity]
-
def
toString(): String
-
def
toTraversable: Traversable[NodeEntity]
-
def
toVector: Vector[NodeEntity]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: (NodeEntity) ⇒ Boolean): Iterator[NodeEntity]
-
def
zip[B](that: Iterator[B]): Iterator[(NodeEntity, B)]
-
def
zipAll[B, A1 >: NodeEntity, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
-
def
zipWithIndex: Iterator[(NodeEntity, Int)]
Inherited from AnyRef
Inherited from Any
Iterator over a DenseDataNode block. By default, lanOffset, longOffset and graularity is 0, 0 and 100 because I did not found pbf files with other values.