jorendorff

// Basic getExecutionCounts test.                                                                                                      

var g = newGlobal('new-compartment');
var dbg = Debugger(g);
var s;
dbg.onNewScript = function (script) { s = script; };
var f = g.Function("i",
                   "line0 = Error().lineNumber;\n" +
                   "var s = 0;\n" +                   // line0 + 1                                                                     
	           "for (var a = 0; a < i; a++)\n" +  // line0 + 2                                                                     

jorendorff

        123
       ↙   ↖
    231  →   312

        132
       ↙   ↖
    321  →   213

jorendorff

  /**
   *  @brief Finds the first position in which @a val could be inserted
   *         without changing the ordering.
   *  @param  first   An iterator.
   *  @param  last    Another iterator.
   *  @param  val     The search term.
   *  @return  An iterator pointing to the first element "not less than" @a val,
   *           or end() if every element is less than @a val.
   *  @ingroup binarysearch
  */

jorendorff

function f() {
    var a = [1, 0.5, 1];
    var b;
    for (var j = 0; j < a.length; j++) {
	var z = -a[j];
	if (b === undefined || z < b)
	    b = z;
    }
}

jorendorff

for (let V = INIT; TEST; UPD) STMT

===>

{
    let %tmp = INIT, %first = true;
    while (true) {
        // A fresh binding for V gets either the initializer-expression value(s)
        // or the value(s) from the end of the previous loop iteration.
        let V = %tmp;

jorendorff

// *** design #1

if (!forOf(cx, obj, [cx] (const Value &v) {
    ...
})) {
    return false;
}


// *** design #2

jorendorff

/*
 * This is for writing C++ code that does the equivalent of JS try/finally.
 * Normal infallible C++ cleanup code should just go in a C++ destructor.
 * This is for cleanup that should be *skipped* in the unusual case that
 * the try block exits with an uncatchable error (OOM or timeout).
 *
 * Use it like this:
 *
 *  bool ok;
 *  ... YOUR TRY-BLOCK CODE HERE ...

jorendorff

// *** Design #1: helper class

    if (AutoFinallyBlock afb(cx, ok)) {
        bool closedOK = CLOSE THE ITERATOR;
        ok = afb.leave(closedOK);
    }

// *** Design #2: no helper class

    if (ok || cx->isExceptionPending()) {

jorendorff

# This program is valid Python 2.7 and it's also valid Python 3.2.
# To run it, type:  python hashfiles.py
import os, hashlib, collections

# What is a defaultdict? Some sort of data structure, apparently. Hmm.
file_groups = collections.defaultdict(list)

# This loop is going to execute once for each directory in the tree.
for dirpath, dirnames, filenames in os.walk('.'):
    # The inner loop will run once for each file in the tree.

jorendorff

// Run this
//     in Scratchpad
//     in the *target* Firefox
//     using Environment -> Browser
//     before opening the script debugger in the other Firefox.

Components.utils.import("resource://gre/modules/devtools/dbg-server.jsm");

function allowDebuggersToConnect() {
  const DEBUGGER_PORT = 60000;