h0n9xu hongxuchen

set http or socks proxy environment variables

# set http proxy
export http_proxy=http://PROXYHOST:PROXYPORT

# set http proxy with user and password
export http_proxy=http://USERNAME:PASSWORD@PROXYHOST:PROXYPORT

# set http proxy with user and password (with special characters)

The right way to override any highlighting if you don't want to edit the colorscheme file directly

Generalities first

Suppose you have weird taste and you absolutely want:

your visual selection to always have a green background and black foreground,
your active statusline to always have a white background and red foreground,
your very own deep blue background.

Achieving warp speed with Rust

Learning FP the hard way: Experiences on the Elm language

by Ossi Hanhinen, @ohanhi

with the support of Futurice 💚.

Licensed under CC BY 4.0.

Editorial note

2016

2015

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

	/**
	* Solves the n-Queen puzzle in O(n!)
	* Let p[r] be the column of the queen on the rth row (must be exactly 1 queen per row)
	* There also must be exactly 1 queen per column and hence p must be a permuation of (0 until n)
	* There must be n distinct (col + diag) and n distinct (col - diag) for each queen (else bishop attacks)
	* @return returns a Iterator of solutions
	* Each solution is an array p of length n such that p[i] is the column of the queen on the ith row
	*/
	def nQueens(n: Int): Iterator[Seq[Int]] =
	(0 until n)

	#include <netdb.h>
	#include <stdio.h>
	#include <stdlib.h>
	#include <string.h>
	#include <errno.h>
	#include <gnu/libc-version.h>
	#define CANARY "in_the_coal_mine"
	struct {
	char buffer[1024];
	char canary[sizeof(CANARY)];

	(* How do to topology in Coq if you are secretly an HOL fan.
	We will not use type classes or canonical structures because they
	count as "advanced" technology. But we will use notations.
	*)

	(* We think of subsets as propositional functions.
	Thus, if [A] is a type [x : A] and [U] is a subset of [A],
	[U x] means "[x] is an element of [U]".
	*)
	Definition P (A : Type) := A -> Prop.

	// This pass replaces op a, b with the result of op.overflow(a, b),
	// if op.overflow exists and dominates op a, b.

	#define DEBUG_TYPE "overflow-combine"
	#include <llvm/IRBuilder.h>
	#include <llvm/Instructions.h>
	#include <llvm/IntrinsicInst.h>
	#include <llvm/Pass.h>
	#include <llvm/Analysis/Dominators.h>
	#include <llvm/Support/InstIterator.h>