BinSorter

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. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. def compare(left: Array[Byte], leftOffset: Int, right: Array[Byte], rightOffset: Int): Int

   

   Compares two bin chunks by date

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

   

   Definition Classes

   AnyRef

8. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

    

    Definition Classes

    AnyRef → Any

11. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

13. lazy val logger: Logger

    

    Attributes

    protected

    Definition Classes

    LazyLogging

14. def mergeSort(left: Array[Byte], right: Array[Byte], binSize: Int): Array[Byte]

    

    Performs a merge sort into a new byte array

15. def mergeSort(aggregates: Iterator[Array[Byte]], binSize: Int): Iterator[(Array[Byte], Int)]

    

    Takes a sequence of (already sorted) aggregates and combines them in a final sort.

    Takes a sequence of (already sorted) aggregates and combines them in a final sort. Uses a priority queue to compare the head element across each aggregate.

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

    

    Definition Classes

    AnyRef

17. final def notify(): Unit

    

    Definition Classes

    AnyRef

18. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

19. def quickSort(bytes: Array[Byte], left: Int, right: Int, binSize: Int, leftmost: Boolean): Unit

    

    Optimized for non-leftmost insertion sort

20. def quickSort(bytes: Array[Byte], left: Int, right: Int, binSize: Int): Unit

    

    Sorts the specified range of the array by Dual-Pivot Quicksort.

    Sorts the specified range of the array by Dual-Pivot Quicksort. Modified version of java's DualPivotQuicksort

    bytes

    the array to be sorted

    left

    the index of the first element, inclusive, to be sorted

    right

    the index of the last element, inclusive, to be sorted

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

    

    Definition Classes

    AnyRef

22. def toString(): String

    

    Definition Classes

    AnyRef → Any

23. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )