Object

scala.meta.internal.fastparse.parsers

Intrinsics

Related Doc: package parsers

Permalink

object Intrinsics

High-performance intrinsics for parsing common patterns. All of these have equivalent to constructs that can be put together using a combination of "string"s, p1 | p2, and p.rep, but much faster or more convenient.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Intrinsics
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. case class ElemIn[Elem, Repr](name: String, strings: Seq[Seq[Elem]])(implicit repr: ReprOps[Elem, Repr], ehelper: ElemSetHelper[Elem]) extends ElemSet[Elem, Repr] with Product with Serializable

    Permalink

    Parses a single character if its contained in the lists of allowed characters

  2. case class ElemPred[Elem, Repr](name: String, predicate: (Elem) ⇒ Boolean, precompute: Boolean)(implicit helper: ElemSetHelper[Elem], repr: ReprOps[Elem, Repr]) extends ElemSet[Elem, Repr] with Product with Serializable

    Permalink

    Parses a single character if it passes the predicate

  3. abstract class ElemSet[Elem, Repr] extends PrecomputableParser[Elem, Repr]

    Permalink

  4. case class ElemsWhile[Elem, Repr](name: String, predicate: (Elem) ⇒ Boolean, min: Int = 1, precompute: Boolean)(implicit helper: ElemSetHelper[Elem], repr: ReprOps[Elem, Repr]) extends PrecomputableParser[Elem, Repr] with WhileParser[Elem, Repr] with Product with Serializable

    Permalink

    Keeps consuming characters until the predicate predicate becomes false.

    Keeps consuming characters until the predicate predicate becomes false. Functionally equivalent to using .rep and ElemPred, but much faster.

  5. case class ElemsWhileIn[Elem, Repr](name: String, strings: Seq[Seq[Elem]], min: Int = 1)(implicit helper: ElemSetHelper[Elem], repr: ReprOps[Elem, Repr]) extends PrecomputableParser[Elem, Repr] with WhileParser[Elem, Repr] with Product with Serializable

    Permalink

    Keeps consuming characters as long as they are within strings

  6. type GenOrPred[Elem] = util.Either[Generator[Elem], (Elem) ⇒ Boolean]

    Permalink

  7. abstract class PrecomputableParser[Elem, Repr] extends Parser[Unit, Elem, Repr]

    Permalink

  8. case class StringIn[Elem, Repr](strings: Repr*)(implicit repr: ReprOps[Elem, Repr], helper: ElemSetHelper[Elem], ordering: Ordering[Elem]) extends StringInBase[Elem, Repr] with Product with Serializable

    Permalink

  9. class StringInBase[Elem, Repr] extends Parser[Unit, Elem, Repr]

    Permalink

    Very efficiently attempts to parse a set of strings, by first converting it into an array-backed Trie and then walking it once.

    Very efficiently attempts to parse a set of strings, by first converting it into an array-backed Trie and then walking it once. If multiple strings match the input, longest match wins.

  10. case class StringInIgnoreCase[Elem, Repr](strings: Repr*)(implicit repr: ReprOps[Elem, Repr], helper: ElemSetHelper[Elem], ordering: Ordering[Elem]) extends StringInBase[Elem, Repr] with Product with Serializable

    Permalink

  11. trait WhileParser[Elem, Repr] extends Parser[Unit, Elem, Repr]

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. def flattenStringsGen[Elem](items: Seq[Seq[Elem]]): Iter[Elem]

    Permalink

  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. def makeGenOrPred[Elem](predicate: (Elem) ⇒ Boolean, precompute: Boolean)(implicit helper: ElemSetHelper[Elem]): GenOrPred[Elem]

    Permalink

  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. def prettyPrintStrings[Elem, Repr](name: String, strings: Seq[Seq[Elem]])(implicit repr: ReprOps[Elem, Repr]): String

    Permalink

  18. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  19. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  20. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  21. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  22. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped