Package jline.api.lqn

Class LqnRefRoutes.Group

java.lang.Object
jline.api.lqn.LqnRefRoutes.Group
Enclosing class:
LqnRefRoutes
public static final class LqnRefRoutes.Group extends Object
One reference task and the synchronous DAG below it.

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    List<int[]>
    actweightActs
    Per entry, the activity indices reachable from it.
    List<double[]>
    actweightW
    Per entry, the mean executions of each of those activities per invocation.
    double[][]
    calls
    Rows {cidx, fromPos, toPos, aidx, vCall}, positions into entries, vCall per REF cycle.
    int[]
    entries
    Every DAG entry, topologically ordered, root entries first.
    int[]
    etask
    lqn.parent of each entry.
    boolean
    headIsCaller
    True when the REF task is itself a caller of this layer.
    boolean[]
    ismember
    True where that entry's task is a caller of this layer.
    int[]
    members
    Callers of this layer on the DAG, in descent order.
    double
    npaths
    Distinct REF-to-caller routes, counted.
    double
    poolmin
    Min of lqn.maxmult over the DAG tasks.
    int[]
    prefixPos
    Positions in entries forming the prefix, topological order.
    boolean[]
    prefixTerm
    True where that prefix position is a first caller.
    int
    reftask
    Task index of the REF task at the root.
    double[]
    vEntry
    Mean invocations of each entry per REF cycle.

  • Constructor Summary

    Constructors
    Constructor
    Description
    Group()
     

  • Method Summary

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Field Details

    • reftask

      public int reftask
      Task index of the REF task at the root.

    • headIsCaller

      public boolean headIsCaller
      True when the REF task is itself a caller of this layer.

    • members

      public int[] members
      Callers of this layer on the DAG, in descent order.

    • entries

      public int[] entries
      Every DAG entry, topologically ordered, root entries first.

    • etask

      public int[] etask
      lqn.parent of each entry.

    • ismember

      public boolean[] ismember
      True where that entry's task is a caller of this layer.

    • vEntry

      public double[] vEntry
      Mean invocations of each entry per REF cycle.

    • actweightActs

      public List<int[]> actweightActs
      Per entry, the activity indices reachable from it.

    • actweightW

      public List<double[]> actweightW
      Per entry, the mean executions of each of those activities per invocation.

    • calls

      public double[][] calls
      Rows {cidx, fromPos, toPos, aidx, vCall}, positions into entries, vCall per REF cycle.

    • prefixPos

      public int[] prefixPos
      Positions in entries forming the prefix, topological order.

    • prefixTerm

      public boolean[] prefixTerm
      True where that prefix position is a first caller.

    • npaths

      public double npaths
      Distinct REF-to-caller routes, counted.

    • poolmin

      public double poolmin
      Min of lqn.maxmult over the DAG tasks. A diagnostic: the chain population is never capped by it.

  • Constructor Details

    • Group

      public Group()