| OLD | NEW |
| 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 part of dart.collection; |
| 6 |
| 5 /** | 7 /** |
| 6 * A node in a splay tree. It holds the key, the value and the left | 8 * A node in a splay tree. It holds the key, the value and the left |
| 7 * and right children in the tree. | 9 * and right children in the tree. |
| 8 */ | 10 */ |
| 9 class SplayTreeNode<K, V> { | 11 class SplayTreeNode<K, V> { |
| 10 SplayTreeNode(K this.key, V this.value); | 12 SplayTreeNode(K this.key, V this.value); |
| 11 | 13 |
| 12 K key; | 14 K key; |
| 13 V value; | 15 V value; |
| 14 SplayTreeNode<K, V> left; | 16 SplayTreeNode<K, V> left; |
| (...skipping 282 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 297 if (node.key.compareTo(key) > 0) { | 299 if (node.key.compareTo(key) > 0) { |
| 298 return visit(node.left, node.key); | 300 return visit(node.left, node.key); |
| 299 } | 301 } |
| 300 if (node.key.compareTo(key) <= 0) { | 302 if (node.key.compareTo(key) <= 0) { |
| 301 return visit(node.right, ifEmpty); | 303 return visit(node.right, ifEmpty); |
| 302 } | 304 } |
| 303 } | 305 } |
| 304 return visit(_root, null); | 306 return visit(_root, null); |
| 305 } | 307 } |
| 306 } | 308 } |
| OLD | NEW |