Update tests

Author: lucic71

tests/unit/map.cpp

@@ -50,6 +50,8 @@ int main() {
   assert(it4->second == 6);
   assert(*p == 6);
   assert(x5 == 5);
+  std::map<short, unsigned>::const_iterator const_it4 = m.find(4);
+  assert((*const_it4).second == 6);
   auto &r = m;
   assert(r.size() == 4);
   assert(m.find(4) != m.end());

tests/unit/out/refcount/map.rs

@@ -423,6 +423,17 @@ fn main_0() -> i32 {
     assert!(((*(*it4.borrow()).deref().with(|__p| __p.1.clone()).borrow()) == 6_u32));
     assert!(((p.read()) == 6_u32));
     assert!((x5 == 5_u32));
+    let const_it4: Value<RefcountMapIter<i16, u32>> =
+        Rc::new(RefCell::new(RefcountMapIter::find_key(
+            (m.as_pointer() as Ptr<BTreeMap<i16, Value<(Value<i16>, Value<u32>)>>>),
+            &4_i16,
+        )));
+    assert!(
+        ((*(*(*const_it4.borrow()).deref().upgrade().deref())
+            .1
+            .borrow())
+            == 6_u32)
+    );
     let r: Ptr<BTreeMap<i16, Value<(Value<i16>, Value<u32>)>>> = m.as_pointer();
     assert!(((*r.upgrade().deref()).len() == 4_usize));
     assert!(

tests/unit/out/unsafe/map.rs

@@ -192,6 +192,9 @@ unsafe fn main_0() -> i32 {
     assert!(((*&raw mut (*it4.deref()).1) == (6_u32)));
     assert!(((*p) == (6_u32)));
     assert!(((x5) == (5_u32)));
+    let mut const_it4: UnsafeMapIterator<i16, u32> =
+        UnsafeMapIterator::find_key(&m as *const BTreeMap<i16, Box<(i16, u32)>>, &4_i16).clone();
+    assert!((((*const_it4.deref().cast_const()).1) == (6_u32)));
     let r: *mut BTreeMap<i16, Box<(i16, u32)>> = &mut m;
     assert!((((*r).len()) == (4_usize)));
     assert!(