-
-
Save lcnr/8de338fdb2685581e17727bbfab0622a to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| use super::*; | |
| impl<D: Delegate<Cx = X>, X: Cx> SearchGraph<D> { | |
| #[allow(rustc::potential_query_instability)] | |
| pub(super) fn check_invariants(&self) { | |
| if !cfg!(debug_assertions) { | |
| return; | |
| } | |
| let SearchGraph { mode: _, stack, provisional_cache, _marker } = self; | |
| if stack.is_empty() { | |
| assert!(provisional_cache.is_empty()); | |
| } | |
| for (depth, entry) in stack.iter_enumerated() { | |
| let StackEntry { | |
| input: _, | |
| available_depth: _, | |
| reached_depth: _, | |
| ref heads, | |
| encountered_overflow: _, | |
| has_been_used, | |
| ref nested_goals, | |
| provisional_result, | |
| } = *entry; | |
| for head in heads.heads.iter().copied() { | |
| assert!(head < depth); | |
| assert_ne!(stack[head].has_been_used, None); | |
| } | |
| } | |
| for (_input, entries) in provisional_cache { | |
| assert!(!entries.is_empty()); | |
| for entry in entries { | |
| let ProvisionalCacheEntry { is_sus: _, ref heads, path_from_head: _, nested_goals: _, result: _ } = *entry; | |
| assert!(!heads.is_empty()); | |
| for head in heads.heads.iter().copied() { | |
| assert!(head < stack.next_index()); | |
| assert_ne!(stack[head].has_been_used, None); | |
| } | |
| } | |
| } | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment