Package jp.ac.kobe_u.cs.prolog.lang

Examples of jp.ac.kobe_u.cs.prolog.lang.InternalException

74
75
76
77
78
79
80
81
82
83
84
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    Term keys = SYM_NIL;
    for (Term term : ((HashMapOfTerm) hash).keySet()) {
      keys = new ListTerm(term, keys);
    }
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    a2 = a2.dereference();
    a3 = a3.dereference();
    ((HashMapOfTerm) hash).put(a2, a3);
    return cont;
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    a2 = a2.dereference();
    if (!((HashMapOfTerm) hash).containsKey(a2)) {
      return engine.fail();
    }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    a2 = a2.dereference();
    ((HashMapOfTerm) hash).remove(a2);
    return cont;
  }
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    a2 = a2.dereference();
    Term elem = ((HashMapOfTerm) hash).get(a2);
    if (elem == null) {
      elem = SYM_NIL;
View Full Code Here
69
70
71
72
73
74
75
76
77
78
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    ((HashMapOfTerm) hash).clear();
    return cont;
  }
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
      }
    } catch (IOException e) {
      throw new PermissionException(this, "open", "source_sink", a1, "");
    }
    if (engine.getStreamManager().containsKey(streamObject)) {
      throw new InternalException("stream object is duplicated");
    }
    // stream_options
    a4 = a4.dereference();
    Term tmp = a4;
    while (!tmp.isNil()) {
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    a2 = a2.dereference();
    Term elem = ((HashMapOfTerm) hash).get(a2);
    if (elem == null) {
      elem = SYM_NIL;
    }
    a3 = a3.dereference();
    if (elem.isNil()) {
      elem = new ListTerm(a3, elem);
    } else {
      Term x = elem;
      Term y;
      while (true) {
        if (!x.isList()) {
          throw new InternalException(this + ": the valus of " + a2
              + " is not list structure");
        }
        y = ((ListTerm) x).cdr().dereference();
        if (y.isNil()) {
          ((ListTerm) x).setCdr(new ListTerm(a3, SYM_NIL));
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    a2 = a2.dereference();
    Term elem = ((HashMapOfTerm) hash).get(a2);
    if (elem == null) {
      elem = SYM_NIL;
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
      hash = ((JavaObjectTerm) a1).object();
    } else {
      throw new IllegalDomainException(this, 1, "hash_or_alias", a1);
    }
    if (!(hash instanceof HashMapOfTerm)) {
      throw new InternalException(this + ": Hash is not HashtableOfTerm");
    }
    a2 = a2.dereference();
    if (!a2.isVariable() && !a2.isInteger()) {
      throw new IllegalTypeException(this, 1, "integer", a2);
    }
View Full Code Here
TOP

Related Classes of jp.ac.kobe_u.cs.prolog.lang.InternalException

  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$hash_adda_3
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$hash_addz_3
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_$hash_remove_first_3
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_hash_clear_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_hash_contains_key_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_hash_get_3
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_hash_is_empty_1
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_hash_keys_2
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_hash_put_3
  • jp.ac.kobe_u.cs.prolog.builtin.PRED_hash_remove_2
    • Copyright © 2018 www.massapicom. 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.