nkbt

{
  "env": {
    "browser": true,
    "node": true,
    "es6": true
  },

  "plugins": ["react"],

  "ecmaFeatures": {

jbeda

This is taken directly from Figure 5.2 in http://nixos.org/~eelco/pubs/phd-thesis.pdf. It is presented here to be more directly linkable.

serialise(fso) = str("nix-archive-1") + serialise1(fso)

serialise1(fso) = str("(") + seralise2(fso) + str(")")

serialise2(type=Regular, exec, contents) =
  str("type") + str("regular")
 + (

chenglou

Interesting part (unmounting & API) is at the end if you're not interested in the rest =).

Stress Tests

This animation proposal is just an attempt. In case it doesn't work out, I've gathered a few examples that can test the power of a future animation system.

1. Parent is an infinitely spinning ball, and has a child ball that is also spinning. Clicking on the parent causes child to reverse spinning direction. This tests the ability of the animation system to compose animation, not in the sense of applying multiple interpolations to one or more variables passed onto the child (this should be trivial), but in the sense that the parent's constantly updating at the same time as the child, and has to ensure that it passes the animation commands correctly to it. This also tests that we can still intercept these animations (the clicking) and immediately change their configuration instead of queueing them.

2. Typing letters and let them fly in concurrently. This tests concurrency, coordination of an array of ch

sebmarkbage

import { Component } from "React";

export var Enhance = ComposedComponent => class extends Component {
  constructor() {
    this.state = { data: null };
  }
  componentDidMount() {
    this.setState({ data: 'Hello' });
  }
  render() {

rf-

#!/usr/bin/env python

import pynvim, os, re, sys, time

# Get a list of buffers that haven't been deleted. `nvim.buffers` includes
# buffers that have had `:bdelete` called on them and aren't in the buffer
# list, so we have to filter those out.
def get_listed_buffers(nvim):
    return set(buf.number for buf in nvim.buffers \
        if nvim.eval('buflisted(%d)' % buf.number))

zindel

Fastpack - pack JavaScript fast & easy

This gist is a submission for a lightning talk on the ReactiveConf 2018.

Why?

• JavaScript bundling can be a lot faster
• There are proper tools to guarantee consistency
• Writing OCaml code is fun!

lalinsky

<?php

	include "utils.php";

	$fp = parse_fp($_GET['fp']);

	$dbh = new PDO('mysql:host=localhost;dbname=fingerprint', 'fingerprint');

	$dbh->beginTransaction();
	$sth = $dbh->prepare("INSERT INTO fp (length) VALUES (?)");

gabe

require 'addressable/template'

module Juxt
  module Sinatra
    # Allows for declared, named URI Templates in Sinatra applications,
    # for both routing and URI generation.
    #
    # The URI generation method (included as a Sinatra helper) modifies
    # the path of generated URIs with request.script_name, meaning the
    # URIs generated will still be valid if multiple Sinatra applications

bootstrap-typeahead-backbone.js

/* =============================================================
 * bootstrap-typeahead-backbone.js v2.0.0
 * http://twitter.github.com/bootstrap/javascript.html#typeahead
 * https://github.com/twitter/bootstrap/blob/master/js/bootstrap-typeahead.js
 * Modified by Marius Andreiana to work with Backbone Collection, Model, View
 * - custom results formatting
 * - custom behavior on selected item (Model with complex information)
 * =============================================================
 * Copyright 2012 Twitter, Inc.
 *

Raynos

Programming with delayed computation

A delayed computation is a function that will do some computation when called. Because of the delayed nature the computation may be asynchronous so the function takes a callback.

Note: the term "delayed computation" is just a temporary name so we can talk about this idea, I do not recommend using this name as it's a) confusing and b) this concept is hard to name.