object ArrayUtil
Array operations on generic arrays, a little faster in general, I hope.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ArrayUtil
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
- def copyOf[V](a: Array[V], length: Int): Array[V]
- def copyOfRange[V, VU >: V](a: Array[V], from: Int, to: Int): Array[V]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(a: Array[_], aoffset: Int, astride: Int, alength: Int, b: Array[_], boffset: Int, bstride: Int, blength: Int): Boolean
- def equals(a: Array[_], b: Array[_]): Boolean
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def fill[V](a: Array[V], offset: Int, length: Int, v: V): Unit
- def gallopSearch(objs: Array[Int], fromIndex: Int, toIndex: Int, toFind: Int): Int
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- 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
For reasons that I cannot explain java.util.Arrays.equals(Array(0.0), Array(-0.0)) == false This method fixes that for floats and doubles
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def range(start: Int, end: Int, stride: Int = 1): Array[Int]
- def sort[V](a: Array[V]): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def zeroSkippingHashCode[V](data: Array[V], offset: Int, stride: Int, length: Int): Int