Searched refs:simple (Results 1 - 25 of 200) sorted by relevance

12345678

/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-2339.js30 function simple() { function
40 simple();
41 simple();
42 %OptimizeFunctionOnNextCall(simple);
43 simple();
44 assertOptimized(simple);
/external/nanopb-c/examples/simple/
H A DMakefile9 CSRC = simple.c # The main program
10 CSRC += simple.pb.c # The compiled protocol definition
15 simple: $(CSRC)
19 simple.pb.c: simple.proto
20 $(PROTOC) $(PROTOC_OPTS) --nanopb_out=. simple.proto
/external/clang/test/Sema/
H A Dmember-reference.c3 struct simple { int i; }; struct
6 struct simple s[1];
22 int PR17762(struct simple c) {
23 return c->i; // expected-error {{member reference type 'struct simple' is not a pointer; maybe you meant to use '.'?}}
/external/chromium_org/v8/test/mjsunit/
H A Dhtml-string-funcs.js34 var simple = { big: 'big', blink: 'blink', bold: 'b',
37 for (var i in simple) CheckSimple(i, simple[i]);
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsSimplify.cpp12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument
50 if (!unsortable && simple->hasMove()
52 && !simple->isClosed()) {
53 current->addCurveTo(index, endIndex, simple, true);
54 SkASSERT(simple->isClosed());
63 current->addCurveTo(index, endIndex, simple, true);
67 } while (!simple->isClosed() && (!unsortable
69 if (current->activeWinding(index, endIndex) && !simple->isClosed()) {
70 // SkASSERT(unsortable || simple->isEmpty());
73 current->addCurveTo(index, endIndex, simple, tru
105 bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) argument
[all...]
H A DSkPathOpsOp.cpp122 const int xorMask, const int xorOpMask, SkPathWriter* simple) {
167 if (!unsortable && simple->hasMove()
169 && !simple->isClosed()) {
170 current->addCurveTo(index, endIndex, simple, true);
172 if (!simple->isClosed()) {
176 // SkASSERT(simple->isClosed());
185 current->addCurveTo(index, endIndex, simple, true);
189 } while (!simple->isClosed() && (!unsortable
191 if (current->activeWinding(index, endIndex) && !simple->isClosed()) {
194 if (!unsortable && !simple
121 bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, const int xorMask, const int xorOpMask, SkPathWriter* simple) argument
[all...]
H A DSkPathOpsCommon.h16 void Assemble(const SkPathWriter& path, SkPathWriter* simple);
/external/skia/src/pathops/
H A DSkPathOpsSimplify.cpp12 static bool bridgeWinding(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) { argument
50 if (!unsortable && simple->hasMove()
52 && !simple->isClosed()) {
53 current->addCurveTo(index, endIndex, simple, true);
54 SkASSERT(simple->isClosed());
63 current->addCurveTo(index, endIndex, simple, true);
67 } while (!simple->isClosed() && (!unsortable
69 if (current->activeWinding(index, endIndex) && !simple->isClosed()) {
70 // SkASSERT(unsortable || simple->isEmpty());
73 current->addCurveTo(index, endIndex, simple, tru
105 bridgeXor(SkTArray<SkOpContour*, true>& contourList, SkPathWriter* simple) argument
[all...]
H A DSkPathOpsOp.cpp122 const int xorMask, const int xorOpMask, SkPathWriter* simple) {
167 if (!unsortable && simple->hasMove()
169 && !simple->isClosed()) {
170 current->addCurveTo(index, endIndex, simple, true);
172 if (!simple->isClosed()) {
176 // SkASSERT(simple->isClosed());
185 current->addCurveTo(index, endIndex, simple, true);
189 } while (!simple->isClosed() && (!unsortable
191 if (current->activeWinding(index, endIndex) && !simple->isClosed()) {
194 if (!unsortable && !simple
121 bridgeOp(SkTArray<SkOpContour*, true>& contourList, const SkPathOp op, const int xorMask, const int xorOpMask, SkPathWriter* simple) argument
[all...]
H A DSkPathOpsCommon.h16 void Assemble(const SkPathWriter& path, SkPathWriter* simple);
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DShapeOps.h11 void simplify(const SkPath& path, bool asFill, SkPath& simple);
33 void simplifyx(const SkPath& path, SkPath& simple);
H A DShapeOps.cpp133 const int xorMask, const int xorOpMask, PathWrapper& simple) {
167 if (!unsortable && simple.hasMove()
169 && !simple.isClosed()) {
170 current->addCurveTo(index, endIndex, simple, true);
171 SkASSERT(simple.isClosed());
180 current->addCurveTo(index, endIndex, simple, true);
184 } while (!simple.isClosed() && ((!unsortable)
186 if (current->activeWinding(index, endIndex) && !simple.isClosed()) {
190 current->addCurveTo(index, endIndex, simple, true);
194 simple
132 bridgeOp(SkTDArray<Contour*>& contourList, const ShapeOp op, const int xorMask, const int xorOpMask, PathWrapper& simple) argument
[all...]
/external/skia/experimental/Intersection/
H A DShapeOps.h11 void simplify(const SkPath& path, bool asFill, SkPath& simple);
33 void simplifyx(const SkPath& path, SkPath& simple);
H A DShapeOps.cpp133 const int xorMask, const int xorOpMask, PathWrapper& simple) {
167 if (!unsortable && simple.hasMove()
169 && !simple.isClosed()) {
170 current->addCurveTo(index, endIndex, simple, true);
171 SkASSERT(simple.isClosed());
180 current->addCurveTo(index, endIndex, simple, true);
184 } while (!simple.isClosed() && ((!unsortable)
186 if (current->activeWinding(index, endIndex) && !simple.isClosed()) {
190 current->addCurveTo(index, endIndex, simple, true);
194 simple
132 bridgeOp(SkTDArray<Contour*>& contourList, const ShapeOp op, const int xorMask, const int xorOpMask, PathWrapper& simple) argument
[all...]
/external/llvm/include/llvm/Support/
H A DDOTGraphTraits.h12 // this file will produce a simple, but not very polished graph. By
39 explicit DefaultDOTGraphTraits(bool simple=false) : IsSimple (simple) {} argument
161 DOTGraphTraits (bool simple=false) : DefaultDOTGraphTraits (simple) {} argument
/external/javassist/src/test/test/javassist/convert/
H A DArrayAccessReplaceTest.java14 private static SimpleInterface simple; field in class:ArrayAccessReplaceTest
24 simple = (SimpleInterface) simpleClass.toClass(new URLClassLoader(new URL[0], getClass().getClassLoader()), Class.class.getProtectionDomain()).newInstance();
41 simple.setBoolean(i, value);
46 assertEquals(value, simple.getBoolean(i));
52 simple.setByte(i, i);
56 assertEquals(i, simple.getByte(i));
62 simple.setShort(i, i);
66 assertEquals(i, simple.getShort(i));
72 simple.setChar(i, i);
76 assertEquals(i, simple
[all...]
/external/valgrind/main/memcheck/tests/
H A Dmalloc_free_fill.stderr.exp1 test simple malloc/free:
/external/guava/guava-tests/test/com/google/common/util/concurrent/
H A DForwardingCheckedFutureTest.java46 private TestSimpleFuture simple = new TestSimpleFuture(); field in class:ForwardingCheckedFutureTest
52 assertEquals(VALUE, simple.checkedGet());
60 assertEquals(VALUE, simple.checkedGet(100, TIME_UNIT));
74 simple.checkedGet(100, TIME_UNIT);
91 simple.checkedGet();
/external/clang/test/CodeGenCXX/
H A Dmicrosoft-abi-vtables-virtual-inheritance-vtordisps.cpp34 namespace simple { namespace
51 // A simple vtordisp{A,B} thunk for Method@Class is something like:
57 // CHECK-LABEL: VFTable for 'V1' in 'simple::A' (2 entries).
58 // CHECK-NEXT: 0 | void simple::A::f()
60 // CHECK-NEXT: 1 | simple::A::~A() [scalar deleting]
63 // CHECK-LABEL: Thunks for 'simple::A::~A()' (1 entry).
66 // CHECK-LABEL: Thunks for 'void simple::A::f()' (1 entry).
70 // MANGLING-DAG: @"\01?f@A@simple@@$4PPPPPPPM@A@AEXXZ"
73 // MANGLING-DAG: @"\01??_EA@simple@@$4PPPPPPPM@A@AEPAXI@Z"
80 // CHECK-LABEL: VFTable for 'Z' in 'V3' in 'simple
[all...]
/external/chromium_org/third_party/skia/experimental/webtry/poly/
H A DGruntfile.js43 simple: {
62 grunt.registerTask('notmin', ['shell:bower_install', 'bower', 'concat', 'copy:simple']);
/external/llvm/test/MC/X86/AlignedBundling/
H A Dasm-printing-bundle-directives.s3 # Just a simple test for the assembly emitter - making sure it emits back the
/external/skia/experimental/webtry/poly/
H A DGruntfile.js43 simple: {
62 grunt.registerTask('notmin', ['shell:bower_install', 'bower', 'concat', 'copy:simple']);
/external/guava/guava-tests/test/com/google/common/base/
H A DSplitterTest.java52 String simple = "a,b,c";
53 Iterable<String> letters = COMMA_SPLITTER.split(simple);
58 String simple = "a,b,c";
59 Iterable<String> letters = Splitter.on('.').split(simple);
153 String simple = "a,b,c";
154 Iterable<String> letters = Splitter.on(",").split(simple);
159 String simple = "a,b,c";
160 Iterable<String> letters = Splitter.on(".").split(simple);
280 String simple = "a,b,c";
281 Iterable<String> letters = Splitter.onPattern(",").split(simple);
[all...]
/external/clang/test/Index/
H A Dprint-type-size.cpp16 // CHECK64: StructDecl=simple:[[@LINE+2]]:8 (Definition) [type=basic::simple] [typekind=Record] [sizeof=48] [alignof=8]
17 // CHECK32: StructDecl=simple:[[@LINE+1]]:8 (Definition) [type=basic::simple] [typekind=Record] [sizeof=36] [alignof=4]
18 struct simple { struct in namespace:basic
45 struct simple s1;
48 // CHECK64: VarDecl=s1:[[@LINE+2]]:8 (Definition) [type=basic::simple] [typekind=Record] [sizeof=48] [alignof=8]
49 // CHECK32: VarDecl=s1:[[@LINE+1]]:8 (Definition) [type=basic::simple] [typekind=Record] [sizeof=36] [alignof=4]
50 simple s1;
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.p2.artifact.repository_1.1.1.R36x_v20100901.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 774 milliseconds

12345678