package jp.ac.kobe_u.cs.prolog.builtin;
import jp.ac.kobe_u.cs.prolog.lang.Arithmetic;
import jp.ac.kobe_u.cs.prolog.lang.BuiltinException;
import jp.ac.kobe_u.cs.prolog.lang.IllegalTypeException;
import jp.ac.kobe_u.cs.prolog.lang.IntegerTerm;
import jp.ac.kobe_u.cs.prolog.lang.Predicate;
import jp.ac.kobe_u.cs.prolog.lang.Prolog;
import jp.ac.kobe_u.cs.prolog.lang.SymbolTerm;
import jp.ac.kobe_u.cs.prolog.lang.Term;
import jp.ac.kobe_u.cs.prolog.lang.VariableTerm;
/*
This file is generated by Prolog Cafe.
PLEASE DO NOT EDIT!
*/
/**
<code>'$map_compare_op'/2</code> defined in builtins.pl<br>
@author Mutsunori Banbara (banbara@kobe-u.ac.jp)
@author Naoyuki Tamura (tamura@kobe-u.ac.jp)
@version 1.0
*/
class PRED_$map_compare_op_2 extends Predicate {
static IntegerTerm si1 = new IntegerTerm(0);
static SymbolTerm s2 = SymbolTerm.makeSymbol("=");
static SymbolTerm s3 = SymbolTerm.makeSymbol("<");
static SymbolTerm s4 = SymbolTerm.makeSymbol(">");
static Predicate _$map_compare_op_2_sub_1 = new PRED_$map_compare_op_2_sub_1();
static Predicate _$map_compare_op_2_sub_2 = new PRED_$map_compare_op_2_sub_2();
static Predicate _$map_compare_op_2_1 = new PRED_$map_compare_op_2_1();
static Predicate _$map_compare_op_2_2 = new PRED_$map_compare_op_2_2();
static Predicate _$map_compare_op_2_3 = new PRED_$map_compare_op_2_3();
public Term arg1, arg2;
public PRED_$map_compare_op_2(Term a1, Term a2, Predicate cont) {
arg1 = a1;
arg2 = a2;
this.cont = cont;
}
public PRED_$map_compare_op_2(){}
public void setArgument(Term[] args, Predicate cont) {
arg1 = args[0];
arg2 = args[1];
this.cont = cont;
}
public int arity() { return 2; }
public String toString() {
return "$map_compare_op(" + arg1 + "," + arg2 + ")";
}
public Predicate exec(Prolog engine) {
engine.aregs[1] = arg1;
engine.aregs[2] = arg2;
engine.cont = cont;
engine.setB0();
return engine.jtry(_$map_compare_op_2_1, _$map_compare_op_2_sub_1);
}
}
class PRED_$map_compare_op_2_sub_1 extends PRED_$map_compare_op_2 {
public Predicate exec(Prolog engine) {
return engine.retry(_$map_compare_op_2_2, _$map_compare_op_2_sub_2);
}
}
class PRED_$map_compare_op_2_sub_2 extends PRED_$map_compare_op_2 {
public Predicate exec(Prolog engine) {
return engine.trust(_$map_compare_op_2_3);
}
}
class PRED_$map_compare_op_2_1 extends PRED_$map_compare_op_2 {
public Predicate exec(Prolog engine) {
// '$map_compare_op'(A,B):-A=:=0,!,B= =
Term a1, a2, a3;
Predicate cont;
a1 = engine.aregs[1];
a2 = engine.aregs[2];
cont = engine.cont;
// '$map_compare_op'(A,B):-['$get_level'(C),'$arith_equal'(A,0),'$cut'(C),'$unify'(B,=)]
a3 = new VariableTerm(engine);
//START inline expansion of $get_level(a(3))
if (! a3.unify(new IntegerTerm(engine.B0), engine.trail)) {
return engine.fail();
}
//END inline expansion
//START inline expansion of $arith_equal(a(1),si(1))
try {
if (Arithmetic.evaluate(a1).arithCompareTo(si1) != 0) {
return engine.fail();
}
} catch (BuiltinException e) {
e.goal = this;
throw e;
}
//END inline expansion
//START inline expansion of $cut(a(3))
a3 = a3.dereference();
if (! a3.isInteger()) {
throw new IllegalTypeException("integer", a3);
} else {
engine.cut(((IntegerTerm) a3).intValue());
}
//END inline expansion
//START inline expansion of $unify(a(2),s(2))
if (! a2.unify(s2, engine.trail)) {
return engine.fail();
}
//END inline expansion
return cont;
}
}
class PRED_$map_compare_op_2_2 extends PRED_$map_compare_op_2 {
public Predicate exec(Prolog engine) {
// '$map_compare_op'(A,B):-A<0,!,B= <
Term a1, a2, a3;
Predicate cont;
a1 = engine.aregs[1];
a2 = engine.aregs[2];
cont = engine.cont;
// '$map_compare_op'(A,B):-['$get_level'(C),'$less_than'(A,0),'$cut'(C),'$unify'(B,<)]
a3 = new VariableTerm(engine);
//START inline expansion of $get_level(a(3))
if (! a3.unify(new IntegerTerm(engine.B0), engine.trail)) {
return engine.fail();
}
//END inline expansion
//START inline expansion of $less_than(a(1),si(1))
try {
if (Arithmetic.evaluate(a1).arithCompareTo(si1) >= 0) {
return engine.fail();
}
} catch (BuiltinException e) {
e.goal = this;
throw e;
}
//END inline expansion
//START inline expansion of $cut(a(3))
a3 = a3.dereference();
if (! a3.isInteger()) {
throw new IllegalTypeException("integer", a3);
} else {
engine.cut(((IntegerTerm) a3).intValue());
}
//END inline expansion
//START inline expansion of $unify(a(2),s(3))
if (! a2.unify(s3, engine.trail)) {
return engine.fail();
}
//END inline expansion
return cont;
}
}
class PRED_$map_compare_op_2_3 extends PRED_$map_compare_op_2 {
public Predicate exec(Prolog engine) {
// '$map_compare_op'(A,B):-A>0,!,B= >
Term a1, a2, a3;
Predicate cont;
a1 = engine.aregs[1];
a2 = engine.aregs[2];
cont = engine.cont;
// '$map_compare_op'(A,B):-['$get_level'(C),'$greater_than'(A,0),'$cut'(C),'$unify'(B,>)]
a3 = new VariableTerm(engine);
//START inline expansion of $get_level(a(3))
if (! a3.unify(new IntegerTerm(engine.B0), engine.trail)) {
return engine.fail();
}
//END inline expansion
//START inline expansion of $greater_than(a(1),si(1))
try {
if (Arithmetic.evaluate(a1).arithCompareTo(si1) <= 0) {
return engine.fail();
}
} catch (BuiltinException e) {
e.goal = this;
throw e;
}
//END inline expansion
//START inline expansion of $cut(a(3))
a3 = a3.dereference();
if (! a3.isInteger()) {
throw new IllegalTypeException("integer", a3);
} else {
engine.cut(((IntegerTerm) a3).intValue());
}
//END inline expansion
//START inline expansion of $unify(a(2),s(4))
if (! a2.unify(s4, engine.trail)) {
return engine.fail();
}
//END inline expansion
return cont;
}
}