RepoMirrors
/
mpv
mirror of https://github.com/mpv-player/mpv
1
0
Fork 0
Code Issues Releases Wiki Activity

seeking 

git-svn-id: svn://svn.mplayerhq.hu/mplayer/trunk@20981 b3059339-0415-0410-9bf9-f77b7e298cf2
This commit is contained in:
michael 2006-11-17 12:44:10 +00:00
parent 8d0b695d2c
commit 3e41eed182
1 changed files with 23 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
DOCS/tech/nut.txt
View File

@ -901,6 +901,29 @@ backup headers starting at offset 2^x; for each x players SHOULD end their
search at a particular offset when any startcode is found (including syncpoint)
Seeking without an index (non-normative):
-----------------------------------------
A. backward seeking
1. perform a binary search on the syncpoint timestamps finding the one
which is largest and <= the target timestamp
B. forward seeking
1a. perform a binary search on the syncpoint timestamps finding the one
which is smallest and >= the target timestamp
1b. perform a binary search on the syncpoint back pointers finding the
smallest one which has a back ptr >= the position of what was found in 1.
2. follow the back pointer to the correspoding syncpoint
Seeking with an index (non-normative):
--------------------------------------
The demuxer only has to find the appropriate keyframe in the index and
start demuxing from the previous syncpoint
Note, more complicated seeking methods exist which are capable of quickly
seeking to the optimal point in the presence of an index even if only a
subset of all streams are active but a muxer SHOULD place syncpoints,
and keyframes if it can affect the placement of keyframes so that simple
low complexity seeking works with fine granularity
Semantic requirements:
======================