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)
- Alphabetic
- By Inheritance
- bincount
- UFunc
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
Impl[V, VR] = UImpl[bincount.this.type, V, VR]
- Definition Classes
- UFunc
-
type
Impl2[V1, V2, VR] = UImpl2[bincount.this.type, V1, V2, VR]
- Definition Classes
- UFunc
-
type
Impl3[V1, V2, V3, VR] = UImpl3[bincount.this.type, V1, V2, V3, VR]
- Definition Classes
- UFunc
-
type
Impl4[V1, V2, V3, V4, VR] = UImpl4[bincount.this.type, V1, V2, V3, V4, VR]
- Definition Classes
- UFunc
-
type
InPlaceImpl[V] = generic.UFunc.InPlaceImpl[bincount.this.type, V]
- Definition Classes
- UFunc
-
type
InPlaceImpl2[V1, V2] = generic.UFunc.InPlaceImpl2[bincount.this.type, V1, V2]
- Definition Classes
- UFunc
-
type
InPlaceImpl3[V1, V2, V3] = generic.UFunc.InPlaceImpl3[bincount.this.type, V1, V2, V3]
- Definition Classes
- UFunc
-
type
SinkImpl[S, V] = generic.UFunc.SinkImpl[bincount.this.type, S, V]
- Definition Classes
- UFunc
-
type
SinkImpl2[S, V1, V2] = generic.UFunc.SinkImpl2[bincount.this.type, S, V1, V2]
- Definition Classes
- UFunc
-
type
SinkImpl3[S, V1, V2, V3] = generic.UFunc.SinkImpl3[bincount.this.type, S, V1, V2, V3]
- Definition Classes
- UFunc
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
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
-
final
def
apply[V1, V2, V3, VR](v1: V1, v2: V2, v3: V3)(implicit impl: Impl3[V1, V2, V3, VR]): VR
- Definition Classes
- UFunc
-
final
def
apply[V1, V2, VR](v1: V1, v2: V2)(implicit impl: Impl2[V1, V2, VR]): VR
- Definition Classes
- UFunc
-
final
def
apply[V, VR](v: V)(implicit impl: Impl[V, VR]): VR
- Definition Classes
- UFunc
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
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
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
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
-
final
def
inPlace[V, V2](v: V, v2: V2)(implicit impl: generic.UFunc.InPlaceImpl2[bincount.this.type, V, V2]): V
- Definition Classes
- UFunc
-
final
def
inPlace[V](v: V)(implicit impl: generic.UFunc.InPlaceImpl[bincount.this.type, V]): V
- Definition Classes
- UFunc
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- implicit def reduce[T](implicit iter: CanTraverseValues[T, Int]): Impl[T, DenseVector[Int]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- implicit def vecVersion_Complex: Impl2[DenseVector[Int], DenseVector[Complex], DenseVector[Complex]]
- implicit def vecVersion_Double: Impl2[DenseVector[Int], DenseVector[Double], DenseVector[Double]]
- implicit def vecVersion_Float: Impl2[DenseVector[Int], DenseVector[Float], DenseVector[Float]]
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
withSink[S](s: S): WithSinkHelp[bincount.this.type, S]
- Definition Classes
- UFunc
-
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.