nom-4.1.1/src/traits.rs

//! Traits input types have to implement to work with nom combinators
//!
use internal::{Err, IResult, Needed};
use lib::std::ops::{Range, RangeFrom, RangeFull, RangeTo};
use lib::std::iter::Enumerate;
use lib::std::slice::Iter;
use lib::std::iter::Map;

use lib::std::str::Chars;
use lib::std::str::CharIndices;
use lib::std::str::FromStr;
use lib::std::str::from_utf8;
#[cfg(feature = "alloc")]
use lib::std::string::String;
#[cfg(feature = "alloc")]
use lib::std::vec::Vec;

use memchr;

#[cfg(feature = "verbose-errors")]
use verbose_errors::Context;
#[cfg(not(feature = "verbose-errors"))]
use simple_errors::Context;

use util::ErrorKind;

/// abstract method to calculate the input length
pub trait InputLength {
  /// calculates the input length, as indicated by its name,
  /// and the name of the trait itself
  #[inline]
  fn input_len(&self) -> usize;
}

impl<'a, T> InputLength for &'a [T] {
  #[inline]
  fn input_len(&self) -> usize {
    self.len()
  }
}

impl<'a> InputLength for &'a str {
  #[inline]
  fn input_len(&self) -> usize {
    self.len()
  }
}

impl<'a> InputLength for (&'a [u8], usize) {
  #[inline]
  fn input_len(&self) -> usize {
    //println!("bit input length for ({:?}, {}):", self.0, self.1);
    //println!("-> {}", self.0.len() * 8 - self.1);
    self.0.len() * 8 - self.1
  }
}

/// useful functions to calculate the offset between slices and show a hexdump of a slice
pub trait Offset {
  /// offset between the first byte of self and the first byte of the argument
  fn offset(&self, second: &Self) -> usize;
}

impl Offset for [u8] {
  fn offset(&self, second: &Self) -> usize {
    let fst = self.as_ptr();
    let snd = second.as_ptr();

    snd as usize - fst as usize
  }
}

impl<'a> Offset for &'a [u8] {
  fn offset(&self, second: &Self) -> usize {
    let fst = self.as_ptr();
    let snd = second.as_ptr();

    snd as usize - fst as usize
  }
}

impl Offset for str {
  fn offset(&self, second: &Self) -> usize {
    let fst = self.as_ptr();
    let snd = second.as_ptr();

    snd as usize - fst as usize
  }
}

impl<'a> Offset for &'a str {
  fn offset(&self, second: &Self) -> usize {
    let fst = self.as_ptr();
    let snd = second.as_ptr();

    snd as usize - fst as usize
  }
}

/// casts the input type to a byte slice
pub trait AsBytes {
  fn as_bytes(&self) -> &[u8];
}

impl<'a> AsBytes for &'a str {
  #[inline(always)]
  fn as_bytes(&self) -> &[u8] {
    <str as AsBytes>::as_bytes(self)
  }
}

impl AsBytes for str {
  #[inline(always)]
  fn as_bytes(&self) -> &[u8] {
    self.as_ref()
  }
}

impl<'a> AsBytes for &'a [u8] {
  #[inline(always)]
  fn as_bytes(&self) -> &[u8] {
    *self
  }
}

impl AsBytes for [u8] {
  #[inline(always)]
  fn as_bytes(&self) -> &[u8] {
    self
  }
}

macro_rules! as_bytes_array_impls {
  ($($N:expr)+) => {
    $(
      impl<'a> AsBytes for &'a [u8; $N] {
        #[inline(always)]
        fn as_bytes(&self) -> &[u8] {
          *self
        }
      }

      impl AsBytes for [u8; $N] {
        #[inline(always)]
        fn as_bytes(&self) -> &[u8] {
          self
        }
      }
    )+
  };
}

as_bytes_array_impls! {
     0  1  2  3  4  5  6  7  8  9
    10 11 12 13 14 15 16 17 18 19
    20 21 22 23 24 25 26 27 28 29
    30 31 32
}

