16935267080

Committed 13 Aug 2025 11:00AM UTC coverage: 24.312% (-63.3%) from 87.658%

Build # 16935267080

Build Type

Pull #4226

github

Committed by

web-flow

Commit Message

Merge 81b48c7fb into baa6ea202

Pull Request Pull Request #4226: Support converting TimestampTZ to and from duckdb

Run Details

0 of 2 new or added lines in 1 file covered. (0.0%)

20666 existing lines in 469 files now uncovered.

8726 of 35892 relevant lines covered (24.31%)

147.74 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/vortex-expr/src/pruning/relation.rs

// SPDX-License-Identifier: Apache-2.0
// SPDX-FileCopyrightText: Copyright the Vortex contributors

use std::hash::Hash;

use vortex_utils::aliases::hash_map::{HashMap, IntoIter};
use vortex_utils::aliases::hash_set::HashSet;

#[derive(Debug, Clone)]
pub struct Relation<K, V> {
    map: HashMap<K, HashSet<V>>,
}

impl<K: Hash + Eq, V: Hash + Eq> Default for Relation<K, V> {
    fn default() -> Self {
        Self::new()
    }
}

impl<K: Hash + Eq, V: Hash + Eq> Relation<K, V> {
    pub fn new() -> Self {
        Relation {
            map: HashMap::new(),
        }
    }

    pub fn insert(&mut self, k: K, v: V) {
        self.map.entry(k).or_default().insert(v);
    }

    pub fn map(&self) -> &HashMap<K, HashSet<V>> {
        &self.map
    }
}

impl<K, V> From<HashMap<K, HashSet<V>>> for Relation<K, V> {
    fn from(value: HashMap<K, HashSet<V>>) -> Self {
        Self { map: value }
    }
}

impl<K, V> IntoIterator for Relation<K, V> {
    type Item = (K, HashSet<V>);
    type IntoIter = IntoIter<K, HashSet<V>>;

    fn into_iter(self) -> Self::IntoIter {
        self.map.into_iter()
    }
}

1	// SPDX-License-Identifier: Apache-2.0
2	// SPDX-FileCopyrightText: Copyright the Vortex contributors
3
4	use std::hash::Hash;
5
6	use vortex_utils::aliases::hash_map::{HashMap, IntoIter};
7	use vortex_utils::aliases::hash_set::HashSet;
8
9	#[derive(Debug, Clone)]
10	pub struct Relation<K, V> {
11	map: HashMap<K, HashSet<V>>,
12	}
13
14	impl<K: Hash + Eq, V: Hash + Eq> Default for Relation<K, V> {
15	fn default() -> Self {	×
16	Self::new()	×
17	}	×
18	}
19
20	impl<K: Hash + Eq, V: Hash + Eq> Relation<K, V> {
UNCOV 21	pub fn new() -> Self {	×
UNCOV 22	Relation {	×
UNCOV 23	map: HashMap::new(),	×
UNCOV 24	}	×
UNCOV 25	}	×
26
UNCOV 27	pub fn insert(&mut self, k: K, v: V) {	×
UNCOV 28	self.map.entry(k).or_default().insert(v);	×
UNCOV 29	}	×
30
UNCOV 31	pub fn map(&self) -> &HashMap<K, HashSet<V>> {	×
UNCOV 32	&self.map	×
UNCOV 33	}	×
34	}
35
36	impl<K, V> From<HashMap<K, HashSet<V>>> for Relation<K, V> {
37	fn from(value: HashMap<K, HashSet<V>>) -> Self {	×
38	Self { map: value }	×
39	}	×
40	}
41
42	impl<K, V> IntoIterator for Relation<K, V> {
43	type Item = (K, HashSet<V>);
44	type IntoIter = IntoIter<K, HashSet<V>>;
45
46	fn into_iter(self) -> Self::IntoIter {	×
47	self.map.into_iter()	×
48	}	×
49	}

vortex-data / vortex / 16935267080

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous