HomeSort by relevance Sort by last modified time
    Searched refs:Bound (Results 1 - 25 of 63) sorted by null

1 2 3

  /external/guava/guava-testlib/src/com/google/common/collect/testing/
NavigableMapTestSuiteBuilder.java 22 import com.google.common.collect.testing.DerivedCollectionGenerators.Bound;
65 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.NO_BOUND, Bound.INCLUSIVE));
66 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.EXCLUSIVE, Bound.NO_BOUND));
67 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.EXCLUSIVE, Bound.EXCLUSIVE));
68 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.EXCLUSIVE, Bound.INCLUSIVE));
69 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.INCLUSIVE, Bound.INCLUSIVE))
    [all...]
NavigableSetTestSuiteBuilder.java 19 import com.google.common.collect.testing.DerivedCollectionGenerators.Bound;
57 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.NO_BOUND, Bound.INCLUSIVE));
58 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.EXCLUSIVE, Bound.NO_BOUND));
59 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.EXCLUSIVE, Bound.EXCLUSIVE));
60 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.EXCLUSIVE, Bound.INCLUSIVE));
61 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.INCLUSIVE, Bound.INCLUSIVE))
    [all...]
SortedSetTestSuiteBuilder.java 19 import com.google.common.collect.testing.DerivedCollectionGenerators.Bound;
66 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.NO_BOUND, Bound.EXCLUSIVE));
67 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.INCLUSIVE, Bound.NO_BOUND));
68 derivedSuites.add(createSubsetSuite(parentBuilder, Bound.INCLUSIVE, Bound.EXCLUSIVE));
83 parentBuilder, final Bound from, final Bound to) {
101 TestSortedSetGenerator<E> delegate, Bound to, Bound from)
    [all...]
SortedMapTestSuiteBuilder.java 19 import com.google.common.collect.testing.DerivedCollectionGenerators.Bound;
67 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.NO_BOUND, Bound.EXCLUSIVE));
68 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.INCLUSIVE, Bound.NO_BOUND));
69 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.INCLUSIVE, Bound.EXCLUSIVE));
105 parentBuilder, final Bound from, final Bound to) {
122 TestSortedMapGenerator<K, V> delegate, Bound to, Bound from)
    [all...]
DerivedCollectionGenerators.java 334 public enum Bound {
342 final Bound to;
343 final Bound from;
350 TestSortedSetGenerator<E> delegate, Bound to, Bound from) {
369 public final Bound getTo() {
373 public final Bound getFrom() {
408 if (from != Bound.NO_BOUND) {
412 if (to != Bound.NO_BOUND) {
430 if (from == Bound.NO_BOUND && to == Bound.EXCLUSIVE)
    [all...]
  /external/guava/guava-testlib/src/com/google/common/collect/testing/google/
SortedMultisetTestSuiteBuilder.java 109 enum Bound {
126 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.NO_BOUND,
127 Bound.EXCLUSIVE));
128 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.NO_BOUND,
129 Bound.INCLUSIVE));
130 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.EXCLUSIVE,
131 Bound.NO_BOUND));
132 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.EXCLUSIVE,
133 Bound.EXCLUSIVE));
134 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.EXCLUSIVE
    [all...]
  /external/v8/src/compiler/
