How to Implement the Bit Maps?
Step 1: Create a bit Map Array.
unsigned char bit_map[2];
Step 2: Calculate the Bit Map array Index and shift index (How many bits needs to shift).
< If the user gives bit_position input starts from 1>
bit_map_array_index = (bit_position - 1) /8
shift_Index = (bit_position - 1)%8
< If the user gives bit_position input starts from 0>
bit_map_array_index = bit_position /8
shift_Index = bit_position %8
Step 3: Set the Bit in the Bit Map using
bit_map[bit_map_array_index] |= (1<<shift_Index)
Step 4: Clear the Bit in the Bit Map using
bit_map[bit_map_array_index] &= ~(1<<shift_Index)
Step 1: Create a bit Map Array.
unsigned char bit_map[2];
Step 2: Calculate the Bit Map array Index and shift index (How many bits needs to shift).
< If the user gives bit_position input starts from 1>
bit_map_array_index = (bit_position - 1) /8
shift_Index = (bit_position - 1)%8
< If the user gives bit_position input starts from 0>
bit_map_array_index = bit_position /8
shift_Index = bit_position %8
Step 3: Set the Bit in the Bit Map using
bit_map[bit_map_array_index] |= (1<<shift_Index)
Step 4: Clear the Bit in the Bit Map using
bit_map[bit_map_array_index] &= ~(1<<shift_Index)
No comments:
Post a Comment