Method hasDepthLeft

src/rnabloom/graph/Kmer.java:447–486

(int k, int numHash, BloomFilterDeBruijnGraph graph, int depth)

    }
    
    public boolean hasDepthLeft(int k, int numHash, BloomFilterDeBruijnGraph graph, int depth) {
        ArrayDeque<PredecessorsNTHashIterator> stack = new ArrayDeque<>(depth);
        PredecessorsNTHashIterator itr = new PredecessorsNTHashIterator(k, numHash);
        
        itr.start(fHashVal, bytes[k-1]);
        stack.add(itr);
        
        byte[] extension = new byte[depth];
        int extensionLength = 1;
        while (extensionLength > 0) {
            if (extensionLength >= depth) {
                return true;
            }
            
            itr = stack.getLast();
            
            if (itr.hasNext()) {
                itr.next();
                extension[extensionLength-1] = itr.currentChar();
                
                PredecessorsNTHashIterator nextItr = new PredecessorsNTHashIterator(k, numHash);
                
                if (extensionLength < k) {
                    nextItr.start(itr.hVals[0], bytes[k-1-extensionLength]);
                }
                else {
                    nextItr.start(itr.hVals[0], extension[extensionLength-k]);
                }
                
                stack.addLast(nextItr);
                ++extensionLength;
            }
            else {
                stack.pollLast();
                --extensionLength;
            }
        }
        
        return false;
    }
}