Struct BalancedKey 

pub struct BalancedKey(/* private fields */);

create it like:

let _  = bisection_key::BalancedKey::new("a");

Implementations

impl BalancedKey

pub fn new(s: &str) -> Result<Self, String>

Examples found in repository

examples/debug_balanced.rs (line 10)

fn main() -> Result<(), String> {
  // let a = BalancedKey::new("aV")?;
  // let b = BalancedKey::new("b")?;
  // println!("{}", a.bisect(&b)?);

  let a0 = BalancedKey::new("aV")?;
  let a1 = BalancedKey::new("b-")?;
  a0.bisect(&a1)?;

  let mut base = BalancedKey::new("a")?;
  let next = BalancedKey::new("b")?;
  let mut ret: Vec<String> = vec![];
  for _ in 0..100 {
    base = base.bisect(&next)?;
    println!("{}", base);
    ret.push(base.to_string());
  }

  println!("{:?}", ret);

  let mut base = BalancedKey::new("a")?;
  let mut ret: Vec<String> = vec![];
  for _ in 0..100 {
    base = base.bisect_end()?;
    println!("{}", base);
    ret.push(base.to_string());
  }

  println!("{:?}", ret);

  Ok(())
}

pub fn strip_last_mut(&mut self)

pub fn strip_last(&self) -> Self

pub fn bisect(&self, next: &Self) -> Result<Self, String>

Examples found in repository

examples/debug_balanced.rs (line 12)

fn main() -> Result<(), String> {
  // let a = BalancedKey::new("aV")?;
  // let b = BalancedKey::new("b")?;
  // println!("{}", a.bisect(&b)?);

  let a0 = BalancedKey::new("aV")?;
  let a1 = BalancedKey::new("b-")?;
  a0.bisect(&a1)?;

  let mut base = BalancedKey::new("a")?;
  let next = BalancedKey::new("b")?;
  let mut ret: Vec<String> = vec![];
  for _ in 0..100 {
    base = base.bisect(&next)?;
    println!("{}", base);
    ret.push(base.to_string());
  }

  println!("{:?}", ret);

  let mut base = BalancedKey::new("a")?;
  let mut ret: Vec<String> = vec![];
  for _ in 0..100 {
    base = base.bisect_end()?;
    println!("{}", base);
    ret.push(base.to_string());
  }

  println!("{:?}", ret);

  Ok(())
}

pub fn bisect_end(&self) -> Result<Self, String>

Examples found in repository

examples/debug_balanced.rs (line 28)

fn main() -> Result<(), String> {
  // let a = BalancedKey::new("aV")?;
  // let b = BalancedKey::new("b")?;
  // println!("{}", a.bisect(&b)?);

  let a0 = BalancedKey::new("aV")?;
  let a1 = BalancedKey::new("b-")?;
  a0.bisect(&a1)?;

  let mut base = BalancedKey::new("a")?;
  let next = BalancedKey::new("b")?;
  let mut ret: Vec<String> = vec![];
  for _ in 0..100 {
    base = base.bisect(&next)?;
    println!("{}", base);
    ret.push(base.to_string());
  }

  println!("{:?}", ret);

  let mut base = BalancedKey::new("a")?;
  let mut ret: Vec<String> = vec![];
  for _ in 0..100 {
    base = base.bisect_end()?;
    println!("{}", base);
    ret.push(base.to_string());
  }

  println!("{:?}", ret);

  Ok(())
}

pub fn bisect_beginning(&self) -> Result<Self, String>

pub fn promote_from( &self, idx: usize, change: NumberChange, ) -> Result<Self, String>

pub fn checked(self) -> Result<Self, String>

Trait Implementations

impl Debug for BalancedKey

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

Formats the value using the given formatter.

impl Default for BalancedKey

fn default() -> Self

Returns the “default value” for a type.

impl Display for BalancedKey

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

Formats the value using the given formatter.

impl Ord for BalancedKey

missing length are filled with 32s, then compare like a vector

fn cmp(&self, other: &BalancedKey) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for BalancedKey

missing length are filled with 32s, then compare like a vector

fn eq(&self, other: &BalancedKey) -> 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 PartialOrd for BalancedKey

fn partial_cmp(&self, other: &BalancedKey) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for BalancedKey