Abstract Value Members
-
-
abstract
def
apply(idx: Int): Byte
-
abstract
def
asByteBuffer: ByteBuffer
-
abstract
def
asByteBuffers: Iterable[ByteBuffer]
-
-
abstract
def
decodeString(charset: String): String
-
abstract
def
isCompact: Boolean
-
abstract
def
length: Int
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
-
-
-
def
+:[B >: Byte, That](elem: B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
def
->[B](y: B): (ByteString, B)
-
def
/:[B](z: B)(op: (B, Byte) ⇒ B): B
-
def
:+[B >: Byte, That](elem: B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
def
:\[B](z: B)(op: (Byte, 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, Byte) ⇒ B, combop: (B, B) ⇒ B): B
-
-
def
applyOrElse[A1 <: Int, B1 >: Byte](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
-
-
-
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ Byte
-
-
def
contains[A1 >: Byte](elem: A1): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
def
copyToArray[B >: Byte](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: Byte](xs: Array[B]): Unit
-
def
copyToArray[B >: Byte](xs: Array[B], start: Int): Unit
-
def
copyToBuffer(buffer: ByteBuffer): Int
-
def
copyToBuffer[B >: Byte](dest: Buffer[B]): Unit
-
-
-
-
-
-
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
-
-
-
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: Byte](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, Byte) ⇒ B): B
-
def
foldRight[B](z: B)(op: (Byte, B) ⇒ B): B
-
-
def
foreach[U](f: (Byte) ⇒ U): Unit
-
def
formatted(fmtstr: String): String
-
-
def
getByteBuffers(): Iterable[ByteBuffer]
-
final
def
getClass(): Class[_]
-
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: Byte
-
-
def
indexOf[B >: Byte](elem: B): Int
-
def
indexOf[B >: Byte](elem: B, from: Int): Int
-
def
indexOfSlice[B >: Byte](that: GenSeq[B], from: Int): Int
-
def
indexOfSlice[B >: Byte](that: GenSeq[B]): Int
-
-
-
def
indices: Range
-
-
-
-
def
isDefinedAt(idx: Int): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
def
last: Byte
-
def
lastIndexOf[B >: Byte](elem: B, end: Int): Int
-
def
lastIndexOf[B >: Byte](elem: B): Int
-
def
lastIndexOfSlice[B >: Byte](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: Byte](that: GenSeq[B]): Int
-
def
lastIndexWhere(p: (Byte) ⇒ Boolean, end: Int): Int
-
def
lastIndexWhere(p: (Byte) ⇒ Boolean): Int
-
-
def
lengthCompare(len: Int): Int
-
-
def
map[B, That](f: (Byte) ⇒ B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
-
def
max[B >: Byte](implicit cmp: Ordering[B]): Byte
-
def
maxBy[B](f: (Byte) ⇒ B)(implicit cmp: Ordering[B]): Byte
-
def
min[B >: Byte](implicit cmp: Ordering[B]): Byte
-
def
minBy[B](f: (Byte) ⇒ B)(implicit cmp: Ordering[B]): Byte
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
padTo[B >: Byte, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
-
def
parCombiner: Combiner[Byte, ParSeq[Byte]]
-
-
def
patch[B >: Byte, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
-
-
def
product[B >: Byte](implicit num: Numeric[B]): B
-
def
reduce[A1 >: Byte](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: Byte](op: (B, Byte) ⇒ B): B
-
def
reduceLeftOption[B >: Byte](op: (B, Byte) ⇒ B): Option[B]
-
def
reduceOption[A1 >: Byte](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: Byte](op: (Byte, B) ⇒ B): B
-
def
reduceRightOption[B >: Byte](op: (Byte, B) ⇒ B): Option[B]
-
-
-
-
def
reverseMap[B, That](f: (Byte) ⇒ B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
def
reversed: List[Byte]
-
def
runWith[U](action: (Byte) ⇒ U): (Int) ⇒ Boolean
-
-
def
scan[B >: Byte, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ByteString, B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, Byte) ⇒ B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
def
scanRight[B, That](z: B)(op: (Byte, B) ⇒ B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
def
segmentLength(p: (Byte) ⇒ Boolean, from: Int): Int
-
-
def
size: Int
-
-
-
-
def
sortBy[B](f: (Byte) ⇒ B)(implicit ord: Ordering[B]): ByteString
-
-
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
def
sum[B >: Byte](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
-
def
toArray[B >: Byte](implicit arg0: ClassTag[B]): Array[B]
-
-
def
toBuffer[A1 >: Byte]: Buffer[A1]
-
def
toByteBuffer: ByteBuffer
-
-
-
-
-
def
toList: List[Byte]
-
def
toMap[T, U](implicit ev: <:<[Byte, (T, U)]): Map[T, U]
-
def
toParArray: ParArray[T]
-
-
def
toSet[B >: Byte]: Set[B]
-
-
def
toString(): String
-
-
def
toVector: Vector[Byte]
-
-
def
union[B >: Byte, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
def
unzip[A1, A2](implicit asPair: (Byte) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (Byte) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
-
def
updated[B >: Byte, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ByteString, B, That]): That
-
final
def
utf8String: String
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
-
def
zipAll[B, A1 >: Byte, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ByteString, (A1, B), That]): That
-
def
zipWithIndex[A1 >: Byte, That](implicit bf: CanBuildFrom[ByteString, (A1, Int), That]): That
-
def
→[B](y: B): (ByteString, B)
Shadowed Implicit Value Members
-
-
-
-
Inherited by implicit conversion MonadOps from
ByteString to MonadOps[Byte]
Inherited by implicit conversion CollectionsHaveToParArray from
ByteString to CollectionsHaveToParArray[ByteString, T]
Inherited by implicit conversion alternateImplicit from
ByteString to ForceImplicitAmbiguity
A rope-like immutable data structure containing bytes. The goal of this structure is to reduce copying of arrays when concatenating and slicing sequences of bytes, and also providing a thread safe way of working with bytes.
TODO: Add performance characteristics