UNPKG

24 kBJavaScriptView Raw
1/** @license React v0.20.1
2 * scheduler-unstable_mock.development.js
3 *
4 * Copyright (c) Facebook, Inc. and its affiliates.
5 *
6 * This source code is licensed under the MIT license found in the
7 * LICENSE file in the root directory of this source tree.
8 */
9(function (global, factory) {
10 typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
11 typeof define === 'function' && define.amd ? define(['exports'], factory) :
12 (global = global || self, factory(global.SchedulerMock = {}));
13}(this, (function (exports) { 'use strict';
14
15 var enableSchedulerDebugging = false;
16 var enableProfiling = true;
17
18 var currentTime = 0;
19 var scheduledCallback = null;
20 var scheduledTimeout = null;
21 var timeoutTime = -1;
22 var yieldedValues = null;
23 var expectedNumberOfYields = -1;
24 var didStop = false;
25 var isFlushing = false;
26 var needsPaint = false;
27 var shouldYieldForPaint = false;
28 function requestHostCallback(callback) {
29 scheduledCallback = callback;
30 }
31 function requestHostTimeout(callback, ms) {
32 scheduledTimeout = callback;
33 timeoutTime = currentTime + ms;
34 }
35 function cancelHostTimeout() {
36 scheduledTimeout = null;
37 timeoutTime = -1;
38 }
39 function shouldYieldToHost() {
40 if (expectedNumberOfYields !== -1 && yieldedValues !== null && yieldedValues.length >= expectedNumberOfYields || shouldYieldForPaint && needsPaint) {
41 // We yielded at least as many values as expected. Stop flushing.
42 didStop = true;
43 return true;
44 }
45
46 return false;
47 }
48 function getCurrentTime() {
49 return currentTime;
50 }
51 function forceFrameRate() {// No-op
52 }
53
54 function unstable_flushNumberOfYields(count) {
55 if (isFlushing) {
56 throw new Error('Already flushing work.');
57 }
58
59 if (scheduledCallback !== null) {
60 var cb = scheduledCallback;
61 expectedNumberOfYields = count;
62 isFlushing = true;
63
64 try {
65 var hasMoreWork = true;
66
67 do {
68 hasMoreWork = cb(true, currentTime);
69 } while (hasMoreWork && !didStop);
70
71 if (!hasMoreWork) {
72 scheduledCallback = null;
73 }
74 } finally {
75 expectedNumberOfYields = -1;
76 didStop = false;
77 isFlushing = false;
78 }
79 }
80 }
81 function unstable_flushUntilNextPaint() {
82 if (isFlushing) {
83 throw new Error('Already flushing work.');
84 }
85
86 if (scheduledCallback !== null) {
87 var cb = scheduledCallback;
88 shouldYieldForPaint = true;
89 needsPaint = false;
90 isFlushing = true;
91
92 try {
93 var hasMoreWork = true;
94
95 do {
96 hasMoreWork = cb(true, currentTime);
97 } while (hasMoreWork && !didStop);
98
99 if (!hasMoreWork) {
100 scheduledCallback = null;
101 }
102 } finally {
103 shouldYieldForPaint = false;
104 didStop = false;
105 isFlushing = false;
106 }
107 }
108 }
109 function unstable_flushExpired() {
110 if (isFlushing) {
111 throw new Error('Already flushing work.');
112 }
113
114 if (scheduledCallback !== null) {
115 isFlushing = true;
116
117 try {
118 var hasMoreWork = scheduledCallback(false, currentTime);
119
120 if (!hasMoreWork) {
121 scheduledCallback = null;
122 }
123 } finally {
124 isFlushing = false;
125 }
126 }
127 }
128 function unstable_flushAllWithoutAsserting() {
129 // Returns false if no work was flushed.
130 if (isFlushing) {
131 throw new Error('Already flushing work.');
132 }
133
134 if (scheduledCallback !== null) {
135 var cb = scheduledCallback;
136 isFlushing = true;
137
138 try {
139 var hasMoreWork = true;
140
141 do {
142 hasMoreWork = cb(true, currentTime);
143 } while (hasMoreWork);
144
145 if (!hasMoreWork) {
146 scheduledCallback = null;
147 }
148
149 return true;
150 } finally {
151 isFlushing = false;
152 }
153 } else {
154 return false;
155 }
156 }
157 function unstable_clearYields() {
158 if (yieldedValues === null) {
159 return [];
160 }
161
162 var values = yieldedValues;
163 yieldedValues = null;
164 return values;
165 }
166 function unstable_flushAll() {
167 if (yieldedValues !== null) {
168 throw new Error('Log is not empty. Assert on the log of yielded values before ' + 'flushing additional work.');
169 }
170
171 unstable_flushAllWithoutAsserting();
172
173 if (yieldedValues !== null) {
174 throw new Error('While flushing work, something yielded a value. Use an ' + 'assertion helper to assert on the log of yielded values, e.g. ' + 'expect(Scheduler).toFlushAndYield([...])');
175 }
176 }
177 function unstable_yieldValue(value) {
178 // eslint-disable-next-line react-internal/no-production-logging
179 if (console.log.name === 'disabledLog') {
180 // If console.log has been patched, we assume we're in render
181 // replaying and we ignore any values yielding in the second pass.
182 return;
183 }
184
185 if (yieldedValues === null) {
186 yieldedValues = [value];
187 } else {
188 yieldedValues.push(value);
189 }
190 }
191 function unstable_advanceTime(ms) {
192 // eslint-disable-next-line react-internal/no-production-logging
193 if (console.log.name === 'disabledLog') {
194 // If console.log has been patched, we assume we're in render
195 // replaying and we ignore any time advancing in the second pass.
196 return;
197 }
198
199 currentTime += ms;
200
201 if (scheduledTimeout !== null && timeoutTime <= currentTime) {
202 scheduledTimeout(currentTime);
203 timeoutTime = -1;
204 scheduledTimeout = null;
205 }
206 }
207 function requestPaint() {
208 needsPaint = true;
209 }
210
211 function push(heap, node) {
212 var index = heap.length;
213 heap.push(node);
214 siftUp(heap, node, index);
215 }
216 function peek(heap) {
217 var first = heap[0];
218 return first === undefined ? null : first;
219 }
220 function pop(heap) {
221 var first = heap[0];
222
223 if (first !== undefined) {
224 var last = heap.pop();
225
226 if (last !== first) {
227 heap[0] = last;
228 siftDown(heap, last, 0);
229 }
230
231 return first;
232 } else {
233 return null;
234 }
235 }
236
237 function siftUp(heap, node, i) {
238 var index = i;
239
240 while (true) {
241 var parentIndex = index - 1 >>> 1;
242 var parent = heap[parentIndex];
243
244 if (parent !== undefined && compare(parent, node) > 0) {
245 // The parent is larger. Swap positions.
246 heap[parentIndex] = node;
247 heap[index] = parent;
248 index = parentIndex;
249 } else {
250 // The parent is smaller. Exit.
251 return;
252 }
253 }
254 }
255
256 function siftDown(heap, node, i) {
257 var index = i;
258 var length = heap.length;
259
260 while (index < length) {
261 var leftIndex = (index + 1) * 2 - 1;
262 var left = heap[leftIndex];
263 var rightIndex = leftIndex + 1;
264 var right = heap[rightIndex]; // If the left or right node is smaller, swap with the smaller of those.
265
266 if (left !== undefined && compare(left, node) < 0) {
267 if (right !== undefined && compare(right, left) < 0) {
268 heap[index] = right;
269 heap[rightIndex] = node;
270 index = rightIndex;
271 } else {
272 heap[index] = left;
273 heap[leftIndex] = node;
274 index = leftIndex;
275 }
276 } else if (right !== undefined && compare(right, node) < 0) {
277 heap[index] = right;
278 heap[rightIndex] = node;
279 index = rightIndex;
280 } else {
281 // Neither child is smaller. Exit.
282 return;
283 }
284 }
285 }
286
287 function compare(a, b) {
288 // Compare sort index first, then task id.
289 var diff = a.sortIndex - b.sortIndex;
290 return diff !== 0 ? diff : a.id - b.id;
291 }
292
293 // TODO: Use symbols?
294 var NoPriority = 0;
295 var ImmediatePriority = 1;
296 var UserBlockingPriority = 2;
297 var NormalPriority = 3;
298 var LowPriority = 4;
299 var IdlePriority = 5;
300
301 var runIdCounter = 0;
302 var mainThreadIdCounter = 0;
303 var profilingStateSize = 4;
304 var sharedProfilingBuffer = // $FlowFixMe Flow doesn't know about SharedArrayBuffer
305 typeof SharedArrayBuffer === 'function' ? new SharedArrayBuffer(profilingStateSize * Int32Array.BYTES_PER_ELEMENT) : // $FlowFixMe Flow doesn't know about ArrayBuffer
306 typeof ArrayBuffer === 'function' ? new ArrayBuffer(profilingStateSize * Int32Array.BYTES_PER_ELEMENT) : null // Don't crash the init path on IE9
307 ;
308 var profilingState = sharedProfilingBuffer !== null ? new Int32Array(sharedProfilingBuffer) : []; // We can't read this but it helps save bytes for null checks
309
310 var PRIORITY = 0;
311 var CURRENT_TASK_ID = 1;
312 var CURRENT_RUN_ID = 2;
313 var QUEUE_SIZE = 3;
314
315 {
316 profilingState[PRIORITY] = NoPriority; // This is maintained with a counter, because the size of the priority queue
317 // array might include canceled tasks.
318
319 profilingState[QUEUE_SIZE] = 0;
320 profilingState[CURRENT_TASK_ID] = 0;
321 } // Bytes per element is 4
322
323
324 var INITIAL_EVENT_LOG_SIZE = 131072;
325 var MAX_EVENT_LOG_SIZE = 524288; // Equivalent to 2 megabytes
326
327 var eventLogSize = 0;
328 var eventLogBuffer = null;
329 var eventLog = null;
330 var eventLogIndex = 0;
331 var TaskStartEvent = 1;
332 var TaskCompleteEvent = 2;
333 var TaskErrorEvent = 3;
334 var TaskCancelEvent = 4;
335 var TaskRunEvent = 5;
336 var TaskYieldEvent = 6;
337 var SchedulerSuspendEvent = 7;
338 var SchedulerResumeEvent = 8;
339
340 function logEvent(entries) {
341 if (eventLog !== null) {
342 var offset = eventLogIndex;
343 eventLogIndex += entries.length;
344
345 if (eventLogIndex + 1 > eventLogSize) {
346 eventLogSize *= 2;
347
348 if (eventLogSize > MAX_EVENT_LOG_SIZE) {
349 // Using console['error'] to evade Babel and ESLint
350 console['error']("Scheduler Profiling: Event log exceeded maximum size. Don't " + 'forget to call `stopLoggingProfilingEvents()`.');
351 stopLoggingProfilingEvents();
352 return;
353 }
354
355 var newEventLog = new Int32Array(eventLogSize * 4);
356 newEventLog.set(eventLog);
357 eventLogBuffer = newEventLog.buffer;
358 eventLog = newEventLog;
359 }
360
361 eventLog.set(entries, offset);
362 }
363 }
364
365 function startLoggingProfilingEvents() {
366 eventLogSize = INITIAL_EVENT_LOG_SIZE;
367 eventLogBuffer = new ArrayBuffer(eventLogSize * 4);
368 eventLog = new Int32Array(eventLogBuffer);
369 eventLogIndex = 0;
370 }
371 function stopLoggingProfilingEvents() {
372 var buffer = eventLogBuffer;
373 eventLogSize = 0;
374 eventLogBuffer = null;
375 eventLog = null;
376 eventLogIndex = 0;
377 return buffer;
378 }
379 function markTaskStart(task, ms) {
380 {
381 profilingState[QUEUE_SIZE]++;
382
383 if (eventLog !== null) {
384 // performance.now returns a float, representing milliseconds. When the
385 // event is logged, it's coerced to an int. Convert to microseconds to
386 // maintain extra degrees of precision.
387 logEvent([TaskStartEvent, ms * 1000, task.id, task.priorityLevel]);
388 }
389 }
390 }
391 function markTaskCompleted(task, ms) {
392 {
393 profilingState[PRIORITY] = NoPriority;
394 profilingState[CURRENT_TASK_ID] = 0;
395 profilingState[QUEUE_SIZE]--;
396
397 if (eventLog !== null) {
398 logEvent([TaskCompleteEvent, ms * 1000, task.id]);
399 }
400 }
401 }
402 function markTaskCanceled(task, ms) {
403 {
404 profilingState[QUEUE_SIZE]--;
405
406 if (eventLog !== null) {
407 logEvent([TaskCancelEvent, ms * 1000, task.id]);
408 }
409 }
410 }
411 function markTaskErrored(task, ms) {
412 {
413 profilingState[PRIORITY] = NoPriority;
414 profilingState[CURRENT_TASK_ID] = 0;
415 profilingState[QUEUE_SIZE]--;
416
417 if (eventLog !== null) {
418 logEvent([TaskErrorEvent, ms * 1000, task.id]);
419 }
420 }
421 }
422 function markTaskRun(task, ms) {
423 {
424 runIdCounter++;
425 profilingState[PRIORITY] = task.priorityLevel;
426 profilingState[CURRENT_TASK_ID] = task.id;
427 profilingState[CURRENT_RUN_ID] = runIdCounter;
428
429 if (eventLog !== null) {
430 logEvent([TaskRunEvent, ms * 1000, task.id, runIdCounter]);
431 }
432 }
433 }
434 function markTaskYield(task, ms) {
435 {
436 profilingState[PRIORITY] = NoPriority;
437 profilingState[CURRENT_TASK_ID] = 0;
438 profilingState[CURRENT_RUN_ID] = 0;
439
440 if (eventLog !== null) {
441 logEvent([TaskYieldEvent, ms * 1000, task.id, runIdCounter]);
442 }
443 }
444 }
445 function markSchedulerSuspended(ms) {
446 {
447 mainThreadIdCounter++;
448
449 if (eventLog !== null) {
450 logEvent([SchedulerSuspendEvent, ms * 1000, mainThreadIdCounter]);
451 }
452 }
453 }
454 function markSchedulerUnsuspended(ms) {
455 {
456 if (eventLog !== null) {
457 logEvent([SchedulerResumeEvent, ms * 1000, mainThreadIdCounter]);
458 }
459 }
460 }
461
462 /* eslint-disable no-var */
463 // Math.pow(2, 30) - 1
464 // 0b111111111111111111111111111111
465
466 var maxSigned31BitInt = 1073741823; // Times out immediately
467
468 var IMMEDIATE_PRIORITY_TIMEOUT = -1; // Eventually times out
469
470 var USER_BLOCKING_PRIORITY_TIMEOUT = 250;
471 var NORMAL_PRIORITY_TIMEOUT = 5000;
472 var LOW_PRIORITY_TIMEOUT = 10000; // Never times out
473
474 var IDLE_PRIORITY_TIMEOUT = maxSigned31BitInt; // Tasks are stored on a min heap
475
476 var taskQueue = [];
477 var timerQueue = []; // Incrementing id counter. Used to maintain insertion order.
478
479 var taskIdCounter = 1; // Pausing the scheduler is useful for debugging.
480 var currentTask = null;
481 var currentPriorityLevel = NormalPriority; // This is set while performing work, to prevent re-entrancy.
482
483 var isPerformingWork = false;
484 var isHostCallbackScheduled = false;
485 var isHostTimeoutScheduled = false;
486
487 function advanceTimers(currentTime) {
488 // Check for tasks that are no longer delayed and add them to the queue.
489 var timer = peek(timerQueue);
490
491 while (timer !== null) {
492 if (timer.callback === null) {
493 // Timer was cancelled.
494 pop(timerQueue);
495 } else if (timer.startTime <= currentTime) {
496 // Timer fired. Transfer to the task queue.
497 pop(timerQueue);
498 timer.sortIndex = timer.expirationTime;
499 push(taskQueue, timer);
500
501 {
502 markTaskStart(timer, currentTime);
503 timer.isQueued = true;
504 }
505 } else {
506 // Remaining timers are pending.
507 return;
508 }
509
510 timer = peek(timerQueue);
511 }
512 }
513
514 function handleTimeout(currentTime) {
515 isHostTimeoutScheduled = false;
516 advanceTimers(currentTime);
517
518 if (!isHostCallbackScheduled) {
519 if (peek(taskQueue) !== null) {
520 isHostCallbackScheduled = true;
521 requestHostCallback(flushWork);
522 } else {
523 var firstTimer = peek(timerQueue);
524
525 if (firstTimer !== null) {
526 requestHostTimeout(handleTimeout, firstTimer.startTime - currentTime);
527 }
528 }
529 }
530 }
531
532 function flushWork(hasTimeRemaining, initialTime) {
533 {
534 markSchedulerUnsuspended(initialTime);
535 } // We'll need a host callback the next time work is scheduled.
536
537
538 isHostCallbackScheduled = false;
539
540 if (isHostTimeoutScheduled) {
541 // We scheduled a timeout but it's no longer needed. Cancel it.
542 isHostTimeoutScheduled = false;
543 cancelHostTimeout();
544 }
545
546 isPerformingWork = true;
547 var previousPriorityLevel = currentPriorityLevel;
548
549 try {
550 if (enableProfiling) {
551 try {
552 return workLoop(hasTimeRemaining, initialTime);
553 } catch (error) {
554 if (currentTask !== null) {
555 var currentTime = getCurrentTime();
556 markTaskErrored(currentTask, currentTime);
557 currentTask.isQueued = false;
558 }
559
560 throw error;
561 }
562 } else {
563 // No catch in prod code path.
564 return workLoop(hasTimeRemaining, initialTime);
565 }
566 } finally {
567 currentTask = null;
568 currentPriorityLevel = previousPriorityLevel;
569 isPerformingWork = false;
570
571 {
572 var _currentTime = getCurrentTime();
573
574 markSchedulerSuspended(_currentTime);
575 }
576 }
577 }
578
579 function workLoop(hasTimeRemaining, initialTime) {
580 var currentTime = initialTime;
581 advanceTimers(currentTime);
582 currentTask = peek(taskQueue);
583
584 while (currentTask !== null && !(enableSchedulerDebugging )) {
585 if (currentTask.expirationTime > currentTime && (!hasTimeRemaining || shouldYieldToHost())) {
586 // This currentTask hasn't expired, and we've reached the deadline.
587 break;
588 }
589
590 var callback = currentTask.callback;
591
592 if (typeof callback === 'function') {
593 currentTask.callback = null;
594 currentPriorityLevel = currentTask.priorityLevel;
595 var didUserCallbackTimeout = currentTask.expirationTime <= currentTime;
596 markTaskRun(currentTask, currentTime);
597 var continuationCallback = callback(didUserCallbackTimeout);
598 currentTime = getCurrentTime();
599
600 if (typeof continuationCallback === 'function') {
601 currentTask.callback = continuationCallback;
602 markTaskYield(currentTask, currentTime);
603 } else {
604 {
605 markTaskCompleted(currentTask, currentTime);
606 currentTask.isQueued = false;
607 }
608
609 if (currentTask === peek(taskQueue)) {
610 pop(taskQueue);
611 }
612 }
613
614 advanceTimers(currentTime);
615 } else {
616 pop(taskQueue);
617 }
618
619 currentTask = peek(taskQueue);
620 } // Return whether there's additional work
621
622
623 if (currentTask !== null) {
624 return true;
625 } else {
626 var firstTimer = peek(timerQueue);
627
628 if (firstTimer !== null) {
629 requestHostTimeout(handleTimeout, firstTimer.startTime - currentTime);
630 }
631
632 return false;
633 }
634 }
635
636 function unstable_runWithPriority(priorityLevel, eventHandler) {
637 switch (priorityLevel) {
638 case ImmediatePriority:
639 case UserBlockingPriority:
640 case NormalPriority:
641 case LowPriority:
642 case IdlePriority:
643 break;
644
645 default:
646 priorityLevel = NormalPriority;
647 }
648
649 var previousPriorityLevel = currentPriorityLevel;
650 currentPriorityLevel = priorityLevel;
651
652 try {
653 return eventHandler();
654 } finally {
655 currentPriorityLevel = previousPriorityLevel;
656 }
657 }
658
659 function unstable_next(eventHandler) {
660 var priorityLevel;
661
662 switch (currentPriorityLevel) {
663 case ImmediatePriority:
664 case UserBlockingPriority:
665 case NormalPriority:
666 // Shift down to normal priority
667 priorityLevel = NormalPriority;
668 break;
669
670 default:
671 // Anything lower than normal priority should remain at the current level.
672 priorityLevel = currentPriorityLevel;
673 break;
674 }
675
676 var previousPriorityLevel = currentPriorityLevel;
677 currentPriorityLevel = priorityLevel;
678
679 try {
680 return eventHandler();
681 } finally {
682 currentPriorityLevel = previousPriorityLevel;
683 }
684 }
685
686 function unstable_wrapCallback(callback) {
687 var parentPriorityLevel = currentPriorityLevel;
688 return function () {
689 // This is a fork of runWithPriority, inlined for performance.
690 var previousPriorityLevel = currentPriorityLevel;
691 currentPriorityLevel = parentPriorityLevel;
692
693 try {
694 return callback.apply(this, arguments);
695 } finally {
696 currentPriorityLevel = previousPriorityLevel;
697 }
698 };
699 }
700
701 function unstable_scheduleCallback(priorityLevel, callback, options) {
702 var currentTime = getCurrentTime();
703 var startTime;
704
705 if (typeof options === 'object' && options !== null) {
706 var delay = options.delay;
707
708 if (typeof delay === 'number' && delay > 0) {
709 startTime = currentTime + delay;
710 } else {
711 startTime = currentTime;
712 }
713 } else {
714 startTime = currentTime;
715 }
716
717 var timeout;
718
719 switch (priorityLevel) {
720 case ImmediatePriority:
721 timeout = IMMEDIATE_PRIORITY_TIMEOUT;
722 break;
723
724 case UserBlockingPriority:
725 timeout = USER_BLOCKING_PRIORITY_TIMEOUT;
726 break;
727
728 case IdlePriority:
729 timeout = IDLE_PRIORITY_TIMEOUT;
730 break;
731
732 case LowPriority:
733 timeout = LOW_PRIORITY_TIMEOUT;
734 break;
735
736 case NormalPriority:
737 default:
738 timeout = NORMAL_PRIORITY_TIMEOUT;
739 break;
740 }
741
742 var expirationTime = startTime + timeout;
743 var newTask = {
744 id: taskIdCounter++,
745 callback: callback,
746 priorityLevel: priorityLevel,
747 startTime: startTime,
748 expirationTime: expirationTime,
749 sortIndex: -1
750 };
751
752 {
753 newTask.isQueued = false;
754 }
755
756 if (startTime > currentTime) {
757 // This is a delayed task.
758 newTask.sortIndex = startTime;
759 push(timerQueue, newTask);
760
761 if (peek(taskQueue) === null && newTask === peek(timerQueue)) {
762 // All tasks are delayed, and this is the task with the earliest delay.
763 if (isHostTimeoutScheduled) {
764 // Cancel an existing timeout.
765 cancelHostTimeout();
766 } else {
767 isHostTimeoutScheduled = true;
768 } // Schedule a timeout.
769
770
771 requestHostTimeout(handleTimeout, startTime - currentTime);
772 }
773 } else {
774 newTask.sortIndex = expirationTime;
775 push(taskQueue, newTask);
776
777 {
778 markTaskStart(newTask, currentTime);
779 newTask.isQueued = true;
780 } // Schedule a host callback, if needed. If we're already performing work,
781 // wait until the next time we yield.
782
783
784 if (!isHostCallbackScheduled && !isPerformingWork) {
785 isHostCallbackScheduled = true;
786 requestHostCallback(flushWork);
787 }
788 }
789
790 return newTask;
791 }
792
793 function unstable_pauseExecution() {
794 }
795
796 function unstable_continueExecution() {
797
798 if (!isHostCallbackScheduled && !isPerformingWork) {
799 isHostCallbackScheduled = true;
800 requestHostCallback(flushWork);
801 }
802 }
803
804 function unstable_getFirstCallbackNode() {
805 return peek(taskQueue);
806 }
807
808 function unstable_cancelCallback(task) {
809 {
810 if (task.isQueued) {
811 var currentTime = getCurrentTime();
812 markTaskCanceled(task, currentTime);
813 task.isQueued = false;
814 }
815 } // Null out the callback to indicate the task has been canceled. (Can't
816 // remove from the queue because you can't remove arbitrary nodes from an
817 // array based heap, only the first one.)
818
819
820 task.callback = null;
821 }
822
823 function unstable_getCurrentPriorityLevel() {
824 return currentPriorityLevel;
825 }
826
827 var unstable_requestPaint = requestPaint;
828 var unstable_Profiling = {
829 startLoggingProfilingEvents: startLoggingProfilingEvents,
830 stopLoggingProfilingEvents: stopLoggingProfilingEvents,
831 sharedProfilingBuffer: sharedProfilingBuffer
832 } ;
833
834 exports.unstable_IdlePriority = IdlePriority;
835 exports.unstable_ImmediatePriority = ImmediatePriority;
836 exports.unstable_LowPriority = LowPriority;
837 exports.unstable_NormalPriority = NormalPriority;
838 exports.unstable_Profiling = unstable_Profiling;
839 exports.unstable_UserBlockingPriority = UserBlockingPriority;
840 exports.unstable_advanceTime = unstable_advanceTime;
841 exports.unstable_cancelCallback = unstable_cancelCallback;
842 exports.unstable_clearYields = unstable_clearYields;
843 exports.unstable_continueExecution = unstable_continueExecution;
844 exports.unstable_flushAll = unstable_flushAll;
845 exports.unstable_flushAllWithoutAsserting = unstable_flushAllWithoutAsserting;
846 exports.unstable_flushExpired = unstable_flushExpired;
847 exports.unstable_flushNumberOfYields = unstable_flushNumberOfYields;
848 exports.unstable_flushUntilNextPaint = unstable_flushUntilNextPaint;
849 exports.unstable_forceFrameRate = forceFrameRate;
850 exports.unstable_getCurrentPriorityLevel = unstable_getCurrentPriorityLevel;
851 exports.unstable_getFirstCallbackNode = unstable_getFirstCallbackNode;
852 exports.unstable_next = unstable_next;
853 exports.unstable_now = getCurrentTime;
854 exports.unstable_pauseExecution = unstable_pauseExecution;
855 exports.unstable_requestPaint = unstable_requestPaint;
856 exports.unstable_runWithPriority = unstable_runWithPriority;
857 exports.unstable_scheduleCallback = unstable_scheduleCallback;
858 exports.unstable_shouldYield = shouldYieldToHost;
859 exports.unstable_wrapCallback = unstable_wrapCallback;
860 exports.unstable_yieldValue = unstable_yieldValue;
861
862})));