trait GroupFenwickTreeOps[K, V, +Collection <: GroupFenwickTreeOps[K, V, Collection]] extends fenwick.GroupFenwickTreeOps[K, V, Collection] with MonoidFenwickTreeOps[K, V, Collection]
- Alphabetic
- By Inheritance
- GroupFenwickTreeOps
- MonoidFenwickTreeOps
- SemigroupFenwickTreeOps
- GroupFenwickTreeOps
- MonoidFenwickTreeOps
- SemigroupFenwickTreeOps
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def apply(index: K): V
Returns the element at the given index
Returns the element at the given index
- Definition Classes
- GroupFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifindex
is less thanzero
or greater than or equal tosize
- Note
Time Complexity: O(log N)
- abstract def combine(index: K, value: V): GroupFenwickTreeOps.this.type
Updates the element at the given index to the given value
Updates the element at the given index to the given value
- Definition Classes
- SemigroupFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifindex
is less thanzero
or greater than or equal tosize
- Note
Time Complexity: O(log N)
- abstract def foldRange(from: K, until: K): V
Folds elements in the given range [
from
,until
)Folds elements in the given range [
from
,until
)- Definition Classes
- GroupFenwickTreeOps
- Exceptions thrown
- if
from
is less thanzero
or greater than or equal tosize
- if
until
is less thanzero
or greater thansize
- if
- Note
Time Complexity: O(log N)
- abstract def foldTo(to: K): V
Folds elements in the given range [
zero
,to
]Folds elements in the given range [
zero
,to
]- Definition Classes
- MonoidFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifto
is less thanzero
or greater than or equal tosize
- Note
Time Complexity: O(log N)
- abstract def foldUntil(until: K): V
Folds elements in the given range [
zero
,until
)Folds elements in the given range [
zero
,until
)- Definition Classes
- MonoidFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifuntil
is less thanzero
or greater thansize
- Note
Time Complexity: O(log N)
- implicit abstract def group: CommutativeGroup[V]
- Definition Classes
- GroupFenwickTreeOps
- implicit abstract def monoid: CommutativeMonoid[V]
- Definition Classes
- MonoidFenwickTreeOps
- abstract def reduceTo(to: K): V
Reduces elements in the given range [
zero
,to
]Reduces elements in the given range [
zero
,to
]- Definition Classes
- SemigroupFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifto
is less thanzero
or greater than or equal tosize
- Note
Time Complexity: O(log N)
- abstract def reduceUntil(until: K): V
Reduces elements in the given range [
zero
,until
)Reduces elements in the given range [
zero
,until
)- Definition Classes
- SemigroupFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifuntil
is less thanzero
or greater thansize
- Note
Time Complexity: O(log N)
- implicit abstract def semigroup: CommutativeSemigroup[V]
- Definition Classes
- SemigroupFenwickTreeOps
- abstract def size: K
Returns the size of this tree
Returns the size of this tree
- Definition Classes
- SemigroupFenwickTreeOps
- Note
Time Complexity: O(1)
- abstract def update(index: K, value: V): GroupFenwickTreeOps.this.type
Updates the element at the given index to the given value
Updates the element at the given index to the given value
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifindex
is less thanzero
or greater than or equal tosize
- Note
Time Complexity: O(log N)
- abstract def zero: K
Returns the zero
Returns the zero
- Definition Classes
- SemigroupFenwickTreeOps
- Note
Time Complexity: O(1)
Concrete 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 asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): Collection
- Definition Classes
- SemigroupFenwickTreeOps → AnyRef
- def combined(index: K, value: V): Collection
Updates the element at the given index to the given value
Updates the element at the given index to the given value
- Definition Classes
- SemigroupFenwickTreeOps → SemigroupFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifindex
is less thanzero
or greater than or equal tosize
- Note
Time Complexity: O(log N)
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- 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()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def updated(index: K, value: V): Collection
Updates the element at the given index to the given value
Updates the element at the given index to the given value
- Definition Classes
- GroupFenwickTreeOps → GroupFenwickTreeOps
- Exceptions thrown
java.lang.IndexOutOfBoundsException
ifindex
is less thanzero
or greater than or equal tosize
- Note
Time Complexity: O(log N)
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])