Struct scratchstack_wrapper_aws_c_common::aws_linked_hash_table

#[repr(C)]
pub struct aws_linked_hash_table {
    pub allocator: *mut aws_allocator,
    pub list: aws_linked_list,
    pub table: aws_hash_table,
    pub user_on_value_destroy: aws_hash_callback_destroy_fn,
    pub user_on_key_destroy: aws_hash_callback_destroy_fn,
}

Simple linked hash table. Preserves insertion order, and can be iterated in insertion order.

You can also change the order safely without altering the shape of the underlying hash table.

Fields

allocator: *mut aws_allocator

list: aws_linked_list

table: aws_hash_table

user_on_value_destroy: aws_hash_callback_destroy_fn

user_on_key_destroy: aws_hash_callback_destroy_fn

Trait Implementations

impl Clone for aws_linked_hash_table

fn clone(&self) -> aws_linked_hash_table

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for aws_linked_hash_table

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for aws_linked_hash_table

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq<aws_linked_hash_table> for aws_linked_hash_table

fn eq(&self, other: &aws_linked_hash_table) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for aws_linked_hash_table

impl Eq for aws_linked_hash_table

impl StructuralEq for aws_linked_hash_table

impl StructuralPartialEq for aws_linked_hash_table