class
CaseInsensitiveStringMap extends Map[String, String]
Instance Constructors
-
new
CaseInsensitiveStringMap(originalMap: Map[String, String])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
asCaseSensitiveMap(): Map[String, String]
-
final
def
asInstanceOf[T0]: T0
-
def
clear(): Unit
-
def
clone(): AnyRef
-
def
compute(arg0: String, arg1: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
def
computeIfAbsent(arg0: String, arg1: Function[_ >: String, _ <: String]): String
-
def
computeIfPresent(arg0: String, arg1: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
def
containsKey(key: Any): Boolean
-
def
containsValue(value: Any): Boolean
-
def
entrySet(): Set[Entry[String, String]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(o: Any): Boolean
-
def
finalize(): Unit
-
def
forEach(arg0: BiConsumer[_ >: String, _ >: String]): Unit
-
def
get(key: Any): String
-
def
getBoolean(key: String, defaultValue: Boolean): Boolean
-
final
def
getClass(): Class[_]
-
def
getDouble(key: String, defaultValue: Double): Double
-
def
getInt(key: String, defaultValue: Int): Int
-
def
getLong(key: String, defaultValue: Long): Long
-
def
getOrDefault(arg0: Any, arg1: String): String
-
def
hashCode(): Int
-
def
isEmpty(): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
keySet(): Set[String]
-
def
merge(arg0: String, arg1: String, arg2: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
put(key: String, value: String): String
-
def
putAll(m: Map[_ <: String, _ <: String]): Unit
-
def
putIfAbsent(arg0: String, arg1: String): String
-
def
remove(key: Any): String
-
def
remove(arg0: Any, arg1: Any): Boolean
-
def
replace(arg0: String, arg1: String): String
-
def
replace(arg0: String, arg1: String, arg2: String): Boolean
-
def
replaceAll(arg0: BiFunction[_ >: String, _ >: String, _ <: String]): Unit
-
def
size(): Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
values(): Collection[String]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Map[String, String]
Value Members
-
def
compute(arg0: String, arg1: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
def
computeIfAbsent(arg0: String, arg1: Function[_ >: String, _ <: String]): String
-
def
computeIfPresent(arg0: String, arg1: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
def
forEach(arg0: BiConsumer[_ >: String, _ >: String]): Unit
-
def
getOrDefault(arg0: Any, arg1: String): String
-
def
merge(arg0: String, arg1: String, arg2: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
def
putIfAbsent(arg0: String, arg1: String): String
-
def
remove(arg0: Any, arg1: Any): Boolean
-
def
replace(arg0: String, arg1: String): String
-
def
replace(arg0: String, arg1: String, arg2: String): Boolean
-
def
replaceAll(arg0: BiFunction[_ >: String, _ >: String, _ <: String]): Unit
Inherited from AnyRef
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Any
Value Members
-
final
def
asInstanceOf[T0]: T0
-
final
def
isInstanceOf[T0]: Boolean
Ungrouped
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
asCaseSensitiveMap(): Map[String, String]
-
final
def
asInstanceOf[T0]: T0
-
def
clear(): Unit
-
def
clone(): AnyRef
-
def
compute(arg0: String, arg1: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
def
computeIfAbsent(arg0: String, arg1: Function[_ >: String, _ <: String]): String
-
def
computeIfPresent(arg0: String, arg1: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
def
containsKey(key: Any): Boolean
-
def
containsValue(value: Any): Boolean
-
def
entrySet(): Set[Entry[String, String]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(o: Any): Boolean
-
def
finalize(): Unit
-
def
forEach(arg0: BiConsumer[_ >: String, _ >: String]): Unit
-
def
get(key: Any): String
-
def
getBoolean(key: String, defaultValue: Boolean): Boolean
-
final
def
getClass(): Class[_]
-
def
getDouble(key: String, defaultValue: Double): Double
-
def
getInt(key: String, defaultValue: Int): Int
-
def
getLong(key: String, defaultValue: Long): Long
-
def
getOrDefault(arg0: Any, arg1: String): String
-
def
hashCode(): Int
-
def
isEmpty(): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
keySet(): Set[String]
-
def
merge(arg0: String, arg1: String, arg2: BiFunction[_ >: String, _ >: String, _ <: String]): String
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
put(key: String, value: String): String
-
def
putAll(m: Map[_ <: String, _ <: String]): Unit
-
def
putIfAbsent(arg0: String, arg1: String): String
-
def
remove(key: Any): String
-
def
remove(arg0: Any, arg1: Any): Boolean
-
def
replace(arg0: String, arg1: String): String
-
def
replace(arg0: String, arg1: String, arg2: String): Boolean
-
def
replaceAll(arg0: BiFunction[_ >: String, _ >: String, _ <: String]): Unit
-
def
size(): Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
values(): Collection[String]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit