cieplak / xhyve-freebsd-tutorial-1.md

Created April 14, 2019 04:01 — forked from tanb/xhyve-freebsd-tutorial-1.md

FreeBSD running on xhyve tutorial. (Appendix: Resize image with qemu. Create FreeBSD VM with qemu).

TL;DR

Requisites

cieplak / cursed_mandelbrot.c

Created November 14, 2018 01:03 — forked from DavidBuchanan314/cursed_mandelbrot.c

Compile-time mandelbrot in pure C. Outputs a PGM image file to stdout.

	#include <stdio.h>

	#define SQ(x) (x)*(x)

	#define M0(x,y) SQ(x)+SQ(y)<4?0:0xe0
	#define M1(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M0(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0)):0xc0
	#define M2(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M1(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0xa0
	#define M3(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M2(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x80
	#define M4(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M3(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x60
	#define M5(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M4(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x40

cieplak / Prolog.hs

Created August 22, 2018 21:22 — forked from hodzanassredin/Prolog.hs

simple type level predicates in haskell

	{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, UndecidableInstances #-}
	module Prolog (Petja, Vasja, Serg, Father) where

	data Petja = Petja
	data Vasja = Vasja
	data Serg = Serg

	class Father a b where
	isFather :: a -> b -> ()
	isFather x y = ()

cieplak / NamedTuple.hs

Created July 22, 2018 00:28 — forked from PkmX/NamedTuple.hs

Using type-level symbols and overloaded labels to make named tuples

	{-# LANGUAGE GADTs #-}
	{-# LANGUAGE PolyKinds #-}
	{-# LANGUAGE FunctionalDependencies #-}
	{-# LANGUAGE MultiParamTypeClasses #-}
	{-# LANGUAGE TypeOperators #-}
	{-# LANGUAGE DataKinds #-}
	{-# LANGUAGE KindSignatures #-}
	{-# LANGUAGE TemplateHaskell #-}
	{-# LANGUAGE FlexibleInstances #-}
	{-# LANGUAGE OverloadedLabels #-}

cieplak / 01-simplest-thing-that-works.hs

Created July 21, 2018 21:38 — forked from aaronlevin/01-simplest-thing-that-works.hs

Proxy Serialization Post

	{-# LANGUAGE OverloadedStrings #-}

	module SimpleThings where

	import Control.Applicative ((<$>), (<*>))
	import Control.Monad (mzero)
	import Data.Aeson
	import qualified Data.Aeson as A

	-- \| sum type containing all possible payloads

cieplak / tailf.hs

Created April 16, 2018 04:23 — forked from radix/tailf.hs

continuous tailing of a file with Haskell ("tail -f")

	#!/usr/bin/env runhaskell
	{-# LANGUAGE OverloadedStrings #-}

	module Main where

	import Control.Concurrent (threadDelay)
	import Control.Concurrent.MVar (MVar (..), putMVar, takeMVar)
	import Control.Exception (tryJust)
	import Control.Monad (forever, guard)
	import qualified Data.ByteString.Lazy as BS

cieplak / main.c

Created March 30, 2018 19:31 — forked from josephg/main.c

kqueue network & file example

cieplak / recvRawEth.c

Created March 19, 2018 01:06 — forked from austinmarton/recvRawEth.c

Receive raw Ethernet frames in Linux

	/*
	* This program is free software: you can redistribute it and/or modify
	* it under the terms of the GNU General Public License as published by
	* the Free Software Foundation, either version 3 of the License, or
	* (at your option) any later version.
	*/

	#include <arpa/inet.h>
	#include <linux/if_packet.h>
	#include <linux/ip.h>

cieplak / nginx.conf

Created February 16, 2018 23:54 — forked from plentz/nginx.conf

Best nginx configuration for improved security(and performance). Complete blog post here http://tautt.com/best-nginx-configuration-for-security/

	# to generate your dhparam.pem file, run in the terminal
	openssl dhparam -out /etc/nginx/ssl/dhparam.pem 2048

cieplak / sample_monadLogger.hs

Created January 10, 2018 04:20 — forked from naoto-ogawa/sample_monadLogger.hs

Monad Logger Sample

	-- {-# LANGUAGE OverloadedStrings #-}

	import Data.Text
	import Control.Monad.Trans
	import Control.Monad.Trans.Maybe
	import Control.Monad.Trans.State
	import Control.Monad.Trans.Identity
	import Control.Monad.Identity
	import Control.Monad.Logger

	#include <stdio.h>

	#define SQ(x) (x)*(x)

	#define M0(x,y) SQ(x)+SQ(y)<4?0:0xe0
	#define M1(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M0(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0)):0xc0
	#define M2(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M1(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0xa0
	#define M3(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M2(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x80
	#define M4(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M3(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x60
	#define M5(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M4(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x40