/// transforms common types to a char for basic token parsing
pub trait AsChar {
  /// makes a char from self
  #[inline]
  fn as_char(self) -> char;

  /// tests that self is an alphabetic character
  ///
  /// warning: for `&str` it recognizes alphabetic
  /// characters outside of the 52 ASCII letters
  #[inline]
  fn is_alpha(self) -> bool;

  /// tests that self is an alphabetic character
  /// or a decimal digit
  #[inline]
  fn is_alphanum(self) -> bool;
  /// tests that self is a decimal digit
  #[inline]
  fn is_dec_digit(self) -> bool;
  /// tests that self is an hex digit
  #[inline]
  fn is_hex_digit(self) -> bool;
  /// tests that self is an octal digit
  #[inline]
  fn is_oct_digit(self) -> bool;
  /// gets the len in bytes for self
  #[inline]
  fn len(self) -> usize;
}

impl AsChar for u8 {
  #[inline]
  fn as_char(self) -> char {
    self as char
  }
  #[inline]
  fn is_alpha(self) -> bool {
    (self >= 0x41 && self <= 0x5A) || (self >= 0x61 && self <= 0x7A)
  }
  #[inline]
  fn is_alphanum(self) -> bool {
    self.is_alpha() || self.is_dec_digit()
  }
  #[inline]
  fn is_dec_digit(self) -> bool {
    self >= 0x30 && self <= 0x39
  }
  #[inline]
  fn is_hex_digit(self) -> bool {
    (self >= 0x30 && self <= 0x39) || (self >= 0x41 && self <= 0x46) || (self >= 0x61 && self <= 0x66)
  }
  #[inline]
  fn is_oct_digit(self) -> bool {
    self >= 0x30 && self <= 0x37
  }
  #[inline]
  fn len(self) -> usize {
    1
  }
}
impl<'a> AsChar for &'a u8 {
  #[inline]
  fn as_char(self) -> char {
    *self as char
  }
  #[inline]
  fn is_alpha(self) -> bool {
    (*self >= 0x41 && *self <= 0x5A) || (*self >= 0x61 && *self <= 0x7A)
  }
  #[inline]
  fn is_alphanum(self) -> bool {
    self.is_alpha() || self.is_dec_digit()
  }
  #[inline]
  fn is_dec_digit(self) -> bool {
    *self >= 0x30 && *self <= 0x39
  }
  #[inline]
  fn is_hex_digit(self) -> bool {
    (*self >= 0x30 && *self <= 0x39) || (*self >= 0x41 && *self <= 0x46) || (*self >= 0x61 && *self <= 0x66)
  }
  #[inline]
  fn is_oct_digit(self) -> bool {
    *self >= 0x30 && *self <= 0x37
  }
  #[inline]
  fn len(self) -> usize {
    1
  }
}

impl AsChar for char {
  #[inline]
  fn as_char(self) -> char {
    self
  }
  #[cfg(feature = "alloc")]
  #[inline]
  fn is_alpha(self) -> bool {
    self.is_alphabetic()
  }
  #[cfg(not(feature = "alloc"))]
  #[inline]
  fn is_alpha(self) -> bool {
    unimplemented!(
      "error[E0658]: use of unstable library feature 'core_char_ext': the stable interface is `impl char` in later crate (see issue #32110)"
    )
  }
  #[inline]
  fn is_alphanum(self) -> bool {
    self.is_alpha() || self.is_dec_digit()
  }
  #[inline]
  fn is_dec_digit(self) -> bool {
    self.is_digit(10)
  }
  #[inline]
  fn is_hex_digit(self) -> bool {
    self.is_digit(16)
  }
  #[inline]
  fn is_oct_digit(self) -> bool {
    self.is_digit(8)
  }
  #[inline]
  fn len(self) -> usize {
    self.len_utf8()
  }
}

