leonardo-heap-0.3.0
- leonardo-heap 0.3.0
- Permalink
- Docs.rs crate page
- MIT/Apache-2.0
- Links
- Homepage
- Repository
- crates.io
- Source
- Owners
- bwhmather
- Dependencies
- rand ^0.3
- Versions
Platform
Feature flags

Rust

☰

Crate leonardo_heap

Structs

Crate leonardo_heap[−][src]

A binary heap structure supporting fast in-place partial sorting.

This is structure is the core of Dijkstra's Smoothsort algorithm.

Structs

Help

Keyboard Shortcuts

?: Show this help dialog
S: Focus the search field
↑: Move up in search results
↓: Move down in search results
↹: Switch tab
⏎: Go to active search result
+: Expand all sections
-: Collapse all sections

Search Tricks

Prefix searches with a type followed by a colon (e.g. fn:) to restrict the search to a given type.

Accepted types are: fn, mod, struct, enum, trait, type, macro, and const.

Search functions by type signature (e.g. vec -> usize or * -> vec)

Search multiple things at once by splitting your query with comma (e.g. str,u8 or String,struct:Vec,test)