Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)
That's it!
#!/bin/bash | |
LOADING=false | |
usage() | |
{ | |
cat << EOF | |
usage: $0 [options] dbname | |
OPTIONS: |
[ | |
{ "keys": ["ctrl+shift+x"], "command": "tidy_xml" }, | |
{ "keys": ["ctrl+shift+j"], "command": "prettify_json" } | |
] |
Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)
That's it!
## Binary Search | |
def binary_search(data, target, low, high): | |
""" | |
Return True if target is found in indicated portion of a data list. | |
The earch only considers the portion from data[low] to data[high] inclusive. | |
""" | |
if low > high: | |
return False # interval is empty; no match | |
else: | |
mid = (low+high)//2 |
import collections | |
import json | |
import redis | |
import threading | |
from tornado import gen | |
from tornado import ioloop | |
from tornado import web | |
from tornado.options import define | |
from tornado.options import options | |
import tornadoredis |
curl -XDELETE 'localhost:9200/test' | |
curl -XPUT 'localhost:9200/test/data/1' -d ' | |
{ | |
"numbers":[11,23,13,16,17,23.6] | |
}, | |
' |