object HexLongNumber extends NumberMatcher[Long]
A PathMatcher that efficiently matches a number of hex-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
- Alphabetic
- By Inheritance
- HexLongNumber
- NumberMatcher
- PathMatcher
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def /[R](other: PathMatcher[R])(implicit join: Join[(Long), R]): PathMatcher[Out]
Alias for slash.
Alias for slash.
- Definition Classes
- PathMatcher
- def /: PathMatcher[(Long)]
Alias for slash.
Alias for slash.
- Definition Classes
- PathMatcher
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def andThen[A](g: (Matching[(Long)]) => A): (Path) => A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def append[R](other: PathMatcher[R])(implicit join: Join[(Long), R]): PathMatcher[Out]
- Definition Classes
- PathMatcher
- def apply(path: Path): Matching[(Long)]
- Definition Classes
- NumberMatcher → Function1
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- def compose[A](g: (A) => Path): (A) => Matching[(Long)]
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- implicit val ev: Tuple[(Long)]
- Definition Classes
- PathMatcher
- def fromChar(c: Char): Long
- Definition Classes
- HexLongNumber → NumberMatcher
- def fromDecimalChar(c: Char): Long
- Definition Classes
- NumberMatcher
- def fromHexChar(c: Char): Long
- Definition Classes
- NumberMatcher
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val maxDivBase: Long
- Definition Classes
- NumberMatcher
- val minusOne: Long
- Definition Classes
- NumberMatcher
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def or[R >: (Long)](other: PathMatcher[_ <: R])(implicit arg0: Tuple[R]): PathMatcher[R]
- Definition Classes
- PathMatcher
- def repeat(min: Int, max: Int, separator: PathMatcher0 = PathMatchers.Neutral)(implicit lift: Lift[(Long), List]): PathMatcher[Out]
Turns this
PathMatcherinto one that matches a number of times (with the given separator) and potentially extracts aListof the underlying matcher's extractions.Turns this
PathMatcherinto one that matches a number of times (with the given separator) and potentially extracts aListof the underlying matcher's extractions. If less thanminapplications of the underlying matcher have succeeded the produced matcher fails, otherwise it matches up to the givenmaxnumber of applications. Note that it won't fail even if more thanmaxapplications 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 type then `matcher.repeat(...)` is of type `PathMatcher0` `PathMatcher0` `PathMatcher1[T]` `PathMatcher1[List[T]` `PathMatcher[L :Tuple]` `PathMatcher[List[L]]` - Definition Classes
- PathMatcher
- 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
- 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
- def slash[R](other: PathMatcher[R])(implicit join: Join[(Long), R]): PathMatcher[Out]
- Definition Classes
- PathMatcher
- def slash: PathMatcher[(Long)]
- Definition Classes
- PathMatcher
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tflatMap[R](f: ((Long)) => Option[R])(implicit arg0: Tuple[R]): PathMatcher[R]
- Definition Classes
- PathMatcher
- def tmap[R](f: ((Long)) => R)(implicit arg0: Tuple[R]): PathMatcher[R]
- Definition Classes
- PathMatcher
- def toString(): String
- Definition Classes
- Function1 → AnyRef → Any
- def transform[R](f: (Matching[(Long)]) => Matching[R])(implicit arg0: Tuple[R]): PathMatcher[R]
- Definition Classes
- PathMatcher
- def unary_!: PathMatcher0
Operator alternative to PathMatchers.not
Operator alternative to PathMatchers.not
- Definition Classes
- PathMatcher
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def |[R >: (Long)](other: PathMatcher[_ <: R])(implicit arg0: Tuple[R]): PathMatcher[R]
Alias for or.
Alias for or.
- Definition Classes
- PathMatcher
- def ~[R](other: PathMatcher[R])(implicit join: Join[(Long), R]): PathMatcher[Out]
Alias for append.
Alias for append.
- Definition Classes
- PathMatcher