Xiao-Hu Tai xiaohutai

Pagination 101

Article by Faruk Ateş, [originally on KuraFire.net][original] which is currently down

One of the most commonly overlooked and under-refined elements of a website is its pagination controls. In many cases, these are treated as an afterthought. I rarely come across a website that has decent pagination, and it always makes me wonder why so few manage to get it right. After all, I'd say that pagination is pretty easy to get right. Alas, that doesn't seem the case, so after encouragement from Chris Messina on Flickr I decided to write my Pagination 101, hopefully it'll give you some clues as to what makes good pagination.

Before going into analyzing good and bad pagination, I want to explain just what I consider to be pagination: Pagination is any kind of control system that lets the user browse through pages of search results, archives, or any other kind of continued content. Search results are the o

How to have local versions of tracked config files in git

This is a fairly common question, and there isn't a One True Answer.

These are the most common techniques:

If you can modify your application

A good commit message looks like this:

Header line: explaining the commit in one line

Body of commit message is a few lines of text, explaining things
in more detail, possibly giving some background about the issue
being fixed, etc etc.

The body of the commit message can be several paragraphs, and
please do proper word-wrap and keep columns shorter than about

Moving from jQuery

Events

// jQuery
$(document).ready(function() {
  // code
})

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

	ּ_בּ
	בּ_בּ
	טּ_טּ
	כּ‗כּ
	לּ_לּ
	מּ_מּ
	סּ_סּ
	תּ_תּ
	٩(×̯×)۶
	٩(̾●̮̮̃̾•̃̾)۶

	# To check if this is up-to-date with the tax rates go to
	# http://www.expatax.nl/tax-rates-2016.php and see if there's anything
	# newer there.
	#
	# I make no guarantees that any of this is correct. I calculated this
	# at the time and have been updating it when new tax rates come along
	# because people keep finding this useful.
	#
	# There's also an interactive JS version of this created by
	# @stevermeister at

	<!doctype html>
	<html>
	<head>
	<meta charset="utf-8">
	<meta name="viewport" content="width=device-width, initial-scale=1" />
	<title>Enterprisify your Java Class Names! (by Hay Kranen)</title>
	<style>
	body {
	background: white;
	text-align: center;

	Array functions:
	array_search $needle, $haystack
	in_array $needle, $haystack

	String functions:
	strchr $haystack, $needle
	stripos $haystack, $needle
	stristr $haystack, $needle
	strpos $haystack, $needle
	strrchr $haystack, $needle

	<?php
	function get_ip_address() {
	$ip_keys = array('HTTP_CLIENT_IP', 'HTTP_X_FORWARDED_FOR', 'HTTP_X_FORWARDED', 'HTTP_X_CLUSTER_CLIENT_IP', 'HTTP_FORWARDED_FOR', 'HTTP_FORWARDED', 'REMOTE_ADDR');
	foreach ($ip_keys as $key) {
	if (array_key_exists($key, $_SERVER) === true) {
	foreach (explode(',', $_SERVER[$key]) as $ip) {
	// trim for safety measures
	$ip = trim($ip);
	// attempt to validate IP
	if (validate_ip($ip)) {