Question

deque::end results in assertion failure

score 69 · Answer 1 · 2023-03-07T14:07:43.033000

69

Views

deque::end results in assertion failure

Published on 07 March 2023 at 14:07

score 65 · Answer 2 · 2022-06-18T10:17:22.603000

65

Views

Is it safe to access the popped binary tree nodes which iterative traversed by std::stack

Published on 18 June 2022 at 10:17

score 671 · Answer 3 · 2022-05-06T11:46:34.993000

671

Views

What is underlying data structure of std::deque and how does it's iterator work?

Published on 06 May 2022 at 11:46

score 121 · Answer 4 · 2021-12-14T06:55:59.517000

121

Views

Why is there a significant time and memory difference between the two similar implementations?

Published on 14 December 2021 at 06:55

score 571 · Answer 5 · 2021-12-07T18:06:58.490000

571

Views

Is there a container similar to `std::deque` but with custom block size and better performance?

Published on 07 December 2021 at 18:06

score 398 · Answer 6 · 2021-10-21T14:27:13.823000

398

Views

How does libcxx's C++ __split_buffer push_front function work?

Published on 21 October 2021 at 14:27

score 533 · Answer 7 · 2021-07-09T12:13:42.230000

533

Views

Does std::deque release some of its unused chunks of memory?

Published on 09 July 2021 at 12:13

score 197 · Answer 8 · 2021-07-06T08:05:26.563000

197

Views

What is the internal container used in tbb::concurrent_bounded_queue?

Published on 06 July 2021 at 08:05

score 1.1k · Answer 9 · 2021-01-28T20:43:09.500000

1.1k

Views

looping through a std::deque and remove entries

Published on 28 January 2021 at 20:43

score 194 · Answer 10 · 2020-06-24T00:23:24.503000

194

Views

Should it be possible to add to an iterator of an empty deque in C++?

Published on 24 June 2020 at 00:23

score 697 · Answer 11 · 2020-03-19T22:00:54.503000

697

Views

STL container to select and remove random item?

Published on 19 March 2020 at 22:00

score 274 · Answer 12 · 2020-02-19T14:55:21.673000

274

Views

Why is this C++ deque code 'less efficient' when I demodularize it?

Published on 19 February 2020 at 14:55

score 104 · Answer 13 · 2019-10-09T13:47:37.077000

104

Views

Do I need to delete/free dynamically allocated data (e.g. bytearray or std::vector) within a std::deque before I can call pop_back?

Published on 09 October 2019 at 13:47

score 302 · Answer 14 · 2019-09-18T09:15:41.260000

302

Views

Howto detect a fail of dynamic memory allocation when pushing to std::deque?

Published on 18 September 2019 at 09:15

score 2.1k · Answer 15 · 2019-07-14T23:34:02.660000

2.1k

Views

Why doesn't std::deque allow specifying the bucket size?

Published on 14 July 2019 at 23:34

score 3.8k · Answer 16 · 2019-07-12T15:51:47.267000

3.8k

Views

How to append the contents of one std::queue to another

Published on 12 July 2019 at 15:51

score 1.2k · Answer 17 · 2019-05-12T06:18:09.403000

1.2k

Views

Is it possible to pass std::deque's member functions as a parameter?

Published on 12 May 2019 at 06:18

score 197 · Answer 18 · 2019-03-06T09:43:40.000000

197

Views

Clean map periodically

Published on 06 March 2019 at 09:43

score 180 · Answer 19 · 2018-10-11T05:58:33.097000

180

Views

deque push back default constructor not called

Published on 11 October 2018 at 05:58

score 234 · Answer 20 · 2018-06-25T09:07:24.947000

234

Views

std::deque iterator vs reference invalidation

Published on 25 June 2018 at 09:07

List Question

deque::end results in assertion failure

Is it safe to access the popped binary tree nodes which iterative traversed by std::stack

What is underlying data structure of std::deque and how does it's iterator work?

Why is there a significant time and memory difference between the two similar implementations?

Is there a container similar to `std::deque` but with custom block size and better performance?

How does libcxx's C++ __split_buffer push_front function work?

Does std::deque release some of its unused chunks of memory?

What is the internal container used in tbb::concurrent_bounded_queue?

looping through a std::deque and remove entries

Should it be possible to add to an iterator of an empty deque in C++?

STL container to select and remove random item?

Why is this C++ deque code 'less efficient' when I demodularize it?

Do I need to delete/free dynamically allocated data (e.g. bytearray or std::vector) within a std::deque before I can call pop_back?

Howto detect a fail of dynamic memory allocation when pushing to std::deque?

Why doesn't std::deque allow specifying the bucket size?

How to append the contents of one std::queue to another

Is it possible to pass std::deque's member functions as a parameter?

Clean map periodically

deque push back default constructor not called

std::deque iterator vs reference invalidation

Trending Questions

Popular # Hahtags

Popular Questions