Method getPredecessorsRanked

src/rnabloom/util/GraphUtils.java:5569–5618

(Kmer source, BloomFilterDeBruijnGraph graph, int lookahead, float covThreshold)

    }
    
    private static LinkedList<Kmer> getPredecessorsRanked(Kmer source, BloomFilterDeBruijnGraph graph, int lookahead, float covThreshold) {
        LinkedList<Kmer> results = new LinkedList<>();
        ArrayDeque<Kmer> neighbors = source.getPredecessors(graph.getK(), graph.getMaxNumHash(), graph);
        if (neighbors.isEmpty()) {
            return results;
        }
        else if (neighbors.size() == 1) {
            results.add(neighbors.peek());
            return results;
        }
        
        LinkedList<Float> values = new LinkedList<>();
        
        ListIterator<Kmer> resultsItr;
        ListIterator<Float> valuesItr;
        
        for (Kmer n : neighbors) {
            if (n.count >= covThreshold) {
                float c = getMaxMedianCoverageLeft(graph, n, lookahead);

                if (results.isEmpty()) {
                    results.add(n);
                    values.add(c);
                }
                else {
                    resultsItr = results.listIterator();
                    valuesItr = values.listIterator();

                    float val;
                    while (valuesItr.hasNext()) {
                        resultsItr.next();
                        val = valuesItr.next();

                        if (c > val) {
                            if (valuesItr.hasPrevious()) {
                                resultsItr.previous();
                                valuesItr.previous();
                            }

                            resultsItr.add(n);
                            valuesItr.add(c);
                            break;
                        }
                    }
                }
            }
        }
        
        return results;
    }
    
    private static LinkedList<Kmer> getSuccessorsRanked(Kmer source, BloomFilterDeBruijnGraph graph, int lookahead) {
        LinkedList<Kmer> results = new LinkedList<>();