mchav

RULE left-hand side too complicated to desugar
  Optimised lhs: letrec {
                   $dCTuple9_aUpZa
                     :: (Columnable' Double, ColumnifyRep RUnboxed Double,
                         VUM.Unbox Double, () :: Constraint,
                         (Real Double, Fractional Double), SBoolI True, SBoolI True,
                         SBoolI False, SBoolI True)
                   [LclId,
                    Unf=Unf{Src=<vanilla>, TopLvl=False,
                            Value=True, ConLike=True, WorkFree=True, Expandable=True,

mchav

#!/usr/bin/env cabal
{- cabal:
  build-depends: base >= 4, dataframe, hegg, text
-}

{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveTraversable #-}

mchav

{-# LANGUAGE  BlockArguments #-}
{-# LANGUAGE  TupleSections #-}
{-# LANGUAGE  MultiWayIf #-}
{-# LANGUAGE  OverloadedStrings #-}
{-# LANGUAGE  BangPatterns #-}
{-# LANGUAGE  TypeSynonymInstances, FlexibleInstances #-}
{-# LANGUAGE  TypeApplications #-}

module EGGP where

mchav

{-# LANGUAGE NumericUnderscores #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE TypeApplications #-}

import qualified Data.Text as T
import qualified DataFrame as D
import qualified DataFrame.Functions as F

import Data.Char

mchav

( ifThenElse
      (geq (lit (1.6)) (col @Double "petal.length"))
      ( ifThenElse
          (leq 0.4 (col @Double "petal.width"))
          (lit ("Setosa"))
          ( ifThenElse
              (leq 0.3 (col @Double "petal.width"))
              (lit ("Setosa"))
              ( ifThenElse
                  (leq 0.2 (col @Double "petal.width"))

mchav

{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE BangPatterns #-}

module Main where

import qualified Data.ByteString.Char8 as B
import Data.Char (isSpace)
import System.Environment (getArgs)

-- Run commands:

mchav

{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE NumericUnderscores #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeApplications #-}

import Control.Monad (when)
import qualified Data.ByteString.Lazy as L
import Data.List (foldl')

mchav

{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE ExplicitNamespaces #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}

mchav

-- Sort of like Java's step builder pattern.
-- https://medium.com/@castigliego/step-builder-pattern-3bcac4eaf9e8

-- A type that encodes that Y doesn't exist.
data NeedY

-- A type that encodes that a chart is ready.
data Ready

data Plot (s :: *) where

mchav

{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE NumericUnderscores #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeApplications #-}

import Control.Monad (when)
import qualified Data.ByteString.Lazy as L
import Data.List (foldl')