package jp.ac.kobe_u.cs.prolog.builtin;
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.Term;
/*
This file is generated by Prolog Cafe.
PLEASE DO NOT EDIT!
*/
/**
<code>'$not_after'/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
*/
public class PRED_$not_after_2 extends Predicate {
public Term arg1, arg2;
public PRED_$not_after_2(Term a1, Term a2, Predicate cont) {
arg1 = a1;
arg2 = a2;
this.cont = cont;
}
public PRED_$not_after_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 "$not_after(" + arg1 + "," + arg2 + ")";
}
public Predicate exec(Prolog engine) {
// '$not_after'(A,B):-'$not_after'(A,B)
engine.setB0();
Term a1, a2;
a1 = arg1;
a2 = arg2;
// '$not_after'(A,B):-['$not_after'(A,B)]
//START inline expansion of $not_after(a(1),a(2))
a1 = a1.dereference();
a2 = a2.dereference();
if (a1.compareTo(a2) > 0) {
return engine.fail();
}
//END inline expansion
return cont;
}
}