1. A bitmap compression data structure located in a computer readable medium comprising: a) a compressed bitmap comprised of words that have a length of Word Length (WL) bits, wherein said compressed bitmap represents sequentially corresponding bits in an uncompressed bitmap; b) an activeWord; c) an activeWord bit length, nbits, comprising: i) a series of remainder bits, numbering less than WL minus two, stored in the activeWord, (1) the series of remainder bits forming a remainder after the uncompressed bitmap has been parsed into contiguous groupings of WL minus one bits, (2) the nbits in the activeWord represents the last contiguous grouping of nbits bits in the uncompressed bitmap; and d) each of the words of the compressed bitmap having a literal/fill bit, wherein: i) in each of the words having the literal/fill bit that represents a set state, the compressed bitmap word further comprises: (1) a fill bit value having a binary state, and (2) a fill length, wherein the compressed bitmap word represents a contiguous grouping of (fill length * (WL minus one)) bits having the fill bit value state in the corresponding uncompressed bitmap; ii) in each of the words having the literal/fill bit that represents a not set state, a literal word represents a contiguous grouping of WL minus one bits of the corresponding uncompressed bitmap.