FilePageManager - disk based PageManager.

pkg/analysis_server/test/index/page_node_manager_test.dart

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 library test.index.page_node_manager;
 
 import 'dart:math';
 import 'dart:typed_data';
 
 import 'package:analysis_server/src/index/b_plus_tree.dart';
@@ skipping 26 matching lines @@
 
 /**
  * A stress test for [BPlusTree] using [PageNodeManager].
  */
 _treeWithPageNodeManager() {
   int pageSize = 256;
   MemoryPageManager pageManager = new MemoryPageManager(pageSize);
   NodeManager<int, String, int> nodeManager = new PageNodeManager<int, String>(
       pageManager, Uint32Codec.INSTANCE, new FixedStringCodec(7));
 //  NodeManager<int, String, int> nodeManager = new MemoryNodeManager();
-  int maxIndexKeys = (pageSize - 64) ~/ (4 + 4);
-  int maxLeafKeys = (pageSize - 64) ~/ (4 + (2 + 2 * 7));
-  print('maxIndexKeys: $maxIndexKeys   maxLeafKeys: $maxLeafKeys');
-  BPlusTree<int, String, int> tree = new BPlusTree(maxIndexKeys, maxLeafKeys,
-      _intComparator, nodeManager);
+  print('maxIndexKeys: ${nodeManager.maxIndexKeys}   '
+      'maxLeafKeys: ${nodeManager.maxLeafKeys}');
+  BPlusTree<int, String, int> tree = new BPlusTree(_intComparator, nodeManager);
   int maxKey = 1000000;
   int tryCount = 1000;
   Set<int> keys = new Set<int>();
   {
     Random random = new Random();
     for (int i = 0; i < tryCount; i++) {
       int key = random.nextInt(maxKey);
       keys.add(key);
       tree.insert(key, 'V$key');
     }
@@ skipping 208 matching lines @@
   }
 
   test_all() {
     // encode
     codec.encode(buffer, 42);
     expect(bytes, [0, 0, 0, 42]);
     // decode
     expect(codec.decode(buffer), 42);
   }
 }