src/main/java/de/dfki/lt/loot/jada/IntTrie.java
private IntTrie<T> find(int id) {
    if (_subs != null) {
      for (IntTrie<T> sub : _subs) if (sub._value == id) return sub;
    }
    return null;
  }
/** returns a sibling Trie node that has id as _value, if one exists, null
   *  otherwise.
   *
   *  TODO: Seeking is linear, might need improvement
   */
returns a sibling Trie node that has id as _value, if one exists, null
otherwise.

Seeking is linear, might need improvement
returns a sibling Trie node that has id as _value if one exists null otherwise . Seeking is linear might need improvement
private IntTrie<T> find(int id) {
    if (_subs != null) {
      for (IntTrie<T> sub : _subs) if (sub._value == id) return sub;
    }
    return null;
  }
private IntTrie < T > find ( int id ) { if ( _subs != null ) { for ( IntTrie < T > sub : _subs ) if ( sub . _value == id ) return sub ; } return null ; }
returns a sibling Trie node that has id as _value, if one exists, null
  otherwise.
returns a sibling Trie node that has id as _value if one exists null otherwise .