Lines Matching defs:PairsData

303 struct PairsData {  struct
304     uint8_t flags;                 // Table flags, see enum TBFlag
305     uint8_t maxSymLen;             // Maximum length in bits of the Huffman symbols
306     uint8_t minSymLen;             // Minimum length in bits of the Huffman symbols
307     uint32_t blocksNum;            // Number of blocks in the TB file
308     size_t sizeofBlock;            // Block size in bytes
309     size_t span;                   // About every span values there is a SparseIndex[] entry
310     Sym* lowestSym;                // lowestSym[l] is the symbol of length l with the lowest value
311     LR* btree;                     // btree[sym] stores the left and right symbols that expand sym
312 …  uint16_t* blockLength;         // Number of stored positions (minus one) for each block: 1..65536
313 …uint32_t blockLengthSize;      // Size of blockLength[] table: padded so it's bigger than blocksNum
314     SparseEntry* sparseIndex;      // Partial indices into blockLength[]
315     size_t sparseIndexSize;        // Size of SparseIndex[] table
316     uint8_t* data;                 // Start of Huffman compressed data
317 …:vector<uint64_t> base64;  // base64[l - min_sym_len] is the 64bit-padded lowest symbol of length l
318 …d::vector<uint8_t> symlen;   // Number of values (-1) represented by a given Huffman symbol: 1..256
319     Piece pieces[TBPIECES];        // Position pieces: the order of pieces defines the groups
320     uint64_t groupIdx[TBPIECES+1]; // Start index used for the encoding of the group's pieces
321     int groupLen[TBPIECES+1];      // Number of pieces in a given group: KRKN -> (3, 1)
322     uint16_t map_idx[4];           // WDLWin, WDLLoss, WDLCursedWin, WDLBlessedLoss (used in DTZ)