clojj

/* A table of factorials. table[i] is the factorial of i. The
 * max field is calculated so that its factorial would not be an
 * integer overflow.
 */

typedef struct {
    unsigned max;
    unsigned *table;
} factorial_table;

clojj

var findByTitle: (String) -> (MutableList<Movie>) -> List<Movie> = 
    { query -> { collection ->
        val predicate = matches(query)
        filter(predicate)(collection)
    }}

val filter: ((Movie) -> Boolean) -> (List<Movie>) -> List<Movie> = 
    { predicate -> { collection ->
        collection.filter(predicate)
    }}

clojj

var findByTitle: (String) -> (MutableList<Movie>) -> List<Movie> = 
    { query -> { collection ->
        val predicate = matches(query)
        filter(predicate)(collection)
    }}

val filter: ((Movie) -> Boolean) -> (List<Movie>) -> List<Movie> = 
    { predicate -> { collection ->
        collection.filter(predicate)
    }}

clojj

gcdHaskell :: Int -> Int -> Int
gcdHaskell x y | x > y = gcdHaskell (x - y) y
               | x < y = gcdHaskell x (y - x)
               | otherwise = x
        
main = print $ gcdHaskell 4 2

clojj

module TicTacToe

import Data.Vect

data Piece = X | O | N

next : Piece -> Piece
next X = O
next O = X
next N = N

clojj

module TicTacToe

import Data.Vect

||| All possible player pieces, where N represents empty
data Piece = X | O | N

||| Select next player
next : Piece -> Piece
next X = O

clojj

module TicTacToe

import Data.Vect

||| All possible player pieces, where N represents empty
data Piece = X | O | N

||| Select next player 
next : Piece -> Piece
next X = O

clojj

find . -type f | parallel -k -j150% -n 1000 -m grep -i -H -n 'STRING' {}

clojj

import Data.List

compose :: [a -> a] -> a -> a
compose fs v = foldl' (flip (.)) id fs $ v

clojj

import Data.List

compose :: [Maybe (a -> a)] -> a -> a
compose fs v = foldl' compf id fs $ v

compf :: (a -> a) -> Maybe (a -> a) -> (a -> a)
compf f mg = 
    case mg of
        Nothing -> f
        Just g -> g . f