raiden-state-machine 0.1.0

Raiden Network implementation in Rust
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

#![warn(clippy::missing_docs_in_private_items)]

use raiden_primitives::types::Locksroot;
use web3::signing::keccak256;

use crate::types::{
	HashTimeLockState,
	PendingLocksState,
};

/// Returns a new `PendingLocksState` from an existing one and a new lock.
pub(crate) fn compute_locks_with(
	pending_locks: &PendingLocksState,
	lock: HashTimeLockState,
) -> Option<PendingLocksState> {
	if !pending_locks.locks.contains(&lock.encoded) {
		let mut locks = PendingLocksState { locks: pending_locks.locks.clone() };
		locks.locks.push(lock.encoded);
		return Some(locks)
	}

	None
}

/// Returns a new `PendingLocksState` from an existing one by removing `lock`.
pub(crate) fn compute_locks_without(
	pending_locks: &mut PendingLocksState,
	lock: &HashTimeLockState,
) -> Option<PendingLocksState> {
	if pending_locks.locks.contains(&lock.encoded) {
		let mut locks = PendingLocksState { locks: pending_locks.locks.clone() };
		locks.locks.retain(|l| l != &lock.encoded);
		return Some(locks)
	}

	None
}

/// Compute the locksroot based on the pending locks state.
pub fn compute_locksroot(locks: &PendingLocksState) -> Locksroot {
	let locks: Vec<&[u8]> = locks.locks.iter().map(|lock| lock.0.as_slice()).collect();
	let hash = keccak256(&locks.concat());
	Locksroot::from_slice(&hash)
}