docs: private boolean findInList(int[] hashcodes, int[] lengths, FilterCellFastStr cell, int index) {
  
          if (cell.getWildcardCell() != null) {
              // a wildcard, match found
              return true;
          }
          // no wildcard so far, see if there is a still a path
          FilterCellFastStr nextCell = cell.findNextCellWithLength(hashcodes[index], lengths[index]);
          if (nextCell != null) {
              // see if we are at the end of a valid path
              if (index == 0) {
                  // this path found a match, unwind returning true
                  return true;
              }
              // ok so far, recursively search this path
              return findInList(hashcodes, lengths, nextCell, index - 1);
          }
          // this path did not find a match.
          return false;
      }