LongArray

final case class LongArray(array: Array[Long]) extends Arr[Long] with Product with Serializable

Linear Supertypes

Product, Arr[Long], Serializable, Chunk[Long], ChunkLike[Long], StrictOptimizedSeqOps[Long, Chunk, Chunk[Long]], StrictOptimizedSeqOps[Long, Chunk, Chunk[Long]], StrictOptimizedIterableOps[Long, Chunk, Chunk[Long]], IndexedSeq[Long], IndexedSeqOps[Long, [_]Chunk[_], Chunk[Long]], IndexedSeq[Long], IndexedSeqOps[Long, [_]Chunk[_], Chunk[Long]], Seq[Long], SeqOps[Long, [_]Chunk[_], Chunk[Long]], Seq[Long], Equals, SeqOps[Long, [_]Chunk[_], Chunk[Long]], PartialFunction[Int, Long], (Int) => Long, Iterable[Long], Iterable[Long], IterableFactoryDefaults[Long, [x]Chunk[x]], IterableOps[Long, [_]Chunk[_], Chunk[Long]], IterableOnceOps[Long, [_]Chunk[_], Chunk[Long]], IterableOnce[Long], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

LongArray
Product
Arr
Serializable
Chunk
ChunkLike
StrictOptimizedSeqOps
StrictOptimizedSeqOps
StrictOptimizedIterableOps
IndexedSeq
IndexedSeqOps
IndexedSeq
IndexedSeqOps
Seq
SeqOps
Seq
Equals
SeqOps
PartialFunction
Function1
Iterable
Iterable
IterableFactoryDefaults
IterableOps
IterableOnceOps
IterableOnce
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Instance Constructors

new LongArray(array: Array[Long])

Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def ++[A1 >: Long](that: NonEmptyChunk[A1]): NonEmptyChunk[A1]
Definition Classes
Chunk
final def ++[A1 >: Long](that: Chunk[A1]): Chunk[A1]
Returns the concatenation of this chunk with the specified chunk.
Returns the concatenation of this chunk with the specified chunk.
Definition Classes
Chunk
final def ++[B >: Long](suffix: IterableOnce[B]): Chunk[B]
Definition Classes
IterableOps
Annotations
@inline()
final def ++:[B >: Long](prefix: IterableOnce[B]): Chunk[B]
Definition Classes
SeqOps → IterableOps
Annotations
@inline()
final def +:[B >: Long](elem: B): Chunk[B]
Definition Classes
SeqOps
Annotations
@inline()
final def :+[B >: Long](elem: B): Chunk[B]
Definition Classes
SeqOps
Annotations
@inline()
final def :++[B >: Long](suffix: IterableOnce[B]): Chunk[B]
Definition Classes
SeqOps
Annotations
@inline()
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def addString(b: StringBuilder): StringBuilder
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: StringBuilder, sep: String): StringBuilder
Definition Classes
IterableOnceOps
Annotations
@inline()
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Definition Classes
IterableOnceOps
def andThen[C](k: PartialFunction[Long, C]): PartialFunction[Int, C]
Definition Classes
PartialFunction
def andThen[C](k: (Long) => C): PartialFunction[Int, C]
Definition Classes
PartialFunction → Function1
def append[A1 >: Long](a1: A1): Chunk[A1]
Appends an element to the chunk.
Appends an element to the chunk.
Attributes
protected
Definition Classes
Chunk
final def appended[A1 >: Long](a1: A1): Chunk[A1]
Definition Classes
ChunkLike → StrictOptimizedSeqOps → SeqOps
def appendedAll[B >: Long](suffix: IterableOnce[B]): Chunk[B]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def apply(n: Int): Long
Definition Classes
Arr → SeqOps → Function1
def applyOrElse[A1 <: Int, B1 >: Long](x: A1, default: (A1) => B1): B1
Definition Classes
PartialFunction
def applyPreferredMaxLength: Int
Attributes
protected
Definition Classes
IndexedSeq
val array: Array[Long]
Definition Classes
LongArray → Arr
final def asBits(implicit ev: <:<[Long, Byte]): Chunk[Boolean]
Converts a chunk of bytes to a chunk of bits.
Converts a chunk of bytes to a chunk of bits.
Definition Classes
Chunk
final def asInstanceOf[T0]: T0
Definition Classes
Any
def boolean(index: Int)(implicit ev: <:<[Long, Boolean]): Boolean
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
Chunk
def byte(index: Int)(implicit ev: <:<[Long, Byte]): Byte
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
Chunk
def canEqual(that: Any): Boolean
Definition Classes
IndexedSeq → Seq → Equals
def char(index: Int)(implicit ev: <:<[Long, Char]): Char
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
Chunk
def className: String
Attributes
protected[this]
Definition Classes
Iterable
implicit val classTag: ClassTag[Long]
Definition Classes
Arr
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def coll: LongArray.this.type
Attributes
protected
Definition Classes
Iterable → IterableOps
def collect[B](pf: PartialFunction[Long, B]): Chunk[B]
Returns a filtered, mapped subset of the elements of this Chunk.
Returns a filtered, mapped subset of the elements of this Chunk.
Definition Classes
ChunkLike → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def collectChunk[B](pf: PartialFunction[Long, B]): Chunk[B]
Returns a filtered, mapped subset of the elements of this chunk.
Returns a filtered, mapped subset of the elements of this chunk.
Attributes
protected
Definition Classes
Arr → Chunk
def collectFirst[B](pf: PartialFunction[Long, B]): Option[B]
Definition Classes
IterableOnceOps
def collectM[R, E, B](pf: PartialFunction[Long, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]
Returns a filtered, mapped subset of the elements of this chunk based on a .
Returns a filtered, mapped subset of the elements of this chunk based on a .
Definition Classes
Arr → Chunk
def collectWhile[B](pf: PartialFunction[Long, B]): Chunk[B]
Transforms all elements of the chunk for as long as the specified partial function is defined.
Transforms all elements of the chunk for as long as the specified partial function is defined.
Definition Classes
Arr → Chunk
def collectWhileM[R, E, B](pf: PartialFunction[Long, ZIO[R, E, B]]): ZIO[R, E, Chunk[B]]
Definition Classes
Arr → Chunk
def combinations(n: Int): Iterator[Chunk[Long]]
Definition Classes
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Long]
Definition Classes
PartialFunction
def compose[A](g: (A) => Int): (A) => Long
Definition Classes
Function1
Annotations
@unspecialized()
final def concat[B >: Long](suffix: IterableOnce[B]): Chunk[B]
Definition Classes
SeqOps → IterableOps
Annotations
@inline()
def contains[A1 >: Long](elem: A1): Boolean
Definition Classes
SeqOps
def containsSlice[B >: Long](that: Seq[B]): Boolean
Definition Classes
SeqOps
def copyToArray[B >: Long](xs: Array[B], start: Int, len: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: Long](xs: Array[B], start: Int): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def copyToArray[B >: Long](xs: Array[B]): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
final def corresponds[B](that: Chunk[B])(f: (Long, B) => Boolean): Boolean
Determines whether this chunk and the specified chunk have the same length and every pair of corresponding elements of this chunk and the specified chunk satisfy the specified predicate.
Determines whether this chunk and the specified chunk have the same length and every pair of corresponding elements of this chunk and the specified chunk satisfy the specified predicate.
Definition Classes
Chunk
def corresponds[B](that: Seq[B])(p: (Long, B) => Boolean): Boolean
Definition Classes
SeqOps
def corresponds[B](that: IterableOnce[B])(p: (Long, B) => Boolean): Boolean
Definition Classes
IterableOnceOps
def count(p: (Long) => Boolean): Int
Definition Classes
IterableOnceOps
def depth: Int
Attributes
protected
Definition Classes
Chunk
def diff[B >: Long](that: Seq[B]): Chunk[Long]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def distinct: Chunk[Long]
Definition Classes
SeqOps
def distinctBy[B](f: (Long) => B): Chunk[Long]
Definition Classes
StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
def double(index: Int)(implicit ev: <:<[Long, Double]): Double
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
Chunk
def drop(n: Int): Chunk[Long]
Drops the first n elements of the chunk.
Drops the first n elements of the chunk.
Definition Classes
Chunk → IndexedSeqOps → IterableOps → IterableOnceOps
def dropRight(n: Int): Chunk[Long]
Drops the last n elements of the chunk.
Drops the last n elements of the chunk.
Definition Classes
Chunk → StrictOptimizedIterableOps → IndexedSeqOps → IterableOps
def dropWhile(f: (Long) => Boolean): Chunk[Long]
Drops all elements so long as the predicate returns true.
Drops all elements so long as the predicate returns true.
Definition Classes
Arr → Chunk → IterableOps → IterableOnceOps
def dropWhileM[R, E](p: (Long) => ZIO[R, E, Boolean]): ZIO[R, E, Chunk[Long]]
Definition Classes
Chunk
def elementWise: ElementWiseExtractor[Int, Long]
Definition Classes
PartialFunction
def empty: Chunk[Long]
Definition Classes
IterableFactoryDefaults → IterableOps
def endsWith[B >: Long](that: Iterable[B]): Boolean
Definition Classes
SeqOps
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def equals(that: Any): Boolean
Definition Classes
Chunk → Seq → Equals → AnyRef → Any
final def exists(f: (Long) => Boolean): Boolean
Determines whether a predicate is satisfied for at least one element of this chunk.
Determines whether a predicate is satisfied for at least one element of this chunk.
Definition Classes
Chunk → IterableOnceOps
def filter(f: (Long) => Boolean): Chunk[Long]
Returns a filtered subset of this chunk.
Returns a filtered subset of this chunk.
Definition Classes
Arr → Chunk → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def filterImpl(pred: (Long) => Boolean, isFlipped: Boolean): Chunk[Long]
Attributes
protected[collection]
Definition Classes
StrictOptimizedIterableOps
final def filterM[R, E](f: (Long) => ZIO[R, E, Boolean]): ZIO[R, E, Chunk[Long]]
Filters this chunk by the specified effectful predicate, retaining all elements for which the predicate evaluates to true.
Filters this chunk by the specified effectful predicate, retaining all elements for which the predicate evaluates to true.
Definition Classes
Chunk
def filterNot(pred: (Long) => Boolean): Chunk[Long]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable])
final def find(f: (Long) => Boolean): Option[Long]
Returns the first element that satisfies the predicate.
Returns the first element that satisfies the predicate.
Definition Classes
Chunk → IterableOnceOps
def findLast(p: (Long) => Boolean): Option[Long]
Definition Classes
SeqOps
final def flatMap[B](f: (Long) => IterableOnce[B]): Chunk[B]
Returns the concatenation of mapping every element into a new chunk using the specified function.
Returns the concatenation of mapping every element into a new chunk using the specified function.
Definition Classes
ChunkLike → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
final def flatten[B](implicit ev: <:<[Long, Chunk[B]]): Chunk[B]
Flattens a chunk of chunks into a single chunk by concatenating all chunks.
Flattens a chunk of chunks into a single chunk by concatenating all chunks.
Definition Classes
Chunk
def flatten[B](implicit toIterableOnce: (Long) => IterableOnce[B]): Chunk[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def float(index: Int)(implicit ev: <:<[Long, Float]): Float
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
Chunk
def fold[A1 >: Long](z: A1)(op: (A1, A1) => A1): A1
Definition Classes
IterableOnceOps
def foldLeft[S](s0: S)(f: (S, Long) => S): S
Folds over the elements in this chunk from the left.
Folds over the elements in this chunk from the left.
Definition Classes
Arr → Chunk → IterableOnceOps
final def foldM[R, E, S](s: S)(f: (S, Long) => ZIO[R, E, S]): ZIO[R, E, S]
Effectfully folds over the elements in this chunk from the left.
Effectfully folds over the elements in this chunk from the left.
Definition Classes
Chunk
def foldRight[S](s0: S)(f: (Long, S) => S): S
Folds over the elements in this chunk from the right.
Folds over the elements in this chunk from the right.
Definition Classes
Arr → Chunk → IndexedSeqOps → IterableOnceOps
final def foldWhile[S](s0: S)(pred: (S) => Boolean)(f: (S, Long) => S): S
Folds over the elements in this chunk from the left.
Folds over the elements in this chunk from the left. Stops the fold early when the condition is not fulfilled.
Definition Classes
Chunk
final def foldWhileM[R, E, S](z: S)(pred: (S) => Boolean)(f: (S, Long) => ZIO[R, E, S]): ZIO[R, E, S]
Definition Classes
Chunk
final def forall(f: (Long) => Boolean): Boolean
Determines whether a predicate is satisfied for all elements of this chunk.
Determines whether a predicate is satisfied for all elements of this chunk.
Definition Classes
Chunk → IterableOnceOps
def foreach[B](f: (Long) => B): Unit
Definition Classes
Arr → IterableOnceOps
def fromSpecific(coll: IterableOnce[Long]): Chunk[Long]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
def groupBy[K](f: (Long) => K): Map[K, Chunk[Long]]
Definition Classes
IterableOps
def groupMap[K, B](key: (Long) => K)(f: (Long) => B): Map[K, Chunk[B]]
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (Long) => K)(f: (Long) => B)(reduce: (B, B) => B): Map[K, B]
Definition Classes
IterableOps
def grouped(size: Int): Iterator[Chunk[Long]]
Definition Classes
IterableOps
final def hashCode(): Int
Definition Classes
Chunk → Seq → AnyRef → Any
def head: Long
Returns the first element of this chunk.
Returns the first element of this chunk. Note that this method is partial in that it will throw an exception if the chunk is empty. Consider using headOption to explicitly handle the possibility that the chunk is empty or iterating over the elements of the chunk in lower level, performance sensitive code unless you really only need the first element of the chunk.
Definition Classes
Chunk → IndexedSeqOps → IterableOps
final def headOption: Option[Long]
Returns the first element of this chunk if it exists.
Returns the first element of this chunk if it exists.
Definition Classes
Chunk → IndexedSeqOps → IterableOps
def indexOf[B >: Long](elem: B): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def indexOf[B >: Long](elem: B, from: Int): Int
Definition Classes
SeqOps
def indexOfSlice[B >: Long](that: Seq[B]): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def indexOfSlice[B >: Long](that: Seq[B], from: Int): Int
Definition Classes
SeqOps
final def indexWhere(f: (Long) => Boolean, from: Int): Int
Returns the first index for which the given predicate is satisfied after or at some given index.
Returns the first index for which the given predicate is satisfied after or at some given index.
Definition Classes
Chunk → SeqOps
def indexWhere(p: (Long) => Boolean): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def indices: Range
Definition Classes
SeqOps
def init: Chunk[Long]
Definition Classes
IterableOps
def inits: Iterator[Chunk[Long]]
Definition Classes
IterableOps
def int(index: Int)(implicit ev: <:<[Long, Int]): Int
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
Chunk
def intersect[B >: Long](that: Seq[B]): Chunk[Long]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def isDefinedAt(idx: Int): Boolean
Definition Classes
SeqOps
final def isEmpty: Boolean
Determines if the chunk is empty.
Determines if the chunk is empty.
Definition Classes
Chunk → SeqOps → IterableOnceOps
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isTraversableAgain: Boolean
Definition Classes
IterableOps → IterableOnceOps
val iterableFactory: SeqFactory[Chunk]
Returns a SeqFactory that can construct Chunk values.
Returns a SeqFactory that can construct Chunk values. The SeqFactory exposes a newBuilder method that is not referentially transparent because it allocates mutable state.
Definition Classes
ChunkLike → IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
def iterator: Iterator[Long]
Definition Classes
IndexedSeqOps → IterableOnce
def knownSize: Int
Definition Classes
IndexedSeqOps → IterableOnce
def last: Long
Definition Classes
IndexedSeqOps → IterableOps
def lastIndexOf[B >: Long](elem: B, end: Int): Int
Definition Classes
SeqOps
def lastIndexOfSlice[B >: Long](that: Seq[B]): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def lastIndexOfSlice[B >: Long](that: Seq[B], end: Int): Int
Definition Classes
SeqOps
def lastIndexWhere(p: (Long) => Boolean): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def lastIndexWhere(p: (Long) => Boolean, end: Int): Int
Definition Classes
SeqOps
final def lastOption: Option[Long]
Returns the last element of this chunk if it exists.
Returns the last element of this chunk if it exists.
Definition Classes
Chunk → IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[Long, B, LongArray.this.type]
Definition Classes
Iterable
def left: Chunk[Long]
Attributes
protected
Definition Classes
Chunk
val length: Int
Definition Classes
Arr → SeqOps
final def lengthCompare(that: Iterable[_]): Int
Definition Classes
IndexedSeqOps → SeqOps
final def lengthCompare(len: Int): Int
Definition Classes
IndexedSeqOps → SeqOps
final def lengthIs: SizeCompareOps
Definition Classes
SeqOps
Annotations
@inline()
def lift: (Int) => Option[Long]
Definition Classes
PartialFunction
def long(index: Int)(implicit ev: <:<[Long, Long]): Long
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
LongArray → Chunk
final def map[B](f: (Long) => B): Chunk[B]
Returns a chunk with the elements mapped by the specified function.
Returns a chunk with the elements mapped by the specified function.
Definition Classes
ChunkLike → StrictOptimizedIterableOps → IndexedSeqOps → IterableOps → IterableOnceOps
final def mapAccum[S1, B](s1: S1)(f1: (S1, Long) => (S1, B)): (S1, Chunk[B])
Statefully maps over the chunk, producing new elements of type B.
Statefully maps over the chunk, producing new elements of type B.
Definition Classes
Chunk
final def mapAccumM[R, E, S1, B](s1: S1)(f1: (S1, Long) => ZIO[R, E, (S1, B)]): ZIO[R, E, (S1, Chunk[B])]
Statefully and effectfully maps over the elements of this chunk to produce new elements.
Statefully and effectfully maps over the elements of this chunk to produce new elements.
Definition Classes
Chunk
def mapChunk[B](f: (Long) => B): Chunk[B]
Returns a chunk with the elements mapped by the specified function.
Returns a chunk with the elements mapped by the specified function.
Attributes
protected
Definition Classes
Arr → Chunk
final def mapM[R, E, B](f: (Long) => ZIO[R, E, B]): ZIO[R, E, Chunk[B]]
Effectfully maps the elements of this chunk.
Effectfully maps the elements of this chunk.
Definition Classes
Chunk
final def mapMPar[R, E, B](f: (Long) => ZIO[R, E, B]): ZIO[R, E, Chunk[B]]
Effectfully maps the elements of this chunk in parallel.
Effectfully maps the elements of this chunk in parallel.
Definition Classes
Chunk
final def mapMPar_[R, E](f: (Long) => ZIO[R, E, Any]): ZIO[R, E, Unit]
Effectfully maps the elements of this chunk in parallel purely for the effects.
Effectfully maps the elements of this chunk in parallel purely for the effects.
Definition Classes
Chunk
final def mapM_[R, E](f: (Long) => ZIO[R, E, Any]): ZIO[R, E, Unit]
Effectfully maps the elements of this chunk purely for the effects.
Effectfully maps the elements of this chunk purely for the effects.
Definition Classes
Chunk
def materialize[A1 >: Long]: Chunk[A1]
Materializes a chunk into a chunk backed by an array.
Materializes a chunk into a chunk backed by an array. This method can improve the performance of bulk operations.
Definition Classes
Arr → Chunk
def max[B >: Long](implicit ord: Ordering[B]): Long
Definition Classes
IterableOnceOps
def maxBy[B](f: (Long) => B)(implicit cmp: Ordering[B]): Long
Definition Classes
IterableOnceOps
def maxByOption[B](f: (Long) => B)(implicit cmp: Ordering[B]): Option[Long]
Definition Classes
IterableOnceOps
def maxOption[B >: Long](implicit ord: Ordering[B]): Option[Long]
Definition Classes
IterableOnceOps
def min[B >: Long](implicit ord: Ordering[B]): Long
Definition Classes
IterableOnceOps
def minBy[B](f: (Long) => B)(implicit cmp: Ordering[B]): Long
Definition Classes
IterableOnceOps
def minByOption[B](f: (Long) => B)(implicit cmp: Ordering[B]): Option[Long]
Definition Classes
IterableOnceOps
def minOption[B >: Long](implicit ord: Ordering[B]): Option[Long]
Definition Classes
IterableOnceOps
final def mkString: String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(sep: String): String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(start: String, sep: String, end: String): String
Definition Classes
IterableOnceOps
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def newSpecificBuilder: Builder[Long, Chunk[Long]]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
def nonEmpty: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def nonEmptyOrElse[B](ifEmpty: => B)(fn: (NonEmptyChunk[Long]) => B): B
Runs fn if a chunk is not empty or returns default value
Runs fn if a chunk is not empty or returns default value
Definition Classes
Chunk
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
def occCounts[B](sq: Seq[B]): Map[B, Int]
Attributes
protected[collection]
Definition Classes
SeqOps
def orElse[A1 <: Int, B1 >: Long](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Definition Classes
PartialFunction
def padTo[B >: Long](len: Int, elem: B): Chunk[B]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def partition(p: (Long) => Boolean): (Chunk[Long], Chunk[Long])
Definition Classes
StrictOptimizedIterableOps → IterableOps
final def partitionMap[B, C](f: (Long) => Either[B, C]): (Chunk[B], Chunk[C])
Partitions the elements of this chunk into two chunks using the specified function.
Partitions the elements of this chunk into two chunks using the specified function.
Definition Classes
Chunk → StrictOptimizedIterableOps → IterableOps
def patch[B >: Long](from: Int, other: IterableOnce[B], replaced: Int): Chunk[B]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def permutations: Iterator[Chunk[Long]]
Definition Classes
SeqOps
def prepend[A1 >: Long](a1: A1): Chunk[A1]
Prepends an element to the chunk.
Prepends an element to the chunk.
Attributes
protected
Definition Classes
Chunk
final def prepended[A1 >: Long](a1: A1): Chunk[A1]
Definition Classes
ChunkLike → StrictOptimizedSeqOps → IndexedSeqOps → SeqOps
def prependedAll[B >: Long](prefix: IterableOnce[B]): Chunk[B]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def product[B >: Long](implicit num: Numeric[B]): B
Definition Classes
IterableOnceOps
def productElementNames: Iterator[String]
Definition Classes
Product
def reduce[B >: Long](op: (B, B) => B): B
Definition Classes
IterableOnceOps
def reduceLeft[B >: Long](op: (B, Long) => B): B
Definition Classes
IterableOnceOps
def reduceLeftOption[B >: Long](op: (B, Long) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceOption[B >: Long](op: (B, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceRight[B >: Long](op: (Long, B) => B): B
Definition Classes
IterableOnceOps
def reduceRightOption[B >: Long](op: (Long, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reverse: Chunk[Long]
Definition Classes
IndexedSeqOps → SeqOps
def reverseIterator: Iterator[Long]
Definition Classes
IndexedSeqOps → SeqOps
def reversed: Iterable[Long]
Attributes
protected
Definition Classes
IndexedSeqOps → IterableOnceOps
def right: Chunk[Long]
Attributes
protected
Definition Classes
Chunk
def runWith[U](action: (Long) => U): (Int) => Boolean
Definition Classes
PartialFunction
def sameElements[B >: Long](o: IterableOnce[B]): Boolean
Definition Classes
IndexedSeq → SeqOps
def scan[B >: Long](z: B)(op: (B, B) => B): Chunk[B]
Definition Classes
IterableOps
def scanLeft[B](z: B)(op: (B, Long) => B): Chunk[B]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def scanRight[B](z: B)(op: (Long, B) => B): Chunk[B]
Definition Classes
IterableOps
def search[B >: Long](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps → SeqOps
def search[B >: Long](elem: B)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps → SeqOps
def segmentLength(p: (Long) => Boolean, from: Int): Int
Definition Classes
SeqOps
final def segmentLength(p: (Long) => Boolean): Int
Definition Classes
SeqOps
def short(index: Int)(implicit ev: <:<[Long, Short]): Short
Get the element at the specified index.
Get the element at the specified index.
Definition Classes
Chunk
final def size: Int
Definition Classes
SeqOps → IterableOnceOps
final def sizeCompare(that: Iterable[_]): Int
Definition Classes
SeqOps → IterableOps
final def sizeCompare(otherSize: Int): Int
Definition Classes
SeqOps → IterableOps
final def sizeIs: SizeCompareOps
Definition Classes
IterableOps
Annotations
@inline()
def slice(from: Int, until: Int): Chunk[Long]
Definition Classes
IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
def sliding(size: Int, step: Int): Iterator[Chunk[Long]]
Definition Classes
IterableOps
def sliding(size: Int): Iterator[Chunk[Long]]
Definition Classes
IterableOps
def sortBy[B](f: (Long) => B)(implicit ord: Ordering[B]): Chunk[Long]
Definition Classes
SeqOps
def sortWith(lt: (Long, Long) => Boolean): Chunk[Long]
Definition Classes
SeqOps
def sorted[B >: Long](implicit ord: Ordering[B]): Chunk[Long]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def span(p: (Long) => Boolean): (Chunk[Long], Chunk[Long])
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
final def split(n: Int): Chunk[Chunk[Long]]
Splits this chunk into n equally sized chunks.
Splits this chunk into n equally sized chunks.
Definition Classes
Chunk
final def splitAt(n: Int): (Chunk[Long], Chunk[Long])
Returns two splits of this chunk at the specified index.
Returns two splits of this chunk at the specified index.
Definition Classes
Chunk → IterableOps → IterableOnceOps
final def splitWhere(f: (Long) => Boolean): (Chunk[Long], Chunk[Long])
Splits this chunk on the first element that matches this predicate.
Splits this chunk on the first element that matches this predicate.
Definition Classes
Chunk
def startsWith[B >: Long](that: IterableOnce[B], offset: Int): Boolean
Definition Classes
SeqOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[Long, S]): S with EfficientSplit
Definition Classes
IndexedSeqOps → IterableOnce
final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Long, B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedConcat[B >: Long, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Long) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Long) => IterableOnce[B]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Long) => B): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(Long, B), C2]): C2
Attributes
protected[this]
Definition Classes
StrictOptimizedIterableOps
Annotations
@inline()
def stringPrefix: String
Attributes
protected[this]
Definition Classes
IndexedSeq → Seq → Iterable
def sum[B >: Long](implicit num: Numeric[B]): B
Definition Classes
IterableOnceOps
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def tail: Chunk[Long]
Definition Classes
IterableOps
def tails: Iterator[Chunk[Long]]
Definition Classes
IterableOps
def take(n: Int): Chunk[Long]
Takes the first n elements of the chunk.
Takes the first n elements of the chunk.
Definition Classes
Chunk → IndexedSeqOps → IterableOps → IterableOnceOps
def takeRight(n: Int): Chunk[Long]
Takes the last n elements of the chunk.
Takes the last n elements of the chunk.
Definition Classes
Chunk → StrictOptimizedIterableOps → IndexedSeqOps → IterableOps
def takeWhile(f: (Long) => Boolean): Chunk[Long]
Takes all elements so long as the predicate returns true.
Takes all elements so long as the predicate returns true.
Definition Classes
Arr → Chunk → IterableOps → IterableOnceOps
def takeWhileM[R, E](p: (Long) => ZIO[R, E, Boolean]): ZIO[R, E, Chunk[Long]]
Takes all elements so long as the effectual predicate returns true.
Takes all elements so long as the effectual predicate returns true.
Definition Classes
Chunk
def tapEach[U](f: (Long) => U): Chunk[Long]
Definition Classes
StrictOptimizedIterableOps → IterableOps → IterableOnceOps
def to[C1](factory: Factory[Long, C1]): C1
Definition Classes
IterableOnceOps
def toArray[A1 >: Long](n: Int, dest: Array[A1]): Unit
Attributes
protected[zio]
Definition Classes
Arr → Chunk
def toArray[A1 >: Long](implicit arg0: ClassTag[A1]): Array[A1]
Converts the chunk into an array.
Converts the chunk into an array.
Definition Classes
Chunk → IterableOnceOps
final def toBinaryString(implicit ev: <:<[Long, Boolean]): String
Renders this chunk of bits as a binary string.
Renders this chunk of bits as a binary string.
Definition Classes
Chunk
final def toBuffer[B >: Long]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
final def toIndexedSeq: IndexedSeq[Long]
Definition Classes
IndexedSeq → IterableOnceOps
final def toList: List[Long]
Definition Classes
Chunk → IterableOnceOps
def toMap[K, V](implicit ev: <:<[Long, (K, V)]): Map[K, V]
Definition Classes
IterableOnceOps
final def toSeq: LongArray.this.type
Definition Classes
Seq → IterableOnceOps
def toSet[B >: Long]: Set[B]
Definition Classes
IterableOnceOps
final def toString(): String
Definition Classes
Chunk → Seq → Function1 → Iterable → AnyRef → Any
final def toVector: Vector[Long]
Definition Classes
Chunk → IterableOnceOps
def transpose[B](implicit asIterable: (Long) => Iterable[B]): Chunk[Chunk[B]]
Definition Classes
IterableOps
def unapply(a: Int): Option[Long]
Definition Classes
PartialFunction
def unzip[A1, A2](implicit asPair: (Long) => (A1, A2)): (Chunk[A1], Chunk[A2])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (Long) => (A1, A2, A3)): (Chunk[A1], Chunk[A2], Chunk[A3])
Definition Classes
StrictOptimizedIterableOps → IterableOps
def updated[B >: Long](index: Int, elem: B): Chunk[B]
Definition Classes
StrictOptimizedSeqOps → SeqOps
def view: IndexedSeqView[Long]
Definition Classes
IndexedSeqOps → SeqOps → IterableOps
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
def withFilter(p: (Long) => Boolean): WithFilter[Long, [_]Chunk[_]]
Definition Classes
IterableOps
final def zip[B](that: Chunk[B]): Chunk[(Long, B)]
Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk.
Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk. The returned chunk will have the length of the shorter chunk.
Definition Classes
Chunk
def zip[B](that: IterableOnce[B]): Chunk[(Long, B)]
Definition Classes
StrictOptimizedIterableOps → IterableOps
final def zipAll[B](that: Chunk[B]): Chunk[(Option[Long], Option[B])]
Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk, filling in missing values from the shorter chunk with None.
Zips this chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk, filling in missing values from the shorter chunk with None. The returned chunk will have the length of the longer chunk.
Definition Classes
Chunk
def zipAll[A1 >: Long, B](that: Iterable[B], thisElem: A1, thatElem: B): Chunk[(A1, B)]
Definition Classes
IterableOps
final def zipAllWith[B, C](that: Chunk[B])(left: (Long) => C, right: (B) => C)(both: (Long, B) => C): Chunk[C]
Zips with chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk combined using the specified function both.
Zips with chunk with the specified chunk to produce a new chunk with pairs of elements from each chunk combined using the specified function both. If one chunk is shorter than the other uses the specified function left or right to map the element that does exist to the result type.
Definition Classes
Chunk
final def zipWith[B, C](that: Chunk[B])(f: (Long, B) => C): Chunk[C]
Zips this chunk with the specified chunk using the specified combiner.
Zips this chunk with the specified chunk using the specified combiner.
Definition Classes
Chunk
final def zipWithIndex: Chunk[(Long, Int)]
Zips this chunk with the index of every element.
Zips this chunk with the index of every element.
Definition Classes
ChunkLike → StrictOptimizedIterableOps → IterableOps → IterableOnceOps
final def zipWithIndexFrom(indexOffset: Int): Chunk[(Long, Int)]
Zips this chunk with the index of every element, starting from the initial index value.
Zips this chunk with the index of every element, starting from the initial index value.
Definition Classes
Chunk

