Class KeyList<E>


public class KeyList<E> extends Object
A class to handle multiple-key order preserving lookup tables. Use KeySet for a faster but non-order preserving map.
  • Field Details

  • Constructor Details

  • Method Details

    • add

      public void add(String[] keys, Range range, E value)
    • size

      public int size()
    • sort

      public void sort()
    • clear

      public void clear()
    • searchIndex

      public BitSet searchIndex(String[] keys)
    • getValue

      public E getValue(String[] keys, Range range, int type)
      Return the value associated with the first matched key
    • getIndex

      public int getIndex(String[] keys, Range range, int type)
    • matchKey

      public boolean matchKey(String[] keys, Range range, int test, int i)
      Test if a record matches a key
    • keyCompare

      public boolean keyCompare(String[] keys, String[] ikeys)
    • keyCompareExact

      public static boolean keyCompareExact(String[] keys, String[] ikeys)
    • keyCompareValues

      public static boolean keyCompareValues(String[] keys, String[] ikeys)
    • keyCompareAll

      public boolean keyCompareAll(String[] keys, String[] ikeys)
    • removeElementAt

      public void removeElementAt(int i)
    • getValue

      public E getValue(int i)
    • setValue

      public void setValue(int i, E value)
    • getRange

      public Range getRange(int i)
    • setKeys

      public void setKeys(int i, String[] keys)
    • getKeys

      public String[] getKeys(int i)
    • getMatches

      public Iterator<E> getMatches(String[] keys, Range range, int type)
    • toString

      public static String toString(String[] keys)
    • toString

      public static String toString(String[] keys, String sep)
    • replace

      public static String[] replace(String[] cKeys, String[] pattern)
    • list

      public void list()
    • filter

      public KeyList<E> filter(String[] keys)
      Filter the list and return an order sublist that matches the input keys