BinRoot

import Data.List

main = do
  print "hi"

list1 = ["aa", "bb", "cc"]
list2 = ["bb", "cc"]

getMatches list1 list2 = getMatches' (check list1 list2) list2
getMatches' indices list2 = map (f list2) (filter (>=0) indices)

BinRoot

We make Arch for ourselves, and for the ones that like it like we do. 
Whether we have a million users or one hundred users – 
we will keep making it the distro we like. 
Deal with it.

- Brain0

BinRoot

if(/^([a-z]([a-z]|\d|\+|-|\.)*):(\/\/(((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])
|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:)*@)?((\[(|(v[\da-f]{1,}\.(([a-z]|\d|-|\.|_|~)|[!\$&'\(\)\*\+,;=]|
:)+))\])|((\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\
d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5]))|(([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-
\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=])*)(:\d*)?)(\/(([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF
\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)*)*|(\/((([a-z]|\d|-|\.|_|~|[\u00A0-
\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)+(\/(([a-z]|\d|-|\.|_|~|[\u00A0-
\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)*)*)?)|((([a-z]|\d|-|\.|_|~|[
\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)+(\/(([a-z]|\d|-|\.|_|~
|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)*)*)|((([a-z]|\d|-|\.

BinRoot

...the hammer that strikes the nail, not the carpenter who wields it.

- Psychology Textbook

BinRoot

The genius of the hole: 
no matter how long you spend climbing out, 
you can still fall back down in an instant. 

- Max Payne

BinRoot

import XMonad
import XMonad.Config.Gnome
import XMonad.Util.EZConfig
import XMonad.Util.Run
import XMonad.Prompt.Workspace
import qualified XMonad.StackSet as S

main = xmonad $ gnomeConfig
  {
    modMask = mod4Mask -- win key for mod                                                                                                                                       

BinRoot

There are three deaths. 
The first is when the body ceases to function. 
The second is when the body is consigned to the grave. 
The third is that moment, sometime in the future, 
when your name is spoken for the last time.

- Eagleman, "Sum: Forty Tales from the Afterlives"

BinRoot

Besides, we do not prefer every non-falsified theory -
only one which, in the light of criticism, 
appears to be better than its competitors:
which solves our problems, which is well tested,
and of which we think, or rather conjecture or hope
(considering other provisionally accepted theories),
that it will stand up to further tests.

- Popper's "Conjectures and Refutations"

BinRoot

-- Mastered by James C. Sun

module BinaryTree
    (Tree(..), makeTree, add, printTree)
where
         
data Tree = Tree Int Tree Tree | EMPTYTREE deriving (Show, Eq)

printTree :: Tree -> IO()
printTree tree = putStrLn (printSubTree tree 0 0)

BinRoot

module MyData
    (MetricUnit(..),
     ImperialUnit(..),
     Measurement(..),
     convert)
where


data MetricUnit = Meter
                | Liter