HomeSort by relevance Sort by last modified time
    Searched defs:IndexRange (Results 1 - 5 of 5) sorted by null

  /device/generic/goldfish-opengl/shared/OpenglCodecCommon/
IndexRangeCache.h 18 // external/angle/src/common/mathutil.h: IndexRange +
36 struct IndexRange {
100 typedef std::map<IndexRangeKey, IndexRange> IndexRangeMap;
  /external/eigen/unsupported/Eigen/CXX11/src/Tensor/
TensorSyclTuple.h 168 /// \brief IndexRange that returns a [MIN, MAX) index range
172 struct IndexRange: RangeBuilder<MIN, MAX>::type {};
190 /// generate the \ref IndexRange
198 return utility::tuple::append_base(t, a, IndexRange<0, sizeof...(Args)>());
205 /// IndexRange for each of them and create an output tuple T that contains both
221 /// t1 by tuple t2. In this case the \ref IndexRange for both tuple are
230 return utility::tuple::append_base(t1, t2, IndexRange<0, sizeof...(Args1)>(), IndexRange<0, sizeof...(Args2)>());
  /external/llvm/lib/Target/Hexagon/
HexagonBlockRanges.h 77 class IndexRange : public std::pair<IndexType,IndexType> {
79 IndexRange() : Fixed(false), TiedEnd(false) {}
80 IndexRange(IndexType Start, IndexType End, bool F = false, bool T = false)
85 bool operator< (const IndexRange &A) const {
88 bool overlaps(const IndexRange &A) const;
89 bool contains(const IndexRange &A) const;
90 void merge(const IndexRange &A);
102 class RangeList : public std::vector<IndexRange> {
105 push_back(IndexRange(Start, End, Fixed, TiedEnd));
107 void add(const IndexRange &Range)
    [all...]
  /external/skia/src/gpu/instanced/
InstancedRenderingTypes.h 172 struct IndexRange {
173 bool operator ==(const IndexRange& that) const {
177 bool operator !=(const IndexRange& that) const { return !(*this == that); }
  /prebuilts/tools/common/m2/repository/org/parboiled/parboiled-core/1.0.2/
parboiled-core-1.0.2.jar 

Completed in 189 milliseconds