head	1.1;
access;
symbols
	Hobson_Rock_14Dec2009:1.1
	HEAD_CTD_MERGE:1.1.0.6
	BEFORE_VCS_CHANGE:1.1
	Hobson_Rock_16Oct2009:1.1
	Hobson_Rock_29June2009:1.1
	Jun15_2009:1.1
	Apr_7_2009:1.1
	mar19_2009:1.1
	mar18_2009:1.1
	feb13_2009:1.1
	feb10-2009:1.1
	feb09-2009:1.1
	dec15_2008:1.1
	dec12_2008:1.1
	ST_10_5:1.1
	ST_10_4b:1.1
	ST_10_4:1.1
	ST_10_3:1.1
	ST10_HW:1.1
	ST_10_2:1.1
	ST_10_1:1.1
	ST_10_0:1.1
	AUTONOMY_BRANCH:1.1.0.4
	AUTONOMY:1.1
	AUTONOMY-2008_07_30:1.1
	TREX_ST_1_0:1.1
	RELEASE_27_April_2007_CTD_1:1.1.0.2
	Development_With_Wayne_060804:1.1;
locks; strict;
comment	@# @;


1.1
date	2004.06.03.04.41.10;	author dorado;	state Exp;
branches;
next	;


desc
@@


1.1
log
@initial checkin of stl port
@
text
@/*
 * Copyright (c) 1998
 * Silicon Graphics Computer Systems, Inc.
 *
 * 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.
 *
 */

#ifndef __SGI_STL_BITSET
#define __SGI_STL_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.

// A bitset of size N, using words of type _WordT, will have 
// 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.

// Most of the actual code isn't contained in bitset<> itself, but in the 
// 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.

# ifndef __STL_OUTERMOST_HEADER_ID
#  define __STL_OUTERMOST_HEADER_ID 0x2
#  include <stl/_prolog.h>
# endif

# include <stl/_bitset.h>

#if defined (__STL_WHOLE_NATIVE_STD)
# include __STL_NATIVE_HEADER(bitset)
#endif

# if (__STL_OUTERMOST_HEADER_ID == 0x2 )
#  include <stl/_epilog.h>
#  undef __STL_OUTERMOST_HEADER_ID
# endif

#endif /* __SGI_STL_BITSET */


// Local Variables:
// mode:C++
// End:

@
