adrianp

This work-in-progress summarizes the way-too-many BigData(tm) technologies.
This is by no means an in-depth description, but a very short summary so that
I know where to look.


1. Databases:
* DynamoDB - aws.amazon.com/dynamodb/ - Amazon AWS integration, MapReduce
* MongoDB - mongodb.org/ - JSON-style document database, SQL-like queries + MapReduce
* Riak - basho.com/riak/ - Key-Value storage, MapReduce
* CouchDB - couchdb.apache.org/ - JSON document storage, JavaScript Queries + MapReduce

Nurdok

Python Number Conversion Chart

From	To	Expression

dpapathanasiou

"""
A series of functions to extract just the text from html page articles

"""

from lxml import etree
default_encoding = "utf-8"

def newyorker_fp (html_text, page_encoding=default_encoding):
    """For the articles found on the 'Financial Page' section of the New Yorker's website

josephwecker

#!/bin/bash
# License: Public Domain.
# Author:  Joseph Wecker, 2012
#
# -- DEPRICATED --
# This gist is slow and is missing .bashrc_once
# Use the one in the repo instead! https://github.com/josephwecker/bashrc_dispatch
# (Thanks gioele)
#
# Are you tired of trying to remember what .bashrc does vs .bash_profile vs .profile?

hrldcpr

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!

peternixey

##How Homakov hacked GitHub and the line of code that could have prevented it

---

Please note: THIS ARTICLE IS NOT WRITTEN BY THE GITHUB TEAM or in any way associated with them. It's simply hosted as a Gist because the markdown formatting is excellent and far clearer than anything I could manage on my personal Tumblr at peternixey.com.

If you'd like to follow me on twitter my handle is @peternixey

---

gatlin

-- This is going to be on Hackage soon! https://github.com/gatlin/surely

{-# LANGUAGE BangPatterns #-}

-- |
-- Module           : AI.Surely
-- Copyright        : 2012 Gatlin Johnson
-- License          : LGPL 3.0
-- Maintainer       : [email protected]
-- Stability        : experimental

jagbolanos

--Proposed solutions to problems 87,88 and 89 of "99 Haskell Problems"
--Not optimal but they work
--If you know haskell and want to solve some problems there are some missing at:
--http://www.haskell.org/haskellwiki/99_questions/80_to_89

import Data.List

type Node = Int
type Edge = (Node,Node)
type Graph = ([Node],[Edge])