|
|
1.1 ! root 1: ! 2: ! 3: bit map Definition bit map ! 4: ! 5: ! 6: ! 7: ! 8: A bit map is a string of bits in which each bit has a symbolic, ! 9: rather than numeric, value. ! 10: ! 11: ***** See Also ***** ! 12: ! 13: bit, byte, definitions ! 14: _T_h_e _C _P_r_o_g_r_a_m_m_i_n_g _L_a_n_g_u_a_g_e, ed. 2, page 136 ! 15: ! 16: ***** Notes ***** ! 17: ! 18: C permits the manipulation of bits within a byte through the use ! 19: of bit-field routines. These generate code rather than calls to ! 20: routines. Bit fields are generally less efficient than masking ! 21: because they always generate masking and shifting. ! 22: ! 23: ! 24: ! 25: ! 26: ! 27: ! 28: ! 29: ! 30: ! 31: ! 32: ! 33: ! 34: ! 35: ! 36: ! 37: ! 38: ! 39: ! 40: ! 41: ! 42: ! 43: ! 44: ! 45: ! 46: ! 47: ! 48: ! 49: ! 50: ! 51: ! 52: ! 53: ! 54: ! 55: ! 56: ! 57: ! 58: ! 59: ! 60: ! 61: ! 62: ! 63: ! 64: COHERENT Lexicon Page 1 ! 65: ! 66:
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.