src/main/java/de/dfki/lt/loot/jada/IntTrie.java
public IntTrie<T> extend(int val) {
    if (_subs == null)
      return null;
    IntTrie<T> toFind = new IntTrie<T>(val);
    int pos = Collections.binarySearch(_subs, toFind);
    return pos < 0 ? null : _subs.get(pos);
  }
/** try to find a continuation of the current node */
try to find a continuation of the current node
try to find a continuation of the current node
public IntTrie<T> extend(int val) {
    if (_subs == null)
      return null;
    IntTrie<T> toFind = new IntTrie<T>(val);
    int pos = Collections.binarySearch(_subs, toFind);
    return pos < 0 ? null : _subs.get(pos);
  }
public IntTrie < T > extend ( int val ) { if ( _subs == null ) return null ; IntTrie < T > toFind = new IntTrie < T > ( val ) ; int pos = Collections . binarySearch ( _subs , toFind ) ; return pos < 0 ? null : _subs . get ( pos ) ; }
try to find a continuation of the current node
try to find a continuation of the current node