* include/bits/std_complex.h: Default initialize second argument
of polar to 0, as specified in Library DR #79
2001-10-19 Brendan Kehoe <brendan@zen.org>
* include/bits/stl_raw_storage_iter.h (operator=): Fix to call
_Construct instead of construct.
2001-10-19 Brendan Kehoe <brendan@zen.org>
* include/bits/basic_string.tcc (find_first_not_of): Take out check for
__n being non-zero, since the standard does not mandate that.
e.g., a search for "" in "" should yield position 0, not npos.
(find_last_not_of): Likewise.
2001-10-19 Brendan Kehoe <brendan@zen.org>
* include/bits/stl_bvector.h (vector<bool>::_M_range_check): Fix
to throw out_of_range, not range_error, thus sayeth $23.1.1.13.
2001-10-19 Brendan Kehoe <brendan@zen.org>
* include/bits/stl_iterator.h (reverse_iterator::current): Rename
member from _M_current, and change all uses; thus sayeth $24.4.1.1.
2001-10-19 Brendan Kehoe <brendan@zen.org>
* include/bits/stl_algo.h (partial_sort): Add missing `>' on the
template parameter _ValueType.
2001-10-19 Brendan Kehoe <brendan@zen.org>
* include/bits/std_limits.h: Clean up extra semicolons.
* include/bits/locale_facets.h: Likewise.
* include/bits/type_traits.h: Likewise.
2001-10-19 Brendan Kehoe <brendan@zen.org>
* include/bits/localefwd.h (locale::combine): Add const for lib DR 14.
* include/bits/locale_facets.tcc (locale::combine): Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@46353
138bc75d-0d04-0410-961f-
82ee72b054a4
+2001-08-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/std_complex.h: Default initialize second argument
+ of polar to 0, as specified in Library DR #79
+
+2001-10-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/stl_raw_storage_iter.h (operator=): Fix to call
+ _Construct instead of construct.
+
+2001-10-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/basic_string.tcc (find_first_not_of): Take out check for
+ __n being non-zero, since the standard does not mandate that.
+ e.g., a search for "" in "" should yield position 0, not npos.
+ (find_last_not_of): Likewise.
+
+2001-10-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/stl_bvector.h (vector<bool>::_M_range_check): Fix
+ to throw out_of_range, not range_error, thus sayeth $23.1.1.13.
+
+2001-10-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/stl_iterator.h (reverse_iterator::current): Rename
+ member from _M_current, and change all uses; thus sayeth $24.4.1.1.
+
+2001-10-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/stl_algo.h (partial_sort): Add missing `>' on the
+ template parameter _ValueType.
+
+2001-10-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/std_limits.h: Clean up extra semicolons.
+ * include/bits/locale_facets.h: Likewise.
+ * include/bits/type_traits.h: Likewise.
+
+2001-10-19 Brendan Kehoe <brendan@zen.org>
+
+ * include/bits/localefwd.h (locale::combine): Add const for lib DR 14.
+ * include/bits/locale_facets.tcc (locale::combine): Likewise.
+
2001-10-19 Benjamin Kosnik <bkoz@redhat.com>
* include/bits/locale_facets.h (__timepunct::_M_put_helper):
find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const
{
size_t __xpos = __pos;
- for (; __n && __xpos < this->size(); ++__xpos)
+ for (; __xpos < this->size(); ++__xpos)
if (!traits_type::find(__s, __n, _M_data()[__xpos]))
return __xpos;
return npos;
find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const
{
size_type __size = this->size();
- if (__size && __n)
+ if (__size)
{
if (--__size > __pos)
__size = __pos;
_M_compare_helper(const _CharT*, const _CharT*) const;
size_t
- _M_transform_helper(_CharT*, const _CharT*, size_t) const;;
+ _M_transform_helper(_CharT*, const _CharT*, size_t) const;
protected:
virtual
{
template<typename _Facet>
locale
- locale::combine(const locale& __other)
+ locale::combine(const locale& __other) const
{
_Impl* __tmp = new _Impl(*_M_impl, 1);
__tmp->_M_replace_facet(__other._M_impl, &_Facet::id);
template<typename _Facet>
locale
- combine(const locale& __other);
+ combine(const locale& __other) const;
// Locale operations:
string
template<typename _Tp> _Tp norm(const complex<_Tp>&);
template<typename _Tp> complex<_Tp> conj(const complex<_Tp>&);
- template<typename _Tp> complex<_Tp> polar(const _Tp&, const _Tp&);
+ template<typename _Tp> complex<_Tp> polar(const _Tp&, const _Tp& = 0);
// Transcendentals:
template<typename _Tp> complex<_Tp> cos(const complex<_Tp>&);
static const bool has_quiet_NaN = __glibcpp_double_has_quiet_NaN;
static const bool has_signaling_NaN = __glibcpp_double_has_signaling_NaN;
static const float_denorm_style has_denorm =
- __glibcpp_double_has_denorm;;
- static const bool has_denorm_loss = __glibcpp_double_has_denorm_loss;;
+ __glibcpp_double_has_denorm;
+ static const bool has_denorm_loss = __glibcpp_double_has_denorm_loss;
static double infinity() throw()
{ return __glibcpp_double_infinity; }
// concept requirements
__glibcpp_function_requires(_Mutable_RandomAccessIteratorConcept<
_RandomAccessIter>);
- __glibcpp_function_requires(_LessThanComparableConcept<_ValueType);
+ __glibcpp_function_requires(_LessThanComparableConcept<_ValueType>);
make_heap(__first, __middle);
for (_RandomAccessIter __i = __middle; __i < __last; ++__i)
void _M_range_check(size_type __n) const {
if (__n >= this->size())
- __throw_range_error("vector<bool>");
+ __throw_out_of_range("vector<bool>");
}
reference at(size_type __n)
typename iterator_traits<_Iterator>::reference>
{
protected:
- _Iterator _M_current;
+ _Iterator current;
public:
typedef _Iterator iterator_type;
reverse_iterator() {}
explicit
- reverse_iterator(iterator_type __x) : _M_current(__x) {}
+ reverse_iterator(iterator_type __x) : current(__x) {}
reverse_iterator(const reverse_iterator& __x)
- : _M_current(__x._M_current) { }
+ : current(__x.current) { }
template<typename _Iter>
reverse_iterator(const reverse_iterator<_Iter>& __x)
- : _M_current(__x.base()) {}
+ : current(__x.base()) {}
iterator_type
- base() const { return _M_current; }
+ base() const { return current; }
reference
operator*() const
{
- _Iterator __tmp = _M_current;
+ _Iterator __tmp = current;
return *--__tmp;
}
reverse_iterator&
operator++()
{
- --_M_current;
+ --current;
return *this;
}
operator++(int)
{
reverse_iterator __tmp = *this;
- --_M_current;
+ --current;
return __tmp;
}
reverse_iterator&
operator--()
{
- ++_M_current;
+ ++current;
return *this;
}
reverse_iterator operator--(int)
{
reverse_iterator __tmp = *this;
- ++_M_current;
+ ++current;
return __tmp;
}
reverse_iterator
operator+(difference_type __n) const
- { return reverse_iterator(_M_current - __n); }
+ { return reverse_iterator(current - __n); }
reverse_iterator&
operator+=(difference_type __n)
{
- _M_current -= __n;
+ current -= __n;
return *this;
}
reverse_iterator
operator-(difference_type __n) const
- { return reverse_iterator(_M_current + __n); }
+ { return reverse_iterator(current + __n); }
reverse_iterator&
operator-=(difference_type __n)
back_insert_iterator(_Container& __x) : container(&__x) {}
back_insert_iterator&
- operator=(const typename _Container::const_reference __value)
+ operator=(typename _Container::const_reference __value)
{
container->push_back(__value);
return *this;
explicit front_insert_iterator(_Container& __x) : container(&__x) {}
front_insert_iterator&
- operator=(const typename _Container::const_reference __value)
+ operator=(typename _Container::const_reference __value)
{
container->push_front(__value);
return *this;
raw_storage_iterator&
operator=(const _Tp& __element)
{
- construct(&*_M_iter, __element);
+ _Construct(&*_M_iter, __element);
return *this;
}
};
// Forward declaration hack, should really include this from somewhere.
-namespace std {
- template<typename _Iterator, typename _Container> class __normal_iterator;
-};
+namespace std
+{
+ template<typename _Iterator, typename _Container> class __normal_iterator;
+}
template<typename _Iterator, typename _Container>
struct _Is_normal_iterator< std::__normal_iterator<_Iterator, _Container> > {
projects / platform / upstream / linaro-gcc.git / commitdiff