Skip to content

Commit e649034

Browse files
lucic71lucic71
committed
Update tests
1 parent 99c92f3 commit e649034

5 files changed

Lines changed: 87 additions & 36 deletions

File tree

‎tests/unit/out/refcount/foreach_map.rs‎

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -60,6 +60,30 @@ fn main_0() -> i32 {
6060
sum += ((*(*i.borrow()).0.borrow()) as f64);
6161
}
6262
assert!((sum == 7475_f64));
63+
'loop_: for __begin1 in RefcountMapIter::begin(m.as_pointer()) {
64+
let __begin1: Value<RefcountMapIter<i32, f64>> = Rc::new(RefCell::new(__begin1));
65+
let i: Value<(Value<i32>, Value<f64>)> = Rc::new(RefCell::new((
66+
Rc::new(RefCell::new(
67+
(*(*__begin1.borrow()).deref().upgrade().deref())
68+
.0
69+
.borrow()
70+
.clone(),
71+
)),
72+
Rc::new(RefCell::new(
73+
(*(*__begin1.borrow()).deref().upgrade().deref())
74+
.1
75+
.borrow()
76+
.clone(),
77+
)),
78+
)));
79+
(*(*i.borrow()).1.borrow_mut()) = (-1_i32 as f64);
80+
assert!(((*(*i.borrow()).1.borrow()) == (-1_i32 as f64)));
81+
}
82+
'loop_: for __begin1 in RefcountMapIter::begin(m.as_pointer()) {
83+
let __begin1: Value<RefcountMapIter<i32, f64>> = Rc::new(RefCell::new(__begin1));
84+
let i: Ptr<(Value<i32>, Value<f64>)> = (*__begin1.borrow()).deref();
85+
assert!(((*(*i.upgrade().deref()).1.borrow()) != (-1_i32 as f64)));
86+
}
6387
return 0;
6488
}
6589
pub fn __cpp2rust_init_globals() {}

‎tests/unit/out/refcount/map.rs‎

Lines changed: 12 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -574,17 +574,26 @@ fn main_0() -> i32 {
574574
let mut indexes: Vec<i32> = Vec::new();
575575
let mut i: u32 = 60_u32;
576576
'loop_: while (i > 30_u32) {
577-
indexes.push((i as i32));
577+
{
578+
let __a1 = (i as i32);
579+
indexes.push(__a1)
580+
};
578581
i.prefix_dec();
579582
}
580583
let mut i: u32 = 100_u32;
581584
'loop_: while (i > 60_u32) {
582-
indexes.push((i as i32));
585+
{
586+
let __a1 = (i as i32);
587+
indexes.push(__a1)
588+
};
583589
i.prefix_dec();
584590
}
585591
let mut i: u32 = 30_u32;
586592
'loop_: while (i > 0_u32) {
587-
indexes.push((i as i32));
593+
{
594+
let __a1 = (i as i32);
595+
indexes.push(__a1)
596+
};
588597
i.prefix_dec();
589598
}
590599
let mut i: u32 = 0_u32;

‎tests/unit/out/unsafe/foreach_map.rs‎

Lines changed: 10 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ unsafe fn main_0() -> i32 {
1919
'loop_: while ((i) < (100)) {
2020
(*&mut m
2121
.entry(i.clone())
22-
.or_insert_with(|| Box::new((i, f64::default())))
22+
.or_insert_with(|| Box::new((i, <f64>::default())))
2323
.1) = ((k as f64) / (2_f64));
2424
{
2525
i.prefix_inc();
@@ -36,6 +36,15 @@ unsafe fn main_0() -> i32 {
3636
sum += (i.0 as f64);
3737
}
3838
assert!(((sum) == (7475_f64)));
39+
'loop_: for __begin1 in UnsafeMapIterator::begin(&m as *const BTreeMap<i32, Box<(i32, f64)>>) {
40+
let mut i: (i32, f64) = (*__begin1.deref()).clone();
41+
i.1 = (-1_i32 as f64);
42+
assert!(((i.1) == (-1_i32 as f64)));
43+
}
44+
'loop_: for __begin1 in UnsafeMapIterator::begin(&m as *const BTreeMap<i32, Box<(i32, f64)>>) {
45+
let i: *const (i32, f64) = &(*__begin1.deref());
46+
assert!((((*i).1) != (-1_i32 as f64)));
47+
}
3948
return 0;
4049
}
4150
pub unsafe fn __cpp2rust_init_globals() {}

