class StreamFragmentPimped[T <: Data] extends AnyRef
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- StreamFragmentPimped
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- 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
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def insertHeader(header: Vec[T]): Stream[Fragment[T]]
Insert a given header value at the begin of each new packet.
Insert a given header value at the begin of each new packet. This may stall upstream during the insertion.
- def insertHeader(header: T): Stream[Fragment[T]]
Insert a given header value at the begin of each new packet.
Insert a given header value at the begin of each new packet. This may stall upstream during the insertion.
- 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
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def reduce[U <: Data](identity: U, accumulator: (U, U, T) => Unit): Stream[U]
Stepwise reduction of all fragments into a single value.
Stepwise reduction of all fragments into a single value. With this, you can calculate the (check)sum of every n elements or parity bits.
- accumulator
A combinatorial function that accumulates the current (param 3) and the previous (param 2) value into the next one (param 1)
outStream = inStream.reduce[SInt]((a, b, c) => { a := b + c })
Example: - def replaceFragmentLast(last: Bool): Stream[Fragment[T]]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toFragmentBits(bitsWidth: Int): Stream[Fragment[Bits]]
- def toStreamOfFragment: Stream[T]
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)