/**
* f6S
* This method implements the function logic of the CAL function Cal.Utilities.DirectedGraph.mergeVertices
*/
public final RTValue f6S(RTValue $dictvarCal_Core_Prelude_Eq_48, RTValue graph, RTValue retainLoops, RTValue vertex1, RTValue vertex2, RTValue mergedVertex, RTExecutionContext $ec) throws CALExecutorException {
RTValue letVar_vertex1Num =
Merge_Vertices.vertex1Num$6$def_Lazy(
$dictvarCal_Core_Prelude_Eq_48,
graph,
vertex1,
$ec);
// Top level supercombinator logic
TYPE_Maybe $case1;
switch (($case1 = (((TYPE_Maybe)(java.lang.Object)Get_Maybe_Vertex_Number.$instance.f3S($dictvarCal_Core_Prelude_Eq_48, graph, mergedVertex, $ec).evaluate($ec)))).getOrdinalValue()) {
case 0: {
// Cal.Core.Prelude.Nothing
return
Merge_Vertices.mergedWithEachother$8$def_Lazy(
$dictvarCal_Core_Prelude_Eq_48,
graph,
vertex2,
retainLoops,
letVar_vertex1Num,
mergedVertex,
$ec);
}
case 1: {
// Cal.Core.Prelude.Just
// Decompose data type to access members.
RTValue mergedVertexNum = $case1.get_value();
return
Merge_Vertices_Internal.$instance.f6S(
$dictvarCal_Core_Prelude_Eq_48,
Merge_Vertices.mergedWithEachother$8$def_Lazy(