yuvipanda

The number of 1's in the range 0..X (X is positive) is easy to calculate (Can you get a simple recurrence which does this in O(log X) ?) Another observation is that the number of 1's in -X is equal to the number of 0's in ~(-X) = X - 1. Using this, it is easy to calculate the answer for negative ranges as well.

chrsan

package se.fishtank;

import java.net.URI;
import java.util.Map;

import ch.qos.logback.classic.spi.ILoggingEvent;
import ch.qos.logback.core.sift.Discriminator;
import ch.qos.logback.core.spi.ContextAwareBase;

public class AkkaSourceDiscriminator extends ContextAwareBase implements Discriminator<ILoggingEvent> {

gist:3805751

The Ying-Yang of CEOs and Engineers

All successful startups begin with two founders. One guy is the Engineer, and the other guy is the business dude. Over the years of working with various people, I've learned what makes a good engineer, and what makes a good business dude, and the two are complete opposites of each other.

CEO	Engineer

donovanhide

// func GetCpuForThread() uint64
TEXT ·GetCpuForThread(SB),7,$0
	MOVQ $0xB,AX
	XORQ CX,CX
	CPUID
	MOVQ DX,ret+0(FP)
	RET

viktorklang

/*
Copyright 2018 Viktor Klang
 
   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at
 
       http://www.apache.org/licenses/LICENSE-2.0
 
   Unless required by applicable law or agreed to in writing, software

joemiller

#!/bin/bash
#
# this script will attempt to detect any ephemeral drives on an EC2 node and create a RAID-0 stripe
# mounted at /mnt. It should be run early on the first boot of the system.
#
# Beware, This script is NOT fully idempotent.
#

METADATA_URL_BASE="http://169.254.169.254/2012-01-12"

jboner

Akka Cluster Implementation Notes

Slightly disorganized but reasonably complete notes on the algorithms, strategies and optimizations of the Akka Cluster implementation. Could use a lot more links and context etc., but was just written for my own understanding. Might be expanded later.

Links to papers and talks that have inspired the implementation can be found on the 10 last pages of this presentation.

Akka Gossip

Gossip state

This is the Gossip state representation:

neerav1985

from numpy import *
from scipy.stats import norm
from scipy.optimize import root, fsolve, newton
import logging
 
logging.basicConfig(format='%(asctime)s %(levelname)s %(message)s', level=logging.DEBUG)
 
 
def BlackScholesCall(S, K, T, sigma, r = 0., q = 0.):
        #logging.debug("S=" + str(S) + ",K=" +  str(K) + ",T=" +  str(T) + ",sigma=" +  str(sigma) + ",r=" + str(r) + ",q=" +  str(q) )

quiiver

package com.twitter.scalding.sources

import cascading.tuple.Fields
import cascading.tap.Tap;
import org.elasticsearch.hadoop.cascading.EsTap

import com.twitter.scalding._

abstract class ElasticsearchSource extends Source {

hyg

func openbrowser(url string) {
	var err error

	switch runtime.GOOS {
	case "linux":
		err = exec.Command("xdg-open", url).Start()
	case "windows":
		err = exec.Command("rundll32", "url.dll,FileProtocolHandler", url).Start()
	case "darwin":
		err = exec.Command("open", url).Start()