class
Count[E, T] extends Parsec[E, Seq[T]]
Instance Constructors
-
new
Count(p: Parsec[E, T], n: scala.Int)
Value Members
-
def
!(s: State[E]): Seq[T]
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): scala.Int
-
def
*>[B](mb: Parsec[E, B]): Parsec[E, B]
-
def
<*[_](mb: Parsec[E, _]): Parsec[E, Seq[T]]
-
def
<*>[B](f: (Seq[T]) ⇒ B): Parsec[E, B]
-
def
<:>[B](f: (Seq[T]) ⇒ B): Parsec[E, B]
-
def
<?>[U >: Seq[T]](message: String): Parsec[E, U]
-
def
<|>[U >: Seq[T]](parsec: Parsec[E, U]): Parsec[E, U]
-
final
def
==(arg0: Any): Boolean
-
def
>>[B](m: Parsec[E, B]): Parsec[E, B]
-
def
>>=[B](f: (Seq[T]) ⇒ Parsec[E, B]): Parsec[E, B]
-
def
?(s: Seq[E]): Try[Seq[T]]
-
def
?(s: State[E]): Try[Seq[T]]
-
def
apply(s: State[E]): Try[Seq[T]]
-
final
def
asInstanceOf[T0]: T0
-
def
ask(s: Seq[E]): Try[Seq[T]]
-
def
ask(s: State[E]): Try[Seq[T]]
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
flatMap[B](f: (Seq[T]) ⇒ Parsec[E, B]): Parsec[E, B]
-
final
def
getClass(): Class[_]
-
def
hashCode(): scala.Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
liftA2[B, C](f: (Seq[T], B) ⇒ C): (Parsec[E, B]) ⇒ Parsec[E, C]
-
def
map[B](f: (Seq[T]) ⇒ B): Parsec[E, B]
-
val
n: scala.Int
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
option(s: State[E]): Option[Seq[T]]
-
val
p: Parsec[E, T]
-
def
parse(s: State[E]): Seq[T]
-
val
self: Parsec[E, Seq[T]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(arg0: Long, arg1: scala.Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
wait(): Unit
Deprecated Value Members
-
def
finalize(): Unit
Inherited from Parsec[E, Seq[T]]
Inherited from AnyRef
Inherited from Any
count n p parses n occurrences of p. If n is smaller or equal to zero, the parser equals to return []. Returns a list of n values returned by p.
1.0.0