/external/apache-commons-math/src/main/java/org/apache/commons/math/ |
H A D | ArgumentOutsideDomainException.java | 37 * @param lower lower bound of the domain 40 public ArgumentOutsideDomainException(double argument, double lower, double upper) { argument 41 super(argument, LocalizedFormats.ARGUMENT_OUTSIDE_DOMAIN, argument, lower, upper);
|
/external/eigen/bench/btl/libs/BLAS/ |
H A D | blas_interface.hh | 60 static char lower = 'L'; variable
|
/external/google-breakpad/src/processor/ |
H A D | binarystream.cc | 80 uint32_t lower, upper; local 81 *this >> lower >> upper; 83 u64 = static_cast<uint64_t>(lower) | (static_cast<uint64_t>(upper) << 32); 118 uint32_t lower = static_cast<uint32_t>(u64 & 0xFFFFFFFF); local 120 *this << lower << upper;
|
/external/icu/icu4c/source/samples/case/ |
H A D | ucase.c | 26 static const UChar lower[] = {0x61, 0x42, 0x69, 0}; /* lower = "abi" */ local 69 u_fprintf(out, "u_strToUpper(%S, english) -> %S\n", lower, buffer);
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZMCInstLower.cpp | 94 void SystemZMCInstLower::lower(const MachineInstr *MI, MCInst &OutMI) const { function in class:SystemZMCInstLower
|
/external/llvm/utils/TableGen/ |
H A D | X86DisassemblerTables.cpp | 329 /// imposes a total ordering (ties are resolved toward "lower") 332 /// @param lower - The class that may be less preferable 335 InstructionContext lower) { 337 assert(lower < IC_max); 349 return (ranks[upper] > ranks[lower]); 334 outranks(InstructionContext upper, InstructionContext lower) argument
|
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | AMDGPUMCInstLower.cpp | 10 // This file contains code to lower AMDGPU MachineInstrs to their corresponding 30 void AMDGPUMCInstLower::lower(const MachineInstr *MI, MCInst &OutMI) const { function in class:AMDGPUMCInstLower 73 MCInstLowering.lower(BundledInst, MCBundleInst); 79 MCInstLowering.lower(MI, TmpInst);
|
/external/elfutils/src/libdw/ |
H A D | dwarf_aggregate_size.c | 83 Dwarf_Sword lower; local 93 if (INTUSE(dwarf_formsdata) (attr_mem, &lower) != 0) 98 /* Determine default lower bound from language, 116 lower = 0; 129 lower = 1; 136 if (unlikely (lower > upper)) 138 count = upper - lower + 1;
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/integration/ |
H A D | UnivariateRealIntegratorImpl.java | 158 * @param lower lower endpoint 162 protected void verifyInterval(double lower, double upper) throws argument 164 if (lower >= upper) { 167 lower, upper); 172 * Verifies that the upper and lower limits of iterations are valid.
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
H A D | RandomData.java | 46 * <code>lower</code> and <code>upper</code> (endpoints included). 53 * <li><code>lower < upper</code> (otherwise an IllegalArgumentException 57 * @param lower lower bound for generated integer 59 * @return a random integer greater than or equal to <code>lower</code> 62 int nextInt(int lower, int upper); argument 66 * <code>lower</code> and <code>upper</code> (endpoints included). 74 * <li><code>lower < upper</code> (otherwise an IllegalArgumentException 78 * @param lower lower boun 83 nextLong(long lower, long upper) argument 124 nextSecureInt(int lower, int upper) argument 148 nextSecureLong(long lower, long upper) argument 225 nextUniform(double lower, double upper) argument [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | DescendingImmutableSortedSet.java | 81 public E lower(E element) { method in class:DescendingImmutableSortedSet 97 return forward.lower(element);
|
H A D | GeneralRange.java | 85 static <T> GeneralRange<T> range(Comparator<? super T> comparator, @Nullable T lower, argument 87 return new GeneralRange<T>(comparator, true, lower, lowerType, true, upper, upperType);
|
H A D | RegularImmutableSortedSet.java | 195 public E lower(E element) { method in class:RegularImmutableSortedSet
|
/external/libdrm/tests/planetest/ |
H A D | planetest.c | 26 static void incrementor(int *inc, int *val, int increment, int lower, int upper) argument 31 *inc = *val - increment <= lower ? 1 : -1;
|
H A D | atomictest.c | 32 static void incrementor(int *inc, int *val, int increment, int lower, int upper) argument 37 *inc = *val - increment <= lower ? 1 : -1;
|
/external/llvm/lib/Target/R600/ |
H A D | AMDGPUMCInstLower.cpp | 11 /// \brief Code to lower AMDGPU MachineInstrs to their corresponding MCInst. 43 void AMDGPUMCInstLower::lower(const MachineInstr *MI, MCInst &OutMI) const { function in class:AMDGPUMCInstLower 49 C.emitError("AMDGPUMCInstLower::lower - Pseudo instruction doesn't have " 115 MCInstLowering.lower(MI, TmpInst);
|
/external/mesa3d/src/glsl/ |
H A D | lower_instructions.cpp | 91 lower_instructions_visitor(unsigned lower) argument 92 : progress(false), lower(lower) { } 99 unsigned lower; /** Bitfield of which operations to lower */ member in class:lower_instructions_visitor 113 #define lowering(x) (this->lower & x)
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/util/ |
H A D | SorterTemplate.java | 114 second_cut = lower(pivot, hi, first_cut); 144 private int lower(int lo, int hi, int val) { method in class:SorterTemplate
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
H A D | UnivariateRealSolverImpl.java | 146 * @param min the lower bound for the interval. 169 * @param min the lower bound for the interval. 224 * @param lower the lower endpoint 227 * @return true if f(lower) * f(upper) < 0 230 protected boolean isBracketing(final double lower, final double upper, argument 233 final double f1 = function.value(lower); 254 * @param lower lower endpoint 258 protected void verifyInterval(final double lower, fina argument 275 verifySequence(final double lower, final double initial, final double upper) argument 293 verifyBracketing(final double lower, final double upper, final UnivariateRealFunction function) argument [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/transform/ |
H A D | FastFourierTransformer.java | 85 * @param min the lower bound for the interval 140 * @param min the lower bound for the interval 199 * @param min the lower bound for the interval 258 * @param min the lower bound for the interval 423 * @param min the lower bound for the interval 517 * @param lower lower endpoint 521 public static void verifyInterval(double lower, double upper) argument 524 if (lower >= upper) { 527 lower, uppe [all...] |
/external/eigen/bench/ |
H A D | bench_gemm.cpp | 41 static char lower = 'L'; variable
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
H A D | SkylineStorage.h | 18 * The lower elements 152 inline Scalar& lower(Index i) { function in class:Eigen::SkylineStorage 156 inline const Scalar& lower(Index i) const { function in class:Eigen::SkylineStorage 176 static SkylineStorage Map(Index* upperProfile, Index* lowerProfile, Scalar* diag, Scalar* upper, Scalar* lower, Index size, Index upperSize, Index lowerSize) { argument 182 res.m_lower = lower; 207 Scalar* lower = new Scalar[lowerSize]; local 220 memcpy(lower, m_lower, copyLowerSize * sizeof (Scalar)); 234 m_lower = lower;
|
/external/icu/icu4c/source/i18n/ |
H A D | collationweights.cpp | 123 // We use only the lower 16 bits for secondary weights. 137 // We use only the lower 16 bits for tertiary weights. 218 printf("length of lower limit 0x%08lx is %ld\n", lowerLimit, lowerLength); 226 printf("error: no space between lower & upper limits\n"); 235 printf("error: lower limit 0x%08lx is a prefix of upper limit 0x%08lx\n", lowerLimit, upperLimit); 240 /* if the upper limit is a prefix of the lower limit then the earlier test lowerLimit>=upperLimit has caught it */ 242 WeightRange lower[5], middle, upper[5]; /* [0] and [1] are not used - this simplifies indexing */ local 243 uprv_memset(lower, 0, sizeof(lower)); 250 * lower[ [all...] |
/external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/ |
H A D | PhoneNumberMatcher.java | 176 /** Returns a regular expression quantifier with an upper and lower limit. */ 177 private static String limit(int lower, int upper) { argument 178 if ((lower < 0) || (upper <= 0) || (upper < lower)) { 181 return "{" + lower + "," + upper + "}";
|
/external/lldb/source/Breakpoint/ |
H A D | BreakpointSiteList.cpp | 215 collection::const_iterator lower, upper, pos; local 216 lower = m_bp_site_list.lower_bound(lower_bound); 217 if (lower == m_bp_site_list.end() 218 || (*lower).first >= upper_bound) 222 // breakpoint prior to the lower bound, and check that that + its byte size isn't in our range. 223 if (lower != m_bp_site_list.begin()) 225 collection::const_iterator prev_pos = lower; 235 for (pos = lower; pos != upper; pos++)
|