1
95%
main: 95%

Ran 15 Jun 2026 03:57PM UTC

Files 118

Run time 6s

Badge

Embed ▾

Committed 15 Jun 2026 03:43PM UTC coverage: 94.726%. Remained the same

Job # 27558083354.1

Build Type

push

github

Committed by

web-flow

Commit Message

Avoid inner-loop allocations in `longest_path` (#1577)

The only use of the per-node `Vec` is to consume it immediately into a
`max_by` iterator.  Rewriting the allocating loop as a single `try_fold`
removes the unnecessary allocation.

On a test 1.6 million gate circuit over on Qiskit, this sped up our use
of `longest_path` from 150ms to 100ms, and there's further follow-on
improvements available by changing the interfaces to allow path-length
calculation without constructing the path itself.

Coverage Stats

19146 of 20212 relevant lines covered (94.73%)

923803.1 hits per line

Qiskit / rustworkx / 27558083354 / 1
95%
main: 95%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 27558083354.1

Qiskit / rustworkx / 27558083354 / 1 95% main: 95%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 27558083354.1

Qiskit / rustworkx / 27558083354 / 1
95%
main: 95%

README BADGES
x