Dan Goldin dangoldin

## stringart.py
import collections
import math
import os
import cv2
import numpy as np
import time

MAX_LINES = 4000
N_PINS = 36*8
MIN_LOOP = 20               # To avoid getting stuck in a loop

## requirements.txt

-e git://github.com/kennethreitz/inbox.py.git@551b4f44b144564504c687cebdb4c543cb8e9adf#egg=inbox

alembic==0.8.3
amqp==1.4.9
anyjson==0.3.3
boto==2.39.0
braintree==3.20.0
cairosvg==1.0.19
celery==3.1.20

## mandelbrot.sql
WITH RECURSIVE
    x(i) AS ( VALUES (0)
              UNION ALL SELECT i + 1
                        FROM x
                        WHERE i < 101),
    Z(Ix, Iy, Cx, Cy, X, Y, I) AS (
    SELECT
      Ix,
      Iy,
      X :: FLOAT,

## The Three Go Landmines.markdown

      
              1 file
            
          
              34 forks
            
          
              11 comments
            
          
              282 stars
            
          
                lavalamp
                / The Three Go Landmines.markdown
            
            
              Last active
              February 16, 2024 12:16
            
              
                Golang landmines
              
          
    There are three easy to make mistakes in go. I present them here in the way they are often found in the wild, not in the way that is easiest to understand.
All three of these mistakes have been made in Kubernetes code, getting past code review at least once each that I know of.

Loop variables are scoped outside the loop.

What do these lines do? Make predictions and then scroll down.
func print(pi *int) { fmt.Println(*pi) }

  
## a.c
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<sys/mman.h>
typedef void V;typedef int I;typedef double F;typedef unsigned char C,*S;typedef long L;
#define O           printf
#define R           return
#define I(a...)     if(a)
#define W(a...)     while(a)

## latency.markdown

      
              3 files
            
          
              30 forks
            
          
              0 comments
            
          
              248 stars
            
          
                seboudry
                / latency.markdown
            
            
              Last active
              February 15, 2023 12:45
                — forked from hellerbarde/latency.markdown
            
          
    Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns                     on recent CPU
L2 cache reference ........................... 7 ns                     14x L1 cache
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns                     20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs 4X memory

  
## elasticsearch.md

      
              1 file
            
          
              21 forks
            
          
              10 comments
            
          
              86 stars
            
          
                dominicsayers
                / elasticsearch.md
            
            
              Last active
              March 2, 2024 15:52
            
              
                Configuring ElasticSearch to use less memory
              
          
    What I actually did

/etc/security/limits.conf
elasticsearch hard memlock 100000

/etc/default/elasticsearch

  
## bootstrap.flatten.css
/* Flatten das boostrap */
.well, .navbar-inner, .popover, .btn, .tooltip, input, select, textarea, pre, .progress, .modal, .add-on, .alert, .table-bordered, .nav>.active>a, .dropdown-menu, .tooltip-inner, .badge, .label, .img-polaroid {
 	-moz-box-shadow: none !important;
	-webkit-box-shadow: none !important;
	box-shadow: none !important;
	-webkit-border-radius: 0px !important;
	-moz-border-radius: 0px !important;
	border-radius: 0px !important;
	border-collapse: collapse !important;
	background-image: none !important;

## Backend Architectures Keywords and References.md

      
              1 file
            
          
              181 forks
            
          
              15 comments
            
          
              993 stars
            
          
                ragingwind
                / Backend Architectures Keywords and References.md
            
            
              Last active
              April 17, 2024 10:51
            
              
                Backend Architectures Keywords and References
              
          
    Backend Architectures

Twitter

ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats

Introduce Gizzard of Twitter - 트위터의 새로운 분산 관리 라이브러리 Gizzard를 소개합니다.
The Architecture Twitter Uses to Deal with 150M Active Users, 300K QPS, a 22 MB/S Firehose, and Send Tweets in Under 5 Seconds
Scaling Twitter: Making Twitter 10000 Percent Faster


## d3.html
<!DOCTYPE html>
<html>
  <head>
    <script type="text/javascript" src="http://mbostock.github.com/d3/d3.js"></script>
    <script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jquery/1.7.2/jquery.min.js"></script>
  </head>
  <body>
    <table id="split">
      <thead></thead>
      <tbody></tbody>
	import collections
	import math
	import os
	import cv2
	import numpy as np
	import time

	MAX_LINES = 4000
	N_PINS = 36*8
	MIN_LOOP = 20 # To avoid getting stuck in a loop

	-e git://github.com/kennethreitz/inbox.py.git@551b4f44b144564504c687cebdb4c543cb8e9adf#egg=inbox

	alembic==0.8.3
	amqp==1.4.9
	anyjson==0.3.3
	boto==2.39.0
	braintree==3.20.0
	cairosvg==1.0.19
	celery==3.1.20
	WITH RECURSIVE
	x(i) AS ( VALUES (0)
	UNION ALL SELECT i + 1
	FROM x
	WHERE i < 101),
	Z(Ix, Iy, Cx, Cy, X, Y, I) AS (
	SELECT
	Ix,
	Iy,
	X :: FLOAT,
	#include<stdio.h>
	#include<string.h>
	#include<stdlib.h>
	#include<sys/mman.h>
	typedef void V;typedef int I;typedef double F;typedef unsigned char C,*S;typedef long L;
	#define O printf
	#define R return
	#define I(a...) if(a)
	#define W(a...) while(a)
	/* Flatten das boostrap */
	.well, .navbar-inner, .popover, .btn, .tooltip, input, select, textarea, pre, .progress, .modal, .add-on, .alert, .table-bordered, .nav>.active>a, .dropdown-menu, .tooltip-inner, .badge, .label, .img-polaroid {
	-moz-box-shadow: none !important;
	-webkit-box-shadow: none !important;
	box-shadow: none !important;
	-webkit-border-radius: 0px !important;
	-moz-border-radius: 0px !important;
	border-radius: 0px !important;
	border-collapse: collapse !important;
	background-image: none !important;
	<!DOCTYPE html>
	<html>
	<head>
	<script type="text/javascript" src="http://mbostock.github.com/d3/d3.js"></script>
	<script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jquery/1.7.2/jquery.min.js"></script>
	</head>
	<body>
	<table id="split">
	<thead></thead>
	<tbody></tbody>