Object

scala.tools.scalap.scalax.rules.scalasig

ScalaSigEntryParsers

Related Doc: package scalasig

Permalink

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]

    Permalink
    Definition Classes
    Rules
  2. type EntryParser[A] = rules.Rule[S, S, A, String]

    Permalink
  3. trait FromRule[In] extends AnyRef

    Permalink
    Definition Classes
    Rules
  4. type Rule[+A, +X] = rules.Rule[S, S, A, X]

    Permalink
    Definition Classes
    StateRules
  5. type S = Entry

    Permalink
    Definition Classes
    ScalaSigEntryParsersStateRules

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink

    Test two objects for inequality.

    Test two objects for inequality.

    returns

    true if !(this == that), false otherwise.

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink

    Equivalent to x.hashCode except for boxed numeric types and null.

    Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.

    returns

    a hash value consistent with ==

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

    Permalink

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    Definition Classes
    AnyRef → Any
  4. val aliasSymbol: rules.Rule[S, S, AliasSymbol, String] with Name

    Permalink
  5. def allOf[A, X](rules: Seq[Rule[A, X]]): (S) ⇒ Result[S, List[A], X]

    Permalink

    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
  6. lazy val annotInfo: rules.Rule[S, S, AnnotInfo, String]

    Permalink
  7. def anyOf[A, X](rules: Seq[Rule[A, X]]): rules.Rule[S, S, collection.immutable.List[A], X]

    Permalink

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

    Permalink
    Definition Classes
    StateRules
  9. final def asInstanceOf[T0]: T0

    Permalink

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

    the receiver object.

    Definition Classes
    Any
    Exceptions thrown

    ClassCastException if the receiver object is not an instance of the erasure of type T0.

  10. val attribTreeRef: EntryParser[Int]

    Permalink
  11. lazy val attributeInfo: rules.Rule[S, S, AttributeInfo, String]

    Permalink
  12. implicit def byteCodeEntryParser[A](rule: ScalaSigAttributeParsers.Parser[A]): EntryParser[A]

    Permalink
  13. lazy val children: rules.Rule[S, S, Children, String]

    Permalink
  14. val classSymRef: EntryParser[ClassSymbol]

    Permalink
  15. val classSymbol: rules.Rule[S, S, ClassSymbol, String] with Name

    Permalink
  16. def clone(): AnyRef

    Permalink

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
    Note

    not specified by SLS as a member of AnyRef

  17. def cond(f: (S) ⇒ Boolean): rules.Rule[S, S, S, Nothing]

    Permalink

    Create a rule that identities if f(in) is true.

    Create a rule that identities if f(in) is true.

    Definition Classes
    StateRules
  18. lazy val constantRef: EntryParser[Any]

    Permalink
  19. lazy val entry: EntryParser[Any]

    Permalink
  20. implicit def entryType(code: Int): rules.Rule[S, S, Int, Nothing]

    Permalink
  21. final def eq(arg0: AnyRef): Boolean

    Permalink

    Tests whether the argument (that) is a reference to the receiver object (this).

    Tests whether the argument (that) is a reference to the receiver object (this).

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

    • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
    • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
    • null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    returns

    true if the argument is a reference to the receiver object; false otherwise.

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

    Permalink

    The equality method for reference types.

    The equality method for reference types. Default implementation delegates to eq.

    See also equals in scala.Any.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

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

    Permalink
    Definition Classes
    Rules
  24. def error[In]: rules.Rule[In, Nothing, Nothing, In]

    Permalink
    Definition Classes
    Rules
  25. def expect[In, Out, A, Any](rule: rules.Rule[In, Out, A, Any]): (In) ⇒ A

    Permalink

    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
  26. val extModClassRef: rules.Rule[S, S, ExternalSymbol, String] with Name

    Permalink
  27. val extRef: rules.Rule[S, S, ExternalSymbol, String] with Name

    Permalink
  28. val factory: RulesWithState

    Permalink
    Definition Classes
    RulesWithStateStateRules
  29. def failure: rules.Rule[Any, Nothing, Nothing, Nothing]

    Permalink
    Definition Classes
    Rules
  30. def finalize(): Unit

    Permalink

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
    Note

    not specified by SLS as a member of AnyRef

  31. def from[In]: FromRule[In]

    Permalink
    Definition Classes
    Rules
  32. def get: rules.Rule[S, S, S, Nothing]

    Permalink
    Definition Classes
    StateRules
  33. final def getClass(): Class[_]

    Permalink

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

  34. def hashCode(): Int

    Permalink

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

    the hash code value for this object.

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

    Permalink
    Definition Classes
    Rules
  36. val index: rules.Rule[S, S, Int, Nothing]

    Permalink
  37. final def isInstanceOf[T0]: Boolean

    Permalink

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    Definition Classes
    Any
  38. def isTopLevel(symbol: Symbol): Boolean

    Permalink
  39. def isTopLevelClass(symbol: Symbol): Boolean

    Permalink
  40. val key: rules.Rule[S, S, Int, Nothing]

    Permalink
  41. lazy val literal: EntryParser[Any]

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

    Permalink
    Definition Classes
    MemoisableRules
  43. val methodSymbol: rules.Rule[S, S, MethodSymbol, String] with Name

    Permalink
  44. val name: rules.Rule[S, S, String, String] with Name

    Permalink
  45. lazy val nameRef: EntryParser[String]

    Permalink
  46. final def ne(arg0: AnyRef): Boolean

    Permalink

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

    true if the argument is not a reference to the receiver object; false otherwise.

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

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

    Permalink
  49. def none: rules.Rule[S, S, None.type, Nothing]

    Permalink
    Definition Classes
    StateRules
  50. final def notify(): Unit

    Permalink

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  51. final def notifyAll(): Unit

    Permalink

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  52. val objectSymbol: rules.Rule[S, S, ObjectSymbol, String] with Name

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

    Permalink
    Definition Classes
    Rules
  54. def parseEntry[A](parser: EntryParser[A])(index: Int): rules.Rule[S, S, A, String]

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

    Permalink
    Definition Classes
    StateRules
  56. val ref: EntryParser[Int]

    Permalink
  57. def refTo[A](rule: EntryParser[A]): EntryParser[A]

    Permalink
  58. def repeatUntil[T, X](rule: Rule[(T) ⇒ T, X])(finished: (T) ⇒ Boolean)(initial: T): rules.Rule[S, S, T, X]

    Permalink

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

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

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

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

    Permalink
    Definition Classes
    StateRules
  63. def state[s]: StateRules { type S = s }

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

    Permalink
    Definition Classes
    Rules
  65. def symHeader(key: Int): EntryParser[Any]

    Permalink
  66. lazy val symbol: EntryParser[Symbol]

    Permalink
  67. def symbolEntry(key: Int): rules.Rule[S, S, SymbolInfo, String]

    Permalink
  68. val symbolInfo: rules.Rule[S, S, SymbolInfo, String]

    Permalink
  69. lazy val symbolRef: EntryParser[Symbol]

    Permalink
  70. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  71. val termName: rules.Rule[S, S, String, String]

    Permalink
  72. def toEntry[A](index: Int): rules.Rule[S, S, Int, Nothing]

    Permalink
  73. def toString(): String

    Permalink

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

    a String representation of the object.

    Definition Classes
    AnyRef → Any
  74. lazy val topLevelClass: rules.Rule[S, S, ClassSymbol, String]

    Permalink
  75. lazy val topLevelObject: rules.Rule[S, S, ObjectSymbol, String]

    Permalink
  76. lazy val typeEntry: EntryParser[Type]

    Permalink
  77. val typeIndex: rules.Rule[ScalaSigAttributeParsers.S, ScalaSigAttributeParsers.S, Int, Nothing]

    Permalink
  78. val typeLevel: rules.Rule[ScalaSigAttributeParsers.S, ScalaSigAttributeParsers.S, Int, Nothing]

    Permalink
  79. val typeName: rules.Rule[S, S, String, String]

    Permalink
  80. lazy val typeRef: EntryParser[Type]

    Permalink
  81. val typeSymbol: rules.Rule[S, S, TypeSymbol, String] with Name

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

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

    Permalink
    Definition Classes
    StateRules
  84. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )