/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | TokenTypes.cs | 44 public const int Min = Up + 1; field in class:Antlr.Runtime.TokenTypes
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | TokenConstants.cs | 62 public const int Min = Up + 1; field in class:Antlr.Runtime.TokenTypes
|
/external/vboot_reference/firmware/lib/include/ |
H A D | utility.h | 47 #define Min(a, b) (((a) < (b)) ? (a) : (b)) macro
|
/external/clang/lib/Basic/ |
H A D | Targets.cpp | 124 unsigned Maj, Min, Rev; local 126 Triple.getMacOSXVersion(Maj, Min, Rev); 129 Triple.getOSVersion(Maj, Min, Rev); 137 PlatformMinVersion = VersionTuple(Maj, Min, Rev); 143 assert(Maj < 10 && Min < 100 && Rev < 100 && "Invalid version!"); 146 Str[1] = '0' + (Min / 10); 147 Str[2] = '0' + (Min % 10); 158 assert(Maj < 100 && Min < 100 && Rev < 100 && "Invalid version!"); 160 if (Maj < 10 || (Maj == 10 && Min < 10)) { 163 Str[2] = '0' + std::min(Min, [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
H A D | Min.java | 40 public class Min extends AbstractStorelessUnivariateStatistic implements Serializable { class in inherits:AbstractStorelessUnivariateStatistic,Serializable 52 * Create a Min instance 54 public Min() { method in class:Min 60 * Copy constructor, creates a new {@code Min} identical 63 * @param original the {@code Min} instance to copy 65 public Min(Min original) { method in class:Min 144 public Min copy() { 145 Min result = new Min(); [all...] |
/external/llvm/include/llvm/Transforms/IPO/ |
H A D | LowerBitSets.h | 64 uint64_t Min, Max; member in struct:llvm::BitSetBuilder 66 BitSetBuilder() : Min(std::numeric_limits<uint64_t>::max()), Max(0) {} 69 if (Min > Offset) 70 Min = Offset;
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.JavaExtensions/ |
H A D | EnumerableExtensions.cs | 154 #region Min 156 public static int Min(IEnumerable<int> source) { method in class:Antlr.Runtime.JavaExtensions.EnumerableExtensions 159 return Iterate(source, int.MaxValue, delegate(int a, int b) { return Math.Min(a, b); });
|
/external/skia/bench/ |
H A D | bench_util.py | 87 Min = _ExtremeType(-1, "Min") variable 269 max_x = Min
|
/external/clang/include/clang/Frontend/ |
H A D | VerifyDiagnosticConsumer.h | 152 unsigned Min, unsigned Max); 161 unsigned Min, Max; member in class:clang::VerifyDiagnosticConsumer::Directive 175 bool MatchAnyLine, StringRef Text, unsigned Min, unsigned Max) 177 Text(Text), Min(Min), Max(Max), MatchAnyLine(MatchAnyLine) { 174 Directive(SourceLocation DirectiveLoc, SourceLocation DiagnosticLoc, bool MatchAnyLine, StringRef Text, unsigned Min, unsigned Max) argument
|
/external/compiler-rt/lib/ubsan/ |
H A D | ubsan_diag.cc | 224 MemoryLocation Min = subtractNoOverflow(Loc, MinBytesNearLoc); local 226 MemoryLocation OrigMin = Min; 228 Min = __sanitizer::Min(Ranges[I].getStart().getMemoryLocation(), Min); 234 if (Max - Min > BytesToShow) 235 Min = __sanitizer::Min(Max - BytesToShow, OrigMin); 236 Max = addNoOverflow(Min, BytesToShow); 238 if (!IsAccessibleMemoryRange(Min, Ma [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | SCCIterator.h | 55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min) argument 56 : Node(Node), NextChild(Child), MinVisited(Min) {}
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | ReductionRules.h | 49 PBQPNum Min = ECosts[0][j] + XCosts[0]; local 52 if (C < Min) 53 Min = C; 55 YCosts[j] += Min; 59 PBQPNum Min = ECosts[i][0] + XCosts[0]; local 62 if (C < Min) 63 Min = C; 65 YCosts[i] += Min; 111 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]; local 114 if (C < Min) { [all...] |
/external/llvm/lib/Analysis/IPA/ |
H A D | GlobalsModRef.cpp | 130 ModRefBehavior Min = UnknownModRefBehavior; variable 134 Min = DoesNotAccessMemory; 136 Min = OnlyReadsMemory; 139 return ModRefBehavior(AliasAnalysis::getModRefBehavior(F) & Min); 146 ModRefBehavior Min = UnknownModRefBehavior; variable 151 Min = DoesNotAccessMemory; 153 Min = OnlyReadsMemory; 156 return ModRefBehavior(AliasAnalysis::getModRefBehavior(CS) & Min);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Float2Int.cpp | 201 APInt Min = APInt::getMinValue(BW).zextOrSelf(MaxIntegerBW+1); local 203 seen(I, validateRange(ConstantRange(Min, Max)));
|
/external/skia/src/opts/ |
H A D | SkNx_neon.h | 103 static SkNf Min(const SkNf& l, const SkNf& r) { return vmin_f32(l.fVec, r.fVec); } function in class:SkNf 172 static SkNf Min(const SkNf& l, const SkNf& r) { return vminq_f64(l.fVec, r.fVec); } function in class:SkNf 280 static SkNf Min(const SkNf& l, const SkNf& r) { return vminq_f32(l.fVec, r.fVec); } function in class:SkNf 332 static SkNi Min(const SkNi& a, const SkNi& b) { return vminq_u16(a.fVec, b.fVec); } function in class:SkNi 369 static SkNi Min(const SkNi& a, const SkNi& b) { return vminq_u8(a.fVec, b.fVec); } function in class:SkNi
|
H A D | SkNx_sse.h | 78 static SkNf Min(const SkNf& l, const SkNf& r) { return _mm_min_ps(l.fVec, r.fVec); } function in class:SkNf 123 static SkNf Min(const SkNf& l, const SkNf& r) { return _mm_min_pd(l.fVec, r.fVec); } function in class:SkNf 208 static SkNf Min(const SkNf& l, const SkNf& r) { return _mm_min_ps(l.fVec, r.fVec); } function in class:SkNf 275 static SkNi Min(const SkNi& a, const SkNi& b) { function in class:SkNi 318 static SkNi Min(const SkNi& a, const SkNi& b) { return _mm_min_epu8(a.fVec, b.fVec); } function in class:SkNi
|
/external/clang/lib/Frontend/ |
H A D | InitPreprocessor.cpp | 130 const char *DenormMin, *Epsilon, *Max, *Min; local 146 Min = PickFP(Sem, "1.17549435e-38", "2.2250738585072014e-308", 175 Builder.defineMacro(DefPrefix + "MIN__", Twine(Min)+Ext);
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | RangeConstraintManager.cpp | 236 // intersection with the two ranges [Min, Upper] and [Lower, Max], 468 // Special case for Int == Min. This is always false. 470 llvm::APSInt Min = AdjustmentType.getMinValue(); local 471 if (ComparisonVal == Min) 474 llvm::APSInt Lower = Min-Adjustment; 526 // Special case for Int == Min. This is always feasible. 528 llvm::APSInt Min = AdjustmentType.getMinValue(); local 529 if (ComparisonVal == Min) 561 llvm::APSInt Min = AdjustmentType.getMinValue(); 562 llvm::APSInt Lower = Min [all...] |
/external/eigen/Eigen/src/Geometry/ |
H A D | AlignedBox.h | 44 Min=0, Max=1, enumerator in enum:Eigen::AlignedBox::CornerType
|
/external/llvm/lib/Analysis/ |
H A D | AliasAnalysis.cpp | 245 ModRefBehavior Min = UnknownModRefBehavior; local 250 Min = getModRefBehavior(F); 253 if (!AA) return Min; 257 return ModRefBehavior(AA->getModRefBehavior(CS) & Min);
|
H A D | BlockFrequencyInfoImpl.cpp | 427 const Scaled64 &Min, const Scaled64 &Max) { 432 // small, unequal numbers. When the spread between Min and Max frequencies 435 const unsigned SpreadBits = (Max / Min).lg(); 440 ScalingFactor = Min.inverse(); 450 DEBUG(dbgs() << "float-to-int: min = " << Min << ", max = " << Max 499 auto Min = Scaled64::getLargest(); local 503 Min = std::min(Min, Freqs[Index].Scaled); 508 convertFloatingToInteger(*this, Min, Max); 426 convertFloatingToInteger(BlockFrequencyInfoImplBase &BFI, const Scaled64 &Min, const Scaled64 &Max) argument
|
/external/skia/src/core/ |
H A D | SkNx.h | 71 static SkNi Min(const SkNi& a, const SkNi& b) { function in class:SkNi 72 return SkNi(SkNi<N/2, T>::Min(a.fLo, b.fLo), SkNi<N/2, T>::Min(a.fHi, b.fHi)); 125 static SkNf Min(const SkNf& l, const SkNf& r) { function in class:SkNf 126 return SkNf(SkNf<N/2,T>::Min(l.fLo, r.fLo), SkNf<N/2,T>::Min(l.fHi, r.fHi)); 190 static SkNi Min(const SkNi& a, const SkNi& b) { return SkNi(SkTMin(a.fVal, b.fVal)); } function in class:SkNi 229 static SkNf Min(const SkNf& l, const SkNf& r) { return SkNf(SkTMin(l.fVal, r.fVal)); } function in class:SkNf
|
/external/clang/lib/Sema/ |
H A D | JumpDiagnostics.cpp | 649 // into the target scope. 'Min' will end up being the index of 651 unsigned Min = TargetScope; local 653 Reachable.set(Min); 656 if (Min == 0) break; 659 if (Scopes[Min].InDiag) break; 661 Min = Scopes[Min].ParentScope; 688 if (Scope == 0 || Scope < Min) break;
|
/external/google-breakpad/src/common/windows/ |
H A D | omap.cc | 124 const T& Min(const T& t1, const T& t2) { return t1 < t2 ? t1 : t2; } function in namespace:google_breakpad::__anon5137 338 DWORD header = Min(header_transformed, header_original); 448 it1->index = Min(i, it1->index); 478 mapped_range->injected -= Min(trim, mapped_range->injected);
|
/external/v8/src/ |
H A D | types.cc | 59 return lhs->Min()->Number() <= rhs->Min()->Number() 69 && range->Min()->Number() <= val->Number() 75 // Min and Max computation. 78 double TypeImpl<Config>::Min() { function in class:v8::internal::TypeImpl 80 if (this->IsBitset()) return BitsetType::Min(this->AsBitset()); 84 min = std::min(min, this->AsUnion()->Get(i)->Min()); 88 if (this->IsRange()) return this->AsRange()->Min()->Number(); 355 double TypeImpl<Config>::BitsetType::Min(bitset bits) { function in class:v8::internal::TypeImpl::BitsetType 946 type->AsRange()->Min(), typ [all...] |