A NodeManager implementation with encoding/decoding keys/values into pages.

pkg/analysis_server/lib/src/index/b_plus_tree.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 index.b_plus_tree;
 
 import 'dart:collection';
 
 
 /**
@@ skipping 214 matching lines @@
   IndexNodeData<K, int> readIndex(int id) {
     return _indexDataMap[id];
   }
 
   @override
   LeafNodeData<K, V> readLeaf(int id) {
     return _leafDataMap[id];
   }
 
   @override
-  void writeIndex(int id, IndexNodeData<K, V> data) {
+  void writeIndex(int id, IndexNodeData<K, int> data) {
     _indexDataMap[id] = data;
   }
 
   @override
   void writeLeaf(int id, LeafNodeData<K, V> data) {
     _leafDataMap[id] = data;
   }
 }
 
 
@@ skipping 27 matching lines @@
   IndexNodeData<K, N> readIndex(N id);
 
   /**
    * Reads information about the leaf node with the given identifier.
    */
   LeafNodeData<K, V> readLeaf(N id);
 
   /**
    * Writes information about the index node with the given identifier.
    */
-  void writeIndex(N id, IndexNodeData<K, V> data);
+  void writeIndex(N id, IndexNodeData<K, N> data);
 
   /**
    * Writes information about the leaf node with the given identifier.
    */
   void writeLeaf(N id, LeafNodeData<K, V> data);
 }
 
 
 /**
  * An index node with keys and children references.
@@ skipping 439 matching lines @@
 
 /**
  * A container with information about split during insert.
  */
 class _Split<K, N> {
   final K key;
   final N left;
   final N right;
   _Split(this.key, this.left, this.right);
 }