impl<'a> AsChar for &'a char {
  #[inline]
  fn as_char(self) -> char {
    *self
  }
  #[inline]
  fn is_alpha(self) -> bool {
    <char as AsChar>::is_alpha(*self)
  }
  #[inline]
  fn is_alphanum(self) -> bool {
    self.is_alpha() || self.is_dec_digit()
  }
  #[inline]
  fn is_dec_digit(self) -> bool {
    self.is_digit(10)
  }
  #[inline]
  fn is_hex_digit(self) -> bool {
    self.is_digit(16)
  }
  #[inline]
  fn is_oct_digit(self) -> bool {
    self.is_digit(8)
  }
  #[inline]
  fn len(self) -> usize {
    self.len_utf8()
  }
}

/// abstracts common iteration operations on the input type
///
/// it needs a distinction between `Item` and `RawItem` because
/// `&[T]` iterates on references
pub trait InputIter {
  type Item;
  type RawItem;
  type Iter: Iterator<Item = (usize, Self::Item)>;
  type IterElem: Iterator<Item = Self::Item>;

  /// returns an iterator over the elements and their byte offsets
  fn iter_indices(&self) -> Self::Iter;
  /// returns an iterator over the elements
  fn iter_elements(&self) -> Self::IterElem;
  /// finds the byte position of the element
  fn position<P>(&self, predicate: P) -> Option<usize>
  where
    P: Fn(Self::RawItem) -> bool;
  /// get the byte offset from the element's position in the stream
  fn slice_index(&self, count: usize) -> Option<usize>;
}

/// abstracts slicing operations
pub trait InputTake: Sized {
  /// returns a slice of `count` bytes. panics if count > length
  fn take(&self, count: usize) -> Self;
  /// split the stream at the `count` byte offset. panics if count > length
  fn take_split(&self, count: usize) -> (Self, Self);
}

fn star(r_u8: &u8) -> u8 {
  *r_u8
}

impl<'a> InputIter for &'a [u8] {
  type Item = u8;
  type RawItem = u8;
  type Iter = Enumerate<Self::IterElem>;
  type IterElem = Map<Iter<'a, Self::Item>, fn(&u8) -> u8>;

  #[inline]
  fn iter_indices(&self) -> Self::Iter {
    self.iter_elements().enumerate()
  }
  #[inline]
  fn iter_elements(&self) -> Self::IterElem {
    self.iter().map(star)
  }
  #[inline]
  fn position<P>(&self, predicate: P) -> Option<usize>
  where
    P: Fn(Self::Item) -> bool,
  {
    self.iter().position(|b| predicate(*b))
  }
  #[inline]
  fn slice_index(&self, count: usize) -> Option<usize> {
    if self.len() >= count {
      Some(count)
    } else {
      None
    }
  }
}

impl<'a> InputTake for &'a [u8] {
  #[inline]
  fn take(&self, count: usize) -> Self {
    &self[0..count]
  }
  #[inline]
  fn take_split(&self, count: usize) -> (Self, Self) {
    let (prefix, suffix) = self.split_at(count);
    (suffix, prefix)
  }
}

impl<'a> InputIter for &'a str {
  type Item = char;
  type RawItem = char;
  type Iter = CharIndices<'a>;
  type IterElem = Chars<'a>;
  #[inline]
  fn iter_indices(&self) -> Self::Iter {
    self.char_indices()
  }
  #[inline]
  fn iter_elements(&self) -> Self::IterElem {
    self.chars()
  }
  fn position<P>(&self, predicate: P) -> Option<usize>
  where
    P: Fn(Self::RawItem) -> bool,
  {
    for (o, c) in self.char_indices() {
      if predicate(c) {
        return Some(o);
      }
    }
    None
  }
  #[inline]
  fn slice_index(&self, count: usize) -> Option<usize> {
    let mut cnt = 0;
    for (index, _) in self.char_indices() {
      if cnt == count {
        return Some(index);
      }
      cnt += 1;
    }
    if cnt == count {
      return Some(self.len());
    }
    None
  }
}

impl<'a> InputTake for &'a str {
  #[inline]
  fn take(&self, count: usize) -> Self {
    &self[..count]
  }

