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

// RGB Core Library: a reference implementation of RGB smart contract standards.
// Written in 2019-2022 by
//     Dr. Maxim Orlovsky <orlovsky@lnp-bp.org>
//
// To the extent possible under law, the author(s) have dedicated all copyright
// and related and neighboring rights to this software to the public domain
// worldwide. This software is distributed without any warranty.
//
// You should have received a copy of the MIT License along with this software.
// If not, see <https://opensource.org/licenses/MIT>.

use core::cmp::Ord;
use std::collections::{BTreeMap, BTreeSet, HashMap, HashSet};

use super::seal;

pub trait ConcealSeals {
    fn conceal_seals(&mut self, seals: &[seal::Confidential]) -> usize;
}

pub trait ConcealState {
    fn conceal_state(&mut self) -> usize { self.conceal_state_except(&[]) }
    fn conceal_state_except(&mut self, seals: &[seal::Confidential]) -> usize;
}

impl<T> ConcealSeals for Vec<T>
where T: ConcealSeals
{
    fn conceal_seals(&mut self, seals: &[seal::Confidential]) -> usize {
        self.iter_mut()
            .fold(0usize, |sum, item| sum + item.conceal_seals(seals))
    }
}

impl<T> ConcealSeals for BTreeSet<T>
where T: ConcealSeals + Ord + Clone
{
    fn conceal_seals(&mut self, seals: &[seal::Confidential]) -> usize {
        let mut count = 0;
        let mut new_self = BTreeSet::<T>::new();
        for item in self.iter() {
            let mut new_item = item.clone();
            count += new_item.conceal_seals(seals);
            new_self.insert(new_item);
        }
        *self = new_self;
        count
    }
}

impl<K, V> ConcealSeals for BTreeMap<K, V>
where V: ConcealSeals
{
    fn conceal_seals(&mut self, seals: &[seal::Confidential]) -> usize {
        self.iter_mut()
            .fold(0usize, |sum, item| sum + item.1.conceal_seals(seals))
    }
}

impl<T> ConcealSeals for HashSet<T>
where T: ConcealSeals + Ord + Clone + std::hash::Hash
{
    fn conceal_seals(&mut self, seals: &[seal::Confidential]) -> usize {
        let mut count = 0;
        let mut new_self = HashSet::<T>::new();
        for item in self.iter() {
            let mut new_item = item.clone();
            count += new_item.conceal_seals(seals);
            new_self.insert(new_item);
        }
        *self = new_self;
        count
    }
}

impl<K, V> ConcealSeals for HashMap<K, V>
where V: ConcealSeals
{
    fn conceal_seals(&mut self, seals: &[seal::Confidential]) -> usize {
        self.iter_mut()
            .fold(0usize, |sum, item| sum + item.1.conceal_seals(seals))
    }
}

impl<T> ConcealState for Vec<T>
where T: ConcealState
{
    fn conceal_state_except(&mut self, seals: &[seal::Confidential]) -> usize {
        self.iter_mut()
            .fold(0usize, |sum, item| sum + item.conceal_state_except(seals))
    }
}

impl<T> ConcealState for BTreeSet<T>
where T: ConcealState + Ord + Clone
{
    fn conceal_state_except(&mut self, seals: &[seal::Confidential]) -> usize {
        let mut count = 0;
        let mut new_self = BTreeSet::<T>::new();
        for item in self.iter() {
            let mut new_item = item.clone();
            count += new_item.conceal_state_except(seals);
            new_self.insert(new_item);
        }
        *self = new_self;
        count
    }
}

impl<K, V> ConcealState for BTreeMap<K, V>
where V: ConcealState
{
    fn conceal_state_except(&mut self, seals: &[seal::Confidential]) -> usize {
        self.iter_mut()
            .fold(0usize, |sum, item| sum + item.1.conceal_state_except(seals))
    }
}

impl<T> ConcealState for HashSet<T>
where T: ConcealState + Ord + Clone + std::hash::Hash
{
    fn conceal_state_except(&mut self, seals: &[seal::Confidential]) -> usize {
        let mut count = 0;
        let mut new_self = HashSet::<T>::new();
        for item in self.iter() {
            let mut new_item = item.clone();
            count += new_item.conceal_state_except(seals);
            new_self.insert(new_item);
        }
        *self = new_self;
        count
    }
}

impl<K, V> ConcealState for HashMap<K, V>
where V: ConcealState
{
    fn conceal_state_except(&mut self, seals: &[seal::Confidential]) -> usize {
        self.iter_mut()
            .fold(0usize, |sum, item| sum + item.1.conceal_state_except(seals))
    }
}