elvis/ReactionSystems
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

rustfmt, fixed prohibiting set generation

Browse Source
This commit is contained in:
elvis
2025-09-07 17:55:53 +02:00
parent bf8bfd0d17
commit 49051358f0
27 changed files with 6138 additions and 6462 deletions
Download Patch File Download Diff File Expand all files Collapse all files

117
src/rsprocess/set_test.rs
View File

@ -1,9 +1,7 @@
#[test]
fn prohibiting_set_1() {
use std::collections::BTreeMap;
use super::set::{Set, PositiveSet};
use super::element::IdState;
use super::element::IdState::*;
use super::set::{PositiveSet, Set};
let r1r = Set::from(vec![2, 3, 4]);
let r1i = Set::from(vec![5, 6, 7]);
@ -11,30 +9,27 @@ fn prohibiting_set_1() {
let r2r = Set::from(vec![2, 3, 11]);
let r2i = Set::from(vec![5, 6, 7]);
let prohibiting_set = Set::prohibiting_set(&[r1r, r2r], &[r1i, r2i]).unwrap();
let mut prohibiting_set =
Set::prohibiting_set(&[r1r, r2r], &[r1i, r2i]).unwrap();
prohibiting_set.sort();
assert_eq!(prohibiting_set,
vec![PositiveSet { identifiers:
BTreeMap::from([(2, IdState::Negative)]) },
PositiveSet { identifiers:
BTreeMap::from([(3, IdState::Negative)]) },
PositiveSet { identifiers:
BTreeMap::from([(5, IdState::Positive)]) },
PositiveSet { identifiers:
BTreeMap::from([(6, IdState::Positive)]) },
PositiveSet { identifiers:
BTreeMap::from([(7, IdState::Positive)]) },
PositiveSet { identifiers:
BTreeMap::from([(4, IdState::Negative),
(11, IdState::Negative)]) }])
assert_eq!(
prohibiting_set,
vec![
PositiveSet::from([(2, Negative)]),
PositiveSet::from([(3, Negative)]),
PositiveSet::from([(4, Negative), (11, Negative)]),
PositiveSet::from([(5, Positive)]),
PositiveSet::from([(6, Positive)]),
PositiveSet::from([(7, Positive)]),
]
)
}
#[test]
fn prohibiting_set_2() {
use std::collections::BTreeMap;
use super::set::{Set, PositiveSet};
use super::element::IdState;
use super::element::IdState::*;
use super::set::{PositiveSet, Set};
let r1r = Set::from(vec![1]);
let r1i = Set::from(vec![2]);
@ -42,23 +37,23 @@ fn prohibiting_set_2() {
let r2r = Set::from(vec![1]);
let r2i = Set::from(vec![3]);
let prohibiting_set = Set::prohibiting_set(&[r1r, r2r], &[r1i, r2i]).unwrap();
let mut prohibiting_set =
Set::prohibiting_set(&[r1r, r2r], &[r1i, r2i]).unwrap();
prohibiting_set.sort();
assert_eq!(prohibiting_set,
vec![PositiveSet { identifiers:
BTreeMap::from([(1, IdState::Negative)]) },
PositiveSet { identifiers:
BTreeMap::from([(2, IdState::Positive),
(3, IdState::Positive)]) }])
assert_eq!(
prohibiting_set,
vec![
PositiveSet::from([(1, Negative)]),
PositiveSet::from([(2, Positive), (3, Positive)]),
]
)
}
#[test]
fn prohibiting_set_3() {
use std::collections::BTreeMap;
use super::set::{Set, PositiveSet};
use super::element::IdState;
use super::element::IdState::*;
use super::set::{PositiveSet, Set};
let r1r = Set::from(vec![1]);
let r1i = Set::from(vec![2]);
@ -66,13 +61,49 @@ fn prohibiting_set_3() {
let r2r = Set::from(vec![3]);
let r2i = Set::from(vec![1]);
let prohibiting_set = Set::prohibiting_set(&[r1r, r2r], &[r1i, r2i]).unwrap();
let mut prohibiting_set =
Set::prohibiting_set(&[r1r, r2r], &[r1i, r2i]).unwrap();
prohibiting_set.sort();
assert_eq!(prohibiting_set,
vec![PositiveSet { identifiers:
BTreeMap::from([(1, IdState::Negative),
(3, IdState::Negative)]) },
PositiveSet { identifiers:
BTreeMap::from([(2, IdState::Positive),
(3, IdState::Negative)]) }])
assert_eq!(
prohibiting_set,
vec![
PositiveSet::from([(1, Positive), (2, Positive)]),
PositiveSet::from([(1, Negative), (3, Negative)]),
PositiveSet::from([(2, Positive), (3, Negative)]),
]
)
}
#[test]
fn prohibiting_set_4() {
use super::element::IdState::*;
use super::set::{PositiveSet, Set};
let r1r = Set::from(vec![1]);
let r1i = Set::from(vec![2]);
let r2r = Set::from(vec![3]);
let r2i = Set::from(vec![4]);
let r3r = Set::from(vec![5]);
let r3i = Set::from(vec![6]);
let mut prohibiting_set =
Set::prohibiting_set(&[r1r, r2r, r3r], &[r1i, r2i, r3i]).unwrap();
prohibiting_set.sort();
assert_eq!(
prohibiting_set,
vec![
PositiveSet::from([(1, Negative), (3, Negative), (5, Negative)]),
PositiveSet::from([(1, Negative), (3, Negative), (6, Positive)]),
PositiveSet::from([(1, Negative), (4, Positive), (5, Negative)]),
PositiveSet::from([(1, Negative), (4, Positive), (6, Positive)]),
PositiveSet::from([(2, Positive), (3, Negative), (5, Negative)]),
PositiveSet::from([(2, Positive), (3, Negative), (6, Positive)]),
PositiveSet::from([(2, Positive), (4, Positive), (5, Negative)]),
PositiveSet::from([(2, Positive), (4, Positive), (6, Positive)]),
]
)
}