Lines Matching full:bitmap
195 ** and 30. The upper bound on 30 is because a 32-bit integer bitmap
29257 ** bitmap. Bits are numbered starting with 1.
29259 ** A bitmap is used to record which pages of a database file have been
29262 ** So the bitmap is usually sparse and has low cardinality.
29265 ** the bitmap becomes dense with high cardinality. The algorithm needs
29268 ** The size of the bitmap is fixed when the object is created.
29270 ** All bits are clear when the bitmap is created. Individual bits
29289 /* Type of the array "element" for the bitmap representation.
29294 /* Size, in bits, of the bitmap element. */
29296 /* Number of elements in a bitmap array. */
29298 /* Number of bits in the bitmap array. */
29316 ** A bitmap is an instance of the following structure.
29318 ** This bitmap records the existance of zero or more bits
29321 ** There are three possible representations of the bitmap.
29323 ** bitmap. The least significant bit is bit 1.
29346 BITVEC_TELEM aBitmap[BITVEC_NELEM]; /* Bitmap representation */
29353 ** Create a new bitmap object able to handle bits between 0 and iSize,
29369 ** If p is NULL (if the bitmap has not been created) or if
29401 ** to get the memory needed to hold the sub-bitmap is the only
29514 ** Destroy a bitmap object. Reclaim all memory used.
87586 ** to "bitmap indices" in other database engines.
