Interface BTreeMap<K,​V>

  • All Superinterfaces:
    java.util.Map<K,​V>
    All Known Implementing Classes:
    BTree

    public interface BTreeMap<K,​V>
    extends java.util.Map<K,​V>
    • Nested Class Summary

      • Nested classes/interfaces inherited from interface java.util.Map

        java.util.Map.Entry<K extends java.lang.Object,​V extends java.lang.Object>
    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      boolean putKey​(K key)
      This function encodes and writes the key into the data structure.
      • Methods inherited from interface java.util.Map

        clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, equals, forEach, get, getOrDefault, hashCode, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, values
    • Method Detail

      • putKey

        boolean putKey​(K key)
        This function encodes and writes the key into the data structure. This is useful for situations where the user data is already in a data store and we are just building additional indexes to it.
        Parameters:
        key - The key to add to the structure.
        Returns:
        True if the key was inserted. False if the key already existed.