BoxedOrderedSerialization

Value Members

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

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. val box: (K) ⇒ Boxed[K]

8. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. def compare(a: Boxed[K], b: Boxed[K]): Int

   Definition Classes

   BoxedOrderedSerialization → Ordering → Comparator

10. def compareBinary(a: InputStream, b: InputStream): Result

    This compares two InputStreams.

    This compares two InputStreams. After this call, the position in the InputStreams is mutated to be the end of the record.

    Definition Classes

    BoxedOrderedSerialization → OrderedSerialization

11. def dynamicSize(k: Boxed[K]): Option[Int]

    returns Some if the size is cheap to calculate.

    returns Some if the size is cheap to calculate. otherwise the caller should just serialize into an ByteArrayOutputStream

    Definition Classes

    BoxedOrderedSerialization → Serialization

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

    Definition Classes

    AnyRef

13. def equiv(x: Boxed[K], y: Boxed[K]): Boolean

    Definition Classes

    Ordering → PartialOrdering → Equiv

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

16. def gt(x: Boxed[K], y: Boxed[K]): Boolean

    Definition Classes

    Ordering → PartialOrdering

17. def gteq(x: Boxed[K], y: Boxed[K]): Boolean

    Definition Classes

    Ordering → PartialOrdering

18. def hash(k: Boxed[K]): Int

    Definition Classes

    BoxedOrderedSerialization → Hashing

19. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

20. def lt(x: Boxed[K], y: Boxed[K]): Boolean

    Definition Classes

    Ordering → PartialOrdering

21. def lteq(x: Boxed[K], y: Boxed[K]): Boolean

    Definition Classes

    Ordering → PartialOrdering

22. def max(x: Boxed[K], y: Boxed[K]): Boxed[K]

    Definition Classes

    Ordering

23. def min(x: Boxed[K], y: Boxed[K]): Boxed[K]

    Definition Classes

    Ordering

24. implicit def mkOrderingOps(lhs: Boxed[K]): Ops

    Definition Classes

    Ordering

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

    Definition Classes

    AnyRef

26. final def notify(): Unit

    Definition Classes

    AnyRef

27. final def notifyAll(): Unit

    Definition Classes

    AnyRef

28. def on[U](f: (U) ⇒ Boxed[K]): Ordering[U]

    Definition Classes

    Ordering

29. val ord: OrderedSerialization[K]

30. def read(from: InputStream): Try[Boxed[K]]

    Definition Classes

    BoxedOrderedSerialization → Serialization

31. def reverse: Ordering[Boxed[K]]

    Definition Classes

    Ordering → PartialOrdering

32. def reversed(): Comparator[Boxed[K]]

    Definition Classes

    Comparator

33. def staticSize: Option[Int]

    If all items have a static size, this returns Some, else None NOTE: lawful implementations that return Some here much return Some on dynamicSize so callers don't need to check both when they have an instance.

    If all items have a static size, this returns Some, else None NOTE: lawful implementations that return Some here much return Some on dynamicSize so callers don't need to check both when they have an instance.

    Definition Classes

    BoxedOrderedSerialization → Serialization

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

    Definition Classes

    AnyRef

35. def thenComparing[U <: Comparable[_ >: U]](arg0: Function[_ >: Boxed[K], _ <: U]): Comparator[Boxed[K]]

    Definition Classes

    Comparator

36. def thenComparing[U](arg0: Function[_ >: Boxed[K], _ <: U], arg1: Comparator[_ >: U]): Comparator[Boxed[K]]

    Definition Classes

    Comparator

37. def thenComparing(arg0: Comparator[_ >: Boxed[K]]): Comparator[Boxed[K]]

    Definition Classes

    Comparator

38. def thenComparingDouble(arg0: ToDoubleFunction[_ >: Boxed[K]]): Comparator[Boxed[K]]

    Definition Classes

    Comparator

39. def thenComparingInt(arg0: ToIntFunction[_ >: Boxed[K]]): Comparator[Boxed[K]]

    Definition Classes

    Comparator

40. def thenComparingLong(arg0: ToLongFunction[_ >: Boxed[K]]): Comparator[Boxed[K]]

    Definition Classes

    Comparator

41. def tryCompare(x: Boxed[K], y: Boxed[K]): Some[Int]

    Definition Classes

    Ordering → PartialOrdering

42. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

45. def write(into: OutputStream, bk: Boxed[K]): Try[Unit]

    Definition Classes

    BoxedOrderedSerialization → Serialization