Package jp.ac.kobe_u.cs.prolog.builtin

Source Code of jp.ac.kobe_u.cs.prolog.builtin.PRED_new_hash_2

package jp.ac.kobe_u.cs.prolog.builtin;

import jp.ac.kobe_u.cs.prolog.lang.HashMapOfTerm;
import jp.ac.kobe_u.cs.prolog.lang.IllegalDomainException;
import jp.ac.kobe_u.cs.prolog.lang.IllegalTypeException;
import jp.ac.kobe_u.cs.prolog.lang.JavaObjectTerm;
import jp.ac.kobe_u.cs.prolog.lang.ListTerm;
import jp.ac.kobe_u.cs.prolog.lang.PInstantiationException;
import jp.ac.kobe_u.cs.prolog.lang.PermissionException;
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.StructureTerm;
import jp.ac.kobe_u.cs.prolog.lang.SymbolTerm;
import jp.ac.kobe_u.cs.prolog.lang.Term;

/**
* <code>new_hash/2</code><br>
*
* @author Mutsunori Banbara (banbara@kobe-u.ac.jp)
* @author Naoyuki Tamura (tamura@kobe-u.ac.jp)
* @version 1.0
*/
public class PRED_new_hash_2 extends Predicate {
  /**
   *
   */
  private static final long serialVersionUID = 5747853528773028125L;
  private final static SymbolTerm SYM_NIL = SymbolTerm.makeSymbol("[]");
  private final static SymbolTerm SYM_ALIAS_1 = SymbolTerm.makeSymbol(
      "alias", 1);
  private Term arg1, arg2;

  public PRED_new_hash_2(Term a1, Term a2, Predicate cont) {
    arg1 = a1;
    arg2 = a2;
    this.cont = cont;
  }

  public PRED_new_hash_2() {
  }

  @Override
  public void setArgument(Term[] args, Predicate cont) {
    arg1 = args[0];
    arg2 = args[1];
    this.cont = cont;
  }

  @Override
  public int arity() {
    return 2;
  }

  @Override
  public String toString() {
    return "new_hash(" + arg1 + "," + arg2 + ")";
  }

  @Override
  public Predicate exec(Prolog engine) {
    engine.setB0();
    Term a1, a2;
    a1 = arg1;
    a2 = arg2;

    a1 = a1.dereference();
    if (!a1.isVariable()) {
      throw new IllegalTypeException(this, 1, "variable", a1);
    }
    Term newHash = new JavaObjectTerm(new HashMapOfTerm());
    a2 = a2.dereference();
    if (a2.isNil()) {
      if (!a1.unify(newHash, engine.trail)) {
        return engine.fail();
      }
      return cont;
    } else if (!a2.isList()) {
      throw new IllegalTypeException(this, 2, "list", a2);
    }
    // a2 is list
    Term tmp = a2;
    while (!tmp.isNil()) {
      if (tmp.isVariable()) {
        throw new PInstantiationException(this, 2);
      }
      if (!tmp.isList()) {
        throw new IllegalTypeException(this, 2, "list", a2);
      }
      Term car = ((ListTerm) tmp).car().dereference();
      if (car.isVariable()) {
        throw new PInstantiationException(this, 2);
      }
      if (car.isStructure()) {
        SymbolTerm functor = ((StructureTerm) car).functor();
        Term[] args = ((StructureTerm) car).args();
        if (functor.equals(SYM_ALIAS_1)) {
          Term alias = args[0].dereference();
          if (!alias.isSymbol()) {
            throw new IllegalDomainException(this, 2,
                "hash_option", car);
          } else {
            if (engine.getHashManager().containsKey(alias)) {
              throw new PermissionException(this, "new", "hash",
                  car, "");
            }
            engine.getHashManager().put(alias, newHash);
          }
        } else {
          throw new IllegalDomainException(this, 2, "hash_option",
              car);
        }
      } else {
        throw new IllegalDomainException(this, 2, "hash_option", car);
      }
      tmp = ((ListTerm) tmp).cdr().dereference();
    }
    if (!a1.unify(newHash, engine.trail)) {
      return engine.fail();
    }
    return cont;
  }
}
TOP

Related Classes of jp.ac.kobe_u.cs.prolog.builtin.PRED_new_hash_2

TOP
Copyright © 2018 www.massapi.com. 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.