zsb/fidc-backtest-engine
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

test(data): compare compact names by value and allocation class

Browse Source
This commit is contained in:
boris
2026-09-13 09:57:46 +08:00
committed by boris
parent 0ff90c4329
commit fe05384f80
2 changed files with 10 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files
crates/fidc-core/src/data.rs
+2 -4
View File
@@ -6470,10 +6470,8 @@ mod tests {
extra_factors: From::from([(Cow::Borrowed("amount"), 10.0)]), extra_factors: From::from([(Cow::Borrowed("amount"), 10.0)]),
}]) }])
.expect("normalize clean factor snapshot"); .expect("normalize clean factor snapshot");
assert!(matches!( assert_eq!(clean[0].extra_factors.keys().next().map(CompactString::as_str), Some("amount"));
clean[0].extra_factors.keys().next(), assert!(!clean[0].extra_factors.keys().next().unwrap().is_heap_allocated());
Some(Cow::Borrowed("amount"))
));
let dirty = normalize_factor_snapshots(vec![DailyFactorSnapshot { let dirty = normalize_factor_snapshots(vec![DailyFactorSnapshot {
date, date,
crates/fidc-core/src/numeric_factors.rs
+8 -8
View File
@@ -297,14 +297,14 @@ mod tests {
} }
} }
assert_eq!( assert_eq!(
flat.iter().collect::<Vec<_>>(), flat.iter().map(|(key, value)| (key.as_str(), value)).collect::<Vec<_>>(),
tree.iter().collect::<Vec<_>>() tree.iter().map(|(key, value)| (key.as_ref(), value)).collect::<Vec<_>>()
); );
flat.retain(|_, value| *value > 100.0); flat.retain(|_, value| *value > 100.0);
tree.retain(|_, value| *value > 100.0); tree.retain(|_, value| *value > 100.0);
assert_eq!( assert_eq!(
flat.iter().collect::<Vec<_>>(), flat.iter().map(|(key, value)| (key.as_str(), value)).collect::<Vec<_>>(),
tree.iter().collect::<Vec<_>>() tree.iter().map(|(key, value)| (key.as_ref(), value)).collect::<Vec<_>>()
); );
assert_eq!( assert_eq!(
std::mem::size_of::<NumericFactorMap>(), std::mem::size_of::<NumericFactorMap>(),
@@ -323,8 +323,8 @@ mod tests {
let flat: NumericFactorMap = input.clone().into_iter().collect(); let flat: NumericFactorMap = input.clone().into_iter().collect();
let tree: BTreeMap<_, _> = input.into_iter().collect(); let tree: BTreeMap<_, _> = input.into_iter().collect();
assert_eq!( assert_eq!(
flat.iter().collect::<Vec<_>>(), flat.iter().map(|(key, value)| (key.as_str(), value)).collect::<Vec<_>>(),
tree.iter().collect::<Vec<_>>() tree.iter().map(|(key, value)| (key.as_ref(), value)).collect::<Vec<_>>()
); );
assert_eq!(flat["z"], 4.0); assert_eq!(flat["z"], 4.0);
} }
@@ -375,8 +375,8 @@ mod tests {
flat.extend(incoming.clone()); flat.extend(incoming.clone());
tree.extend(incoming); tree.extend(incoming);
assert_eq!( assert_eq!(
flat.iter().collect::<Vec<_>>(), flat.iter().map(|(key, value)| (key.as_str(), value)).collect::<Vec<_>>(),
tree.iter().collect::<Vec<_>>() tree.iter().map(|(key, value)| (key.as_ref(), value)).collect::<Vec<_>>()
); );
assert_eq!(flat.keys().last().map(CompactString::as_str), Some("shared")); assert_eq!(flat.keys().last().map(CompactString::as_str), Some("shared"));
assert!(!flat.keys().last().unwrap().is_heap_allocated()); assert!(!flat.keys().last().unwrap().is_heap_allocated());