endolith

from __future__ import division
from numpy.fft import rfft
from numpy import argmax, mean, diff, log, nonzero
from scipy.signal import blackmanharris, correlate
from time import time
import sys
try:
    import soundfile as sf
except ImportError:
    from scikits.audiolab import flacread

jacquescrocker

commit 0f048706c04718c73ad1cc920225ff8d9008871a
Author: Jacques Crocker <railsjedi@gmail.com>
Date:   Sun Aug 29 16:52:25 2010 -0700

    asdklfjadklsfjlk

commit b45d683e1e64927941ee8e59e25c00f8b74101a8
Author: Jacques Crocker <railsjedi@gmail.com>
Date:   Sun Aug 29 16:49:06 2010 -0700

dperini

//
// Regular Expression for URL validation
//
// Author: Diego Perini
// Created: 2010/12/05
// Updated: 2018/09/12
// License: MIT
//
// Copyright (c) 2010-2018 Diego Perini (http://www.iport.it)
//

jgranick

<?xml version="1.0" encoding="utf-8"?>
<project>
	
	
	<!-- <meta />
		
		Use meta nodes to set metadata for your application. The description is ignored
		on most targets, but is useful for packaging like Chrome Apps or Opera Widgets.
		
		For compatibility with Android and webOS, the package name must include at least

bradmontgomery

Web Scraping Workshop

Using Requests and Beautiful Soup, with the most recent Beautiful Soup 4 docs.

Getting Started

Install our tools (preferably in a new virtualenv):

pip install beautifulsoup4

bmander

#define ADXL345_ADDR_ALT_LOW  0x53
#define FIMU_ACC_ADDR ADXL345_ADDR_ALT_LOW
#define ADXL345_POWER_CTL 0x2d
#define ADXL345_DATAX0 0x32
#define TO_READ (6)

#include <Wire.h>

int accelx;
int accely;

conorbuck

var p1 = {
	x: 20,
	y: 20
};

var p2 = {
	x: 40,
	y: 40
};

paulmillr

Most active GitHub users (git.io/top)

The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.

Only first 1000 GitHub users according to the count of followers are taken. This is because of limitations of GitHub search. Sorting algo in pseudocode:

githubUsers
 .filter(user => user.followers > 1000)

hellerbarde

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
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

vorburger

	/**
	 * Returns a free port number on localhost.
	 * 
	 * Heavily inspired from org.eclipse.jdt.launching.SocketUtil (to avoid a dependency to JDT just because of this).
	 * Slightly improved with close() missing in JDT. And throws exception instead of returning -1.
	 * 
	 * @return a free port number on localhost
	 * @throws IllegalStateException if unable to find a free port
	 */
	private static int findFreePort() {