# ScalaSigEntryParsers

#### object ScalaSigEntryParsers extends RulesWithState with MemoisableRules

Source
ScalaSig.scala
Linear Supertypes
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. ScalaSigEntryParsers
2. MemoisableRules
3. RulesWithState
4. StateRules
5. Rules
6. AnyRef
7. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

### Type Members

1. #### class DefaultRule[In, Out, A, X] extends Rule[In, Out, A, X]

Definition Classes
Rules

3. #### type Rule[+A, +X] = rules.Rule[S, S, A, X]

Definition Classes
StateRules
4. #### type S = Entry

Definition Classes

### Value Members

1. #### final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
2. #### final def !=(arg0: Any): Boolean

Definition Classes
Any
3. #### final def ##(): Int

Definition Classes
AnyRef → Any
4. #### final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
5. #### final def ==(arg0: Any): Boolean

Definition Classes
Any

7. #### 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

9. #### 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
10. #### def apply[A, X](f: (S) ⇒ Result[S, A, X]): rules.Rule[S, S, A, X]

Definition Classes
StateRules
11. #### final def asInstanceOf[T0]: T0

Definition Classes
Any

18. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
19. #### 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

23. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
24. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
25. #### def error[X](err: X): rules.Rule[Any, Nothing, Nothing, X]

Definition Classes
Rules
26. #### def error[In]: rules.Rule[In, Nothing, Nothing, In]

Definition Classes
Rules
27. #### 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

30. #### val factory: RulesWithState

Definition Classes
RulesWithStateStateRules
31. #### def failure: rules.Rule[Any, Nothing, Nothing, Nothing]

Definition Classes
Rules
32. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
33. #### def from[In]: AnyRef { def apply[Out, A, X](f: In => scala.tools.scalap.scalax.rules.Result[Out,A,X]): scala.tools.scalap.scalax.rules.Rule[In,Out,A,X] }

Definition Classes
Rules
34. #### def get: rules.Rule[S, S, S, Nothing]

Definition Classes
StateRules
35. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
36. #### def hashCode(): Int

Definition Classes
AnyRef → Any
37. #### implicit def inRule[In, Out, A, X](rule: rules.Rule[In, Out, A, X]): InRule[In, Out, A, X]

Definition Classes
Rules

39. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any

44. #### def memo[In <: Memoisable, Out, A, X](key: AnyRef)(toRule: ⇒ (In) ⇒ Result[Out, A, X]): rules.Rule[In, Out, A, X]

Definition Classes
MemoisableRules

48. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
49. #### def nil: rules.Rule[S, S, collection.immutable.Nil.type, Nothing]

Definition Classes
StateRules
50. #### val noSymbol: rules.Rule[S, S, NoSymbol.type, Nothing]

************************************************* Symbol table attribute format: Symtab = nentries_Nat {Entry} Entry = 1 TERMNAME len_Nat NameInfo | 2 TYPENAME len_Nat NameInfo | 3 NONEsym len_Nat | 4 TYPEsym len_Nat SymbolInfo | 5 ALIASsym len_Nat SymbolInfo | 6 CLASSsym len_Nat SymbolInfo [thistype_Ref] | 7 MODULEsym len_Nat SymbolInfo | 8 VALsym len_Nat [defaultGetter_Ref /* no longer needed*/ SymbolInfo [alias_Ref] | 9 EXTref len_Nat name_Ref [owner_Ref] | 10 EXTMODCLASSref len_Nat name_Ref [owner_Ref] | 11 NOtpe len_Nat | 12 NOPREFIXtpe len_Nat | 13 THIStpe len_Nat sym_Ref | 14 SINGLEtpe len_Nat type_Ref sym_Ref | 15 CONSTANTtpe len_Nat constant_Ref | 16 TYPEREFtpe len_Nat type_Ref sym_Ref {targ_Ref} | 17 TYPEBOUNDStpe len_Nat tpe_Ref tpe_Ref | 18 REFINEDtpe len_Nat classsym_Ref {tpe_Ref} | 19 CLASSINFOtpe len_Nat classsym_Ref {tpe_Ref} | 20 METHODtpe len_Nat tpe_Ref {sym_Ref} | 21 POLYTtpe len_Nat tpe_Ref {sym_Ref} | 22 IMPLICITMETHODtpe len_Nat tpe_Ref {sym_Ref} /* no longer needed */ * | 52 SUPERtpe len_Nat tpe_Ref tpe_Ref | 24 LITERALunit len_Nat | 25 LITERALboolean len_Nat value_Long | 26 LITERALbyte len_Nat value_Long | 27 LITERALshort len_Nat value_Long | 28 LITERALchar len_Nat value_Long | 29 LITERALint len_Nat value_Long | 30 LITERALlong len_Nat value_Long | 31 LITERALfloat len_Nat value_Long | 32 LITERALdouble len_Nat value_Long | 33 LITERALstring len_Nat name_Ref | 34 LITERALnull len_Nat | 35 LITERALclass len_Nat tpe_Ref | 36 LITERALenum len_Nat sym_Ref | 40 SYMANNOT len_Nat sym_Ref AnnotInfoBody | 41 CHILDREN len_Nat sym_Ref {sym_Ref} | 42 ANNOTATEDtpe len_Nat [sym_Ref /* no longer needed */ tpe_Ref {annotinfo_Ref} | 43 ANNOTINFO len_Nat AnnotInfoBody | 44 ANNOTARGARRAY len_Nat {constAnnotArg_Ref} | 47 DEBRUIJNINDEXtpe len_Nat level_Nat index_Nat | 48 EXISTENTIALtpe len_Nat type_Ref {symbol_Ref}

51. #### def none: rules.Rule[S, S, None.type, Nothing]

Definition Classes
StateRules
52. #### final def notify(): Unit

Definition Classes
AnyRef
53. #### final def notifyAll(): Unit

Definition Classes
AnyRef

55. #### def oneOf[In, Out, A, X](rules: rules.Rule[In, Out, A, X]*): rules.Rule[In, Out, A, X]

Definition Classes
Rules

57. #### def read[A](f: (S) ⇒ A): rules.Rule[S, S, A, Nothing]

Definition Classes
StateRules

60. #### 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
61. #### implicit def rule[In, Out, A, X](f: (In) ⇒ Result[Out, A, X]): rules.Rule[In, Out, A, X]

Definition Classes
Rules
62. #### def ruleWithName[In, Out, A, X](name: String, f: (In) ⇒ Result[Out, A, X]): rules.Rule[In, Out, A, X] with Name

Definition Classes
MemoisableRulesRules
63. #### implicit def seqRule[In, A, X](rule: rules.Rule[In, In, A, X]): SeqRule[In, A, X]

Definition Classes
Rules
64. #### def set(s: ⇒ S): rules.Rule[S, S, S, Nothing]

Definition Classes
StateRules
65. #### def state[s]: StateRules { type S = s }

Definition Classes
Rules
66. #### def success[Out, A](out: Out, a: A): rules.Rule[Any, Out, A, Nothing]

Definition Classes
Rules

72. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef

75. #### def toString(): String

Definition Classes
AnyRef → Any

84. #### def unit[A](a: ⇒ A): rules.Rule[S, S, A, Nothing]

Definition Classes
StateRules
85. #### def update(f: (S) ⇒ S): rules.Rule[S, S, S, Nothing]

Definition Classes
StateRules
86. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws()
87. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws()
88. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws()