innerClasses

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def + [B1 >: InnerClassEntry] (elem1: (Name, B1), elem2: (Name, B1), elems: (Name, B1)*): Map[Name, B1]

def + [B1 >: InnerClassEntry] (kv: (Name, B1)): Map[Name, B1]

def ++ [B1 >: InnerClassEntry] (xs: TraversableOnce[(Name, B1)]): Map[Name, B1]

def ++ [B1 >: InnerClassEntry] (xs: GenTraversableOnce[(Name, B1)]): Map[Name, B1]

def ++ [B >: (Name, InnerClassEntry), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def ++ [B >: (Name, InnerClassEntry), That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def ++: [B >: (Name, InnerClassEntry), That] (that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def ++: [B >: (Name, InnerClassEntry), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def ++= (xs: TraversableOnce[(Name, InnerClassEntry)]): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def += (kv: (Name, InnerClassEntry)): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def += (elem1: (Name, InnerClassEntry), elem2: (Name, InnerClassEntry), elems: (Name, InnerClassEntry)*): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def - (elem1: Name, elem2: Name, elems: Name*): HashMap[Name, InnerClassEntry]

def - (key: Name): HashMap[Name, InnerClassEntry]

def -- (xs: TraversableOnce[Name]): HashMap[Name, InnerClassEntry]

def -- (xs: GenTraversableOnce[Name]): HashMap[Name, InnerClassEntry]

def --= (xs: TraversableOnce[Name]): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def -= (key: Name): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def -= (elem1: Name, elem2: Name, elems: Name*): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def /: [B] (z: B)(op: (B, (Name, InnerClassEntry)) ⇒ B): B

def /:\ [A1 >: (Name, InnerClassEntry)] (z: A1)(op: (A1, A1) ⇒ A1): A1

def :\ [B] (z: B)(op: ((Name, InnerClassEntry), B) ⇒ B): B

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

var _loadFactor : Int

def addEntry (e: DefaultEntry[Name, InnerClassEntry]): Unit

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

def addString (b: StringBuilder): StringBuilder

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

def aggregate [B] (z: B)(seqop: (B, (Name, InnerClassEntry)) ⇒ B, combop: (B, B) ⇒ B): B

def alwaysInitSizeMap : Boolean

def andThen [C] (k: (InnerClassEntry) ⇒ C): PartialFunction[Name, C]

def apply (key: Name): InnerClassEntry

def asInstanceOf [T0] : T0

def calcSizeMapSize (tableLength: Int): Int

def canEqual (that: Any): Boolean

def classSymbol (externalName: Name): Symbol

Return the class symbol for 'externalName'.

def clear (): Unit

def clearTable (): Unit

def clone (): HashMap[Name, InnerClassEntry]

def collect [B, That] (pf: PartialFunction[(Name, InnerClassEntry), B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def collectFirst [B] (pf: PartialFunction[(Name, InnerClassEntry), B]): Option[B]

def companion : GenericCompanion[Iterable]

def compose [A] (g: (A) ⇒ Name): (A) ⇒ InnerClassEntry

def contains (key: Name): Boolean

def copyToArray [B >: (Name, InnerClassEntry)] (xs: Array[B], start: Int, len: Int): Unit

def copyToArray [B >: (Name, InnerClassEntry)] (xs: Array[B]): Unit

def copyToArray [B >: (Name, InnerClassEntry)] (xs: Array[B], start: Int): Unit

def copyToBuffer [B >: (Name, InnerClassEntry)] (dest: Buffer[B]): Unit

def count (p: ((Name, InnerClassEntry)) ⇒ Boolean): Int

def default (key: Name): InnerClassEntry

def drop (n: Int): HashMap[Name, InnerClassEntry]

def dropRight (n: Int): HashMap[Name, InnerClassEntry]

def dropWhile (p: ((Name, InnerClassEntry)) ⇒ Boolean): HashMap[Name, InnerClassEntry]

def elemEquals (key1: Name, key2: Name): Boolean

def elemHashCode (key: Name): Int

def empty : HashMap[Name, InnerClassEntry]

def entriesIterator : Iterator[DefaultEntry[Name, InnerClassEntry]]

def eq (arg0: AnyRef): Boolean

def equals (that: Any): Boolean

def exists (p: ((Name, InnerClassEntry)) ⇒ Boolean): Boolean

def filter (p: ((Name, InnerClassEntry)) ⇒ Boolean): HashMap[Name, InnerClassEntry]

def filterKeys (p: (Name) ⇒ Boolean): Map[Name, InnerClassEntry]

def filterNot (p: ((Name, InnerClassEntry)) ⇒ Boolean): HashMap[Name, InnerClassEntry]

def finalize (): Unit

def find (p: ((Name, InnerClassEntry)) ⇒ Boolean): Option[(Name, InnerClassEntry)]

def findEntry (key: Name): DefaultEntry[Name, InnerClassEntry]

def flatMap [B, That] (f: ((Name, InnerClassEntry)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def flatten [B] (implicit asTraversable: ((Name, InnerClassEntry)) ⇒ TraversableOnce[B]): Traversable[B]

def fold [A1 >: (Name, InnerClassEntry)] (z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft [B] (z: B)(op: (B, (Name, InnerClassEntry)) ⇒ B): B

def foldRight [B] (z: B)(op: ((Name, InnerClassEntry), B) ⇒ B): B

def forall (p: ((Name, InnerClassEntry)) ⇒ Boolean): Boolean

def foreach [C] (f: ((Name, InnerClassEntry)) ⇒ C): Unit

def foreachEntry [C] (f: (DefaultEntry[Name, InnerClassEntry]) ⇒ C): Unit

def genericBuilder [B] : Builder[B, Iterable[B]]

def get (key: Name): Option[InnerClassEntry]

def getClass (): java.lang.Class[_]

def getOrElse [B1 >: InnerClassEntry] (key: Name, default: ⇒ B1): B1

def getOrElseUpdate (key: Name, op: ⇒ InnerClassEntry): InnerClassEntry

def groupBy [K] (f: ((Name, InnerClassEntry)) ⇒ K): Map[K, HashMap[Name, InnerClassEntry]]

def grouped (size: Int): Iterator[HashMap[Name, InnerClassEntry]]

def hasDefiniteSize : Boolean

def hashCode (): Int

def head : (Name, InnerClassEntry)

def headOption : Option[(Name, InnerClassEntry)]

def improve (hcode: Int): Int

def index (hcode: Int): Int

def init : HashMap[Name, InnerClassEntry]

def initWithContents (c: Contents[Name, DefaultEntry[Name, InnerClassEntry]]): Unit

def initialSize : Int

def inits : Iterator[HashMap[Name, InnerClassEntry]]

def isDefinedAt (key: Name): Boolean

def isEmpty : Boolean

def isInstanceOf [T0] : Boolean

def isSizeMapDefined : Boolean

def isTraversableAgain : Boolean

def iterator : Iterator[(Name, InnerClassEntry)]

def keySet : Set[Name]

def keys : Iterable[Name]

def keysIterator : Iterator[Name]

def last : (Name, InnerClassEntry)

def lastOption : Option[(Name, InnerClassEntry)]

def lift : (Name) ⇒ Option[InnerClassEntry]

def map [B, That] (f: ((Name, InnerClassEntry)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def mapResult [NewTo] (f: (HashMap[Name, InnerClassEntry]) ⇒ NewTo): Builder[(Name, InnerClassEntry), NewTo]

def mapValues [C] (f: (InnerClassEntry) ⇒ C): Map[Name, C]

def max [B >: (Name, InnerClassEntry)] (implicit cmp: Ordering[B]): (Name, InnerClassEntry)

def maxBy [B] (f: ((Name, InnerClassEntry)) ⇒ B)(implicit cmp: Ordering[B]): (Name, InnerClassEntry)

def min [B >: (Name, InnerClassEntry)] (implicit cmp: Ordering[B]): (Name, InnerClassEntry)

def minBy [B] (f: ((Name, InnerClassEntry)) ⇒ B)(implicit cmp: Ordering[B]): (Name, InnerClassEntry)

def mkString : String

def mkString (sep: String): String

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

def ne (arg0: AnyRef): Boolean

def newBuilder : Builder[(Name, InnerClassEntry), HashMap[Name, InnerClassEntry]]

def nnSizeMapAdd (h: Int): Unit

def nnSizeMapRemove (h: Int): Unit

def nnSizeMapReset (tableLength: Int): Unit

def nonEmpty : Boolean

def notify (): Unit

def notifyAll (): Unit

def orElse [A1 <: Name, B1 >: InnerClassEntry] (that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def par : ParHashMap[Name, InnerClassEntry]

def parCombiner : Combiner[(Name, InnerClassEntry), ParHashMap[Name, InnerClassEntry]]

def partition (p: ((Name, InnerClassEntry)) ⇒ Boolean): (HashMap[Name, InnerClassEntry], HashMap[Name, InnerClassEntry])

def product [B >: (Name, InnerClassEntry)] (implicit num: Numeric[B]): B

def put (key: Name, value: InnerClassEntry): Option[InnerClassEntry]

def reduce [A1 >: (Name, InnerClassEntry)] (op: (A1, A1) ⇒ A1): A1

def reduceLeft [B >: (Name, InnerClassEntry)] (op: (B, (Name, InnerClassEntry)) ⇒ B): B

def reduceLeftOption [B >: (Name, InnerClassEntry)] (op: (B, (Name, InnerClassEntry)) ⇒ B): Option[B]

def reduceOption [A1 >: (Name, InnerClassEntry)] (op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight [B >: (Name, InnerClassEntry)] (op: ((Name, InnerClassEntry), B) ⇒ B): B

def reduceRightOption [B >: (Name, InnerClassEntry)] (op: ((Name, InnerClassEntry), B) ⇒ B): Option[B]

def remove (key: Name): Option[InnerClassEntry]

def removeEntry (key: Name): DefaultEntry[Name, InnerClassEntry]

def repr : HashMap[Name, InnerClassEntry]

def result (): HashMap[Name, InnerClassEntry]

def retain (p: (Name, InnerClassEntry) ⇒ Boolean): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def reversed : List[(Name, InnerClassEntry)]

def sameElements [B >: (Name, InnerClassEntry)] (that: Iterable[B]): Boolean

def sameElements [B >: (Name, InnerClassEntry)] (that: GenIterable[B]): Boolean

def scan [B >: (Name, InnerClassEntry), That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def scanLeft [B, That] (z: B)(op: (B, (Name, InnerClassEntry)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def scanRight [B, That] (z: B)(op: ((Name, InnerClassEntry), B) ⇒ B)(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], B, That]): That

def seq : Map[Name, InnerClassEntry]

def size : Int

def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int): Unit

def sizeHint (size: Int): Unit

def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

def sizeMapBucketBitSize : Int

def sizeMapBucketSize : Int

def sizeMapDisable (): Unit

def sizeMapInit (tableLength: Int): Unit

def sizeMapInitAndRebuild (): Unit

var sizemap : Array[Int]

def slice (from: Int, until: Int): HashMap[Name, InnerClassEntry]

def sliding [B >: (Name, InnerClassEntry)] (size: Int, step: Int): Iterator[HashMap[Name, InnerClassEntry]]

def sliding [B >: (Name, InnerClassEntry)] (size: Int): Iterator[HashMap[Name, InnerClassEntry]]

def span (p: ((Name, InnerClassEntry)) ⇒ Boolean): (HashMap[Name, InnerClassEntry], HashMap[Name, InnerClassEntry])

def splitAt (n: Int): (HashMap[Name, InnerClassEntry], HashMap[Name, InnerClassEntry])

def stringPrefix : String

def sum [B >: (Name, InnerClassEntry)] (implicit num: Numeric[B]): B

def synchronized [T0] (arg0: ⇒ T0): T0

var table : Array[HashEntry[Name, DefaultEntry[Name, InnerClassEntry]]]

var tableSize : Int

def tail : HashMap[Name, InnerClassEntry]

def tails : Iterator[HashMap[Name, InnerClassEntry]]

def take (n: Int): HashMap[Name, InnerClassEntry]

def takeRight (n: Int): HashMap[Name, InnerClassEntry]

def takeWhile (p: ((Name, InnerClassEntry)) ⇒ Boolean): HashMap[Name, InnerClassEntry]

def thisCollection : Iterable[(Name, InnerClassEntry)]

var threshold : Int

def toArray [B >: (Name, InnerClassEntry)] (implicit arg0: ClassManifest[B]): Array[B]

def toBuffer [C >: (Name, InnerClassEntry)] : Buffer[C]

def toCollection (repr: HashMap[Name, InnerClassEntry]): Iterable[(Name, InnerClassEntry)]

def toIndexedSeq [B >: (Name, InnerClassEntry)] : IndexedSeq[B]

def toIterable : Iterable[(Name, InnerClassEntry)]

def toIterator : Iterator[(Name, InnerClassEntry)]

def toList : List[(Name, InnerClassEntry)]

def toMap [T, U] (implicit ev: <:<[(Name, InnerClassEntry), (T, U)]): Map[T, U]

def toSeq : Seq[(Name, InnerClassEntry)]

def toSet [B >: (Name, InnerClassEntry)] : Set[B]

def toStream : Stream[(Name, InnerClassEntry)]

def toString (): String

def toTraversable : Traversable[(Name, InnerClassEntry)]

def topLevelClass (name: Name): Symbol

Return the Symbol of the top level class enclosing 'name', or 'name's symbol if no entry found for 'name'.

def transform (f: (Name, InnerClassEntry) ⇒ InnerClassEntry): scala.tools.nsc.symtab.classfile.ClassfileParser.innerClasses.type

def transpose [B] (implicit asTraversable: ((Name, InnerClassEntry)) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

def unzip [A1, A2] (implicit asPair: ((Name, InnerClassEntry)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3 [A1, A2, A3] (implicit asTriple: ((Name, InnerClassEntry)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def update (key: Name, value: InnerClassEntry): Unit

def updated [B1 >: InnerClassEntry] (key: Name, value: B1): Map[Name, B1]

def useSizeMap (t: Boolean): Unit

def values : Iterable[InnerClassEntry]

def valuesIterator : Iterator[InnerClassEntry]

def view (from: Int, until: Int): IterableView[(Name, InnerClassEntry), HashMap[Name, InnerClassEntry]]

def view : IterableView[(Name, InnerClassEntry), HashMap[Name, InnerClassEntry]]

def wait (): Unit

def wait (arg0: Long, arg1: Int): Unit

def wait (arg0: Long): Unit

def withDefault (d: (Name) ⇒ InnerClassEntry): Map[Name, InnerClassEntry]

def withDefaultValue (d: InnerClassEntry): Map[Name, InnerClassEntry]

def withFilter (p: ((Name, InnerClassEntry)) ⇒ Boolean): FilterMonadic[(Name, InnerClassEntry), HashMap[Name, InnerClassEntry]]

def zip [A1 >: (Name, InnerClassEntry), B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], (A1, B), That]): That

def zip [A1 >: (Name, InnerClassEntry), B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], (A1, B), That]): That

def zipAll [B, A1 >: (Name, InnerClassEntry), That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], (A1, B), That]): That

def zipAll [B, A1 >: (Name, InnerClassEntry), That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], (A1, B), That]): That

def zipWithIndex [A1 >: (Name, InnerClassEntry), That] (implicit bf: CanBuildFrom[HashMap[Name, InnerClassEntry], (A1, Int), That]): That

def elements : Iterator[(Name, InnerClassEntry)]

def entries : Iterator[DefaultEntry[Name, InnerClassEntry]]

def first : (Name, InnerClassEntry)

def firstOption : Option[(Name, InnerClassEntry)]

def mapElements [C] (f: (InnerClassEntry) ⇒ C): Map[Name, C]

def projection : IterableView[(Name, InnerClassEntry), HashMap[Name, InnerClassEntry]]

def removeKey (key: Name): Option[InnerClassEntry]