e6ccf0ce
 Hu Chunming
提交三方库
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>Chapter 15. Boost.Heap</title>
<link rel="stylesheet" href="../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
<link rel="up" href="libraries.html" title="Part I. The Boost C++ Libraries (BoostBook Subset)">
<link rel="prev" href="function/testsuite.html" title="Testsuite">
<link rel="next" href="heap/concepts.html" title="Concepts & Interface">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../boost.png"></td>
<td align="center"><a href="../../index.html">Home</a></td>
<td align="center"><a href="../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
<td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
<td align="center"><a href="../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="function/testsuite.html"><img src="../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="libraries.html"><img src="../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="heap/concepts.html"><img src="../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="chapter">
<div class="titlepage"><div>
<div><h2 class="title">
<a name="heap"></a>Chapter 15. Boost.Heap</h2></div>
<div><div class="author"><h3 class="author">
<span class="firstname">Tim</span> <span class="surname">Blechmann</span>
</h3></div></div>
<div><p class="copyright">Copyright © 2010, 2011 Tim Blechmann</p></div>
<div><div class="legalnotice">
<a name="heap.legal"></a><p>
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
</p>
</div></div>
</div></div>
<div class="toc">
<p><b>Table of Contents</b></p>
<dl class="toc">
<dt><span class="section"><a href="heap.html#heap.introduction___motivation">Introduction & Motivation</a></span></dt>
<dt><span class="section"><a href="heap/concepts.html">Concepts & Interface</a></span></dt>
<dd><dl>
<dt><span class="section"><a href="heap/concepts.html#heap.concepts.basic">Basic Priority Queue Interface</a></span></dt>
<dt><span class="section"><a href="heap/concepts.html#heap.concepts.iterators">Priority Queue Iterators</a></span></dt>
<dt><span class="section"><a href="heap/concepts.html#heap.concepts.comparing">Comparing Priority Queues &
Equivalence</a></span></dt>
<dt><span class="section"><a href="heap/concepts.html#heap.concepts.merge">Merging Priority Queues</a></span></dt>
<dt><span class="section"><a href="heap/concepts.html#heap.concepts.mutability">Mutability</a></span></dt>
<dt><span class="section"><a href="heap/concepts.html#heap.concepts.stability">Stability</a></span></dt>
</dl></dd>
<dt><span class="section"><a href="heap/data_structures.html">Data Structures</a></span></dt>
<dd><dl><dt><span class="section"><a href="heap/data_structures.html#heap.data_structures.data_structure_configuration">Data
Structure Configuration</a></span></dt></dl></dd>
<dt><span class="section"><a href="heap/reference.html">Reference</a></span></dt>
<dd><dl>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.binomial_heap_hpp">Header <boost/heap/binomial_heap.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.d_ary_heap_hpp">Header <boost/heap/d_ary_heap.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.fibonacci_heap_hpp">Header <boost/heap/fibonacci_heap.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.heap_concepts_hpp">Header <boost/heap/heap_concepts.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.heap_merge_hpp">Header <boost/heap/heap_merge.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.pairing_heap_hpp">Header <boost/heap/pairing_heap.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.policies_hpp">Header <boost/heap/policies.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.priority_queue_hpp">Header <boost/heap/priority_queue.hpp></a></span></dt>
<dt><span class="section"><a href="heap/reference.html#header.boost.heap.skew_heap_hpp">Header <boost/heap/skew_heap.hpp></a></span></dt>
</dl></dd>
<dt><span class="section"><a href="heap/acknowledgements.html">Acknowledgements</a></span></dt>
</dl>
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="heap.introduction___motivation"></a><a class="link" href="heap.html#heap.introduction___motivation" title="Introduction & Motivation">Introduction & Motivation</a>
</h2></div></div></div>
<p>
<code class="literal">boost.heap</code> is an implementation of priority queues. Priority
queues are queue data structures, that order their elements by a priority.
The STL provides a single template class <code class="literal">std::priority_queue</code>,
which only provides a limited functionality. To overcome these limitations,
<code class="literal">boost.heap</code> implements <a class="link" href="heap/data_structures.html" title="Data Structures">data
structures</a> with more functionality and different performance characteristics.
Especially, it deals with additional aspects:
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
<span class="bold"><strong>Mutability</strong></span>: The priority of heap elements
can be modified.
</li>
<li class="listitem">
<span class="bold"><strong>Iterators</strong></span>: Heaps provide iterators to
iterate all elements.
</li>
<li class="listitem">
<span class="bold"><strong>Mergable</strong></span>: While all heaps can be merged,
some can be merged efficiently.
</li>
<li class="listitem">
<span class="bold"><strong>Stability</strong></span>: Heaps can be configured to
be stable sorted.
</li>
<li class="listitem">
<span class="bold"><strong>Comparison</strong></span>: Heaps can be compared for
equivalence.
</li>
</ul></div>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"><p><small>Last revised: December 08, 2022 at 01:12:39 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="function/testsuite.html"><img src="../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="libraries.html"><img src="../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="index.html"><img src="../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="heap/concepts.html"><img src="../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
|
