HomeSort by: relevance | last modified time | path
    Searched refs:Range1 (Results 1 - 8 of 8) sorted by relevancy

  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
comparison.d 1449 size_t levenshteinDistance(alias equals = (a,b) => a == b, Range1, Range2)
1450 (Range1 s, Range2 t)
1451 if (isForwardRange!(Range1) && isForwardRange!(Range2))
1465 static if (isBidirectionalRange!(Range1) && isBidirectionalRange!(Range2))
1487 Levenshtein!(Range1, eq, size_t) lev;
1520 size_t levenshteinDistance(alias equals = (a,b) => a == b, Range1, Range2)
1521 (auto ref Range1 s, auto ref Range2 t)
1522 if (isConvertibleToString!Range1 || isConvertibleToString!Range2)
1525 alias Types = staticMap!(convertToString, Range1, Range2);
1561 levenshteinDistanceAndPath(alias equals = (a,b) => a == b, Range1, Range2
    [all...]
sorting.d 3370 Range1, Range2)(Range1 r1, Range2 r2)
3371 if (isRandomAccessRange!(Range1) && hasLength!Range1 &&
3372 isInputRange!Range2 && is(ElementType!Range1 == ElementType!Range2) &&
3373 hasLvalueElements!Range1 && hasLvalueElements!Range2)
3898 Range1, Range2)(Range1 r1, Range2 r2)
3899 if (isRandomAccessRange!(Range1) && hasLength!Range1 &
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/
numeric.d 1937 CommonType!(ElementType!(Range1), ElementType!(Range2))
1938 euclideanDistance(Range1, Range2)(Range1 a, Range2 b)
1939 if (isInputRange!(Range1) && isInputRange!(Range2))
1941 enum bool haveLen = hasLength!(Range1) && hasLength!(Range2);
1954 CommonType!(ElementType!(Range1), ElementType!(Range2))
1955 euclideanDistance(Range1, Range2, F)(Range1 a, Range2 b, F limit)
1956 if (isInputRange!(Range1) && isInputRange!(Range2))
1959 enum bool haveLen = hasLength!(Range1) && hasLength!(Range2)
    [all...]
path.d 3213 int filenameCmp(CaseSensitive cs = CaseSensitive.osDefault, Range1, Range2)
3214 (Range1 filename1, Range2 filename2)
3215 if (isSomeFiniteCharInputRange!Range1 && !isConvertibleToString!Range1 &&
3218 alias C1 = Unqual!(ElementEncodingType!Range1);
3229 else static if (isSomeString!Range1 && C1.sizeof < 4 ||
3275 int filenameCmp(CaseSensitive cs = CaseSensitive.osDefault, Range1, Range2)
3276 (auto ref Range1 filename1, auto ref Range2 filename2)
3277 if (isConvertibleToString!Range1 || isConvertibleToString!Range2)
3280 alias Types = staticMap!(convertToString, Range1, Range2)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/root/
array.d 821 bool equal(Range1, Range2)(Range1 range1, Range2 range2)
832 static if (isArray!Range1 && isArray!Range2 && is(typeof(range1 == range2)))
833 return range1 == range2;
837 static if (hasLength!Range1 && hasLength!Range2 && is(typeof(r1.length == r2.length)))
839 if (range1.length != range2.length)
843 for (; !range1.empty; range1.popFront(), range2.popFront()
    [all...]
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenSchedule.cpp 141 auto Range1 =
155 std::for_each(Range1.first, Range1.second, HandleNonGeneric);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
InstructionSimplify.cpp 1603 auto Range1 = ConstantRange::makeExactICmpRegion(Cmp1->getPredicate(), *C1);
1607 if (IsAnd && Range0.intersectWith(Range1).isEmptySet())
1612 if (!IsAnd && Range0.unionWith(Range1).isFullSet())
1620 if (Range0.contains(Range1))
1622 if (Range1.contains(Range0))
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86ISelLowering.cpp 12331 std::pair<int, int> Range1 = std::make_pair(INT_MAX, INT_MIN);
12342 Range1.first = std::min(Range1.first, M);
12343 Range1.second = std::max(Range1.second, M);
12358 if (!(0 <= Range1.first && Range1.second < NumEltsPerLane) ||
12388 if (Range2.second < Range1.first)
12389 return RotateAndPermute(V1, V2, Range1.first, 0);
12390 if (Range1.second < Range2.first
    [all...]

Completed in 41 milliseconds