Hashtable

The number of items (strings/integers) contained in the hash table.

Indicate whether the last method call succeeded or failed. A value of true indicates success, a value of false indicates failure. This property is automatically set for method calls. It is not modified by property accesses. The property is automatically set to indicate success for the following types of method calls:

• Any method that returns a string.
• Any method returning a Chilkat object, binary bytes, or a date/time.
• Any method returning a standard boolean status value where success = true and failure = false.
• Any method returning an integer where failure is defined by a return value less than zero.

Note: Methods that do not fit the above requirements will always set this property equal to true. For example, a method that returns no value (such as a "void" in C++) will technically always succeed.

Adds to the hash table from XML previously created by calling ToXmlSb.

Returns true for success, false for failure.

Adds or replaces an entry with the given key and integer value to the hash table. Returns true if a new hash entry was added or replaced. Returns false if an out-of-memory condition occurred.

Returns true for success, false for failure.

Adds URL query parameters into the hashtable. The queryParams has the form: "field1=value1&field2=value2&field3=value3...". It is assumed that the values are URL encoded, and this method automatically URL decodes the values prior to inserting into the hashtable.

Returns true for success, false for failure.

Adds or replaces an entry with the given key and string value to the hash table. Returns true if a new hash entry was added or replaced. Returns false if an out-of-memory condition occurred.

Returns true for success, false for failure.

Removes all elements from the Hashtable.

Removes all elements from the Hashtable and re-sizes with the specified capacity.

The capacity is the number of buckets in the hash table. In the case of a "hash collision", a single bucket stores multiple entries, which must be searched sequentially. One rule of thumb is to set the capacity to twice the number of expected items to be hashed. It's also preferable to set the capacity to a prime number. (The 1st 10,000 prime numbers are listed here: https://primes.utm.edu/lists/small/10000.txt )

The initial default capacity of the hash table is 521.

Returns true for success, false for failure.

Determines if a given key is contained within the hash table. Returns true if the key exists, otherwise returns false.

Determines if a given key is contained within the hash table. Returns true if the key exists, otherwise returns false.

Appends the complete set of hashtable key strings to strTable.

Returns true for success, false for failure.

Returns the integer value associated with the specified key. If the key is not in the hash table, the return value is 0.

Returns the string value associated with the specified key.

Returns null on failure

Removes the entry with the specified key from the hash table. Returns true if the key existed and was removed. Returns false if the key did not already exist.

Serializes the hash table to a query string such as key1=value1&key2=value2&key3=value3 where each value is URL encoded.

Returns null on failure

Serializes the hash table to XML format. The XML is appended to sbXml.

Returns true for success, false for failure.