brugnara

This gist is an implementation of http://sirile.github.io/2015/05/18/using-haproxy-and-consul-for-dynamic-service-discovery-on-docker.html on top of Docker Machine and Docker Swarm.

brugnara

Macvlan, Ipvlan and 802.1q Trunk Driver Notes

Contents

• Getting Started - Download and Install the Experimental Driver

• MacVlan Bridge Mode Example Usage

• Ipvlan L2 Mode Example Usage

brugnara

#!/usr/bin/env node

var cordova_util = require('cordova-lib/src/cordova/util');
var projectRoot = cordova_util.isCordova(process.cwd());
var projectXml = cordova_util.projectConfig(projectRoot);
var ConfigParser = require('cordova-lib/src/ConfigParser/ConfigParser');
var projectConfig = new ConfigParser(projectXml);
projectConfig.name();

var fs = require ('fs');

brugnara

#!/bin/sh

#
# Daniele Brugnara 
#
# usage:
# meteor mongo xyz.meteor.com --url | ./do.sh
#

read mongo_auth

brugnara

var request = require('request');
var path = require('path');
var fs = require('fs');

var filename = process.argv[2];

var target = 'http://localhost:3000/upload/' + path.basename(filename);

var rs = fs.createReadStream(filename);
var ws = request.post(target);

brugnara

var i = 0;

setInterval(function() {
  if (i++ % 2) {
    console.log('I\'m the child!');
  } else {
    console.error('I\'m the child!');
  }
}, 1500);

brugnara

func totalNQueens(n int) int {
    if n == 1 {
        return 1
    }
    
    board := make([][]bool, n)
    
    for i:=0;i<n;i++ {
        board[i] = make([]bool, n)
    }

brugnara

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func printBST(root *TreeNode) {
    chn := make(chan int)

brugnara

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func loopBST(root *TreeNode) bool {
    if root == nil {

brugnara

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func lcaDeepestLeaves(root *TreeNode) *TreeNode {
    levels := map[int][]*TreeNode{}