##概要
- インメモリ
- クラスタ構成
- スキーマフリー
- ドキュメント指向
- レプリケーション
- シャーディング
| #!/bin/sh | |
| wget http://sourceforge.net/projects/zsh/files/zsh/5.0.0/zsh-5.0.0.tar.gz/download | |
| tar zxvf zsh-5.0.0.tar.gz | |
| cd zsh-5.0.0 | |
| ./configure | |
| make | |
| sudo make install | |
| chsh -s `which zsh` |
| -server | |
| -Xms128m | |
| -Xmx512m | |
| -XX:MaxPermSize=250m | |
| -XX:ReservedCodeCacheSize=64m | |
| -ea | |
| -Dsun.io.useCanonCaches=false | |
| -Djava.net.preferIPv4Stack=true | |
| -XX:+UseCodeCacheFlushing | |
| -XX:+UseConcMarkSweepGC |
| <?php | |
| class SimpleClass | |
| { | |
| public $str = 'a'; | |
| public $int = 1; | |
| public $float = 1.0; | |
| public $ary = array(); | |
| public $clsSame = null; | |
| public $clsOther = null; | |
| public $func = null; |
| >>> def side_effects_kwarg(kwarg = []): | |
| ... kwarg.append(1) | |
| ... return kwarg | |
| ... | |
| >>> side_effects_kwarg() | |
| Out[9]: [1] | |
| >>> side_effects_kwarg() | |
| Out[10]: [1, 1] | |
| >>> side_effects_kwarg([]) | |
| Out[11]: [1] |
| >>> def my_merge(l1, l2): | |
| print 'merge start', l1, l2 | |
| merge_list = [] | |
| while len(l1) > 0 and len(l2) > 0: | |
| if l1[0] <= l2[0]: | |
| merge_list.append(l1.pop(0)) | |
| else: | |
| merge_list.append(l2.pop(0)) | |
| if len(l1) == 0: | |
| merge_list += l2 |
| import time | |
| range_end = 1000000 | |
| search_val = range_end - 1 | |
| my_list = range(1, range_end) | |
| my_set = set(my_list) | |
| my_dict = dict.fromkeys(my_list) | |
| def test_list(): |
| # % ruby -v | |
| # ruby 2.0.0p0 (2013-02-24 revision 39474) [x86_64-darwin12.3.0] | |
| def func(x:[1]) | |
| x << 1 | |
| p x | |
| end | |
| func(x:[2]) # => [2, 1] | |
| func() # => [1,1] |
| <?php | |
| $ary = range(1, 100000); | |
| reset($ary); | |
| echo "array create end\n"; | |
| echo memory_get_usage() .PHP_EOL; | |
| echo "while start\n"; | |
| while (list($key, $value) = each($ary)) { | |
| if ($key === 0) echo memory_get_usage() .PHP_EOL; |
| import random | |
| def my_selection_sort(nums): | |
| l = len(nums) | |
| for i in range(l): | |
| min_idx = i | |
| for j in range(i, l): | |
| if (nums[min_idx] > nums[j]): | |
| min_idx = j | |
| nums[i], nums[min_idx] = nums[min_idx], nums[i] |