callistabee

import multiprocessing.pool as mp
import itertools
import ipywidgets
from IPython.display import display

class Pool(mp.Pool):

    def map(self, func, iterable):

        try:

callistabee

import pefile
import sys
import distorm3

fn = sys.argv[1]

pe = pefile.PE(fn)

try:
    text_section = (

callistabee

from google.oauth2 import service_account
from googleapiclient.discovery import build
import argparse


class Drive:

    def __init__(self, cred_path):

        credentials = (

callistabee

#!/bin/bash

host=$1
port=$2

function usage() {
  echo "usage: $(basename $0) host [port=2046]"
  exit 1
}

callistabee

license: apache-2.0

callistabee

(define (rainbow img layer dirname)

  (let ( (c 0)
         (dup-layer 0)
         (dup-img 0)
         (to-save 0)
       )

    (set! c -180)

callistabee

<?php

function add($x,$y) {
  return $x + $y;
}   
      
function curry($fn) {
    
  return function($x) use ($fn) {

callistabee

The binary tree datatype:

> data Tree = Leaf | Fork Tree Int Tree deriving Show                                     

A simple insert function implementing a Binary Search Tree:

> insert :: Int -> Tree -> Tree                                                           
> insert n Leaf = Fork Leaf n Leaf                                                        
> insert n (Fork l m r) | (n <= m)  = Fork (insert n l) m r                               
>                       | otherwise = Fork l m (insert n r)                               

callistabee

- Haskell Mergesort
- Copyright (C) 2014 by Kendall Stewart


First we define a couple of helper functions that
will be useful in splitting the list in half:

> fsthalf :: [a] -> [a]
> fsthalf xs = take (length xs `div` 2) xs