pamelafox

(function($) {
  // Used by dateinput
  $.expr = {':': {}};

  // Used by bootstrap
  $.support = {};

  // Used by dateinput
  $.fn.clone = function(){
      var ret = $();

ujihisa

*.o

fumieval

(load "lazier.scm")
(load "prelude.scm")
(load "prelude-numbers.scm")

(lazy-def '(main input) '(parse-unlambda i input))

(lazy-def 'parse-unlambda
 '((lambda (x) (x x))
   (lambda (self cont input)
     ((nth (car input) dispatch-list) (self self) cont (cdr input)) )))

Nabb

"":d;
[]:VAR;

{|2>~2base(;{" \t"=}%n+}:LB;
{|~F}:N;{..abs<\2base+{" \t"=}%+"\n"+}:F;

{n%{{1<"#"=!}1$!!*},{"|"%~}%{
:|' '/0=.58,48>-\,1>{'-'-}*"PUSH"or:I;[

["PUSH"{"  "N}]

hellerbarde

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

codebrainz

D			[0-9]
L			[a-zA-Z_]
H			[a-fA-F0-9]
E			([Ee][+-]?{D}+)
P                       ([Pp][+-]?{D}+)
FS			(f|F|l|L)
IS                      ((u|U)|(u|U)?(l|L|ll|LL)|(l|L|ll|LL)(u|U))

%{
#include <stdio.h>

dholbrook

/**
 * D Holbrook
 *
 * Code Club: PO1
 *
 * (*) Define a binary tree data structure and related fundamental operations.
 *
 * Use whichever language features are the best fit (this will depend on the language you have selected).  The following operations should be supported:
 *
 *    Constructors

egonSchiele

import Control.Monad.Reader

hello :: Reader String String
hello = do
    name <- ask
    return ("hello, " ++ name ++ "!")

bye :: Reader String String
bye = do
    name <- ask

rgrinberg

{-# LANGUAGE OverloadedStrings #-}
module Inisec where
import Prelude as P
import Data.Attoparsec.Text
import Data.Text.IO as T
import Data.Text
import Control.Applicative

data Section = Section 
             { entries :: [(Text, Text)]

nadult

module Parser(parseProgram) where

import Text.Parsec.Expr
import Text.ParserCombinators.Parsec
import Text.ParserCombinators.Parsec.Error
import qualified Text.ParserCombinators.Parsec.Token as P
import Text.ParserCombinators.Parsec.Language
import Control.Monad

import Tokens