konevsa/proxmox
1
0
Fork 0
forked from Proxmox/proxmox
Code Pull Requests Activity

schema: predictable order of errors for tests

Browse Source 
Otherwise we'd have to "search" & match the errors...

Signed-off-by: Wolfgang Bumiller <w.bumiller@proxmox.com>
This commit is contained in:
Wolfgang Bumiller 2023-03-06 16:20:47 +01:00 committed by Thomas Lamprecht
parent c702638bd8
commit 12da5121ff
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
proxmox-schema/src/de/verify.rs
View File

@ -1,6 +1,6 @@
use std::borrow::Cow; use std::borrow::Cow;
use std::cell::RefCell; use std::cell::RefCell;
use std::collections::HashSet; use std::collections::{BTreeSet, HashSet};
use std::fmt; use std::fmt;
use std::mem; use std::mem;
@ -229,7 +229,9 @@ impl<'de> de::Visitor<'de> for Visitor {
_ => return Err(A::Error::invalid_type(Unexpected::Map, &self)), _ => return Err(A::Error::invalid_type(Unexpected::Map, &self)),
}; };
let mut required_keys = HashSet::<&'static str>::new(); // The tests need this to be in a predictable order, so HashSet won't work as it uses a
// randomized default state.
let mut required_keys = BTreeSet::<&'static str>::new();
for (key, optional, _schema) in schema.properties() { for (key, optional, _schema) in schema.properties() {
if !optional { if !optional {
required_keys.insert(key); required_keys.insert(key);