/*

 * Copyright (c) 1998

 * Silicon Graphics Computer Systems, Inc.

 *

 * Boris Fomitchev

 *

 * This material is provided "as is", with absolutely no warranty expressed

 * or implied. Any use is at your own risk.

 *

 * 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.

 *

 */

#ifndef _STLP_BITSET

#define _STLP_BITSET

// This implementation of bitset<> has a second template parameter,

// _WordT, which defaults to unsigned long.  *YOU SHOULD NOT USE

// THIS FEATURE*.  It is experimental, and it may be removed in

// future releases.

// N % (sizeof(_WordT) * CHAR_BIT) unused bits.  (They are the high-

// order bits in the highest word.)  It is a class invariant

// of class bitset<> that those unused bits are always zero.

// base class _Base_bitset.  The base class works with whole words, not with

// individual bits.  This allows us to specialize _Base_bitset for the

// important special case where the bitset is only a single word.

// The C++ standard does not define the precise semantics of operator[].

// In this implementation the const version of operator[] is equivalent

// to test(), except that it does no range checking.  The non-const version

// returns a reference to a bit, again without doing any range checking.

#  define _STLP_OUTERMOST_HEADER_ID 0x2

#  include <stl/_prolog.h>

#ifdef _STLP_PRAGMA_ONCE

#endif

#  include <stl/_epilog.h>

#  undef _STLP_OUTERMOST_HEADER_ID

#endif /* _STLP_BITSET */

// Local Variables:

// mode:C++

// End: