code: private boolean findInList(int[] address, int index, FilterCell cell, int endIndex) {
          if (cell.getWildcardCell() != null) {
              // first look at wildcard slot
              if (index == endIndex) {
                  // at the end, so we found a match, unwind returning true
                  return true;
              }
  
              // go to next level of this tree path
              FilterCell newcell = cell.getWildcardCell();
  
              // recursively search this path
              if (findInList(address, index + 1, newcell, endIndex)) {
                  return true;
              }
              // the wildcard path didn't work, so see if there is a non-wildcard path
              FilterCell nextCell = cell.findNextCell(address[index]);
              if (nextCell != null) {
                  // see if we are at the end of a valid path
                  if (index == endIndex) {
                      // this path found a match, unwind returning true
                      return true;
                  }
                  // ok so far, recursively search this path
                  return findInList(address, index + 1, nextCell, endIndex);
              }
              // this path did not find a match.
              return false;
          }
          // no wildcard here, try the non-wildcard path
          FilterCell nextCell = cell.findNextCell(address[index]);
          if (nextCell != null) {
              if (index == endIndex) {
                  // this path found a match, unwind returning true
                  return true;
              }
              // ok so far, recursively search this path
              return findInList(address, index + 1, nextCell, endIndex);
          }
          // this path did not find a match.
          return false;
      }
docs: Determine, recursively, if an address, represented by an integer array, is
  in the address tree
  
  @param address
  integer array representing the address, leftmost number
  in the address should start at array offset 0. IPv4 address should
  be
  padded LEFT with zeroes.
  @param index
  the next index in the address array of the number to match against
  the tree.
  @param cell
  the current cell in the tree that we are matching against
  @param endIndex
  the last index in the address array that we need to match
  @return true if this address is found in the address tree, false if
  it is not.