Commits on Nov 12, 2024

1. Avoid overhead for synthesized nodes lookup …

   After Qiskit#12550 a hash implementation was added to the implementation
   of DAGOpNode to be able to have identical instances of dag nodes used be
   usable in a set or dict. This is because after Qiskit#12550 changed the
   DAGCircuit so the DAGOpNode instances were just a python view of the
   data contained in the nodes of a dag. While prior to Qiskit#12550 the actual
   DAGOpNode objects were returned by reference from DAG methods. However,
   this hash implementation has additional overhead compared to the object
   identity based version used before. This has caused a regression in some
   cases for high level synthesis when it's checking for nodes it's already
   synthesized. This commit addresses this by changing the dict key to be
   the node id instead of the node object. The integer hashing is
   significantly faster than the object hashing.

   

   mtreinish committed Nov 12, 2024
   Configuration menu

   • View commit details
   • Copy full SHA for b20e0a7
   • Browse repository at this point

   Copy the full SHA

   b20e0a7 View commit details

   Browse the repository at this point in the history