Mem

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. def ##(b: Node): Node

   

   The cat operator to combine two values

   The cat operator to combine two values

   0x5 ## 0x3 => 0x53

   b

   Node to cat after

   returns

   a new node as the combination of both this node and b

   Definition Classes

   Node

3. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

4. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

   

   Definition Classes

   TraversableLike → GenTraversableLike

5. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

   

   Definition Classes

   TraversableLike

6. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

   

   Definition Classes

   TraversableLike

7. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

   

   Definition Classes

   SeqLike → GenSeqLike

8. def /:[B](z: B)(op: (B, T) ⇒ B): B

   

   Definition Classes

   TraversableOnce → GenTraversableOnce

9. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

   

   Definition Classes

   SeqLike → GenSeqLike

10. def :\[B](z: B)(op: (T, B) ⇒ B): B

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

11. def <>(src: Node): Unit

    

    Definition Classes

    Node

12. final def ==(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

13. def W0Wtransform(): Unit

    

    Eliminate any zero-width wires attached to this node

    Eliminate any zero-width wires attached to this node

    returns

    if the node was modified

    Definition Classes

    Node

14. def ^^(src: Node): Unit

    

    Definition Classes

    Node

15. val _id: Int

    

    The unique id of this node

    The unique id of this node

    Definition Classes

    Node

16. def _isComplementOf(x: Node): Boolean

    

    Definition Classes

    Node

17. def addString(b: StringBuilder): StringBuilder

    

    Definition Classes

    TraversableOnce

18. def addString(b: StringBuilder, sep: String): StringBuilder

    

    Definition Classes

    TraversableOnce

19. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    

    Definition Classes

    TraversableOnce

20. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

21. def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]

    

    Definition Classes

    PartialFunction → Function1

22. def apply(addr: Int): T

    

    Definition Classes

    Mem → SeqLike → GenSeqLike → Function1

23. def apply(addr: UInt): T

    

    Definition Classes

    Mem → VecLike

24. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1

    

    Definition Classes

    PartialFunction

25. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

26. final def asSInt(): SInt

    

    Definition Classes

    Node

27. final def asUInt(): UInt

    

    Definition Classes

    Node

28. def assign(src: Node): Unit

    

    Definition Classes

    Node

29. def assignClock(clk: Clock): Unit

    

    Definition Classes

    Mem → Delay

30. def assignReset(rst: ⇒ Bool): Boolean

    

    Definition Classes

    Delay

31. def canCSE: Boolean

    

    Definition Classes

    Node

32. def canEqual(that: Any): Boolean

    

    Definition Classes

    IterableLike → Equals

33. lazy val chiselName: String

    

    Definition Classes

    Node

34. var clock: Option[Clock]

    

    The clock for this node

    The clock for this node

    Definition Classes

    Node

35. def clone(): Mem[T]

    

    Definition Classes

    Mem → AnyRef

36. def cloneType: Mem[T]

    

37. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike

38. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

    

    Definition Classes

    TraversableOnce

39. def combinations(n: Int): Iterator[IndexedSeq[T]]

    

    Definition Classes

    SeqLike

40. def companion: GenericCompanion[IndexedSeq]

    

    Definition Classes

    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

41. def componentOf: Module

    

    Get the module that this node is a part of or the top module if not assigned yet

    Get the module that this node is a part of or the top module if not assigned yet

    returns

    The module that this node is a part of

    Definition Classes

    Node

42. def compose[A](g: (A) ⇒ Int): (A) ⇒ T

    

    Definition Classes

    Function1

    Annotations

    @unspecialized()

43. def computePorts: ArrayBuffer[MemSeqRead]

    

44. val consumers: LinkedHashSet[Node]

    

    nodes that consume one of my outputs

    nodes that consume one of my outputs

    Definition Classes

    Node

45. def contains(x: T)(implicit evidence: <:<[T, Bits]): Bool

    

    Definition Classes

    VecLike

46. def contains[A1 >: T](elem: A1): Boolean

    

    Definition Classes

    SeqLike

47. def containsSlice[B](that: GenSeq[B]): Boolean

    

    Definition Classes

    SeqLike

