[LAD] Time & How to approach it

[Paul Coccoli]

On Thu, Jan 21, 2010 at 6:37 AM, torbenh <torbenh at gmx.de> wrote:
> well.. the real problems are a bit deeper.
> and not really touched be any example clients.
>
> you need to have lockfree access to the note sequence.
> while still being able to manipulate it from the gui thread.
>
> several approaches to achieve this are possible. and it depends a bit on
> taste and the app to select them.
>
> but the major part of complexity lies here.
>

I assume std::priority_queue can't be used, because it uses a
std::vector which will, under the covers, allocate memory from the
stack.

It would be interesting to try to write an STL queue-like container
with an allocator that grabbed chunks of memory from a pool in an
RT-safe way.  Maybe via message-passing over a ringbuffer?  Anyone
seen/have such a thing?