Understand your Mac and iPhone more deeply by tracing the evolution of Mac OS X from prelease to Swift. John Siracusa delivers the details.
You've got two main options:
"""Simple implementation of a B+ tree, a self-balancing tree data structure that (1) maintains sort | |
data order and (2) allows insertions and access in logarithmic time. | |
""" | |
class Node(object): | |
"""Base node object. | |
Each node stores keys and values. Keys are not unique to each value, and as such values are | |
stored as a list under each key. |
// Here is an extremely simple version of work scheduling for multiple | |
// processors. | |
// | |
// The Problem: | |
// We have a lot of numbers that need to be math'ed. Doing this on one | |
// CPU core is slow. We have 4 CPU cores. We would thus like to use those | |
// cores to do math, because it will be a little less slow (ideally | |
// 4 times faster actually). | |
// | |
// The Solution: |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
# VERSION 1.0 | |
# the base image is a trusted ubuntu build with java 7 (https://index.docker.io/u/dockerfile/java/) | |
FROM dockerfile/java | |
# that's me! | |
MAINTAINER Adam Warski, adam@warski.org | |
# we need this because the workdir is modified in dockerfile/java | |
WORKDIR / |