Andrew Spott spott

Busybox "Embedded Linux from Scratch" Distribution for the Beaglebone

Prepare your Build Sandbox

$ mkdir -p beaglelfs/{sources,rootfs_install,boot_mnt,rootfs_mnt}

Acquire an ARM Toolchain

Download the latest i686 Binary TAR of the ARM GNU/Linux (glibc-based) Lite Toolchain:

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

Locate the section for your github remote in the .git/config file. It looks like this:

[remote "origin"]
	fetch = +refs/heads/*:refs/remotes/origin/*
	url = git@github.com:joyent/node.git

Now add the line fetch = +refs/pull/*/head:refs/remotes/origin/pr/* to this section. Obviously, change the github url to match your project's URL. It ends up looking like this:

	#!/usr/bin/env python
	"""Outputs the WebKit cookies for a specified URL.
	Useful for wget'ing URLs which require authentication.

	$ python thisfile.py http://example.com > wgetcookies.txt
	$ wget --load-cookies wgetcookies.txt http://example.com/example.zip
	"""

	import objc
	from Foundation import NSHTTPCookieStorage, NSURL

	#!/bin/bash

	if [ "$1" = "-h" -o "$1" = "--help" -o -z "$1" ]; then cat <<EOF
	appify v3.0.1 for Mac OS X - http://mths.be/appify
	Creates the simplest possible Mac app from a shell script.

	Appify takes a shell script as its first argument:

	`basename "$0"` my-script.sh

	! From http://netlib.org/linalg/html_templates/node98.html
	!
	! val: non-zero values from the matrix
	! col_ind: indices into val at which columns start in successive rows
	! row_ptr: indices into val at which successive rows start

	for i = 1, n
	y(i) = 0
	for j = row_ptr(i), row_ptr(i+1) - 1
	y(i) = y(i) + val(j) * x(col_ind(j))

	"\e[1~": beginning-of-line
	"\e[4~": end-of-line
	"\e[5~": history-search-backward
	"\e[6~": history-search-forward
	"\e[3~": delete-char
	"\e[2~": quoted-insert
	"\e[5C": forward-word
	"\e[5D": backward-word
	"\e\e[C": forward-word
	"\e\e[D": backward-word

	#!/usr/bin/env sh

	##
	# This is script with usefull tips taken from:
	# https://github.com/mathiasbynens/dotfiles/blob/master/.osx
	#
	# install it:
	# curl -sL https://raw.github.com/gist/2108403/hack.sh \| sh
	#


	#include <type_traits>

	namespace detail {

	// No need to give up constexpr for std::forward
	template <class T>
	constexpr T && forward(typename std::remove_reference<T>::type & t) noexcept {
	return static_cast<T &&>(t);
	}

	#include <iostream>
	#include <utility>
	#include <tuple>
	using namespace std;

	//
	// forward declare
	//

	template<int N1, int N2, int LAST, typename T>