use crate::prolog::heap_iter::*;
use crate::prolog::machine::*;
-use indexmap::IndexSet;
-
use std::cmp::Ordering;
use std::vec::IntoIter;
}
pub(super)
- fn attr_vars_of_term(&self, addr: Addr) -> IndexSet<Addr> {
- let mut seen_vars = IndexSet::new();
+ fn attr_vars_of_term(&self, addr: Addr) -> Vec<Addr> {
+ let mut seen_vars = vec![];
let mut iter = self.acyclic_pre_order_iter(addr);
while let Some(addr) = iter.next() {
if let HeapCellValue::Addr(Addr::AttrVar(h)) = self.heap.index_addr(&addr).as_ref() {
- seen_vars.insert(addr);
+ seen_vars.push(addr);
let mut l = h + 1;
let mut list_elements = vec![];
use crate::ref_thread_local::RefThreadLocal;
-use indexmap::IndexSet;
-
use std::cmp;
use std::convert::TryFrom;
use std::io::{stdout, Read, Write};
}
&SystemClauseType::TermVariables => {
let a1 = self[temp_v!(1)];
- let mut seen_vars = IndexSet::new();
+ let mut seen_vars = vec![];
for addr in self.acyclic_pre_order_iter(a1) {
if addr.is_ref() {
- seen_vars.insert(addr);
+ seen_vars.push(addr);
}
}
let outcome = Addr::HeapCell(self.heap.to_list(seen_vars.into_iter()));
-
- let a2 = self[temp_v!(2)];
- self.unify(a2, outcome);
+ self.unify(self[temp_v!(2)], outcome);
}
&SystemClauseType::TruncateLiftedHeapTo => {
match self.store(self.deref(self[temp_v!(1)])) {