Packages

object LongNumber extends NumberMatcher[Long]

A PathMatcher that efficiently matches a number of digits and extracts their (non-negative) Long value. The matcher will not match 0 digits or a sequence of digits that would represent an Long value larger than Long.MaxValue.

Source
PathMatcher.scala
Linear Supertypes
NumberMatcher[Long], PathMatcher[(Long)], (Path) ⇒ Matching[(Long)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LongNumber
  2. NumberMatcher
  3. PathMatcher
  4. Function1
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. def /[R](other: PathMatcher[R])(implicit join: Join[(Long), R]): PathMatcher[Out]
    Definition Classes
    PathMatcher
  2. def /: PathMatcher[(Long)]
    Definition Classes
    PathMatcher
  3. def andThen[A](g: (Matching[(Long)]) ⇒ A): (Path) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  4. def apply(path: Path): Matching[(Long)]
    Definition Classes
    NumberMatcher → Function1
  5. def compose[A](g: (A) ⇒ Path): (A) ⇒ Matching[(Long)]
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  6. implicit val ev: Tuple[(Long)]
    Definition Classes
    PathMatcher
  7. def fromChar(c: Char): Long
    Definition Classes
    LongNumber → NumberMatcher
  8. def fromDecimalChar(c: Char): Long
    Definition Classes
    NumberMatcher
  9. def fromHexChar(c: Char): Long
    Definition Classes
    NumberMatcher
  10. val maxDivBase: Long
    Definition Classes
    NumberMatcher
  11. val minusOne: Long
    Definition Classes
    NumberMatcher
  12. def repeat(min: Int, max: Int, separator: PathMatcher0 = PathMatchers.Neutral)(implicit lift: Lift[(Long), List]): PathMatcher[Out]

    Turns this PathMatcher into one that matches a number of times (with the given separator) and potentially extracts a List of the underlying matcher's extractions.

    Turns this PathMatcher into one that matches a number of times (with the given separator) and potentially extracts a List of the underlying matcher's extractions. If less than min applications of the underlying matcher have succeeded the produced matcher fails, otherwise it matches up to the given max number of applications. Note that it won't fail even if more than max applications could succeed! The "surplus" path elements will simply be left unmatched.

    The result type depends on the type of the underlying matcher:

    If a `matcher` is of typethen `matcher.repeat(...)` is of type
    `PathMatcher0``PathMatcher0`
    `PathMatcher1[T]``PathMatcher1[List[T]`
    `PathMatcher[L :Tuple]``PathMatcher[List[L]]`

    Definition Classes
    PathMatcher
  13. def repeat(count: Int, separator: PathMatcher0)(implicit lift: Lift[(Long), List]): PathMatcher[Out]

    Same as repeat(min = count, max = count, separator = separator).

    Same as repeat(min = count, max = count, separator = separator).

    Definition Classes
    PathMatcher
  14. def repeat(count: Int)(implicit lift: Lift[(Long), List]): PathMatcher[Out]

    Same as repeat(min = count, max = count).

    Same as repeat(min = count, max = count).

    Definition Classes
    PathMatcher
  15. def tflatMap[R](f: ((Long)) ⇒ Option[R])(implicit arg0: Tuple[R]): PathMatcher[R]
    Definition Classes
    PathMatcher
  16. def tmap[R](f: ((Long)) ⇒ R)(implicit arg0: Tuple[R]): PathMatcher[R]
    Definition Classes
    PathMatcher
  17. def toString(): String
    Definition Classes
    Function1 → AnyRef → Any
  18. def transform[R](f: (Matching[(Long)]) ⇒ Matching[R])(implicit arg0: Tuple[R]): PathMatcher[R]
    Definition Classes
    PathMatcher
  19. def unary_!(): PathMatcher0
    Definition Classes
    PathMatcher
  20. def |[R >: (Long)](other: PathMatcher[_ <: R])(implicit arg0: Tuple[R]): PathMatcher[R]
    Definition Classes
    PathMatcher
  21. def ~[R](other: PathMatcher[R])(implicit join: Join[(Long), R]): PathMatcher[Out]
    Definition Classes
    PathMatcher