Baiyan Huang baiyanhuang

## generate.lua
-- this version is very slow, as every time we update the buffer, we creating a new string, which
-- makes the original buffer unreferenced. and lua's gc will kicks in often to clean up memory
-- which is really realy slow.
local file = io.open("file.txt", "w")
local buffer = ''
for i = 1, 500000000 do
        local n = i % math.random(10000)
        local str = string.format("This is a number %d\n", n)
        buffer = buffer .. str -- make the original string buffer unreferenced
        if i % 10000 == 0 then

## lua-premake4.lua
solution 'lua'
	configurations {'Debug', 'Release'}
	platforms {'x32', 'x64'}

	if os.get() == "windows" then
		defines '_CRT_SECURE_NO_WARNINGS'
	end

	-- the lua library
	project 'lualib'

## Program.cs
// The code below would print overlapped A and B sequences like:
// ...
// A
// A
// B
// B
// ...
//
// Please add multi-threading protection code to make sure that
// As and Bs are printed in the order of:

## palindromelist.cpp
/**
 * Given a circular single linked list and the start pointer, check if it is a palindrome
 * use a slow/fast pointer + stack is an elegant way
 * tip: wheneve there is a circular linked list, think about using slow/fast pointer
 */

#include <iostream>
#include <stack>
using namespace std;

## BaseConstructor.java
class BaseConstructor
{
	static class Base
	{
		{
			System.out.println("Base initialize block");
		}
		Base()
		{
			System.out.println("Base()");

## popoverhold.html
<head language="en">
	<meta charset="utf-8">
	<title> bootstrap testing</title>
	<link href="bootstrap/css/bootstrap.css" rel="stylesheet">
	<script src="jquery-1.7.2.js"> </script>
	<script src="bootstrap/js/bootstrap.js"> </script>
	<style type="text/css">
		.myClass{ position: relative;}
	</style>
</head>

## largestsum.lua
--
-- Given an array, get the sub sequence that of larget sum.
--
function printArray(array)
	for i=1, #array do
		io.write(array[i]) -- parameter is a variable, () can't be ignored.
		io.write(" ")
	end
end

## quoted-x.pl
use strict;
use diagnostics;
use warnings;
use sigtrap;

my $name = "**value**";
# q = single quote
print q('hello, world');
print "\n";
print q("hello, world");

## ProxyTest.java
package baiyanhuang;

import java.lang.reflect.InvocationHandler;
import java.lang.reflect.Method;
import java.lang.reflect.Proxy;
import java.util.Arrays;
import java.util.Random;

/**
 * Learn Java's dynamic proxy (in reflection)

## initarray.cpp
#include <iostream>

using namespace std;


int main()
{
    // initialize stack array variable
    int x[] = {1, 3, 4};
    int b[][2] = {{1, 2}, {3, 4}};
	-- this version is very slow, as every time we update the buffer, we creating a new string, which
	-- makes the original buffer unreferenced. and lua's gc will kicks in often to clean up memory
	-- which is really realy slow.
	local file = io.open("file.txt", "w")
	local buffer = ''
	for i = 1, 500000000 do
	local n = i % math.random(10000)
	local str = string.format("This is a number %d\n", n)
	buffer = buffer .. str -- make the original string buffer unreferenced
	if i % 10000 == 0 then
	solution 'lua'
	configurations {'Debug', 'Release'}
	platforms {'x32', 'x64'}

	if os.get() == "windows" then
	defines '_CRT_SECURE_NO_WARNINGS'
	end

	-- the lua library
	project 'lualib'
	// The code below would print overlapped A and B sequences like:
	// ...
	// A
	// A
	// B
	// B
	// ...
	//
	// Please add multi-threading protection code to make sure that
	// As and Bs are printed in the order of:
	/**
	* Given a circular single linked list and the start pointer, check if it is a palindrome
	* use a slow/fast pointer + stack is an elegant way
	* tip: wheneve there is a circular linked list, think about using slow/fast pointer
	*/

	#include <iostream>
	#include <stack>
	using namespace std;
	class BaseConstructor
	{
	static class Base
	{
	{
	System.out.println("Base initialize block");
	}
	Base()
	{
	System.out.println("Base()");
	<head language="en">
	<meta charset="utf-8">
	<title> bootstrap testing</title>
	<link href="bootstrap/css/bootstrap.css" rel="stylesheet">
	<script src="jquery-1.7.2.js"> </script>
	<script src="bootstrap/js/bootstrap.js"> </script>
	<style type="text/css">
	.myClass{ position: relative;}
	</style>
	</head>
	--
	-- Given an array, get the sub sequence that of larget sum.
	--
	function printArray(array)
	for i=1, #array do
	io.write(array[i]) -- parameter is a variable, () can't be ignored.
	io.write(" ")
	end
	end
	use strict;
	use diagnostics;
	use warnings;
	use sigtrap;

	my $name = "value";
	# q = single quote
	print q('hello, world');
	print "\n";
	print q("hello, world");
	package baiyanhuang;

	import java.lang.reflect.InvocationHandler;
	import java.lang.reflect.Method;
	import java.lang.reflect.Proxy;
	import java.util.Arrays;
	import java.util.Random;

	/**
	* Learn Java's dynamic proxy (in reflection)
	#include <iostream>

	using namespace std;


	int main()
	{
	// initialize stack array variable
	int x[] = {1, 3, 4};
	int b[][2] = {{1, 2}, {3, 4}};