  // return byte index
  #[inline]
  fn take_split(&self, count: usize) -> (Self, Self) {
    (&self[count..], &self[..count])
  }
}

/// Dummy trait used for default implementations (currently only used for `InputTakeAtPosition`).
///
/// When implementing a custom input type, it is possible to use directly the
/// default implementation: if the input type implements `InputLength`, `InputIter`,
/// `InputTake`, `AtEof` and `Clone`, you can implement `UnspecializedInput` and get
/// a default version of `InputTakeAtPosition`.
///
/// For performance reasons, you might want to write a custom implementation of
/// `InputTakeAtPosition` (like the one for `&[u8]`).
pub trait UnspecializedInput {}

use types::CompleteStr;
use types::CompleteByteSlice;

/// methods to take as much input as possible until the provided function returns true for the current element
///
/// a large part of nom's basic parsers are built using this trait
pub trait InputTakeAtPosition: Sized {
  type Item;

  fn split_at_position<P>(&self, predicate: P) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool;
  fn split_at_position1<P>(&self, predicate: P, e: ErrorKind<u32>) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool;
}

impl<T: InputLength + InputIter + InputTake + AtEof + Clone + UnspecializedInput> InputTakeAtPosition for T {
  type Item = <T as InputIter>::RawItem;

  fn split_at_position<P>(&self, predicate: P) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match self.position(predicate) {
      Some(n) => Ok(self.take_split(n)),
      None => {
        if self.at_eof() {
          Ok(self.take_split(self.input_len()))
        } else {
          Err(Err::Incomplete(Needed::Size(1)))
        }
      }
    }
  }

  fn split_at_position1<P>(&self, predicate: P, e: ErrorKind<u32>) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match self.position(predicate) {
      Some(0) => Err(Err::Error(Context::Code(self.clone(), e))),
      Some(n) => Ok(self.take_split(n)),
      None => {
        if self.at_eof() {
          if self.input_len() == 0 {
            Err(Err::Error(Context::Code(self.clone(), e)))
          } else {
            Ok(self.take_split(self.input_len()))
          }
        } else {
          Err(Err::Incomplete(Needed::Size(1)))
        }
      }
    }
  }
}

impl<'a> InputTakeAtPosition for &'a [u8] {
  type Item = u8;

  fn split_at_position<P>(&self, predicate: P) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match (0..self.len()).find(|b| predicate(self[*b])) {
      Some(i) => Ok((&self[i..], &self[..i])),
      None => Err(Err::Incomplete(Needed::Size(1))),
    }
  }

  fn split_at_position1<P>(&self, predicate: P, e: ErrorKind<u32>) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match (0..self.len()).find(|b| predicate(self[*b])) {
      Some(0) => Err(Err::Error(Context::Code(self, e))),
      Some(i) => Ok((&self[i..], &self[..i])),
      None => Err(Err::Incomplete(Needed::Size(1))),
    }
  }
}

impl<'a> InputTakeAtPosition for CompleteByteSlice<'a> {
  type Item = u8;

  fn split_at_position<P>(&self, predicate: P) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match (0..self.0.len()).find(|b| predicate(self.0[*b])) {
      Some(i) => Ok((
        CompleteByteSlice(&self.0[i..]),
        CompleteByteSlice(&self.0[..i]),
      )),
      None => {
        let (i, o) = self.0.take_split(self.0.len());
        Ok((CompleteByteSlice(i), CompleteByteSlice(o)))
      }
    }
  }

  fn split_at_position1<P>(&self, predicate: P, e: ErrorKind<u32>) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match (0..self.0.len()).find(|b| predicate(self.0[*b])) {
      Some(0) => Err(Err::Error(Context::Code(CompleteByteSlice(self.0), e))),
      Some(i) => Ok((
        CompleteByteSlice(&self.0[i..]),
        CompleteByteSlice(&self.0[..i]),
      )),
      None => {
        if self.0.len() == 0 {
          Err(Err::Error(Context::Code(CompleteByteSlice(self.0), e)))
        } else {
          Ok((
            CompleteByteSlice(&self.0[self.0.len()..]),
            CompleteByteSlice(self.0),
          ))
        }
      }
    }
  }
}

