Mem

Value Members

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

   

   Definition Classes

   AnyRef → Any

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

   

   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

    

    Definition Classes

    Node

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

    

    Definition Classes

    Node

15. val _id: Int

    

    Definition Classes

    Node

16. def _isComplementOf(x: Node): Boolean

    

    Definition Classes

    Node

17. def addConsumers(): Unit

    

    Definition Classes

    Node

18. def addString(b: StringBuilder): StringBuilder

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    PartialFunction → Function1

23. def apply(addr: Int): T

    

    Definition Classes

    Mem → SeqLike → GenSeqLike → Function1

24. def apply(addr: UInt): T

    

    Definition Classes

    Mem → VecLike

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

    

    Definition Classes

    PartialFunction

26. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

27. def assign(src: Node): Unit

    

    Definition Classes

    Node

28. def assignClock(clk: Clock): Unit

    

    Definition Classes

    Mem → Delay

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

    

    Definition Classes

    Delay

30. def canCSE: Boolean

    

    Definition Classes

    Node

31. def canEqual(that: Any): Boolean

    

    Definition Classes

    IterableLike → Equals

32. lazy val chiselName: String

    

    Definition Classes

    Node

33. var clock: Clock

    

    Definition Classes

    Node

34. def clone(): Mem[T]

    

    Definition Classes

    Mem → AnyRef

35. var cntrIdx: Int

    

    Definition Classes

    Node

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    SeqLike

39. def companion: GenericCompanion[IndexedSeq]

    

    Definition Classes

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

40. var component: Module

    

    Definition Classes

    Node

41. def componentOf: Module

    

    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]

    

    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 copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    SeqLike → GenSeqLike

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

    

    Definition Classes

    VecLike

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

55. val data: Node

    

56. def dblLitValue: Double

    

    Definition Classes

    Node

57. var depth: Int

    

    Definition Classes

    Node

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

    

    Definition Classes

    SeqLike → GenSeqLike

59. def distinct: IndexedSeq[T]

    

    Definition Classes

    SeqLike → GenSeqLike

60. def doWrite(addr: UInt, condIn: Bool, wdata: Node, wmaskIn: UInt): Unit

    

61. var driveRand: Boolean

    

    Definition Classes

    Node

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

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

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

    

    Definition Classes

    IterableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

65. lazy val emitIndex: Int

    

    Definition Classes

    Node

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

    

    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 extract(b: Bundle): List[Node]

    

    Definition Classes

    Node

73. def extract(widths: Array[Int]): List[UInt]

    

    Definition Classes

    Node

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

76. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableLike → GenTraversableLike → FilterMonadic

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

    

    Definition Classes

    GenericTraversableTemplate

80. def floLitValue: Float

    

    Definition Classes

    Node

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    VecLike

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

86. def forceMatchingWidths: Unit

    

    Definition Classes

    Node

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

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

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

    

    Definition Classes

    GenericTraversableTemplate

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

    

    Definition Classes

    AnyRef → Any

90. def getLit: Literal

    

    Definition Classes

    Node

91. def getNode: Node

    

    Definition Classes

    Node

92. def getWidth(): Int

    

    Definition Classes

    Node

93. def getWidthW(): Width

    

    Definition Classes

    Node

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    IterableLike

96. def hasDefiniteSize: Boolean

    

    Definition Classes

    TraversableLike → TraversableOnce → GenTraversableOnce

97. val hashCode: Int

    

    Definition Classes

    Mem → IndexedSeqLike → GenSeqLike → Node → AnyRef → Any

98. def hashCodeForCSE: Int

    

    Definition Classes

    Node

99. def head: T

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

100. def headOption: Option[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     GenSeqLike

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

     

     Definition Classes

     GenSeqLike

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

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     VecLike

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

     

     Definition Classes

     SeqLike → GenSeqLike

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

     

     Definition Classes

     GenSeqLike

108. def indices: Range

     

     Definition Classes

     SeqLike

109. def infer: Boolean

     

     Definition Classes

     Node

110. var inferWidth: (⇒ Node) ⇒ Width

     

     Definition Classes

     Node

111. def init: IndexedSeq[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     Node

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

     

     Definition Classes

     Node

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

     

     Definition Classes

     Node

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

     

     Definition Classes

     TraversableLike

116. val inputs: ArrayBuffer[Node]

     

     Definition Classes

     Node

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

     

     Definition Classes

     SeqLike → GenSeqLike

118. def isByValue: Boolean

     

     Definition Classes

     Node

119. def isDefinedAt(idx: Int): Boolean

     

     Definition Classes

     GenSeqLike

120. def isEmpty: Boolean

     

     Definition Classes

     SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

121. lazy val isInObject: Boolean

     

     Definition Classes

     Node

122. lazy val isInVCD: Boolean

     

     Definition Classes

     Mem → Node

123. def isInline: Boolean

     

124. final def isInstanceOf[T0]: Boolean

     

     Definition Classes

     Any

125. def isIo: Boolean

     

     Definition Classes

     Node

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

     

     Definition Classes

     Node

127. def isKnownWidth: Boolean

     

     Definition Classes

     Node

128. final def isLit: Boolean

     

     Definition Classes

     Node

129. def isReg: Boolean

     

     Definition Classes

     Delay → Node

130. final def isTraversableAgain: Boolean

     

     Definition Classes

     TraversableLike → GenTraversableLike → GenTraversableOnce

131. var isTypeNode: Boolean

     

     Definition Classes

     Node

132. def isUsedByClockHi: Boolean

     

     Definition Classes

     Node

133. var isWidthWalked: Boolean

     

     Definition Classes

     Node

134. def iterator: Iterator[T]

     

     Definition Classes

     IndexedSeqLike → IterableLike → GenIterableLike

135. def last: T

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     GenSeqLike

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

     

     Definition Classes

     GenSeqLike

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

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     VecLike

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

     

     Definition Classes

     SeqLike → GenSeqLike

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

     

     Definition Classes

     GenSeqLike

143. def lastOption: Option[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

144. def length: Int

     

     Definition Classes

     Mem → SeqLike → GenSeqLike

145. def lengthCompare(len: Int): Int

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     PartialFunction

147. val line: StackTraceElement

     

     Definition Classes

     Node

148. def litOf: Literal

     

     Definition Classes

     Node

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

     

     Definition Classes

     Node

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

     

     Definition Classes

     TraversableLike → GenTraversableLike → FilterMonadic

151. def matchWidth(w: Width): Node

     

     Definition Classes

     Node

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

154. def maybeFlatten: Seq[Node]

     

     Definition Classes

     Node

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

157. def mkString: String

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

158. def mkString(sep: String): String

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

160. var modified: Boolean

     

     Definition Classes

     Node

161. val n: Int

     

162. var name: String

     

     Definition Classes

     nameable

163. var nameHolder: nameable

     

     Definition Classes

     Node

164. def nameIt(path: String, isNamingIo: Boolean): Unit

     

     Definition Classes

     Node

165. var named: Boolean

     

     _named_ is used to indicates name was set explicitely and should not be overriden by a _nameIt_ generator.

     _named_ is used to indicates name was set explicitely and should not be overriden by a _nameIt_ generator.

     Definition Classes

     nameable

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

     

     Definition Classes

     AnyRef

167. def needWidth(): Int

     

     Definition Classes

     Node

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

     

     Attributes

     protected[this]

     Definition Classes

     GenericTraversableTemplate → HasNewBuilder

169. def nonEmpty: Boolean

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

170. final def notify(): Unit

     

     Definition Classes

     AnyRef

171. final def notifyAll(): Unit

     

     Definition Classes

     AnyRef

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

     

     Definition Classes

     VecLike

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

     

     Definition Classes

     PartialFunction

174. val orderedWrites: Boolean

     

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

     

     Definition Classes

     SeqLike → GenSeqLike

176. def par: ParSeq[T]

     

     Definition Classes

     Parallelizable

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

     

     Attributes

     protected[this]

     Definition Classes

     SeqLike → TraversableLike → Parallelizable

178. var parents: LinkedHashSet[Node]

     

     Definition Classes

     Node

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     SeqLike → GenSeqLike

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

     

     Definition Classes

     SeqLike

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

     

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

     

     Definition Classes

     GenSeqLike

184. 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.

     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

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

186. var prune: Boolean

     

     Definition Classes

     Node

187. def read(addr: UInt): T

     

     Definition Classes

     Mem → VecLike

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

     

     Definition Classes

     Mem → AccessTracker

189. val reads: ArrayBuffer[MemRead]

     

190. val readwrites: ArrayBuffer[MemReadWrite]

     

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     IterableLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

197. def removeTypeNodes(): Unit

     

     Definition Classes

     Node

198. def replaceTree(newNode: Node): Unit

     

     Definition Classes

     Node

199. def repr: IndexedSeq[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

200. def reverse: IndexedSeq[T]

     

     Definition Classes

     SeqLike → GenSeqLike

201. def reverseIterator: Iterator[T]

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     SeqLike → GenSeqLike

203. def reversed: List[T]

     

     Attributes

     protected[this]

     Definition Classes

     TraversableOnce

204. def review(): Unit

     

     Definition Classes

     Node

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

     

     Definition Classes

     PartialFunction

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

     

     Definition Classes

     IterableLike → GenIterableLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

209. 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.

210. var sccIndex: Int

     

     Definition Classes

     Node

211. var sccLowlink: Int

     

     Definition Classes

     Node

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

     

     Definition Classes

     SeqLike → GenSeqLike

213. def seq: IndexedSeq[T]

     

     Definition Classes

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

214. val seqRead: Boolean

     

215. val seqreads: ArrayBuffer[MemSeqRead]

     

216. def setName(n: String): Unit

     

     Definition Classes

     Node

217. def setWidth(w: Int): Unit

     

     Definition Classes

     Node

218. def size: Int

     

     Definition Classes

     SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     SeqLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     SeqLike → GenSeqLike

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

     

     Definition Classes

     GenSeqLike

229. def stringPrefix: String

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     AnyRef

232. def tail: IndexedSeq[T]

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

237. def thisCollection: IndexedSeq[T]

     

     Attributes

     protected[this]

     Definition Classes

     IndexedSeqLike → SeqLike → IterableLike → TraversableLike

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

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

240. def toBits(): UInt

     

     Definition Classes

     Node

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

     

     Definition Classes

     IndexedSeqLike → TraversableOnce → GenTraversableOnce

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

     

     Attributes

     protected[this]

     Definition Classes

     IndexedSeqLike → SeqLike → IterableLike → TraversableLike

243. def toIndexedSeq: IndexedSeq[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

244. def toIterable: Iterable[T]

     

     Definition Classes

     IterableLike → TraversableOnce → GenTraversableOnce

245. def toIterator: Iterator[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

246. def toList: List[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

248. def toNode: Node

     

     Definition Classes

     Node

249. def toSeq: Seq[T]

     

     Definition Classes

     SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

251. def toStream: Stream[T]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

252. def toString(): String

     

     Definition Classes

     Mem → SeqLike → TraversableLike → Function1 → AnyRef → Any

253. def toTraversable: Traversable[T]

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

254. def toVector: Vector[T]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

255. 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.

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

     

     Definition Classes

     SeqLike → GenSeqLike

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

     

     Definition Classes

     GenericTraversableTemplate

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

     

     Definition Classes

     GenericTraversableTemplate

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

     

     Definition Classes

     SeqLike → GenSeqLike

260. def usesInClockHi(i: Node): Boolean

     

     Definition Classes

     Node

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

     

     Definition Classes

     SeqLike → IterableLike → TraversableLike

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

     

     Definition Classes

     SeqLike → IterableLike → TraversableLike

263. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

266. var width_: Width

     

     Definition Classes

     Node

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

     

     Definition Classes

     TraversableLike → FilterMonadic

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

     

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

     

     Definition Classes

     Mem → VecLike

270. def writeAccesses: ArrayBuffer[MemWrite]

     

     Definition Classes

     Mem → AccessTracker

271. val writes: ArrayBuffer[MemWrite]

     

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

     

     Definition Classes

     IterableLike → GenIterableLike

273. 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

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

     

     Definition Classes

     IterableLike → GenIterableLike