kahwee

class CMap2 {
	/**
	 * Merges two or more arrays into one recursively.
	 * If each array has an element with the same string key value, the latter
	 * will overwrite the former (different from array_merge_recursive).
	 * Recursive merging will be conducted if both arrays have an element of array
	 * type and are having the same key.
	 * For integer-keyed elements, the elements from the latter array will
	 * be appended to the former array.

kahwee

#!/usr/bin/env php
<?php

/*
 * This file is part of the Symfony Standard Edition.
 *
 * (c) Fabien Potencier <fabien@symfony.com>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.

kahwee

// Forcing jQuery to post in JSON format.
$.postJSON = function(url, data, callback) {
	return $.ajax({
		url: url,
		contentType: "application/json",
		type: "POST",
		data: JSON.stringify(data),
		success: callback
	});
};

kahwee

$.ajax({
  url: 'http://vhn.internal.kw.sg:9080/vhs/rest/search/index',
  type: 'POST',
  headers: { 'X-VHS-networkId': 1 },
  contentType: "application/json",
})

kahwee

var template2 = Handlebars.compile('{{#each company}}{{#each employee}}{{@key}}{{@../index}}\n{{this}}\n\n{{/each}}{{/each}}');
/*
Return--
Tremor Video0
X

Tremor Video0
Y

Microsoft1

kahwee

/*Copyright (c) 2011-2015 Moat Inc. All Rights Reserved.*/
try{(function(w,v){var s={},M,za,Aa,ga=0,aa={},ha=[],z={},W=[],x={},U=!1,Ia={15:"",12:"",6:"",7:""},Ba,Ja=function(){for(var a=0;a<ha.length;a++)window.clearTimeout(ha[a]);for(a=0;a<W.length;a++)window.clearInterval(W[a]);for(var h in z)z.hasOwnProperty&&z.hasOwnProperty(h)&&z[h]&&(window.clearTimeout(z[h].tid),z[h]=!1);ha=[];W=[]},P=function(){for(var a in x)if(x.hasOwnProperty(a)){var h=x[a];s.a.a(h);s.b.a(h)}Ja()};s.c=P;(function(a){function h(a){var m=new RegExp("(^| )"+a+"($| )");return function(a){return a&&
a.className&&a.className.match(m)}}function r(a){return a&&a.document&&a.location&&a[k+l]&&a[u+t]}function e(a){if(null==a||r(a))return!1;var m=a.length;return 1===a.nodeType&&m?!0:"string"===typeof a||d(a)||0===m||"number"===typeof m&&0<m&&m-1 in a}function d(c){return"[object Array]"===a.d.bf.toString.call(c)}a.d={};a.d.a=3E3;a.d.b=function(){var a=/Firefox\/(\d+)/.exec(navigator.userAgent);return a?(a=parseInt(a[1],10),21>a&&14<a):!1}();a

kahwee

function reverse (string) {
  return string.split('').reverse().join('')
}

function largerHexxeh (kAsString) {
  var len = kAsString.length
  var k10 = parseInt(kAsString, 16)
  var firstHalf = kAsString.slice(0, Math.ceil(len / 2))
  var firstHalfInt = parseInt(firstHalf, 16)
  var firstHalfA = firstHalfInt.toString(16)

kahwee

Keybase proof

I hereby claim:

• I am kahwee on github.
• I am kahwee (https://keybase.io/kahwee) on keybase.
• I have a public key whose fingerprint is 1D47 5A2C 86C3 3DC0 3E61 5F8C 903D 82B0 F5D1 66FB

To claim this, I am signing this object:

kahwee

Given n being the number of steps, how many ways can you climb the stairs if you can step 1, 2 or 3 steps at a time.

0: []
1: [1]
2: [1, 1], 
   [2]
3: [1, 1, 1], 
   [2, 1], 
 [1, 2], 

kahwee

cd && mkdir .node_modules_global
npm config set prefix=$HOME/.node_modules_global

echo 'Remember to do this: export PATH="$HOME/.node_modules_global/bin:$PATH"'