Difference between revisions of "Talk:cpp/container/priority queue"
From cppreference.com
(N) |
(new section) |
||
| Line 6: | Line 6: | ||
: Touched up the description, agree that small usage examples could be helpful. For now, {{lc|std::make_heap}} etc examples are pretty much the same thing. --[[User:Cubbi|Cubbi]] ([[User talk:Cubbi|talk]]) 12:17, 11 December 2014 (PST) | : Touched up the description, agree that small usage examples could be helpful. For now, {{lc|std::make_heap}} etc examples are pretty much the same thing. --[[User:Cubbi|Cubbi]] ([[User talk:Cubbi|talk]]) 12:17, 11 December 2014 (PST) | ||
: I agree. I have added a short note that hopefully explains this a bit. [[User:Cluengo|Cluengo]] ([[User talk:Cluengo|talk]]) 12:51, 18 December 2017 (PST) | : I agree. I have added a short note that hopefully explains this a bit. [[User:Cluengo|Cluengo]] ([[User talk:Cluengo|talk]]) 12:51, 18 December 2017 (PST) | ||
| + | |||
| + | [[Special:Contributions/195.154.250.43|195.154.250.43]] 11:46, 31 August 2019 (PDT)New section | ||
Revision as of 10:46, 31 August 2019
Isn't it quite misleading that it reads that "top: access the top element" vs "pop: remove first element", but first and top coincide here? 78.52.126.195 07:39, 2 February 2014 (PST)
- Thanks for noticing, I've fixed this issue. --P12 13:04, 2 February 2014 (PST)
The comparer is confusing, maybe there should be clarification how it should look when you want the queue to minimize vs maximize. Also a usage example would help a lot.
- Touched up the description, agree that small usage examples could be helpful. For now, std::make_heap etc examples are pretty much the same thing. --Cubbi (talk) 12:17, 11 December 2014 (PST)
- I agree. I have added a short note that hopefully explains this a bit. Cluengo (talk) 12:51, 18 December 2017 (PST)
195.154.250.43 11:46, 31 August 2019 (PDT)New section