impl<'a> InputTakeAtPosition for &'a str {
  type Item = char;

  fn split_at_position<P>(&self, predicate: P) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match self.char_indices().find(|&(_, c)| predicate(c)) {
      Some((i, _)) => Ok((&self[i..], &self[..i])),
      None => Err(Err::Incomplete(Needed::Size(1))),
    }
  }

  fn split_at_position1<P>(&self, predicate: P, e: ErrorKind<u32>) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match self.char_indices().find(|&(_, c)| predicate(c)) {
      Some((0, _)) => Err(Err::Error(Context::Code(self, e))),
      Some((i, _)) => Ok((&self[i..], &self[..i])),
      None => Err(Err::Incomplete(Needed::Size(1))),
    }
  }
}

impl<'a> InputTakeAtPosition for CompleteStr<'a> {
  type Item = char;

  fn split_at_position<P>(&self, predicate: P) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match self.0.char_indices().find(|&(_, c)| predicate(c)) {
      Some((i, _)) => Ok((CompleteStr(&self.0[i..]), CompleteStr(&self.0[..i]))),
      None => {
        let (i, o) = self.0.take_split(self.0.len());
        Ok((CompleteStr(i), CompleteStr(o)))
      }
    }
  }

  fn split_at_position1<P>(&self, predicate: P, e: ErrorKind<u32>) -> IResult<Self, Self, u32>
  where
    P: Fn(Self::Item) -> bool,
  {
    match self.0.char_indices().find(|&(_, c)| predicate(c)) {
      Some((0, _)) => Err(Err::Error(Context::Code(CompleteStr(self.0), e))),
      Some((i, _)) => Ok((CompleteStr(&self.0[i..]), CompleteStr(&self.0[..i]))),
      None => {
        if self.0.len() == 0 {
          Err(Err::Error(Context::Code(CompleteStr(self.0), e)))
        } else {
          let (i, o) = self.0.take_split(self.0.len());
          Ok((CompleteStr(i), CompleteStr(o)))
        }
      }
    }
  }
}

/// indicates wether a comparison was successful, an error, or
/// if more data was needed
#[derive(Debug, PartialEq)]
pub enum CompareResult {
  Ok,
  Incomplete,
  Error,
}

/// abstracts comparison operations
pub trait Compare<T> {
  /// compares self to another value for equality
  fn compare(&self, t: T) -> CompareResult;
  /// compares self to another value for equality
  /// independently of the case.
  ///
  /// warning: for `&str`, the comparison is done
  /// by lowercasing both strings and comparing
  /// the result. This is a temporary solution until
  /// a better one appears
  fn compare_no_case(&self, t: T) -> CompareResult;
}

impl<'a, 'b> Compare<&'b [u8]> for &'a [u8] {
  #[inline(always)]
  fn compare(&self, t: &'b [u8]) -> CompareResult {
    let pos = self.iter().zip(t.iter()).position(|(a, b)| a != b);

    match pos {
      Some(_) => CompareResult::Error,
      None => {
        if self.len() >= t.len() {
          CompareResult::Ok
        } else {
          CompareResult::Incomplete
        }
      }
    }

    /*
    let len = self.len();
    let blen = t.len();
    let m = if len < blen { len } else { blen };
    let reduced = &self[..m];
    let b = &t[..m];

    if reduced != b {
      CompareResult::Error
    } else if m < blen {
      CompareResult::Incomplete
    } else {
      CompareResult::Ok
    }
    */
  }

  #[inline(always)]
  fn compare_no_case(&self, t: &'b [u8]) -> CompareResult {
    let len = self.len();
    let blen = t.len();
    let m = if len < blen { len } else { blen };
    let reduced = &self[..m];
    let other = &t[..m];

    if !reduced.iter().zip(other).all(|(a, b)| match (*a, *b) {
      (0...64, 0...64) | (91...96, 91...96) | (123...255, 123...255) => a == b,
      (65...90, 65...90) | (97...122, 97...122) | (65...90, 97...122) | (97...122, 65...90) => *a | 0b00_10_00_00 == *b | 0b00_10_00_00,
      _ => false,
    }) {
      CompareResult::Error
    } else if m < blen {
      CompareResult::Incomplete
    } else {
      CompareResult::Ok
    }
  }
}

