search for: biseciton

...maps to that granulepos, then, and only then, you get to know the low bits of the actual granulepos, and then you have to do another bisection to find it. This is *not* handled by Ogg, since the granulepos encoding is wholly out of its concern, so there's no way it can optimize out hte second biseciton. If you want to be clever and you know clips are short and can't overlap, you can get away with manual backward streaming to avoid the bisection, but that's still a second seek. Compare this with storing the granulepos of the earliest still active packet, which is what I'm doing curren...

...*in time* and off you go. What makes designing Ogg embeddings complicated in working out all the implications of this for a new style of codec. > This is *not* handled by Ogg, since the granulepos encoding is wholly out > of its concern, so there's no way it can optimize out hte second biseciton. > If you want to be clever and you know clips are short and can't overlap, > you can get away with manual backward streaming to avoid the bisection, > but that's still a second seek. What I was trying to address in my talk, and don't know if it came out clearly, was that, yes...

Hi, I have a question about seeking. In fact, it's more or less a kind of rambling and thinking aloud, circling around a question. I've been wondering how to deal with seeking in a stream, and what to do when seeking in the middle of a set of active events (eg, when several bits of text are supposed to be shown, but you seek after the time when they are first shown, and before the time