Method hash

graphlite/src/exec/result.rs:356–369

(&self, state: &mut H)

impl Hash for Row {
    fn hash<H: Hasher>(&self, state: &mut H) {
        // For set operations, hash positionally if available
        if !self.positional_values.is_empty() {
            self.positional_values.hash(state);
        } else {
            // Fallback to named hashing for backward compatibility
            let mut items: Vec<_> = self.values.iter().collect();
            items.sort_by_key(|(k, _)| *k);
            for (key, value) in items {
                key.hash(state);
                value.hash(state);
            }
        }
    }
}