‎tests/unit/out/unsafe/map-reallocation.rs‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ unsafe fn main_0() -> i32 {
1818
let mut m: BTreeMap<i32, Box<(i32, i32)>> = BTreeMap::new();
1919
(*&mut m
2020
.entry(sentinel.clone())
21-
.or_insert_with(|| Box::new((sentinel, i32::default())))
21+
.or_insert_with(|| Box::new((sentinel, <i32>::default())))
2222
.1) = sentinel;
2323
let mut it: UnsafeMapIterator<i32, i32> =
2424
UnsafeMapIterator::find_key(&m as *const BTreeMap<i32, Box<(i32, i32)>>, &sentinel);
@@ -35,15 +35,15 @@ unsafe fn main_0() -> i32 {
3535
'loop_: while ((i) < (sentinel)) {
3636
(*&mut m
3737
.entry(i.clone())
38-
.or_insert_with(|| Box::new((i, i32::default())))
38+
.or_insert_with(|| Box::new((i, <i32>::default())))
3939
.1) = i;
4040
i.prefix_inc();
4141
}
4242
let mut i: i32 = ((sentinel) + (1));
4343
'loop_: while ((i) <= (N)) {
4444
(*&mut m
4545
.entry(i.clone())
46-
.or_insert_with(|| Box::new((i, i32::default())))
46+
.or_insert_with(|| Box::new((i, <i32>::default())))
4747
.1) = i;
4848
i.prefix_inc();
4949
}
@@ -64,7 +64,7 @@ unsafe fn main_0() -> i32 {
6464
assert!(
6565
((*&mut m
6666
.entry(sentinel.clone())
67-
.or_insert_with(|| Box::new((sentinel, i32::default())))
67+
.or_insert_with(|| Box::new((sentinel, <i32>::default())))
6868
.1)
6969
== (57005))
7070
);

‎tests/unit/out/unsafe/map.rs‎

Lines changed: 37 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -22,112 +22,112 @@ unsafe fn main_0() -> i32 {
2222
let mut m: BTreeMap<i16, Box<(i16, u32)>> = BTreeMap::new();
2323
(*&mut m
2424
.entry(0_i16.clone())
25-
.or_insert_with(|| Box::new((0_i16, u32::default())))
25+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
2626
.1) = 1_u32;
2727
(*&mut m
2828
.entry(1_i16.clone())
29-
.or_insert_with(|| Box::new((1_i16, u32::default())))
29+
.or_insert_with(|| Box::new((1_i16, <u32>::default())))
3030
.1) = 2_u32;
3131
(*&mut m
3232
.entry(2_i16.clone())
33-
.or_insert_with(|| Box::new((2_i16, u32::default())))
33+
.or_insert_with(|| Box::new((2_i16, <u32>::default())))
3434
.1) = 3_u32;
3535
assert!(((m.len()) == (3_usize)));
3636
assert!(
3737
((*&mut m
3838
.entry(0_i16.clone())
39-
.or_insert_with(|| Box::new((0_i16, u32::default())))
39+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
4040
.1)
4141
== (1_u32))
4242
);
4343
assert!(
4444
((*&mut m
4545
.entry(1_i16.clone())
46-
.or_insert_with(|| Box::new((1_i16, u32::default())))
46+
.or_insert_with(|| Box::new((1_i16, <u32>::default())))
4747
.1)
4848
== (2_u32))
4949
);
5050
assert!(
5151
((*&mut m
5252
.entry(2_i16.clone())
53-
.or_insert_with(|| Box::new((2_i16, u32::default())))
53+
.or_insert_with(|| Box::new((2_i16, <u32>::default())))
5454
.1)
5555
== (3_u32))
5656
);
5757
let mut x: i32 = 4;
5858
(*&mut m
5959
.entry(1_i16.clone())
60-
.or_insert_with(|| Box::new((1_i16, u32::default())))
60+
.or_insert_with(|| Box::new((1_i16, <u32>::default())))
6161
.1) = (x as u32);
6262
assert!(((m.len()) == (3_usize)));
6363
assert!(
6464
((*&mut m
6565
.entry(0_i16.clone())
66-
.or_insert_with(|| Box::new((0_i16, u32::default())))
66+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
6767
.1)
6868
== (1_u32))
6969
);
7070
assert!(
7171
((*&mut m
7272
.entry(1_i16.clone())
73-
.or_insert_with(|| Box::new((1_i16, u32::default())))
73+
.or_insert_with(|| Box::new((1_i16, <u32>::default())))
7474
.1)
7575
== (4_u32))
7676
);
7777
assert!(
7878
((*&mut m
7979
.entry(2_i16.clone())
80-
.or_insert_with(|| Box::new((2_i16, u32::default())))
80+
.or_insert_with(|| Box::new((2_i16, <u32>::default())))
8181
.1)
8282
== (3_u32))
8383
);
8484
(unsafe {
8585
foo_0(
8686
(*&mut m
8787
.entry(0_i16.clone())
88-
.or_insert_with(|| Box::new((0_i16, u32::default())))
88+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
8989
.1),
9090
)
9191
});
9292
assert!(
9393
((*&mut m
9494
.entry(0_i16.clone())
95-
.or_insert_with(|| Box::new((0_i16, u32::default())))
95+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
9696
.1)
9797
== (1_u32))
9898
);
9999
(unsafe {
100100
bar_1(
101101
&mut (*&mut m
102102
.entry(2_i16.clone())
103-
.or_insert_with(|| Box::new((2_i16, u32::default())))
103+
.or_insert_with(|| Box::new((2_i16, <u32>::default())))
104104
.1),
105105
)
106106
});
107107
assert!(
108108
((*&mut m
109109
.entry(2_i16.clone())
110-
.or_insert_with(|| Box::new((2_i16, u32::default())))
110+
.or_insert_with(|| Box::new((2_i16, <u32>::default())))
111111
.1)
112112
== (4_u32))
113113
);
114114
(*&mut m
115115
.entry(0_i16.clone())
116-
.or_insert_with(|| Box::new((0_i16, u32::default())))
116+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
117117
.1) = (*&mut m
118118
.entry(0_i16.clone())
119-
.or_insert_with(|| Box::new((0_i16, u32::default())))
119+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
120120
.1)
121121
.wrapping_add(
122122
(*&mut m
123123
.entry(2_i16.clone())
124-
.or_insert_with(|| Box::new((2_i16, u32::default())))
124+
.or_insert_with(|| Box::new((2_i16, <u32>::default())))
125125
.1),
126126
);
127127
assert!(
128128
((*&mut m
129129
.entry(0_i16.clone())
130-
.or_insert_with(|| Box::new((0_i16, u32::default())))
130+
.or_insert_with(|| Box::new((0_i16, <u32>::default())))
131131
.1)
132132
== (5_u32))
133133
);
@@ -165,7 +165,7 @@ unsafe fn main_0() -> i32 {
165165
assert!(((x4) == (0_u32)));
166166
(*&mut m
167167
.entry(4_i16.clone())
168-
.or_insert_with(|| Box::new((4_i16, u32::default())))
168+
.or_insert_with(|| Box::new((4_i16, <u32>::default())))
169169
.1) = 5_u32;
170170
let mut it4: UnsafeMapIterator<i16, u32> =
171171
UnsafeMapIterator::find_key(&m as *const BTreeMap<i16, Box<(i16, u32)>>, &4_i16);
@@ -174,7 +174,7 @@ unsafe fn main_0() -> i32 {
174174
assert!(
175175
((*&mut m
176176
.entry(4_i16.clone())
177-
.or_insert_with(|| Box::new((4_i16, u32::default())))
177+
.or_insert_with(|| Box::new((4_i16, <u32>::default())))
178178
.1)
179179
== (5_u32))
180180
);
@@ -185,7 +185,7 @@ unsafe fn main_0() -> i32 {
185185
assert!(
186186
((*&mut m
187187
.entry(4_i16.clone())
188-
.or_insert_with(|| Box::new((4_i16, u32::default())))
188+
.or_insert_with(|| Box::new((4_i16, <u32>::default())))
189189
.1)
190190
== (6_u32))
191191
);
@@ -210,17 +210,17 @@ unsafe fn main_0() -> i32 {
210210
let mut value: f64 = 2_f64;
211211
(*&mut other_map
212212
.entry(key0.clone())
213-
.or_insert_with(|| Box::new((key0, f64::default())))
213+
.or_insert_with(|| Box::new((key0, <f64>::default())))
214214
.1) = value;
215215
value = (*&mut other_map
216216
.entry(key0.clone())
217-
.or_insert_with(|| Box::new((key0, f64::default())))
217+
.or_insert_with(|| Box::new((key0, <f64>::default())))
218218
.1);
219219
assert!(((other_map.len()) == (1_usize)));
220220
assert!(
221221
((*&mut other_map
222222
.entry(key0.clone())
223-
.or_insert_with(|| Box::new((key0, f64::default())))
223+
.or_insert_with(|| Box::new((key0, <f64>::default())))
224224
.1)
225225
== (value))
226226
);
@@ -236,24 +236,33 @@ unsafe fn main_0() -> i32 {
236236
let mut indexes: Vec<i32> = Vec::new();
237237
let mut i: u32 = 60_u32;
238238
'loop_: while ((i) > (30_u32)) {
239-
indexes.push((i as i32));
239+
{
240+
let __a1 = (i as i32);
241+
indexes.push(__a1)
242+
};
240243
i.prefix_dec();
241244
}
242245
let mut i: u32 = 100_u32;
243246
'loop_: while ((i) > (60_u32)) {
244-
indexes.push((i as i32));
247+
{
248+
let __a1 = (i as i32);
249+
indexes.push(__a1)
250+
};
245251
i.prefix_dec();
246252
}
247253
let mut i: u32 = 30_u32;
248254
'loop_: while ((i) > (0_u32)) {
249-
indexes.push((i as i32));
255+
{
256+
let __a1 = (i as i32);
257+
indexes.push(__a1)
258+
};
250259
i.prefix_dec();
251260
}
252261
let mut i: u32 = 0_u32;
253262
'loop_: while ((i as usize) < (indexes.len())) {
254263
(*&mut m2
255264
.entry(indexes[(i as usize)].clone())
256-
.or_insert_with(|| Box::new((indexes[(i as usize)], bool::default())))
265+
.or_insert_with(|| Box::new((indexes[(i as usize)], <bool>::default())))
257266
.1) = ((i).wrapping_rem(2_u32) != 0);
258267
i.prefix_inc();
259268
}

0 commit comments

Comments
 (0)