← Back tabelaHash.py | tabelaHash.py.TabelaHashSondagemLinear.chaves -- 8
Source 
def chaves(self):
    """
        Devolve uma lista com todas as chaves presentes na tabela.
        """
    resultado = []
    for entrada in self.tabela:
        if entrada is not None and entrada is not REMOVIDO:
            resultado.append(entrada[0])
    return resultado
CFG
Zoom + Zoom - Reset
0 0 BB Expr (+1) 1 1 FOR_PRE For (+0) 0->1 2 2 FOR_ITER For (+0) 1->2 for:iter 3 3 IF If (+0) 2->3 Next 4 4 FOR_AFTER Return (+0) 2->4 Not_Next 9 9 COND entrada is not None 3->9 cond 5 5 THEN Expr (+0) 5->2 next 5->4 No_Next 8 8 COND entrada is not REMOVIDO 8->2 next 8->4 No_Next 8->5 T 9->2 next 9->4 No_Next 9->8 T
Blocks
Covered: 0, 1, 2, 3, 4, 5, 8, 9
Missed: —
Edges
Covered: (0, 1), (1, 2), (2, 3), (8, 5), (9, 8), (3, 9), (2, 4), (5, 2), (5, 4), (8, 2), (8, 4), (9, 2), (9, 4)
Missed: —
Essential arcs
Covered: (2, 4), (5, 2), (5, 4), (8, 2), (8, 4), (9, 2), (9, 4)
Missed: —
Edge Pairs
Covered: (0, 1, 2), (1, 2, 3), (1, 2, 4), (2, 3, 9), (3, 9, 2), (3, 9, 4), (3, 9, 8), (5, 2, 3), (8, 2, 3), (8, 5, 2), (8, 5, 4), (9, 2, 3), (9, 8, 2), (9, 8, 4), (9, 8, 5)
Missed: —
Prime Paths
Covered: (0, 1, 2, 3, 9), (0, 1, 2, 3, 9, 8), (0, 1, 2, 3, 9, 8, 5), (0, 1, 2, 4), (2, 3, 9, 2), (2, 3, 9, 8, 2), (2, 3, 9, 8, 5, 2), (3, 9, 2, 3), (3, 9, 4), (3, 9, 8, 2, 3), (3, 9, 8, 4), (3, 9, 8, 5, 2, 3), (3, 9, 8, 5, 4), (5, 2, 3, 9, 8, 5), (8, 2, 3, 9, 8), (8, 5, 2, 3, 9, 8), (9, 2, 3, 9), (9, 8, 2, 3, 9), (9, 8, 5, 2, 3, 9)
Missed: —