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. def _1: Long

   

   Definition Classes

   QTree → Product6

   Annotations

   @inline()

5. def _2: Int

   

   Definition Classes

   QTree → Product6

   Annotations

   @inline()

6. def _3: Long

   

   Definition Classes

   QTree → Product6

   Annotations

   @inline()

7. def _4: A

   

   Definition Classes

   QTree → Product6

   Annotations

   @inline()

8. def _5: Option[QTree[A]]

   

   Definition Classes

   QTree → Product6

   Annotations

   @inline()

9. def _6: Option[QTree[A]]

   

   Definition Classes

   QTree → Product6

   Annotations

   @inline()

10. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

11. def canEqual(other: Any): Boolean

    

    Definition Classes

    QTree → Equals

12. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. 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.

14. def count: Long

    

    Annotations

    @inline()

15. def dump(): Unit

    

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

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

    

    Definition Classes

    AnyRef

17. def equals(other: Any): Boolean

    

    Definition Classes

    QTree → Equals → AnyRef → Any

18. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

20. lazy val hashCode: Int

    

    Definition Classes

    QTree → AnyRef → Any

21. 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

22. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

23. def level: Int

    

    Annotations

    @inline()

24. def lowerBound: Double

    

25. def lowerChild: Option[QTree[A]]

    

26. 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.

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

    

    Definition Classes

    AnyRef

28. final def notify(): Unit

    

    Definition Classes

    AnyRef

29. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

30. def offset: Long

    

    Annotations

    @inline()

31. def productArity: Int

    

    Definition Classes

    QTree → Product6 → Product

32. def productElement(n: Int): Any

    

    Definition Classes

    Product6 → Product

    Annotations

    @throws( ... )

33. def productIterator: Iterator[Any]

    

    Definition Classes

    Product

34. def productPrefix: String

    

    Definition Classes

    Product

35. 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.

36. val range: Double

    

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

    

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

38. 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

39. 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.

40. def sum: A

    

    Annotations

    @inline()

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

    

    Definition Classes

    AnyRef

42. def toString(): String

    

    Definition Classes

    QTree → AnyRef → Any

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

    

    Total sum over the entire tree.

44. def upperBound: Double

    

45. def upperChild: Option[QTree[A]]

    

46. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )