dcower

function search_and_remove() {
  // Search for crashed windows and tabs. Reverse the list so that we delete
  // from the bottom, which is MUCH faster.
  elements = Array.from(document.querySelectorAll('li.savedwinNTASC,li.savedtabNTASC')).reverse();

  if (elements.length == 0) {
    console.log("Finished removing stale windows and tabs.");
    return;
  }

lawloretienne

Table Of Contents

• Data Structures
  • Linked Lists
  • Trees
    • Binary Trees
    • Binary Search Tree
    • Red-Black Tree
    • AVL Tree
• Tries

staltz

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---