class CharArrayMap[V] extends AbstractMap[AnyRef, V]
A simple class that stores key Strings as char[]'s in a hash table. Note that this is not a general purpose class. For example, it cannot remove items from the map, nor does it resize its hash table to be smaller, etc. It is designed to be quick to retrieve items by char[] keys without the necessity of converting to a String first.
- Alphabetic
- By Inheritance
- CharArrayMap
- AbstractMap
- Map
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
CharArrayMap(c: Map[_, _ <: V], ignoreCase: Boolean)
Creates a map from the mappings in another map.
Creates a map from the mappings in another map.
- c
a map whose mappings to be copied
- ignoreCase
false
if and only if the set should be case sensitive otherwisetrue
.
Type Members
-
class
EntryIterator
extends Iterator[Entry[AnyRef, V]]
public iterator class so efficient methods are exposed to users
-
final
class
EntrySet
extends AbstractSet[Entry[AnyRef, V]]
public EntrySet class so efficient methods are exposed to users
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clear(): Unit
Clears all entries in this map.
Clears all entries in this map. This method is supported for reusing, but not
Map#remove
.- Definition Classes
- CharArrayMap → AbstractMap → Map
-
def
clone(): AnyRef
- Attributes
- protected[java.util]
- Definition Classes
- AbstractMap → AnyRef
- Annotations
- @throws( ... )
-
def
compute(arg0: AnyRef, arg1: BiFunction[_ >: AnyRef, _ >: V, _ <: V]): V
- Definition Classes
- Map
-
def
computeIfAbsent(arg0: AnyRef, arg1: Function[_ >: AnyRef, _ <: V]): V
- Definition Classes
- Map
-
def
computeIfPresent(arg0: AnyRef, arg1: BiFunction[_ >: AnyRef, _ >: V, _ <: V]): V
- Definition Classes
- Map
-
def
containsKey(o: Any): Boolean
- Definition Classes
- CharArrayMap → AbstractMap → Map
-
def
containsKey(cs: CharSequence): Boolean
true if the
CharSequence
is in the#keySet()
true if the
CharSequence
is in the#keySet()
-
def
containsKey(text: Array[Char], off: Int, len: Int): Boolean
true if the
len
chars oftext
starting atoff
are in the#keySet()
true if the
len
chars oftext
starting atoff
are in the#keySet()
-
def
containsValue(arg0: Any): Boolean
- Definition Classes
- AbstractMap → Map
-
final
def
entrySet(): EntrySet
- Definition Classes
- CharArrayMap → AbstractMap → Map
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AbstractMap → Map → AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
forEach(arg0: BiConsumer[_ >: AnyRef, _ >: V]): Unit
- Definition Classes
- Map
-
def
get(o: Any): V
- Definition Classes
- CharArrayMap → AbstractMap → Map
-
def
get(cs: CharSequence): V
returns the value of the mapping of the chars inside this
CharSequence
returns the value of the mapping of the chars inside this
CharSequence
-
def
get(text: Array[Char], off: Int, len: Int): V
returns the value of the mapping of
len
chars oftext
starting atoff
returns the value of the mapping of
len
chars oftext
starting atoff
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
getOrDefault(arg0: Any, arg1: V): V
- Definition Classes
- Map
-
def
hashCode(): Int
- Definition Classes
- AbstractMap → Map → AnyRef → Any
-
def
isEmpty(): Boolean
- Definition Classes
- AbstractMap → Map
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
keySet(): CharArraySet
Returns an
CharArraySet
view on the map's keys.Returns an
CharArraySet
view on the map's keys. The set will use the samematchVersion
as this map.- Definition Classes
- CharArrayMap → AbstractMap → Map
-
def
merge(arg0: AnyRef, arg1: V, arg2: BiFunction[_ >: V, _ >: V, _ <: V]): V
- Definition Classes
- Map
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
put(text: Array[Char], value: V): V
Add the given mapping.
Add the given mapping. If ignoreCase is true for this Set, the text array will be directly modified. The user should never modify this text array after calling this method.
-
def
put(text: String, value: V): V
Add the given mapping.
-
def
put(o: Any, value: V): V
- Definition Classes
- CharArrayMap → AbstractMap → Map
-
def
put(text: CharSequence, value: V): V
Add the given mapping.
-
def
putAll(arg0: Map[_ <: AnyRef, _ <: V]): Unit
- Definition Classes
- AbstractMap → Map
-
def
putIfAbsent(arg0: AnyRef, arg1: V): V
- Definition Classes
- Map
-
def
remove(o: Any): V
- Definition Classes
- CharArrayMap → AbstractMap → Map
-
def
remove(arg0: Any, arg1: Any): Boolean
- Definition Classes
- Map
-
def
replace(arg0: AnyRef, arg1: V): V
- Definition Classes
- Map
-
def
replace(arg0: AnyRef, arg1: V, arg2: V): Boolean
- Definition Classes
- Map
-
def
replaceAll(arg0: BiFunction[_ >: AnyRef, _ >: V, _ <: V]): Unit
- Definition Classes
- Map
-
def
size(): Int
- Definition Classes
- CharArrayMap → AbstractMap → Map
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- CharArrayMap → AbstractMap → AnyRef → Any
-
def
values(): Collection[V]
- Definition Classes
- AbstractMap → Map
-
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( ... )