// vector<bool> specialization -*- C++ -*-
	
	// Copyright (C) 2001-2013 Free Software Foundation, Inc.
	//
	// This file is part of the GNU ISO C++ Library.  This library is free
	// software; you can redistribute it and/or modify it under the
	// terms of the GNU General Public License as published by the
	// Free Software Foundation; either version 3, or (at your option)
	// any later version.
	
	// This library is distributed in the hope that it will be useful,
	// but WITHOUT ANY WARRANTY; without even the implied warranty of
	// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
	// GNU General Public License for more details.
	
	// Under Section 7 of GPL version 3, you are granted additional
	// permissions described in the GCC Runtime Library Exception, version
	// 3.1, as published by the Free Software Foundation.
	
	// You should have received a copy of the GNU General Public License and
	// a copy of the GCC Runtime Library Exception along with this program;
	// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
	// <http://www.gnu.org/licenses/>.
	
	/*
	 *
	 * Copyright (c) 1994
	 * Hewlett-Packard Company
	 *
	 * Permission to use, copy, modify, distribute and sell this software
	 * and its documentation for any purpose is hereby granted without fee,
	 * provided that the above copyright notice appear in all copies and
	 * that both that copyright notice and this permission notice appear
	 * in supporting documentation.  Hewlett-Packard Company makes no
	 * representations about the suitability of this software for any
	 * purpose.  It is provided "as is" without express or implied warranty.
	 *
	 *
	 * Copyright (c) 1996-1999
	 * Silicon Graphics Computer Systems, Inc.
	 *
	 * Permission to use, copy, modify, distribute and sell this software
	 * and its documentation for any purpose is hereby granted without fee,
	 * provided that the above copyright notice appear in all copies and
	 * that both that copyright notice and this permission notice appear
	 * in supporting documentation.  Silicon Graphics makes no
	 * representations about the suitability of this software for any
	 * purpose.  It is provided "as is" without express or implied warranty.
	 */
	
	/** @file bits/stl_bvector.h
	 *  This is an internal header file, included by other library headers.
	 *  Do not attempt to use it directly. @headername{vector}
	 */
	
	#ifndef _STL_BVECTOR_H
	#define _STL_BVECTOR_H 1
	
	#if __cplusplus >= 201103L
	#include <initializer_list>
	#endif
	
	namespace std _GLIBCXX_VISIBILITY(default)
	{
	_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
	
	  typedef unsigned long _Bit_type;
	  enum { _S_word_bit = int(__CHAR_BIT__ * sizeof(_Bit_type)) };
	
	  struct _Bit_reference
	  {
	    _Bit_type * _M_p;
	    _Bit_type _M_mask;
	
	    _Bit_reference(_Bit_type * __x, _Bit_type __y)
	    : _M_p(__x), _M_mask(__y) { }
	
	    _Bit_reference() _GLIBCXX_NOEXCEPT : _M_p(0), _M_mask(0) { }
	
	    operator bool() const _GLIBCXX_NOEXCEPT
	    { return !!(*_M_p & _M_mask); }
	
	    _Bit_reference&
	    operator=(bool __x) _GLIBCXX_NOEXCEPT
	    {
	      if (__x)
		*_M_p |= _M_mask;
	      else
		*_M_p &= ~_M_mask;
	      return *this;
	    }
	
	    _Bit_reference&
	    operator=(const _Bit_reference& __x) _GLIBCXX_NOEXCEPT
	    { 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); }
	
	    void
	    flip() _GLIBCXX_NOEXCEPT
	    { *_M_p ^= _M_mask; }
	  };
	
	#if __cplusplus >= 201103L
	  inline void
	  swap(_Bit_reference __x, _Bit_reference __y) noexcept
	  {
	    bool __tmp = __x;
	    __x = __y;
	    __y = __tmp;
	  }
	
	  inline void
	  swap(_Bit_reference __x, bool& __y) noexcept
	  {
	    bool __tmp = __x;
	    __x = __y;
	    __y = __tmp;
	  }
	
	  inline void
	  swap(bool& __x, _Bit_reference __y) noexcept
	  {
	    bool __tmp = __x;
	    __x = __y;
	    __y = __tmp;
	  }
	#endif
	
	  struct _Bit_iterator_base
	  : public std::iterator<std::random_access_iterator_tag, bool>
	  {
	    _Bit_type * _M_p;
	    unsigned int _M_offset;
	
	    _Bit_iterator_base(_Bit_type * __x, unsigned int __y)
	    : _M_p(__x), _M_offset(__y) { }
	
	    void
	    _M_bump_up()
	    {
	      if (_M_offset++ == int(_S_word_bit) - 1)
		{
		  _M_offset = 0;
		  ++_M_p;
		}
	    }
	
	    void
	    _M_bump_down()
	    {
	      if (_M_offset-- == 0)
		{
		  _M_offset = int(_S_word_bit) - 1;
		  --_M_p;
		}
	    }
	
	    void
	    _M_incr(ptrdiff_t __i)
	    {
	      difference_type __n = __i + _M_offset;
	      _M_p += __n / int(_S_word_bit);
	      __n = __n % int(_S_word_bit);
	      if (__n < 0)
		{
		  __n += int(_S_word_bit);
		  --_M_p;
		}
	      _M_offset = static_cast<unsigned int>(__n);
	    }
	
	    bool
	    operator==(const _Bit_iterator_base& __i) const
	    { return _M_p == __i._M_p && _M_offset == __i._M_offset; }
	
	    bool
	    operator<(const _Bit_iterator_base& __i) const
	    {
	      return _M_p < __i._M_p
		     || (_M_p == __i._M_p && _M_offset < __i._M_offset);
	    }
	
	    bool
	    operator!=(const _Bit_iterator_base& __i) const
	    { return !(*this == __i); }
	
	    bool
	    operator>(const _Bit_iterator_base& __i) const
	    { return __i < *this; }
	
	    bool
	    operator<=(const _Bit_iterator_base& __i) const
	    { return !(__i < *this); }
	
	    bool
	    operator>=(const _Bit_iterator_base& __i) const
	    { return !(*this < __i); }
	  };
	
	  inline ptrdiff_t
	  operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
	  {
	    return (int(_S_word_bit) * (__x._M_p - __y._M_p)
		    + __x._M_offset - __y._M_offset);
	  }
	
	  struct _Bit_iterator : public _Bit_iterator_base
	  {
	    typedef _Bit_reference  reference;
	    typedef _Bit_reference* pointer;
	    typedef _Bit_iterator   iterator;
	
	    _Bit_iterator() : _Bit_iterator_base(0, 0) { }
	
	    _Bit_iterator(_Bit_type * __x, unsigned int __y)
	    : _Bit_iterator_base(__x, __y) { }
	
	    reference
	    operator*() const
	    { return reference(_M_p, 1UL << _M_offset); }
	
	    iterator&
	    operator++()
	    {
	      _M_bump_up();
	      return *this;
	    }
	
	    iterator
	    operator++(int)
	    {
	      iterator __tmp = *this;
	      _M_bump_up();
	      return __tmp;
	    }
	
	    iterator&
	    operator--()
	    {
	      _M_bump_down();
	      return *this;
	    }
	
	    iterator
	    operator--(int)
	    {
	      iterator __tmp = *this;
	      _M_bump_down();
	      return __tmp;
	    }
	
	    iterator&
	    operator+=(difference_type __i)
	    {
	      _M_incr(__i);
	      return *this;
	    }
	
	    iterator&
	    operator-=(difference_type __i)
	    {
	      *this += -__i;
	      return *this;
	    }
	
	    iterator
	    operator+(difference_type __i) const
	    {
	      iterator __tmp = *this;
	      return __tmp += __i;
	    }
	
	    iterator
	    operator-(difference_type __i) const
	    {
	      iterator __tmp = *this;
	      return __tmp -= __i;
	    }
	
	    reference
	    operator[](difference_type __i) const
	    { return *(*this + __i); }
	  };
	
	  inline _Bit_iterator
	  operator+(ptrdiff_t __n, const _Bit_iterator& __x)
	  { return __x + __n; }
	
	  struct _Bit_const_iterator : public _Bit_iterator_base
	  {
	    typedef bool                 reference;
	    typedef bool                 const_reference;
	    typedef const bool*          pointer;
	    typedef _Bit_const_iterator  const_iterator;
	
	    _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
	
	    _Bit_const_iterator(_Bit_type * __x, unsigned int __y)
	    : _Bit_iterator_base(__x, __y) { }
	
	    _Bit_const_iterator(const _Bit_iterator& __x)
	    : _Bit_iterator_base(__x._M_p, __x._M_offset) { }
	
	    const_reference
	    operator*() const
	    { return _Bit_reference(_M_p, 1UL << _M_offset); }
	
	    const_iterator&
	    operator++()
	    {
	      _M_bump_up();
	      return *this;
	    }
	
	    const_iterator
	    operator++(int)
	    {
	      const_iterator __tmp = *this;
	      _M_bump_up();
	      return __tmp;
	    }
	
	    const_iterator&
	    operator--()
	    {
	      _M_bump_down();
	      return *this;
	    }
	
	    const_iterator
	    operator--(int)
	    {
	      const_iterator __tmp = *this;
	      _M_bump_down();
	      return __tmp;
	    }
	
	    const_iterator&
	    operator+=(difference_type __i)
	    {
	      _M_incr(__i);
	      return *this;
	    }
	
	    const_iterator&
	    operator-=(difference_type __i)
	    {
	      *this += -__i;
	      return *this;
	    }
	
	    const_iterator 
	    operator+(difference_type __i) const
	    {
	      const_iterator __tmp = *this;
	      return __tmp += __i;
	    }
	
	    const_iterator
	    operator-(difference_type __i) const
	    {
	      const_iterator __tmp = *this;
	      return __tmp -= __i;
	    }
	
	    const_reference
	    operator[](difference_type __i) const
	    { return *(*this + __i); }
	  };
	
	  inline _Bit_const_iterator
	  operator+(ptrdiff_t __n, const _Bit_const_iterator& __x)
	  { return __x + __n; }
	
	  inline void
	  __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
	  {
	    for (; __first != __last; ++__first)
	      *__first = __x;
	  }
	
	  inline void
	  fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
	  {
	    if (__first._M_p != __last._M_p)
	      {
		std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
		__fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
		__fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x);
	      }
	    else
	      __fill_bvector(__first, __last, __x);
	  }
	
	  template<typename _Alloc>
	    struct _Bvector_base
	    {
	      typedef typename _Alloc::template rebind<_Bit_type>::other
	        _Bit_alloc_type;
	      
	      struct _Bvector_impl
	      : public _Bit_alloc_type
	      {
		_Bit_iterator 	_M_start;
		_Bit_iterator 	_M_finish;
		_Bit_type* 	_M_end_of_storage;
	
		_Bvector_impl()
		: _Bit_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage(0)
		{ }
	 
		_Bvector_impl(const _Bit_alloc_type& __a)
		: _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage(0)
		{ }
	
	#if __cplusplus >= 201103L
		_Bvector_impl(_Bit_alloc_type&& __a)
		: _Bit_alloc_type(std::move(__a)), _M_start(), _M_finish(),
		  _M_end_of_storage(0)
		{ }
	#endif
	      };
	
	    public:
	      typedef _Alloc allocator_type;
	
	      _Bit_alloc_type&
	      _M_get_Bit_allocator() _GLIBCXX_NOEXCEPT
	      { return *static_cast<_Bit_alloc_type*>(&this->_M_impl); }
	
	      const _Bit_alloc_type&
	      _M_get_Bit_allocator() const _GLIBCXX_NOEXCEPT
	      { return *static_cast<const _Bit_alloc_type*>(&this->_M_impl); }
	
	      allocator_type
	      get_allocator() const _GLIBCXX_NOEXCEPT
	      { return allocator_type(_M_get_Bit_allocator()); }
	
	      _Bvector_base()
	      : _M_impl() { }
	      
	      _Bvector_base(const allocator_type& __a)
	      : _M_impl(__a) { }
	
	#if __cplusplus >= 201103L
	      _Bvector_base(_Bvector_base&& __x) noexcept
	      : _M_impl(std::move(__x._M_get_Bit_allocator()))
	      {
		this->_M_impl._M_start = __x._M_impl._M_start;
		this->_M_impl._M_finish = __x._M_impl._M_finish;
		this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
		__x._M_impl._M_start = _Bit_iterator();
		__x._M_impl._M_finish = _Bit_iterator();
		__x._M_impl._M_end_of_storage = 0;
	      }
	#endif
	
	      ~_Bvector_base()
	      { this->_M_deallocate(); }
	
	    protected:
	      _Bvector_impl _M_impl;
	
	      _Bit_type*
	      _M_allocate(size_t __n)
	      { return _M_impl.allocate(_S_nword(__n)); }
	
	      void
	      _M_deallocate()
	      {
		if (_M_impl._M_start._M_p)
		  _M_impl.deallocate(_M_impl._M_start._M_p,
				     _M_impl._M_end_of_storage - _M_impl._M_start._M_p);
	      }
	
	      static size_t
	      _S_nword(size_t __n)
	      { return (__n + int(_S_word_bit) - 1) / int(_S_word_bit); }
	    };
	
	_GLIBCXX_END_NAMESPACE_CONTAINER
	} // namespace std
	
	// Declare a partial specialization of vector<T, Alloc>.
	#include <bits/stl_vector.h>
	
	namespace std _GLIBCXX_VISIBILITY(default)
	{
	_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
	
	  /**
	   *  @brief  A specialization of vector for booleans which offers fixed time
	   *  access to individual elements in any order.
	   *
	   *  @ingroup sequences
	   *
	   *  @tparam _Alloc  Allocator type.
	   *
	   *  Note that vector<bool> does not actually meet the requirements for being
	   *  a container.  This is because the reference and pointer types are not
	   *  really references and pointers to bool.  See DR96 for details.  @see
	   *  vector for function documentation.
	   *
	   *  In some terminology a %vector can be described as a dynamic
	   *  C-style array, it offers fast and efficient access to individual
	   *  elements in any order and saves the user from worrying about
	   *  memory and size allocation.  Subscripting ( @c [] ) access is
	   *  also provided as with C-style arrays.
	  */
	template<typename _Alloc>
	  class vector<bool, _Alloc> : protected _Bvector_base<_Alloc>
	  {
	    typedef _Bvector_base<_Alloc>			 _Base;
	
	#if __cplusplus >= 201103L
	    template<typename> friend struct hash;
	#endif
	
	  public:
	    typedef bool                                         value_type;
	    typedef size_t                                       size_type;
	    typedef ptrdiff_t                                    difference_type;
	    typedef _Bit_reference                               reference;
	    typedef bool                                         const_reference;
	    typedef _Bit_reference*                              pointer;
	    typedef const bool*                                  const_pointer;
	    typedef _Bit_iterator                                iterator;
	    typedef _Bit_const_iterator                          const_iterator;
	    typedef std::reverse_iterator<const_iterator>        const_reverse_iterator;
	    typedef std::reverse_iterator<iterator>              reverse_iterator;
	    typedef _Alloc                        		 allocator_type;
	
	    allocator_type get_allocator() const
	    { return _Base::get_allocator(); }
	
	  protected:
	    using _Base::_M_allocate;
	    using _Base::_M_deallocate;
	    using _Base::_S_nword;
	    using _Base::_M_get_Bit_allocator;
	
	  public:
	    vector()
	    : _Base() { }
	
	    explicit
	    vector(const allocator_type& __a)
	    : _Base(__a) { }
	
	#if __cplusplus >= 201103L
	    explicit
	    vector(size_type __n, const allocator_type& __a = allocator_type())
	    : vector(__n, false, __a)
	    { }
	
	    vector(size_type __n, const bool& __value, 
		   const allocator_type& __a = allocator_type())
	    : _Base(__a)
	    {
	      _M_initialize(__n);
	      std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage, 
			__value ? ~0 : 0);
	    }
	#else
	    explicit
	    vector(size_type __n, const bool& __value = bool(), 
		   const allocator_type& __a = allocator_type())
	    : _Base(__a)
	    {
	      _M_initialize(__n);
	      std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_of_storage, 
			__value ? ~0 : 0);
	    }
	#endif
	
	    vector(const vector& __x)
	    : _Base(__x._M_get_Bit_allocator())
	    {
	      _M_initialize(__x.size());
	      _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
	    }
	
	#if __cplusplus >= 201103L
	    vector(vector&& __x) noexcept
	    : _Base(std::move(__x)) { }
	
	    vector(initializer_list<bool> __l,
		   const allocator_type& __a = allocator_type())
	    : _Base(__a)
	    {
	      _M_initialize_range(__l.begin(), __l.end(),
				  random_access_iterator_tag());
	    }
	#endif
	
	#if __cplusplus >= 201103L
	    template<typename _InputIterator,
		     typename = std::_RequireInputIter<_InputIterator>>
	      vector(_InputIterator __first, _InputIterator __last,
		     const allocator_type& __a = allocator_type())
	      : _Base(__a)
	      { _M_initialize_dispatch(__first, __last, __false_type()); }
	#else
	    template<typename _InputIterator>
	      vector(_InputIterator __first, _InputIterator __last,
		     const allocator_type& __a = allocator_type())
	      : _Base(__a)
	      {
		typedef typename std::__is_integer<_InputIterator>::__type _Integral;
		_M_initialize_dispatch(__first, __last, _Integral());
	      }
	#endif
	
	    ~vector() _GLIBCXX_NOEXCEPT { }
	
	    vector&
	    operator=(const vector& __x)
	    {
	      if (&__x == this)
		return *this;
	      if (__x.size() > capacity())
		{
		  this->_M_deallocate();
		  _M_initialize(__x.size());
		}
	      this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
							begin());
	      return *this;
	    }
	
	#if __cplusplus >= 201103L
	    vector&
	    operator=(vector&& __x)
	    {
	      // NB: DR 1204.
	      // NB: DR 675.
	      this->clear();
	      this->swap(__x); 
	      return *this;
	    }
	
	    vector&
	    operator=(initializer_list<bool> __l)
	    {
	      this->assign (__l.begin(), __l.end());
	      return *this;
	    }
	#endif
	
	    // assign(), a generalized assignment member function.  Two
	    // versions: one that takes a count, and one that takes a range.
	    // The range version is a member template, so we dispatch on whether
	    // or not the type is an integer.
	    void
	    assign(size_type __n, const bool& __x)
	    { _M_fill_assign(__n, __x); }
	
	#if __cplusplus >= 201103L
	    template<typename _InputIterator,
		     typename = std::_RequireInputIter<_InputIterator>>
	      void
	      assign(_InputIterator __first, _InputIterator __last)
	      { _M_assign_dispatch(__first, __last, __false_type()); }
	#else
	    template<typename _InputIterator>
	      void
	      assign(_InputIterator __first, _InputIterator __last)
	      {
		typedef typename std::__is_integer<_InputIterator>::__type _Integral;
		_M_assign_dispatch(__first, __last, _Integral());
	      }
	#endif
	
	#if __cplusplus >= 201103L
	    void
	    assign(initializer_list<bool> __l)
	    { this->assign(__l.begin(), __l.end()); }
	#endif
	
	    iterator
	    begin() _GLIBCXX_NOEXCEPT
	    { return this->_M_impl._M_start; }
	
	    const_iterator
	    begin() const _GLIBCXX_NOEXCEPT
	    { return this->_M_impl._M_start; }
	
	    iterator
	    end() _GLIBCXX_NOEXCEPT
	    { return this->_M_impl._M_finish; }
	
	    const_iterator
	    end() const _GLIBCXX_NOEXCEPT
	    { return this->_M_impl._M_finish; }
	
	    reverse_iterator
	    rbegin() _GLIBCXX_NOEXCEPT
	    { return reverse_iterator(end()); }
	
	    const_reverse_iterator
	    rbegin() const _GLIBCXX_NOEXCEPT
	    { return const_reverse_iterator(end()); }
	
	    reverse_iterator
	    rend() _GLIBCXX_NOEXCEPT
	    { return reverse_iterator(begin()); }
	
	    const_reverse_iterator
	    rend() const _GLIBCXX_NOEXCEPT
	    { return const_reverse_iterator(begin()); }
	
	#if __cplusplus >= 201103L
	    const_iterator
	    cbegin() const noexcept
	    { return this->_M_impl._M_start; }
	
	    const_iterator
	    cend() const noexcept
	    { return this->_M_impl._M_finish; }
	
	    const_reverse_iterator
	    crbegin() const noexcept
	    { return const_reverse_iterator(end()); }
	
	    const_reverse_iterator
	    crend() const noexcept
	    { return const_reverse_iterator(begin()); }
	#endif
	
	    size_type
	    size() const _GLIBCXX_NOEXCEPT
	    { return size_type(end() - begin()); }
	
	    size_type
	    max_size() const _GLIBCXX_NOEXCEPT
	    {
	      const size_type __isize =
		__gnu_cxx::__numeric_traits<difference_type>::__max
		- int(_S_word_bit) + 1;
	      const size_type __asize = _M_get_Bit_allocator().max_size();
	      return (__asize <= __isize / int(_S_word_bit)
		      ? __asize * int(_S_word_bit) : __isize);
	    }
	
	    size_type
	    capacity() const _GLIBCXX_NOEXCEPT
	    { return size_type(const_iterator(this->_M_impl._M_end_of_storage, 0)
			       - begin()); }
	
	    bool
	    empty() const _GLIBCXX_NOEXCEPT
	    { return begin() == end(); }
	
	    reference
	    operator[](size_type __n)
	    {
	      return *iterator(this->_M_impl._M_start._M_p
			       + __n / int(_S_word_bit), __n % int(_S_word_bit));
	    }
	
	    const_reference
	    operator[](size_type __n) const
	    {
	      return *const_iterator(this->_M_impl._M_start._M_p
				     + __n / int(_S_word_bit), __n % int(_S_word_bit));
	    }
	
	  protected:
	    void
	    _M_range_check(size_type __n) const
	    {
	      if (__n >= this->size())
	        __throw_out_of_range(__N("vector<bool>::_M_range_check"));
	    }
	
	  public:
	    reference
	    at(size_type __n)
	    { _M_range_check(__n); return (*this)[__n]; }
	
	    const_reference
	    at(size_type __n) const
	    { _M_range_check(__n); return (*this)[__n]; }
	
	    void
	    reserve(size_type __n)
	    {
	      if (__n > max_size())
		__throw_length_error(__N("vector::reserve"));
	      if (capacity() < __n)
		_M_reallocate(__n);
	    }
	
	    reference
	    front()
	    { return *begin(); }
	
	    const_reference
	    front() const
	    { return *begin(); }
	
	    reference
	    back()
	    { return *(end() - 1); }
	
	    const_reference
	    back() const
	    { return *(end() - 1); }
	
	    // _GLIBCXX_RESOLVE_LIB_DEFECTS
	    // DR 464. Suggestion for new member functions in standard containers.
	    // N.B. DR 464 says nothing about vector<bool> but we need something
	    // here due to the way we are implementing DR 464 in the debug-mode
	    // vector class.
	    void
	    data() _GLIBCXX_NOEXCEPT { }
	
	    void
	    push_back(bool __x)
	    {
	      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
	        *this->_M_impl._M_finish++ = __x;
	      else
	        _M_insert_aux(end(), __x);
	    }
	
	    void
	    swap(vector& __x)
	    {
	      std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
	      std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
	      std::swap(this->_M_impl._M_end_of_storage, 
			__x._M_impl._M_end_of_storage);
	
	      // _GLIBCXX_RESOLVE_LIB_DEFECTS
	      // 431. Swapping containers with unequal allocators.
	      std::__alloc_swap<typename _Base::_Bit_alloc_type>::
		_S_do_it(_M_get_Bit_allocator(), __x._M_get_Bit_allocator());
	    }
	
	    // [23.2.5]/1, third-to-last entry in synopsis listing
	    static void
	    swap(reference __x, reference __y) _GLIBCXX_NOEXCEPT
	    {
	      bool __tmp = __x;
	      __x = __y;
	      __y = __tmp;
	    }
	
	    iterator
	    insert(iterator __position, const bool& __x = bool())
	    {
	      const difference_type __n = __position - begin();
	      if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage
		  && __position == end())
	        *this->_M_impl._M_finish++ = __x;
	      else
	        _M_insert_aux(__position, __x);
	      return begin() + __n;
	    }
	
	#if __cplusplus >= 201103L
	    template<typename _InputIterator,
		     typename = std::_RequireInputIter<_InputIterator>>
	      void
	      insert(iterator __position,
		     _InputIterator __first, _InputIterator __last)
	      { _M_insert_dispatch(__position, __first, __last, __false_type()); }
	#else
	    template<typename _InputIterator>
	      void
	      insert(iterator __position,
		     _InputIterator __first, _InputIterator __last)
	      {
		typedef typename std::__is_integer<_InputIterator>::__type _Integral;
		_M_insert_dispatch(__position, __first, __last, _Integral());
	      }
	#endif
	
	    void
	    insert(iterator __position, size_type __n, const bool& __x)
	    { _M_fill_insert(__position, __n, __x); }
	
	#if __cplusplus >= 201103L
	    void insert(iterator __p, initializer_list<bool> __l)
	    { this->insert(__p, __l.begin(), __l.end()); }
	#endif
	
	    void
	    pop_back()
	    { --this->_M_impl._M_finish; }
	
	    iterator
	    erase(iterator __position)
	    {
	      if (__position + 1 != end())
	        std::copy(__position + 1, end(), __position);
	      --this->_M_impl._M_finish;
	      return __position;
	    }
	
	    iterator
	    erase(iterator __first, iterator __last)
	    {
	      if (__first != __last)
		_M_erase_at_end(std::copy(__last, end(), __first));
	      return __first;
	    }
	
	    void
	    resize(size_type __new_size, bool __x = bool())
	    {
	      if (__new_size < size())
	        _M_erase_at_end(begin() + difference_type(__new_size));
	      else
	        insert(end(), __new_size - size(), __x);
	    }
	
	#if __cplusplus >= 201103L
	    void
	    shrink_to_fit()
	    { _M_shrink_to_fit(); }
	#endif
	
	    void
	    flip() _GLIBCXX_NOEXCEPT
	    {
	      for (_Bit_type * __p = this->_M_impl._M_start._M_p;
		   __p != this->_M_impl._M_end_of_storage; ++__p)
	        *__p = ~*__p;
	    }
	
	    void
	    clear() _GLIBCXX_NOEXCEPT
	    { _M_erase_at_end(begin()); }
	
	   
	  protected:
	    // Precondition: __first._M_offset == 0 && __result._M_offset == 0.
	    iterator
	    _M_copy_aligned(const_iterator __first, const_iterator __last,
			    iterator __result)
	    {
	      _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);
	      return std::copy(const_iterator(__last._M_p, 0), __last,
			       iterator(__q, 0));
	    }
	
	    void
	    _M_initialize(size_type __n)
	    {
	      _Bit_type* __q = this->_M_allocate(__n);
	      this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
	      this->_M_impl._M_start = iterator(__q, 0);
	      this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n);
	    }
	
	    void
	    _M_reallocate(size_type __n);
	
	#if __cplusplus >= 201103L
	    bool
	    _M_shrink_to_fit();
	#endif
	
	    // Check whether it's an integral type.  If so, it's not an iterator.
	
	    // _GLIBCXX_RESOLVE_LIB_DEFECTS
	    // 438. Ambiguity in the "do the right thing" clause
	    template<typename _Integer>
	      void
	      _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
	      {
		_M_initialize(static_cast<size_type>(__n));
		std::fill(this->_M_impl._M_start._M_p, 
			  this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
	      }
	
	    template<typename _InputIterator>
	      void 
	      _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
				     __false_type)
	      { _M_initialize_range(__first, __last, 
				    std::__iterator_category(__first)); }
	
	    template<typename _InputIterator>
	      void
	      _M_initialize_range(_InputIterator __first, _InputIterator __last,
				  std::input_iterator_tag)
	      {
		for (; __first != __last; ++__first)
		  push_back(*__first);
	      }
	
	    template<typename _ForwardIterator>
	      void
	      _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
				  std::forward_iterator_tag)
	      {
		const size_type __n = std::distance(__first, __last);
		_M_initialize(__n);
		std::copy(__first, __last, this->_M_impl._M_start);
	      }
	
	    // _GLIBCXX_RESOLVE_LIB_DEFECTS
	    // 438. Ambiguity in the "do the right thing" clause
	    template<typename _Integer>
	      void
	      _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
	      { _M_fill_assign(__n, __val); }
	
	    template<class _InputIterator>
	      void
	      _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
				 __false_type)
	      { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
	
	    void
	    _M_fill_assign(size_t __n, bool __x)
	    {
	      if (__n > size())
		{
		  std::fill(this->_M_impl._M_start._M_p, 
			    this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
		  insert(end(), __n - size(), __x);
		}
	      else
		{
		  _M_erase_at_end(begin() + __n);
		  std::fill(this->_M_impl._M_start._M_p, 
			    this->_M_impl._M_end_of_storage, __x ? ~0 : 0);
		}
	    }
	
	    template<typename _InputIterator>
	      void
	      _M_assign_aux(_InputIterator __first, _InputIterator __last,
			    std::input_iterator_tag)
	      {
		iterator __cur = begin();
		for (; __first != __last && __cur != end(); ++__cur, ++__first)
		  *__cur = *__first;
		if (__first == __last)
		  _M_erase_at_end(__cur);
		else
		  insert(end(), __first, __last);
	      }
	    
	    template<typename _ForwardIterator>
	      void
	      _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
			    std::forward_iterator_tag)
	      {
		const size_type __len = std::distance(__first, __last);
		if (__len < size())
		  _M_erase_at_end(std::copy(__first, __last, begin()));
		else
		  {
		    _ForwardIterator __mid = __first;
		    std::advance(__mid, size());
		    std::copy(__first, __mid, begin());
		    insert(end(), __mid, __last);
		  }
	      }
	
	    // Check whether it's an integral type.  If so, it's not an iterator.
	
	    // _GLIBCXX_RESOLVE_LIB_DEFECTS
	    // 438. Ambiguity in the "do the right thing" clause
	    template<typename _Integer>
	      void
	      _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
				 __true_type)
	      { _M_fill_insert(__pos, __n, __x); }
	
	    template<typename _InputIterator>
	      void
	      _M_insert_dispatch(iterator __pos,
				 _InputIterator __first, _InputIterator __last,
				 __false_type)
	      { _M_insert_range(__pos, __first, __last,
				std::__iterator_category(__first)); }
	
	    void
	    _M_fill_insert(iterator __position, size_type __n, bool __x);
	
	    template<typename _InputIterator>
	      void
	      _M_insert_range(iterator __pos, _InputIterator __first, 
			      _InputIterator __last, std::input_iterator_tag)
	      {
		for (; __first != __last; ++__first)
		  {
		    __pos = insert(__pos, *__first);
		    ++__pos;
		  }
	      }
	
	    template<typename _ForwardIterator>
	      void
	      _M_insert_range(iterator __position, _ForwardIterator __first, 
			      _ForwardIterator __last, std::forward_iterator_tag);
	
	    void
	    _M_insert_aux(iterator __position, bool __x);
	
	    size_type
	    _M_check_len(size_type __n, const char* __s) const
	    {
	      if (max_size() - size() < __n)
		__throw_length_error(__N(__s));
	
	      const size_type __len = size() + std::max(size(), __n);
	      return (__len < size() || __len > max_size()) ? max_size() : __len;
	    }
	
	    void
	    _M_erase_at_end(iterator __pos)
	    { this->_M_impl._M_finish = __pos; }
	  };
	
	_GLIBCXX_END_NAMESPACE_CONTAINER
	} // namespace std
	
	#if __cplusplus >= 201103L
	
	#include <bits/functional_hash.h>
	
	namespace std _GLIBCXX_VISIBILITY(default)
	{
	_GLIBCXX_BEGIN_NAMESPACE_VERSION
	
	  // DR 1182.
	  /// std::hash specialization for vector<bool>.
	  template<typename _Alloc>
	    struct hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>
	    : public __hash_base<size_t, _GLIBCXX_STD_C::vector<bool, _Alloc>>
	    {
	      size_t
	      operator()(const _GLIBCXX_STD_C::vector<bool, _Alloc>&) const noexcept;
	    };
	
	_GLIBCXX_END_NAMESPACE_VERSION
	}// namespace std
	
	#endif // C++11
	
	#endif