HiraokaHyperTools.iTextSharp-LGPL
0.2.5
|
A Hashtable that uses ints as the keys. More...
Classes | |
class | IntHashtableEntry |
class | IntHashtableIterator |
Public Member Functions | |
IntHashtable (int initialCapacity, float loadFactor) | |
Constructs a new, empty hashtable with the specified initial. More... | |
IntHashtable (int initialCapacity) | |
Constructs a new, empty hashtable with the specified initial. More... | |
IntHashtable () | |
Constructs a new, empty hashtable. A default capacity and load factor. More... | |
bool | IsEmpty () |
Returns true if the hashtable contains no elements. More... | |
bool | Contains (int value) |
Returns true if the specified object is an element of the hashtable. More... | |
bool | ContainsKey (int key) |
Returns true if the collection contains an element for the key. More... | |
int | Remove (int key) |
Removes the element corresponding to the key. Does nothing if the. More... | |
void | Clear () |
Clears the hash table so that it has no more elements in it. More... | |
IntHashtable | Clone () |
int[] | ToOrderedKeys () |
int[] | GetKeys () |
IntHashtableIterator | GetEntryIterator () |
Protected Member Functions | |
void | Rehash () |
Rehashes the content of the table into a bigger table. More... | |
Properties | |
int | Size [get] |
Returns the number of elements contained in the hashtable. More... | |
int | this[int key] [get, set] |
Gets the object associated with the specified key in the. More... | |
A Hashtable that uses ints as the keys.
iTextSharp.text.pdf.IntHashtable.IntHashtable | ( | int | initialCapacity, |
float | loadFactor | ||
) |
Constructs a new, empty hashtable with the specified initial.
iTextSharp.text.pdf.IntHashtable.IntHashtable | ( | int | initialCapacity | ) |
Constructs a new, empty hashtable with the specified initial.
iTextSharp.text.pdf.IntHashtable.IntHashtable | ( | ) |
Constructs a new, empty hashtable. A default capacity and load factor.
void iTextSharp.text.pdf.IntHashtable.Clear | ( | ) |
Clears the hash table so that it has no more elements in it.
IntHashtable iTextSharp.text.pdf.IntHashtable.Clone | ( | ) |
bool iTextSharp.text.pdf.IntHashtable.Contains | ( | int | value | ) |
Returns true if the specified object is an element of the hashtable.
bool iTextSharp.text.pdf.IntHashtable.ContainsKey | ( | int | key | ) |
Returns true if the collection contains an element for the key.
IntHashtableIterator iTextSharp.text.pdf.IntHashtable.GetEntryIterator | ( | ) |
int [] iTextSharp.text.pdf.IntHashtable.GetKeys | ( | ) |
bool iTextSharp.text.pdf.IntHashtable.IsEmpty | ( | ) |
Returns true if the hashtable contains no elements.
|
protected |
Rehashes the content of the table into a bigger table.
int iTextSharp.text.pdf.IntHashtable.Remove | ( | int | key | ) |
Removes the element corresponding to the key. Does nothing if the.
int [] iTextSharp.text.pdf.IntHashtable.ToOrderedKeys | ( | ) |
|
get |
Returns the number of elements contained in the hashtable.
|
getset |
Gets the object associated with the specified key in the.