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

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

71
72
73
74
75
76
77
78
79
80
81
82
83
84
  public final RTValue f2S(RTValue accum, RTValue vertexNum, RTExecutionContext $ec) throws CALExecutorException {
    // Top level supercombinator logic

    RTRecordValue $recordCase1 =
      ((RTRecordValue)(java.lang.Object)accum.evaluate($ec));
    RTValue path = $recordCase1.getOrdinalFieldValue(1);
    RTValue isCycle = $recordCase1.getOrdinalFieldValue(2);

    if (isCycle.evaluate($ec).getBooleanValue()) {
      return accum;
    } else {
      return
        RTRecordValue.makeTupleRecord(
          new RTValue[] {new TYPE_List.CAL_Cons(vertexNum, path), isCycle});
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
   * f
   * This method implements the function logic of the CAL function Cal.Core.Prelude.divideInt
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue $x1$L = $rootNode.getArgValue();
    RTValue $x0$L = $rootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
      f2S(
        $x0$L.evaluate($ec).getOrdinalValue(),
        $x1$L.evaluate($ec).getOrdinalValue(),
        $ec);
  }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.getEdgeCount
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue graph = $rootNode.getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return f1S(RTValue.lastRef(graph, graph = null), $ec);
  }
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.$lambda$foldReachableInDepthFirstSearchOrder$1
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue vertexNum = $rootNode.getArgValue();
    RTValue $currentRootNode;
    RTValue accum = ($currentRootNode = $rootNode.prevArg()).getArgValue();
    RTValue graph =
      ($currentRootNode = $currentRootNode.prevArg()).getArgValue();
    RTValue startVertexFn = $currentRootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
      f4S(
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.permute
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue oldList = $rootNode.getArgValue();
    RTValue perm = $rootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
      f2S(
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
124
   * _dict_Cal___Core___Prelude___Ord_____Univeral_Record_f
   * This method implements the function logic of the CAL function Cal.Core.Prelude.$dictCal.Core.Prelude.Ord#$UniveralRecord
   */
  public final RTValue _dict_Cal___Core___Prelude___Ord_____Univeral_Record_f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue $i$L = $rootNode.getArgValue();
    RTValue $dictvarCal_Core_Prelude_Ord_0 =
      $rootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
View Full Code Here
219
220
221
222
223
224
225
226
227
228
229
230
231
232
   * max_Record_f
   * This method implements the function logic of the CAL function Cal.Core.Prelude.maxRecord
   */
  public final RTValue max_Record_f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue r2 = $rootNode.getArgValue();
    RTValue $currentRootNode;
    RTValue r1 = ($currentRootNode = $rootNode.prevArg()).getArgValue();
    RTValue $dictvarCal_Core_Prelude_Ord_22 =
      $currentRootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
292
   * min_Record_f
   * This method implements the function logic of the CAL function Cal.Core.Prelude.minRecord
   */
  public final RTValue min_Record_f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue r2 = $rootNode.getArgValue();
    RTValue $currentRootNode;
    RTValue r1 = ($currentRootNode = $rootNode.prevArg()).getArgValue();
    RTValue $dictvarCal_Core_Prelude_Ord_68 =
      $currentRootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
   * f
   * This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.addEdgeInternal
   */
  public final RTValue f(final RTResultFunction $rootNode, final RTExecutionContext $ec) throws CALExecutorException {
    // Arguments
    RTValue newEdge = $rootNode.getArgValue();
    RTValue $currentRootNode;
    RTValue oldGraph =
      ($currentRootNode = $rootNode.prevArg()).getArgValue();
    RTValue $dictvarCal_Core_Prelude_Eq_10 =
      $currentRootNode.prevArg().getArgValue();

    // Release the fields in the root node to open them to garbage collection
    $rootNode.clearMembers();
    return
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
144
    // 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 oldEdges = $dcCaseVar1.get_edges();

    return
      new TYPE_Directed_Graph.CAL_Directed_Graph(
        nextVertexNum$U,
        vertexMap,
View Full Code Here
TOP

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

  • org.openquark.cal.internal.runtime.lecc.functions.RTArbitraryRecordPrimitive
  • org.openquark.cal.internal.runtime.lecc.functions.RTBuildListPrimitive
  • org.openquark.cal.internal.runtime.lecc.functions.RTBuildRecordPrimitive
  • org.openquark.cal.internal.runtime.lecc.functions.RTCoArbitraryRecordPrimitive
  • org.openquark.cal.internal.runtime.lecc.functions.RTCompareRecord
  • org.openquark.cal.internal.runtime.lecc.functions.RTEqualsRecord
  • org.openquark.cal.internal.runtime.lecc.functions.RTNotEqualsRecord
  • org.openquark.cal.internal.runtime.lecc.functions.RTRecordFromJListPrimitive
  • org.openquark.cal.internal.runtime.lecc.functions.RTRecordFromJMapPrimitive
  • org.openquark.cal.internal.runtime.lecc.functions.RTShowRecord
    • 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.