forked from ecotask-network/EcoTask-contract
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstorage.rs
More file actions
202 lines (172 loc) · 5.53 KB
/
Copy pathstorage.rs
File metadata and controls
202 lines (172 loc) · 5.53 KB
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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
use soroban_sdk::{contracttype, Address, Env, String, Vec};
#[derive(Clone, Debug, PartialEq)]
#[contracttype]
pub enum VerificationStatus {
Pending,
Approved,
Rejected,
Disputed,
}
#[derive(Clone, Debug)]
#[contracttype]
pub struct Verification {
pub task_id: u64,
pub user: Address,
pub proof_cid: String,
pub reward_amount: i128,
pub status: VerificationStatus,
pub submitted_at: u64,
pub resolved_at: Option<u64>,
pub oracle: Address,
}
#[derive(Clone, Debug)]
#[contracttype]
pub enum DataKey {
Admin,
Token,
Registry,
Oracles,
Verification(u64, Address),
MinReward,
MaxReward,
VerificationList,
UserVerifications(Address),
TotalPaid,
Paused,
}
#[derive(Clone, Debug)]
#[contracttype]
pub struct VerificationKey {
pub task_id: u64,
pub user: Address,
}
pub fn write_admin(e: &Env, admin: &Address) {
let key = DataKey::Admin;
e.storage().instance().set(&key, admin);
}
pub fn read_admin(e: &Env) -> Address {
let key = DataKey::Admin;
e.storage().instance().get(&key).unwrap()
}
pub fn has_admin(e: &Env) -> bool {
let key = DataKey::Admin;
e.storage().instance().has(&key)
}
pub fn write_token(e: &Env, token: &Address) {
let key = DataKey::Token;
e.storage().instance().set(&key, token);
}
pub fn read_token(e: &Env) -> Address {
let key = DataKey::Token;
e.storage().instance().get(&key).unwrap()
}
pub fn write_registry(e: &Env, registry: &Address) {
let key = DataKey::Registry;
e.storage().instance().set(&key, registry);
}
pub fn read_registry(e: &Env) -> Address {
let key = DataKey::Registry;
e.storage().instance().get(&key).unwrap()
}
pub fn write_oracles(e: &Env, oracles: &Vec<Address>) {
let key = DataKey::Oracles;
e.storage().instance().set(&key, oracles);
}
pub fn read_oracles(e: &Env) -> Vec<Address> {
let key = DataKey::Oracles;
e.storage().instance().get(&key).unwrap_or(Vec::new(e))
}
pub fn push_oracle(e: &Env, oracle: &Address) {
let key = DataKey::Oracles;
let mut list: Vec<Address> = e.storage().instance().get(&key).unwrap_or(Vec::new(e));
list.push_back(oracle.clone());
e.storage().instance().set(&key, &list);
}
pub fn remove_oracle_from_list(e: &Env, oracle: &Address) {
let key = DataKey::Oracles;
let list: Vec<Address> = e.storage().instance().get(&key).unwrap_or(Vec::new(e));
let mut filtered: Vec<Address> = Vec::new(e);
for o in list.iter() {
if o != *oracle {
filtered.push_back(o);
}
}
e.storage().instance().set(&key, &filtered);
}
pub fn is_registered_oracle(e: &Env, addr: &Address) -> bool {
let oracles = read_oracles(e);
oracles.iter().any(|o| o == *addr)
}
pub fn write_verification(e: &Env, task_id: u64, user: &Address, v: &Verification) {
let key = DataKey::Verification(task_id, user.clone());
e.storage().persistent().set(&key, v);
}
pub fn read_verification(e: &Env, task_id: u64, user: &Address) -> Option<Verification> {
let key = DataKey::Verification(task_id, user.clone());
e.storage().persistent().get(&key)
}
pub fn write_reward_range(e: &Env, min: i128, max: i128) {
e.storage().instance().set(&DataKey::MinReward, &min);
e.storage().instance().set(&DataKey::MaxReward, &max);
}
pub fn read_min_reward(e: &Env) -> Option<i128> {
e.storage().instance().get(&DataKey::MinReward)
}
pub fn read_max_reward(e: &Env) -> Option<i128> {
e.storage().instance().get(&DataKey::MaxReward)
}
pub fn push_verification_key(e: &Env, task_id: u64, user: &Address) {
let key = DataKey::VerificationList;
let mut list: Vec<VerificationKey> = e.storage().instance().get(&key).unwrap_or(Vec::new(e));
list.push_back(VerificationKey {
task_id,
user: user.clone(),
});
e.storage().instance().set(&key, &list);
}
pub fn remove_verification_key(e: &Env, task_id: u64, user: &Address) {
let key = DataKey::VerificationList;
let list: Vec<VerificationKey> = e.storage().instance().get(&key).unwrap_or(Vec::new(e));
let mut filtered: Vec<VerificationKey> = Vec::new(e);
for item in list.iter() {
if item.task_id != task_id || item.user != *user {
filtered.push_back(item);
}
}
e.storage().instance().set(&key, &filtered);
}
pub fn read_verification_keys(e: &Env) -> Vec<VerificationKey> {
let key = DataKey::VerificationList;
e.storage().instance().get(&key).unwrap_or(Vec::new(e))
}
pub fn push_user_verification_key(e: &Env, user: &Address, task_id: u64) {
let key = DataKey::UserVerifications(user.clone());
let mut list: Vec<u64> = e.storage().persistent().get(&key).unwrap_or(Vec::new(e));
list.push_back(task_id);
e.storage().persistent().set(&key, &list);
}
pub fn read_user_verification_tasks(e: &Env, user: &Address) -> Vec<u64> {
let key = DataKey::UserVerifications(user.clone());
e.storage().persistent().get(&key).unwrap_or(Vec::new(e))
}
pub fn add_total_paid(e: &Env, amount: i128) {
let key = DataKey::TotalPaid;
let current: i128 = e.storage().instance().get(&key).unwrap_or(0);
e.storage().instance().set(
&key,
&(current.checked_add(amount).expect("total_paid overflow")),
);
}
pub fn read_total_paid(e: &Env) -> i128 {
let key = DataKey::TotalPaid;
e.storage().instance().get(&key).unwrap_or(0)
}
pub fn set_paused(e: &Env, paused: bool) {
e.storage().instance().set(&DataKey::Paused, &paused);
}
pub fn is_paused(e: &Env) -> bool {
e.storage()
.instance()
.get(&DataKey::Paused)
.unwrap_or(false)
}