baiyanhuang

#include <bits/stdc++.h>
#include <lab.H>
using namespace std;


float calculateDistance(int x, int y)
{
  return sqrt(x*x + y*y);
}

baiyanhuang

#pragma once
#include <atomic>
#include <algorithm>
#include "AlignAs.H"

/*
 * 1. release-acquire memory order
 * 2. false sharing and cache line
 * 3. alignas
 *

baiyanhuang

def look_and_say(member):
    while True:
        num = [] 
        count = []
        pre = None
        for ele in member:
            if len(num) > 0 and pre == ele:
                count[len(count)-1] += 1
            else:
                num += [ele]

baiyanhuang

// StlAlgo.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <vector>
#include <array>
#include <algorithm>
#include <iterator> // ostream_iterator
#include <iostream>

baiyanhuang

#include <iostream>

using namespace std;

// .data - read-write data
int rwdata = 100;

// .rodata - read-only data
const char* rodata = "hello, world";

baiyanhuang

use strict;

my $targetPage = $ARGV[0]; #http://www.kingtoo.com/reg/whois.asp?domain=douban.com
print $targetPage . "\n";
my @page = `curl $targetPage | iconv -f gb2312 -t utf8`;
chomp @page;

my $domainStatus;
for my $line (@page)
{

baiyanhuang

function printa(arr)
	for _, v in ipairs(arr) do
		io.write(v .. " ")
	end
	io.write("\n")
end

-- use consecutive number to represent the colors, like:
-- red: 1

baiyanhuang

LIBS = {}
DEPS = {}


EXPORTS = {'bar'}

bar = {}
function bar.use_nonpopular_bar()
    print 'bar.use_nonpopular_bar'
end

baiyanhuang

digraph
{
    subgraph cluster_solution
    {
        label="solution"
        App;
        foo;
        baz;
    }
    App -> foo;

baiyanhuang

function consumer(prod)
    while true do
        local x = receive(prod)
        print(x)
    end
end

function receive(prod)
    local status, value = coroutine.resume(prod)
    return value