Deprecated Value Members

final def +[A1 >: Long](a: A1): Chunk[A1]
Appends an element to the chunk
Appends an element to the chunk
Definition Classes
Chunk
Annotations
@deprecated
Deprecated
(Since version 1.0.0) use :+
final def /:[B](z: B)(op: (B, Long) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
final def :\[B](z: B)(op: (Long, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldRight instead of :\
def aggregate[B](z: => B)(seqop: (B, Long) => B, combop: (B, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.
def companion: IterableFactory[[_]Chunk[_]]
Definition Classes
IterableOps
Annotations
@deprecated @deprecatedOverriding() @inline()
Deprecated
(Since version 2.13.0) Use iterableFactory instead
final def copyToBuffer[B >: Long](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def hasDefiniteSize: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
final def prefixLength(p: (Long) => Boolean): Int
Definition Classes
SeqOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
final def repr: Chunk[Long]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
def reverseMap[B](f: (Long) => B): Chunk[B]
Definition Classes
SeqOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
def seq: LongArray.this.type
Definition Classes
Iterable
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
final def toIterable: LongArray.this.type
Definition Classes
Iterable → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
final def toIterator: Iterator[Long]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
final def toStream: Stream[Long]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
final def toTraversable: Traversable[Long]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
final def union[B >: Long](that: Seq[B]): Chunk[B]
Definition Classes
SeqOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use concat instead
def view(from: Int, until: Int): IndexedSeqView[Long]
Definition Classes
IndexedSeqOps → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Packages

LongArray

final case class LongArray(array: Array[Long]) extends Arr[Long] with Product with Serializable

Instance Constructors

Value Members

Deprecated Value Members

Inherited from Product

Inherited from Arr[Long]

Inherited from Serializable

Inherited from Chunk[Long]

Inherited from ChunkLike[Long]

Inherited from StrictOptimizedSeqOps[Long, Chunk, Chunk[Long]]

Inherited from StrictOptimizedSeqOps[Long, Chunk, Chunk[Long]]

Inherited from StrictOptimizedIterableOps[Long, Chunk, Chunk[Long]]

Inherited from IndexedSeq[Long]

Inherited from IndexedSeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from IndexedSeq[Long]

Inherited from IndexedSeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from Seq[Long]

Inherited from SeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from Seq[Long]

Inherited from Equals

Inherited from SeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from PartialFunction[Int, Long]

Inherited from (Int) => Long

Inherited from Iterable[Long]

Inherited from Iterable[Long]

Inherited from IterableFactoryDefaults[Long, [x]Chunk[x]]

Inherited from IterableOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from IterableOnceOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from IterableOnce[Long]

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

LongArray

final case class LongArray(array: Array[Long]) extends Arr[Long] with Product with Serializable

Instance Constructors

Value Members

Deprecated Value Members

Inherited from Product

Inherited from Arr[Long]

Inherited from Serializable

Inherited from Chunk[Long]

Inherited from ChunkLike[Long]

Inherited from StrictOptimizedSeqOps[Long, Chunk, Chunk[Long]]

Inherited from StrictOptimizedSeqOps[Long, Chunk, Chunk[Long]]

Inherited from StrictOptimizedIterableOps[Long, Chunk, Chunk[Long]]

Inherited from IndexedSeq[Long]

Inherited from IndexedSeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from IndexedSeq[Long]

Inherited from IndexedSeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from Seq[Long]

Inherited from SeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from Seq[Long]

Inherited from Equals

Inherited from SeqOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from PartialFunction[Int, Long]

Inherited from (Int) => Long

Inherited from Iterable[Long]

Inherited from Iterable[Long]

Inherited from IterableFactoryDefaults[Long, [x]Chunk[x]]

Inherited from IterableOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from IterableOnceOps[Long, [_]Chunk[_], Chunk[Long]]

Inherited from IterableOnce[Long]

Inherited from AnyRef

Inherited from Any

Ungrouped

LongArray