util

Type Members

final class AnyRefExtractor[A, B <: AnyRef] extends AnyRef
final class CellArray[T] extends AnyRef
final class CellWheel[T] extends AnyRef
final class DoubleCell extends PrimitiveCell
final class IntInt extends AnyVal
sealed abstract class PrimitiveCell extends AnyRef
final class RichArrayBuffer[A] extends AnyVal
final class RichByteArray extends AnyVal
final class RichConfig extends AnyVal
final class RichFuture[T] extends AnyVal
final class RichHList[L <: HList] extends AnyVal
final class RichList[T] extends AnyVal
final class RichRefArray[T <: AnyRef] extends AnyVal
final class RichSeq[A] extends AnyVal
final class RichString extends AnyVal
final class RichTraversable[A] extends AnyVal
final class XorShiftRandom extends AnyRef

xorshift128+ random number generator as proposed by Sebastiano Vigna in "Further scramblings of Marsaglia’s xorshift generators" (April 2014): http://vigna.di.unimi.it/ftp/papers/xorshiftplus.pdf
xorshift128+ random number generator as proposed by Sebastiano Vigna in "Further scramblings of Marsaglia’s xorshift generators" (April 2014): http://vigna.di.unimi.it/ftp/papers/xorshiftplus.pdf
In this paper Vigna claims that xorshift128+ "is currently the fastest full-period generator we are aware of that does not fail systematically any BigCrush test (not even reversed), making it an excellent drop-in substitute for the low-dimensional generators found in many programming languages."
Further: "For example, the current default pseudorandom number generator of the Erlang language is a custom xorshift116+ generator designed by the author using 58-bit integers and shifts (Erlang uses the upper 6 bits for object metadata, so using 64-bit integers would make the algorithm significantly slower); and the JavaScript engines of Chrome, Firefox and Safari are based on xorshift128+. xorshift128+ can also be easily implemented in hardware, as it requires just three shift, four xors and an addition."

Value Members

object AnyRefExtractor
object IntInt
object LongArray
object XorShiftRandom
def dropFunc[T]: (T) ⇒ Unit
def identityFunc[T]: (T) ⇒ T
def identityHash(obj: AnyRef): String
def isPowerOf2(i: Int): Boolean
macro def requireArg(cond: Boolean, msg: Any): Unit

Definition Classes
HelperMacros
macro def requireArg(cond: Boolean): Unit

Definition Classes
HelperMacros
macro def requireState(cond: Boolean, msg: Any): Unit

Definition Classes
HelperMacros
macro def requireState(cond: Boolean): Unit

Definition Classes
HelperMacros
implicit def richArrayBuffer[T](seq: ArrayBuffer[T]): RichArrayBuffer[T]
implicit def richByteArray(array: Array[Byte]): RichByteArray
implicit def richConfig[T](config: Config): RichConfig
implicit def richFuture[T](future: Future[T]): RichFuture[T]
implicit def richHList[L <: HList](list: L): RichHList[L]
implicit def richInt(int: Int): RichInt
implicit def richList[T](list: List[T]): RichList[T]
implicit def richLong(long: Long): RichLong
implicit def richRefArray[T <: AnyRef](array: Array[T]): RichRefArray[T]
implicit def richSeq[T](seq: Seq[T]): RichSeq[T]
implicit def richString(string: String): RichString
implicit def richTraversable[T](seq: Traversable[T]): RichTraversable[T]
def roundUpToNextPowerOf2(i: Int): Int

package util

Type Members

final class AnyRefExtractor[A, B <: AnyRef] extends AnyRef

final class CellArray[T] extends AnyRef

final class CellWheel[T] extends AnyRef

final class DoubleCell extends PrimitiveCell

final class IntInt extends AnyVal

sealed abstract class PrimitiveCell extends AnyRef

final class RichArrayBuffer[A] extends AnyVal

final class RichByteArray extends AnyVal

final class RichConfig extends AnyVal

final class RichFuture[T] extends AnyVal

final class RichHList[L <: HList] extends AnyVal

final class RichList[T] extends AnyVal

final class RichRefArray[T <: AnyRef] extends AnyVal

final class RichSeq[A] extends AnyVal

final class RichString extends AnyVal

final class RichTraversable[A] extends AnyVal

final class XorShiftRandom extends AnyRef

Value Members

object AnyRefExtractor

object IntInt

object LongArray

object XorShiftRandom

def dropFunc[T]: (T) ⇒ Unit

def identityFunc[T]: (T) ⇒ T

def identityHash(obj: AnyRef): String

def isPowerOf2(i: Int): Boolean

macro def requireArg(cond: Boolean, msg: Any): Unit

macro def requireArg(cond: Boolean): Unit

macro def requireState(cond: Boolean, msg: Any): Unit

macro def requireState(cond: Boolean): Unit

implicit def richArrayBuffer[T](seq: ArrayBuffer[T]): RichArrayBuffer[T]

implicit def richByteArray(array: Array[Byte]): RichByteArray

implicit def richConfig[T](config: Config): RichConfig

implicit def richFuture[T](future: Future[T]): RichFuture[T]

implicit def richHList[L <: HList](list: L): RichHList[L]

implicit def richInt(int: Int): RichInt

implicit def richList[T](list: List[T]): RichList[T]

implicit def richLong(long: Long): RichLong

implicit def richRefArray[T <: AnyRef](array: Array[T]): RichRefArray[T]

implicit def richSeq[T](seq: Seq[T]): RichSeq[T]

implicit def richString(string: String): RichString

implicit def richTraversable[T](seq: Traversable[T]): RichTraversable[T]

def roundUpToNextPowerOf2(i: Int): Int

Inherited from HelperMacros

Inherited from AnyRef

Inherited from Any

Ungrouped