Lines Matching defs:value
38 * Test if the maximum value is indeed the maximum value reachable.
54 * Test if the minimum value is indeed the mimimum value reachable.
69 * Test initializing the counter with a value, updating it and then resetting.
92 for (double value = 0.0; value <= max_value; value++, counter++) {
93 const double saturation = value / max_value;
110 // Make sure the value added is what was missing to saturate
123 int value = 0;
125 ASSERT_EQ(counter++, value++);
126 ASSERT_EQ(counter++, value++);
127 ASSERT_EQ(counter--, value--);
128 ASSERT_EQ(counter++, value++);
129 ASSERT_EQ(counter++, value++);
130 ASSERT_EQ(counter--, value--);
131 ASSERT_EQ(counter++, value++);
132 ASSERT_EQ(counter--, value--);
133 ASSERT_EQ(counter--, value--);
134 ASSERT_EQ(counter++, value++);
135 ASSERT_EQ(counter--, value--);
136 ASSERT_EQ(counter--, value--);
150 // The saturated shift value is just enough to saturate, since greater
153 int value = initial_value;
157 value <<= 2;
158 ASSERT_EQ(counter, value);
160 value >>= 1;
161 ASSERT_EQ(counter, value);
173 value = initial_value;
175 value <<= other;
176 ASSERT_EQ(counter, value);
178 value = max_value;
183 value >>= other;
184 ASSERT_EQ(counter, value);
230 // Increase counter value so that we can check if the inner counter is
241 // Make sure max value is the same for all of them, and that modifying
253 // Make sure initial value is the same for all of them
282 int value = 0;
286 value += 2;
287 ASSERT_EQ(counter, value);
289 value += 3;
290 ASSERT_EQ(counter, value);
292 value = max_value;
293 ASSERT_EQ(counter, value);
297 value -= 2;
298 ASSERT_EQ(counter, value);
300 value -= 3;
301 ASSERT_EQ(counter, value);
303 value = 0;
304 ASSERT_EQ(counter, value);
308 value += other;
309 ASSERT_EQ(counter, value);
311 value = max_value;
316 value -= other;
317 ASSERT_EQ(counter, value);