@@ -68,7 +68,7 @@ impl Results {
68
68
rand_cap : uint ,
69
69
f: || -> T ) { {
70
70
let mut set = f ( ) ;
71
- timed ( & mut self . sequential_ints , move || {
71
+ timed ( & mut self . sequential_ints , || {
72
72
for i in range ( 0 u, num_keys) {
73
73
set. insert ( i) ;
74
74
}
@@ -81,7 +81,7 @@ impl Results {
81
81
82
82
{
83
83
let mut set = f ( ) ;
84
- timed ( & mut self . random_ints , move || {
84
+ timed ( & mut self . random_ints , || {
85
85
for _ in range ( 0 , num_keys) {
86
86
set. insert ( rng. gen :: < uint > ( ) % rand_cap) ;
87
87
}
@@ -94,7 +94,7 @@ impl Results {
94
94
set. insert ( i) ;
95
95
}
96
96
97
- timed ( & mut self . delete_ints , move || {
97
+ timed ( & mut self . delete_ints , || {
98
98
for i in range ( 0 u, num_keys) {
99
99
assert ! ( set. remove( & i) ) ;
100
100
}
@@ -110,7 +110,7 @@ impl Results {
110
110
f: || -> T ) {
111
111
{
112
112
let mut set = f ( ) ;
113
- timed ( & mut self . sequential_strings , move || {
113
+ timed ( & mut self . sequential_strings , || {
114
114
for i in range ( 0 u, num_keys) {
115
115
set. insert ( i. to_string ( ) ) ;
116
116
}
@@ -123,7 +123,7 @@ impl Results {
123
123
124
124
{
125
125
let mut set = f ( ) ;
126
- timed ( & mut self . random_strings , move || {
126
+ timed ( & mut self . random_strings , || {
127
127
for _ in range ( 0 , num_keys) {
128
128
let s = rng. gen :: < uint > ( ) . to_string ( ) ;
129
129
set. insert ( s) ;
@@ -136,7 +136,7 @@ impl Results {
136
136
for i in range ( 0 u, num_keys) {
137
137
set. insert ( i. to_string ( ) ) ;
138
138
}
139
- timed ( & mut self . delete_strings , move || {
139
+ timed ( & mut self . delete_strings , || {
140
140
for i in range ( 0 u, num_keys) {
141
141
assert ! ( set. remove( & i. to_string( ) ) ) ;
142
142
}
0 commit comments