/// <summary>Does an optimized step function (right to left) for sorted binary search trees.</summary> /// <typeparam name="T">The generic type of this data structure.</typeparam> /// <param name="tree">The tree to traverse.</param> /// <param name="minimum">The minimum step value.</param> /// <param name="maximum">The maximum step value.</param> /// <returns>The stepper of the traversal.</returns> public static StepperRefBreak <T> StepperRefBreakReverse <T>(this ISortedBinaryTree <T> tree, T minimum, T maximum) => x => tree.StepperReverse(minimum, maximum, y => x(ref y));
/// <summary>Does an optimized step function (right to left) for sorted binary search trees.</summary> /// <typeparam name="T">The generic type of this data structure.</typeparam> /// <param name="tree">The tree to traverse.</param> /// <param name="minimum">The minimum step value.</param> /// <param name="maximum">The maximum step value.</param> /// <returns>The stepper of the traversal.</returns> public static Func <Func <T, StepStatus>, StepStatus> StepperBreakReverse <T>(this ISortedBinaryTree <T> tree, T minimum, T maximum) => x => tree.StepperReverse(minimum, maximum, y => x(y));
/// <summary>Does an optimized step function (right to left) for sorted binary search trees.</summary> /// <typeparam name="T">The generic type of this data structure.</typeparam> /// <param name="tree">The tree to traverse.</param> /// <param name="minimum">The minimum step value.</param> /// <param name="maximum">The maximum step value.</param> /// <returns>The stepper of the traversal.</returns> public static StepperRef <T> StepperRefReverse <T, _Compare>(this ISortedBinaryTree <T, _Compare> tree, T minimum, T maximum) => x => tree.StepperReverse(minimum, maximum, y => x(ref y));
/// <summary>Does an optimized step function (right to left) for sorted binary search trees.</summary> /// <typeparam name="T">The generic type of this data structure.</typeparam> /// <param name="tree">The tree to traverse.</param> /// <param name="minimum">The minimum step value.</param> /// <param name="maximum">The maximum step value.</param> /// <returns>The stepper of the traversal.</returns> public static Action <Action <T> > StepperReverse <T>(this ISortedBinaryTree <T> tree, T minimum, T maximum) => x => tree.StepperReverse(minimum, maximum, y => x(y));
/// <summary>Does an optimized step function (right to left) for sorted binary search trees.</summary> /// <typeparam name="T">The generic type of this data structure.</typeparam> /// <param name="tree">The tree to traverse.</param> /// <param name="minimum">The minimum step value.</param> /// <param name="maximum">The maximum step value.</param> /// <returns>The stepper of the traversal.</returns> public static StepperBreak <T> StepperBreakReverse <T>(this ISortedBinaryTree <T> tree, T minimum, T maximum) => x => tree.StepperReverse(y => x(y), minimum, maximum);