ap

parsley.ap$
object ap

This module contains ap1 through ap22, which allow for the application of a parser returning 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 function of the correct arity produced by the first parser. This is a clean way of putting together multiple parsers and getting a meaningful result out.

Attributes

Since:

4.0.0

Example:

scala> import parsley.character.char
scala> import parsley.ap.{ap2, ap3}
scala> case class Add(x: Int, y: Int)
scala> val p = ap2(pure(Add), char('a') #> 4, char('b') #> 5)
scala> p.parse("ab")
val res0 = Success(Add(4, 5))
scala> val q = ap3(pure((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(..)
Source:
ap.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
ap.type

Members list

Concise view

Value members

Concrete methods

def ap1[T1, R](pf: Parsley[T1 => R], p1: => Parsley[T1]): Parsley[R]

This combinator allows the function that results from one parser to be applied to the result of another parser.

This combinator allows the function that results from one parser to be applied to the result of another parser.

Effectively alias for <*>, to be consistent with the other ap variants.

Attributes

pf

the parser whose result is a function to map across the result of p1.

px

the second parser to perform.

Returns:

a parser that applies the function f resulting from pf to the result x of the parser p1.

Source:
ap.scala
def ap10[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap11[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap12[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap13[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap14[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap15[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap16[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap17[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap18[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap19[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap2[T1, T2, R](pf: Parsley[(T1, T2) => R], p1: => Parsley[T1], p2: => Parsley[T2]): Parsley[R]

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap20[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap21[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap22[T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap3[T1, T2, T3, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap4[T1, T2, T3, T4, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap5[T1, T2, T3, T4, T5, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap6[T1, T2, T3, T4, T5, T6, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap7[T1, T2, T3, T4, T5, T6, T7, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap8[T1, T2, T3, T4, T5, T6, T7, T8, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala
def ap9[T1, T2, T3, T4, T5, T6, T7, T8, T9, R](pf: Parsley[(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 function returned by pf of to all of the results of the other parsers.

This combinator applies the given parsers in sequence and then applies the function returned by pf of to all of the results of the other parsers.

Firstly, each parser is parsed in turn, each producing a result (and the first, a function f). 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.

Attributes

pf

a parser that returns 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.

Source:
ap.scala