solomon-b

{-# LANGUAGE NoImplicitPrelude #-}
module FruitFRP where

import Prelude hiding ((.), id)
import Control.Arrow
import Control.Applicative
import Control.Category
import Control.Concurrent (threadDelay)
import Control.Monad
import Data.Bifunctor hiding (first)

solomon-b

module Netlink where

import Control.Exception (bracket)
import Control.Monad.IO.Class (liftIO)
import Control.Monad.Trans.Maybe
import Data.ByteString.Char8 (ByteString, unpack)
import Data.Map qualified as M
import Data.Maybe (fromMaybe, listToMaybe)
import Data.Serialize.Get (runGet)
import Data.Serialize.Put (putByteString, putWord32host, runPut)

solomon-b

module RecursionPrinciples where

data List a = Nil | Cons a (List a)
    --         1  +     (a * r )

    -- foldr   : (() -> r) -> ((a, r) -> r) -> List a -> r
    -- unfoldr : (r -> Maybe (a, r))        -> r -> [a]
foldr_list :: ((a, r) -> r) -> r -> List a -> r
foldr_list _ r Nil = r
foldr_list f r (Cons a as) = foldr_list f (f (a, r)) as

solomon-b

{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE DefaultSignatures #-}
module API where

import qualified Data.Text as T
import qualified Data.Aeson as J
import Control.Monad.IO.Class
import qualified Data.ByteString as B
import qualified Data.ByteString.Lazy as BL

solomon-b

import Data.Fix
import Data.Functor.Identity
import Data.Functor.Const
import Data.Profunctor
import Control.Lens hiding (view, set)

--------------------------------------------------------------------------------

main = print $ runMoore fib (1, 0) [(), (), (), (), (), (), (), (), (), ()]

solomon-b

{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE OverloadedStrings #-}


import Control.Category
import Data.Text (Text)
import Data.Void
import Prelude hiding ((.), id, curry, uncurry)
import Prelude qualified

solomon-b

-- | Concrete and Van Larhoeven Lens and Prisms with no imports.

main = print $ set (addressL . zipCodeL) solomon 42


data AdminStatus = IsAdmin | IsNotAdmin
  deriving Show
  
data Person =
  Person

solomon-b

Graphql Parser Stress Test RFC

## TL;DR

It would be really nice to have a set of GraphQL Documents which collectively express the entire GraphQL grammar. This would include atypical constructions such as random insertions of comma characters as whitespace.

## Problem Statement

solomon-b

{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE BlockArguments #-}
{-# LANGUAGE DeriveFunctor #-}
module RecursionSchemes where

--------------------------------------------------------------------------------

import Data.Smash
import Data.Function ((&))

solomon-b

module Main where

import Data.Foldable
import Data.List
import qualified Data.Map.Strict as M

-- https://en.wikipedia.org/wiki/Square_lattice
-- https://en.wikipedia.org/wiki/Ulam_spiral

data Dir a = U a | D a | L a | R a