class
TraversableOnceAnyPimped[T] extends AnyRef
Instance Constructors
-
new
TraversableOnceAnyPimped(pimped: Seq[T])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply(id: UInt)(gen: (T) ⇒ Unit): Unit
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
distinctLinked: LinkedHashSet[T]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
final
def
getClass(): Class[_]
-
def
groupByLinked[K](by: (T) ⇒ K): LinkedHashMap[K, ArrayBuffer[T]]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
onMask(conds: Bits)(body: (T) ⇒ Unit): Unit
-
def
onMask(conds: TraversableOnce[Bool])(body: (T) ⇒ Unit): Unit
-
def
onSel(sel: UInt, relaxedWidth: Boolean = false)(body: (T) ⇒ Unit): Unit
-
def
reader(sel: UInt): ReaderSel
-
def
reader(oh: Bits, bypassIfSingle: Boolean): ReaderOh
-
def
reader(oh: TraversableOnce[Bool], bypassIfSingle: Boolean): ReaderOh
-
def
reader(oh: Bits): ReaderOh
-
def
reader(oh: TraversableOnce[Bool]): ReaderOh
-
def
reduceBalancedTree(op: (T, T) ⇒ T, levelBridge: (T, Int) ⇒ T): T
-
def
reduceBalancedTree(op: (T, T) ⇒ T): T
-
def
shuffle(indexMapping: (Int) ⇒ Int): ArrayBuffer[T]
-
def
shuffleWithSize(indexMapping: (Int, Int) ⇒ Int): ArrayBuffer[T]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
wait(): Unit
Deprecated Value Members
-
def
finalize(): Unit
Inherited from AnyRef
Inherited from Any