feat: initialize Kurdistan SDK - independent fork of Polkadot SDK

pezkuwi/node/gum/src/tests.rs

@@ -0,0 +1,166 @@
+// Copyright (C) Parity Technologies (UK) Ltd.
+// This file is part of Pezkuwi.
+
+// Pezkuwi is free software: you can redistribute it and/or modify
+// it under the terms of the GNU General Public License as published by
+// the Free Software Foundation, either version 3 of the License, or
+// (at your option) any later version.
+
+// Pezkuwi is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License
+// along with Pezkuwi.  If not, see <http://www.gnu.org/licenses/>.
+
+use super::*;
+pub use pezkuwi_primitives::{CandidateHash, Hash};
+
+#[derive(Default, Debug)]
+struct Y {
+	#[allow(dead_code)]
+	x: u8,
+}
+
+#[test]
+fn plain() {
+	error!("plain");
+}
+
+#[test]
+fn wo_alias() {
+	let a: i32 = 7;
+	error!(target: "foo",
+		"Something something {}, {b:?}, or maybe {c}",
+		a,
+		b = Y::default(),
+		c = a
+	);
+}
+
+#[test]
+fn wo_unnecessary() {
+	let a: i32 = 7;
+	warn!(target: "bar",
+		a = a,
+		b = ?Y::default(),
+		"fff {c}",
+		c = a,
+	);
+}
+
+#[test]
+fn if_frequent() {
+	let a: i32 = 7;
+	let mut f = Freq::new();
+	warn_if_frequent!(
+		freq: f,
+		max_rate: Times::PerSecond(1),
+		target: "bar",
+		a = a,
+		b = ?Y::default(),
+		"fff {c}",
+		c = a,
+	);
+}
+
+#[test]
+fn w_candidate_hash_value_assignment() {
+	let a: i32 = 7;
+	info!(target: "bar",
+		a = a,
+		// ad-hoc value
+		candidate_hash = %CandidateHash(Hash::repeat_byte(0xF0)),
+		b = ?Y::default(),
+		c = ?a,
+		"xxx",
+	);
+}
+
+#[test]
+fn w_candidate_hash_from_scope() {
+	let a: i32 = 7;
+	let candidate_hash = CandidateHash(Hash::repeat_byte(0xF1));
+	debug!(target: "bar",
+		a = a,
+		?candidate_hash,
+		b = ?Y::default(),
+		c = ?a,
+		"xxx",
+	);
+}
+
+#[test]
+fn w_candidate_hash_aliased() {
+	let a: i32 = 7;
+	let c_hash = Hash::repeat_byte(0xFA);
+	trace!(target: "bar",
+		a = a,
+		candidate_hash = ?c_hash,
+		b = ?Y::default(),
+		c = a,
+		"xxx",
+	);
+}
+
+#[test]
+fn w_candidate_hash_aliased_unnecessary() {
+	let a: i32 = 7;
+	let candidate_hash = CandidateHash(Hash::repeat_byte(0xFA));
+	info!(
+		target: "bar",
+		a = a,
+		candidate_hash = ?candidate_hash,
+		b = ?Y::default(),
+		c = a,
+		"xxx",
+	);
+}
+
+#[test]
+fn frequent_at_fourth_time() {
+	let mut freq = Freq::new();
+
+	assert!(!freq.is_frequent(Times::PerSecond(1)));
+	assert!(!freq.is_frequent(Times::PerSecond(1)));
+	assert!(!freq.is_frequent(Times::PerSecond(1)));
+
+	assert!(freq.is_frequent(Times::PerSecond(1)));
+}
+
+#[test]
+fn not_frequent_at_fourth_time_if_slow() {
+	let mut freq = Freq::new();
+
+	assert!(!freq.is_frequent(Times::PerSecond(1000)));
+	assert!(!freq.is_frequent(Times::PerSecond(1000)));
+	assert!(!freq.is_frequent(Times::PerSecond(1000)));
+
+	std::thread::sleep(std::time::Duration::from_millis(10));
+	assert!(!freq.is_frequent(Times::PerSecond(1000)));
+}
+
+#[test]
+fn calculate_rate_per_second() {
+	let rate: f32 = Times::PerSecond(100).into();
+	assert_eq!(rate, 100.0)
+}
+
+#[test]
+fn calculate_rate_per_minute() {
+	let rate: f32 = Times::PerMinute(100).into();
+	assert_eq!(rate, 1.6666666)
+}
+
+#[test]
+fn calculate_rate_per_hour() {
+	let rate: f32 = Times::PerHour(100).into();
+	assert_eq!(rate, 0.027777778)
+}
+
+#[test]
+fn calculate_rate_per_day() {
+	let rate: f32 = Times::PerDay(100).into();
+	assert_eq!(rate, 0.0011574074)
+}