Re: Dequeue element overhead
- From: shoneill <x@xxxxxxxx>
- Date: Thu, 29 Sep 2005 17:40:46 -0500 (CDT)
Actually, I disagree.
I also see no reason for a Queue to require a contiguous memory space to
store many elements. Ever heard of linked lists?
If it really is similar to arrays, then the act of adding to the
beginning of a Queue must be significantly less efficient than adding
at the end. Anyone got a benchmark to test this?
During the last few months people have been posting about how
surprisingly efficient and fast passing data via Queues is. I
would say that the overhead required to queue or dequeue is negligible.
Of course, if you're queuing a 1MB array every millisecond or so it'll
be a different story, but for "normal" use, it's easily fast enough.
Shane.
Message Edited by shoneill on 09-30-2005 12:28 AM
.
- Prev by Date: "generate subset" in script gives error if even number
- Next by Date: Re: Doubt about the origin of the graph
- Previous by thread: "generate subset" in script gives error if even number
- Next by thread: My boolean switch keeps switching off even when latch is engaged
- Index(es):
Relevant Pages
|
