Lines Matching defs:size
242 size_type last = min(v1.size(), v2.size()) - 1;
249 return v1.size() < v2.size();
286 size_type s = size();
287 if (subnames.size() < s)
289 if (subdescs.size() < s)
296 size_type s = size();
297 if (subnames.size() < s)
299 if (subdescs.size() < s)
306 if (subnames.size() < x)
308 if (subdescs.size() < x)
310 if (y_subnames.size() < y)
317 int size = cvec.size();
318 int zero = size / 2; // round down!
319 int top_half = zero + (size - zero + 1) / 2; // round up!
320 int bottom_half = (size - zero) / 2; // round down!
339 if (high_pair + 1 < size)
343 assert(high_pair == size || high_pair == size + 1);
345 for (int i = top_half; i < size; i++)
356 int size = cvec.size();
357 int half = (size + 1) / 2; // round up!
358 //bool even = (size & 1) == 0;
360 int pair = size - 1;
361 for (int i = size - 1; i >= half; --i) {
378 int size = cvec.size();
379 int half = (size + 1) / 2; // round up!
384 if (pair + 1 < size)
388 assert(pair == size || pair == size + 1);
390 for (int i = half; i < size; i++)
400 int b_size = hs->size();
401 assert(size() == b_size);
439 assert(size());
453 assert(size());
463 assert(size());
482 Formula::size() const
487 return root->size();
500 for (VResult::size_type i = 0; i < vec.size(); ++i)