Uses of Class java.util.AbstractMap (Java Platform SE 6) - JDK 5 Documentation v6.0, Java 2 SDK 英文文档

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

Java™ Platform
Standard Ed. 6

PREV NEXT

FRAMES NO FRAMES

Uses of Class
java.util.AbstractMap

Packages that use AbstractMap
java.util	Contains the collections framework, legacy collection classes, event model, date and time facilities, internationalization, and miscellaneous utility classes (a string tokenizer, a random-number generator, and a bit array).
java.util.concurrent	Utility classes commonly useful in concurrent programming.
javax.print.attribute.standard	Package javax.print.attribute.standard contains classes for specific printing attributes.

Uses of AbstractMap in java.util

Subclasses of AbstractMap in java.util

class EnumMap<K extends Enum<K>,V>
          A specialized Map implementation for use with enum type keys.

class HashMap<K,V>
          Hash table based implementation of the Map interface.

class IdentityHashMap<K,V>
          This class implements the Map interface with a hash table, using reference-equality in place of object-equality when comparing keys (and values).

class LinkedHashMap<K,V>
          Hash table and linked list implementation of the Map interface, with predictable iteration order.

class TreeMap<K,V>
          A Red-Black tree based NavigableMap implementation.

class WeakHashMap<K,V>
          A hashtable-based Map implementation with weak keys.

Subclasses of AbstractMap in java.util
`class`	`EnumMap<K extends Enum<K>,V>` A specialized `Map` implementation for use with enum type keys.
`class`	`HashMap<K,V>` Hash table based implementation of the `Map` interface.
`class`	`IdentityHashMap<K,V>` This class implements the `Map` interface with a hash table, using reference-equality in place of object-equality when comparing keys (and values).
`class`	`LinkedHashMap<K,V>` Hash table and linked list implementation of the `Map` interface, with predictable iteration order.
`class`	`TreeMap<K,V>` A Red-Black tree based `NavigableMap` implementation.
`class`	`WeakHashMap<K,V>` A hashtable-based `Map` implementation with weak keys.

Uses of AbstractMap in java.util.concurrent

Subclasses of AbstractMap in java.util.concurrent

class ConcurrentHashMap<K,V>
A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updates.

class ConcurrentSkipListMap<K,V>
A scalable concurrent ConcurrentNavigableMap implementation.

Subclasses of AbstractMap in java.util.concurrent
`class`	`ConcurrentHashMap<K,V>` A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updates.
`class`	`ConcurrentSkipListMap<K,V>` A scalable concurrent `ConcurrentNavigableMap` implementation.

Uses of AbstractMap in javax.print.attribute.standard

Subclasses of AbstractMap in javax.print.attribute.standard

class PrinterStateReasons
Class PrinterStateReasons is a printing attribute class, a set of enumeration values, that provides additional information about the printer's current state, i.e., information that augments the value of the printer's PrinterState attribute.

Subclasses of AbstractMap in javax.print.attribute.standard
`class`	`PrinterStateReasons` Class PrinterStateReasons is a printing attribute class, a set of enumeration values, that provides additional information about the printer's current state, i.e., information that augments the value of the printer's `PrinterState` attribute.