| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| NavigableMapTestSuiteBuilder.java | 61 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.NO_BOUND, Bound.EXCLUSIVE));
62 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.NO_BOUND, Bound.INCLUSIVE));
63 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.EXCLUSIVE, Bound.NO_BOUND));
64 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.EXCLUSIVE, Bound.EXCLUSIVE));
65 derivedSuites.add(createSubmapSuite(parentBuilder, Bound.EXCLUSIVE, Bound.INCLUSIVE))
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| SortedMultisetTestSuiteBuilder.java | 92 enum Bound {
105 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.NO_BOUND,
106 Bound.EXCLUSIVE));
107 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.NO_BOUND,
108 Bound.INCLUSIVE));
109 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.EXCLUSIVE,
110 Bound.NO_BOUND));
111 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.EXCLUSIVE,
112 Bound.EXCLUSIVE));
113 derivedSuites.add(createSubMultisetSuite(parentBuilder, Bound.EXCLUSIVE
[all...] |
| /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/include/llvm/Analysis/ |
| DependenceAnalysis.h | 525 /// an i64). The loop bound may be a smaller type. collectUpperBound
526 /// find the bound, if available, and zero extends it to the Type T.
527 /// (I zero extend since the bound should always be >= 0.)
528 /// If no upper bound is available, return NULL.
748 /// computes the lower bound given the current direction settings
750 const SCEV *getLowerBound(BoundInfo *Bound) const;
753 /// computes the upper bound given the current direction settings
755 const SCEV *getUpperBound(BoundInfo *Bound) const;
759 /// in the DirSet field of Bound. Returns the number of distinct
765 BoundInfo *Bound,
[all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 527 DEBUG(dbgs() << "\t\tupper bound = " << UpperBound << "\n");
920 // Loop bound may be smaller (e.g., a char).
921 // Should zero extend loop bound, since it's always >= 0.
922 // This routine collects upper bound and extends if needed.
923 // Return null if no bound available.
[all...] |
| /external/valgrind/main/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);
225 if (ent->Te.Bound.knownL && ent->Te.Bound.knownU
226 && ent->Te.Bound.boundL == 0) {
227 VG_(printf)("[%lld]", 1 + ent->Te.Bound.boundU);
230 if (ent->Te.Bound.knownL && (!ent->Te.Bound.knownU)
856 TyEnt* bound; local
[all...] |
| priv_tytypes.h | 98 } Bound;
|
| readdwarf3.c | 402 /* Upper bound on size thereof (an overestimate, in general) */
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 25 import static java.util.TreeMap.Bound.*;
698 Bound fromBound = fromInclusive ? INCLUSIVE : EXCLUSIVE;
699 Bound toBound = toInclusive ? INCLUSIVE : EXCLUSIVE;
708 Bound toBound = inclusive ? INCLUSIVE : EXCLUSIVE;
717 Bound fromBound = inclusive ? INCLUSIVE : EXCLUSIVE;
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_handlers.cc | 215 ValueHandle Bound) {
220 Diag(Loc, DL_Error, "variable length array bound evaluates to "
222 << Value(Data->Type, Bound);
225 ValueHandle Bound) {
226 __ubsan_handle_vla_bound_not_positive(Data, Bound);
|
| ubsan_handlers.h | 95 /// \brief Handle a VLA with a non-positive bound.
96 RECOVERABLE(vla_bound_not_positive, VLABoundData *Data, ValueHandle Bound)
|
| /external/valgrind/main/VEX/priv/ |
| host_generic_reg_alloc2.c | 102 /* Used when .disp == Bound and we are looking for vregs to
105 /* Optimisation: used when .disp == Bound. Indicates when the
113 Bound /* in use (holding value of some vreg) */
116 /* If .disp == Bound, what vreg is it bound to? */
168 Only do the search for vregs which are Bound in the running state,
192 vassert(state[k].disp == Bound);
434 case Bound: vex_printf("BoundTo "); \
[all...] |
| /external/v8/src/ |
| hydrogen.h | [all...] |
| hydrogen.cc | [all...] |
| /external/clang/lib/CodeGen/ |
| CGExpr.cpp | 406 // If a glvalue to which a reference is directly bound designates neither
675 // For the vector indexing extension, the bound is the number of elements.
704 llvm::Value *Bound = getArrayIndexingBound(*this, Base, IndexedType);
705 if (!Bound)
710 llvm::Value *BoundVal = Builder.CreateIntCast(Bound, SizeTy, false);
[all...] |
