@@ -54,7 +54,7 @@ pub trait Configuration: Any {
54
54
/// (and, if so, how).
55
55
const CYCLE_STRATEGY : CycleRecoveryStrategy ;
56
56
57
- /// Invokes after a new result `new_value`` has been computed for which an older memoized value
57
+ /// Invokes after a new result `new_value` has been computed for which an older memoized value
58
58
/// existed `old_value`, or in fixpoint iteration. Returns true if the new value is equal to
59
59
/// the older one.
60
60
///
@@ -243,12 +243,9 @@ where
243
243
/// True if the input `input` contains a memo that cites itself as a cycle head.
244
244
/// This indicates an intermediate value for a cycle that has not yet reached a fixed point.
245
245
fn is_provisional_cycle_head < ' db > ( & ' db self , db : & ' db dyn Database , input : Id ) -> bool {
246
- self . get_memo_from_table_for (
247
- db. zalsa ( ) ,
248
- input,
249
- self . memo_ingredient_index ( db. zalsa ( ) , input) ,
250
- )
251
- . is_some_and ( |memo| memo. cycle_heads ( ) . contains ( & self . database_key_index ( input) ) )
246
+ let zalsa = db. zalsa ( ) ;
247
+ self . get_memo_from_table_for ( zalsa, input, self . memo_ingredient_index ( zalsa, input) )
248
+ . is_some_and ( |memo| memo. cycle_heads ( ) . contains ( & self . database_key_index ( input) ) )
252
249
}
253
250
254
251
/// Attempts to claim `key_index`, returning `false` if a cycle occurs.
@@ -265,10 +262,6 @@ where
265
262
}
266
263
}
267
264
268
- fn cycle_recovery_strategy ( & self ) -> CycleRecoveryStrategy {
269
- C :: CYCLE_STRATEGY
270
- }
271
-
272
265
fn origin ( & self , db : & dyn Database , key : Id ) -> Option < QueryOrigin > {
273
266
self . origin ( db. zalsa ( ) , key)
274
267
}
0 commit comments