loop-variable-optimizer.h 27 struct Bound {
28 Bound(Node* bound, ConstraintKind kind) : bound(bound), kind(kind) {}
30 Node* bound; member in struct:v8::internal::compiler::InductionVariable::Bound
34 const ZoneVector<Bound>& lower_bounds() { return lower_bounds_; }
35 const ZoneVector<Bound>& upper_bounds() { return upper_bounds_; }
52 void AddUpperBound(Node* bound, ConstraintKind kind);
53 void AddLowerBound(Node* bound, ConstraintKind kind)
    [all...]
  /external/sfntly/cpp/src/sfntly/data/
font_data.cc 31 void FontData::Bound(int32_t offset, int32_t length) {
66 Bound(data->bound_offset_ + offset, length);
71 Bound(data->bound_offset_ + offset,
font_data.h 61 virtual void Bound(int32_t offset, int32_t length);
70 // Makes a bottom bound only slice of this array. The returned slice will
100 // @param offset the offset to get the bound compensated offset for
101 // @return the bound compensated offset
107 // @param length the length to get the bound compensated length for
108 // @return the bound compensated length
  /external/clang/test/CXX/temp/temp.decls/temp.variadic/
example-bind.cpp 275 template<typename Bound, typename... Args>
276 inline typename safe_tuple_element<is_placeholder<Bound>::value -1,
278 mu(Bound& bound_arg, const tuple<Args&...>& args) {
279 return get<is_placeholder<Bound>::value-1>(args);
293 template<typename Bound, typename... Args>
294 inline typename enable_if<is_bind_expression<Bound>::value,
295 typename Bound::result_type>::type
296 mu(Bound& bound_arg, const tuple<Args&...>& args) {
311 template<typename Bound, typename... Args>
312 inline typename enable_if<(!is_bind_expression<Bound>::value
    [all...]
  /external/llvm/lib/Analysis/
DependenceAnalysis.cpp 527 DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
    [all...]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/
rd-bound4.d 5 # Bound with register and immediate are part of the common
13 [ ]+0:[ ]+c375[ ]+bound\.b r3,r7
14 [ ]+2:[ ]+d815[ ]+bound\.w r8,r1
15 [ ]+4:[ ]+eb35[ ]+bound\.d r11,r3
16 [ ]+6:[ ]+cf2d 4200[ ]+bound\.b 0x42,r2
17 [ ]+a:[ ]+df0d 6810[ ]+bound\.w 0x1068,r0
18 [ ]+e:[ ]+ef5d 6a16 4000[ ]+bound.d 40166a <x\+0x40166a>,r5
  /external/valgrind/coregrind/m_debuginfo/
tytypes.c 114 if (te->Te.Bound.knownL)
115 VG_(printf)("%lld", te->Te.Bound.boundL);
119 if (te->Te.Bound.knownU)
120 VG_(printf)("%lld", te->Te.Bound.boundU);
224 if (ent->Te.Bound.knownL && ent->Te.Bound.knownU
225 && ent->Te.Bound.boundL == 0) {
226 VG_(printf)("[%lld]", 1 + ent->Te.Bound.boundU);
229 if (ent->Te.Bound.knownL && (!ent->Te.Bound.knownU)
861 TyEnt* bound; local
    [all...]
  /external/llvm/include/llvm/Analysis/
DependenceAnalysis.h 571 /// an i64). The loop bound may be a smaller type. collectUpperBound
572 /// find the bound, if available, and zero extends it to the Type T.
573 /// (I zero extend since the bound should always be >= 0.)
574 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
DependenceAnalysis.h 561 /// an i64). The loop bound may be a smaller type. collectUpperBound
562 /// find the bound, if available, and zero extends it to the Type T.
563 /// (I zero extend since the bound should always be >= 0.)
564 /// If no upper bound is available, return NULL.
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Mtftp4Dxe/
Mtftp4Support.h 28 INTN Bound;
  /external/autotest/server/cros/network/
netperf_runner.py 279 Bound = collections.namedtuple('Bound', ['lower', 'upper'])
280 self.duration_seconds_bounds = Bound(duration_seconds_min,
282 self.throughput_bounds = Bound(throughput_min, throughput_max)
283 self.errors_bounds = Bound(error_min, error_max)
284 self.transaction_rate_bounds = Bound(transaction_rate_min,
  /external/valgrind/VEX/priv/
host_generic_reg_alloc2.c 104 /* Used when .disp == Bound and we are looking for vregs to
107 /* Optimisation: used when .disp == Bound. Indicates when the
115 Bound /* in use (holding value of some vreg) */
118 /* If .disp == Bound, what vreg is it bound to? */
152 Only do the search for vregs which are Bound in the running state,
179 vassert(state[k].disp == Bound);
482 case Bound: vex_printf("BoundTo "); \
    [all...]

Completed in 845 milliseconds

1 2 3