| Index: samples/third_party/dromaeo/tests/dom-traverse-html.dart
|
| diff --git a/samples/third_party/dromaeo/tests/dom-traverse-html.dart b/samples/third_party/dromaeo/tests/dom-traverse-html.dart
|
| index 916aa0ae78319ce910cc30d47187473ade86015c..c9d32a3134b914c9d5bb9cae84a57a5659c489d1 100644
|
| --- a/samples/third_party/dromaeo/tests/dom-traverse-html.dart
|
| +++ b/samples/third_party/dromaeo/tests/dom-traverse-html.dart
|
| @@ -38,7 +38,7 @@ void main() {
|
| for (int i = 0; i < num; i++) {
|
| for (int j = 0; j < nl; j++) {
|
| Node cur = nodes[j];
|
| - while (cur !== null) {
|
| + while (cur != null) {
|
| cur = cur.$dom_firstChild;
|
| }
|
| ret = cur;
|
| @@ -52,7 +52,7 @@ void main() {
|
| for (int i = 0; i < num; i++) {
|
| for (int j = 0; j < nl; j++) {
|
| Node cur = nodes[j];
|
| - while (cur !== null) {
|
| + while (cur != null) {
|
| cur = cur.$dom_lastChild;
|
| }
|
| ret = cur;
|
| @@ -62,7 +62,7 @@ void main() {
|
| .test('nextSibling', () {
|
| for (int i = 0; i < num * 2; i++) {
|
| Node cur = document.body.$dom_firstChild;
|
| - while (cur !== null) {
|
| + while (cur != null) {
|
| cur = cur.nextNode;
|
| }
|
| ret = cur;
|
| @@ -71,7 +71,7 @@ void main() {
|
| .test('previousSibling', () {
|
| for (int i = 0; i < num * 2; i++) {
|
| Node cur = document.body.$dom_lastChild;
|
| - while (cur !== null) {
|
| + while (cur != null) {
|
| cur = cur.previousNode;
|
| }
|
| ret = cur;
|
|
|