Node cache, binary search.

pkg/analysis_server/test/index/file_page_manager_test.dart

Index: pkg/analysis_server/test/index/file_page_manager_test.dart
diff --git a/pkg/analysis_server/test/index/file_page_manager_test.dart b/pkg/analysis_server/test/index/file_page_manager_test.dart
index c86a0b2314415457432e497ee9e4fd13f05a28a3..1e72c8dc650bcc1e86a8c40d0088aa09de662c8a 100644
--- a/pkg/analysis_server/test/index/file_page_manager_test.dart
+++ b/pkg/analysis_server/test/index/file_page_manager_test.dart
@@ -31,7 +31,7 @@ int _intComparator(int a, int b) => a - b;
 @ReflectiveTestCase()
 class _FilePageManagerTest {
   FilePageManager manager;
-  int pageSize = 256;
+  int pageSize = 1024;
   Directory tempDir;
 
   void setUp() {
@@ -62,10 +62,10 @@ class _FilePageManagerTest {
   void test_btree_stress_random() {
     NodeManager<int, String, int> nodeManager = new PageNodeManager<int,
         String>(manager, Uint32Codec.INSTANCE, new FixedStringCodec(7));
-    print('maxIndexKeys: ${nodeManager.maxIndexKeys}   '
-        'maxLeafKeys: ${nodeManager.maxLeafKeys}');
+    nodeManager = new CachingNodeManager(nodeManager, 32, 32);
     BPlusTree<int, String, int> tree = new BPlusTree(_intComparator,
         nodeManager);
+    // insert
     int maxKey = 1000000;
     int tryCount = 1000;
     Set<int> keys = new Set<int>();