HASHTABLE IN JAVA || JAVA TUTORIALS FOR BEGINNERS смотреть онлайн

NETHOD LOCAL INNER CLASS :
https://youtu.be/Y4KMLJv8EL8

Java thread:
https://youtu.be/ZpKOZfjyZg4

The Map Interface :- A Map is an object that maps keys
to
values. A map cannot contain duplicate keys: Each
key canmap to at most one value. It models the
mathematical function abstraction.
The Java platform contains three
general-purpose Map implementations:
1. HashMap
2. TreeMap
3. LinkedHashMap .

Few characteristics of the Map Interface are:

●A Map cannot contain duplicate keys and
each key can map to at most one value. Some
implementations allow null key and null value like
the HashMap and LinkedHashMap, but some do not
like the TreeMap.

●The order of a map depends on specific imple‐
mentations, e.g TreeMap and LinkedHashMap have
predictable order, while HashMap does not.

●There are two interfaces for implementing
Map in java: Map and SortedMap, and three
classes: HashMap, TreeMap and LinkedHashMap.

Hashtable in Java :-

This class implements a hash table, which maps keys
to values. Any non-null object can be used as a key or
as a value.

To successfully store and retrieve objects from a
hashtable, the objects used as keys must implement
the hashCode method and the equals method.

It is similar to HashMap, but is synchronised.
Hashtable stores key/value pair in hash table.
In Hashtable we specify an object that is used as a
key, and the value we want to associate to that key.

The key is then hashed, and the resulting hash code is
used as the index at which the value is stored within
the table.

#Freaky Squirrel