Qiskit
/
qiskit
/
11804918787
/
1
89%
main: 89%
main: 89%
|
Ran
|
Files
914
|
Run time
35s
|
Badge
Embed ▾
README BADGES
|
coverage: 88.935% (+0.01%) from 88.922%
push
github
web-flowAvoid overhead for synthesized nodes lookup (#13424) (#13425) After #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 #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 #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. (cherry picked from commit 8c6ad024c) Co-authored-by: Matthew Treinish <mtreinish@kortar.org>
79065 of 88902 relevant lines covered (88.94%)
357392.55 hits per line
