Lines Matching refs:right
285 int FindInSorted(const T item, unsigned left, unsigned right) const
287 while (left != right)
289 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2);
290 const unsigned mid = (left + right) / 2;
295 right = mid;
302 int FindInSorted2(const T &item, unsigned left, unsigned right) const
304 while (left != right)
306 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2);
307 const unsigned mid = (left + right) / 2;
313 right = mid;
332 unsigned left = 0, right = _size;
333 while (left != right)
335 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2);
336 const unsigned mid = (left + right) / 2;
341 right = mid;
345 Insert(right, item);
346 return right;
351 unsigned left = 0, right = _size;
352 while (left != right)
354 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2);
355 const unsigned mid = (left + right) / 2;
361 right = mid;
365 Insert(right, item);
366 return right;
637 unsigned left = 0, right = Size();
638 while (left != right)
640 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2);
641 const unsigned mid = (left + right) / 2;
647 right = mid;
656 unsigned left = 0, right = Size();
657 while (left != right)
659 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2);
660 const unsigned mid = (left + right) / 2;
666 right = mid;
670 Insert(right, item);
671 return right;
677 unsigned left = 0, right = Size();
678 while (left != right)
680 // const unsigned mid = (unsigned)(((size_t)left + (size_t)right) / 2);
681 const unsigned mid = (left + right) / 2;
686 right = mid + 1;
690 right = mid;
694 Insert(right, item);
695 return right;