do not unify partial strings unless they coincide in memory

diff --git a/src/prolog/machine/machine_state_impl.rs b/src/prolog/machine/machine_state_impl.rs
index 2e223b6e96aea60f13b80dfa733fadb20b429074..874739340d14545c4536aff43080f1dd2b0807ef 100644 (file)
--- a/src/prolog/machine/machine_state_impl.rs
+++ b/src/prolog/machine/machine_state_impl.rs
@@ -254,7 +254,7 @@ impl MachineState {
 
                                         return true;
                                     }
-                                } else if s2.is_expandable() {                                
+                                } else if s2.is_expandable() {
                                     pdl.push(Addr::Con(Constant::String(s2.push_char(c1))));
                                     pdl.push(Addr::Con(Constant::String(s1.tail())));
 
@@ -264,12 +264,12 @@ impl MachineState {
                                 if let Some(c) = s2.head() {
                                     pdl.push(Addr::Con(Constant::String(s1.push_char(c))));
                                     pdl.push(Addr::Con(Constant::String(s2.tail())));
-                                } else if !s2.is_expandable() {
+                                } else if s2.is_expandable() {
+                                    return s1 == s2;
+                                } else {
                                     s1.set_non_expandable();
-                                }/*else {
-                                 //TODO: unify the tails of s1 and s2? I guess?
-                                }*/
-                                
+                                }
+
                                 return true;
                             } else if s2.head().is_none() {
                                 s2.set_non_expandable();
@@ -1445,7 +1445,7 @@ impl MachineState {
 
         false
     }
-    
+
     pub(super) fn compare_term_test(&self, a1: &Addr, a2: &Addr) -> Ordering {
         let iter = self.zipped_acyclic_pre_order_iter(a1.clone(), a2.clone());
 
@@ -1526,7 +1526,7 @@ impl MachineState {
                  HeapCellValue::Addr(Addr::Con(Constant::Number(_)))) =>
                     return Ordering::Greater,
                 (HeapCellValue::Addr(Addr::Con(Constant::String(s1))),
-                 HeapCellValue::Addr(Addr::Con(Constant::String(s2)))) =>                    
+                 HeapCellValue::Addr(Addr::Con(Constant::String(s2)))) =>
                     return s1.cmp(&s2),
                 (HeapCellValue::Addr(Addr::Con(Constant::String(_))), _) =>
                     return Ordering::Less,

diff --git a/src/tests.rs b/src/tests.rs
index f165c0ab0e1efab2c4534deeaf5b28dec9ad5db8..bc5b928949571201df931f43ed30d34ef7e289ce 100644 (file)
--- a/src/tests.rs
+++ b/src/tests.rs
@@ -1881,6 +1881,9 @@ fn test_queries_on_string_lists()
     assert_prolog_success!(&mut wam, "?- partial_string(\"abc\", X).",
                            [["X = [a, b, c | _]"]]);
 
+    assert_prolog_failure!(&mut wam, "?- partial_string(\"abc\", X), partial_string(\"abc\", Y), matcher(X, V),
+                                         matcher(Y, Z), V = Z.");
+
     submit(&mut wam, "matcher([a, b, c | X], X).");
 
     assert_prolog_success!(&mut wam, "?- partial_string(\"abc\", X), matcher(X, Y).",