xiaohanyu

@font-face {
    font-family: 'Linux Libertine'; /* normal */
    src: url('/static/fonts/linux-libertine/LinLibertine_R.woff') format('woff');
    font-weight: normal;
    font-style: normal;
}

@font-face {
    font-family: 'Linux Libertine'; /* italic */
    src: url('/static/fonts/linux-libertine/LinLibertine_RI.woff') format('woff');

xiaohanyu

This is a demo solution for exercise 10.1-1 of the famous CLRS’s Introduction to Algorithms, 3rd Edition book.

xiaohanyu

%% socket examples from Joe Armstrong's "Programming Erlang, Second Edition".
-module(socket_examples).
-compile(export_all).
-import(lists, [reverse/1]).

string2value(Str) ->
    {ok, Tokens, _} = erl_scan:string(Str ++ "."),
    {ok, Exprs} = erl_parse:parse_exprs(Tokens),
    Bindings = erl_eval:new_bindings(),
    {value, Value, _} = erl_eval:exprs(Exprs, Bindings),

xiaohanyu

import Data.List

perm :: (Eq a) => [a] -> Int -> [[a]]
perm _ 0 = [[]]
perm xs r | length xs < r = [[]]
          | otherwise = [x:ys | x <- xs, ys <- perm (delete x xs) (r - 1)]

xiaohanyu

This gist and its comments contains some topics for technology section of data weekly

xiaohanyu

# This file provide two pandoc filters for html and pdf output

module Nanoc::Filters

  class PandocHtml < Nanoc::Filter
    identifier :pandoc_html
    type :text => :text

    def run(content, params = {})
      input_format = case item[:extension]

xiaohanyu

%% udp test client and server, from joe armstrong's "programming erlang, second
%% edition"
-module(udp_test).
-export([start_server/0, client/1]).

start_server() ->
    spawn(fun() -> server(4000) end).

%% the server
server(port) ->

xiaohanyu

require 'json'
require 'yaml'

input_filename = ARGV[0]
output_filename = input_filename.sub(/(yml|yaml)$/, 'json')

input_file = File.open(input_filename, 'r')
input_yml = input_file.read
input_file.close

xiaohanyu

Problem

There’s a chess board of size $N × N$, and an piece Knight, which has the initial position $(x, y)$.

Knight can step by going forward or backward two units in one direction, and one units in the other direction.

Find a way to position $(N, N)$ for this Knight piece.

xiaohanyu

import unittest

def binary_search(array, t):
    l = 0
    h = len(array) - 1

    while (l <= h):
        m = (l + h) // 2
        if (array[m] == t):
            return m