object CanHold extends LowPriorityImplicits
This object contains the definitions of several types that help enforce that parsers of bounded precision only return types that can losslessly accomodate that precision.
Note that, on the JVM, there is no such thing as an unsigned value natively.
Instead, the JVM provides a guarantee that overflow is well-defined, and, as such
supports operations that work on numbers as if they were unsigned. For this
reason, parsley
makes no distinction between unsigned and signed numbers.
- Source
- BitBounds.scala
- Since
4.0.0
- Alphabetic
- By Inheritance
- CanHold
- LowPriorityImplicits
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- type can_hold_16_bits[T] = CanHold[_16.type, T]
This type-constraint requires that the given type has enough bit-width to store 16 bits of data.
This type-constraint requires that the given type has enough bit-width to store 16 bits of data.
- Annotations
- @implicitNotFound()
- Since
4.0.0
- type can_hold_32_bits[T] = CanHold[_32.type, T]
This type-constraint requires that the given type has enough bit-width to store 32 bits of data.
This type-constraint requires that the given type has enough bit-width to store 32 bits of data.
- Annotations
- @implicitNotFound()
- Since
4.0.0
- type can_hold_64_bits[T] = CanHold[_64.type, T]
This type-constraint requires that the given type has enough bit-width to store 64 bits of data.
This type-constraint requires that the given type has enough bit-width to store 64 bits of data.
- Annotations
- @implicitNotFound()
- Since
4.0.0
- type can_hold_8_bits[T] = CanHold[_8.type, T]
This type-constraint requires that the given type has enough bit-width to store 8 bits of data.
This type-constraint requires that the given type has enough bit-width to store 8 bits of data.
- Annotations
- @implicitNotFound()
- Since
4.0.0
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- implicit val big_64: can_hold_64_bits[BigInt]
Evidence that
BigInt
can store (at least) 64 bits of data.Evidence that
BigInt
can store (at least) 64 bits of data.- Definition Classes
- LowPriorityImplicits
- Since
4.0.0
- Note
long_64
is prioritised for implicit selection over this.
- implicit val byte_8: can_hold_8_bits[Byte]
Evidence that
Byte
can store 8 bits of data.Evidence that
Byte
can store 8 bits of data.- Since
4.0.0
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- implicit def fits_16_32[T](implicit arg0: can_hold_32_bits[T]): can_hold_16_bits[T]
Provides evidence that a type that can store 32 bits can also store 16 bits.
Provides evidence that a type that can store 32 bits can also store 16 bits.
- Since
4.0.0
- implicit def fits_32_64[T](implicit arg0: can_hold_64_bits[T]): can_hold_32_bits[T]
Provides evidence that a type that can store 64 bits can also store 32 bits.
Provides evidence that a type that can store 64 bits can also store 32 bits.
- Since
4.0.0
- implicit def fits_8_16[T](implicit arg0: can_hold_16_bits[T]): can_hold_8_bits[T]
Provides evidence that a type that can store 16 bits can also store 8 bits.
Provides evidence that a type that can store 16 bits can also store 8 bits.
- Since
4.0.0
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- implicit val int_32: can_hold_32_bits[Int]
Evidence that
Int
can store 32 bits of data.Evidence that
Int
can store 32 bits of data.- Since
4.0.0
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- implicit val long_64: can_hold_64_bits[Long]
Evidence that
Long
can store 64 bits of data.Evidence that
Long
can store 64 bits of data.- Since
4.0.0
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- implicit val short_16: can_hold_16_bits[Short]
Evidence that
Short
can store 16 bits of data.Evidence that
Short
can store 16 bits of data.- Since
4.0.0
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
This is the documentation for Parsley.
Package structure
The parsley package contains the
Parsley
class, as well as theResult
,Success
, andFailure
types. In addition to these, it also contains the following packages and "modules" (a module is defined as being an object which mocks a package):parsley.Parsley
contains the bulk of the core "function-style" combinators.parsley.combinator
contains many helpful combinators that simplify some common parser patterns.parsley.character
contains the combinators needed to read characters and strings, as well as combinators to match specific sub-sets of characters.parsley.debug
contains debugging combinators, helpful for identifying faults in parsers.parsley.extension
contains syntactic sugar combinators exposed as implicit classes.parsley.io
contains extension methods to run parsers with input sourced from IO sources.parsley.expr
contains the following sub modules:parsley.expr.chain
contains combinators used in expression parsingparsley.expr.precedence
is a builder for expression parsers built on a precedence table.parsley.expr.infix
contains combinators used in expression parsing, but with more permissive types than their equivalents inchain
.parsley.expr.mixed
contains combinators that can be used for expression parsing, but where different fixities may be mixed on the same level: this is rare in practice.parsley.implicits
contains several implicits to add syntactic sugar to the combinators. These are sub-categorised into the following sub modules:parsley.implicits.character
contains implicits to allow you to use character and string literals as parsers.parsley.implicits.combinator
contains implicits related to combinators, such as the ability to make any parser into aParsley[Unit]
automatically.parsley.implicits.lift
enables postfix application of the lift combinator onto a function (or value).parsley.implicits.zipped
enables boths a reversed form of lift where the function appears on the right and is applied on a tuple (useful when type inference has failed) as well as a.zipped
method for building tuples out of several combinators.parsley.errors
contains modules to deal with error messages, their refinement and generation.parsley.errors.combinator
provides combinators that can be used to either produce more detailed errors as well as refine existing errors.parsley.errors.tokenextractors
provides mixins for common token extraction strategies during error message generation: these can be used to avoid implementingunexpectedToken
in theErrorBuilder
.parsley.lift
contains functions which lift functions that work on regular types to those which now combine the results of parsers returning those same types. these are ubiquitous.parsley.ap
contains functions which allow for the application of a parser returning a function to several parsers returning each of the argument types.parsley.registers
contains combinators that interact with the context-sensitive functionality in the form of registers.parsley.token
contains theLexer
class that provides a host of helpful lexing combinators when provided with the description of a language.parsley.genericbridges
contains some basic implementations of the Parser Bridge pattern (see Design Patterns for Parser Combinators in Scala, or the parsley wiki): these can be used before more specialised generic bridge traits can be constructed.