📄 cpppriorityqueue.html
字号:
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html> <head> <meta name="generator" content="HTML Tidy for Linux/x86 (vers 1st October 2002), see www.w3.org"> <title>C++ Priority Queues</title> </head> <body bgcolor="#ffffff"> <table width="100%" bgcolor="#eeeeff"> <tr> <td><a href="index.html">cppreference.com</a> -> C++ Priority Queues</td> </tr> </table> <h3>C++ Priority Queues</h3> <p>C++ Priority Queues are like <a href="cppqueue.html">queues</a>, but the elements inside the the data structure are ordered by some predicate.</p> <table> <tr bgcolor="#eeeeff"> <td><a href="cpppriorityqueue_details.html#empty">empty()</a></td> <td>true if the priority queue is empty</td> </tr> <tr> <td><a href="cpppriorityqueue_details.html#pop">pop()</a></td> <td>removes the first element</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cpppriorityqueue_details.html#push">push()</a></td> <td>adds an element</td> </tr> <tr> <td><a href="cpppriorityqueue_details.html#size">size()</a></td> <td>returns the number of elements in the priority queue</td> </tr> <tr bgcolor="#eeeeff"> <td><a href="cpppriorityqueue_details.html#top">top()</a></td> <td>returns the value of the element with highest priority</td> </tr> </table> </body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -