compression

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 coalesceKeys[J, A](maxSize: Positive)(implicit arg0: Order[J], arg1: Order[A], arg2: Field[A], arg3: ConvertableTo[A], JC: Aux[J, EJson], JR: Aux[J, EJson]): (SSTF[J, A, SST[J, A]]) ⇒ SSTF[J, A, SST[J, A]]

   

   Compress a map having greater than maxSize keys by moving the largest group of keys having the same PrimaryTag to the unknown key field and their values to the unknown value field.

7. def coalescePrimary[J, A](implicit arg0: Order[J], arg1: Order[A], arg2: Field[A], arg3: ConvertableTo[A], JC: Aux[J, EJson], JR: Aux[J, EJson]): (SSTF[J, A, SST[J, A]]) ⇒ SSTF[J, A, SST[J, A]]

   

   Compress unions by combining any constants with their primary type if it also appears in the union.

8. def coalesceWithUnknown[J, A](implicit arg0: Order[J], arg1: Order[A], arg2: Field[A], arg3: ConvertableTo[A], JC: Aux[J, EJson], JR: Aux[J, EJson]): (SSTF[J, A, SST[J, A]]) ⇒ SSTF[J, A, SST[J, A]]

   

   Compress maps having unknown keys by coalescing known keys with unknown when the unknown contains any values having the same PrimaryTag as the known key.

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 hashCode(): Int

    

    Definition Classes

    AnyRef → Any

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

15. def limitArrays[J, A](maxLength: Positive)(implicit arg0: Order[J], arg1: Order[A], A: Field[A], JR: Aux[J, EJson]): (SSTF[J, A, SST[J, A]]) ⇒ SSTF[J, A, SST[J, A]]

    

    Replace statically known arrays longer than the given limit with an array of unknown size.

16. def limitStrings[J, A](maxLength: Positive)(implicit A: Ring[A], JR: Aux[J, EJson]): (SSTF[J, A, SST[J, A]]) ⇒ SSTF[J, A, SST[J, A]]

    

    Replace literal string types longer than the given limit with char[].

17. def narrowUnion[J, A](maxSize: Positive)(implicit arg0: Order[J], arg1: Order[A], arg2: Field[A], arg3: ConvertableTo[A], JC: Aux[J, EJson], JR: Aux[J, EJson]): (SSTF[J, A, SST[J, A]]) ⇒ SSTF[J, A, SST[J, A]]

    

    Compress a union larger than maxSize by reducing the largest group of values sharing a primary type to their shared type.

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

    

    Definition Classes

    AnyRef

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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( ... )

26. def z85EncodedBinary[J, A](implicit A: Field[A], JR: Aux[J, EJson]): (SSTF[J, A, SST[J, A]]) ⇒ SSTF[J, A, SST[J, A]]

    

    Replace encoded binary strings with byte[].