Module http::header::map

Re-exports

• pub use self::as_header_name::AsHeaderName;
• pub use self::into_header_name::IntoHeaderName;

Modules

• as_header_name 🔒
• into_header_name 🔒

Macros

• insert_phase_one 🔒
• probe_loop 🔒

Structs

• Bucket 🔒
  Stores the data associated with a HeaderMap entry. Only the first value is included in this struct. If a header name has more than one associated value, all extra values are stored in the extra_values vector. A doubly linked list of entries is maintained. The doubly linked list is used so that removing a value is constant time. This also has the nice property of enabling double ended iteration.
• Drain
  A drain iterator for HeaderMap.
• ExtraValue 🔒
  Node in doubly-linked list of header value entries
• GetAll
  A view to all values stored in a single entry.
• HashValue 🔒
  Hash values are limited to u16 as well. While fast_hash and Hasher return usize hash codes, limiting the effective hash code to the lower 16 bits is fine since we know that the indices vector will never grow beyond that size.
• HeaderMap
  A set of HTTP headers
• IntoIter
  An owning iterator over the entries of a HeaderMap.
• Iter
  HeaderMap entry iterator.
• IterMut
  HeaderMap mutable entry iterator
• Keys
  An iterator over HeaderMap keys.
• Links 🔒
  The head and tail of the value linked list.
• MaxSizeReached
  Error returned when max capacity of HeaderMap is exceeded
• OccupiedEntry
  A view into a single occupied location in a HeaderMap.
• Pos 🔒
  An entry in the hash table. This represents the full hash code for an entry as well as the position of the entry in the entries vector.
• RawLinks 🔒
  Access to the links value in a slice of buckets.
• VacantEntry
  A view into a single empty location in a HeaderMap.
• ValueDrain
  An drain iterator of all values associated with a single header name.
• ValueIter
  An iterator of all values associated with a single header name.
• ValueIterMut
  A mutable iterator of all values associated with a single header name.
• Values
  HeaderMap value iterator.
• ValuesMut
  HeaderMap mutable value iterator

Enums

• Cursor 🔒
  Tracks the value iterator state
• Danger 🔒
  Tracks the header map danger level! This relates to the adaptive hashing algorithm. A HeaderMap starts in the “green” state, when a large number of collisions are detected, it transitions to the yellow state. At this point, the header map will either grow and switch back to the green state OR it will transition to the red state.
• Entry
  A view into a single location in a HeaderMap, which may be vacant or occupied.
• Link 🔒
  A header value node is either linked to another node in the extra_values list or it points to an entry in entries. The entry in entries is the start of the list and holds the associated header name.

Constants

• DISPLACEMENT_THRESHOLD 🔒
• FORWARD_SHIFT_THRESHOLD 🔒
• LOAD_FACTOR_THRESHOLD 🔒
• MAX_SIZE 🔒
  This limit falls out from above.

Functions

• append_value 🔒
• desired_pos 🔒
• do_insert_phase_two 🔒
  phase 2 is post-insert where we forward-shift Pos in the indices.
• drain_all_extra_values 🔒
• hash_elem_using 🔒
• probe_distance 🔒
  The number of steps that current is forward of the desired position for hash
• remove_extra_value 🔒
  Removes the ExtraValue at the given index.
• to_raw_capacity 🔒
• usable_capacity 🔒

Type Aliases

• Size 🔒
  Type used for representing the size of a HeaderMap value.