Seeking to the nearest page (ov_pcm_seek_page) is said to be faster than seeking to a particular PCM sample. I could not find documentation or comments in the code that would explain what is the worst case offset from the specified PCM sample to seek to. Does such an upper bound exists ? What does it depend on ? I guess this maybe come to the same question as how many samples maximum can be contained within a single page. Any pointers would be much appreciated. FT -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.xiph.org/pipermail/vorbis-dev/attachments/20060612/f1031673/attachment.htm