dmatveev

module ChainedHash
  (
    createHash
  , with
  , without
  , withMany
  , withoutMany
  , at
  ) where

dmatveev

(>>?) :: (Ord a, Num a) => Maybe a -> (a -> Maybe b) -> Maybe b
Nothing >>? _ = Nothing
Just v  >>? f = if v > 0 then f v else Nothing     


decr :: Int -> Maybe Int
decr a = Just (a - 1)


ex1 = (Just 1)  >>? decr >>? decr >>? decr

dmatveev

import Data.List (isSuffixOf)
import Data.Char (ord)
import Control.Monad (forM)
import System.IO (IOMode(..), withFile, hPutStrLn)
import System.FilePath (dropExtension)
import System.Directory (getDirectoryContents)

target :: FilePath -> Bool
target p = ".htm" `isSuffixOf` p

dmatveev

#include <glib.h>
#include <gio/gio.h>
#include <string.h>

static GMainLoop *gMainLoop = NULL;

char *
decode (GFileMonitorEvent ev)
{
    char *fmt = g_malloc0 (1024);

dmatveev

{-# LANGUAGE ScopedTypeVariables #-}

module MergeSort where

import Control.Monad.ST
import Control.Monad (forM_, when)
import Data.Array.ST
import Data.STRef

-- Required for tests only

dmatveev

#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <utility>

class binheap {
    std::size_t heap_size;

    static std::size_t heap_parent (std::size_t i) {

dmatveev

/* g++ -std=c++11 wrap.cc */

#include <functional>
#include <algorithm>
#include <vector>
#include <iterator>
#include <iostream>

typedef std::function<void ()> Action;
typedef std::function<void (Action)> Context;

dmatveev

#include <stdio.h>

/* #define FOO 33 */

#ifdef FOO
#  pragma push_macro ("FOO")
#  define FOO_WRAPPED
#  undef FOO
#endif