mirror of
https://github.com/rtic-rs/rtic.git
synced 2025-12-21 23:35:22 +01:00
7 lines
No EOL
5.8 KiB
HTML
7 lines
No EOL
5.8 KiB
HTML
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="A priority queue implemented with a binary heap."><title>heapless::binary_heap - Rust</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-6b053e98.ttf.woff2,FiraSans-Italic-81dc35de.woff2,FiraSans-Regular-0fe48ade.woff2,FiraSans-MediumItalic-ccf7e434.woff2,FiraSans-Medium-e1aa3f0a.woff2,SourceCodePro-Regular-8badfe75.ttf.woff2,SourceCodePro-Semibold-aa29a496.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2"href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-9960930a.css"><link rel="stylesheet" href="../../static.files/rustdoc-e56847b5.css"><meta name="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="heapless" data-themes="" data-resource-suffix="" data-rustdoc-version="1.91.1 (ed61e7d7e 2025-11-07)" data-channel="1.91.1" data-search-js="search-e256b49e.js" data-stringdex-js="stringdex-c3e638e9.js" data-settings-js="settings-c38705f0.js" ><script src="../../static.files/storage-e2aeef58.js"></script><script defer src="../sidebar-items.js"></script><script defer src="../../static.files/main-6dc2a7f3.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-263c88ec.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-eab170b8.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-044be391.svg"></head><body class="rustdoc mod"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><rustdoc-topbar><h2><a href="#">Module binary_heap</a></h2></rustdoc-topbar><nav class="sidebar"><div class="sidebar-crate"><h2><a href="../../heapless/index.html">heapless</a><span class="version">0.9.2</span></h2></div><div class="sidebar-elems"><section id="rustdoc-toc"><h2 class="location"><a href="#">Module binary_<wbr>heap</a></h2><h3><a href="#structs">Module Items</a></h3><ul class="block"><li><a href="#structs" title="Structs">Structs</a></li><li><a href="#enums" title="Enums">Enums</a></li><li><a href="#traits" title="Traits">Traits</a></li><li><a href="#types" title="Type Aliases">Type Aliases</a></li></ul></section><div id="rustdoc-modnav"><h2 class="in-crate"><a href="../index.html">In crate heapless</a></h2></div></div></nav><div class="sidebar-resizer" title="Drag to resize sidebar"></div><main><div class="width-limiter"><section id="main-content" class="content"><div class="main-heading"><div class="rustdoc-breadcrumbs"><a href="../index.html">heapless</a></div><h1>Module <span>binary_<wbr>heap</span> <button id="copy-path" title="Copy item path to clipboard">Copy item path</button></h1><rustdoc-toolbar></rustdoc-toolbar><span class="sub-heading"><a class="src" href="../../src/heapless/binary_heap.rs.html#1-919">Source</a> </span></div><details class="toggle top-doc" open><summary class="hideme"><span>Expand description</span></summary><div class="docblock"><p>A priority queue implemented with a binary heap.</p>
|
|
<p>Insertion and popping the largest element have <em>O</em>(log n) time complexity.
|
|
Checking the smallest/largest element is <em>O</em>(1).</p>
|
|
</div></details><h2 id="structs" class="section-header">Structs<a href="#structs" class="anchor">§</a></h2><dl class="item-table"><dt><a class="struct" href="struct.BinaryHeapInner.html" title="struct heapless::binary_heap::BinaryHeapInner">Binary<wbr>Heap<wbr>Inner</a></dt><dd>Base struct for <a href="type.BinaryHeap.html" title="type heapless::binary_heap::BinaryHeap"><code>BinaryHeap</code></a> and <a href="type.BinaryHeapView.html" title="type heapless::binary_heap::BinaryHeapView"><code>BinaryHeapView</code></a>, generic over the <a href="../vec/trait.VecStorage.html" title="trait heapless::vec::VecStorage"><code>VecStorage</code></a>.</dd><dt><a class="struct" href="struct.PeekMutInner.html" title="struct heapless::binary_heap::PeekMutInner">Peek<wbr>MutInner</a></dt><dd>Structure wrapping a mutable reference to the greatest item on a
|
|
<code>BinaryHeap</code>.</dd></dl><h2 id="enums" class="section-header">Enums<a href="#enums" class="anchor">§</a></h2><dl class="item-table"><dt><a class="enum" href="enum.Max.html" title="enum heapless::binary_heap::Max">Max</a></dt><dd>Max-heap</dd><dt><a class="enum" href="enum.Min.html" title="enum heapless::binary_heap::Min">Min</a></dt><dd>Min-heap</dd></dl><h2 id="traits" class="section-header">Traits<a href="#traits" class="anchor">§</a></h2><dl class="item-table"><dt><a class="trait" href="trait.Kind.html" title="trait heapless::binary_heap::Kind">Kind</a></dt><dd>The binary heap kind: min-heap or max-heap</dd></dl><h2 id="types" class="section-header">Type Aliases<a href="#types" class="anchor">§</a></h2><dl class="item-table"><dt><a class="type" href="type.BinaryHeap.html" title="type heapless::binary_heap::BinaryHeap">Binary<wbr>Heap</a></dt><dd>A priority queue implemented with a binary heap.</dd><dt><a class="type" href="type.BinaryHeapView.html" title="type heapless::binary_heap::BinaryHeapView">Binary<wbr>Heap<wbr>View</a></dt><dd>A priority queue implemented with a binary heap.</dd><dt><a class="type" href="type.PeekMut.html" title="type heapless::binary_heap::PeekMut">PeekMut</a></dt><dd>Structure wrapping a mutable reference to the greatest item on a
|
|
<code>BinaryHeap</code>.</dd><dt><a class="type" href="type.PeekMutView.html" title="type heapless::binary_heap::PeekMutView">Peek<wbr>MutView</a></dt><dd>Structure wrapping a mutable reference to the greatest item on a
|
|
<code>BinaryHeap</code>.</dd></dl></section></div></main></body></html> |