Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

6.  val constValue: SAvlTree

   Value of the source type embedded in this graph node.

   Value of the source type embedded in this graph node.

   Definition Classes

   AvlTreeConst → LiftedConst

7.  def contains(key: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]], proof: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]): scalan.SigmaLibrary.Ref[Boolean]

   Definition Classes

   AvlTreeConstMethods → AvlTree

8.  final def deps: Array[scalan.SigmaLibrary.Sym]

   Dependencies of this definition from other definitions.

   Dependencies of this definition from other definitions. If definition is interpreted as an operation, then dependencies are arguments of the operation. If definition if compound (like Lambda of ThunkDef) then deps is equals to free variables used in the body of the compound definition. This array also refers to predecessors of this graph node, so it is used to build topological ordering (execution schedule) of operations.

   returns

   array of referencies to other definitions.

   Definition Classes

   Node

9.  def digest: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]

   Definition Classes

   AvlTreeConstMethods → AvlTree

10.  final def elements: Array[AnyRef]

    All data elements of this graph node to be used in structural equality.

    All data elements of this graph node to be used in structural equality.

    Definition Classes

    Node

    See also

    equals where elements are used.

11.  def enabledOperations: scalan.SigmaLibrary.Ref[Byte]

    Definition Classes

    AvlTreeConstMethods → AvlTree

12.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

13.  def equals(other: Any): Boolean

    Default equality of definitions.

    Default equality of definitions. Two definitions are equal if they have same elements.

    Definition Classes

    Node → Equals → AnyRef → Any

14.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

15.  def get(key: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]], proof: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[scalan.SigmaLibrary.Coll[Byte]]]

    Definition Classes

    AvlTreeConstMethods → AvlTree

16.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

17.  def getDeps: Array[scalan.SigmaLibrary.Sym]

    Override to redefine how dependencies are computed.

    Override to redefine how dependencies are computed. For example, in core implementation this is overriden in Lambda and ThunkDef using freeVars.

    Attributes

    protected

    Definition Classes

    Node

18.  def getMany(keys: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[scalan.SigmaLibrary.Coll[Byte]]], proof: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[scalan.SigmaLibrary.WOption[scalan.SigmaLibrary.Coll[Byte]]]]

    Definition Classes

    AvlTreeConstMethods → AvlTree

19.  def hashCode(): Int

    Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default.

    Computed once and saved to avoid repeated computations, which is not necessary because definitions are immutable by default. If some definition require mutability, this method can be overriden accordingly.

    Definition Classes

    Node → AnyRef → Any

20.  def insert(operations: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[(scalan.SigmaLibrary.Coll[Byte], scalan.SigmaLibrary.Coll[Byte])]], proof: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[scalan.SigmaLibrary.AvlTree]]

    Definition Classes

    AvlTreeConstMethods → AvlTree

21.  def isInsertAllowed: scalan.SigmaLibrary.Ref[Boolean]

    Definition Classes

    AvlTreeConstMethods → AvlTree

22.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

23.  def isRemoveAllowed: scalan.SigmaLibrary.Ref[Boolean]

    Definition Classes

    AvlTreeConstMethods → AvlTree

24.  def isUpdateAllowed: scalan.SigmaLibrary.Ref[Boolean]

    Definition Classes

    AvlTreeConstMethods → AvlTree

25.  def keyLength: scalan.SigmaLibrary.Ref[Int]

    Definition Classes

    AvlTreeConstMethods → AvlTree

26.  val liftable: Liftable[SAvlTree, scalan.SigmaLibrary.AvlTree]

    Evidence that constValue can be lifted to T

    Evidence that constValue can be lifted to T

    Definition Classes

    AvlTreeConst → LiftedConst

27.  def mirror(t: scalan.SigmaLibrary.Transformer): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.AvlTree]

    This default implementation assumes there is no symbols in this node.

    This default implementation assumes there is no symbols in this node. Can be overriden if it is not true for some ST.

    t

    mapping of symbols to symbols (Ref[_] => Ref[_])

    returns

    symbol of the logical clone. If d don't contain symbols, then d.self is returned.

    Definition Classes

    LiftedConst → Def

28.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

29.  final def nodeId: Int

    Unique id of the graph node assigned for each new instance using freshId generator.

    Unique id of the graph node assigned for each new instance using freshId generator. Doesn't participate in equality of this Def, thus definitions with different ids may still be structurally equal. Used to provide global Def numbering.

    Definition Classes

    Node

    Annotations

    @inline()

30.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

31.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

32.  def remove(operations: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[scalan.SigmaLibrary.Coll[Byte]]], proof: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[scalan.SigmaLibrary.AvlTree]]

    Definition Classes

    AvlTreeConstMethods → AvlTree

33.  val resultType: scalan.SigmaLibrary.Elem[scalan.SigmaLibrary.AvlTree]

    Type of a resulting value produced by the operation represented by this definition.

    Type of a resulting value produced by the operation represented by this definition. For example, if this definition represents application of +: (Int, Int) => Int operation then the result type is Int and resultType should return IntElement.

    Definition Classes

    AvlTreeConst → Def

34.  final def self: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.AvlTree]

    Reference to this definition created lazily on demand.

    Reference to this definition created lazily on demand.

    Definition Classes

    Def

35.  final def syms: Array[scalan.SigmaLibrary.Sym]

    References to other nodes in this Def instance.

    References to other nodes in this Def instance. Note: This is different form deps for compound definitions like Lambda and ThunkDef.

    Definition Classes

    Node

36.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

37.  def toString(): String

    User readable string representation of this definition.

    User readable string representation of this definition. (for debugging only)

    Definition Classes

    Node → AnyRef → Any

38.  def transform(t: scalan.SigmaLibrary.Transformer): scalan.SigmaLibrary.Def[scalan.SigmaLibrary.AvlTree]

    Create a copy of this definition applying the given transformer to all syms.

    Create a copy of this definition applying the given transformer to all syms.

    Definition Classes

    Def

39.  def update(operations: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[(scalan.SigmaLibrary.Coll[Byte], scalan.SigmaLibrary.Coll[Byte])]], proof: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[scalan.SigmaLibrary.AvlTree]]

    Definition Classes

    AvlTreeConstMethods → AvlTree

40.  def updateDigest(newDigest: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.Coll[Byte]]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.AvlTree]

    Definition Classes

    AvlTreeConstMethods → AvlTree

41.  def updateOperations(newOperations: scalan.SigmaLibrary.Ref[Byte]): scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.AvlTree]

    Definition Classes

    AvlTreeConstMethods → AvlTree

42.  def valueLengthOpt: scalan.SigmaLibrary.Ref[scalan.SigmaLibrary.WOption[Int]]

    Definition Classes

    AvlTreeConstMethods → AvlTree

43.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

44.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

45.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()