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

use crate::prelude::{TableEntryRenderer, TableModelEntry};
use std::iter::Enumerate;
use yew::virtual_dom::Key;
use yew::UseStateHandle;

#[derive(Clone)]
pub struct UseStateTableModel<T>
where
    T: PartialEq,
{
    entries: UseStateHandle<Vec<T>>,
}

impl<T> UseStateTableModel<T>
where
    T: PartialEq,
{
    pub fn new(entries: UseStateHandle<Vec<T>>) -> Self {
        Self { entries }
    }
}

impl<T> PartialEq for UseStateTableModel<T>
where
    T: PartialEq,
{
    fn eq(&self, other: &Self) -> bool {
        self.entries.eq(&other.entries)
    }
}

impl<T> From<UseStateHandle<Vec<T>>> for UseStateTableModel<T>
where
    T: PartialEq,
{
    fn from(value: UseStateHandle<Vec<T>>) -> Self {
        UseStateTableModel::new(value)
    }
}

impl<C, T> super::TableDataModel<C> for UseStateTableModel<T>
where
    C: Clone + Eq + 'static,
    T: PartialEq + TableEntryRenderer<C> + Clone + 'static,
{
    type Iterator<'i> = Enumerate<core::slice::Iter<'i, Self::Item>>;
    type Item = T;
    type Key = usize;

    fn len(&self) -> usize {
        self.entries.len()
    }

    fn is_empty(&self) -> bool {
        self.entries.is_empty()
    }

    fn contains(&self, key: &Self::Key) -> bool {
        *key < self.entries.len()
    }

    fn iter(&self) -> Self::Iterator<'_> {
        self.entries.iter().enumerate()
    }
}

pub struct StateIter<'i, T, K, C>
where
    K: Into<Key>,
    C: Clone + Eq,
{
    iter: Box<dyn Iterator<Item = TableModelEntry<'i, T, K, C>> + 'i>,
}

impl<'i, T, K, C> Iterator for StateIter<'i, T, K, C>
where
    K: Into<Key>,
    C: Clone + Eq,
{
    type Item = TableModelEntry<'i, T, K, C>;

    fn next(&mut self) -> Option<Self::Item> {
        self.iter.next()
    }
}