class ResponseMap extends HashMap[SourceFile, Set[Response[Tree]]]
Ordering
- Alphabetic
- By Inheritance
Inherited
- ResponseMap
- HashMap
- Serializable
- Serializable
- CustomParallelizable
- HashTable
- HashUtils
- AbstractMap
- Map
- MapLike
- Cloneable
- Cloneable
- Cloneable
- Shrinkable
- Builder
- Growable
- Clearable
- Iterable
- Traversable
- Mutable
- AbstractMap
- Map
- MapLike
- Subtractable
- PartialFunction
- Function1
- GenMap
- GenMapLike
- AbstractIterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- AbstractTraversable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
Implicitly
- by MonadOps
- by CollectionsHaveToParArray
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new ResponseMap()
Type Members
-
class
DefaultKeySet extends AbstractSet[K] with Set[K] with Serializable
- Attributes
- protected
- Definition Classes
- MapLike
-
class
DefaultValuesIterable extends AbstractIterable[V] with collection.Iterable[V] with Serializable
- Attributes
- protected
- Definition Classes
- MapLike
-
type
Entry = DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap
-
class
FilteredKeys extends AbstractMap[K, V] with DefaultMap[K, V]
- Attributes
- protected
- Definition Classes
- MapLike
-
class
MappedValues[W] extends AbstractMap[K, W] with DefaultMap[K, W]
- Attributes
- protected
- Definition Classes
- MapLike
-
type
Self = HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+[V1 >: Set[Global.Response[Global.Tree]]](elem1: (SourceFile, V1), elem2: (SourceFile, V1), elems: (SourceFile, V1)*): Map[SourceFile, V1]
- Definition Classes
- MapLike → MapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
+creates a new map. Use+=to add an element to this map and return that map itself.
-
def
+[V1 >: Set[Global.Response[Global.Tree]]](kv: (SourceFile, V1)): Map[SourceFile, V1]
- Definition Classes
- MapLike → MapLike → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
+creates a new map. Use+=to add an element to this map and return that map itself.
-
def
++[V1 >: Set[Global.Response[Global.Tree]]](xs: GenTraversableOnce[(SourceFile, V1)]): Map[SourceFile, V1]
- Definition Classes
- MapLike → MapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
++creates a new map. Use++=to add an element to this map and return that map itself.
-
def
++[B >: (SourceFile, Set[Global.Response[Global.Tree]]), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: (SourceFile, Set[Global.Response[Global.Tree]]), That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: (SourceFile, Set[Global.Response[Global.Tree]]), That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: collection.TraversableOnce[(SourceFile, Set[Global.Response[Global.Tree]])]): ResponseMap.this.type
- Definition Classes
- Growable
-
def
+=(binding: (SourceFile, Set[Global.Response[Global.Tree]])): ResponseMap.this.type
- Definition Classes
- ResponseMap → HashMap → MapLike → Builder → Growable
-
def
+=(elem1: (SourceFile, Set[Global.Response[Global.Tree]]), elem2: (SourceFile, Set[Global.Response[Global.Tree]]), elems: (SourceFile, Set[Global.Response[Global.Tree]])*): ResponseMap.this.type
- Definition Classes
- Growable
-
def
-(elem1: SourceFile, elem2: SourceFile, elems: SourceFile*): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- MapLike → Subtractable
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
-creates a new map. Use-=to remove an element from this map and return that map itself.
-
def
-(key: SourceFile): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- MapLike → MapLike → Subtractable → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
-creates a new map. Use-=to remove an element from this map and return that map itself.
-
def
--(xs: GenTraversableOnce[SourceFile]): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- MapLike → Subtractable
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
--creates a new map. Use--=to remove an element from this map and return that map itself.
-
def
--=(xs: collection.TraversableOnce[SourceFile]): ResponseMap.this.type
- Definition Classes
- Shrinkable
-
def
-=(key: SourceFile): ResponseMap.this.type
- Definition Classes
- HashMap → MapLike → Shrinkable
-
def
-=(elem1: SourceFile, elem2: SourceFile, elems: SourceFile*): ResponseMap.this.type
- Definition Classes
- Shrinkable
-
def
->[B](y: B): (ResponseMap, B)
- Implicit
- This member is added by an implicit conversion from ResponseMap to ArrowAssoc[ResponseMap] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/:[B](z: B)(op: (B, (SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: ((SourceFile, Set[Global.Response[Global.Tree]]), B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
val
_loadFactor: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
addEntry(e: DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- MapLike → TraversableOnce
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, (SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
alwaysInitSizeMap: Boolean
- Attributes
- protected
- Definition Classes
- HashTable
-
def
andThen[C](k: (Set[Global.Response[Global.Tree]]) ⇒ C): PartialFunction[SourceFile, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply(key: SourceFile): Set[Global.Response[Global.Tree]]
- Definition Classes
- HashMap → MapLike → Function1 → GenMapLike
-
def
applyOrElse[K1 <: SourceFile, V1 >: Set[Global.Response[Global.Tree]]](x: K1, default: (K1) ⇒ V1): V1
- Definition Classes
- MapLike → PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
calcSizeMapSize(tableLength: Int): Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clear(): Unit
- Definition Classes
- HashMap → MapLike → Builder → Growable → Clearable
-
def
clearTable(): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
clone(): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- MapLike → Cloneable → AnyRef
-
def
collect[B, That](pf: PartialFunction[(SourceFile, Set[Global.Response[Global.Tree]]), B])(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[(SourceFile, Set[Global.Response[Global.Tree]]), B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
companion: GenericCompanion[collection.mutable.Iterable]
- Definition Classes
- Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ SourceFile): (A) ⇒ Set[Global.Response[Global.Tree]]
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains(key: SourceFile): Boolean
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
copyToArray[B >: (SourceFile, Set[Global.Response[Global.Tree]])](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (SourceFile, Set[Global.Response[Global.Tree]])](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: (SourceFile, Set[Global.Response[Global.Tree]])](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: (SourceFile, Set[Global.Response[Global.Tree]])](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
count(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
createNewEntry[B1](key: SourceFile, value: B1): Entry
- Attributes
- protected
- Definition Classes
- HashMap → HashTable
-
def
default(key: SourceFile): Set[Global.Response[Global.Tree]]
- Definition Classes
- ResponseMap → MapLike → GenMapLike
-
def
drop(n: Int): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- IterableLike
-
def
dropWhile(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
elemEquals(key1: SourceFile, key2: SourceFile): Boolean
- Attributes
- protected
- Definition Classes
- HashTable
-
def
elemHashCode(key: SourceFile): Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
def
empty: HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap → Map → Map → MapLike
-
def
ensuring(cond: (ResponseMap) ⇒ Boolean, msg: ⇒ Any): ResponseMap
- Implicit
- This member is added by an implicit conversion from ResponseMap to Ensuring[ResponseMap] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (ResponseMap) ⇒ Boolean): ResponseMap
- Implicit
- This member is added by an implicit conversion from ResponseMap to Ensuring[ResponseMap] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): ResponseMap
- Implicit
- This member is added by an implicit conversion from ResponseMap to Ensuring[ResponseMap] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): ResponseMap
- Implicit
- This member is added by an implicit conversion from ResponseMap to Ensuring[ResponseMap] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
entriesIterator: collection.Iterator[DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]]
- Attributes
- protected
- Definition Classes
- HashTable
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenMapLike → Equals → AnyRef → Any
-
def
exists(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterKeys(p: (SourceFile) ⇒ Boolean): Map[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- MapLike → GenMapLike
-
def
filterNot(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- MapLike → TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): Option[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
findEntry(key: SourceFile): DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
findOrAddEntry[B](key: SourceFile, value: B): DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]
- Attributes
- protected
- Definition Classes
- HashTable
-
def
flatMap[B, That](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ GenTraversableOnce[B]): collection.mutable.Iterable[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: (SourceFile, Set[Global.Response[Global.Tree]])](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, (SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: ((SourceFile, Set[Global.Response[Global.Tree]]), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ U): Unit
- Definition Classes
- HashMap → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
foreachEntry[U](f: (DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]) ⇒ U): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from ResponseMap to StringFormat[ResponseMap] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
genericBuilder[B]: Builder[B, collection.mutable.Iterable[B]]
- Definition Classes
- GenericTraversableTemplate
-
def
get(key: SourceFile): Option[Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
getOrElse[V1 >: Set[Global.Response[Global.Tree]]](key: SourceFile, default: ⇒ V1): V1
- Definition Classes
- MapLike → GenMapLike
-
def
getOrElseUpdate(key: SourceFile, defaultValue: ⇒ Set[Global.Response[Global.Tree]]): Set[Global.Response[Global.Tree]]
- Definition Classes
- HashMap → MapLike
-
def
groupBy[K](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ K): Map[K, HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): collection.Iterator[HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- GenMapLike → AnyRef → Any
-
def
head: (SourceFile, Set[Global.Response[Global.Tree]])
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
final
def
improve(hcode: Int, seed: Int): Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
final
def
index(hcode: Int): Int
- Attributes
- protected
- Definition Classes
- HashTable
-
def
init: HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
initWithContents(c: Contents[SourceFile, DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]]): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
initialSize: Int
- Attributes
- protected
- Definition Classes
- HashTable
-
def
inits: collection.Iterator[HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- TraversableLike
-
def
isDefinedAt(key: SourceFile): Boolean
- Definition Classes
- MapLike → GenMapLike → PartialFunction
-
def
isEmpty: Boolean
- Definition Classes
- MapLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isSizeMapDefined: Boolean
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: collection.Iterator[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- HashMap → MapLike → IterableLike → GenIterableLike
-
def
keySet: Set[SourceFile]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
keys: collection.Iterable[SourceFile]
- Definition Classes
- MapLike → GenMapLike
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
keysreturnsIterable[K]rather thanIterator[K].
-
def
keysIterator: collection.Iterator[SourceFile]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
last: (SourceFile, Set[Global.Response[Global.Tree]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastOption: Option[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lift: (SourceFile) ⇒ Option[Set[Global.Response[Global.Tree]]]
- Definition Classes
- PartialFunction
-
def
map[B, That](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B)(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
mapResult[NewTo](f: (HashMap[SourceFile, Set[Global.Response[Global.Tree]]]) ⇒ NewTo): Builder[(SourceFile, Set[Global.Response[Global.Tree]]), NewTo]
- Definition Classes
- Builder
-
def
mapValues[W](f: (Set[Global.Response[Global.Tree]]) ⇒ W): Map[SourceFile, W]
- Definition Classes
- MapLike → GenMapLike
-
def
max[B >: (SourceFile, Set[Global.Response[Global.Tree]])](implicit cmp: Ordering[B]): (SourceFile, Set[Global.Response[Global.Tree]])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B)(implicit cmp: Ordering[B]): (SourceFile, Set[Global.Response[Global.Tree]])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: (SourceFile, Set[Global.Response[Global.Tree]])](implicit cmp: Ordering[B]): (SourceFile, Set[Global.Response[Global.Tree]])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B)(implicit cmp: Ordering[B]): (SourceFile, Set[Global.Response[Global.Tree]])
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[(SourceFile, Set[Global.Response[Global.Tree]]), HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Attributes
- protected[this]
- Definition Classes
- MapLike → MapLike → TraversableLike → HasNewBuilder
-
def
nnSizeMapAdd(h: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
nnSizeMapRemove(h: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
nnSizeMapReset(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
orElse[A1 <: SourceFile, B1 >: Set[Global.Response[Global.Tree]]](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
par: ParHashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap → CustomParallelizable → Parallelizable
-
def
parCombiner: Combiner[(SourceFile, Set[Global.Response[Global.Tree]]), ParHashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Attributes
- protected[this]
- Definition Classes
- CustomParallelizable → Parallelizable
-
def
partition(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): (HashMap[SourceFile, Set[Global.Response[Global.Tree]]], HashMap[SourceFile, Set[Global.Response[Global.Tree]]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
product[B >: (SourceFile, Set[Global.Response[Global.Tree]])](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
put(key: SourceFile, value: Set[Global.Response[Global.Tree]]): Option[Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap → MapLike
-
def
reduce[A1 >: (SourceFile, Set[Global.Response[Global.Tree]])](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: (SourceFile, Set[Global.Response[Global.Tree]])](op: (B, (SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: (SourceFile, Set[Global.Response[Global.Tree]])](op: (B, (SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: (SourceFile, Set[Global.Response[Global.Tree]])](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: (SourceFile, Set[Global.Response[Global.Tree]])](op: ((SourceFile, Set[Global.Response[Global.Tree]]), B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: (SourceFile, Set[Global.Response[Global.Tree]])](op: ((SourceFile, Set[Global.Response[Global.Tree]]), B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
remove(key: SourceFile): Option[Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap → MapLike
-
def
removeEntry(key: SourceFile): DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
repr: HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
result(): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- MapLike → Builder
-
def
retain(p: (SourceFile, Set[Global.Response[Global.Tree]]) ⇒ Boolean): ResponseMap.this.type
- Definition Classes
- MapLike
-
def
reversed: List[(SourceFile, Set[Global.Response[Global.Tree]])]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (Set[Global.Response[Global.Tree]]) ⇒ U): (SourceFile) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: (SourceFile, Set[Global.Response[Global.Tree]])](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: (SourceFile, Set[Global.Response[Global.Tree]]), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, (SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B)(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: ((SourceFile, Set[Global.Response[Global.Tree]]), B) ⇒ B)(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRighthas changed. The previous behavior can be reproduced with scanRight.reverse.
-
val
seedvalue: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
seq: Map[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- Map → Map → GenMap → GenMapLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- HashMap → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
- Definition Classes
- Builder
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHint(size: Int): Unit
- Definition Classes
- Builder
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
final
def
sizeMapBucketBitSize: Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
final
def
sizeMapBucketSize: Int
- Attributes
- protected
- Definition Classes
- HashUtils
-
def
sizeMapDisable(): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
sizeMapInit(tableLength: Int): Unit
- Attributes
- protected
- Definition Classes
- HashTable
-
def
sizeMapInitAndRebuild(): Unit
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
val
sizemap: Array[Int]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
slice(from: Int, until: Int): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): collection.Iterator[HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): collection.Iterator[HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- IterableLike
-
def
span(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): (HashMap[SourceFile, Set[Global.Response[Global.Tree]]], HashMap[SourceFile, Set[Global.Response[Global.Tree]]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (HashMap[SourceFile, Set[Global.Response[Global.Tree]]], HashMap[SourceFile, Set[Global.Response[Global.Tree]]])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
stringPrefix: String
- Definition Classes
- MapLike → TraversableLike → GenTraversableLike
-
def
sum[B >: (SourceFile, Set[Global.Response[Global.Tree]])](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
val
table: Array[HashEntry[SourceFile, DefaultEntry[SourceFile, Set[Global.Response[Global.Tree]]]]]
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
val
tableSize: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
tableSizeSeed: Int
- Attributes
- protected
- Definition Classes
- HashTable
-
def
tail: HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: collection.Iterator[HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- IterableLike
-
def
takeWhile(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): HashMap[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: collection.Iterable[(SourceFile, Set[Global.Response[Global.Tree]])]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
val
threshold: Int
- Attributes
- protected
- Definition Classes
- HashTable
- Annotations
- @transient()
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (SourceFile, Set[Global.Response[Global.Tree]]), Col[(SourceFile, Set[Global.Response[Global.Tree]])]]): Col[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: (SourceFile, Set[Global.Response[Global.Tree]])](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[E >: (SourceFile, Set[Global.Response[Global.Tree]])]: Buffer[E]
- Definition Classes
- MapLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: HashMap[SourceFile, Set[Global.Response[Global.Tree]]]): collection.Iterable[(SourceFile, Set[Global.Response[Global.Tree]])]
- Attributes
- protected[this]
- Definition Classes
- IterableLike → TraversableLike
-
def
toIndexedSeq: collection.immutable.IndexedSeq[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: collection.Iterable[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: collection.Iterator[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[(SourceFile, Set[Global.Response[Global.Tree]]), (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from ResponseMap to CollectionsHaveToParArray[ResponseMap, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (ResponseMap) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toSeq: collection.Seq[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- MapLike → MapLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: (SourceFile, Set[Global.Response[Global.Tree]])]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: collection.immutable.Stream[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- MapLike → TraversableLike → Function1 → AnyRef → Any
-
def
toTraversable: collection.Traversable[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[(SourceFile, Set[Global.Response[Global.Tree]])]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transform(f: (SourceFile, Set[Global.Response[Global.Tree]]) ⇒ Set[Global.Response[Global.Tree]]): ResponseMap.this.type
- Definition Classes
- MapLike
-
def
transpose[B](implicit asTraversable: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ GenTraversableOnce[B]): collection.mutable.Iterable[collection.mutable.Iterable[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transposethrows anIllegalArgumentExceptionif collections are not uniformly sized.
-
def
unzip[A1, A2](implicit asPair: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ (A1, A2)): (collection.mutable.Iterable[A1], collection.mutable.Iterable[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ (A1, A2, A3)): (collection.mutable.Iterable[A1], collection.mutable.Iterable[A2], collection.mutable.Iterable[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(key: SourceFile, value: Set[Global.Response[Global.Tree]]): Unit
- Definition Classes
- HashMap → MapLike
-
def
updated[V1 >: Set[Global.Response[Global.Tree]]](key: SourceFile, value: V1): Map[SourceFile, V1]
- Definition Classes
- MapLike → MapLike
-
def
useSizeMap(t: Boolean): Unit
- Definition Classes
- HashMap
-
def
values: collection.Iterable[Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
valuesIterator: collection.Iterator[Set[Global.Response[Global.Tree]]]
- Definition Classes
- HashMap → MapLike → GenMapLike
-
def
view(from: Int, until: Int): IterableView[(SourceFile, Set[Global.Response[Global.Tree]]), HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- IterableLike → TraversableLike
-
def
view: IterableView[(SourceFile, Set[Global.Response[Global.Tree]]), HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
withDefault(d: (SourceFile) ⇒ Set[Global.Response[Global.Tree]]): Map[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- Map
-
def
withDefaultValue(d: Set[Global.Response[Global.Tree]]): Map[SourceFile, Set[Global.Response[Global.Tree]]]
- Definition Classes
- Map
-
def
withFilter(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): FilterMonadic[(SourceFile, Set[Global.Response[Global.Tree]]), HashMap[SourceFile, Set[Global.Response[Global.Tree]]]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: (SourceFile, Set[Global.Response[Global.Tree]]), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: (SourceFile, Set[Global.Response[Global.Tree]]), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: (SourceFile, Set[Global.Response[Global.Tree]]), That](implicit bf: CanBuildFrom[HashMap[SourceFile, Set[Global.Response[Global.Tree]]], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
→[B](y: B): (ResponseMap, B)
- Implicit
- This member is added by an implicit conversion from ResponseMap to ArrowAssoc[ResponseMap] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from ResponseMap to any2stringadd[ResponseMap] performed by method any2stringadd in scala.Predef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(responseMap: any2stringadd[ResponseMap]).+(other)
- Definition Classes
- any2stringadd
-
def
filter(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): collection.TraversableOnce[(SourceFile, Set[Global.Response[Global.Tree]])]
- Implicit
- This member is added by an implicit conversion from ResponseMap to MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(responseMap: MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])]).filter(p)
- Definition Classes
- MonadOps
-
def
flatMap[B](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ GenTraversableOnce[B]): collection.TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from ResponseMap to MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(responseMap: MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])]).flatMap(f)
- Definition Classes
- MonadOps
-
def
map[B](f: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ B): collection.TraversableOnce[B]
- Implicit
- This member is added by an implicit conversion from ResponseMap to MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(responseMap: MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])]).map(f)
- Definition Classes
- MonadOps
-
def
withFilter(p: ((SourceFile, Set[Global.Response[Global.Tree]])) ⇒ Boolean): collection.Iterator[(SourceFile, Set[Global.Response[Global.Tree]])]
- Implicit
- This member is added by an implicit conversion from ResponseMap to MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])] performed by method MonadOps in scala.collection.TraversableOnce.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(responseMap: MonadOps[(SourceFile, Set[Global.Response[Global.Tree]])]).withFilter(p)
- Definition Classes
- MonadOps
The Scala compiler and reflection APIs.