4

V d v HashTable trong gi Java.Util

I/tm tt l thuyt
Gi Java.util cung cp mt s lp tin ch Java, thng xuyn trong tt c cc loi chng trnh ng
dng. N bao gm mt s lp sau:
Hashtable
Random
Vector
StringTokenizer
HashMap
HashSet
..
...
Lp Hashtable (bng bm)
Lp Hashtable m rng lp tru tng Dictionary, lp ny cng c nh ngha trong gi java.util.
Hashtable c s dng nh x kho (key) n gi tr (value). V d, n c th c s dng nh
x cc tn n tui, nhng ngi lp trnh n nhng d n, chc danh cng vic n lng, v c nh
vy.
Hashtable m rng kch thc khi cc phn t c thm vo. Khi mt Hashtable mi, bn c th ch
nh dung lng ban u v yu t np (load factor). iu ny s lm cho hashtable tng kch thc
ln, bt c lc no vic thm vo mt phn t mi lm vt qua gii hn hin hnh ca Hashtable.
Gii hn ca Hashtable l dung lng nhn ln bi cc yu t c np.V d: mt bng bm vi dung
lng 100, v mt yu t np l 0.75 s c mt gii hn l 75 phn t.
Cc phng thc xy dng cho bm bm gm:
Hashtable(int)
(Xy dng mt bng mi vi dung lng ban u c ch nh.)
Hashtable(int, float)
(Xy dng mt lp mi vi dung lng ban u c ch nh v yu t np.)
Hashtable()
(Xy dng mt lp mi bng cch s dng gi tr mc nh cho dung lng ban u v yu t np.)
Hashtable hash1 = new Hashtable(500,0.80);
Trong trng hp ny, Bng bm hash1 s lu tr 500 phn t. Khi bng bm lu tr va y 80%
(mt yu t np vo ca 0.80), kch thc ti a ca n s c tng ln.
Mi phn t trong mt hashtable bao gm mt kho v mt gi tr. Cc phn t c thm vo bng
bm bng cch s dng phng thc put(), v c truy lc bng cch s dng phng thc get(). Cc
phn t c th c xo t mt bng bm vi phng thc remove(). Cc phng thc contains() v
containsKey() c th c s dng tra cu mt gi tr hoc mt kho trong bng bm.
Mt vi phng thc ca Hashtable:
clear() (Xo tt c cc phn t t bng bm.)
clone() (To mt bn sao ca Hashtable.)
contains(Object)(Tr v True nu bng bm cha cc i tng c ch nh.)
containsKey(Object)(Tr v True nu bng bm cha kho c ch nh.)
elements() (Tr v mt tp hp phn t ca bng bm.)
get(Object key)(Tr v i tng c kho c ch nh.)
II./ code

Import java.util.Hashtable;
public class myClass
{
public statics void main(String[] args)
{
// to 1 i tng Hashtable
Hashtable ht = new Hashtable();
// thm vo 2 gi tr Key v Value ti Hashtable
ht.put("1","one");
ht.put.("2","two");
ht.put.("3","three");
// removed all the Hashtable
/*ht.clear();
System.out.println("Total key value pairs in Hashtable are : " + ht.size());
*/
/*
/*
removed key value trong Hashtable s dng phng thc
Object remove(Object key) of Hashtable class.
*/
Object obj = ht.remove("2");
System.out.println(obj + " Removed from Hashtable");
Enumeration e = ht.elements();
while(e.hasMoreElements())
System.out.println(e.nextElement());
*/
// kim tra xem gi tr ca 1 Key c tn ti trong Hashtable khng
// s dng phng thc boolean containsKey(Object key) ca lp hashtable
// n s tr v true nu Hashtable cha key v ngc li
boolean blnExists = ht.containsKey("2");
System.out.println("2 c tn ti trong hashtable ?:"+blnExists);
/* 2 c tn ti trong Hashtable ? :true
}
}