| OLD | NEW |
| 1 library dromaeo; | 1 library dromaeo; |
| 2 import 'dart:async'; | 2 import 'dart:async'; |
| 3 import 'dart:html'; | 3 import 'dart:html'; |
| 4 import 'dart:json' as json; | 4 import 'dart:json' as json; |
| 5 import '../common/common.dart'; | 5 import '../common/common.dart'; |
| 6 import 'dart:math' as Math; | 6 import 'dart:math' as Math; |
| 7 part 'Common.dart'; | 7 part 'Common.dart'; |
| 8 part 'RunnerSuite.dart'; | 8 part 'RunnerSuite.dart'; |
| 9 | 9 |
| 10 | 10 |
| (...skipping 23 matching lines...) Expand all Loading... |
| 34 document.body.append(div); | 34 document.body.append(div); |
| 35 }) | 35 }) |
| 36 .test('firstChild', () { | 36 .test('firstChild', () { |
| 37 final nodes = document.body.$dom_childNodes; | 37 final nodes = document.body.$dom_childNodes; |
| 38 final nl = nodes.length; | 38 final nl = nodes.length; |
| 39 | 39 |
| 40 for (int i = 0; i < num; i++) { | 40 for (int i = 0; i < num; i++) { |
| 41 for (int j = 0; j < nl; j++) { | 41 for (int j = 0; j < nl; j++) { |
| 42 Node cur = nodes[j]; | 42 Node cur = nodes[j]; |
| 43 while (cur != null) { | 43 while (cur != null) { |
| 44 cur = cur.$dom_firstChild; | 44 cur = cur.firstChild; |
| 45 } | 45 } |
| 46 ret = cur; | 46 ret = cur; |
| 47 } | 47 } |
| 48 } | 48 } |
| 49 }) | 49 }) |
| 50 .test('lastChild', () { | 50 .test('lastChild', () { |
| 51 final nodes = document.body.$dom_childNodes; | 51 final nodes = document.body.$dom_childNodes; |
| 52 final nl = nodes.length; | 52 final nl = nodes.length; |
| 53 | 53 |
| 54 for (int i = 0; i < num; i++) { | 54 for (int i = 0; i < num; i++) { |
| 55 for (int j = 0; j < nl; j++) { | 55 for (int j = 0; j < nl; j++) { |
| 56 Node cur = nodes[j]; | 56 Node cur = nodes[j]; |
| 57 while (cur != null) { | 57 while (cur != null) { |
| 58 cur = cur.$dom_lastChild; | 58 cur = cur.lastChild; |
| 59 } | 59 } |
| 60 ret = cur; | 60 ret = cur; |
| 61 } | 61 } |
| 62 } | 62 } |
| 63 }) | 63 }) |
| 64 .test('nextSibling', () { | 64 .test('nextSibling', () { |
| 65 for (int i = 0; i < num * 2; i++) { | 65 for (int i = 0; i < num * 2; i++) { |
| 66 Node cur = document.body.$dom_firstChild; | 66 Node cur = document.body.firstChild; |
| 67 while (cur != null) { | 67 while (cur != null) { |
| 68 cur = cur.nextNode; | 68 cur = cur.nextNode; |
| 69 } | 69 } |
| 70 ret = cur; | 70 ret = cur; |
| 71 } | 71 } |
| 72 }) | 72 }) |
| 73 .test('previousSibling', () { | 73 .test('previousSibling', () { |
| 74 for (int i = 0; i < num * 2; i++) { | 74 for (int i = 0; i < num * 2; i++) { |
| 75 Node cur = document.body.$dom_lastChild; | 75 Node cur = document.body.lastChild; |
| 76 while (cur != null) { | 76 while (cur != null) { |
| 77 cur = cur.previousNode; | 77 cur = cur.previousNode; |
| 78 } | 78 } |
| 79 ret = cur; | 79 ret = cur; |
| 80 } | 80 } |
| 81 }) | 81 }) |
| 82 .test('childNodes', () { | 82 .test('childNodes', () { |
| 83 for (int i = 0; i < num; i++) { | 83 for (int i = 0; i < num; i++) { |
| 84 final nodes = document.body.$dom_childNodes; | 84 final nodes = document.body.$dom_childNodes; |
| 85 for (int j = 0; j < nodes.length; j++) { | 85 for (int j = 0; j < nodes.length; j++) { |
| 86 ret = nodes[j]; | 86 ret = nodes[j]; |
| 87 } | 87 } |
| 88 } | 88 } |
| 89 }) | 89 }) |
| 90 .end(); | 90 .end(); |
| 91 } | 91 } |
| OLD | NEW |