object
ArrayUtil
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
copyOf[V](a: Array[V], length: Int): Array[V]
-
def
copyOfRange[V, VU >: V](a: Array[V], from: Int, to: Int): Array[V]
-
-
def
equals(a: Array[_], aoffset: Int, astride: Int, alength: Int, b: Array[_], boffset: Int, bstride: Int, blength: Int): Boolean
-
-
-
def
fill[V](a: Array[V], offset: Int, length: Int, v: V): Unit
-
def
finalize(): Unit
-
def
gallopSearch(objs: Array[Int], fromIndex: Int, toIndex: Int, toFind: Int): Int
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
def
newArrayLike[V](a: Array[V], length: Int): Array[V]
-
def
nonstupidEquals(a: Array[_], aoffset: Int, astride: Int, alength: Int, b: Array[_], boffset: Int, bstride: Int, blength: Int): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zeroSkippingHashCode[V](data: Array[V], offset: Int, stride: Int, length: Int): Int
Array operations on generic arrays, a little faster in general, I hope.