blob: 7c2f201b34b45ffdf0405aee74d337a8959c8d98 [file] [log] [blame]
package jp.ac.kobe_u.cs.prolog.builtin;
import jp.ac.kobe_u.cs.prolog.lang.*;
import java.util.Hashtable;
/**
<code>'$hash_remove_first'/3</code><br>
@author Mutsunori Banbara (banbara@kobe-u.ac.jp)
@author Naoyuki Tamura (tamura@kobe-u.ac.jp)
@version 1.0
*/
class PRED_$hash_remove_first_3 extends Predicate {
public static SymbolTerm SYM_NIL = SymbolTerm.makeSymbol("[]");
public Term arg1, arg2, arg3;
public PRED_$hash_remove_first_3(Term a1, Term a2, Term a3, Predicate cont) {
arg1 = a1;
arg2 = a2;
arg3 = a3;
this.cont = cont;
}
public PRED_$hash_remove_first_3(){}
public void setArgument(Term[] args, Predicate cont) {
arg1 = args[0];
arg2 = args[1];
arg3 = args[2];
this.cont = cont;
}
public int arity() { return 3; }
public String toString() {
return "$hash_remove_first(" + arg1 + "," + arg2 + "," + arg3 + ")";
}
public Predicate exec(Prolog engine) {
engine.setB0();
Term a1, a2, a3;
a1 = arg1;
a2 = arg2;
a3 = arg3;
Object hash = null;
a1 = a1.dereference();
if (a1.isVariable()) {
throw new PInstantiationException(this, 1);
} else if (a1.isSymbol()) {
if (! engine.getHashManager().containsKey(a1))
throw new ExistenceException(this, 1, "hash", a1, "");
hash = ((JavaObjectTerm) engine.getHashManager().get(a1)).object();
} else if (a1.isJavaObject()) {
hash = ((JavaObjectTerm) a1).object();
} else {
throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
}
if (! (hash instanceof HashtableOfTerm))
throw new InternalException(this + ": Hash is not HashtableOfTerm");
a2 = a2.dereference();
Term elem = ((HashtableOfTerm) hash).get(a2);
if (elem == null || elem.isNil())
return cont;
a3 = a3.dereference();
Term x = elem;
Term x0 = Prolog.Nil;
Term y,z;
while(! x.isNil()) {
if (! x.isList())
throw new InternalException(this + ": the valus of " + a2 + " is not list structure");
y = ((ListTerm)x).car().dereference();
z = ((ListTerm)x).cdr().dereference();
if (y.equals(a3)) {
if (z.isNil()) {
if (x0.isList())
((ListTerm)x0).setCdr(Prolog.Nil);
else
elem = Prolog.Nil;
} else {
((ListTerm)x).setCar(((ListTerm)z).car().dereference());
((ListTerm)x).setCdr(((ListTerm)z).cdr().dereference());
}
break;
}
x0 = x;
x = z;
}
if (elem.isNil() && a2.isInteger()) {
((HashtableOfTerm)hash).remove(a2);
// System.out.println("################ key " + a2 + " is removed");
} else {
((HashtableOfTerm) hash).put(a2, elem);
}
return cont;
}
}