code stringlengths 5 1.03M | repo_name stringlengths 5 90 | path stringlengths 4 158 | license stringclasses 15
values | size int64 5 1.03M | n_ast_errors int64 0 53.9k | ast_max_depth int64 2 4.17k | n_whitespaces int64 0 365k | n_ast_nodes int64 3 317k | n_ast_terminals int64 1 171k | n_ast_nonterminals int64 1 146k | loc int64 -1 37.3k | cycloplexity int64 -1 1.31k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
--
-- AST for the fragment of AADL we generate.
--
-- (c) 2014 Galois, Inc.
--
module Tower.AADL.AST where
import qualified Ivory.Language.Syntax.Type as I
import qualified Ivory.Tower.AST.Comment as C
----------------------------------------
data System = System
{ systemName :: !Name
, systemComponent... | GaloisInc/tower | tower-aadl/src/Tower/AADL/AST.hs | bsd-3-clause | 3,161 | 0 | 10 | 710 | 712 | 432 | 280 | 118 | 0 |
{-# LANGUAGE CPP, GADTs #-}
-----------------------------------------------------------------------------
--
-- Generating machine code (instruction selection)
--
-- (c) The University of Glasgow 1996-2004
--
-----------------------------------------------------------------------------
-- This is a big module, but, i... | tjakway/ghcjvm | compiler/nativeGen/PPC/CodeGen.hs | bsd-3-clause | 78,416 | 0 | 28 | 28,521 | 19,443 | 9,622 | 9,821 | -1 | -1 |
module QACG.CircGen.Add.SimpleRipple
( simpleRipple
,simpleModRipple
,simpleCtrlRipple
,mkSimpleRipple
,mkSimpleModRipple
,mkSimpleSubtract
,mkSimpleCtrlRipple
,simpleSubtract
,simpleCtrlSub
) where
import QACG.CircUtils.Circuit
import QACG.CircUtils.CircuitState
import Control.Monad.State
import Control.Excep... | aparent/qacg | src/QACG/CircGen/Add/SimpleRipple.hs | bsd-3-clause | 6,906 | 0 | 18 | 2,400 | 2,914 | 1,453 | 1,461 | 146 | 3 |
-----------------------------------------------------------------------------
-- |
-- Module : Data.SBV.Examples.CodeGeneration.AddSub
-- Copyright : (c) Levent Erkok
-- License : BSD3
-- Maintainer : erkokl@gmail.com
-- Stability : experimental
--
-- Simple code generation example.
-----------------... | Copilot-Language/sbv-for-copilot | Data/SBV/Examples/CodeGeneration/AddSub.hs | bsd-3-clause | 4,142 | 0 | 11 | 762 | 287 | 209 | 78 | 13 | 1 |
{-# LANGUAGE CPP, DeriveDataTypeable,
DeriveGeneric, FlexibleInstances, DefaultSignatures,
RankNTypes, RoleAnnotations, ScopedTypeVariables #-}
{-# OPTIONS_GHC -fno-warn-inline-rule-shadowing #-}
#if MIN_VERSION_base(4,9,0)
# define HAS_MONADFAIL 1
#endif
-----------------------------------... | tjakway/ghcjvm | libraries/template-haskell/Language/Haskell/TH/Syntax.hs | bsd-3-clause | 63,778 | 0 | 20 | 18,448 | 10,375 | 5,715 | 4,660 | 756 | 9 |
module AI.Neuron
( Neuron(..)
, ActivationFunction
, ActivationFunction'
, sigmoidNeuron
, tanhNeuron
, recluNeuron
, l2Neuron
, sigmoid
, sigmoid'
, tanh
, tanh'
, reclu
, reclu'
) where
-- | Using this structure allow... | jbarrow/LambdaNet | AI/Neuron.hs | mit | 2,079 | 0 | 11 | 524 | 355 | 206 | 149 | 41 | 1 |
{-# LANGUAGE RelaxedPolyRec, FlexibleInstances, TypeSynonymInstances #-}
-- RelaxedPolyRec needed for inlinesBetween on GHC < 7
{-
Copyright (C) 2012-2015 John MacFarlane <jgm@berkeley.edu>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as pu... | janschulz/pandoc | src/Text/Pandoc/Readers/MediaWiki.hs | gpl-2.0 | 23,551 | 0 | 21 | 6,378 | 7,416 | 3,728 | 3,688 | 525 | 12 |
test x = [x, "hello", 13, x]
| roberth/uu-helium | test/typeerrors/Heuristics/UnifierList.hs | gpl-3.0 | 29 | 0 | 5 | 7 | 21 | 12 | 9 | 1 | 1 |
module ExprCompUndefVar where
main = [ 1 | x ] | roberth/uu-helium | test/staticerrors/ExprCompUndefVar.hs | gpl-3.0 | 49 | 0 | 6 | 12 | 16 | 10 | 6 | 2 | 1 |
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE ScopedTypeVariables #-... | AndreasPK/stack | src/Stack/Build/ConstructPlan.hs | bsd-3-clause | 41,493 | 0 | 32 | 14,002 | 9,797 | 4,942 | 4,855 | 808 | 14 |
module SubHask.Category.Trans.Monotonic
( Mon
, unsafeProveMon
-- * The MonT transformer
, MonT (..)
, unsafeProveMonT
)
where
import SubHask.Category
import SubHask.Algebra
import SubHask.SubType
data IncreasingT cat (a :: *) (b :: *) where
IncreasingT :: (Ord_ a, Ord_ b) => c... | Drezil/subhask | src/SubHask/Category/Trans/Monotonic.hs | bsd-3-clause | 2,870 | 47 | 14 | 637 | 1,143 | 604 | 539 | -1 | -1 |
{-# LANGUAGE DeriveGeneric #-}
module Example where
import Data.Yaml.Union
import Data.Yaml
import Data.Maybe
readEx :: [FilePath] -> IO Object
readEx fs = fmap fromJust (decodeFiles fs)
main :: IO ()
main =
do en <- readEx ["example/en.yaml"]
de <- readEx ["example/en.yaml", "example/de.yaml"]
print en
... | michelk/yaml-overrides.hs | tests/Example.hs | bsd-3-clause | 334 | 0 | 9 | 66 | 111 | 57 | 54 | 13 | 1 |
{-
%
(c) The University of Glasgow 2006
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998
TcGenDeriv: Generating derived instance declarations
This module is nominally ``subordinate'' to @TcDeriv@, which is the
``official'' interface to deriving-related things.
This is where we do all the grimy bindings... | shlevy/ghc | compiler/typecheck/TcGenDeriv.hs | bsd-3-clause | 87,178 | 0 | 20 | 27,803 | 15,778 | 8,238 | 7,540 | 1,171 | 6 |
{-# LANGUAGE OverloadedStrings #-}
module Stack.Options.BenchParser where
import Data.Monoid.Extra
import Options.Applicative
import Options.Applicative.Builder.Extra
import Stack.Options.Utils
import Stack.Types.Config
-- | Parser for bench arguments.
-- FIXME hidin... | mrkkrp/stack | src/Stack/Options/BenchParser.hs | bsd-3-clause | 1,046 | 0 | 15 | 391 | 151 | 81 | 70 | 19 | 1 |
{- |
Module : $Header$
Description : Some additional helper functions
Copyright : (c) Dominik Luecke, Uni Bremen 2007
License : GPLv2 or higher, see LICENSE.txt
Maintainer : luecke@informatik.uni-bremen.de
Stability : experimental
Portability : non-portable (imports Logic.Logic)
Some helper funct... | mariefarrell/Hets | Propositional/Tools.hs | gpl-2.0 | 1,356 | 0 | 8 | 292 | 123 | 68 | 55 | 12 | 2 |
{-# LANGUAGE DerivingStrategies #-}
{-# OPTIONS_GHC -Wmissing-deriving-strategies #-}
module T15798a () where
data Foo a = Foo a
deriving stock (Eq)
data Bar a = Bar a
deriving (Eq, Show)
deriving stock (Ord)
| sdiehl/ghc | testsuite/tests/rename/should_compile/T15798a.hs | bsd-3-clause | 219 | 0 | 6 | 43 | 58 | 35 | 23 | 8 | 0 |
{-
Copyright 2015 Google Inc. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or a... | Ye-Yong-Chi/codeworld | codeworld-server/Setup.hs | apache-2.0 | 646 | 0 | 4 | 120 | 12 | 7 | 5 | 2 | 1 |
{-# LANGUAGE CPP #-}
-----------------------------------------------------------------------------
--
-- Code generation for foreign calls.
--
-- (c) The University of Glasgow 2004-2006
--
-----------------------------------------------------------------------------
module StgCmmForeign (
cgForeignCall,
emitPrimC... | forked-upstream-packages-for-ghcjs/ghc | compiler/codeGen/StgCmmForeign.hs | bsd-3-clause | 20,003 | 0 | 21 | 5,426 | 3,542 | 1,816 | 1,726 | 288 | 6 |
module THInSubdir (thFuncC) where
import Language.Haskell.TH
thFuncC :: Q Exp
thFuncC = runIO $ do
readFile "files/file.txt"
return $ LitE (IntegerL 5)
| mrkkrp/stack | test/integration/tests/717-sdist-test/files/subdirs/failing-in-subdir/src/THInSubdir.hs | bsd-3-clause | 158 | 0 | 11 | 28 | 54 | 28 | 26 | 6 | 1 |
import Test.Cabal.Prelude
main = setupAndCabalTest $ do
skipUnless =<< ghcVersionIs (>= mkVersion [8,1])
setup "configure" []
setup "build" []
| mydaum/cabal | cabal-testsuite/PackageTests/Backpack/TemplateHaskell/setup.test.hs | bsd-3-clause | 155 | 0 | 12 | 31 | 59 | 29 | 30 | 5 | 1 |
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
-- Tests newtype unwrapping for the IO monad itself
-- Notice the RenderM monad, which is used in the
-- type of the callback function
module ShouldCompile where
import Control.Applicative (Applicative)
import Foreign.Ptr
newtype RenderM a = RenderM (IO a) deriving (Funct... | ezyang/ghc | testsuite/tests/ffi/should_compile/ffi-deriv1.hs | bsd-3-clause | 669 | 0 | 9 | 107 | 148 | 81 | 67 | 11 | 1 |
module Dummy2 where
import Distribution.TestSuite (Test)
tests :: IO [Test]
tests = return []
| tolysz/prepare-ghcjs | spec-lts8/cabal/Cabal/tests/PackageTests/BuildTestSuiteDetailedV09/Dummy2.hs | bsd-3-clause | 96 | 0 | 6 | 16 | 35 | 20 | 15 | 4 | 1 |
-- Ordered Count of Characters
-- https://www.codewars.com/kata/57a6633153ba33189e000074
module Kata where
import Data.List (partition)
orderedCount :: String -> [(Char, Int)]
orderedCount [] = []
orderedCount (x:xs) = let (s, d) = partition (== x) xs in (x, succ . length $ s) : orderedCount d
| gafiatulin/codewars | src/7 kyu/OrderedCount.hs | mit | 298 | 0 | 10 | 47 | 109 | 61 | 48 | 5 | 1 |
{-# LANGUAGE BangPatterns, DataKinds, DeriveDataTypeable, FlexibleInstances, MultiParamTypeClasses #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
module Hadoop.Protos.GenericRefreshProtocolProtos.GenericRefreshProtocolService
(GenericRefreshProtocolService, genericRefreshProtocolService, Refresh, refresh) wher... | alexbiehl/hoop | hadoop-protos/src/Hadoop/Protos/GenericRefreshProtocolProtos/GenericRefreshProtocolService.hs | mit | 1,280 | 0 | 7 | 119 | 164 | 111 | 53 | 21 | 1 |
data Day = Sunday | Monday | Tuesday | Wednesday | Thursday | Friday | Saturday deriving (Show, Eq, Enum, Bounded)
data Month = Jan | Feb | Mar | Apr | May | Jun | July | Aug | Sept | Oct | Nov | Dec deriving (Show, Eq, Enum, Bounded)
next :: (Eq a, Enum a, Bounded a) => a -> a
next d = if d == maxBound then minBound... | nlim/haskell-playground | src/Euler19.hs | mit | 2,831 | 0 | 11 | 681 | 1,020 | 563 | 457 | 52 | 4 |
{-
Coin sums
Problem 31
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
It is possible to make £2 in the following way:
1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
How many different ways can £2 be made u... | feliposz/project-euler-solutions | haskell/euler31.hs | mit | 1,493 | 0 | 13 | 410 | 478 | 255 | 223 | 21 | 1 |
import Prime
import Test.HUnit
test1 = TestCase(assertEqual "2 should be prime" True (isPrime 2))
test2 = TestCase(assertEqual "4 should not be prime" False (isPrime 4))
test3 = TestCase(assertEqual "7 should be prime" True (isPrime 7))
testList = TestList[ test1, test2, test3 ]
main = do runTestTT testList
| RadoRado/HUnit-Test-Generator | PrimeTests.hs | mit | 310 | 0 | 9 | 48 | 109 | 56 | 53 | 7 | 1 |
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
module Network.AMQP.Internal.Types
( Connection (..)
, Exchange (..)
, ExchangeName (..)
, Message (..)
, MessageHandler (..)
, Queue (..)
, QueueName (..)
, QueueStatus (..)
, TopicName (..)
, WithConn (..)
) where
import Network.AMQP.Config as Config (RabbitMQConfig (..))... | gust/feature-creature | amqp-client/src/Network/AMQP/Internal/Types.hs | mit | 1,436 | 0 | 9 | 349 | 362 | 232 | 130 | 39 | 0 |
module Example where
import qualified NLP.Tokenize.Chatter as Tk
| karimamer/talks | haskell talks/nlp in haskell/tokenizeexample.hs | mit | 67 | 0 | 4 | 10 | 13 | 10 | 3 | 2 | 0 |
module Core.Grammar (CoreExpr(..),
Expr(..),
Name,
CoreAlt(..),
Alter(..),
CoreProgram(..),
Program(..),
CoreScDefn(..),
ScDefn(..)) where
-- | AST of ... | aneksteind/Core | src/Core/Grammar.hs | mit | 1,521 | 0 | 9 | 573 | 307 | 193 | 114 | 29 | 0 |
{-# LANGUAGE OverloadedStrings #-}
module Jira.API.Types.Status where
import Data.Aeson
import qualified Data.CaseInsensitive as CI
data Status = Open
| InProgress
| Resolved
| Closed
| CustomStatus String
deriving (Eq, Ord)
instance Show Status ... | dsmatter/jira-api | src/Jira/API/Types/Status.hs | mit | 824 | 0 | 14 | 285 | 193 | 103 | 90 | 25 | 0 |
module Moonbase.Util.Gtk.Widget
(
) where
| felixsch/moonbase-gtk | src/Moonbase/Util/Gtk/Widget.hs | gpl-2.0 | 49 | 0 | 3 | 12 | 11 | 8 | 3 | 2 | 0 |
module Cryptography.ComputationalProblems.Games.BitGuessingProblems.Terms where
import Notes
makeDefs
[ "deterministic bit-guessing problem"
, "probabilistic bit-guessing problem"
, "bit-guessing problem"
, "deterministic bit guesser"
, "probabilistic bit guesser"
, "bit guesser"
... | NorfairKing/the-notes | src/Cryptography/ComputationalProblems/Games/BitGuessingProblems/Terms.hs | gpl-2.0 | 389 | 0 | 6 | 84 | 42 | 27 | 15 | -1 | -1 |
{- Piffle, Copyright (C) 2007, Jaap Weel. This program is free
software; you can redistribute it and/or modify it under the terms
of the GNU General Public License as published by the Free Software
Foundation; either version 2 of the License, or (at your option)
any later version. This program is distribut... | jaapweel/piffle | src/CC.hs | gpl-2.0 | 6,414 | 0 | 13 | 1,723 | 1,552 | 786 | 766 | 116 | 6 |
module Data.Tree.Binary where
import Prelude hiding (lookup)
data Ord a => BTree a b =
Leaf
| Branch a b (BTree a b) (BTree a b)
deriving (Show)
leaf :: BTree a b
leaf = Leaf
branch :: Ord a => a -> b -> BTree a b -> BTree a b -> BTree a b
branch = Branch
left (Branch _ _ l _) = l
... | graninas/Haskell-Algorithms | Data/Tree/Binary.hs | gpl-3.0 | 1,654 | 4 | 12 | 506 | 874 | 431 | 443 | 38 | 1 |
{- |
Module : Solver
Description : Solver
Copyright : (c) Frédéric BISSON, 2015
License : GPL-3
Maintainer : zigazou@free.fr
Stability : experimental
Portability : POSIX
The Solver can take a 'Grid' and a 'Dictionary' and searches for all 'DictWord's
that can be constructed in the 'Grid' that appears in ... | Zigazou/RuzzSolver | src/Solver/Problem.hs | gpl-3.0 | 1,487 | 0 | 9 | 284 | 288 | 164 | 124 | 19 | 1 |
f . id == f
id . f == f | hmemcpy/milewski-ctfp-pdf | src/content/1.1/code/haskell/snippet06.hs | gpl-3.0 | 23 | 0 | 6 | 9 | 23 | 10 | 13 | -1 | -1 |
{-# LANGUAGE FlexibleInstances, OverloadedStrings, CPP #-}
{-# OPTIONS_GHC -Wall #-}
module Decommenter (decomment) where
{-
this module exports decomment, which removes:
empty lines
lines beginning with '#'
anything in a line following a '#'
-}
import qualified Data.Text as T (Text, null, lines, unline... | ninedotnine/bugfree-computing-machine | src/Decommenter.hs | gpl-3.0 | 1,790 | 0 | 11 | 428 | 535 | 312 | 223 | 43 | 1 |
{-# OPTIONS_GHC -fno-warn-orphans #-}
module Application
( getApplicationDev
, appMain
, develMain
, makeFoundation
-- * for DevelMain
, getApplicationRepl
, shutdownApp
-- * for GHCI
, handler
, db
) where
import Control.Concurrent (forkIO, killThread, thr... | mmarx/minitrue | Application.hs | gpl-3.0 | 7,091 | 0 | 16 | 1,812 | 1,128 | 601 | 527 | -1 | -1 |
module Main where
import Data.Maybe
import ChapterExercises
main :: IO ()
main = do
print $ sequenceA [Just 3, Just 2, Just 1]
print $ sequenceA [x, y]
print $ sequenceA [xs, ys]
print $ summed <$> ((,) <$> xs <*> ys)
print $ fmap summed ((,) <$> xs <*> zs)
print $ bolt 7
print $ fmap bolt... | nirvinm/Solving-Exercises-in-Haskell-Programming-From-First-Principles | Reader/app/Main.hs | gpl-3.0 | 472 | 0 | 12 | 133 | 243 | 122 | 121 | 16 | 1 |
module QHaskell.Expression.Utils.Show.GADTFirstOrder
() where
import QHaskell.MyPrelude
import QHaskell.Expression.GADTFirstOrder as GFO
import QHaskell.Environment.Typed
deriving instance Show (Exp s g a)
instance Show (Env (Exp s g) g') where
show Emp = "Emp"
show (Ext x xs) = "Ext (" ++ show x +... | shayan-najd/QHaskell | QHaskell/Expression/Utils/Show/GADTFirstOrder.hs | gpl-3.0 | 343 | 0 | 10 | 67 | 119 | 65 | 54 | -1 | -1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-compute/gen/Network/Google/Resource/Compute/Instances/GetGuestAttributes.hs | mpl-2.0 | 4,839 | 0 | 19 | 1,152 | 630 | 370 | 260 | 100 | 1 |
module Knight where
import Control.Monad
type KnightPos = (Int, Int)
moveKnight :: KnightPos -> [KnightPos]
moveKnight (c,r) = do
(c', r') <- [(c+2, r-1), (c+2, r+1), (c-2, r-1), (c-2, r+1)
,(c+1, r-2), (c+1, r+2), (c-1, r-2), (c-1, r+2)
]
guard (c' `elem` [1..8] && r' `elem` [1..8])
... | alexliew/learn_you_a_haskell | code/knightmoves.hs | unlicense | 858 | 0 | 12 | 179 | 404 | 225 | 179 | 20 | 1 |
{-# LANGUAGE ViewPatterns #-}
module Language.TAPL.SimplyTyped (evaluate, typecheck) where
{- types -}
data Type = Arr Type Type
| Bool
deriving Eq
instance Show Type where
show (Arr a b) = "(" ++ show a ++ " -> " ++ show b ++ ")"
show Bool = "Bool"
{- terms -}
data Term = Var Int
|... | mergeconflict/tapl | src/Language/TAPL/SimplyTyped.hs | apache-2.0 | 2,786 | 0 | 18 | 1,081 | 1,231 | 603 | 628 | 72 | 7 |
module Minecraft.A309978Spec (main, spec) where
import Test.Hspec
import Minecraft.A309978 (a309978)
main :: IO ()
main = hspec spec
spec :: Spec
spec = describe "A309978" $
it "correctly computes the first 20 elements" $
take 20 (map a309978 [1..]) `shouldBe` expectedValue where
expectedValue = [0,1,1,2,... | peterokagey/haskellOEIS | test/Minecraft/A309978Spec.hs | apache-2.0 | 353 | 0 | 10 | 59 | 160 | 95 | 65 | 10 | 1 |
module Main where
import Control.Monad (unless)
import Control.Monad.Trans.Class
import Control.Monad.Trans.State.Lazy
import qualified Data.ByteString as BS
import Data.Binary.Put
import Network.Simple.TCP
import RL_Glue.Experiment
import RL_Glue.Network
main = runExperiment doExperiments
doExperiments :: (Socket,... | rhofour/rlglue-haskell-codec | src/RL_Glue/Example/SkeletonExperiment.hs | apache-2.0 | 2,806 | 0 | 16 | 629 | 715 | 333 | 382 | 61 | 1 |
{-# LANGUAGE TemplateHaskell, FlexibleInstances #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
module Player where
import Control.Lens
import Time
import TimeSeries
import TimeSeriesGeometry
import Checkpoint
import Direction
data Player = Player { _timeseries :: TimeSeries (Maybe Turn), _initial :: Checkpoint }
mak... | epeld/zatacka | old/Player.hs | apache-2.0 | 735 | 0 | 11 | 114 | 209 | 110 | 99 | 18 | 1 |
{-# LANGUAGE TemplateHaskell, QuasiQuotes, OverloadedStrings #-}
module Handler.Blog
( getBlogR
, getBlogPostR
, getBlogPostNoDateR
, getBlogFeedR
) where
import Wiki
import Handler.ShowMap (loadTree, showTree)
import Util
import Yesod.Feed
import Data.List (groupBy)
import Data.Function (on)
impor... | snoyberg/yesodwiki | Handler/Blog.hs | bsd-2-clause | 3,220 | 0 | 19 | 949 | 1,083 | 547 | 536 | -1 | -1 |
-- | QuickCheck properties for the text library.
{-# LANGUAGE BangPatterns, FlexibleInstances, OverloadedStrings,
ScopedTypeVariables, TypeSynonymInstances #-}
{-# OPTIONS_GHC -fno-enable-rewrite-rules -fno-warn-missing-signatures #-}
module Tests.Properties
(
tests
) where
import Control.A... | text-utf8/text | tests/Tests/Properties.hs | bsd-2-clause | 61,507 | 2 | 24 | 16,179 | 21,578 | 11,275 | 10,303 | -1 | -1 |
-----------------------------------------------------------------------------
-- |
-- Module : Haddock.Options
-- Copyright : (c) Simon Marlow 2003-2006,
-- David Waern 2006-2009,
-- Mateusz Kowalczyk 2013
-- License : BSD-like
--
-- Maintainer : haddock@... | haskell/haddock | haddock-api/src/Haddock/Options.hs | bsd-2-clause | 16,010 | 0 | 15 | 3,426 | 3,793 | 2,027 | 1,766 | 325 | 8 |
{-# LANGUAGE PatternSynonyms #-}
--------------------------------------------------------------------------------
-- |
-- Module : Graphics.GL.MESA.ProgramBinaryFormats
-- Copyright : (c) Sven Panne 2019
-- License : BSD3
--
-- Maintainer : Sven Panne <svenpanne@gmail.com>
-- Stability : stable
-- Po... | haskell-opengl/OpenGLRaw | src/Graphics/GL/MESA/ProgramBinaryFormats.hs | bsd-3-clause | 693 | 0 | 5 | 91 | 47 | 36 | 11 | 7 | 0 |
{-# LANGUAGE ExtendedDefaultRules #-}
{-# LANGUAGE OverloadedStrings #-}
module Controllers.Reply
( routes ) where
import Control.Monad.CatchIO (try)
import Control.Monad.Trans
import qualified Data.ByteString as BS
import qualified Data.Text as T
import Data.... | HaskellCNOrg/snap-web | src/Controllers/Reply.hs | bsd-3-clause | 4,502 | 0 | 18 | 1,213 | 821 | 440 | 381 | 83 | 2 |
module Hint.All(
Hint(..), ModuHint,
resolveHints, hintRules, builtinHints
) where
import Data.Monoid
import Config.Type
import Data.Either
import Data.List.Extra
import Hint.Type
import Timing
import Util
import Prelude
import Hint.Match
import Hint.List
import Hint.ListRec
import Hint.Monad
import Hint... | ndmitchell/hlint | src/Hint/All.hs | bsd-3-clause | 2,934 | 0 | 12 | 595 | 765 | 420 | 345 | 71 | 20 |
{-# LANGUAGE InstanceSigs #-}
module Main where
import Control.Concurrent
import Game
import Rendering
import System.Console.ANSI
import System.Random
class GameAi ai where
run :: ai -> GameBoard -> (MovementDirection, ai)
data MoveUpAi = MoveUpAi
instance GameAi M... | anuraags/hs2048 | ai/Main.hs | bsd-3-clause | 3,056 | 0 | 11 | 635 | 895 | 478 | 417 | 69 | 1 |
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE StandaloneDeriving #-}
module GMessages.Network.ClientServer (
ConnectionMessage(..),
PingMessage(..),
WorldMessage(..),
ServiceMessage(..),
Message(..)
) where
import Data.Serialize (Serialize, get, put, Get, Putter)
import GHC.Generics (Generic)
import qualifi... | cernat-catalin/haskellGame | src/GMessages/Network/ClientServer.hs | bsd-3-clause | 1,726 | 0 | 9 | 391 | 419 | 243 | 176 | 43 | 0 |
module Main where
import Control.Monad
import System.Environment
import System.Cmd
import System.Exit
import System.Directory
import L1.ParL
import L1.ErrM
import L1Tox64.Compile
import Paths_schemeCompiler
main :: IO ()
main = do
args <- getArgs
when (length args /= 1) $ do
putStrLn "usage: filena... | mhuesch/scheme_compiler | src/L1Tox64/Main.hs | bsd-3-clause | 1,023 | 0 | 14 | 289 | 304 | 147 | 157 | 30 | 2 |
{-
A common practice in many Haskell applications is to define a
helper module for each project that provides commonly needed
imports. The purpose of this module is purely convenience.
-}
module Import
( module Import
, module X
) where
import Data.Default
import Foundation a... | fdilke/fpc-exp | src/Import.hs | bsd-3-clause | 1,040 | 0 | 5 | 271 | 73 | 49 | 24 | 11 | 1 |
{-# LANGUAGE Rank2Types #-}
module Opaleye.Internal.PackMap where
import Control.Applicative (Applicative, pure, (<*>), liftA2)
import qualified Control.Monad.Trans.State as S
import Data.Profunctor (Profunctor, dimap)
import Data.Profunctor.Product (ProductProfunctor, empty, (***!))
imp... | k0001/haskell-opaleye | Opaleye/Internal/PackMap.hs | bsd-3-clause | 1,748 | 0 | 12 | 410 | 715 | 390 | 325 | 37 | 1 |
-----------------------------------------------------------------------------
-- |
-- Module : Distribution.Simple.PreProcess
-- Copyright : (c) 2003-2005, Isaac Jones, Malcolm Wallace
-- License : BSD3
--
-- Maintainer : cabal-devel@haskell.org
-- Portability : portable
--
-- This defines a 'PreProces... | trskop/cabal | Cabal/Distribution/Simple/PreProcess.hs | bsd-3-clause | 30,273 | 157 | 27 | 8,618 | 5,666 | 3,153 | 2,513 | 464 | 40 |
{-# LANGUAGE TypeSynonymInstances, FlexibleInstances, MultiParamTypeClasses #-}
-- | The @waynodes@ element of a OSM file.
module Data.Geo.OSM.Waynodes
(
Waynodes
, waynodes
) where
import Text.XML.HXT.Arrow.Pickle
import Data.Geo.OSM.Lens.MaximumL
import Control.Lens.Lens
import Control.Newtype
-- | The @waynode... | tonymorris/geo-osm | src/Data/Geo/OSM/Waynodes.hs | bsd-3-clause | 890 | 0 | 12 | 166 | 195 | 113 | 82 | 31 | 1 |
-- |Includes the ImageSaving class, for types with savable image content, its
-- instances, and monadic helper functions.
module Tea.ImageSaving ( ImageSaving (save)
, saveM
) where
import Control.Monad.Trans
import Graphics.UI.SDL (saveBMP, Surface)
import Tea.Tea
import... | liamoc/tea-hs | Tea/ImageSaving.hs | bsd-3-clause | 1,008 | 0 | 10 | 226 | 194 | 108 | 86 | 19 | 1 |
module Database.Algebra.SQL.Materialization.TemporaryTable
( materialize
) where
import Database.Algebra.SQL.Materialization
import Database.Algebra.SQL.Query
import Database.Algebra.SQL.Tile.Flatten
-- | Wrap all dependencies into temporary tables, and put the root tiles into
-- value queries.
materialize ::... | ulricha/algebra-sql | src/Database/Algebra/SQL/Materialization/TemporaryTable.hs | bsd-3-clause | 725 | 0 | 10 | 170 | 158 | 93 | 65 | 15 | 1 |
module Sexy.Instances.Empty.Maybe () where
import Sexy.Data (Maybe)
import Sexy.Classes (Empty(..), Nil(..))
import Sexy.Instances.Nil.Maybe ()
instance Empty Maybe where
empty = nil
| DanBurton/sexy | src/Sexy/Instances/Empty/Maybe.hs | bsd-3-clause | 187 | 0 | 6 | 25 | 65 | 42 | 23 | 6 | 0 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ExtendedDefaultRules #-}
module Lucid.Foundation.Callouts.Panels where
import Lucid.Base
import Lucid.Html5
import qualified Data.Text as T
import Data.Monoid
panel_ :: T.Text
panel_ = " panel "
callout_ :: T.Text
callout_ = " callout "
| athanclark/lucid-foundation | src/Lucid/Foundation/Callouts/Panels.hs | bsd-3-clause | 293 | 0 | 5 | 46 | 57 | 37 | 20 | 11 | 1 |
{-# LANGUAGE DataKinds #-}
-- | Inventory management and party cycling.
-- TODO: document
module Game.LambdaHack.Client.UI.InventoryClient
( Suitability(..)
, getGroupItem, getAnyItems, getStoreItem
, memberCycle, memberBack, pickLeader
, cursorPointerFloor, cursorPointerEnemy
, moveCursorHuman, tgtFloorHuman... | Concomitant/LambdaHack | Game/LambdaHack/Client/UI/InventoryClient.hs | bsd-3-clause | 46,152 | 646 | 37 | 14,823 | 11,822 | 6,315 | 5,507 | -1 | -1 |
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANG... | hy-zhang/parser | experimental/DTC/DTC_HFunctor.hs | bsd-3-clause | 2,402 | 17 | 12 | 647 | 1,176 | 594 | 582 | -1 | -1 |
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE FlexibleContexts #-}
module Modules.Input.Setting where
import qualified Modules.Input.System as System
import Modules.Input.System(Node)
import qualified EFA.Application.Optimisation.Balance as Balance
import qualified EFA.Application.Optimisation as AppOpt
import quali... | energyflowanalysis/efa-2.1 | examples/advanced/energy/src/Modules/Input/Setting.hs | bsd-3-clause | 7,986 | 0 | 14 | 1,385 | 2,085 | 1,183 | 902 | 161 | 1 |
{-# LANGUAGE QuasiQuotes #-}
-- Advent of Code
---- Day 18: Like a GIF for your yard
module AOC2015.Day18 where
-- Part 1 is basically Conways Game of Life
import Data.Array.Repa ((:.) (..), Array, DIM2, U,
Z (..))
import qualified Data.Array.Repa ... | bitrauser/aoc | src/AOC2015/Day18.hs | bsd-3-clause | 2,345 | 0 | 13 | 786 | 821 | 435 | 386 | 54 | 2 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE Typ... | Garygunn94/DFS | AuthServer/.stack-work/intero/intero7092bvy.hs | bsd-3-clause | 11,103 | 220 | 18 | 3,039 | 2,518 | 1,356 | 1,162 | 224 | 4 |
-- | C and SystemC RTL Generation
module RTL.C
( generateC
) where
import RTL.Types
generateC :: IO ()
generateC = putStrLn "Generating C..."
| tomahawkins/trs | attic/RTL/C.hs | bsd-3-clause | 150 | 0 | 6 | 32 | 35 | 20 | 15 | 5 | 1 |
--
-- Copyright © 2013-2015 Anchor Systems, Pty Ltd and Others
--
-- The code in this file, and the program it is a part of, is
-- made available to you by its authors as open source software:
-- you can redistribute it and/or modify it under the terms of
-- the 3-clause BSD licence.
--
{-# LANGUAGE MultiParamTypeClas... | anchor/druid-query | tests/Network/Druid/Query/DSLSpec.hs | bsd-3-clause | 3,872 | 1 | 14 | 1,423 | 436 | 238 | 198 | 54 | 1 |
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE NamedFieldPuns #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE... | Soostone/cassy | src/Database/Cassandra/Basic.hs | bsd-3-clause | 12,974 | 0 | 23 | 3,064 | 2,427 | 1,329 | 1,098 | 214 | 5 |
{-# LANGUAGE RecordWildCards #-}
module Dots where
import qualified Data.ByteString.Lazy.Char8 as BL8
import Data.Map (Map)
import qualified Data.Map as Map
import Data.Monoid
import Graphics.Gloss
import Graphics.Gloss.Data.Vector
import Network.WebSockets
import Text.Read
-- | Player's name.
type Name = String
-- ... | fizruk/dots-game | src/Dots.hs | bsd-3-clause | 3,660 | 0 | 11 | 709 | 1,013 | 576 | 437 | 73 | 1 |
module B1.Program.Prices.Main
( main
) where
import Data.Either
import Data.Time
import System.Environment
import B1.Data.Price
import B1.Data.Price.Google
import B1.Data.Price.Mock
import B1.Data.Technicals.Stochastic
import B1.Data.Technicals.StockData
import B1.Program.Prices.Options
main = do
args <- get... | btmura/b1 | src/B1/Program/Prices/Main.hs | bsd-3-clause | 2,410 | 0 | 11 | 431 | 714 | 347 | 367 | 59 | 1 |
{-- snippet BookInfo --}
data BookInfo = Book Int String [String]
deriving (Show)
{-- /snippet BookInfo --}
{-- snippet MagazineInfo --}
data MagazineInfo = Magazine Int String [String]
deriving (Show)
{-- /snippet MagazineInfo --}
{-- snippet BookReview --}
-- We will introduce th... | binesiyu/ifl | examples/ch03/BookStore.hs | mit | 2,381 | 0 | 8 | 650 | 409 | 244 | 165 | 41 | 1 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE ScopedTypeVariables #-}
module UU.Parsing.Perms(Perms(), pPerms, pPermsSep, succeedPerms, (~*~), (~$~)) where
import UU.Parsing
import Data.Maybe
-- =======================================================================================
-- ===== PERMUTATIONS ========... | UU-ComputerScience/uulib | src/UU/Parsing/Perms.hs | bsd-3-clause | 2,318 | 0 | 15 | 700 | 1,063 | 555 | 508 | -1 | -1 |
module Main (main) where
import Data.Functor.Identity (Identity)
import Test.Framework (defaultMain, testGroup, Test)
import Test.Framework.Providers.HUnit
import Test.HUnit hiding (Test)
import Pipes (Pipe, (>->), each)
import Pipes.Prelude (toList)
import Pipes.Extras (scan1i)
main :: IO ()
main = defaultMain tests... | parsonsmatt/Haskell-Pipes-Extras-Library | tests/Main.hs | bsd-3-clause | 702 | 0 | 13 | 142 | 284 | 165 | 119 | 19 | 1 |
-- | Hyper vectorial synthesis
module Csound.Air.Hvs(
HvsSnapshot, HvsMatrix1, HvsMatrix2, HvsMatrix3,
hvs1, hvs2, hvs3,
-- | Csound functions
csdHvs1, csdHvs2, csdHvs3
) where
import Control.Applicative hiding ((<*))
import Control.Monad.Trans.Class
import Csound.Dynamic hiding (int)
import Csound.Typed
imp... | isomorphism/csound-expression | src/Csound/Air/Hvs.hs | bsd-3-clause | 6,774 | 6 | 18 | 1,872 | 1,555 | 859 | 696 | 62 | 1 |
-------------------------------------------------------------------------------
-- |
-- Module : CCO.Lexing
-- Copyright : (c) 2008 Utrecht University
-- License : All rights reserved
--
-- Maintainer : stefan@cs.uu.nl
-- Stability : provisional
-- Portability : portable
--
-- A library of lexer com... | UU-ComputerScience/uu-cco | uu-cco/src/CCO/Lexing.hs | bsd-3-clause | 15,045 | 0 | 16 | 4,629 | 2,919 | 1,624 | 1,295 | 190 | 6 |
-- ensure that the XMM register values are properly preserved across STG
-- exit/entry. Note that this is very sensitive to code generation.
module Main where
import Control.Monad (when)
import System.Exit (exitWith, ExitCode(..))
foreign export ccall fn_hs :: IO ()
fn_hs :: IO ()
fn_hs = return ()
foreign import ... | sdiehl/ghc | testsuite/tests/rts/T16514.hs | bsd-3-clause | 434 | 0 | 10 | 90 | 128 | 70 | 58 | 10 | 1 |
--------------------------------
-- The Game of Life --
--------------------------------
generations x = 30
data L a = N | C1 a (L a) | C2 a a (L a)
data Tuple2 a b = T2 a b
data Tuple3 a b c = T3 a b c
main = putStr (listChar_string
(append1 (C1 '\FF' N)
... | olsner/ghc | testsuite/tests/programs/life_space_leak/Main.hs | bsd-3-clause | 8,625 | 0 | 88 | 3,198 | 4,863 | 2,401 | 2,462 | 260 | 3 |
import System.Environment
main = getArgs >>= print
| ryantm/ghc | testsuite/tests/ghci.debugger/getargs.hs | bsd-3-clause | 52 | 0 | 5 | 8 | 15 | 8 | 7 | 2 | 1 |
import Data.Char
main = do
print $ ord 'A'
print $ chr 65
| shigemk2/haskell_abc | import.hs | mit | 67 | 0 | 8 | 22 | 31 | 14 | 17 | 4 | 1 |
module HighOrdFun where
-- : set expandtab ts=4 ruler number spell
fn7 n = length(show n)
{-
functions in languages like Java and C#,
functions are more often seen as
a way of packaging instructions to organize and reuse code.
But in Haskell functions are central
and can be passed around
like other va... | HaskellForCats/HaskellForCats | MenaBeginning/Ch007/2014-0130-higherOrderFunc.hs | mit | 9,874 | 2 | 15 | 1,899 | 1,053 | 621 | 432 | -1 | -1 |
-- | Utilities on text.
{-# LANGUAGE CPP #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE UnicodeSyntax #-}
module Apia.Utils.Text
( (+++)
, parens
, toUpperFirst
) where
------------------------------------------------------------------------------
import Apia.Prelude
import Agda.Uti... | asr/apia | src/Apia/Utils/Text.hs | mit | 934 | 0 | 10 | 174 | 180 | 109 | 71 | 20 | 2 |
module CopyDir
( copyDir
) where
-- Copied from http://stackoverflow.com/questions/6807025/what-is-the-haskell-way-to-copy-a-directory
import System.Directory
import System.FilePath ((</>))
import Control.Applicative ((<$>))
import Control.Concurrent.Async (mapConcurrently)
import Control.Exception (thr... | CovenantEyes/libget-hs | src/CopyDir.hs | mit | 1,190 | 0 | 14 | 264 | 365 | 187 | 178 | 27 | 3 |
{-# LANGUAGE OverloadedStrings #-}
module MonadBot.Plugins.Version
( plugin
) where
import Data.List
import Data.Text (pack)
import Data.Version (showVersion)
import Paths_monadbot (version)
import Data.Time
import Data.Time.Clock
import MonadBot.Message
import MonadBot.Plugin.Development
versionHandler :: ... | saevarb/Monadbot | lib/MonadBot/Plugins/Version.hs | mit | 1,678 | 0 | 16 | 449 | 565 | 298 | 267 | 53 | 3 |
{-# LANGUAGE MultiParamTypeClasses, FlexibleInstances, TypeSynonymInstances, ExistentialQuantification, Rank2Types #-}
module Perl.SV
( FromSV (..)
, ToSV (..)
, globalSV
, peekGlobalSV
, ToSVObj (..)
, isSV
, isAV
, isHV
, isCV
, svType
) where
import Control.Applicative
import Control.Monad
imp... | CindyLinz/Haskell-Perl | src/Perl/SV.hs | mit | 3,545 | 0 | 14 | 739 | 1,276 | 664 | 612 | 109 | 2 |
{-----------------------------------------------------------------------------------------
Module name: Hex
Made by: Tomas Möre 2015
------------------------------------------------------------------------------------------}
module Smutt.Util.Hex (module Hex) where
import Smutt.Util.Hex.String as Hex
| black0range/Smutt | src/Smutt/Util/Hex.hs | mit | 310 | 0 | 4 | 26 | 23 | 17 | 6 | 2 | 0 |
-- Words to sentence
-- https://www.codewars.com/kata/57a06005cf1fa5fbd5000216
module WordsToSentence where
wordsToSentence :: [String] -> String
wordsToSentence = unwords
| gafiatulin/codewars | src/7 kyu/WordsToSentence.hs | mit | 174 | 0 | 6 | 19 | 23 | 15 | 8 | 3 | 1 |
{-#LANGUAGE OverloadedStrings #-}
module Web.Scotty.Lucid where
import Web.Scotty
import Lucid
lucid :: Html a -> ActionM ()
lucid h = do
setHeader "Content-Type" "text/html"
raw . renderBS $ h
| arianvp/scotty-lucid | Web/Scotty/Lucid.hs | mit | 220 | 0 | 8 | 55 | 60 | 31 | 29 | 8 | 1 |
{-# LANGUAGE CPP #-}
{-
Copyright (C) 2008 John MacFarlane <jgm@berkeley.edu>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
... | thielema/gitit | Network/Gitit/Cache.hs | gpl-2.0 | 3,049 | 0 | 13 | 576 | 523 | 266 | 257 | 50 | 2 |
{-# OPTIONS_GHC -Wall -fwarn-tabs -Werror #-}
-------------------------------------------------------------------------------
-- |
-- Module : Input.Mouse
-- Copyright : Copyright (c) 2014 Michael R. Shannon
-- License : GPLv2 or Later
-- Maintainer : mrshannon.aerospace@gmail.com
-- Stability : uns... | mrshannon/trees | src/Input/Mouse.hs | gpl-2.0 | 2,894 | 0 | 10 | 729 | 521 | 310 | 211 | 58 | 2 |
{-# LANGUAGE NoImplicitPrelude, LambdaCase #-}
module Lamdu.Eval.Results.Process
( addTypes
) where
import qualified Control.Lens as Lens
import Control.Lens.Operators
import Data.Map (Map)
import qualified Data.Map as Map
import Data.Maybe (fromMaybe)
import qualified Lamdu.Built... | da-x/lamdu | Lamdu/Eval/Results/Process.hs | gpl-3.0 | 3,873 | 0 | 14 | 1,034 | 1,109 | 571 | 538 | -1 | -1 |
-----------------------------------------------------------------------------
-- |
-- Module : Text.Parsec.Prim
-- Copyright : (c) Daan Leijen 1999-2001, (c) Paolo Martini 2007
-- License : BSD-style (see the LICENSE file)
--
-- Maintainer : derek.a.elkins@gmail.com
-- Stability : provisional
-- Por... | antarestrader/sapphire | Text/Parsec/Prim.hs | gpl-3.0 | 26,946 | 14 | 23 | 8,132 | 6,498 | 3,388 | 3,110 | 433 | 5 |
module Language.Expressions where
-- Contains the data structures describing the structure of the language itself
-- You are free to use a different structure, as long as it describes a similar
-- enough language sufficiently well.
-- A command which performs something - can be a command that takes arguments
-- or an a... | IvanSindija/Project-Shell-Hash | Language/Expressions.hs | gpl-3.0 | 2,628 | 0 | 9 | 403 | 355 | 231 | 124 | 33 | 0 |
-----------------------------------------------------------
-- |
-- Module : Control.Concurrent.Longrun.Timer
-- Copyright : (c) Zoran Bošnjak 2016
-- License : GLPv3
--
-- Functions for long running process handling (Timer).
--
-- Maintainer : Zoran Bošnjak <zoran.bosnjak@via.si>
--
-- This file is par... | zoranbosnjak/longrun | Control/Concurrent/Longrun/Timer.hs | gpl-3.0 | 3,996 | 0 | 17 | 905 | 987 | 510 | 477 | 81 | 2 |
{-# LANGUAGE Arrows, StandaloneDeriving #-}
module Logic
( mainWire
) where
import Control.Applicative
import Control.Arrow
import Control.Wire
import Control.Wire.Unsafe.Event
import FRP.Netwire
import Control.Lens
import Control.Lens.TH
import Control.Monad.Random
import Control.Monad.Fix
import Prelude hiding ... | fatho/spacemonads | src/Logic.hs | gpl-3.0 | 12,133 | 8 | 21 | 3,248 | 4,870 | 2,508 | 2,362 | -1 | -1 |
import Codec.PPM.Binary
import System.Environment
import MaaS.Mandelbrot
main = do
[f,m,ptx,pty,x,y,z] <- getArgs
let fm = read m :: Int in
let px = read ptx :: Double in
let py = read pty :: Double in
let fx = read x :: Integer in
let fy = read y :: Integer in
let fz = read z :: Double in
... | maeln/MaaS | mandel.hs | gpl-3.0 | 418 | 1 | 25 | 107 | 207 | 104 | 103 | 12 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-gmail/gen/Network/Google/Resource/Gmail/Users/Threads/Modify.hs | mpl-2.0 | 5,487 | 0 | 21 | 1,405 | 865 | 504 | 361 | 126 | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.