File: result_queue.js

package info (click to toggle)
chromium 139.0.7258.127-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,122,068 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (39 lines) | stat: -rw-r--r-- 1,144 bytes parent folder | download | duplicates (6)
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
// Copyright 2017 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

// Queue storing asynchronous results. Results are available via `pop` when
// requested.
function ResultQueue() {
  // Invariant: this.queue.length == 0 || this.pendingGets.length == 0
  this.queue = [];
  this.pendingGets = [];
}

// Adds a data item to the queue or sends it to the earliest pending `pop`
// operation.
ResultQueue.prototype.push = function(data) {
  if (this.pendingGets.length > 0) {
    const resolve = this.pendingGets.pop();
    resolve(data);
  } else {
    this.queue.unshift(data);
  }
};

// Returns a promise that resolves with the next data item, when available.
ResultQueue.prototype.pop = function() {
  return new Promise((resolve) => {
    if (this.queue.length) {
      resolve(this.queue.pop());
    } else {
      this.pendingGets.unshift(resolve);
    }
  });
};

// Immediately returns the next data item if it is available, otherwise returns
// null.
ResultQueue.prototype.popImmediately = function() {
  return this.queue.length ? this.queue.pop() : null;
};