Searched refs:m_Ranges (Results 1 – 8 of 8) sorted by relevance
179 m_Line.beg + m_Ranges[index * 2], in GetRange()180 m_Line.beg + m_Ranges[index * 2 + 1] }; in GetRange()191 size_t m_Ranges[RANGE_COUNT_MAX * 2]; // Pairs of begin-end. variable278 void Clear() { m_Ranges.clear(); } in Clear()281 bool IsEmpty() const { return m_Ranges.empty(); } in IsEmpty()282 size_t GetCount() const { return m_Ranges.size(); } in GetCount()283 const RangeType* GetRanges() const { return m_Ranges.data(); } in GetRanges()288 std::vector<RangeType> m_Ranges;294 m_Ranges.clear(); in Parse()322 m_Ranges.push_back(range); in Parse()[all …]
86 m_Ranges[rangeIndex * 2] = charIndex; in Set()89 m_Ranges[rangeIndex * 2 + 1] = charIndex; in Set()
110 m_Ranges = ReadArrayElementsToVector(pRanges, nOutputs); in Init()117 if (!m_Ranges.empty() && m_nOutputs > old_outputs) { in Init()120 m_Ranges.resize(nOutputs.ValueOrDie()); in Init()141 if (m_Ranges.empty()) in Call()146 pdfium::clamp(results[i], m_Ranges[i * 2], m_Ranges[i * 2 + 1]); in Call()
41 float GetRange(int i) const { return m_Ranges[i]; } in GetRange()67 std::vector<float> m_Ranges; variable
95 m_DecodeInfo[i].decode_min = m_Ranges[i * 2]; in v_Init()96 m_DecodeInfo[i].decode_max = m_Ranges[i * 2 + 1]; in v_Init()
200 float m_Ranges[kRangesCount]; member in __anon5df10cd10111::CPDF_LabCS825 *min = m_Ranges[iComponent * 2 - 2]; in GetDefaultValue()826 *max = m_Ranges[iComponent * 2 - 1]; in GetDefaultValue()845 static_assert(FX_ArraySize(kDefaultRanges) == FX_ArraySize(m_Ranges), in v_Load()848 m_Ranges[i] = pParam ? pParam->GetNumberAt(i) : kDefaultRanges[i]; in v_Load()
34 m_pCMap->SetMixedFourByteLeadingRanges(std::move(m_Ranges)); in ~CPDF_CMapParser()126 size_t nSegs = m_Ranges.size() + m_PendingRanges.size(); in HandleCodeSpaceRange()129 !m_Ranges.empty() ? m_Ranges[0] : m_PendingRanges[0]; in HandleCodeSpaceRange()134 m_Ranges.reserve(nSegs); in HandleCodeSpaceRange()136 std::back_inserter(m_Ranges)); in HandleCodeSpaceRange()
52 std::vector<CPDF_CMap::CodeRange> m_Ranges; variable