srolel

const robot = require('robot-js');
const { Keyboard, Mouse } = robot;

const keymap = {
    I: [0, -1],
    J: [-1, 0],
    L: [1, 0],
    K: [0, 1],
    E: [0, -1],
    S: [-1, 0],

srolel

ranks = [1,1,1,1]
links = [[1], [0], [0,3], [2]]
damping = 1

iterations = 100

for _ in range(0, iterations):
    contributions = [0,0,0,0]
    for i, page_links in enumerate(links):
        for link in page_links:

srolel

kubepods() {
    kubectl get pods --all-namespaces | grep $1 | awk '{print "--namespace="$1 " " $2}'
}

kubepod() {
    kubepods $1 | head -1
}

kubebash() {
    kubectl exec -ti $(kubepod $1) bash

srolel

##################
### config.yml ###
##################

version: 2
jobs:
    build:
        docker:
            - image: circleci/python:3.6
        steps:

srolel

import * as Knex from 'knex';

declare module "knex" {
    export const raw: (x: any) => void;
}

const knex = Knex({});

knex.raw("blah"); // from instance. defined in @types/knex
Knex.raw("blah"); // from 'constructor'. missing. What I am trying to augment

srolel

const applyMapFn = (fn, {value}, thisArg) => fn.apply(null, value.reverse());

const generators = {
    *filter([map, iteratee, thisArg]) {
        const iterator = map.entries();
        let nextItem = iterator.next();
        while (!nextItem.done)  {
          const {value} = nextItem;
          const result = iteratee.call(thisArg, value[1], value[0], map);
           if (result) {

srolel

let next, current = root, target = root
do {
  console.log(current.$$watchers)
  if (!(next = ((current.$$watchers.length && current.$$childHead) ||
                (current !== target && current.$$nextSibling)))) {
    while (current !== target && !(next = current.$$nextSibling)) {
      current = current.$parent;
    }
  }
} while ((current = next));

srolel

This document will list the subjects for the upcoming room meeting, scheduled for 2015-04-25.

Feel free to suggest topics in the comment section.

Topic List

1. subscription to javascript tag on codereview.stackexchange.com
2. Assigning people to execute room meeting (or other) conclusions.
3. Contributors to room rules.
4. Rss feeds.

srolel

/**
 * A doubly linked list-based Least Recently Used (LRU) cache. Will keep most
 * recently used items while discarding least recently used items when its limit
 * is reached.
 *
 * Licensed under MIT. Copyright (c) 2010 Rasmus Andersson <http://hunch.se/>
 * See README.md for details.
 *
 * Illustration of the design:
 *

srolel

%lex
%%

\s+                   /* skip whitespace */
[0-9]+("."[0-9]+)?\b  return 'NUMBER'
true|false             return 'BOOLEAN'
(\$|[a-z])([a-z0-9_$])* return 'IDENTIFIER'
(\'|\")(\\.|[^\"])*(\'|\") return 'STRING'
"*"                   return '*'
"/"                   return '/'