pub struct ReversedStrategy;Expand description
Reversed strategy — mirror of ElementCount: last item = 1.0, first = 0.3.
Represents the adversarial case where the agent needs the last item in the list. Useful for measuring worst-case p₁ of position-biased strategies.
Trait Implementations§
Source§impl TrimStrategy for ReversedStrategy
impl TrimStrategy for ReversedStrategy
Source§fn assign_values(&self, tree: &mut TrimNode)
fn assign_values(&self, tree: &mut TrimNode)
Assign value scores to all nodes in the tree.
Auto Trait Implementations§
impl Freeze for ReversedStrategy
impl RefUnwindSafe for ReversedStrategy
impl Send for ReversedStrategy
impl Sync for ReversedStrategy
impl Unpin for ReversedStrategy
impl UnsafeUnpin for ReversedStrategy
impl UnwindSafe for ReversedStrategy
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more