48. def convertMaskedWrites: Unit

    

49. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

50. def copyToArray[B >: T](xs: Array[B]): Unit

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

51. def copyToArray[B >: T](xs: Array[B], start: Int): Unit

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

52. def copyToBuffer[B >: T](dest: Buffer[B]): Unit

    

    Definition Classes

    TraversableOnce

53. def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

    

    Definition Classes

    SeqLike → GenSeqLike

54. def count(p: (T) ⇒ Bool): UInt

    

    Definition Classes

    VecLike

55. def count(p: (T) ⇒ Boolean): Int

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

56. val data: Node

    

57. def dataType: T

    

58. def dblLitValue: Double

    

    Convert the node literal to a Double

    Convert the node literal to a Double

    Definition Classes

    Node

59. def diff[B >: T](that: GenSeq[B]): IndexedSeq[T]

    

    Definition Classes

    SeqLike → GenSeqLike

60. def distinct: IndexedSeq[T]

    

    Definition Classes

    SeqLike → GenSeqLike

61. def doWrite(addr: UInt, condIn: Bool, wdata: Node, wmaskIn: Option[UInt]): Unit

    

62. var driveRand: Boolean

    

    Definition Classes

    Node

63. def drop(n: Int): IndexedSeq[T]

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

64. def dropRight(n: Int): IndexedSeq[T]

    

    Definition Classes

    IterableLike

65. def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

    

    Definition Classes

    TraversableLike → GenTraversableLike

66. def endsWith[B](that: GenSeq[B]): Boolean

    

    Definition Classes

    SeqLike → GenSeqLike

67. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

68. def equals(that: Any): Boolean

    

    Compare two nodes

    Compare two nodes

    that

    the node to compare with

    Definition Classes

    Mem → GenSeqLike → Equals → Node → AnyRef → Any

69. def equalsForCSE(x: Node): Boolean

    

    Definition Classes

    Node

70. def exists(p: (T) ⇒ Bool): Bool

    

    Definition Classes

    VecLike

71. def exists(p: (T) ⇒ Boolean): Boolean

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

72. def filter(p: (T) ⇒ Boolean): IndexedSeq[T]

    

    Definition Classes

    TraversableLike → GenTraversableLike

73. def filterNot(p: (T) ⇒ Boolean): IndexedSeq[T]

    

    Definition Classes

    TraversableLike → GenTraversableLike

74. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

75. def find(p: (T) ⇒ Boolean): Option[T]

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

76. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike → FilterMonadic

77. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

    

    Definition Classes

    GenericTraversableTemplate

78. def floLitValue: Float

    

    Convert the node literal to a Float

    Convert the node literal to a Float

    Definition Classes

    Node

79. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

80. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

81. def foldRight[B](z: B)(op: (T, B) ⇒ B): B

    

    Definition Classes

    IterableLike → TraversableOnce → GenTraversableOnce

82. def forall(p: (T) ⇒ Bool): Bool

    

    Definition Classes

    VecLike

83. def forall(p: (T) ⇒ Boolean): Boolean

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

84. def foreach[U](f: (T) ⇒ U): Unit

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

85. def genericBuilder[B]: Builder[B, IndexedSeq[B]]

    

    Definition Classes

    GenericTraversableTemplate

86. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

87. def getNode: Node

    
    returns

    The root node input

    Definition Classes

    Node

88. def getWidth(): Int

    
    returns

    the width or number of bits used by this node

    Definition Classes

    Node

    Exceptions thrown

    ChiselException if the width of the node is unknown

89. def groupBy[K](f: (T) ⇒ K): Map[K, IndexedSeq[T]]

    

    Definition Classes

    TraversableLike → GenTraversableLike

90. def grouped(size: Int): Iterator[IndexedSeq[T]]

    

    Definition Classes

    IterableLike

91. def hasDefiniteSize: Boolean

    

    Definition Classes

    TraversableLike → TraversableOnce → GenTraversableOnce

92. val hashCode: Int

    
    returns

    the unique hashCode for this node

    Definition Classes

    Mem → IndexedSeqLike → GenSeqLike → Node → AnyRef → Any

