Lines Matching refs:std
43 CPack::CompData::CompData(const std::size_t dictionary_size)
67 std::array<uint8_t, 4> zero_word = {0, 0, 0, 0};
68 std::fill(dictionary.begin(), dictionary.end(), zero_word);
71 std::unique_ptr<CPack::Pattern>
75 const std::array<uint8_t, 4> bytes = {
84 std::unique_ptr<Pattern> pattern =
88 for (std::size_t i = 0; i < numEntries; i++) {
90 std::unique_ptr<Pattern> temp_pattern =
95 pattern = std::move(temp_pattern);
110 std::unique_ptr<BaseCacheCompressor::CompressionData>
113 std::unique_ptr<CompData> comp_data =
114 std::unique_ptr<CompData>(new CompData(dictionarySize));
117 std::size_t size = 0;
123 for (std::size_t i = 0; i < blkSize/8; i++) {
128 std::unique_ptr<Pattern> first_pattern = compressWord(first_word);
129 std::unique_ptr<Pattern> second_pattern = compressWord(second_word);
141 comp_data->entries.push_back(std::move(first_pattern));
142 comp_data->entries.push_back(std::move(second_pattern));
156 return std::move(comp_data);
162 std::array<uint8_t, 4> data;
165 std::vector<std::array<uint8_t, 4>>::iterator entry_it =
167 std::advance(entry_it, pattern->getMatchLocation());
188 std::vector<uint32_t> decomp_words;
198 for (std::size_t i = 0; i < blkSize/8; i++) {