impl<'a, 'b> Compare<&'b str> for &'a [u8] {
  #[inline(always)]
  fn compare(&self, t: &'b str) -> CompareResult {
    self.compare(AsBytes::as_bytes(t))
  }
  #[inline(always)]
  fn compare_no_case(&self, t: &'b str) -> CompareResult {
    self.compare_no_case(AsBytes::as_bytes(t))
  }
}

impl<'a, 'b> Compare<&'b str> for &'a str {
  #[inline(always)]
  fn compare(&self, t: &'b str) -> CompareResult {
    let pos = self.chars().zip(t.chars()).position(|(a, b)| a != b);

    match pos {
      Some(_) => CompareResult::Error,
      None => {
        if self.len() >= t.len() {
          CompareResult::Ok
        } else {
          CompareResult::Incomplete
        }
      }
    }
  }

  //FIXME: this version is too simple and does not use the current locale
  #[cfg(feature = "alloc")]
  #[inline(always)]
  fn compare_no_case(&self, t: &'b str) -> CompareResult {
    let pos = self
      .chars()
      .zip(t.chars())
      .position(|(a, b)| a.to_lowercase().zip(b.to_lowercase()).any(|(a, b)| a != b));

    match pos {
      Some(_) => CompareResult::Error,
      None => {
        if self.len() >= t.len() {
          CompareResult::Ok
        } else {
          CompareResult::Incomplete
        }
      }
    }
  }

  #[cfg(not(feature = "alloc"))]
  #[inline(always)]
  fn compare_no_case(&self, _: &'b str) -> CompareResult {
    unimplemented!()
  }
}

/// look for self in the given input stream
pub trait FindToken<T> {
  fn find_token(&self, token: T) -> bool;
}

impl<'a> FindToken<u8> for &'a [u8] {
  fn find_token(&self, token: u8) -> bool {
    memchr::memchr(token, self).is_some()
  }
}

impl<'a> FindToken<u8> for &'a str {
  fn find_token(&self, token: u8) -> bool {
    self.as_bytes().find_token(token)
  }
}

impl<'a, 'b> FindToken<&'a u8> for &'b [u8] {
  fn find_token(&self, token: &u8) -> bool {
    memchr::memchr(*token, self).is_some()
  }
}

impl<'a, 'b> FindToken<&'a u8> for &'b str {
  fn find_token(&self, token: &u8) -> bool {
    self.as_bytes().find_token(token)
  }
}

impl<'a> FindToken<char> for &'a [u8] {
  fn find_token(&self, token: char) -> bool {
    memchr::memchr(token as u8, self).is_some()
  }
}

impl<'a> FindToken<char> for &'a str {
  fn find_token(&self, token: char) -> bool {
    for i in self.chars() {
      if token == i {
        return true;
      }
    }
    false
  }
}

/// look for a substring in self
pub trait FindSubstring<T> {
  fn find_substring(&self, substr: T) -> Option<usize>;
}

impl<'a, 'b> FindSubstring<&'b [u8]> for &'a [u8] {
  fn find_substring(&self, substr: &'b [u8]) -> Option<usize> {
    let substr_len = substr.len();

    if substr_len == 0 {
      // an empty substring is found at position 0
      // This matches the behavior of str.find("").
      Some(0)
    } else if substr_len == 1 {
      memchr::memchr(substr[0], self)
    } else if substr_len > self.len() {
      None
    } else {
      let max = self.len() - substr_len;
      let mut offset = 0;
      let mut haystack = &self[..];

      while let Some(position) = memchr::memchr(substr[0], haystack) {
        offset += position;

        if offset > max {
          return None;
        }

        if &haystack[position..position + substr_len] == substr {
          return Some(offset);
        }

        haystack = &haystack[position + 1..];
        offset += 1;
      }

      None
    }
  }
}

