| /external/chromium_org/third_party/skia/tests/ |
| StrokeTest.cpp | 50 SkRect inner(r);
51 inner.inset(width/2, width/2);
53 REPORTER_ASSERT(reporter, equal(nested[1], inner));
|
| PathOpsQuadLineIntersectionTest.cpp | 88 for (int inner = 0; inner < result; ++inner) {
89 double quadT = intersections[0][inner];
91 double lineT = intersections[1][inner];
|
| /external/clang/test/FixIt/ |
| typo.cpp | 104 namespace inner { // expected-note{{'outer::inner' declared here}} \ namespace in namespace:outer
105 // expected-note{{namespace 'outer::inner' defined here}} \
106 // expected-note{{'inner' declared here}}
111 using namespace outr::inner; // expected-error{{no namespace named 'inner' in namespace 'outr'; did you mean 'outer::inner'?}}
114 outr::inner::i = 3; // expected-error{{no member named 'inner' in namespace 'outr'; did you mean 'outer::inner'?}
[all...] |
| /external/clang/test/SemaCXX/ |
| attr-cxx0x.cpp | 28 template <typename... B> struct alignas(alignof(A) * alignof(B)...) inner {};
31 outer<int>::inner<short, double> mismatched_packs; // expected-note {{in instantiation of}}
45 static_assert(alignof(outer<int,char>::inner<double,short>) == alignof(int) * alignof(double), "template's alignment is wrong");
|
| implicit-exception-spec.cpp | 34 struct Inner {
36 } inner; member in struct:InClassInitializers::Nested
40 struct Inner;
41 int n = Inner().n; // expected-error {{cannot be used by non-static data member initializer}}
42 struct Inner {
44 } inner; member in struct:InClassInitializers::Nested2
71 struct Inner {
72 ~Inner() throw();
74 Inner inner; member in struct:ImplicitDtorExceptionSpec::A
[all...] |
| nested-name-spec-locations.cpp | 9 namespace inner { namespace in namespace:outer
25 using outer::inner::X0<
35 using outer::inner::X0<
47 t->T::template Inner<typename add_reference<U>::type
55 struct Inner;
68 outer_alias::inner::X0<typename add_reference<T>::type
81 typedef typename outer::inner::X0<
|
| atomic-type.cxx | 10 struct inner { char n[sizeof(T)]; }; struct in struct:user
11 atomic<inner> i;
|
| /art/test/093-serialization/src/ |
| Main.java | 50 Inner inner = new Inner(0xCAFEF00D); local
51 objStream.writeObject(inner);
64 Inner inner; local
67 inner = (Inner) objStream.readObject();
76 inner.check();
79 static class Inner implements Serializable
[all...] |
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-2261.js | 35 function inner(x) { function
45 assertEquals(1, inner(1));
46 assertEquals(1, inner(1));
47 %OptimizeFunctionOnNextCall(inner);
48 assertEquals(1, inner(1));
50 assertEquals(1, inner(1));
59 function inner(x) {
70 return inner(x);
87 function inner(x,y,z) {
100 return inner(10*x, 20*x, 30*x) + arguments[0]
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/signature/ |
| SignatureReader.java | 147 boolean visited, inner;
174 inner = false;
181 if (inner) {
193 inner = true;
198 if (inner) {
|
| /external/chromium_org/v8/test/mjsunit/harmony/ |
| block-leave.js | 34 // to actually verify that the inner context has been discarded. A static
85 let x = 'inner';
96 let x = 'inner';
106 let x = 'inner' + i;
117 let x = 'inner' + j;
127 let x = 'inner';
139 let x = 'inner';
151 let x = 'inner';
167 let x = 'inner';
185 let x = 'inner';
[all...] |
| /external/chromium_org/v8/test/mjsunit/ |
| with-leave.js | 65 // to actually verify that the inner context has been discarded. A static
69 with ({x: 'inner'}) {
80 with ({x: 'inner'}) {
91 with ({x: 'inner' + i}) {
103 with ({x: 'inner' + j}) {
115 with ({x: 'inner'}) {
127 with ({x: 'inner'}) {
140 with ({x: 'inner'}) {
156 with ({x: 'inner'}) {
175 with ({x: 'inner'}) {
[all...] |
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| inline-arguments.js | 163 function inner(x, y) {
175 return inner(x, y);
179 %OptimizeFunctionOnNextCall(inner);
185 function inner(x, y) {
197 return inner(x, y);
214 function inner(x,y) {
225 if (innerCount == 1) inner(30);
226 if (innerCount == 2) inner(30, 31);
227 if (innerCount == 3) inner(30, 31, 32);
255 %DeoptimizeFunction(inner);
275 function inner(a,b,c,d,e,f,g,h,i,j) { function
[all...] |
| lazy-const-lookup.js | 32 function inner() {
35 inner();
36 %OptimizeFunctionOnNextCall(inner);
37 inner();
|
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| DynamicSparseMatrix.h | 29 * decrease as the number of nonzeros per inner-vector increase. In practice, we observed very good performance
95 const Index inner = IsRowMajor ? col : row; local
96 return m_data[outer].at(inner);
106 const Index inner = IsRowMajor ? col : row; local
107 return m_data[outer].atWithInsertion(inner);
147 * - the new coefficient is the last one of the given inner vector.
156 inline Scalar& insertBackByOuterInner(Index outer, Index inner)
158 eigen_assert(outer<Index(m_data.size()) && inner<m_innerSize && "out of range");
159 eigen_assert(((m_data[outer].size()==0) || (m_data[outer].index(m_data[outer].size()-1)<inner))
161 m_data[outer].append(0, inner);
[all...] |
| RandomSetter.h | 190 // compute number of bits needed to store inner indices
225 const Index inner = it->first & keyBitsMask; local
232 mp_target->insertBackByOuterInner(outer, inner) = it->second.value;
270 const Index inner = (it->first >> m_keyBitsOffset) + outerOffset; local
278 while ( (i >= posStart) && (mp_target->innerIndexPtr()[i] > inner) )
284 mp_target->innerIndexPtr()[i+1] = inner;
296 const Index inner = SetterRowMajor ? col : row; local
298 const Index outerMinor = outer & OuterPacketMask; // index of the inner vector in the packet
299 const KeyType key = (KeyType(outerMinor)<<m_keyBitsOffset) | inner;
|
| /external/clang/test/CXX/temp/temp.param/ |
| p15-cxx0x.cpp | 38 template<Ts ...As, template<Ts> class ...Bs, typename ...Cs> struct Inner {
51 Inner<12345, 'x', &x,
75 template<place> struct inner { typedef T type; }; struct in struct:ParameterPackExpansions::wrap
82 struct inner { // expected-note 2{{declared}} struct in struct:ParameterPackExpansions::takedrop_impl
90 template inner<wrap<Ts>::template inner...>::take; // expected-error {{too few template arguments}}
94 template inner<wrap<Ts>::template inner...>::drop; // expected-error {{too few template arguments}}
100 using T1 = types<void, void, void, void>; // expected-error {{'types<void, void, void, void>' vs 'types<typename inner<_>::type, typename inner<_>::type, typename inner<_>::type, (no argument)>'}
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkStrokerPriv.cpp | 85 static void HandleInnerJoin(SkPath* inner, const SkPoint& pivot, const SkVector& after)
89 just connecting the two inner segments may "show through" as a funny
94 inner->lineTo(pivot.fX, pivot.fY);
97 inner->lineTo(pivot.fX - after.fX, pivot.fY - after.fY);
100 static void BluntJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal,
109 SkTSwap<SkPath*>(outer, inner);
114 HandleInnerJoin(inner, pivot, after);
117 static void RoundJoiner(SkPath* outer, SkPath* inner, const SkVector& beforeUnitNormal,
133 SkTSwap<SkPath*>(outer, inner);
152 HandleInnerJoin(inner, pivot, after)
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkPathEffect.h | 182 /** Construct a pathEffect whose effect is to apply first the inner pathEffect
183 and the the outer pathEffect (e.g. outer(inner(path)))
184 The reference counts for outer and inner are both incremented in the constructor,
187 static SkComposePathEffect* Create(SkPathEffect* outer, SkPathEffect* inner) {
188 return SkNEW_ARGS(SkComposePathEffect, (outer, inner));
197 SkComposePathEffect(SkPathEffect* outer, SkPathEffect* inner)
198 : INHERITED(outer, inner) {}
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SynchronizedBiMapTest.java | 40 TestBiMap<K, V> inner = local
42 BiMap<K, V> outer = Synchronized.biMap(inner, mutex);
97 TestBiMap<Integer, String> inner = new TestBiMap<Integer, String>( local
99 BiMap<Integer, String> outer = Synchronized.biMap(inner, mutex);
|
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| themeMac.css | 24 input::-webkit-inner-spin-button {
|
| /external/chromium_org/third_party/WebKit/Source/web/ |
| ViewportAnchor.cpp | 72 void moveToEncloseRect(IntRect& outer, const FloatRect& inner)
74 IntPoint minimumPosition = ceiledIntPoint(inner.location() + inner.size() - FloatSize(outer.size()));
75 IntPoint maximumPosition = flooredIntPoint(inner.location());
84 void moveIntoRect(FloatRect& inner, const IntRect& outer)
87 FloatPoint maximumPosition = minimumPosition + outer.size() - inner.size();
95 FloatPoint innerOrigin = inner.location();
99 inner.setLocation(innerOrigin);
110 // Preserve the inner viewport position in document in case we won't find the anchor
126 // Inner rectangle should be within the outer one
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Stride.h | 22 * It holds two values: the inner stride and the outer stride.
24 * The inner stride is the pointer increment between two consecutive entries within a given row of a
35 * \param _InnerStrideAtCompileTime the inner stride, or Dynamic if you want to specify it at runtime.
69 : m_outer(other.outer()), m_inner(other.inner())
74 /** \returns the inner stride */
75 inline Index inner() const { return m_inner.value(); } function in class:Eigen::Stride
82 /** \brief Convenience specialization of Stride to specify only an inner stride
|
| /external/chromium_org/ui/gfx/geometry/ |
| rect_base.h | 79 InsetsClass InsetsFrom(const Class& inner) const {
80 return InsetsClass(inner.y() - y(),
81 inner.x() - x(),
82 bottom() - inner.bottom(),
83 right() - inner.right());
|
| /external/eigen/Eigen/src/SparseCore/ |
| MappedSparseMatrix.h | 71 const Index inner = IsRowMajor ? col : row; local
77 else if (end>0 && inner==m_innerIndices[end-1])
82 const Index* r = std::lower_bound(&m_innerIndices[start],&m_innerIndices[end-1],inner);
84 return ((*r==inner) && (id<end)) ? m_values[id] : Scalar(0);
90 const Index inner = IsRowMajor ? col : row; local
96 Index* r = std::lower_bound(&m_innerIndices[start],&m_innerIndices[end],inner);
98 eigen_assert((*r==inner) && (id<end) && "coeffRef cannot be called on a zero coefficient");
|
