Packages

  • package root
    Definition Classes
    root
  • package parsley
    Definition Classes
    root
  • package errors

    This package contains various functionality relating to the generation and formatting of error messages.

    This package contains various functionality relating to the generation and formatting of error messages.

    In particular, it includes a collection of combinators for improving error messages within the parser, including labelling and providing additional information. It also contains combinators that can be used to valid data produced by a parser, to ensure it conforms to expected invariances, producing good quality error messages if this is not the case. Finally, this package contains ways of changing the formatting of error messages: this can either be changing how the default String-based errors are formatted, or by injectiing Parsley's errors into a custom error object.

    Definition Classes
    parsley
  • package expr

    This package contains various functionality relating to the parsing of expressions..

    This package contains various functionality relating to the parsing of expressions..

    This includes the "chain" combinators, which tackle the left-recursion problem and allow for the parsing and combining of operators with values. It also includes functionality for constructing larger precedence tables, which may even vary the type of each layer in the table, allowing for strongly-typed expression parsing.

    Definition Classes
    parsley
  • package implicits

    This package contains various functionality that involve Scala's implicits mechanism.

    This package contains various functionality that involve Scala's implicits mechanism.

    This includes conversions from scala literals into parsers, as well as enabling new syntax on regular Scala values (such as Parsley's lift or zipped syntax). Automatic conversion to Parsley[Unit] is also supported within this package.

    Definition Classes
    parsley
  • Failure
  • Parsley
  • Result
  • Success
  • ap
  • character
  • combinator
  • debug
  • extension
  • genericbridges
  • io
  • lift
  • registers
  • package token

    This package provides a wealth of functionality for performing common lexing tasks.

    This package provides a wealth of functionality for performing common lexing tasks.

    It is organised as follows:

    • the main parsing functionality is accessed via Lexer, which provides implementations for the combinators found in the sub-packages given a LexicalDesc.
    • the descriptions sub-package is how a lexical structure can be described, providing the configuration that alters the behaviour of the parsers produced by the Lexer.
    • the other sub-packages contain the high-level interfaces that the Lexer exposes, which can be used to pass whitespace-aware and non-whitespace-aware combinators around in a uniform way.
    • the predicate module contains functionality to help define boolean predicates on characters or unicode codepoints.
    Definition Classes
    parsley
o

parsley

lift

object lift

This module contains lift1 through lift22, which allow for the application of a function of arity N to N parsers.

The combinators contained in this module all sequence a number of parsers together, but are capable of combining the results generated by these parsers into a single value with a given function of the correct arity. This is a clean way of putting together multiple parsers and getting a meaningful result out.

Source
lift.scala
Example: 

  1. scala> import parsley.character.char
scala> import parsley.lift.{lift2, lift3}
scala> case class Add(x: Int, y: Int)
scala> val p = lift2(Add, char('a') #> 4, char('b') #> 5)
scala> p.parse("ab")
val res0 = Success(Add(4, 5))
scala> val q = lift3((x: Int, y: Int, z: Int) => x * y + z, char('a') #> 3, char('b') #> 2, char('c') #> 5)
scala> q.parse("abc")
val res1 = Success(11)
scala> q.parse("ab")
val res2 = Failure(..)
scala> val q2 = lift3[Int, Int, Int, Int](_ * _ + _, char('a') #> 3, char('b') #> 2, char('c') #> 5)
Since

2.2.0

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

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def lift1[T1, R](f: (T1) ⇒ R, p1: Parsley[T1]): Parsley[R]

    This combinator allows the result of a given parser to be changed using a given function.

    This combinator allows the result of a given parser to be changed using a given function.

    Effectively alias for map, to be consistent with the other lift variants.

    f

    the function to map across the given parser

    returns

    a parser that applies the function f to the result of the given parser.

  13. def lift10[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity ten.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  14. def lift11[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity eleven.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  15. def lift12[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity twelve.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  16. def lift13[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity thirteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  17. def lift14[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity fourteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  18. def lift15[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity fifteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  19. def lift16[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity sixteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  20. def lift17[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity seventeen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  21. def lift18[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity eighteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  22. def lift19[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity nineteen.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  23. def lift2[T1, T2, R](f: (T1, T2) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity two.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  24. def lift20[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19], p20: ⇒ Parsley[T20]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity twenty.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  25. def lift21[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19], p20: ⇒ Parsley[T20], p21: ⇒ Parsley[T21]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity twenty-one.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  26. def lift22[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9], p10: ⇒ Parsley[T10], p11: ⇒ Parsley[T11], p12: ⇒ Parsley[T12], p13: ⇒ Parsley[T13], p14: ⇒ Parsley[T14], p15: ⇒ Parsley[T15], p16: ⇒ Parsley[T16], p17: ⇒ Parsley[T17], p18: ⇒ Parsley[T18], p19: ⇒ Parsley[T19], p20: ⇒ Parsley[T20], p21: ⇒ Parsley[T21], p22: ⇒ Parsley[T22]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity twenty-two.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  27. def lift3[T1, T2, T3, R](f: (T1, T2, T3) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity three.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  28. def lift4[T1, T2, T3, T4, R](f: (T1, T2, T3, T4) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity four.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  29. def lift5[T1, T2, T3, T4, T5, R](f: (T1, T2, T3, T4, T5) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity five.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  30. def lift6[T1, T2, T3, T4, T5, T6, R](f: (T1, T2, T3, T4, T5, T6) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity six.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  31. def lift7[T1, T2, T3, T4, T5, T6, T7, R](f: (T1, T2, T3, T4, T5, T6, T7) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity seven.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  32. def lift8[T1, T2, T3, T4, T5, T6, T7, T8, R](f: (T1, T2, T3, T4, T5, T6, T7, T8) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity eight.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  33. def lift9[T1, T2, T3, T4, T5, T6, T7, T8, T9, R](f: (T1, T2, T3, T4, T5, T6, T7, T8, T9) ⇒ R, p1: Parsley[T1], p2: ⇒ Parsley[T2], p3: ⇒ Parsley[T3], p4: ⇒ Parsley[T4], p5: ⇒ Parsley[T5], p6: ⇒ Parsley[T6], p7: ⇒ Parsley[T7], p8: ⇒ Parsley[T8], p9: ⇒ Parsley[T9]): Parsley[R]

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    This combinator applies the given parsers in sequence and then applies the given function f of to all of the results.

    Firstly, each parser is parsed in turn, each producing a result. So long as all of the parsers succeeded, the combinator can succeed by returning the application of the function f to all the arguments. If any of the parsers fails, the entire combinator fails.

    f

    a function to apply to the results of the parsers with arity nine.

    returns

    a parser that parses all of the given parsers in order, and then combines their results with f.

  34. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  36. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  37. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  38. def toString(): String
    Definition Classes
    AnyRef → Any
  39. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped