Interface MapRadixTree<T>

  • All Superinterfaces:
    java.util.Map<java.lang.String,​T>, RadixTree<T>
    All Known Implementing Classes:
    RadixTreeImpl

    public interface MapRadixTree<T>
    extends RadixTree<T>, java.util.Map<java.lang.String,​T>
    A radix tree that implements the Map interface.
    Author:
    stm
    • 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
      java.util.Map<java.lang.String,​T> searchPrefixMap​(java.lang.String key, int recordLimit)
      Returns a map containing all entries whose keys are have the specified key as a prefix.
      • 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

      • searchPrefixMap

        java.util.Map<java.lang.String,​T> searchPrefixMap​(java.lang.String key,
                                                                int recordLimit)
        Returns a map containing all entries whose keys are have the specified key as a prefix. The returned result is not backed by this maps. Changes made to it are independent of this map.
        Parameters:
        key -
        recordLimit - The limit for the results. The result map contains at most this many entries.