| OLD | NEW |
| 1 // Copyright (c) 2015, the Fletch project authors. Please see the AUTHORS file | 1 // Copyright (c) 2015, the Dartino 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.md file. | 3 // BSD-style license that can be found in the LICENSE.md file. |
| 4 | 4 |
| 5 part of immutable; | 5 part of immutable; |
| 6 | 6 |
| 7 // TODO(kustermann): Consider making a sentinal for an empty list instead of | 7 // TODO(kustermann): Consider making a sentinal for an empty list instead of |
| 8 // representing empty lists as `null`. | 8 // representing empty lists as `null`. |
| 9 class LinkedList<T> { | 9 class LinkedList<T> { |
| 10 final T head; | 10 final T head; |
| 11 final LinkedList<T> tail; | 11 final LinkedList<T> tail; |
| (...skipping 17 matching lines...) Expand all Loading... |
| 29 int get length { | 29 int get length { |
| 30 int count = 1; | 30 int count = 1; |
| 31 LinkedList<T> current = tail; | 31 LinkedList<T> current = tail; |
| 32 while (current != null) { | 32 while (current != null) { |
| 33 count++; | 33 count++; |
| 34 current = current.tail; | 34 current = current.tail; |
| 35 } | 35 } |
| 36 return count; | 36 return count; |
| 37 } | 37 } |
| 38 } | 38 } |
| OLD | NEW |