Unified · Split
| @@ -59,9 +59,9 @@ Frame scheduling · 58 unmodified lines | ||
| 59 | 59 | filter; these buffered frames must be flushed immediately if a new input |
| 60 | 60 | produces new output. |
| 61 | 61 | |
| 62 | − ( Example: framerate-doubling filter: start_frame must (1) flush the | |
| 63 | − second copy of the previous frame, it it is stille there, (2) push the | |
| 64 | − first copy of the incoming frame, (3) keep the second copy for later. ) | |
| 62 | + (Example: framerate-doubling filter: start_frame must (1) flush the | |
| 63 | + second copy of the previous frame, if it is still there, (2) push the | |
| 64 | + first copy of the incoming frame, (3) keep the second copy for later.) | |
| 65 | 65 | |
| 66 | 66 | If the input frame is not enough to produce output, the filter must not |
| 67 | 67 | call request_frame to get more. It must just process the frame or queue |
| @@ -89,7 +89,7 @@ Frame scheduling · 21 unmodified lines | ||
| 89 | 89 | Return values: |
| 90 | 90 | if request_frame could produce a frame, it should return 0; |
| 91 | 91 | if it could not for temporary reasons, it should return AVERROR(EAGAIN); |
| 92 | − if it could not because there are no more frames, it shous return | |
| 92 | + if it could not because there are no more frames, it should return | |
| 93 | 93 | AVERROR_EOF. |
| 94 | 94 | |
| 95 | 95 | The typical implementation of request_frame for a filter with several |