Lines Matching refs:right
81 int FindInSorted(const T& item, int left, int right) const
83 while (left != right)
85 int mid = (left + right) / 2;
90 right = mid;
99 int left = 0, right = Size();
100 while (left != right)
102 int mid = (left + right) / 2;
107 right = mid;
116 int left = 0, right = Size();
117 while (left != right)
119 int mid = (left + right) / 2;
124 right = mid;
128 Insert(right, item);
129 return right;
223 int left = 0, right = Size();
224 while (left != right)
226 int mid = (left + right) / 2;
231 right = mid;
239 int left = 0, right = Size();
240 while (left != right)
242 int mid = (left + right) / 2;
246 right = mid + 1;
250 right = mid;
254 Insert(right, item);
255 return right;
