_bvector.h
来自「stl的源码」· C头文件 代码 · 共 842 行 · 第 1/2 页
H
842 行
/* * * Copyright (c) 1994 * Hewlett-Packard Company * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * * Copyright (c) 1997 * Moscow Center for SPARC Technology * * Copyright (c) 1999 * Boris Fomitchev * * This material is provided "as is", with absolutely no warranty expressed * or implied. Any use is at your own risk. * * Permission to use or copy this software for any purpose is hereby granted * without fee, provided the above notices are retained on all copies. * Permission to modify the code and to distribute modified code is granted, * provided the above notices are retained, and a notice that the code was * modified is included with the above copyright notice. * *//* NOTE: This is an internal header file, included by other STL headers. * You should not attempt to use it directly. */#ifndef _STLP_INTERNAL_BVECTOR_H#define _STLP_INTERNAL_BVECTOR_H#ifndef _STLP_INTERNAL_VECTOR_H# include <stl/_vector.h>#endif#define _STLP_WORD_BIT (int(CHAR_BIT * sizeof(unsigned int)))_STLP_BEGIN_NAMESPACE_STLP_MOVE_TO_PRIV_NAMESPACEstruct _Bit_reference { unsigned int* _M_p; unsigned int _M_mask; _Bit_reference(unsigned int* __x, unsigned int __y) : _M_p(__x), _M_mask(__y) {}public: _Bit_reference() : _M_p(0), _M_mask(0) {} operator bool() const { return !(!(*_M_p & _M_mask)); } _Bit_reference& operator = (bool __x) { if (__x) *_M_p |= _M_mask; else *_M_p &= ~_M_mask; return *this; } _Bit_reference& operator = (const _Bit_reference& __x) { return *this = bool(__x); } bool operator == (const _Bit_reference& __x) const { return bool(*this) == bool(__x); } bool operator < (const _Bit_reference& __x) const { return !bool(*this) && bool(__x); } _Bit_reference& operator |= (bool __x) { if (__x) *_M_p |= _M_mask; return *this; } _Bit_reference& operator &= (bool __x) { if (!__x) *_M_p &= ~_M_mask; return *this; } void flip() { *_M_p ^= _M_mask; }};_STLP_MOVE_TO_STD_NAMESPACEinline void swap(_STLP_PRIV _Bit_reference& __x, _STLP_PRIV _Bit_reference& __y) { bool __tmp = (bool)__x; __x = __y; __y = __tmp;}// Might not be very useful but costs nothing!_STLP_TEMPLATE_NULLstruct __type_traits<_STLP_PRIV _Bit_reference> { typedef __false_type has_trivial_default_constructor; typedef __true_type has_trivial_copy_constructor; typedef __false_type has_trivial_assignment_operator; typedef __true_type has_trivial_destructor; typedef __false_type is_POD_type;};_STLP_MOVE_TO_PRIV_NAMESPACEstruct _Bit_iterator_base { typedef ptrdiff_t difference_type; unsigned int* _M_p; unsigned int _M_offset; void _M_bump_up() { if (_M_offset++ == _STLP_WORD_BIT - 1) { _M_offset = 0; ++_M_p; } } void _M_bump_down() { if (_M_offset-- == 0) { _M_offset = _STLP_WORD_BIT - 1; --_M_p; } } _Bit_iterator_base() : _M_p(0), _M_offset(0) {} _Bit_iterator_base(unsigned int* __x, unsigned int __y) : _M_p(__x), _M_offset(__y) {}// see comment in doc/README.evc4 and doc/README.evc8#if defined(_MSC_VER) && _MSC_VER<=1401 && defined(MIPS) && defined(NDEBUG) _Bit_iterator_base( const _Bit_iterator_base& __x) : _M_p(__x._M_p), _M_offset(__x._M_offset) {}#endif // _Bit_iterator_base& operator = ( const _Bit_iterator_base& __x) { _M_p = __x._M_p ; _M_offset = __x._M_offset ; return *this; } void _M_advance (difference_type __i) { difference_type __n = __i + _M_offset; _M_p += __n / _STLP_WORD_BIT; __n = __n % _STLP_WORD_BIT; if (__n < 0) { _M_offset = (unsigned int) __n + _STLP_WORD_BIT; --_M_p; } else _M_offset = (unsigned int) __n; } difference_type _M_subtract(const _Bit_iterator_base& __x) const { return _STLP_WORD_BIT * (_M_p - __x._M_p) + _M_offset - __x._M_offset; }};inline bool _STLP_CALL operator==(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { return __y._M_p == __x._M_p && __y._M_offset == __x._M_offset;}inline bool _STLP_CALL operator!=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { return __y._M_p != __x._M_p || __y._M_offset != __x._M_offset;}inline bool _STLP_CALL operator<(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { return __x._M_p < __y._M_p || (__x._M_p == __y._M_p && __x._M_offset < __y._M_offset);}inline bool _STLP_CALL operator>(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { return operator <(__y , __x);}inline bool _STLP_CALL operator<=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { return !(__y < __x);}inline bool _STLP_CALL operator>=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { return !(__x < __y);}template <class _Ref, class _Ptr>struct _Bit_iter : public _Bit_iterator_base { typedef _Ref reference; typedef _Ptr pointer; typedef _Bit_iter<_Ref, _Ptr> _Self; typedef random_access_iterator_tag iterator_category; typedef bool value_type; typedef ptrdiff_t difference_type; typedef size_t size_type; _Bit_iter(unsigned int* __x, unsigned int __y) : _Bit_iterator_base(__x, __y) {} _Bit_iter() {} _Bit_iter(const _Bit_iter<_Bit_reference, _Bit_reference*>& __x): _Bit_iterator_base((const _Bit_iterator_base&)__x) {} // _Self& operator = (const _Bit_iter<_Bit_reference, _Bit_reference*>& __x) // { (_Bit_iterator_base&)*this = (const _Bit_iterator_base&)__x; return *this; } reference operator*() const { return _Bit_reference(_M_p, 1UL << _M_offset); } _Self& operator++() { _M_bump_up(); return *this; } _Self operator++(int) { _Self __tmp = *this; _M_bump_up(); return __tmp; } _Self& operator--() { _M_bump_down(); return *this; } _Self operator--(int) { _Self __tmp = *this; _M_bump_down(); return __tmp; } _Self& operator+=(difference_type __i) { _M_advance(__i); return *this; } _Self& operator-=(difference_type __i) { *this += -__i; return *this; } _Self operator+(difference_type __i) const { _Self __tmp = *this; return __tmp += __i; } _Self operator-(difference_type __i) const { _Self __tmp = *this; return __tmp -= __i; } difference_type operator-(const _Self& __x) const { return _M_subtract(__x); } reference operator[](difference_type __i) { return *(*this + __i); }};template <class _Ref, class _Ptr>inline _Bit_iter<_Ref,_Ptr> _STLP_CALLoperator+(ptrdiff_t __n, const _Bit_iter<_Ref, _Ptr>& __x) { return __x + __n;}_STLP_MOVE_TO_STD_NAMESPACE#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)template <class _Ref, class _Ptr>struct __type_traits< _STLP_PRIV _Bit_iter<_Ref, _Ptr> > { typedef __false_type has_trivial_default_constructor; typedef __true_type has_trivial_copy_constructor; typedef __true_type has_trivial_assignment_operator; typedef __true_type has_trivial_destructor; typedef __false_type is_POD_type;};#endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */#if defined (_STLP_USE_OLD_HP_ITERATOR_QUERIES)inline random_access_iterator_tag iterator_category(const _STLP_PRIV _Bit_iterator_base&){ return random_access_iterator_tag(); }inline ptrdiff_t* distance_type(const _STLP_PRIV _Bit_iterator_base&){ return (ptrdiff_t*)0; }inline bool* value_type(const _STLP_PRIV _Bit_iter<_STLP_PRIV _Bit_reference, _STLP_PRIV _Bit_reference*>&){ return (bool*)0; }inline bool* value_type(const _STLP_PRIV _Bit_iter<bool, const bool*>&){ return (bool*)0; }#endif_STLP_MOVE_TO_PRIV_NAMESPACEtypedef _Bit_iter<bool, const bool*> _Bit_const_iterator;typedef _Bit_iter<_Bit_reference, _Bit_reference*> _Bit_iterator;// Bit-vector base class, which encapsulates the difference between// old SGI-style allocators and standard-conforming allocators.template <class _Alloc>class _Bvector_base { typedef _Bvector_base<_Alloc> _Self;public: _STLP_FORCE_ALLOCATORS(bool, _Alloc) typedef _Alloc allocator_type; typedef unsigned int __chunk_type; typedef typename _Alloc_traits<__chunk_type, _Alloc>::allocator_type __chunk_allocator_type; allocator_type get_allocator() const { return _STLP_CONVERT_ALLOCATOR(__STATIC_CAST(const __chunk_allocator_type&, _M_end_of_storage), bool); } _Bvector_base(const allocator_type& __a) : _M_start(), _M_finish(), _M_end_of_storage(_STLP_CONVERT_ALLOCATOR(__a, __chunk_type), (__chunk_type*)0) {}#if !defined (_STLP_NO_MOVE_SEMANTIC) _Bvector_base(__move_source<_Self> src) : _M_start(src.get()._M_start), _M_finish(src.get()._M_finish), _M_end_of_storage(src.get()._M_end_of_storage) { //Make the source destroyable src.get()._M_start._M_p = 0; }#endif ~_Bvector_base() { _M_deallocate(); }protected: static size_t _M_bits_to_chunks(size_t __n_bits) { return (__n_bits + _STLP_WORD_BIT - 1) / _STLP_WORD_BIT; } __chunk_type* _M_bit_alloc(size_t __n) { return _M_end_of_storage.allocate(_M_bits_to_chunks(__n)); } void _M_deallocate() { if (_M_start._M_p) _M_end_of_storage.deallocate(_M_start._M_p, _M_end_of_storage._M_data - _M_start._M_p); } _Bit_iterator _M_start; _Bit_iterator _M_finish; _STLP_alloc_proxy<__chunk_type*, __chunk_type, __chunk_allocator_type> _M_end_of_storage;};// The next few lines are confusing. What we're doing is declaring a// partial specialization of vector<T, Alloc> if we have the necessary// compiler support. Otherwise, we define a class bit_vector which uses// the default allocator.#if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) && !defined (_STLP_NO_BOOL) && !defined (__SUNPRO_CC)# define _STLP_VECBOOL_TEMPLATE# define __BVEC_TMPL_HEADER template <class _Alloc>#else# undef _STLP_VECBOOL_TEMPLATE# ifdef _STLP_NO_BOOL# define __BVEC_TMPL_HEADER# else# define __BVEC_TMPL_HEADER _STLP_TEMPLATE_NULL# endif# define _Alloc allocator<bool>#endif#if defined (_STLP_DEBUG)# define vector _STLP_NON_DBG_NAME(vector)#endif#ifdef _STLP_NO_BOOL# define __BVECTOR_QUALIFIED bit_vector# define __BVECTOR bit_vector#else# ifdef _STLP_VECBOOL_TEMPLATE# define __BVECTOR_QUALIFIED vector<bool, _Alloc># else# define __BVECTOR_QUALIFIED vector<bool, allocator<bool> ># endif# if defined (_STLP_PARTIAL_SPEC_NEEDS_TEMPLATE_ARGS)# define __BVECTOR __BVECTOR_QUALIFIED# else# define __BVECTOR vector# endif#endif#if !defined (_STLP_DEBUG) || defined (_STLP_NO_BOOL)_STLP_MOVE_TO_STD_NAMESPACE#endif__BVEC_TMPL_HEADERclass __BVECTOR_QUALIFIED : public _STLP_PRIV _Bvector_base<_Alloc >#if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_DEBUG) , public __stlport_class< __BVECTOR_QUALIFIED >#endif{ typedef _STLP_PRIV _Bvector_base<_Alloc > _Base; typedef __BVECTOR_QUALIFIED _Self;public: typedef bool value_type; typedef size_t size_type; typedef ptrdiff_t difference_type; typedef _STLP_PRIV _Bit_reference reference; typedef bool const_reference; typedef _STLP_PRIV _Bit_reference* pointer; typedef const bool* const_pointer; typedef random_access_iterator_tag _Iterator_category; typedef _STLP_PRIV _Bit_iterator iterator; typedef _STLP_PRIV _Bit_const_iterator const_iterator; _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS;#ifdef _STLP_VECBOOL_TEMPLATE typedef _STLP_TYPENAME _STLP_PRIV _Bvector_base<_Alloc >::allocator_type allocator_type; typedef _STLP_TYPENAME _STLP_PRIV _Bvector_base<_Alloc >::__chunk_type __chunk_type;#else typedef _STLP_PRIV _Bvector_base<_Alloc >::allocator_type allocator_type; typedef _STLP_PRIV _Bvector_base<_Alloc >::__chunk_type __chunk_type;#endifprotected: void _M_initialize(size_type __n) { __chunk_type* __q = this->_M_bit_alloc(__n); this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__n); this->_M_start = iterator(__q, 0); this->_M_finish = this->_M_start + difference_type(__n); } void _M_insert_aux(iterator __position, bool __x) { if (this->_M_finish._M_p != this->_M_end_of_storage._M_data) { _STLP_PRIV __copy_backward(__position, this->_M_finish, this->_M_finish + 1, random_access_iterator_tag(), (difference_type*)0 ); *__position = __x; ++this->_M_finish; } else { size_type __len = size() ? 2 * size() : _STLP_WORD_BIT; __chunk_type* __q = this->_M_bit_alloc(__len); iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0)); *__i++ = __x; this->_M_finish = _STLP_STD::copy(__position, end(), __i); this->_M_deallocate(); this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__len); this->_M_start = iterator(__q, 0); } }#if defined (_STLP_MEMBER_TEMPLATES) template <class _InputIterator> void _M_initialize_range(_InputIterator __first, _InputIterator __last, const input_iterator_tag &) { this->_M_start = iterator(); this->_M_finish = iterator(); this->_M_end_of_storage._M_data = 0;
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?