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 #library("dart:coreimpl"); | 5 #library("dart:coreimpl"); |
6 | 6 |
7 #source("../../corelib/src/implementation/dual_pivot_quicksort.dart"); | 7 #source("../../corelib/src/implementation/dual_pivot_quicksort.dart"); |
8 #source("../../corelib/src/implementation/duration_implementation.dart"); | 8 #source("../../corelib/src/implementation/duration_implementation.dart"); |
9 #source("../../corelib/src/implementation/exceptions.dart"); | 9 #source("../../corelib/src/implementation/exceptions.dart"); |
10 #source("../../corelib/src/implementation/future_implementation.dart"); | 10 #source("../../corelib/src/implementation/future_implementation.dart"); |
11 #source("../../corelib/src/implementation/hash_map_set.dart"); | 11 #source("../../corelib/src/implementation/hash_map_set.dart"); |
12 // TODO(jimhug): Re-explore tradeoffs with using builtin JS maps. | 12 // TODO(jimhug): Re-explore tradeoffs with using builtin JS maps. |
13 #source("../../corelib/src/implementation/linked_hash_map.dart"); | 13 #source("../../corelib/src/implementation/linked_hash_map.dart"); |
14 #source("../../corelib/src/implementation/maps.dart"); | 14 #source("../../corelib/src/implementation/maps.dart"); |
15 #source("../../corelib/src/implementation/options.dart"); | 15 #source("../../corelib/src/implementation/options.dart"); |
16 #source("../../corelib/src/implementation/queue.dart"); | 16 #source("../../corelib/src/implementation/queue.dart"); |
17 #source("../../corelib/src/implementation/stopwatch_implementation.dart"); | 17 #source("../../corelib/src/implementation/stopwatch_implementation.dart"); |
18 #source("../../corelib/src/implementation/splay_tree.dart"); | 18 #source("../../corelib/src/implementation/splay_tree.dart"); |
19 | 19 |
20 #source("string_buffer.dart"); | 20 #source("string_buffer.dart"); |
21 #source("string_base.dart"); | 21 #source("string_base.dart"); |
22 #source("string_implementation.dart"); | 22 #source("string_implementation.dart"); |
23 #source("arrays.dart"); | 23 #source("arrays.dart"); |
24 #source("collections.dart"); | 24 #source("collections.dart"); |
25 #source("date_implementation.dart"); | 25 #source("date_implementation.dart"); |
26 | 26 |
27 #source("isolate.dart"); | |
28 #source("isolate_serialization.dart"); | |
29 | |
30 #source("function_implementation.dart"); | 27 #source("function_implementation.dart"); |
31 | 28 |
32 /** | 29 /** |
33 * The default implementation of the [List<E>] interface. Essentially a growable | 30 * The default implementation of the [List<E>] interface. Essentially a growable |
34 * array that will expand automatically as more elements are added. | 31 * array that will expand automatically as more elements are added. |
35 */ | 32 */ |
36 class ListFactory<E> implements List<E> native "Array" { | 33 class ListFactory<E> implements List<E> native "Array" { |
37 ListFactory([int length]) native; | 34 ListFactory([int length]) native; |
38 | 35 |
39 // TODO(jmesserly): type parameters aren't working here | 36 // TODO(jmesserly): type parameters aren't working here |
(...skipping 483 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
523 } else if (isNaN()) { | 520 } else if (isNaN()) { |
524 if (other.isNaN()) { | 521 if (other.isNaN()) { |
525 return 0; | 522 return 0; |
526 } | 523 } |
527 return 1; | 524 return 1; |
528 } else { | 525 } else { |
529 return -1; | 526 return -1; |
530 } | 527 } |
531 } | 528 } |
532 } | 529 } |
OLD | NEW |