| /external/v8/test/mjsunit/compiler/ |
| named-store.js | 12 var f1 = new Foo(3, 4);
17 var f = new Foo(i, i + 2);
23 var f = new Foo(i, i + 2);
29 var f = new Foo(i + "", (i + 2) + "");
|
| /external/v8/test/mjsunit/regress/ |
| regress-3281.js | 9 var s = new Set();
10 var setIterator = new SetIterator(s, 2);
13 var m = new Map();
14 var mapIterator = new MapIterator(m, 2);
|
| regress-349885.js | 10 a[292755462] = new Object();
12 foo(new Array(5));
13 foo(new Array(5));
15 foo(new Array(10));
|
| regress-3564.js | 13 assertTrue("a" < new String("y"));
14 assertTrue("a" < new MyWrapper("z"));
17 assertFalse("a" > new String("y"));
18 assertFalse("a" > new MyWrapper("z"));
|
| regress-undefined-nan3.js | 7 var ab = new ArrayBuffer(8);
8 var i_view = new Int32Array(ab);
11 var f_view = new Float64Array(ab);
13 var fixed_double_elements = new Float64Array(1);
18 new A(fixed_double_elements);
19 new A(fixed_double_elements);
23 var obj = new A(fixed_double_elements);
|
| regress-353004.js | 7 var buffer1 = new ArrayBuffer(100 * 1024);
9 var array1 = new Uint8Array(buffer1, {valueOf : function() {
16 var buffer2 = new ArrayBuffer(100 * 1024);
19 var array2 = new Uint8Array(buffer2, 0, {valueOf : function() {
26 var buffer3 = new ArrayBuffer(100 * 1024 * 1024);
27 var dataView1 = new DataView(buffer3, {valueOf : function() {
34 var buffer4 = new ArrayBuffer(100 * 1024);
36 var dataView2 = new DataView(buffer4, 0, {valueOf : function() {
43 var buffer5 = new ArrayBuffer(100 * 1024);
51 var buffer7 = new ArrayBuffer(100 * 1024 * 1024)
[all...] |
| regress-crbug-416558.js | 22 var c = new Date();
25 var b = new Date();
36 var c = new Number(1);
39 var b = new Number(1);
50 var c = new Boolean();
53 var b = new Boolean();
64 var c = new Map();
67 var b = new Map();
78 var c = new Set();
81 var b = new Set()
[all...] |
| /hardware/bsp/intel/peripheral/libmraa/examples/javascript/ |
| isr.js | 9 x = new m.Gpio(14)
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_nonzero.py | 20 new = Name(u"__bool__", prefix=name.prefix)
21 name.replace(new)
|
| fix_has_key.py | 100 new = pytree.Node(syms.comparison, (arg, n_op, before))
102 new = parenthesize(new)
103 new = pytree.Node(syms.power, (new,) + tuple(after))
108 new = parenthesize(new)
109 new.prefix = prefix
110 return new
|
| fix_input.py | 24 new = node.clone()
25 new.prefix = u""
26 return Call(Name(u"eval"), [new], prefix=node.prefix)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_nonzero.py | 20 new = Name(u"__bool__", prefix=name.prefix)
21 name.replace(new)
|
| fix_has_key.py | 100 new = pytree.Node(syms.comparison, (arg, n_op, before))
102 new = parenthesize(new)
103 new = pytree.Node(syms.power, (new,) + tuple(after))
108 new = parenthesize(new)
109 new.prefix = prefix
110 return new
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_nonzero.py | 20 new = Name(u"__bool__", prefix=name.prefix)
21 name.replace(new)
|
| fix_has_key.py | 100 new = pytree.Node(syms.comparison, (arg, n_op, before))
102 new = parenthesize(new)
103 new = pytree.Node(syms.power, (new,) + tuple(after))
108 new = parenthesize(new)
109 new.prefix = prefix
110 return new
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_nonzero.py | 20 new = Name(u"__bool__", prefix=name.prefix)
21 name.replace(new)
|
| fix_has_key.py | 100 new = pytree.Node(syms.comparison, (arg, n_op, before))
102 new = parenthesize(new)
103 new = pytree.Node(syms.power, (new,) + tuple(after))
108 new = parenthesize(new)
109 new.prefix = prefix
110 return new
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
| nuances.rb | 28 lexer = EmptyAlt::Lexer.new( 'foo' )
29 parser = EmptyAlt::Parser.new lexer
58 lexer = Subrule::Lexer.new( 'BEGIN A END' )
59 parser = Subrule::Parser.new lexer
95 lexer = SpecialStates::Lexer.new 'foo'
96 parser = SpecialStates::Parser.new lexer
101 lexer = SpecialStates::Lexer.new 'foo name1'
102 parser = SpecialStates::Parser.new lexer
107 lexer = SpecialStates::Lexer.new 'bar name1'
108 parser = SpecialStates::Parser.new lexe
[all...] |
| /external/tcpdump/ |
| makemib | 177 # add a new object to the tree
179 # new OBJECT IDENTIFIER ::= { parent value }
182 function oidadd(new, parent, value) {
187 print "/* oidadd" inn(FILENAME) ":", new, "in", parent, "as", value, "line", $0, "*/"
189 gsub(/[-&\/]/,"",new)
194 inn(FILENAME), parent, new, value
198 if (oid[new] > 0 && oid[new] != value) {
200 inn(FILENAME), parent, new, value, oid[new]
[all...] |
| /external/v8/test/js-perf-test/Collections/ |
| weakmap.js | 6 var MapBenchmark = new BenchmarkSuite('WeakMap', [1000], [
7 new Benchmark('Set', false, false, 0, WeakMapSet, WeakMapSetupBase,
9 new Benchmark('Has', false, false, 0, WeakMapHas, WeakMapSetup,
11 new Benchmark('Get', false, false, 0, WeakMapGet, WeakMapSetup,
13 new Benchmark('Delete', false, false, 0, WeakMapDelete, WeakMapSetup,
23 wm = new WeakMap;
48 throw new Error();
53 throw new Error();
62 throw new Error();
67 throw new Error()
[all...] |
| set.js | 6 var SetSmiBenchmark = new BenchmarkSuite('Set-Smi', [1000], [
7 new Benchmark('Set', false, false, 0, SetAddSmi, SetSetupSmiBase, SetTearDown),
8 new Benchmark('Has', false, false, 0, SetHasSmi, SetSetupSmi, SetTearDown),
9 new Benchmark('Delete', false, false, 0, SetDeleteSmi, SetSetupSmi, SetTearDown),
13 var SetStringBenchmark = new BenchmarkSuite('Set-String', [1000], [
14 new Benchmark('Set', false, false, 0, SetAddString, SetSetupStringBase, SetTearDown),
15 new Benchmark('Has', false, false, 0, SetHasString, SetSetupString, SetTearDown),
16 new Benchmark('Delete', false, false, 0, SetDeleteString, SetSetupString, SetTearDown),
20 var SetObjectBenchmark = new BenchmarkSuite('Set-Object', [1000], [
21 new Benchmark('Set', false, false, 0, SetAddObject, SetSetupObjectBase, SetTearDown)
[all...] |
| /external/v8/test/mjsunit/harmony/ |
| typedarray-species.js | 23 assertEquals(MyTypedArray, new MyTypedArray().map(()=>0).constructor);
24 assertEquals(MyTypedArray, new MyTypedArray().filter(()=>{}).constructor);
25 assertEquals(MyTypedArray, new MyTypedArray().slice().constructor);
35 assertEquals(MyTypedArray, new MyOtherTypedArray().map(()=>0).constructor);
36 assertEquals(MyTypedArray, new MyOtherTypedArray().filter(()=>{}).constructor);
37 assertEquals(MyTypedArray, new MyOtherTypedArray().slice().constructor);
46 assertThrows(() => new MyShortTypedArray(5).map(()=>0), TypeError);
47 assertThrows(() => new MyShortTypedArray(5).filter(()=>true), TypeError);
48 assertThrows(() => new MyShortTypedArray(5).slice(), TypeError);
53 assertThrows(() => new MyNonTypedArray().map(()=>0), TypeError)
[all...] |
| /external/v8/test/mjsunit/es6/ |
| typedarray-copywithin.js | 21 assertEquals(new constructor([]).copyWithin.length, 2);
28 new constructor([1, 2, 3, 4, 5]).copyWithin(0, 3));
30 new constructor([1, 2, 3, 4, 5]).copyWithin(1, 3));
32 new constructor([1, 2, 3, 4, 5]).copyWithin(1, 2));
34 new constructor([1, 2, 3, 4, 5]).copyWithin(2, 2));
40 assertArrayEquals(new constructor([1, 2, 3, 4, 5]).copyWithin(0, 3, 4),
42 assertArrayEquals(new constructor([1, 2, 3, 4, 5]).copyWithin(1, 3, 4),
44 assertArrayEquals(new constructor([1, 2, 3, 4, 5]).copyWithin(1, 2, 4),
52 new constructor([1, 2, 3, 4, 5]).copyWithin(0, -2));
54 new constructor([1, 2, 3, 4, 5]).copyWithin(0, -2, -1))
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/ |
| complexityMeasures.m | 22 new=zeros(frames,functionOrder);
26 new(i,st(j,2)) = new(i,st(j,2)) + st(j,1);
32 nonzeroelements = find(new(1:end,i)>0);
36 % result(i,2)=(sum(new(nonzeroelements,i))/(length(nonzeroelements)*0.03))/1000000;
40 % result(i,3)=(max(new(1:end,i))/0.03)/1000000;
41 result(i,3)=(max(new(1:size(new,1)/2,i))/0.03)/1000000 + (max(new(size(new,1)/2+1:end,i))/0.03)/1000000
[all...] |
| /external/valgrind/tests/ |
| filter_libc | 27 s/(at.*)__builtin_new/$1...operator new.../;
28 s/(at.*)operator new\(unsigned(| int| long)\)/$1...operator new.../;
30 s/(at.*)__builtin_vec_new/$1...operator new.../;
31 s/(at.*)operator new\[\]\(unsigned(| int| long)\)/$1...operator new[].../;
|
