sealed abstract class HasTxNodes[Nid, +Cid] extends AnyRef

Linear Supertypes
AnyRef, Any
Known Subclasses
GenTransaction, VersionedTransaction
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HasTxNodes
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def nodes: Map[Nid, GenNode[Nid, Cid]]
  2. abstract def roots: ImmArray[Nid]

Concrete 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(classOf[java.lang.CloneNotSupportedException]) @native()
  6. final def consumedContracts[Cid2 >: Cid]: Set[Cid2]

    Returns the IDs of all the consumed contracts.

    Returns the IDs of all the consumed contracts. This includes transient contracts but it does not include contracts consumed in rollback nodes.

  7. final def contractKeyInputs(implicit evidence: <:<[HasTxNodes[Nid, Cid], HasTxNodes[_, ContractId]]): Either[KeyInputError, Map[GlobalKey, KeyInput]]

    Return the expected contract key inputs (i.e.

    Return the expected contract key inputs (i.e. the state before the transaction) for this transaction or an error if the transaction contains a duplicate key error or has an inconsistent mapping for a key. For KeyCreate and NegativeKeyLookup (both corresponding to the key not being active) the first required input in execution order wins. So if a create comes first the input will be set to KeyCreate, if a negative lookup by key comes first the input will be set to NegativeKeyLookup.

    Because we do not preserve byKey flags across transaction serialization this method will consider all operations with keys for conflicts rather than just by-key operations.

    Annotations
    @throws("If a contract key contains a contract id")
  8. final def contractKeys(implicit evidence: <:<[HasTxNodes[Nid, Cid], HasTxNodes[_, ContractId]]): Set[GlobalKey]

    Return all the contract keys referenced by this transaction.

    Return all the contract keys referenced by this transaction. This includes the keys created, exercised, fetched, or looked up, even those that refer transient contracts or that appear under a rollback node.

  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  12. final def fold[A](z: A)(f: (A, (Nid, GenNode[Nid, Cid])) => A): A

    Traverses the transaction tree in pre-order traversal (i.e.

    Traverses the transaction tree in pre-order traversal (i.e. exercise nodes are traversed before their children)

    Takes constant stack space. Crashes if the transaction is not well formed (see isWellFormed)

  13. final def foldInExecutionOrder[A](z: A)(exerciseBegin: (A, Nid, NodeExercises[Nid, Cid]) => (A, Boolean), rollbackBegin: (A, Nid, NodeRollback[Nid]) => (A, Boolean), leaf: (A, Nid, LeafOnlyActionNode[Cid]) => A, exerciseEnd: (A, Nid, NodeExercises[Nid, Cid]) => A, rollbackEnd: (A, Nid, NodeRollback[Nid]) => A): A
  14. final def foldWithPathState[A, B](globalState0: A, pathState0: B)(op: (A, B, Nid, GenNode[Nid, Cid]) => (A, B)): A

    A fold over the transaction that maintains global and path-specific state.

    A fold over the transaction that maintains global and path-specific state. Takes constant stack space. Returns the global state.

    Used to for example compute the roots of per-party projections from the transaction.

  15. final def foreach(f: (Nid, GenNode[Nid, Cid]) => Unit): Unit

    This function traverses the transaction tree in pre-order traversal (i.e.

    This function traverses the transaction tree in pre-order traversal (i.e. exercise node are traversed before their children).

    Takes constant stack space. Crashes if the transaction is not well formed (see isWellFormed)

  16. final def foreachInExecutionOrder(exerciseBegin: (Nid, NodeExercises[Nid, Cid]) => Boolean, rollbackBegin: (Nid, NodeRollback[Nid]) => Boolean, leaf: (Nid, LeafOnlyActionNode[Cid]) => Unit, exerciseEnd: (Nid, NodeExercises[Nid, Cid]) => Unit, rollbackEnd: (Nid, NodeRollback[Nid]) => Unit): Unit
  17. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  18. final def guessSubmitter: Either[String, Party]
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. final def inactiveContracts[Cid2 >: Cid]: Set[Cid2]

    Local and global contracts that are inactive at the end of the transaction.

    Local and global contracts that are inactive at the end of the transaction. This includes both contracts that have been arachived and local contracts whose create has been rolled back.

  21. lazy val informees: Set[Party]

    The union of the informees of a all the action nodes.

  22. final def inputContracts[Cid2 >: Cid]: Set[Cid2]

    Returns the IDs of all input contracts that are used by this transaction.

  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. final def localContracts[Cid2 >: Cid]: Map[Cid2, (Nid, NodeCreate[Cid2])]
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  27. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  28. final def reachableNodeIds: Set[Nid]
  29. def rootNodes: ImmArray[GenActionNode[Nid, Cid]]
    Annotations
    @throws(scala.this.throws.<init>$default$1[IllegalArgumentException])
  30. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  31. def toString(): String
    Definition Classes
    AnyRef → Any
  32. final def updatedContractKeys(implicit ev: <:<[HasTxNodes[Nid, Cid], HasTxNodes[_, ContractId]]): Map[GlobalKey, Option[ContractId]]

    The contract keys created or updated as part of the transaction.

    The contract keys created or updated as part of the transaction. This includes updates to transient contracts (by mapping them to None) but it does not include any updates under rollback nodes.

  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  34. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  35. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped