@@qcnck2776 @robertstrickland9722 I suspect there will be folks who also use "D-Q" and will know exactly what you're talking about which is the important part :)
Hello Mike. Thanks for this awesome series. Some clarifications on std::deque: it supports constant-time random access to its elements, much like an array or a std::vector. This is accomplished by using a dynamic array of pointers, each of which points to a block of elements. By doing a division and a modulo operation on an index, it can locate the block and element corresponding to that index. Unlike std::vector but similar to std::list, the elements of a std::deque are not stored in a contiguous block of memory. Instead, they are divided into multiple blocks. This has several benefits, such as avoiding the need to reallocate and copy all elements when the std::deque grows, which improves performance for certain operations. is that correct?!
bare minimum, but complete for a (first) use ... thank you for the series 👏
@@mrdebug6581 cheers!
I've definitely been mis-pronouncing it as "D-Q" haha. Another great video, thanks Mike!
And I've been saying D-E-Q (double-ended queue)
@@qcnck2776 @robertstrickland9722 I suspect there will be folks who also use "D-Q" and will know exactly what you're talking about which is the important part :)
Another great lesson👏🏽🙏🏽❤️
Cheers!
Very useful information, great video.
Cheers!
Hello Mike. Thanks for this awesome series.
Some clarifications on std::deque: it supports constant-time random access to its elements, much like an array or a std::vector. This is accomplished by using a dynamic array of pointers, each of which points to a block of elements. By doing a division and a modulo operation on an index, it can locate the block and element corresponding to that index. Unlike std::vector but similar to std::list, the elements of a std::deque are not stored in a contiguous block of memory. Instead, they are divided into multiple blocks. This has several benefits, such as avoiding the need to reallocate and copy all elements when the std::deque grows, which improves performance for certain operations.
is that correct?!
Sounds good to me!
I just learn a lot from you
Thanks man for your great channel
Cheers!