Deprecated in favor of .byKeyValue - enables foreach iteration over a DictionaryList with two loop variables.
Adds a new field to the map.
Iterates over all fields, including duplicates.
Iterates over all fields, including duplicates.
Returns the first field that matches the given key.
Returns all values matching the given key.
Returns a pointer to the first field that matches the given key.
Returns the first value matching the given key.
Adds or replaces the given field with a new value.
Removes the first field that matches the given key.
Removes all fields that matches the given key.
Supports serialization using vibe.data.serialization.
Generates an associative-array equivalent string representation of the dictionary.
Duplicates the header map.
The number of fields present in the map.
Supports serialization using vibe.data.serialization.
Behaves similar to VALUE[string] but the insertion order is not changed and multiple values per key are supported.
This kind of map is used for MIME headers (e.g. for HTTP, see vibe.inet.message.InetHeaderMap), or for form data (vibe.inet.webform.FormFields). Note that the map can contain fields with the same key multiple times if addField is used for insertion. Insertion order is preserved.
Note that despite case not being relevant for matching keyse, iterating over the map will yield the original case of the key that was put in.
Insertion and lookup has O(n) complexity.