slop-commit 6.1.0

Polynomial commitment scheme abstractions for SLOP
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

use std::ops::{Deref, DerefMut};

use serde::{Deserialize, Serialize};
use slop_alloc::HasBackend;

#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct Rounds<M> {
    pub rounds: Vec<M>,
}

impl<M> Rounds<M> {
    #[inline]
    pub const fn new() -> Self {
        Self { rounds: vec![] }
    }
}

impl<M> Default for Rounds<M> {
    #[inline]
    fn default() -> Self {
        Self::new()
    }
}

impl<M> Deref for Rounds<M> {
    type Target = Vec<M>;

    fn deref(&self) -> &Self::Target {
        &self.rounds
    }
}

impl<M> DerefMut for Rounds<M> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.rounds
    }
}

impl<M> FromIterator<M> for Rounds<M> {
    fn from_iter<T: IntoIterator<Item = M>>(iter: T) -> Self {
        Rounds { rounds: iter.into_iter().collect() }
    }
}

impl<M> IntoIterator for Rounds<M> {
    type Item = M;
    type IntoIter = <Vec<M> as IntoIterator>::IntoIter;

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

impl<M> Extend<M> for Rounds<M> {
    fn extend<T: IntoIterator<Item = M>>(&mut self, iter: T) {
        self.rounds.extend(iter);
    }
}

impl<M> HasBackend for Rounds<M>
where
    M: HasBackend,
{
    type Backend = M::Backend;

    fn backend(&self) -> &Self::Backend {
        assert!(!self.rounds.is_empty(), "Rounds must not be empty");
        self.rounds.first().unwrap().backend()
    }
}