bananu7

Simple, opaque/plain state

A regular function

fn :: Int -> Int
fn x = x + 1

A monad with state used directly

fnM :: State Int ()

bananu7

{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE FlexibleInstances #-}

{-# LANGUAGE FlexibleContexts #-}

import Control.Monad.Reader

class Iso a b where
    isoFrom :: a -> b
    isoTo :: b -> a

bananu7

module queue
import Data.Vect

-- Here's the port of the Liquid Haskell blog post on amortized
-- queues. The tricksy bit is that the "amortized" bit depends on
-- laziness. This means that while in the REPL (where Idris is lazy)
-- this is reasonably efficient. It compiles absolutely horribly
-- though because each time push or pop something we rotate the whole
-- damned thing.

bananu7

// what's the difference between:

var family = new Array(); 

// and

var family = [];

bananu7

Keybase proof

I hereby claim:

• I am bananu7 on github.
• I am bananu7 (https://keybase.io/bananu7) on keybase.
• I have a public key whose fingerprint is E3DF E40B 6051 62D1 EAE2 C5BB 8335 A5B1 25F5 A3C5

To claim this, I am signing this object:

bananu7

    -- This:
    data GlishaState us libs = GlishaState { 
      userState :: us,
      libraryState :: libs,
      window :: G.Window,
      drawFn :: DrawFn us
    }
    
    -- Action monad parametrized over us and libs
    -- Both us and libs hoisted into MonadState for library or client

bananu7

<Grid>
        <Grid.ColumnDefinitions>
            <ColumnDefinition/>
            <ColumnDefinition/>
        </Grid.ColumnDefinitions>
        <Grid.RowDefinitions>
            <RowDefinition/>
            <RowDefinition Height="Auto" />
            <RowDefinition MinHeight="70"/>
        </Grid.RowDefinitions>

bananu7

std::map<std::string, std::string> parseOptions(std::vector<std::string> const& args) {
    std::map<std::string, std::string> options;

    auto it = args.begin();
    it++; // skip the file name

    while(it != args.end()) {
        if (it->at(0) == '-') {
            std::string key = *it;

bananu7

--hoistState :: Monad m => S.State s a -> S.StateT s m a
--hoistState = S.StateT . (return .) . S.runState

hoistState :: (Monad m, S.MonadState s m) => S.State s a -> m a
hoistState op = do
    x <- S.get
    let (r, x') = S.runState op x
    S.put x'
    return r

bananu7

int32_t n = 0;
	int32_t duty = 99;
	int32_t dutyChange = -1;
	int32_t pulse = 100;

	int32_t pulse_counter = 0;
	
  while(1) {                                    /* Loop forever               */
    //btns = kb.GetKeys();                  /* Read button states         */
		btns = MyKeyboard_GetKeys();