-
Emanuele Giuseppe Esposito authored
Minor performance improvement, but given that we have hash tables available, avoid iterating in the visited nodes list every time just to check if a node has been already visited. The data structure is not actually a proper hash map, but an hash set, as we are just adding nodes and not key,value pairs. Suggested-by:
Hanna Reitz <hreitz@redhat.com>
Signed-off-by:
Emanuele Giuseppe Esposito <eesposit@redhat.com>
Reviewed-by:
Kevin Wolf <kwolf@redhat.com>
Message-Id: <20221025084952.2139888-4-eesposit@redhat.com>
Signed-off-by:
Kevin Wolf <kwolf@redhat.com>Emanuele Giuseppe Esposito authoredMinor performance improvement, but given that we have hash tables available, avoid iterating in the visited nodes list every time just to check if a node has been already visited. The data structure is not actually a proper hash map, but an hash set, as we are just adding nodes and not key,value pairs. Suggested-by:
Hanna Reitz <hreitz@redhat.com>
Signed-off-by:
Emanuele Giuseppe Esposito <eesposit@redhat.com>
Reviewed-by:
Kevin Wolf <kwolf@redhat.com>
Message-Id: <20221025084952.2139888-4-eesposit@redhat.com>
Signed-off-by:
Kevin Wolf <kwolf@redhat.com>
Loading