FranklinChen

sealed trait Interact[A]

case class Ask(prompt: String)
  extends Interact[String]

case class Tell(msg: String)
  extends Interact[Unit]

trait Monad[M[_]] {
  def pure[A](a: A): M[A]

FranklinChen

// Illustrate disciplined C++ code

// http://www.cplusplus.com/reference/vector/vector/
#include <vector>
#include <iostream>

using namespace std;

class Foo {
public:

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

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

#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

// C++ abuse

#include <iostream>

using namespace std;

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