| OLD | NEW |
|---|
| 1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, 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 test.index.b_plus_tree; | 5 library test.index.b_plus_tree; |
| 6 | 6 |
| 7 import 'dart:math'; | 7 import 'dart:math'; |
| 8 | 8 |
| 9 import 'package:analysis_server/src/index/b_plus_tree.dart'; | 9 import 'package:analysis_server/src/index/b_plus_tree.dart'; |
| 10 import 'package:unittest/unittest.dart'; | 10 import 'package:unittest/unittest.dart'; |
| (...skipping 664 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 675 | 675 |
| 676 void _insertValues(int count) { | 676 void _insertValues(int count) { |
| 677 for (int i = 0; i < count; i++) { | 677 for (int i = 0; i < count; i++) { |
| 678 _insert(i, 'V$i'); | 678 _insert(i, 'V$i'); |
| 679 } | 679 } |
| 680 } | 680 } |
| 681 } | 681 } |
| 682 | 682 |
| 683 class _TestBTree<K, V> extends BPlusTree<K, V, int> { | 683 class _TestBTree<K, V> extends BPlusTree<K, V, int> { |
| 684 _TestBTree(int maxIndexKeys, int maxLeafKeys, Comparator<K> comparator) : | 684 _TestBTree(int maxIndexKeys, int maxLeafKeys, Comparator<K> comparator) : |
| 685 super(maxIndexKeys, maxLeafKeys, comparator, new MemoryNodeManager()); | 685 super(comparator, new MemoryNodeManager(maxIndexKeys, maxLeafKeys)); |
| 686 } | 686 } |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 321953002:
FilePageManager - disk based PageManager. (Closed)
Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart