FranklinChen

-- | http://stackoverflow.com/questions/14259229/streaming-recursive-descent-of-a-directory-in-haskell/14261710#14261710
--
-- Updated to latest Pipes 4.

module Main where

import Pipes
import qualified Pipes.Prelude as P
import Control.Monad (forM_)
import System.Directory (doesDirectoryExist, getDirectoryContents)

FranklinChen

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

/* Single inheritance, treating Animal as abstract base class. */
typedef struct Animal_vtable {
  void (*eat)(void *);
  void (*sound)(void *);
} Animal_vtable;

typedef struct Animal {

FranklinChen

Keybase proof

I hereby claim:

• I am franklinchen on github.
• I am franklinchen (https://keybase.io/franklinchen) on keybase.
• I have a public key ASDhVqCYgr6xkfxsfiM5OWYrkqFtO0Rc6P6wKgk8Mh8Xhwo

To claim this, I am signing this object:

FranklinChen

Homebrew build logs for shibboleth-sp on macOS 10.12
Build date: 2016-09-28 16:50:24

FranklinChen

import Test.HUnit

import qualified Data.List as List
import qualified Data.Ord as Ord
import Data.PSQueue as PSQueue

 {-
For @BillLaboon

hey @franklinchen is there an easy way in Haskell to find out which element in a list is most common, e.g. [1,1,1,2,3] -> 1 ?

FranklinChen

require 'minitest/autorun'

# Traverse in preorder
def tree_traverse(tree, &block)
  if tree.is_a? Array and tree.length > 0
    yield tree
    tree.each {|t| tree_traverse(t, &block) }
  end
end
  

FranklinChen

use std::sync::{Arc, Mutex};
use std::thread;

struct Toaster {
    count: u32
}

impl Toaster {
    fn new() -> Toaster {
        Toaster { count: 0 }

FranklinChen

use std::thread::{spawn, sleep_ms};
use std::sync::mpsc::channel;

fn main() {
    // Names of attendees.
    let names = vec![format!("A"), format!("B"), format!("C"), format!("D"), format!("E")];

    // Create a channel to communicate between attendees and the toaster.
    let (toaster_tx, toaster_rx) = channel();

FranklinChen

import qualified System
import qualified Data.List as List
import qualified Data.Char as Char
import qualified Data.HashMap.Strict as HashMap

main :: IO ()
main = do
     [arg] <- System.getArgs
     text <- getContents
     let n = read arg

FranklinChen

// C++ abuse

#include <iostream>

using namespace std;

class Animal {
public:
  virtual void food() = 0;
  virtual void sound() = 0;