nponeccop

#!/bin/bash

function list ()
{
	cblrepo --db $1/cblrepo.db list $2 $3 | awk 'BEGIN{OFS="\t"}; { match($2, /(.*)-(.*)/, a);$2=a[1];$3=a[2]; print $1, $2, $3 };'
}

function mkjoin()
{
	join <(list . $2 $3) <(list upstream-repos/$1) 

nponeccop

#include <new>
template <typename T>
struct cons
{
        cons<T> *next;
        char fake;
};

class evil
{

nponeccop

var io = require('socket.io-client')

var count = 0

function makeClient()
{

var socket = new io.Socket({
	handshakeHeaders : { Cookie: 'connect.sid=XM77nAGuFBKumz6EtcK3buNN.RaRD21zOWZnwYNdX1QhQszvyT8K4uQHl1Qz2mNPv6kc' }
,	host : 'localhost'

nponeccop

#include <windows.h>

HANDLE f;

void my_open(char *fileName)
{
	f = CreateFile(
		fileName, 
		GENERIC_WRITE, 
		0, 

nponeccop

foo = let 
		bar = 5
	in case True of
		True -> 1

nponeccop

{-# LANGUAGE DeriveFunctor #-}
import Data.Functor.Foldable
import qualified Data.Set as S

data Solve a x = Conquer a | Bottom | Divide x x deriving (Functor)

data Problem = Solution [Int] | Problem [([Int], S.Set Int)]

g n m = hylo phi psi $ Problem [([i], S.singleton i) | i <- [1..n-1]] where
	psi (Solution is) = Conquer is

nponeccop

Minimal Cloud Management Interface

We assume it's for OpenVZ scenario, so chroot isolation level is used.

The images are self-contained - they include enough metadata for starting and configuration. No incremental imaging and persistence are necessary for a minimal production-ready run. Stopping can delete the chroot as well, and packed images can be deleted just after unpacking.

No provision for per-deployment configuration is required for initial operations. If the same image is to be deployed with slightly different configurations, many different images should be prepared instead.

A rate-limited infinite auto-restart is a reasonable default that is enough for initial production operations.

nponeccop

nponeccop

nponeccop

{-# LANGUAGE Rank2Types #-}
module Main where
-- data Cont r a = Cont { runCont :: (a -> r) -> r }

import Control.Monad.Cont

calculateLength :: [a] -> Cont r Int
calculateLength l = return (length l)

type ContS r a = (a -> r) -> r