Trait

com.nexthink.utils.parsing.combinator.completion.CompletionSupport

CombinableParser

Related Doc: package CompletionSupport

Permalink

trait CombinableParser[+T, P[+R] <: CombinableParser[R, P]] extends AnyRef

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

Abstract Value Members

  1. abstract def %(tag: CompletionSupport.CompletionTag): P[T]

    Permalink

    An operator to specify the completion tag

    An operator to specify the completion tag

    tag

    the completion tag

    returns

    wrapper Parser instance specifying completion tag

  2. abstract def %(tag: String, tagScore: Int, tagDescription: String, tagMeta: JValue): P[T]

    Permalink

    An operator to specify the completion tag, score, description and meta of a parser

    An operator to specify the completion tag, score, description and meta of a parser

    tag

    the completion tag

    tagScore

    the completion tag score

    tagDescription

    the completion tag description

    tagMeta

    the completion tag meta

    returns

    wrapper Parser instance specifying completion tag

  3. abstract def %(tag: String, tagScore: Int, tagDescription: String): P[T]

    Permalink

    An operator to specify the completion tag, score and description of a parser

    An operator to specify the completion tag, score and description of a parser

    tag

    the completion tag

    tagScore

    the completion tag score

    tagDescription

    the completion tag description

    returns

    wrapper Parser instance specifying completion tag

  4. abstract def %(tag: String, tagScore: Int): P[T]

    Permalink

    An operator to specify the completion tag and score of a parser

    An operator to specify the completion tag and score of a parser

    tag

    the completion tag

    tagScore

    the completion tag score

    returns

    wrapper Parser instance specifying the completion tag

  5. abstract def %(tagScore: Int): P[T]

    Permalink

    An operator to specify the completions tag score of a parser (0 by default)

    An operator to specify the completions tag score of a parser (0 by default)

    tagScore

    the completion tag score (to be used e.g. to order sections in a completion menu)

    returns

    wrapper Parser instance specifying the completion tag score

  6. abstract def %(tag: String): P[T]

    Permalink

    An operator to specify the completion tag of a parser (empty tag by default)

    An operator to specify the completion tag of a parser (empty tag by default)

    tag

    the completion tag (to be used e.g. to structure a completion menu)

    returns

    wrapper Parser instance specifying the completion tag

  7. abstract def %%(tagMeta: JValue): P[T]

    Permalink

    An operator to specify the completion tag meta-data of a parser in JSON format (empty by default).

    An operator to specify the completion tag meta-data of a parser in JSON format (empty by default). JSON meta-data is automatically merged when combining two equivalent tags (i.e. bearing the same label, but with a different payload). This allows for more flexibility when defining the grammar: various parsers can return the same completion tags with an additive effect on the meta-data (and the entries).

    tagMeta

    the JValue for completion tag meta-data (to be used e.g. to specify the visual style for a completion tag in the menu)

    returns

    wrapper Parser instance specifying the completion tag meta-data

  8. abstract def %%%(globalMeta: JValue): P[T]

    Permalink

    An operator to specify the meta-data for the whole set of completions (empty by default) Note that if the meta-data is encoded in JSON, it is automatically merged when combining multiple completion sets.

    An operator to specify the meta-data for the whole set of completions (empty by default) Note that if the meta-data is encoded in JSON, it is automatically merged when combining multiple completion sets. This allows for more flexibility when defining the grammar: various parsers can define the global completion meta-data with an additive effect.

    globalMeta

    the JValue for completions meta-data (to be used e.g. to specify the visual style for the completion menu)

    returns

    wrapper Parser instance specifying the completions meta-data

  9. abstract def %-%(meta: JValue): P[T]

    Permalink

    An operator to specify the meta-data for completions of a parser (empty by default).

    An operator to specify the meta-data for completions of a parser (empty by default). Note that meta-data is merged with comma separations when combining two equivalent entries.

    meta

    the completion meta-data (to be used e.g. to specify the visual style for a completion entry in the menu)

    returns

    wrapper Parser instance specifying the completion meta-data

  10. abstract def %>(completions: CompletionSupport.CompletionSet): P[T]

    Permalink

    An operator to specify completions of a parser

    An operator to specify completions of a parser

    completions

    possible completions for this parser

    returns

    a Parser that upon invocation of the completions method returns the passed completions

  11. abstract def %>(completion: CompletionSupport.Completion): P[T]

    Permalink

    An operator to specify completion of a parser

    An operator to specify completion of a parser

    completion

    completion for this parser

    returns

    a Parser that upon invocation of the completions method returns the passed completion

  12. abstract def %>(completions: CompletionSupport.Elems*): P[_]

    Permalink

    An operator to specify completions of a parser

    An operator to specify completions of a parser

    completions

    possible completions for this parser

    returns

    a Parser that upon invocation of the completions method returns the passed completions

  13. abstract def %?(tagDescription: String): P[T]

    Permalink

    An operator to specify the completion tag description of a parser (empty by default)

    An operator to specify the completion tag description of a parser (empty by default)

    tagDescription

    the completion description (to be used e.g. to add information to a completion entry)

    returns

    wrapper Parser instance specifying the completion description

  14. abstract def *[U >: T](sep: ⇒ P[(U, U) ⇒ U]): P[U]

    Permalink

    Returns a parser that repeatedly parses what this parser parses, interleaved with the sep parser.

    Returns a parser that repeatedly parses what this parser parses, interleaved with the sep parser. The sep parser specifies how the results parsed by this parser should be combined.

    returns

    chainl1(this, sep)

  15. abstract def *(): P[List[T]]

    Permalink

    Returns a parser that repeatedly parses what this parser parses.

    Returns a parser that repeatedly parses what this parser parses.

    returns

    rep(this)

  16. abstract def +(): P[List[T]]

    Permalink

    Returns a parser that repeatedly (at least once) parses what this parser parses.

    Returns a parser that repeatedly (at least once) parses what this parser parses.

    returns

    rep1(this)

  17. abstract def <~[U](q: ⇒ P[U]): P[T]

    Permalink

    A parser combinator for sequential composition which keeps only the left result.

    A parser combinator for sequential composition which keeps only the left result.

    p <~ q succeeds if p succeeds and q succeeds on the input left over by p.

    q

    a parser that will be executed after p (this parser) succeeds -- evaluated at most once, and only when necessary

    returns

    a Parser that -- on success -- returns the result of p.

    Note

    <~ has lower operator precedence than ~ or ~>.

  18. abstract def <~![U](q: ⇒ P[U]): P[T]

    Permalink

    A parser combinator for non-back-tracking sequential composition which only keeps the left result.

    A parser combinator for non-back-tracking sequential composition which only keeps the left result.

    p <~! q succeeds if p succeds and q succeds on the input left over by p. In case of failure, no back-tracking is performed (in an earlier parser produced by the | combinator).

    q

    a parser that will be executed after p (this parser) succeeds -- evaluated at most once, and only when necessary

    returns

    a Parser that -- on success -- reutrns the result of p. The resulting parser fails if either p or q fails, this failure is fatal.

  19. abstract def >>[U](fq: (T) ⇒ P[U]): P[U]

    Permalink

    Returns into(fq).

  20. abstract def ?(): P[Option[T]]

    Permalink

    Returns a parser that optionally parses what this parser parses.

    Returns a parser that optionally parses what this parser parses.

    returns

    opt(this)

  21. abstract def ^?[U](f: PartialFunction[T, U]): P[U]

    Permalink

    A parser combinator for partial function application.

    A parser combinator for partial function application.

    p ^? f succeeds if p succeeds AND f is defined at the result of p; in that case, it returns f applied to the result of p.

    f

    a partial function that will be applied to this parser's result (see mapPartial in ParseResult).

    returns

    a parser that succeeds if the current parser succeeds and f is applicable to the result. If so, the result will be transformed by f.

  22. abstract def ^?[U](f: PartialFunction[T, U], error: (T) ⇒ String): P[U]

    Permalink

    A parser combinator for partial function application.

    A parser combinator for partial function application.

    p ^? (f, error) succeeds if p succeeds AND f is defined at the result of p; in that case, it returns f applied to the result of p. If f is not applicable, error(the result of p) should explain why.

    f

    a partial function that will be applied to this parser's result (see mapPartial in ParseResult).

    error

    a function that takes the same argument as f and produces an error message to explain why f wasn't applicable

    returns

    a parser that succeeds if the current parser succeeds and f is applicable to the result. If so, the result will be transformed by f.

  23. abstract def ^^[U](f: (T) ⇒ U): P[U]

    Permalink

    A parser combinator for function application.

    A parser combinator for function application.

    p ^^ f succeeds if p succeeds; it returns f applied to the result of p.

    f

    a function that will be applied to this parser's result (see map in ParseResult).

    returns

    a parser that has the same behaviour as the current parser, but whose result is transformed by f.

  24. abstract def ^^^[U](v: ⇒ U): P[U]

    Permalink

    A parser combinator that changes a successful result into the specified value.

    A parser combinator that changes a successful result into the specified value.

    p ^^^ v succeeds if p succeeds; discards its result, and returns v instead.

    v

    The new result for the parser, evaluated at most once (if p succeeds), not evaluated at all if p fails.

    returns

    a parser that has the same behaviour as the current parser, but whose successful result is v

  25. abstract def filter(p: (T) ⇒ Boolean): P[T]

    Permalink
  26. abstract def flatMap[U](f: (T) ⇒ P[U]): P[U]

    Permalink
  27. abstract def into[U](fq: (T) ⇒ P[U]): P[U]

    Permalink

    A parser combinator that parameterizes a subsequent parser with the result of this one.

    A parser combinator that parameterizes a subsequent parser with the result of this one.

    Use this combinator when a parser depends on the result of a previous parser. p should be a function that takes the result from the first parser and returns the second parser.

    p into fq (with fq typically {x => q}) first applies p, and then, if p successfully returned result r, applies fq(r) to the rest of the input.

    From: G. Hutton. Higher-order functions for parsing. J. Funct. Program., 2(3):323--343, 1992.

    fq

    a function that, given the result from this parser, returns the second parser to be applied

    returns

    a parser that succeeds if this parser succeeds (with result x) and if then fq(x) succeeds

    Example:
    1. def perlRE = "m" ~> (".".r into (separator => """[^%s]*""".format(separator).r <~ separator))
  28. abstract def map[U](f: (T) ⇒ U, fc: (CompletionSupport.Completions) ⇒ CompletionSupport.Completions): P[U]

    Permalink
  29. abstract def map[U](f: (T) ⇒ U): P[U]

    Permalink
  30. abstract def mapCompletions(fc: (CompletionSupport.Completions) ⇒ CompletionSupport.Completions): P[T]

    Permalink
  31. abstract def topCompletions(n: Int): P[T]

    Permalink

    Limits completions to the top n completions ordered by their score

    Limits completions to the top n completions ordered by their score

    n

    the limit

    returns

    wrapper Parser instance limiting the number of completions

  32. abstract def withErrorMessage(msg: String): P[T]

    Permalink

    Changes the failure message produced by a parser.

    Changes the failure message produced by a parser.

    This doesn't change the behavior of a parser on neither success nor error, just on failure. The semantics are slightly different than those obtained by doing | failure(msg), in that the message produced by this method will always

    replace the message produced, which is not guaranteed by that idiom.

    For example, parser p below will always produce the designated failure message, while q will not produce

    it if sign is parsed but number is not.

    def p = sign.? ~ number withFailureMessage  "Number expected!"
    def q = sign.? ~ number | failure("Number expected!")
    msg

    The message that will replace the default failure message.

    returns

    A parser with the same properties and different failure message.

  33. abstract def withFailureMessage(msg: String): P[T]

    Permalink

    Changes the failure message produced by a parser.

    Changes the failure message produced by a parser.

    This doesn't change the behavior of a parser on neither success nor error, just on failure. The semantics are slightly different than those obtained by doing | failure(msg), in that the message produced by this method will always replace the message produced, which is not guaranteed by that idiom.

    For example, parser p below will always produce the designated failure message, while q will not produce it if sign is parsed but number is not.

       def p = sign.? ~ number withFailureMessage  "Number expected!"
    def q = sign.? ~ number | failure("Number expected!")
    msg

    The message that will replace the default failure message.

    returns

    A parser with the same properties and different failure message.

  34. abstract def withFilter(p: (T) ⇒ Boolean): P[T]

    Permalink
  35. abstract def |[U >: T](q: ⇒ P[U]): P[U]

    Permalink

    A parser combinator for alternative composition.

    A parser combinator for alternative composition.

    p | q succeeds if p succeeds or q succeeds. Note that q is only tried if ps failure is non-fatal (i.e., back-tracking is allowed).

    q

    a parser that will be executed if p (this parser) fails (and allows back-tracking)

    returns

    a Parser that returns the result of the first parser to succeed (out of p and q) The resulting parser succeeds if (and only if)

    • p succeeds, or
    • if p fails allowing back-tracking and q succeeds.
  36. abstract def |||[U >: T](q: ⇒ P[U]): P[U]

    Permalink

    A parser combinator for alternative with longest match composition.

    A parser combinator for alternative with longest match composition.

    p ||| q succeeds if p succeeds or q succeeds. If p and q both succeed, the parser that consumed the most characters accepts.

    q

    a parser that accepts if p consumes less characters. -- evaluated at most once, and only when necessary

    returns

    a Parser that returns the result of the parser consuming the most characters (out of p and q).

  37. abstract def ~[U](q: ⇒ P[U]): P[CompletionSupport.~[T, U]]

    Permalink

    A parser combinator for sequential composition.

    A parser combinator for sequential composition.

    p ~ q succeeds if p succeeds and q succeeds on the input left over by p.

    q

    a parser that will be executed after p (this parser) succeeds -- evaluated at most once, and only when necessary.

    returns

    a Parser that -- on success -- returns a ~ (like a Pair, but easier to pattern match on) that contains the result of p and that of q. The resulting parser fails if either p or q fails.

  38. abstract def ~![U](q: ⇒ P[U]): P[CompletionSupport.~[T, U]]

    Permalink

    A parser combinator for non-back-tracking sequential composition.

    A parser combinator for non-back-tracking sequential composition.

    p ~! q succeeds if p succeeds and q succeeds on the input left over by p. In case of failure, no back-tracking is performed (in an earlier parser produced by the | combinator).

    q

    a parser that will be executed after p (this parser) succeeds

    returns

    a Parser that -- on success -- returns a ~ (like a Pair, but easier to pattern match on) that contains the result of p and that of q. The resulting parser fails if either p or q fails, this failure is fatal.

  39. abstract def ~>[U](q: ⇒ P[U]): P[U]

    Permalink

    A parser combinator for sequential composition which keeps only the right result.

    A parser combinator for sequential composition which keeps only the right result.

    p ~> q succeeds if p succeeds and q succeeds on the input left over by p.

    q

    a parser that will be executed after p (this parser) succeeds -- evaluated at most once, and only when necessary.

    returns

    a Parser that -- on success -- returns the result of q.

  40. abstract def ~>![U](q: ⇒ P[U]): P[U]

    Permalink

    A parser combinator for non-back-tracking sequential composition which only keeps the right result.

    A parser combinator for non-back-tracking sequential composition which only keeps the right result.

    p ~>! q succeeds if p succeds and q succeds on the input left over by p. In case of failure, no back-tracking is performed (in an earlier parser produced by the | combinator).

    q

    a parser that will be executed after p (this parser) succeeds -- evaluated at most once, and only when necessary

    returns

    a Parser that -- on success -- reutrns the result of q. The resulting parser fails if either p or q fails, this failure is fatal.

Concrete 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. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  16. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  17. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped