A  
add [Register] 

add_color [Coloring] 

add_interference [Inter_graph]  add an interference edge between two register 
add_preference [Inter_graph]  add a preference edge between two register 
add_reg [Inter_graph]  add a register as a node of the graph 
add_spill [Coloring] 

C  
choose [Inter_graph] 

choose [Register]  Return one element of the given set, or raise 
copy_color [Coloring] 

D  
degree [Inter_graph]  
E  
empty [Inter_graph]  
empty [Coloring]  empty coloring 
empty [Register]  The empty set. 
F  
find [Coloring] 

find_preference [Inter_graph] 

find_register [Inter_graph] 

fold [Register] 

from_int [Register]  
from_string [Register]  
I  
is_empty [Inter_graph]  
is_empty [Register]  Test whether a set is empty or not. 
is_real [Register] 

iter [Register] 

J  
join [Register] 

join_nodes [Inter_graph] 

N  
nb_regs [Register]  number of available real registers 
neighbour [Inter_graph] 

neighbours [Inter_graph] 

P  
prefer_out [Inter_graph] 

print_coloring [Coloring]  
print_dec [Coloring]  
print_graph [Inter_graph]  opens a Firefox window with a graphical representation of the graph 
print_graph_coloring [Inter_graph]  same as 
print_reg [Register]  printing function for registers 
print_riscv [Riscv]  printing function for a RISCV instruction 
R  
real [Register] 

real_regs [Register] 

remove [Register] 

remove_preferences [Inter_graph]  remove all preference edges comming out a register 
remove_reg [Inter_graph]  remove a register of the graph, removing all edges comming out this register 
S  
s [Riscv_parser]  
scan [Riscv_lexer]  
set_nb_regs [Register]  set the number of real registers that can be allocated 
sp [Register]  MIPS register 
T  
temp0 [Register]  reserved register to handle spilled pseudoregisters 
temp1 [Register]  reserved register to handle spilled pseudoregisters 
to_color [Register]  
to_dot [Register]  
to_string [Register] 