93. def hashCodeForCSE: Int

    

    Definition Classes

    Node

94. def head: T

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

95. def headOption: Option[T]

    

    Definition Classes

    TraversableLike → GenTraversableLike

96. def indexOf[B >: T](elem: B, from: Int): Int

    

    Definition Classes

    GenSeqLike

97. def indexOf[B >: T](elem: B): Int

    

    Definition Classes

    GenSeqLike

98. def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

    

    Definition Classes

    SeqLike

99. def indexOfSlice[B >: T](that: GenSeq[B]): Int

    

    Definition Classes

    SeqLike

100. def indexWhere(p: (T) ⇒ Bool): UInt

     

     Definition Classes

     VecLike

101. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

     

     Definition Classes

     SeqLike → GenSeqLike

102. def indexWhere(p: (T) ⇒ Boolean): Int

     

     Definition Classes

     GenSeqLike

103. def indices: Range

     

     Definition Classes

     SeqLike

104. def infer: Boolean

     

     Called while we're walking the graph inferring the width of nodes.

     Called while we're walking the graph inferring the width of nodes. We return true if we should continue to walk the graph, either because there's a node whose width we don't know, or because we updated a node's width.

     Definition Classes

     Node

105. def init: IndexedSeq[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

106. def init(n: String, w: Int, ins: Node*): Node

     

     Init the node and calculate its width and add inputs to the node

     Init the node and calculate its width and add inputs to the node

     n

     name of node

     w

     the bit width of the node

     ins

     Nodes that are inputs to this node

     Definition Classes

     Node

107. def init(n: String, widthFunc: (⇒ Node) ⇒ Width, ins: Node*): Node

     

     Init the node and calculate its width and add inputs to the node

     Init the node and calculate its width and add inputs to the node

     n

     name of node

     widthFunc

     the function to use to calculate the width of the node

     ins

     Nodes that are inputs to this node

     Definition Classes

     Node

108. def initOf(n: String, widthfunc: (⇒ Node) ⇒ Width, ins: Seq[Node]): Node

     

     Init the node and calculate its width and add inputs to the node

     Init the node and calculate its width and add inputs to the node

     n

     name of node

     widthfunc

     the function to use to calculate the width of the node

     ins

     Nodes that are inputs to this node

     Definition Classes

     Node

109. def inits: Iterator[IndexedSeq[T]]

     

     Definition Classes

     TraversableLike

110. val inputs: ArrayBuffer[Node]

     

     The inputs that this node depends on

     The inputs that this node depends on

     Definition Classes

     Node

111. def intersect[B >: T](that: GenSeq[B]): IndexedSeq[T]

     

     Definition Classes

     SeqLike → GenSeqLike

112. def isDefinedAt(idx: Int): Boolean

     

     Definition Classes

     GenSeqLike

113. def isEmpty: Boolean

     

     Definition Classes

     SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

114. lazy val isInObject: Boolean

     

     Definition Classes

     Delay → Node

115. lazy val isInVCD: Boolean

     

     Definition Classes

     Mem → Node

116. def isInline: Boolean

     

117. final def isInstanceOf[T0]: Boolean

     

     Definition Classes

     Any

118. def isIo: Boolean

     
     returns

     this node is an I/O Node for a module

     Definition Classes

     Node

119. def isIo_=(isIo: Boolean): Unit

     

     Attributes

     protected[Chisel]

     Definition Classes

     Node

120. final def isLit: Boolean

     

     This function determines if a node is a literal, a fixed value

     This function determines if a node is a literal, a fixed value

     Definition Classes

     Node

121. def isTopLevelIO: Boolean

     
     returns

     is this node I/O for the top level module

     Definition Classes

     Node

122. final def isTraversableAgain: Boolean

     

     Definition Classes

     TraversableLike → GenTraversableLike → GenTraversableOnce

123. var isTypeNode: Boolean

     

     Definition Classes

     Node

124. def isTypeOnly: Boolean

     

     Chisel3 - type-only nodes (no data - no initialization or assignment) This is used to determine which nodes must be Wire() wrapped, and whether Wire() wrapping of the node is legal or not.

     Chisel3 - type-only nodes (no data - no initialization or assignment) This is used to determine which nodes must be Wire() wrapped, and whether Wire() wrapping of the node is legal or not.

     Definition Classes

     Mem → Node

125. def isUsedByClockHi: Boolean

     
     returns

     this node is a Register

     Definition Classes

     Node

126. def isZeroWidth: Boolean

     
     returns

     this node has zero-width

     Definition Classes

     Node

127. def iterator: Iterator[T]

     

     Definition Classes

     IndexedSeqLike → IterableLike → GenIterableLike

128. def last: T

     

     Definition Classes

     TraversableLike → GenTraversableLike

129. def lastIndexOf[B >: T](elem: B, end: Int): Int

     

     Definition Classes

     GenSeqLike

130. def lastIndexOf[B >: T](elem: B): Int

     

     Definition Classes

     GenSeqLike

131. def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

     

     Definition Classes

     SeqLike

132. def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

     

     Definition Classes

     SeqLike

133. def lastIndexWhere(p: (T) ⇒ Bool): UInt

     

     Definition Classes

     VecLike

134. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

     

     Definition Classes

     SeqLike → GenSeqLike

135. def lastIndexWhere(p: (T) ⇒ Boolean): Int

     

     Definition Classes

     GenSeqLike

136. def lastOption: Option[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

137. def length: Int

     

     Definition Classes

     Mem → SeqLike → GenSeqLike

138. def lengthCompare(len: Int): Int

     

     Definition Classes

     SeqLike

139. def lift: (Int) ⇒ Option[T]

     

     Definition Classes

     PartialFunction

140. val line: StackTraceElement

     

     The trace information for chisel for this node

     The trace information for chisel for this node

     Definition Classes

     Node

141. def litOf: Literal

     
     returns

     the literal value of a node

     Definition Classes

     Node

     Exceptions thrown

     ChiselException if there is no literal value available

142. def litValue(default: BigInt = BigInt(-1)): BigInt

     
     returns

     the literal value of the node as a BigInt

     Bool(true).litValue() => BigInt(1)

     Definition Classes

     Node

143. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     TraversableLike → GenTraversableLike → FilterMonadic

144. def max[B >: T](implicit cmp: Ordering[B]): T

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

145. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

146. def maybeFlatten: Seq[Node]

     

     Deprecated: Do not use

     Deprecated: Do not use

     Definition Classes

     Node

147. def min[B >: T](implicit cmp: Ordering[B]): T

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

148. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

149. def mkString: String

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

150. def mkString(sep: String): String

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

151. def mkString(start: String, sep: String, end: String): String

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

152. var modified: Boolean

     

     Definition Classes

     Node

153. val n: Int

     

154. var name: String

     

     Name of the instance.

     Name of the instance.

     Definition Classes

     Nameable

155. var named: Boolean

     

     named is used to indicate that name was set explicitly and should not be overriden

     named is used to indicate that name was set explicitly and should not be overriden

     Definition Classes

     Nameable

156. final def ne(arg0: AnyRef): Boolean

     

     Definition Classes

     AnyRef

157. def needWidth(): Int

     
     returns

     the bitWidth of the node

     Definition Classes

     Node

     Exceptions thrown

     ChiselException if the width is not yet defined

158. def newBuilder: Builder[T, IndexedSeq[T]]

     

     Attributes

     protected[this]

     Definition Classes

     GenericTraversableTemplate → HasNewBuilder

159. def nonEmpty: Boolean

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

160. final def notify(): Unit

     

     Definition Classes

     AnyRef

161. final def notifyAll(): Unit

     

     Definition Classes

     AnyRef

162. def onlyIndexWhere(p: (T) ⇒ Bool): UInt

     

     Definition Classes

     VecLike

163. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

     

     Definition Classes

     PartialFunction

164. val orderedWrites: Boolean

     

165. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     SeqLike → GenSeqLike

166. def par: ParSeq[T]

     

     Definition Classes

     Parallelizable

167. def parCombiner: Combiner[T, ParSeq[T]]

     

     Attributes

     protected[this]

     Definition Classes

     SeqLike → TraversableLike → Parallelizable

168. def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

     

     Definition Classes

     TraversableLike → GenTraversableLike

169. def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     SeqLike → GenSeqLike

170. def permutations: Iterator[IndexedSeq[T]]

     

     Definition Classes

     SeqLike

171. def ports: ArrayBuffer[_ <: MemAccess]

     

172. def prefixLength(p: (T) ⇒ Boolean): Int

     

     Definition Classes

     GenSeqLike

173. def printTree(writer: PrintStream, depth: Int = 4, indent: String = ""): Unit

     

     Prints all members of a node and recursively its inputs up to a certain depth level This method is purely used for debugging

     Prints all members of a node and recursively its inputs up to a certain depth level This method is purely used for debugging

     Definition Classes

     Node

174. def product[B >: T](implicit num: Numeric[B]): B

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

175. var prune: Boolean

     

     Definition Classes

     Node

176. def read(addr: UInt): T

     

     Definition Classes

     Mem → VecLike

177. def readAccesses: ArrayBuffer[_ <: MemAccess]

     

     Definition Classes

     Mem → AccessTracker

178. val reads: ArrayBuffer[MemRead]

     

179. val readwrites: ArrayBuffer[MemReadWrite]

     

180. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

181. def reduceLeft[B >: T](op: (B, T) ⇒ B): B

     

     Definition Classes

     TraversableOnce

182. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

183. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

184. def reduceRight[B >: T](op: (T, B) ⇒ B): B

     

     Definition Classes

     IterableLike → TraversableOnce → GenTraversableOnce

185. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

186. def replaceTree(newNode: Node): Unit

     

     Replace the subtree starting from this node with the indicated replacement

     Replace the subtree starting from this node with the indicated replacement

     newNode

     The node to start tree from

     Definition Classes

     Node

187. def repr: IndexedSeq[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

188. def reverse: IndexedSeq[T]

     

     Definition Classes

     SeqLike → GenSeqLike

189. def reverseIterator: Iterator[T]

     

     Definition Classes

     SeqLike

190. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     SeqLike → GenSeqLike

191. def reversed: List[T]

     

     Attributes

     protected[this]

     Definition Classes

     TraversableOnce

192. def review(): Unit

     

     Review a node for optimization possibilities if its children have been updated

     Review a node for optimization possibilities if its children have been updated

     Definition Classes

     Node

193. def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean

     

     Definition Classes

     PartialFunction

194. def sameElements[B >: T](that: GenIterable[B]): Boolean

     

     Definition Classes

     IterableLike → GenIterableLike

195. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     TraversableLike → GenTraversableLike

196. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     TraversableLike → GenTraversableLike

197. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     TraversableLike → GenTraversableLike

     Annotations

     @migration

     Migration

     (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

198. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

     

     Definition Classes

     SeqLike → GenSeqLike

199. def seq: IndexedSeq[T]

     

     Definition Classes

     IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

200. val seqRead: Boolean

     

201. val seqreads: ArrayBuffer[MemSeqRead]

     

202. def setName(n: String): Unit

     

     Set the name of this module to the string 'n'

     Set the name of this module to the string 'n'

     Definition Classes

     Nameable

     Example:

     1. my.io.node.setName("MY_IO_NODE")

203. def setWidth(w: Int): Unit

     

     Force the bit width of a node

     Force the bit width of a node

     w

     the bit width to force

     Definition Classes

     Node

204. def size: Int

     

     Definition Classes

     SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

205. def slice(from: Int, until: Int): IndexedSeq[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

206. def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]

     

     Definition Classes

     IterableLike

207. def sliding(size: Int): Iterator[IndexedSeq[T]]

     

     Definition Classes

     IterableLike

208. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]

     

     Definition Classes

     SeqLike

209. def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]

     

     Definition Classes

     SeqLike

210. def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]

     

     Definition Classes

     SeqLike

211. def span(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

     

     Definition Classes

     TraversableLike → GenTraversableLike

212. def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])

     

     Definition Classes

     TraversableLike → GenTraversableLike

213. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

     

     Definition Classes

     SeqLike → GenSeqLike

214. def startsWith[B](that: GenSeq[B]): Boolean

     

     Definition Classes

     GenSeqLike

215. def stringPrefix: String

     

     Definition Classes

     TraversableLike → GenTraversableLike

216. def sum[B >: T](implicit num: Numeric[B]): B

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

217. final def synchronized[T0](arg0: ⇒ T0): T0

     

     Definition Classes

     AnyRef

218. def tail: IndexedSeq[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

219. def tails: Iterator[IndexedSeq[T]]

     

     Definition Classes

     TraversableLike

220. def take(n: Int): IndexedSeq[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

221. def takeRight(n: Int): IndexedSeq[T]

     

     Definition Classes

     IterableLike

222. def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

223. def thisCollection: IndexedSeq[T]

     

     Attributes

     protected[this]

     Definition Classes

     IndexedSeqLike → SeqLike → IterableLike → TraversableLike

224. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

225. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

226. def toBits(): UInt

     
     returns

     This node as a UInt

     Definition Classes

     Node

227. def toBuffer[A1 >: T]: Buffer[A1]

     

     Definition Classes

     IndexedSeqLike → TraversableOnce → GenTraversableOnce

228. def toCollection(repr: IndexedSeq[T]): IndexedSeq[T]

     

     Attributes

     protected[this]

     Definition Classes

     IndexedSeqLike → SeqLike → IterableLike → TraversableLike

229. def toIndexedSeq: IndexedSeq[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

230. def toIterable: Iterable[T]

     

     Definition Classes

     IterableLike → TraversableOnce → GenTraversableOnce

231. def toIterator: Iterator[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

232. def toList: List[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

233. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

234. def toNode: Node

     
     returns

     This node

     Definition Classes

     Node

235. def toSInt(): SInt

     

     Definition Classes

     Node

236. def toSeq: Seq[T]

     

     Definition Classes

     SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

237. def toSet[B >: T]: Set[B]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

238. def toStream: Stream[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

239. def toString(): String

     

     Definition Classes

     Mem → SeqLike → TraversableLike → Function1 → AnyRef → Any

240. def toTraversable: Traversable[T]

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

241. def toUInt(): UInt

     

     Definition Classes

     Node

242. def toVector: Vector[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

243. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

     

     Definition Classes

     GenericTraversableTemplate

     Annotations

     @migration

     Migration

     (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

244. def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     SeqLike → GenSeqLike

245. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

     

     Definition Classes

     GenericTraversableTemplate

246. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

     

     Definition Classes

     GenericTraversableTemplate

247. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

     

     Definition Classes

     SeqLike → GenSeqLike

248. def usesInClockHi(i: Node): Boolean

     

     Definition Classes

     Node

249. def view(from: Int, until: Int): SeqView[T, IndexedSeq[T]]

     

     Definition Classes

     SeqLike → IterableLike → TraversableLike

250. def view: SeqView[T, IndexedSeq[T]]

     

     Definition Classes

     SeqLike → IterableLike → TraversableLike

251. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

252. final def wait(arg0: Long, arg1: Int): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

253. final def wait(arg0: Long): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

254. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, IndexedSeq[T]]

     

     Definition Classes

     TraversableLike → FilterMonadic

255. def write(addr: UInt, data: T, mask: Vec[Bool])(implicit evidence: <:<[T, Vec[_]]): Unit

     

256. def write(addr: UInt, data: T, wmask: UInt): Unit

     

257. def write(addr: UInt, dataIn: T): Unit

     

     Definition Classes

     Mem → VecLike

258. def writeAccesses: ArrayBuffer[MemWrite]

     

     Definition Classes

     Mem → AccessTracker

259. val writes: ArrayBuffer[MemWrite]

     

260. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

     

     Definition Classes

     IterableLike → GenIterableLike

261. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

     

     Definition Classes

     IterableLike → GenIterableLike

262. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[IndexedSeq[T], (A1, Int), That]): That

     

     Definition Classes

     IterableLike → GenIterableLike