PathMatcher

pl.iterators.stir.server.PathMatcher

See thePathMatcher companion object

abstract class PathMatcher[L](implicit val ev: Tuple[L]) extends Path => Matching[L]

A PathMatcher tries to match a prefix of a given string and returns either a PathMatcher.Matched instance if matched, otherwise PathMatcher.Unmatched.

Attributes

Companion: object
Source: PathMatcher.scala
Graph
Supertypes: trait Path => Matching[L]

class Object

trait Matchable

class Any
Known subtypes: class NumberMatcher[T]

object HexIntNumber

object HexLongNumber

object IntNumber

object LongNumber

object PathEnd

object Remaining

object RemainingPath

object Segment

object Slash
Show all
Self type: PathMatcher[L]

Members list

Value members

Concrete methods

Alias for slash.

Attributes

Source: PathMatcher.scala

Alias for slash.

Attributes

Source: PathMatcher.scala

Implicitly added by EnhancedPathMatcher

Attributes

Source: PathMatcher.scala

Attributes

Source: PathMatcher.scala

Implicitly added by EnhancedPathMatcher

Attributes

Source: PathMatcher.scala

Attributes

Source: PathMatcher.scala

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

Attributes

Source: PathMatcher.scala

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

Attributes

Source: PathMatcher.scala

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 type	then `matcher.repeat(...)` is of type
`PathMatcher0`	`PathMatcher0`
`PathMatcher1[T]`	`PathMatcher1[List[T]`
`PathMatcher[L :Tuple]`	`PathMatcher[List[L]]`