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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
//! use_set hook for Set state management
//!
//! Provides convenient methods for managing HashSet state.
//!
//! # Example
//!
//! ```rust,ignore
//! use rnk::prelude::*;
//!
//! fn tags_editor() -> Element {
//! let tags = use_set(vec!["rust", "terminal"]);
//!
//! use_input(move |input, _| {
//! if input == "a" {
//! tags.insert("new-tag");
//! } else if input == "r" {
//! tags.remove(&"rust");
//! }
//! });
//!
//! // Render tags...
//! }
//! ```
use crate::hooks::use_signal::{Signal, use_signal};
use std::collections::HashSet;
use std::hash::Hash;
/// Handle for set operations
#[derive(Clone)]
pub struct SetHandle<T> {
signal: Signal<HashSet<T>>,
}
impl<T> SetHandle<T>
where
T: Clone + Eq + Hash + Send + Sync + 'static,
{
/// Get a clone of the current set
pub fn get(&self) -> HashSet<T> {
self.signal.get()
}
/// Get the number of elements
pub fn len(&self) -> usize {
self.signal.with(|s| s.len())
}
/// Check if the set is empty
pub fn is_empty(&self) -> bool {
self.signal.with(|s| s.is_empty())
}
/// Insert an element
pub fn insert(&self, value: T) -> bool {
let mut inserted = false;
self.signal.update(|s| {
inserted = s.insert(value);
});
inserted
}
/// Remove an element
pub fn remove(&self, value: &T) -> bool {
let mut removed = false;
self.signal.update(|s| {
removed = s.remove(value);
});
removed
}
/// Check if the set contains an element
pub fn contains(&self, value: &T) -> bool {
self.signal.with(|s| s.contains(value))
}
/// Toggle an element (insert if absent, remove if present)
pub fn toggle(&self, value: T) -> bool {
let mut is_present = false;
self.signal.update(|s| {
if s.contains(&value) {
s.remove(&value);
is_present = false;
} else {
s.insert(value);
is_present = true;
}
});
is_present
}
/// Clear all elements
pub fn clear(&self) {
self.signal.update(|s| s.clear());
}
/// Set the entire set
pub fn set(&self, set: HashSet<T>) {
self.signal.set(set);
}
/// Get all elements as a Vec
pub fn to_vec(&self) -> Vec<T> {
self.signal.with(|s| s.iter().cloned().collect())
}
/// Add multiple elements
pub fn extend(&self, items: impl IntoIterator<Item = T>) {
self.signal.update(|s| {
s.extend(items);
});
}
/// Retain only elements matching predicate
pub fn retain<F>(&self, f: F)
where
F: FnMut(&T) -> bool,
{
self.signal.update(|s| s.retain(f));
}
}
/// Create a set state with the given initial elements
pub fn use_set<T>(initial: Vec<T>) -> SetHandle<T>
where
T: Clone + Eq + Hash + Send + Sync + 'static,
{
let signal = use_signal(|| initial.into_iter().collect());
SetHandle { signal }
}
/// Create an empty set state
pub fn use_set_empty<T>() -> SetHandle<T>
where
T: Clone + Eq + Hash + Send + Sync + 'static,
{
use_set(Vec::new())
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_use_set_compiles() {
fn _test() {
let set = use_set(vec![1, 2, 3]);
set.insert(4);
set.remove(&1);
let _ = set.contains(&2);
let _ = set.len();
}
}
#[test]
fn test_set_toggle() {
fn _test() {
let set = use_set(vec!["a"]);
set.toggle("a"); // removes
set.toggle("b"); // inserts
}
}
#[test]
fn test_set_empty() {
fn _test() {
let set: SetHandle<i32> = use_set_empty();
set.insert(1);
}
}
}