Skip to content
Open-Source Registry

cargo / priority-queue-rs

priority-queue-rs 0.1.26

processes
154
operations
1.5K
packages
5
compiler runs
1
connections
0
job time
3s
capture
44 KB
records
3.5K
bytes / record
12.5

Priority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by key value so that item with the lowest value of key is at front and item with the highest value of key is at rear or vice versa. So we're assigned priority to item based on its key value. Lower the value, higher the priority. Following are the principal methods of a Priority Queue.

clean

Build behaviourcompiled and nothing more

28,615 downloads · MIT · published 2021-05-30 · source · home page · cargo

collection priority priority-queue queue sorted

Release 0.1.26 run f9e050cf-37fb-43ef-872e-cbceb453c4c1 · built 2026-10-08

Artifact

file · retained · product
1
ChecksDetections
Build behavior
✓ Network activity—
○ Sensitive data access and transfer—
✓ Cross-process access—
✓ Build file changes—
✓ Data flow analysis—
✓ Filesystem writes—
✓ Context collection—
Supply chain
✓ Known vulnerabilities—
✓ Dependency advisories—
✓ Declared and observed dependencies—
✓ Dependency and toolchain versions—
Pipeline
✓ Pipeline coverage—

Detections

0

No detections

No abnormal activity detected across 1.5K flows.

Raw data

capture
44 KB
records
3,549
bytes per record
12.5

Loading a sample of the capture

Want to see more? E-mail us at hello@bitbison.io about your use case.

Dependencies

5 packages, 0 with a build script that ran, 0 doing more than compiling
PackageVersionUsageBuild behaviour
ld-linux-x86-64.so.2linkedsystem library
libc.so.6linkedsystem library
libgcc_s.so.1linkedsystem library
libm.so.6linkedsystem library
libmvec.so.1linkedsystem library

1 of 1 jobs captured: build-test success · Generated 2026-10-08 · tarp 0.1.0+20261008010522-g7d82935f3902 · run f9e050cf-37fb-43ef-872e-cbceb453c4c1