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
#[cfg(not(feature = "std"))]
use alloc::vec::Vec;
use super::errors::OnChainError;
use bigint::M256;
#[derive(Debug)]
pub struct Stack {
stack: Vec<M256>,
}
impl Default for Stack {
fn default() -> Stack {
Stack { stack: Vec::new() }
}
}
impl Stack {
pub fn check_pop_push(&self, pop: usize, push: usize) -> Result<(), OnChainError> {
if self.len() < pop {
return Err(OnChainError::StackUnderflow);
}
if self.len() - pop + push > 1024 {
return Err(OnChainError::StackOverflow);
}
Ok(())
}
pub fn push(&mut self, elem: M256) -> Result<(), OnChainError> {
self.stack.push(elem);
if self.len() > 1024 {
self.stack.pop();
Err(OnChainError::StackOverflow)
} else {
Ok(())
}
}
pub fn pop(&mut self) -> Result<M256, OnChainError> {
match self.stack.pop() {
Some(x) => Ok(x),
None => Err(OnChainError::StackUnderflow),
}
}
pub fn set(&mut self, no_from_top: usize, val: M256) -> Result<(), OnChainError> {
if self.stack.len() > no_from_top {
let len = self.stack.len();
self.stack[len - no_from_top - 1] = val;
Ok(())
} else {
Err(OnChainError::StackUnderflow)
}
}
pub fn peek(&self, no_from_top: usize) -> Result<M256, OnChainError> {
if self.stack.len() > no_from_top {
Ok(self.stack[self.stack.len() - no_from_top - 1])
} else {
Err(OnChainError::StackUnderflow)
}
}
#[inline]
pub fn len(&self) -> usize {
self.stack.len()
}
#[inline]
pub fn is_empty(&self) -> bool {
self.len() == 0
}
}