Le 16/07/2009 06:18, Anthony D. Baye nous fit lire :
> I was, perhaps, unclear as to what I am looking for.  All I need is a
> First-in-First-out structure.  A plain old queue which, preferably, grows and
> shrinks with need.
> 
> I apologize for the confusion.
> 
> A.D.B.

As the parser of the SDL is mono-thread/process, using a producer-consumer approach
seems
a bit of overkill and ineffective.
Have you looked at the spline & arrays ?
For arrays, dimensions & dimension_size might be handy in closed macros.

Now, I cannot really see a reason to need a FIFO structure in SDL, short of a somehow
deficient coding at the conception level: reexamine it! (or provide actual code that
cannot be rewritten). When you only have a hammer, everything looks like a nail...
programmer with single coding scheme must learn new tools and adapt to the language.

At worst, you could use a simple strings as a holder for linearized data (and
implement a
partial parser for your linearized data...), removing parsed parts with
string-operations.

As a side note, it seems that a min & max index of spline functions is missing so far.
(to know the minimal/maximal index usable with a spline, for instance). Might be a
handy
addition to the SDL. (Or did I missed the right page in doc ?)

> 
> "Anthony D. Baye" <Sha### [at] spamnomorehotmailcom> wrote:
>> Warp <war### [at] tagpovrayorg> wrote:
>>> Anthony D. Baye <Sha### [at] spamnomorehotmailcom> wrote:
>>>> Has anyone written a relatively efficient array-based priority queue?
>>>   AFAIK a heap is usually used for priority queues because it can be
>>> implemented inside an array (with no ancillary data whatsoever necessary),
>>> insertion is an O(log n) operation, and getting the highest-priority element
>>> is constant-time (removing it from the heap is O(log n)).
>>>
>>> http://en.wikipedia.org/wiki/Heap_(data_structure)
>>>
>>> --
>>>                                                           - Warp
>> I meant in the POV SDL.
>>
>> I'm working on something that would be best accomplished using a Priority queue,
>> and I didn't want to have to write my own.
>>
>> But, as I said, I probably could if I had to.
>>
>> A.D.B.
> 
> 
> 
>

Post a reply to this message