fn hash<H>(&self, state: &mut H)
    where
        H: std::hash::Hasher,
    {
        state.finish();
    }
/*
     * Note: Span's shouldn't be used in a hash algorithm since they always
     *       result in an identical hash value.
     *       This is to enable 2 spanned's to be equal
     */
Span's shouldn't be used in a hash algorithm since they always
result in an identical hash value.
This is to enable 2 spanned's to be equal
Span ' s shouldn ' t be used in a hash algorithm since they always result in an identical hash value . This is to enable 2 spanned ' s to be equal
fn hash<H>(&self, state: &mut H)
    where
        H: std::hash::Hasher,
    {
        state.finish();
    }
fn hash < H > ( & self , state : & mut H ) where H : std :: hash :: Hasher , { state . finish ( ) ; }
Note: Span's shouldn't be used in a hash algorithm since they always
       result in an identical hash value.
Note : Span ' s shouldn ' t be used in a hash algorithm since they always result in an identical hash value .
&self
state
&mut H