Hi, Ion! Could you provide, if possible, the link to your new implementation of deque? Best regards, LoS On Sat, Sep 20, 2025, 10:31 PM Ion Gaztañaga via Boost < boost@lists.boost.org> wrote:
El 20/09/2025 a las 15:19, Ceyhun Erturk via Boost escribió:
Hi, May I kindly ask, what are major behavioral contrasts between seque variation and queue adapter (except user can able to end direction I suppose)? BR
"seque" would be the straightforward name for a single-ended version of a "deque", but that name is really awful because it would mean "single-ended queue", and a single ended deque is NOT a queue.
In a single-ended deque you can only push_back and pop_back (just like a vector), it would be a LIFO-like data structure, whereas in a true "single-ended queue" or "simple queue" insertion takes place at the rear and removal occurs at the front (FIFO).
So a single-ended deque should not be called "seque", maybe something like "segmented_vector" and it would offer reference and pointer stability for back insertions. "vector" is not really adequate because a single-ended deque would not offer reserve/capacity methods, which I think every C++ expects from a "vector"-like data structure.
Best,
Ion
_______________________________________________ Boost mailing list -- boost@lists.boost.org To unsubscribe send an email to boost-leave@lists.boost.org https://lists.boost.org/mailman3/lists/boost.lists.boost.org/ Archived at: https://lists.boost.org/archives/list/boost@lists.boost.org/message/LKN3FYV6...