| OLD | NEW |
| 1 // Copyright (c) 2015, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2015, 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_style.src.line_splitting.solve_state_queue; | 5 library dart_style.src.line_splitting.solve_state_queue; |
| 6 | 6 |
| 7 import 'line_splitter.dart'; | 7 import 'line_splitter.dart'; |
| 8 import 'solve_state.dart'; | 8 import 'solve_state.dart'; |
| 9 | 9 |
| 10 /// A priority queue of [SolveStates] to consider while line splitting. | 10 /// A priority queue of [SolveStates] to consider while line splitting. |
| (...skipping 228 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 239 | 239 |
| 240 if (comparison > 0) { | 240 if (comparison > 0) { |
| 241 _queue[index] = child; | 241 _queue[index] = child; |
| 242 index = leftChildIndex; | 242 index = leftChildIndex; |
| 243 } | 243 } |
| 244 } | 244 } |
| 245 | 245 |
| 246 _queue[index] = element; | 246 _queue[index] = element; |
| 247 } | 247 } |
| 248 } | 248 } |
| OLD | NEW |