object ScalaSigEntryParsers extends RulesWithState with MemoisableRules
- Source
- ScalaSig.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ScalaSigEntryParsers
- MemoisableRules
- RulesWithState
- StateRules
- Rules
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
class
DefaultRule[In, Out, A, X] extends Rule[In, Out, A, X]
- Definition Classes
- Rules
-
trait
FromRule[In] extends AnyRef
- Definition Classes
- Rules
- type EntryParser[A] = rules.Rule[S, S, A, String]
-
type
Rule[+A, +X] = rules.Rule[S, S, A, X]
- Definition Classes
- StateRules
-
type
S = Entry
- Definition Classes
- ScalaSigEntryParsers → StateRules
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
- val aliasSymbol: rules.Rule[S, S, AliasSymbol, String] with Name
-
def
allOf[A, X](rules: Seq[Rule[A, X]]): (S) ⇒ Result[S, List[A], X]
Create a rule that succeeds if all of the given rules succeed.
Create a rule that succeeds if all of the given rules succeed.
- rules
the rules to apply in sequence.
- Definition Classes
- StateRules
- lazy val annotInfo: rules.Rule[S, S, AnnotInfo, String]
-
def
anyOf[A, X](rules: Seq[Rule[A, X]]): rules.Rule[S, S, collection.immutable.List[A], X]
Create a rule that succeeds with a list of all the provided rules that succeed.
Create a rule that succeeds with a list of all the provided rules that succeed.
- rules
the rules to apply in sequence.
- Definition Classes
- StateRules
-
def
apply[A, X](f: (S) ⇒ Result[S, A, X]): rules.Rule[S, S, A, X]
- Definition Classes
- StateRules
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val attribTreeRef: EntryParser[Int]
- lazy val attributeInfo: rules.Rule[S, S, AttributeInfo, String]
- implicit def byteCodeEntryParser[A](rule: ScalaSigAttributeParsers.Parser[A]): EntryParser[A]
- lazy val children: rules.Rule[S, S, Children, String]
- val classSymRef: EntryParser[ClassSymbol]
- val classSymbol: rules.Rule[S, S, ClassSymbol, String] with Name
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
cond(f: (S) ⇒ Boolean): rules.Rule[S, S, S, Nothing]
Create a rule that identities if f(in) is true.
Create a rule that identities if f(in) is true.
- Definition Classes
- StateRules
- lazy val constantRef: EntryParser[Any]
- lazy val entry: EntryParser[Any]
- implicit def entryType(code: Int): rules.Rule[S, S, Int, Nothing]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
error[X](err: X): rules.Rule[Any, Nothing, Nothing, X]
- Definition Classes
- Rules
-
def
error[In]: rules.Rule[In, Nothing, Nothing, In]
- Definition Classes
- Rules
-
def
expect[In, Out, A, Any](rule: rules.Rule[In, Out, A, Any]): (In) ⇒ A
Converts a rule into a function that throws an Exception on failure.
Converts a rule into a function that throws an Exception on failure.
- Definition Classes
- Rules
- val extModClassRef: rules.Rule[S, S, ExternalSymbol, String] with Name
- val extRef: rules.Rule[S, S, ExternalSymbol, String] with Name
-
val
factory: RulesWithState
- Definition Classes
- RulesWithState → StateRules
-
def
failure: rules.Rule[Any, Nothing, Nothing, Nothing]
- Definition Classes
- Rules
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
from[In]: FromRule[In]
- Definition Classes
- Rules
-
def
get: rules.Rule[S, S, S, Nothing]
- Definition Classes
- StateRules
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
implicit
def
inRule[In, Out, A, X](rule: rules.Rule[In, Out, A, X]): InRule[In, Out, A, X]
- Definition Classes
- Rules
- val index: rules.Rule[S, S, Int, Nothing]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTopLevel(symbol: Symbol): Boolean
- def isTopLevelClass(symbol: Symbol): Boolean
- val key: rules.Rule[S, S, Int, Nothing]
- lazy val literal: EntryParser[Any]
-
def
memo[In <: Memoisable, Out, A, X](key: AnyRef)(toRule: ⇒ (In) ⇒ Result[Out, A, X]): rules.Rule[In, Out, A, X]
- Definition Classes
- MemoisableRules
- val methodSymbol: rules.Rule[S, S, MethodSymbol, String] with Name
- val name: rules.Rule[S, S, String, String] with Name
- lazy val nameRef: EntryParser[String]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nil: rules.Rule[S, S, collection.immutable.Nil.type, Nothing]
- Definition Classes
- StateRules
- val noSymbol: rules.Rule[S, S, NoSymbol.type, Nothing]
-
def
none: rules.Rule[S, S, None.type, Nothing]
- Definition Classes
- StateRules
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val objectSymbol: rules.Rule[S, S, ObjectSymbol, String] with Name
-
def
oneOf[In, Out, A, X](rules: rules.Rule[In, Out, A, X]*): rules.Rule[In, Out, A, X]
- Definition Classes
- Rules
- def parseEntry[A](parser: EntryParser[A])(index: Int): rules.Rule[S, S, A, String]
-
def
read[A](f: (S) ⇒ A): rules.Rule[S, S, A, Nothing]
- Definition Classes
- StateRules
- val ref: EntryParser[Int]
- def refTo[A](rule: EntryParser[A]): EntryParser[A]
-
def
repeatUntil[T, X](rule: Rule[(T) ⇒ T, X])(finished: (T) ⇒ Boolean)(initial: T): rules.Rule[S, S, T, X]
Repeatedly apply a rule from initial value until finished condition is met.
Repeatedly apply a rule from initial value until finished condition is met.
- Definition Classes
- StateRules
-
implicit
def
rule[In, Out, A, X](f: (In) ⇒ Result[Out, A, X]): rules.Rule[In, Out, A, X]
- Definition Classes
- Rules
-
def
ruleWithName[In, Out, A, X](name: String, f: (In) ⇒ Result[Out, A, X]): rules.Rule[In, Out, A, X] with Name
- Definition Classes
- MemoisableRules → Rules
-
implicit
def
seqRule[In, A, X](rule: rules.Rule[In, In, A, X]): SeqRule[In, A, X]
- Definition Classes
- Rules
-
def
set(s: ⇒ S): rules.Rule[S, S, S, Nothing]
- Definition Classes
- StateRules
-
def
state[s]: StateRules { type S = s }
- Definition Classes
- Rules
-
def
success[Out, A](out: Out, a: A): rules.Rule[Any, Out, A, Nothing]
- Definition Classes
- Rules
- def symHeader(key: Int): EntryParser[Any]
- lazy val symbol: EntryParser[Symbol]
- def symbolEntry(key: Int): rules.Rule[S, S, SymbolInfo, String]
- val symbolInfo: rules.Rule[S, S, SymbolInfo, String]
- lazy val symbolRef: EntryParser[Symbol]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- val termName: rules.Rule[S, S, String, String]
- def toEntry[A](index: Int): rules.Rule[S, S, Int, Nothing]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- lazy val topLevelClass: rules.Rule[S, S, ClassSymbol, String]
- lazy val topLevelObject: rules.Rule[S, S, ObjectSymbol, String]
- lazy val typeEntry: EntryParser[Type]
- val typeIndex: rules.Rule[ScalaSigAttributeParsers.S, ScalaSigAttributeParsers.S, Int, Nothing]
- val typeLevel: rules.Rule[ScalaSigAttributeParsers.S, ScalaSigAttributeParsers.S, Int, Nothing]
- val typeName: rules.Rule[S, S, String, String]
- lazy val typeRef: EntryParser[Type]
- val typeSymbol: rules.Rule[S, S, TypeSymbol, String] with Name
-
def
unit[A](a: ⇒ A): rules.Rule[S, S, A, Nothing]
- Definition Classes
- StateRules
-
def
update(f: (S) ⇒ S): rules.Rule[S, S, S, Nothing]
- Definition Classes
- StateRules
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()