File size: 4,983 Bytes
1e92f2d |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 |
import type {
FrameFn,
FrameUpdateFn,
NativeRaf,
Rafz,
Timeout,
Throttled,
} from './types'
export type { FrameFn, FrameUpdateFn, Timeout, Throttled, Rafz }
let updateQueue = makeQueue<FrameUpdateFn>()
/**
* Schedule an update for next frame.
* Your function can return `true` to repeat next frame.
*/
export const raf: Rafz = fn => schedule(fn, updateQueue)
let writeQueue = makeQueue<FrameFn>()
raf.write = fn => schedule(fn, writeQueue)
let onStartQueue = makeQueue<FrameFn>()
raf.onStart = fn => schedule(fn, onStartQueue)
let onFrameQueue = makeQueue<FrameFn>()
raf.onFrame = fn => schedule(fn, onFrameQueue)
let onFinishQueue = makeQueue<FrameFn>()
raf.onFinish = fn => schedule(fn, onFinishQueue)
let timeouts: Timeout[] = []
raf.setTimeout = (handler, ms) => {
const time = raf.now() + ms
const cancel = () => {
const i = timeouts.findIndex(t => t.cancel == cancel)
if (~i) timeouts.splice(i, 1)
pendingCount -= ~i ? 1 : 0
}
const timeout: Timeout = { time, handler, cancel }
timeouts.splice(findTimeout(time), 0, timeout)
pendingCount += 1
start()
return timeout
}
/** Find the index where the given time is not greater. */
const findTimeout = (time: number) =>
~(~timeouts.findIndex(t => t.time > time) || ~timeouts.length)
raf.cancel = fn => {
onStartQueue.delete(fn)
onFrameQueue.delete(fn)
onFinishQueue.delete(fn)
updateQueue.delete(fn)
writeQueue.delete(fn)
}
raf.sync = fn => {
sync = true
raf.batchedUpdates(fn)
sync = false
}
raf.throttle = fn => {
let lastArgs: any
function queuedFn() {
try {
fn(...lastArgs)
} finally {
lastArgs = null
}
}
function throttled(...args: any) {
lastArgs = args
raf.onStart(queuedFn)
}
throttled.handler = fn
throttled.cancel = () => {
onStartQueue.delete(queuedFn)
lastArgs = null
}
return throttled as any
}
let nativeRaf =
typeof window != 'undefined'
? (window.requestAnimationFrame as NativeRaf)
: // eslint-disable-next-line @typescript-eslint/no-empty-function
() => {}
raf.use = impl => (nativeRaf = impl)
raf.now = typeof performance != 'undefined' ? () => performance.now() : Date.now
raf.batchedUpdates = fn => fn()
raf.catch = console.error
raf.frameLoop = 'always'
raf.advance = () => {
if (raf.frameLoop !== 'demand') {
console.warn(
'Cannot call the manual advancement of rafz whilst frameLoop is not set as demand'
)
} else {
update()
}
}
/** The most recent timestamp. */
let ts = -1
/** The number of pending tasks */
let pendingCount = 0
/** When true, scheduling is disabled. */
let sync = false
function schedule<T extends Function>(fn: T, queue: Queue<T>) {
if (sync) {
queue.delete(fn)
fn(0)
} else {
queue.add(fn)
start()
}
}
function start() {
if (ts < 0) {
ts = 0
if (raf.frameLoop !== 'demand') {
nativeRaf(loop)
}
}
}
function stop() {
ts = -1
}
function loop() {
if (~ts) {
nativeRaf(loop)
raf.batchedUpdates(update)
}
}
function update() {
const prevTs = ts
ts = raf.now()
// Flush timeouts whose time is up.
const count = findTimeout(ts)
if (count) {
eachSafely(timeouts.splice(0, count), t => t.handler())
pendingCount -= count
}
if (!pendingCount) {
stop()
return
}
onStartQueue.flush()
updateQueue.flush(prevTs ? Math.min(64, ts - prevTs) : 16.667)
onFrameQueue.flush()
writeQueue.flush()
onFinishQueue.flush()
}
interface Queue<T extends Function = any> {
add: (fn: T) => void
delete: (fn: T) => boolean
flush: (arg?: any) => void
}
function makeQueue<T extends Function>(): Queue<T> {
let next = new Set<T>()
let current = next
return {
add(fn) {
pendingCount += current == next && !next.has(fn) ? 1 : 0
next.add(fn)
},
delete(fn) {
pendingCount -= current == next && next.has(fn) ? 1 : 0
return next.delete(fn)
},
flush(arg) {
if (current.size) {
next = new Set()
pendingCount -= current.size
eachSafely(current, fn => fn(arg) && next.add(fn))
pendingCount += next.size
current = next
}
},
}
}
interface Eachable<T> {
forEach(cb: (value: T) => void): void
}
function eachSafely<T>(values: Eachable<T>, each: (value: T) => void) {
values.forEach(value => {
try {
each(value)
} catch (e) {
raf.catch(e as Error)
}
})
}
/** Tree-shakable state for testing purposes */
export const __raf = {
/** The number of pending tasks */
count(): number {
return pendingCount
},
/** Whether there's a raf update loop running */
isRunning(): boolean {
return ts >= 0
},
/** Clear internal state. Never call from update loop! */
clear() {
ts = -1
timeouts = []
onStartQueue = makeQueue()
updateQueue = makeQueue()
onFrameQueue = makeQueue()
writeQueue = makeQueue()
onFinishQueue = makeQueue()
pendingCount = 0
},
}
|