UnsafeSortDataFormat

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def allocate(length: Int): LongArray

   

   Allocates a Buffer that can hold up to 'length' elements.

   Allocates a Buffer that can hold up to 'length' elements. All elements of the buffer should be considered invalid until data is explicitly copied in.

   Definition Classes

   UnsafeSortDataFormat → SortDataFormat

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def copyElement(src: LongArray, srcPos: Int, dst: LongArray, dstPos: Int): Unit

   

   Copy a single element from src(srcPos) to dst(dstPos).

   Copy a single element from src(srcPos) to dst(dstPos).

   Definition Classes

   UnsafeSortDataFormat → SortDataFormat

8. def copyRange(src: LongArray, srcPos: Int, dst: LongArray, dstPos: Int, length: Int): Unit

   

   Copy a range of elements starting at src(srcPos) to dst, starting at dstPos.

   Copy a range of elements starting at src(srcPos) to dst, starting at dstPos. Overlapping ranges are allowed.

   Definition Classes

   UnsafeSortDataFormat → SortDataFormat

9. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

12. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

13. def getKey(data: LongArray, pos: Int, reuse: RecordPointerAndKeyPrefix): RecordPointerAndKeyPrefix

    

    Returns the sort key for the element at the given index and reuse the input key if possible.

    Returns the sort key for the element at the given index and reuse the input key if possible. The default implementation ignores the reuse parameter and invokes Int. If you want to override this method, you must implement newKey().

    Definition Classes

    UnsafeSortDataFormat → SortDataFormat

14. def getKey(data: LongArray, pos: Int): RecordPointerAndKeyPrefix

    

    Return the sort key for the element at the given index.

    Return the sort key for the element at the given index.

    Definition Classes

    UnsafeSortDataFormat → SortDataFormat

15. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

17. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

18. def newKey(): RecordPointerAndKeyPrefix

    

    Creates a new mutable key for reuse.

    Creates a new mutable key for reuse. This should be implemented if you want to override Int, K).

    Definition Classes

    UnsafeSortDataFormat → SortDataFormat

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

21. def swap(data: LongArray, pos0: Int, pos1: Int): Unit

    

    Swap two elements.

    Swap two elements.

    Definition Classes

    UnsafeSortDataFormat → SortDataFormat

22. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

23. def toString(): String

    

    Definition Classes

    AnyRef → Any

24. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

25. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )