+Thu Nov 6 11:19:09 1997 Jason Merrill <jason@yorick.cygnus.com>
+
+ * stl_algo.h, stl_algobase.h, stl_bvector.h,
+ stl_deque.h: Update to October 28 SGI release.
+
Sun Nov 2 12:14:56 1997 Jason Merrill <jason@yorick.cygnus.com>
* algo.h, algobase.h, alloc.h, bvector.h, defalloc.h, deque.h,
for (Distance child = 1; child < n; ++child) {
if (first[parent] < first[child])
return false;
- if (child & 1 == 0)
+ if ((child & 1) == 0)
++parent;
}
return true;
for (Distance child = 1; child < n; ++child) {
if (comp(first[parent], first[child]))
return false;
- if (child & 1 == 0)
+ if ((child & 1) == 0)
++parent;
}
return true;
#ifndef __BORLANDC__
+#undef min
+#undef max
+
template <class T>
inline const T& min(const T& a, const T& b) {
return b < a ? b : a;
void insert(iterator pos, long n, bool x) { insert(pos, (size_type)n, x); }
void pop_back() { --finish; }
- void erase(iterator position) {
+ iterator erase(iterator position) {
if (position + 1 != end())
copy(position + 1, end(), position);
--finish;
+ return position;
}
- void erase(iterator first, iterator last) {
+ iterator erase(iterator first, iterator last) {
finish = copy(last, end(), first);
+ return first;
}
void resize(size_type new_size, bool x = bool()) {
if (new_size < size())
iterator next = pos;
++next;
difference_type index = pos - start;
- if (index < size() >> 1) {
+ if (index < (size() >> 1)) {
copy_backward(start, pos, next);
pop_front();
}