| So, let’s flip a coin: if it’s heads, play a drum, if it’s tails, play a cymbal. Easy. We can emulate a coin flip with our one_in function (introduced in the section on randomness) specifying a probability of 1 in 2: one_in(2). We can then use the result of this to decide between two pieces of code, the code to play the drum and the code to play the cymbal: | |
| loop do | |
| if one_in(2) | |
| sample :drum_heavy_kick | |
| else | |
| sample :drum_cymbal_closed | |
| end | |
Layer 3 Communications is a professional services organization and network systems integrator. We use Haskell to build network security applications that revolve around either analyzing network data or configuring networks.
Networking knowledge can be learned on the job, and thus is not required.
Our stack:
Ghosts of Departed Proofs introduces sortBy. It sorts using a comparison function a -> a -> Ordering named "comp". The name is then recorded in the return type: "this list is sorted by comp"!
type Cmp :: Type -> Type
type Cmp a = (a -> a -> Ordering)
sortBy :: Cmp a~~comp -> [a] -> SortedBy comp [a]
| import Control.Applicative | |
| import Text.ParserCombinators.ReadP | |
| data WindInfo = WindInfo | |
| { dir :: Int | |
| , speed :: Int | |
| , gusts :: Maybe Int | |
| } | |
| deriving Show |
| {-# LANGUAGE DataKinds #-} | |
| {-# LANGUAGE DeriveAnyClass #-} | |
| {-# LANGUAGE DeriveGeneric #-} | |
| {-# LANGUAGE DerivingStrategies #-} | |
| {-# LANGUAGE FlexibleContexts #-} | |
| {-# LANGUAGE FlexibleInstances #-} | |
| {-# LANGUAGE MultiParamTypeClasses #-} | |
| {-# LANGUAGE RankNTypes #-} | |
| {-# LANGUAGE RecordWildCards #-} | |
| {-# LANGUAGE TemplateHaskell #-} |
| language: haskell | |
| dist: trusty | |
| cache: | |
| directories: | |
| - $HOME/.cabal/packages | |
| - $HOME/.cabal/store | |
| - $HOME/.stack | |
| - $TRAVIS_BUILD_DIR/.stack-work |
Article topics:
