Tony Pai tpai

Taroko Software

Team Member、技術含量、公司產品、背景、未來計畫、人員組成、周邊環境、面試流程、相關人員積極度以及 Package 都達標，沒什麼好說的了。

foreach is way more slower than for loop in sparse arrays http://jsfiddle.net/ssSt5/2/

js.src = "//connect.facebook.net/zh_TW/all.js";

instead of

js.src = "//connect.facebook.net/zh_TW/sdk.js";

	(function webpackUniversalModuleDefinition(root, factory) {
	if (typeof exports === 'object' && typeof module === 'object') // CommonJS(2)
	module.exports = factory(require(__require_module__));
	else if (typeof define === 'function' && define.amd) // AMD
	define([__require_module__], factory);
	else if (typeof exports === 'object') // CommonJS(1)
	exports[__module_name__] = factory(require(__require_module__));
	else // Global Variable
	root[__module_name__] = factory(root[__require_module__]);
	})(typeof self !== 'undefined' ? self : this, function() {

	webpackJsonp([0],[,,,,,
	/* ./chunk.js */,
	/* ./style2.css */,
	/* (webpack)/node_modules/css-loader!./style2.css */,
	/* ./image2.png */
	]);

	var reducePolyfill = function(callback) {
	var k = [], key, t = this;
	for(key in t) {
	if (hasOwnProperty.call(t, key)) {
	k.push(key);
	}
	}
	var isArray = Object.prototype.toString.call(t) === '[object Array]';
	var len = k.length >>> 0;
	var argLen = arguments.length;

	((function(modules) {
	__webpack_require__.e = function requireEnsure(chunkId) {/* ... */}
	__webpack_require__.d = function(exports, name, getter) {/* ... */}
	__webpack_require__.n = function(module) {/* ... */}
	__webpack_require__.o = function(object, property) {/* ... */}
	})([ /* ... */,
	(function(module, exports, __webpack_require__) {
	var map = {/* ... */};
	function webpackAsyncContext(req) {/* ... */}
	module.exports = webpackAsyncContext;

	((function(modules) {
	window["webpackJsonp"] = function webpackJsonpCallback(chunkIds, moreModules, executeModules) { /* ... */ }
	var installedModules = {};
	var installedChunks = {4: 0};
	function __webpack_require__(moduleId) { /* ... */ }
	return __webpack_require__(__webpack_require__.s = 2);
	})([ /* ... */ ]);

	function factorial(m) {
	return m <= 1 ? m : m * factorial(m - 1);
	}

	function fibonacci(n) {
	return n < 2 ? n : fibonacci(n - 1) + fibonacci(n - 2);
	}

	function prime(p) {
	return p >= 1 ? isPrime(p) ? prime(--p).concat([p + 1]) : prime(--p) : [];