Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with deque
Search options answers only
not deleted
user 489
For code for double ended queues, or code that wouldn't nearly be the same without a deque. Not for code that merely happens to use a deque incidentally but whose real focus is something else.
4
votes
Accepted
A deque for up to one million elements
Performance
Right now, your pop_front is linear on the number of items in the deque--that is, every time you do a pop_front, you move the entire content of the deque, so the first item is always at m_head … deque {
size_t capacity;
T *storage;
size_t front;
size_t back;
public:
deque(size_t capacity)
: capacity(capacity)
, storage(new T[capacity])
, front(capacity …
- 33.6k