Struct WHashtable

pub struct WHashtable {
    pub keys: WArray,
    pub vals: WArray,
}

A WeeChat Hashtable.

Why is this not just a HashMap?

While we do provide a function to create a true HashMap from this object, we do not use one by default because the spec is under-specified as to how valid such a transformation is. Namely, the spec does not detail whether it is valid for a hashtable to contain multiple instances of the same key, or whether ordering is/can be significant. While the answer is almost certainly “keys cannot be duplicated and ordering is not significant”, as is the case in Rust’s HashMap (so you probably almost always want to convert this immediately), it’s possible that custom extensions could violate these assumptions without violating the spec, so we opt to defer to the safer interpretation.

Fields

keys: WArray

vals: WArray

Trait Implementations

impl Clone for WHashtable

fn clone(&self) -> WHashtable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WHashtable

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

Formats the value using the given formatter.

impl Hash for WHashtable

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl MessageType for WHashtable

fn to_object(self) -> Object

fn to_object_ref(&self) -> ObjectRef<'_>

fn to_warray(vec: Vec<Self>) -> WArray

impl PartialEq for WHashtable

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for WHashtable

impl StructuralPartialEq for WHashtable