waggertron

// === Arrays

var [a, b] = [1, 2];
console.log(a, b);
//=> 1 2


// Use from functions, only select from pattern
var foo = () => [1, 2, 3];

waggertron

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.

---

waggertron

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.

---

waggertron

/*
  array implementation of a binary heap, example usage:

  // can optionally provide a comparison function, a function for a max
  // heap is the default if no comparison function is provided
  var bh = binaryHeap();
  bh.push(5);
  bh.push(34);
  bh.push(16);
  var max = bh.pop(); // 34

waggertron

var db = mongoose.connect('mongodb://localhost:27017/DB'); 

// In middleware
app.use(function (req, res, next) {

  // action after response
  var afterResponse = function() {
   logger.info({req: req}, "End request");

    // any other clean ups

waggertron

var redis = require("redis")
  , subscriber = redis.createClient()
  , publisher  = redis.createClient();

subscriber.on("message", function(channel, message) {
  console.log("Message '" + message + "' on channel '" + channel + "' arrived!")
});

subscriber.subscribe("test");

waggertron

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
char * char_repeat( int n, char c ) {
  char * dest = malloc(n+1);
  memset(dest, c, n);
  dest[n] = '\0';
  return dest;
}

waggertron

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
 
char * char_repeat( int n, char c ) {
  char * dest = malloc(n+2);
  memset(dest, c, n);
  dest[n] = '\n';
  dest[n + 1] = '\0';
  return dest;

waggertron

// https://www.reddit.com/r/dailyprogrammer/comments/98ufvz/20180820_challenge_366_easy_word_funnel_1/

const fs = require('fs');
const { promisify } = require('util');

const readFilePromise = promisify(fs.readFile);

const makeWordSet = async file => new Set((await promisify(fs.readFile)(file, 'utf8')).split('\n'));

function funnel(word1, word2) {

waggertron

const git = require('nodegit')
const fs = require('fs-extra')
const { URL } = require('url')
const REPO_URL = 'git@github.com:org/path.git'
const CLONE_DIR = '/tmp/private-repo-clone-test'

;(async () => {
  await fs.emptyDir(CLONE_DIR)
  let authAttempted = false
  await git.Clone.clone(REPO_URL, CLONE_DIR, {