dherman

function bufferBytes(buffer) {
  return [].map.call(new Uint8Array(buffer), function(x) {return x})
}

function nanBytes(nan) {
  var a = new Float64Array(1);
  a[0] = nan;
  return bufferBytes(a.buffer);
}

WebReflection

/*!(C) WebReflection *//** @license Mit Style */
// inspired by https://gist.github.com/4395291
this.inherit || (this.inherit = function(create){
  if (!create) {
    if ({__proto__:null} instanceof Object) {
      for (var
        Null = function Null() {},
        doc = document,
        html = doc.documentElement,
        iframe = html.insertBefore(

junosuarez

in
was
the
of
her
and
his
he
you
for

jameswomack

Function.prototype.runOnBackgroundThread = function (aCallback) {
  var _blob = new Blob(['onmessage = '+this.toString()],{"type":"text/javascript"});
  var _worker = new Worker((webkitURL.createObjectURL || URL.createObjectURL)(_blob));
  _worker.onmessage = aCallback;
  _worker.postMessage();
}

var _test = function () {
  postMessage((1+1).toString());
}

bobrik

(function(module) {
    var Benchmark  = require('../vendor/benchmark.js/benchmark.js'),
        _          = require('../vendor/underscore/underscore.js'),
        lodash     = require('../lodash.js');


    var numbers     = [],
        fourNumbers = [5, 25, 10, 30],
        twoNumbers  = [12, 21],
        i;

paulmillr

Most active GitHub users (git.io/top)

The list would not be updated for now. Don't write comments.

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.

Because of GitHub search limitations, only 1000 first users according to amount of followers are included. If you are not in the list you don't have enough followers. See raw data and source code. Algorithm in pseudocode:

githubUsers

ralphholzmann

var obj = {
    "ralph" : 1,
    "jon" : 2,
    "alex" : 3
};

function _with( fn, data ) {
   
    var keys   = Object.keys( data ),
        values = keys.map(function( key ) {

slevithan

// Simulating infinite-length leading lookbehind in JavaScript. Uses XRegExp.
// Captures within lookbehind are not included in match results. Lazy
// repetition in lookbehind may lead to unexpected results.

(function (XRegExp) {

    function prepareLb(lb) {
        // Allow mode modifier before lookbehind
        var parts = /^((?:\(\?[\w$]+\))?)\(\?<([=!])([\s\S]*)\)$/.exec(lb);
        return {

paulirish

// http://paulirish.com/2011/requestanimationframe-for-smart-animating/
// http://my.opera.com/emoller/blog/2011/12/20/requestanimationframe-for-smart-er-animating

// requestAnimationFrame polyfill by Erik Möller. fixes from Paul Irish and Tino Zijdel

// MIT license

(function() {
    var lastTime = 0;
    var vendors = ['ms', 'moz', 'webkit', 'o'];

jonathantneal

innerWidth / innerHeight tests @ http://sandbox.thewikies.com/orientation/

--------------------------------------------------------------------------------

Tested (14 devices, 28 browsers):
	Droid 2 Global Android 2.2
	iPhone 4 iOS5 (Safari, Opera Mini)
	Motorola Atrix Android 2.3.4 (Stock browser, Dolphin, Skyfire, Opera Mini, Firefox)
	Samsung Galaxy S9000 Android 2.3 (Webkit, Opera Mobile)
	Samsung Galaxy Y Android 2.3.5