leroux

module Queue where

data Queue a = Queue [a] [a]
             deriving (Show, Eq)

emptyQueue :: Queue a
emptyQueue = Queue [] []

push :: a -> Queue a -> Queue a
push x (Queue d e) = Queue d (x:e)

leroux

module Chain where

infixl 2 .>
infixr 1 .>>

{-| Chain operator.
  Chain functions in a do-like (monadic bind)-like style.
  `f .> g` will return a function that will apply f, then apply g.
  It can be alternatively be defined as: `f .> g = g . f` which is just
  `flip (.)`.

leroux

#include <stdio.h>

int main (void) {
 char str[] = "password";
 int i = 0;
 /* for pointer arithmetic */
 char *ptr = str;
 while (*ptr && (*ptr += (i++)))
  ptr++;
 printf("%s\n", str);

leroux

#include <stdio.h>

int main (void) {
 char str[] = "password";
 int i = 0;
 /* for pointer arithmetic */
 char *ptr = str;
 while (*ptr && (*ptr += (i++)))
  ptr++;
 printf("%s\n", str);