impl<'a, 'b> FindSubstring<&'b str> for &'a [u8] {
  fn find_substring(&self, substr: &'b str) -> Option<usize> {
    self.find_substring(AsBytes::as_bytes(substr))
  }
}

impl<'a, 'b> FindSubstring<&'b str> for &'a str {
  //returns byte index
  fn find_substring(&self, substr: &'b str) -> Option<usize> {
    self.find(substr)
  }
}

/// used to integrate str's parse() method
pub trait ParseTo<R> {
  fn parse_to(&self) -> Option<R>;
}

impl<'a, R: FromStr> ParseTo<R> for &'a [u8] {
  fn parse_to(&self) -> Option<R> {
    from_utf8(self).ok().and_then(|s| s.parse().ok())
  }
}

impl<'a, R: FromStr> ParseTo<R> for &'a str {
  fn parse_to(&self) -> Option<R> {
    self.parse().ok()
  }
}

/// slicing operations using ranges
///
/// this trait is loosely based on
/// `Index`, but can actually return
/// something else than a `&[T]` or `&str`
pub trait Slice<R> {
  #[inline(always)]
  fn slice(&self, range: R) -> Self;
}

macro_rules! impl_fn_slice {
    ( $ty:ty ) => {
        fn slice(&self, range:$ty) -> Self {
            &self[range]
        }
    }
}

macro_rules! slice_range_impl {
    ( [ $for_type:ident ], $ty:ty ) => {
        impl<'a, $for_type> Slice<$ty> for &'a [$for_type] {
            impl_fn_slice!( $ty );
        }
    };
    ( $for_type:ty, $ty:ty ) => {
        impl<'a> Slice<$ty> for &'a $for_type {
            impl_fn_slice!( $ty );
        }
    }
}

macro_rules! slice_ranges_impl {
    ( [ $for_type:ident ] ) => {
        slice_range_impl! {[$for_type], Range<usize>}
        slice_range_impl! {[$for_type], RangeTo<usize>}
        slice_range_impl! {[$for_type], RangeFrom<usize>}
        slice_range_impl! {[$for_type], RangeFull}
    };
    ( $for_type:ty ) => {
        slice_range_impl! {$for_type, Range<usize>}
        slice_range_impl! {$for_type, RangeTo<usize>}
        slice_range_impl! {$for_type, RangeFrom<usize>}
        slice_range_impl! {$for_type, RangeFull}
    }
}

slice_ranges_impl! {str}
slice_ranges_impl! {[T]}

/// indicates whether more data can come later in input
///
/// When working with complete data, like a file that was entirely loaded
/// in memory, you should use input types like `CompleteByteSlice` and
/// `CompleteStr` to wrap the data.  The `at_eof` method of those types
/// always returns true, thus indicating to nom that it should not handle
/// partial data cases.
///
/// When working will partial data, like data coming from the network in
/// buffers, the `at_eof` method can indicate if we expect more data to come,
/// and let nom know that some parsers could still handle more data
pub trait AtEof {
  fn at_eof(&self) -> bool;
}

pub fn need_more<I: AtEof, O, E>(input: I, needed: Needed) -> IResult<I, O, E> {
  if input.at_eof() {
    Err(Err::Error(Context::Code(input, ErrorKind::Eof)))
  } else {
    Err(Err::Incomplete(needed))
  }
}

pub fn need_more_err<I: AtEof, O, E>(input: I, needed: Needed, err: ErrorKind<E>) -> IResult<I, O, E> {
  if input.at_eof() {
    Err(Err::Error(Context::Code(input, err)))
  } else {
    Err(Err::Incomplete(needed))
  }
}

// Tuple for bit parsing
impl<I: AtEof, T> AtEof for (I, T) {
  fn at_eof(&self) -> bool {
    self.0.at_eof()
  }
}

