rampion

// gcc -o try-catch-ex try-catch.c try-catch-ex.c 
#include <stdio.h>
#include "try-catch.h"

// Example of use for try-catch.h
int main(int argc, char *argv[])
{
  int i = 101;
  
  printf("before try block...\n");

jlao

import java.util.HashMap

object MapPerf {

  def main(args: Array[String]) {
    if ( args.length < 2 ) {
      println("Usage: scala MapPerf <number of elements to insert> <num trials>")
      return
    }

splorp

# To disable Safari’s annoying modal local database
# storage dialog, use this Terminal command:

defaults write com.apple.Safari WebKitDatabasesEnabledPreferenceKey -bool false

# To disable local storage altogether, use this command:

defaults write com.apple.Safari WebKitLocalStorageEnabledPreferenceKey -bool false

od0x0

typedef struct{
	ALuint ID;

	stb_vorbis* stream;
	stb_vorbis_info info;

	ALuint buffers[2];
	ALuint source;
	ALenum format;

zliuva

; A minimal Mach-o x64 executable for OS X (also see below Mountain Lion version)
;
; $ nasm -f bin -o tiny_hello tiny_hello.s
; $ chmod +x tiny_hello
; $ ./tiny_hello
; Hello World!
; $

; c.f.
; http://osxbook.com/blog/2009/03/15/crafting-a-tiny-mach-o-executable/ ( the original tiny mach-o executable )

nrabinowitz

/*! 
 * quantize.js Copyright 2008 Nick Rabinowitz.
 * Licensed under the MIT license: http://www.opensource.org/licenses/mit-license.php
 */

// fill out a couple protovis dependencies
/*!
 * Block below copied from Protovis: http://mbostock.github.com/protovis/
 * Copyright 2010 Stanford Visualization Group
 * Licensed under the BSD License: http://www.opensource.org/licenses/bsd-license.php

camillol

#include <unistd.h>
#include <CoreServices/CoreServices.h>
#include <ApplicationServices/ApplicationServices.h>

typedef int CGSConnection;
extern OSStatus CGSGetWorkspace(const CGSConnection cid, int *workspace);
extern OSStatus CGSSetWorkspace(const CGSConnection cid, int workspace);
extern CGSConnection _CGSDefaultConnection(void);

int get_space_id(void);

mre

/*
 * Parallel bitonic sort using CUDA.
 * Compile with
 * nvcc -arch=sm_11 bitonic_sort.cu
 * Based on http://www.tools-of-computing.com/tc/CS/Sorts/bitonic_sort.htm
 * License: BSD 3
 */

#include <stdlib.h>
#include <stdio.h>

fogus

\ FCP.F, version 1.3 by Ian Osgood  iano@quirkster.com
\ A simple chess program written in ANS Forth.

\ Uses Core Extension words:
\   .( .R U.R <> U> ?DO ERASE FALSE NIP TO TRUE TUCK VALUE WITHIN \
\ Uses Exception words: CATCH THROW ABORT"
\ Uses Tools Extension words: [IF] [ELSE] [THEN]
\ Uses String words:          TOLOWER /STRING
\ Uses Win32Forth utilities:  ms@ CELL CELL- DEFER IS [DEFINED] [UNDEFINED]
\ Will use DEFER/IS/[IS] if available for board iterator and vectors.

ayang

class Application(tornado.web.Application):
    def __init__(self):
        tornado.web.Application.__init__(self, handlers, **settings)
        self.db_session = db_session
        self.redis = redis.StrictRedis()
        self.session_store = RedisSessionStore(self.redis)



class BaseHandler(tornado.web.RequestHandler):