Package org.openquark.cal.internal.runtime.lecc

Examples of org.openquark.cal.internal.runtime.lecc.RTValue


          vertex1Num,
          letVar_filteredEdges));
  }

  private static final RTValue outEdgesMerged$11$def_Strict(RTValue retainLoops, RTValue edges, RTValue vertex2Num, RTValue vertex1Num, RTExecutionContext $ec) throws CALExecutorException {
    RTValue letVar_filteredEdges =
      Merge_Vertices_Internal.filteredEdges$10$def_Lazy(
        retainLoops,
        edges.getValue(),
        vertex2Num,
        vertex1Num,
        $ec);

    return
      Update.$instance.f3S(
        Merge_Vertices_Internal__update_Vertex2_Fn__17.$instance,
        vertex2Num.evaluate($ec).getOrdinalValue(),
        Update.$instance.f3S(
          new RTPartialApp._3._2(
            Merge_Vertices_Internal__update_Vertex1_Fn__16.$instance,
            vertex2Num,
            letVar_filteredEdges),
          vertex1Num.evaluate($ec).getOrdinalValue(),
          letVar_filteredEdges.evaluate($ec),
          $ec).evaluate(
          $ec),
        $ec).evaluate(
        $ec);
  }
View Full Code Here


   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.mergeVerticesInternal
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue mergedVertex = $rootNode.getArgValue();
    RTValue $currentRootNode;
    RTValue vertex2Num =
      ($currentRootNode = $rootNode.prevArg()).getArgValue();
    RTValue vertex1Num =
      ($currentRootNode = $currentRootNode.prevArg()).getArgValue();
    RTValue retainLoops =
      ($currentRootNode = $currentRootNode.prevArg()).getArgValue();
    RTValue graph =
      ($currentRootNode = $currentRootNode.prevArg()).getArgValue();
    RTValue $dictvarCal_Core_Prelude_Eq_3 =
      $currentRootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
View Full Code Here

    // Decompose data type to access members.
    TYPE_Directed_Graph.CAL_Directed_Graph $dcCaseVar1 =
      ((TYPE_Directed_Graph.CAL_Directed_Graph)(java.lang.Object)$case1);

    int nextVertexNum$U = $dcCaseVar1.get_nextVertexNum_As_Int();
    RTValue vertexMap = $dcCaseVar1.get_vertexMap();
    RTValue edges = $dcCaseVar1.get_edges();

    if (vertex1Num.evaluate($ec).getOrdinalValue() ==
    vertex2Num.evaluate($ec).getOrdinalValue()) {
      return
        new TYPE_Directed_Graph.CAL_Directed_Graph(
View Full Code Here

   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.findReachableCycle
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue startVertex = $rootNode.getArgValue();
    RTValue $currentRootNode;
    RTValue graph = ($currentRootNode = $rootNode.prevArg()).getArgValue();
    RTValue $dictvarCal_Core_Prelude_Eq_7 =
      $currentRootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
View Full Code Here

   * f
   * This method implements the function logic of the CAL function Cal.Core.Prelude.listFromJIteratorWith
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue elementMappingFunction = $rootNode.getArgValue();
    RTValue iterator$L = $rootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
      f2S(
        ((Iterator)(java.lang.Object)
          iterator$L.evaluate($ec).getOpaqueValue()),
        RTValue.lastRef(
          elementMappingFunction,
          elementMappingFunction = null),
        $ec);
  }
View Full Code Here

   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.showDirectedGraph$indentDiff$3
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue $dictvarCal_Core_Prelude_Num_36 = $rootNode.getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
      f1S(
View Full Code Here

   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.equalsDirectedGraphIgnoreInsertionOrder$translateNum2$12
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue num2 = $rootNode.getArgValue();
    RTValue vertexNumPerm = $rootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
      f2S(
        RTValue.lastRef(
          vertexNumPerm.evaluate($ec),
          vertexNumPerm = null),
        RTValue.lastRef(num2, num2 = null),
        $ec);
  }
View Full Code Here

   * fUnboxed2S
   * This method implements the logic of the CAL function Cal.Utilities.DirectedGraph.equalsDirectedGraphIgnoreInsertionOrder$translateNum2$12
   * This version of the logic returns an unboxed value.
   */
  public final int fUnboxed2S(RTValue vertexNumPerm, RTValue num2, RTExecutionContext $ec) throws CALExecutorException {
    RTValue $result = f2S(vertexNumPerm, num2, $ec);

    vertexNumPerm = null;
    num2 = null;
    return $result.evaluate($ec).getOrdinalValue();
  }
View Full Code Here

   * f
   * This method implements the function logic of the CAL function Cal.Core.Prelude.listFromJCollection
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue collection$L = $rootNode.getArgValue();
    RTValue $dictvarCal_Core_Prelude_Inputable_37 =
      $rootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
View Full Code Here

   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.addEdges$accumulateExistingEdges$11
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue pair2 = $rootNode.getArgValue();
    RTValue $currentRootNode;
    RTValue accum = ($currentRootNode = $rootNode.prevArg()).getArgValue();
    RTValue vertex1 =
      ($currentRootNode = $currentRootNode.prevArg()).getArgValue();
    RTValue existsEdgeFn = $currentRootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
      f4S(
View Full Code Here

TOP

Related Classes of org.openquark.cal.internal.runtime.lecc.RTValue

Copyright © 2018 www.massapicom. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.