impl<'a, T> AtEof for &'a [T] {
  fn at_eof(&self) -> bool {
    false
  }
}

impl<'a> AtEof for &'a str {
  fn at_eof(&self) -> bool {
    false
  }
}

macro_rules! array_impls {
  ($($N:expr)+) => {
    $(
      impl InputLength for [u8; $N] {
        #[inline]
        fn input_len(&self) -> usize {
          self.len()
        }
      }

      impl<'a> InputLength for &'a [u8; $N] {
        #[inline]
        fn input_len(&self) -> usize {
          self.len()
        }
      }

      impl<'a> Compare<[u8; $N]> for &'a [u8] {
        #[inline(always)]
        fn compare(&self, t: [u8; $N]) -> CompareResult {
          self.compare(&t[..])
        }

        #[inline(always)]
        fn compare_no_case(&self, t: [u8;$N]) -> CompareResult {
          self.compare_no_case(&t[..])
        }
      }

      impl<'a,'b> Compare<&'b [u8; $N]> for &'a [u8] {
        #[inline(always)]
        fn compare(&self, t: &'b [u8; $N]) -> CompareResult {
          self.compare(&t[..])
        }

        #[inline(always)]
        fn compare_no_case(&self, t: &'b [u8;$N]) -> CompareResult {
          self.compare_no_case(&t[..])
        }
      }

      impl FindToken<u8> for [u8; $N] {
        fn find_token(&self, token: u8) -> bool {
          memchr::memchr(token, &self[..]).is_some()
        }
      }

      impl<'a> FindToken<&'a u8> for [u8; $N] {
        fn find_token(&self, token: &u8) -> bool {
          memchr::memchr(*token, &self[..]).is_some()
        }
      }
    )+
  };
}

array_impls! {
     0  1  2  3  4  5  6  7  8  9
    10 11 12 13 14 15 16 17 18 19
    20 21 22 23 24 25 26 27 28 29
    30 31 32
}

/// abtracts something which can extend an `Extend`
pub trait ExtendInto {
  type Item;
  type Extender: Extend<Self::Item>;

  /// create a new `Extend` of the correct type
  #[inline]
  fn new_builder(&self) -> Self::Extender;
  /// accumulate the input into an accumulator
  #[inline]
  fn extend_into(&self, acc: &mut Self::Extender);
}

#[cfg(feature = "alloc")]
impl ExtendInto for [u8] {
  type Item = u8;
  type Extender = Vec<u8>;

  #[inline]
  fn new_builder(&self) -> Vec<u8> {
    Vec::new()
  }
  #[inline]
  fn extend_into(&self, acc: &mut Vec<u8>) {
    acc.extend(self.iter().cloned());
  }
}

#[cfg(feature = "alloc")]
impl ExtendInto for str {
  type Item = char;
  type Extender = String;

  #[inline]
  fn new_builder(&self) -> String {
    String::new()
  }
  #[inline]
  fn extend_into(&self, acc: &mut String) {
    acc.push_str(self);
  }
}

#[cfg(feature = "alloc")]
impl ExtendInto for char {
  type Item = char;
  type Extender = String;

  #[inline]
  fn new_builder(&self) -> String {
    String::new()
  }
  #[inline]
  fn extend_into(&self, acc: &mut String) {
    acc.push(*self);
  }
}

#[cfg(test)]
mod tests {
  use super::*;

  #[test]
  fn test_offset_u8() {
    let s = b"abcd123";
    let a = &s[..];
    let b = &a[2..];
    let c = &a[..4];
    let d = &a[3..5];
    assert_eq!(a.offset(b), 2);
    assert_eq!(a.offset(c), 0);
    assert_eq!(a.offset(d), 3);
  }

  #[test]
  fn test_offset_str() {
    let s = "abcřèÂßÇd123";
    let a = &s[..];
    let b = &a[7..];
    let c = &a[..5];
    let d = &a[5..9];
    assert_eq!(a.offset(b), 7);
    assert_eq!(a.offset(c), 0);
    assert_eq!(a.offset(d), 5);
  }
}