QTree

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 compress(k: Int)(implicit m: Monoid[A]): QTree[A]

   

   Users should never need to call this if they are adding QTrees using the Semigroup This makes sure no element in the tree has count less than the total count / 2^{k. That means after this call there are at most 2}k nodes, but usually fewer.

7. val count: Long

   

8. def dump: Unit

   

   A debug method that prints the QTree to standard out using print/println

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

   

   Definition Classes

   AnyRef

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

12. def interQuartileMean(implicit n: Numeric[A], m: Monoid[A]): (Double, Double)

    

    This gives you the mean for the middle 50%-ile.

    This gives you the mean for the middle 50%-ile. This probably only makes sense if the Monoid[A] is equivalent to addition in Numeric[A], which is only used to convert to Double at the end

13. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

14. val level: Int

    

15. def lowerBound: Double

    

16. val lowerChild: Option[QTree[A]]

    

17. def merge(other: QTree[A])(implicit monoid: Monoid[A]): QTree[A]

    

    This merges with another QTree but DOES NOT compress.

    This merges with another QTree but DOES NOT compress. You should probably never use this and instead use QTreeSemigroup.plus(a, b) or .sumOption. Strongly prefer sumOption if you can, as it is much more efficient due to compressing less frequently.

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. val offset: Long

    

22. def quantileBounds(p: Double): (Double, Double)

    

    give lower and upper bounds respectively of the percentile value given.

    give lower and upper bounds respectively of the percentile value given. For instance, quantileBounds(0.5) would give an estimate of the median.

23. def range: Double

    

24. def rangeCountBounds(from: Double, to: Double): (Long, Long)

    

    Return upper and lower bounds on the counts that appear in a given range

25. def rangeSumBounds(from: Double, to: Double)(implicit monoid: Monoid[A]): (A, A)

    

    Get the bounds on the sums within a range (not percentile) This along with the rangeCountBounds can tell you the mean over a range

26. def size: Int

    

    How many total nodes are there in the QTree.

    How many total nodes are there in the QTree. Not meaningful for learning statistics, but interesting to estimate serialization size.

27. val sum: A

    

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

    

    Definition Classes

    AnyRef

29. def totalSum(implicit monoid: Monoid[A]): A

    

    Total sum over the entire tree.

30. def upperBound: Double

    

31. val upperChild: Option[QTree[A]]

    

32. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )