rust-queries-core 1.0.8

Core functionality for rust-queries-builder - type-safe query builder for Rust collections
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104

//! Queryable trait for supporting multiple container types.
//!
//! This module provides the `Queryable` trait which enables querying
//! various container types: Vec, HashMap, HashSet, BTreeMap, VecDeque, etc.

use std::collections::{HashMap, HashSet, BTreeMap, BTreeSet, VecDeque, LinkedList};

/// Trait for types that can be queried.
///
/// Implemented for standard collections like Vec, HashMap, HashSet, etc.
pub trait Queryable<T> {
    /// Returns an iterator over references to items.
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_>;
}

// Implementation for slice
impl<T> Queryable<T> for [T] {
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for Vec
impl<T> Queryable<T> for Vec<T> {
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for VecDeque
impl<T> Queryable<T> for VecDeque<T> {
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for LinkedList
impl<T> Queryable<T> for LinkedList<T> {
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for HashSet
impl<T> Queryable<T> for HashSet<T>
where
    T: Eq + std::hash::Hash,
{
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for BTreeSet
impl<T> Queryable<T> for BTreeSet<T>
where
    T: Ord,
{
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for HashMap (queries values)
impl<K, V> Queryable<V> for HashMap<K, V>
where
    K: Eq + std::hash::Hash,
{
    fn query_iter(&self) -> Box<dyn Iterator<Item = &V> + '_> {
        Box::new(self.values())
    }
}

// Implementation for BTreeMap (queries values)
impl<K, V> Queryable<V> for BTreeMap<K, V>
where
    K: Ord,
{
    fn query_iter(&self) -> Box<dyn Iterator<Item = &V> + '_> {
        Box::new(self.values())
    }
}

// Implementation for arrays of any size
impl<T, const N: usize> Queryable<T> for [T; N] {
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for Option (0 or 1 item)
impl<T> Queryable<T> for Option<T> {
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}

// Implementation for Result (0 or 1 item)
impl<T, E> Queryable<T> for Result<T, E> {
    fn query_iter(&self) -> Box<dyn Iterator<Item = &T> + '_> {
        Box::new(self.iter())
    }
}