rgb-24bit rgb-24bit

People

One-line Tree in Python

Using Python's built-in defaultdict we can easily define a tree data structure:

def tree(): return defaultdict(tree)

That's it!

	/*
	* Copyright (c) 1999 Kungliga Tekniska H�gskolan
	* (Royal Institute of Technology, Stockholm, Sweden).
	* All rights reserved.
	*
	* Redistribution and use in source and binary forms, with or without
	* modification, are permitted provided that the following conditions
	* are met:
	*
	* 1. Redistributions of source code must retain the above copyright

	axios({
	url: 'http://localhost:5000/static/example.pdf',
	method: 'GET',
	responseType: 'blob', // important
	}).then((response) => {
	const url = window.URL.createObjectURL(new Blob([response.data]));
	const link = document.createElement('a');
	link.href = url;
	link.setAttribute('download', 'file.pdf');
	document.body.appendChild(link);

	import asyncio
	loop = asyncio.get_event_loop()

	async def hello():
	await asyncio.sleep(3)
	print('Hello!')

	if __name__ == '__main__':
	loop.run_until_complete(hello())

	/**
	* Produces a function which uses template strings to do simple interpolation from objects.
	*
	* Usage:
	* var makeMeKing = generateTemplateString('${name} is now the king of ${country}!');
	*
	* console.log(makeMeKing({ name: 'Bryan', country: 'Scotland'}));
	* // Logs 'Bryan is now the king of Scotland!'
	*/
	var generateTemplateString = (function(){

	(require 'org-table)
	(require 'org-clock)

	(defun clocktable-by-tag/shift-cell (n)
	(let ((str ""))
	(dotimes (i n)
	(setq str (concat str "\| ")))
	str))

	(defun clocktable-by-tag/insert-tag (params)

	Latency Comparison Numbers (~2012)
	----------------------------------
	L1 cache reference 0.5 ns
	Branch mispredict 5 ns
	L2 cache reference 7 ns 14x L1 cache
	Mutex lock/unlock 25 ns
	Main memory reference 100 ns 20x L2 cache, 200x L1 cache
	Compress 1K bytes with Zippy 3,000 ns 3 us
	Send 1K bytes over 1 Gbps network 10,000 ns 10 us
	Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD