expanded class interface BIT_N
--
-- Indexed Bit sequences of length N. This class is a template,
-- not a real class; to obtain a meaningful class, replace N
-- with a positive integer throughout.
--
-- An INTEGER index can be used to access each bit of the sequence.
-- The leftmost bit has index 1 and the rightmost bit has index N.
--
-- Note 1 : corresponding C mapping depends on actual N and is
-- PLATFORM dependant (see class PLATFORM).
-- When N is in range [0 .. Character_bits], C type
-- is a simple "unsigned char".
-- When N is in range [Character_bits+1 .. Integer_bits],
-- C type is "unsigned".
-- When N is greater than Integer_bits, C type is C array
-- of "unsigned" of the form :
-- "unsigned storage[N div Integer_bits]"
-- The array is obviously big enough to fit with N. As
-- for previous mapping, the left most bit (at index 1 in
-- Eiffel) is always the left most in C memory.
--
-- Note 2 : Eiffel BIT code is portable. Generated C code for class
-- BIT may not be portable (because sizeof(int) may change).
-- To produce a portable C code, you can compile your Eiffel
-- code using a machine with very small sizeof(int). Also note
-- that doing this may run a little bit slowly.
--
-- Also consider class BIT_STRING for very long bit sequences.
--
"This class will be removed in 2.1 release. INTEGER_GENERAL can be used for bit operations. Please update your code."
end of expanded BIT_N