1.1 --- a/epoc32/include/stdapis/stlport/bitset	Tue Nov 24 13:55:44 2009 +0000
     1.2 +++ b/epoc32/include/stdapis/stlport/bitset	Tue Mar 16 16:12:26 2010 +0000
     1.3 @@ -1,1 +1,64 @@
     1.4 -bitset
     1.5 +/*
     1.6 + * Copyright (c) 1998
     1.7 + * Silicon Graphics Computer Systems, Inc.
     1.8 + *
     1.9 + * Copyright (c) 1999 
    1.10 + * Boris Fomitchev
    1.11 + *
    1.12 + * This material is provided "as is", with absolutely no warranty expressed
    1.13 + * or implied. Any use is at your own risk.
    1.14 + *
    1.15 + * Permission to use or copy this software for any purpose is hereby granted 
    1.16 + * without fee, provided the above notices are retained on all copies.
    1.17 + * Permission to modify the code and to distribute modified code is granted,
    1.18 + * provided the above notices are retained, and a notice that the code was
    1.19 + * modified is included with the above copyright notice.
    1.20 + *
    1.21 + */
    1.22 +
    1.23 +#ifndef _STLP_BITSET
    1.24 +#define _STLP_BITSET
    1.25 +
    1.26 +// This implementation of bitset<> has a second template parameter,
    1.27 +// _WordT, which defaults to unsigned long.  *YOU SHOULD NOT USE
    1.28 +// THIS FEATURE*.  It is experimental, and it may be removed in
    1.29 +// future releases.
    1.30 +
    1.31 +// A bitset of size N, using words of type _WordT, will have 
    1.32 +// N % (sizeof(_WordT) * CHAR_BIT) unused bits.  (They are the high-
    1.33 +// order bits in the highest word.)  It is a class invariant
    1.34 +// of class bitset<> that those unused bits are always zero.
    1.35 +
    1.36 +// Most of the actual code isn't contained in bitset<> itself, but in the 
    1.37 +// base class _Base_bitset.  The base class works with whole words, not with
    1.38 +// individual bits.  This allows us to specialize _Base_bitset for the
    1.39 +// important special case where the bitset is only a single word.
    1.40 +
    1.41 +// The C++ standard does not define the precise semantics of operator[].
    1.42 +// In this implementation the const version of operator[] is equivalent
    1.43 +// to test(), except that it does no range checking.  The non-const version
    1.44 +// returns a reference to a bit, again without doing any range checking.
    1.45 +
    1.46 +# ifndef _STLP_OUTERMOST_HEADER_ID
    1.47 +#  define _STLP_OUTERMOST_HEADER_ID 0x2
    1.48 +#  include <stl/_prolog.h>
    1.49 +# endif
    1.50 +
    1.51 +#ifdef _STLP_PRAGMA_ONCE
    1.52 +# pragma once
    1.53 +#endif
    1.54 +
    1.55 +# include <stl/_bitset.h>
    1.56 +
    1.57 +# if (_STLP_OUTERMOST_HEADER_ID == 0x2 )
    1.58 +#  include <stl/_epilog.h>
    1.59 +#  undef _STLP_OUTERMOST_HEADER_ID
    1.60 +# endif
    1.61 +
    1.62 +#endif /* _STLP_BITSET */
    1.63 +
    1.64 +
    1.65 +// Local Variables:
    1.66 +// mode:C++
    1.67 +// End:
    1.68 +