object bincount extends UFunc

A breeze.generic.UFunc for counting bins.

If passed a traversable object full of Int's, provided those ints are larger than 0, it will return an array of the bin counts. E.g.: bincount(DenseVector[Int](0,1,2,3,1,3,3,3)) == DenseVector[Int](1,2,1,4)

One can also call this on two dense vectors - the second will be treated as an array of weights. E.g.: val x = DenseVector[Int](0,1,2,3,1) val weights = DenseVector[Double](1.0,2.0,1.0,7.0,1.0) result is bincount(x, weights) == DenseVector[Double](1.0,3.0,1,7.0)

Linear Supertypes
UFunc, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. bincount
  2. UFunc
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Impl[V, VR] = UImpl[bincount.this.type, V, VR]
    Definition Classes
    UFunc
  2. type Impl2[V1, V2, VR] = UImpl2[bincount.this.type, V1, V2, VR]
    Definition Classes
    UFunc
  3. type Impl3[V1, V2, V3, VR] = UImpl3[bincount.this.type, V1, V2, V3, VR]
    Definition Classes
    UFunc
  4. type Impl4[V1, V2, V3, V4, VR] = UImpl4[bincount.this.type, V1, V2, V3, V4, VR]
    Definition Classes
    UFunc
  5. type InPlaceImpl[V] = generic.UFunc.InPlaceImpl[bincount.this.type, V]
    Definition Classes
    UFunc
  6. type InPlaceImpl2[V1, V2] = generic.UFunc.InPlaceImpl2[bincount.this.type, V1, V2]
    Definition Classes
    UFunc
  7. type InPlaceImpl3[V1, V2, V3] = generic.UFunc.InPlaceImpl3[bincount.this.type, V1, V2, V3]
    Definition Classes
    UFunc
  8. type SinkImpl[S, V] = generic.UFunc.SinkImpl[bincount.this.type, S, V]
    Definition Classes
    UFunc
  9. type SinkImpl2[S, V1, V2] = generic.UFunc.SinkImpl2[bincount.this.type, S, V1, V2]
    Definition Classes
    UFunc
  10. type SinkImpl3[S, V1, V2, V3] = generic.UFunc.SinkImpl3[bincount.this.type, S, V1, V2, V3]
    Definition Classes
    UFunc

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 apply[V1, V2, V3, V4, VR](v1: V1, v2: V2, v3: V3, v4: V4)(implicit impl: Impl4[V1, V2, V3, V4, VR]): VR
    Definition Classes
    UFunc
  5. final def apply[V1, V2, V3, VR](v1: V1, v2: V2, v3: V3)(implicit impl: Impl3[V1, V2, V3, VR]): VR
    Definition Classes
    UFunc
  6. final def apply[V1, V2, VR](v1: V1, v2: V2)(implicit impl: Impl2[V1, V2, VR]): VR
    Definition Classes
    UFunc
  7. final def apply[V, VR](v: V)(implicit impl: Impl[V, VR]): VR
    Definition Classes
    UFunc
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. implicit def canZipMapValuesImpl[T, V1, VR, U](implicit handhold: ScalarOf[T, V1], impl: Impl2[V1, V1, VR], canZipMapValues: CanZipMapValues[T, V1, VR, U]): Impl2[T, T, U]
    Definition Classes
    UFunc
  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  16. final def inPlace[V, V2, V3](v: V, v2: V2, v3: V3)(implicit impl: generic.UFunc.InPlaceImpl3[bincount.this.type, V, V2, V3]): V
    Definition Classes
    UFunc
  17. final def inPlace[V, V2](v: V, v2: V2)(implicit impl: generic.UFunc.InPlaceImpl2[bincount.this.type, V, V2]): V
    Definition Classes
    UFunc
  18. final def inPlace[V](v: V)(implicit impl: generic.UFunc.InPlaceImpl[bincount.this.type, V]): V
    Definition Classes
    UFunc
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  23. implicit def reduce[T](implicit iter: CanTraverseValues[T, Int]): Impl[T, DenseVector[Int]]
  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. def toString(): String
    Definition Classes
    AnyRef → Any
  26. implicit def vecVersion_Complex: Impl2[DenseVector[Int], DenseVector[Complex], DenseVector[Complex]]
  27. implicit def vecVersion_Double: Impl2[DenseVector[Int], DenseVector[Double], DenseVector[Double]]
  28. implicit def vecVersion_Float: Impl2[DenseVector[Int], DenseVector[Float], DenseVector[Float]]
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def withSink[S](s: S): WithSinkHelp[bincount.this.type, S]
    Definition Classes
    UFunc
  33. object sparse extends UFunc

    A breeze.generic.UFunc for counting bins.

    A breeze.generic.UFunc for counting bins.

    This differs from bincount in that the result it returns is a SparseVector. The internal implementation of this could probably be significantly sped up by avoiding the use of counter. Then again, in sparse situations it's still a lot faster than using bincount.

Inherited from UFunc

Inherited from AnyRef

Inherited from Any

Ungrouped