Struct StepMap 

pub struct StepMap { /* private fields */ }

How one step remaps positions. ranges is a flat list of (start, old_size, new_size) triples.

Implementations

impl StepMap

pub fn new(ranges: Vec<usize>) -> Self

A map from (start, old_size, new_size) triples.

pub fn identity() -> Self

The identity map (no position changes).

pub fn invert(&self) -> StepMap

The inverse of this map (swaps old/new sizes).

pub fn map(&self, pos: usize, assoc: i32) -> usize

Map pos to its new location (association assoc: -1 biases toward content before the position, 1 toward content after).

pub fn map_result(&self, pos: usize, assoc: i32) -> MapResult

Like map but also reports deletion around pos.

Trait Implementations

impl Clone for StepMap

fn clone(&self) -> StepMap

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StepMap

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for StepMap

impl PartialEq for StepMap

fn eq(&self, other: &StepMap) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for StepMap