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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
module Machine.Fun
( fun_test
, inner_fun_test
, numerical_test
, numerical_test'
)
where
import Machine.Class
import Machine.Akzeptieren
import Machine.History
import qualified Machine.Numerical.Type as N
import Autolib.Reporter hiding ( output )
import Autolib.ToDoc
import Autolib.FiniteMap
import Autolib.Set
im... | florianpilz/autotool | src/Machine/Fun.hs | gpl-2.0 | 4,145 | 153 | 14 | 1,247 | 1,303 | 694 | 609 | 106 | 1 |
{-# LANGUAGE OverloadedStrings, DataKinds #-}
import Database.Cassandra.CQL
import Control.Monad
import Control.Monad.CatchIO
import Control.Monad.Trans (liftIO)
import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as C
import Data.Text (Text)
import qualified Data.Text as T
import Data.UUI... | alphaHeavy/cassandra-cql | tests/example.hs | bsd-3-clause | 2,797 | 2 | 16 | 659 | 699 | 360 | 339 | 49 | 3 |
module Language.C.Analysis.TypeConversions (
arithmeticConversion,
floatConversion,
intConversion
) where
import Language.C.Analysis.SemRep
-- | For an arithmetic operator, if the arguments are of the given
-- types, return the type of the full expression.
arithmeticConversion :: TypeName -> TypeName ->... | acowley/language-c | src/Language/C/Analysis/TypeConversions.hs | bsd-3-clause | 1,593 | 0 | 8 | 249 | 467 | 239 | 228 | 28 | 1 |
-------------------------------------------------------------------------
-- Comments with allcaps `FIXME' indicate places where the indentation --
-- fails to find the correct indentation, whereas comments with --
-- lowercase `fixme' indicate places where impossible indentations --
-- are uselessly propose... | develmj/emacs-starter-kit | vendor/haskellmode/indent.hs | gpl-3.0 | 5,120 | 17 | 16 | 2,097 | 1,172 | 608 | 564 | -1 | -1 |
{-# LANGUAGE PatternSynonyms #-}
{-# OPTIONS_GHC -Wno-missing-pattern-synonym-signatures #-}
module Clingo.Internal.Inspection.Theory
(
TheoryAtoms,
TermId,
ElementId,
AtomId,
TheoryTermType,
pattern TheoryTuple,
pattern TheoryList,
pattern TheorySet,
pattern TheoryFunction,
pat... | tsahyt/clingo-haskell | src/Clingo/Internal/Inspection/Theory.hs | mit | 6,262 | 0 | 14 | 1,399 | 1,844 | 934 | 910 | 133 | 2 |
-- -------------------------------------------------------------------------------------
-- Author: Sourabh S Joshi (cbrghostrider); Copyright - All rights reserved.
-- For email, run on linux (perl v5.8.5):
-- perl -e 'print pack "H*","736f75726162682e732e6a6f73686940676d61696c2e636f6d0... | cbrghostrider/Hacking | HackerRank/Contests/ProjectEuler/001_mult3s5s.hs | mit | 802 | 3 | 13 | 191 | 223 | 109 | 114 | 15 | 1 |
module Two
( mult1
) where
mult1 = x * y
where x = 5
y = 6
myx = x + 9001
where x = 10
myx1 = x * 3 + y
where x = 3
y = 1000
myx2 = x * 5
where y = 10
x = 10 * 5 + y
myx3 = z / x + y
where x = 7
y = negate x
z = y * 10
| mudphone/HaskellBook | src/Two.hs | mit | 288 | 0 | 8 | 146 | 137 | 77 | 60 | 17 | 1 |
{-# LANGUAGE CPP #-}
{-# LANGUAGE FlexibleContexts #-}
module Database.Persist.Sql.Migration
( parseMigration
, parseMigration'
, printMigration
, getMigration
, runMigration
, runMigrationSilent
, runMigrationUnsafe
, migrate
) where
import Control.Monad.Trans.Control (MonadBaseControl)
import Cont... | gbwey/persistentold | persistent/Database/Persist/Sql/Migration.hs | mit | 3,824 | 0 | 20 | 869 | 1,114 | 574 | 540 | 94 | 2 |
{-# LANGUAGE BangPatterns #-}
module Database.Kioku.Memorizable
( Memorizable(..)
, memorizeWord8, recallWord8
, memorizeWord16, recallWord16
, memorizeWord32, recallWord32
, memorizeWord64, recallWord64
, memorizeWord, recallWord
, memorizeInt8, recallInt8
, memorizeInt16, recallInt16
, memorizeInt... | flipstone/kioku | src/Database/Kioku/Memorizable.hs | mit | 11,372 | 0 | 22 | 2,495 | 3,114 | 1,705 | 1,409 | -1 | -1 |
#!/usr/bin/env runhaskell
-- Haskell solution to the n-queens problem using list comprehension
-- Taken from http://www.testing-software.org/articles/functional/eight-queens-puzzle.html#haskell
boardSize = 8
queens :: Int -> [[Int]]
queens 0 = [[]]
queens n = [ x : y | y <- queens (n-1), x <- [1..boardSize], safe x y ... | dicander/HaskellLists | queens.hs | mit | 501 | 3 | 10 | 122 | 208 | 104 | 104 | 7 | 2 |
{- | Values implemented as closures.
--
-- We have two kinds of explicit substitutions:
-- * values for expression (bound) variables
-- * values for value (free) variables
-}
{-# LANGUAGE FlexibleContexts, FlexibleInstances, TypeSynonymInstances, MultiParamTypeClasses,
OverlappingInstances, IncoherentInstances, Un... | andreasabel/helf | src/MonoVal.hs | mit | 7,117 | 0 | 16 | 2,210 | 2,573 | 1,288 | 1,285 | 136 | 9 |
{-# LANGUAGE PatternGuards, RecordWildCards #-}
module Language.CFrp.CodeGen (codeGen, runtimeHeaderPath) where
import qualified Data.DList as D
import Data.List (intercalate)
import qualified Data.Map as M
import Data.Monoid ((<>))
import Paths_cfrp (getDataFileName)
import System.IO.Unsafe (unsafePerformIO)
import ... | psg-titech/cfrp | src/Language/CFrp/CodeGen.hs | mit | 5,473 | 0 | 22 | 1,136 | 1,905 | 965 | 940 | 109 | 7 |
module Crackers.Smtp (
smtpOk,
creds
)
where
import Network.HaskellNet.SMTP
import Network.HaskellNet.SMTP.SSL
import Network.HaskellNet.Auth (AuthType(LOGIN))
smtpOk :: Int -> Bool
smtpOk = (== 235)
creds :: String -> String -> String -> IO (String, Bool)
creds host username password = doSMTPSTARTTLS host ... | mom0/crackers | Crackers/Smtp.hs | mit | 469 | 0 | 11 | 86 | 169 | 95 | 74 | 12 | 2 |
{-# OPTIONS -fvia-C -O2 -optc-O3 #-}
module Language.Haskell.Pointfree.Optimize (
optimize,
) where
import Language.Haskell.Pointfree.Common
import Language.Haskell.Pointfree.Rules
import Language.Haskell.Pointfree.PrettyPrinter
import Data.List (nub)
import Control.Monad.State
cut :: [a] -> [a]
cut = take 1
... | substack/hs-disappoint | src/Language/Haskell/Pointfree/Optimize.hs | mit | 3,811 | 0 | 20 | 1,342 | 1,469 | 757 | 712 | -1 | -1 |
{-|
Module: Flaw.Data.Sqlite
Description: Simple SQLite Haskell interface.
License: MIT
-}
{-# LANGUAGE PatternSynonyms #-}
{-# OPTIONS_GHC -fno-warn-missing-pattern-synonym-signatures #-}
module Flaw.Data.Sqlite
( SqliteDb()
, SqliteStmt()
, SqliteQuery()
, sqliteDb
, sqliteExec
, sqliteStmt
, sqliteQu... | quyse/flaw | flaw-sqlite/Flaw/Data/Sqlite.hs | mit | 10,661 | 0 | 23 | 1,971 | 2,929 | 1,478 | 1,451 | -1 | -1 |
-- Формирует из сокращения имени конфига его полное имя.
-- Используется shell-скриптами для дополнения аргументов других команд.
--
-- $1 — сокращение имени конфига, если не задано, то выведет все доступные
-- имена конфигов. Содержимое каталогов начинающихся с подчёркивания
-- игнорируется. Выводит на stdout имена ... | kahless/netm | src/Cmd/Complete/Main.hs | mit | 1,407 | 1 | 13 | 193 | 167 | 86 | 81 | 15 | 2 |
module EmailHandler (
getReceiveConnection,
getLatestReports,
markAsRead,
ReceiveConnection,
MessageID
) where
import Control.Exception (try, SomeException)
import Data.ByteString.Internal(ByteString)
import qualified Data.Text.Lazy as Text (pack)
import Network.HaskellNet.IMAP
import Network.HaskellNe... | splondike/dmarc-check | src/EmailHandler.hs | gpl-2.0 | 2,535 | 0 | 16 | 581 | 602 | 317 | 285 | 55 | 5 |
{-# LANGUAGE TemplateHaskell #-}
module Persistence.Schema.ConsistencyStatusType where
import Database.Persist.TH
-- "Contradictory" and "Open" are only used on OMS while the other two can be
-- used on ConsistencyCheckAttempt. "Contradictory" is used when there are some
-- ConsistencyCheckAttempts with "Consistent" ... | spechub/Hets | Persistence/Schema/ConsistencyStatusType.hs | gpl-2.0 | 741 | 0 | 6 | 238 | 61 | 38 | 23 | 11 | 0 |
{-# LANGUAGE CPP, ScopedTypeVariables #-}
{-
Copyright (C) 2014 Matthew Pickering <matthewtpickering@gmail.com>
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... | timtylin/scholdoc-texmath | src/Text/TeXMath/Shared.hs | gpl-2.0 | 12,137 | 0 | 14 | 3,232 | 3,401 | 1,953 | 1,448 | 253 | 4 |
#!/usr/bin/env runhaskell
-- | Rabbits and Recurrence Relations
-- Usage: FIB <dataset.txt>
fib' :: Num b => b -> [b]
fib' k = 1 : 1 : [x*k+y | (x,y) <- zip (fib' k) (tail $ fib' k)]
rab :: Num a => Int -> a -> a
rab n k = fib' k !! (n-1)
main = do
line <- getLine
let (n:k:_) = words line
putStrLn $ s... | kerkomen/rosalind-haskell | stronghold/FIB.hs | gpl-2.0 | 361 | 0 | 12 | 97 | 199 | 101 | 98 | 8 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module FOOL.PrettyAST where
import FOOL.AST
import FOOL.TPTP
import Pretty
import qualified Text.PrettyPrint.ANSI.Leijen as PP
import Data.Char (toUpper, toLower)
import Data.List (sort)
{- Pretty -}
instance Pretty QOp where
pretty Forall = "!"
pretty Exists = "?"
instance Pr... | emptylambda/BLT | src/FOOL/PrettyAST.hs | gpl-3.0 | 5,641 | 0 | 17 | 1,564 | 2,178 | 1,092 | 1,086 | 129 | 17 |
module Shrdlite.AStar (
-- * Dataypes
AStarState
-- * Functions
, aStar
, aStar'
, resultList
, stateTrans
, updateState
)
where
import Data.Maybe
import Data.PSQueue (Binding(..))
import Shrdlite.Common
import qualified Data.Map as M
import qualified Data.PSQueue as Q
import qualified Data.... | chip2n/tin172-project | haskell/src/Shrdlite/AStar.hs | gpl-3.0 | 4,470 | 0 | 13 | 1,402 | 952 | 522 | 430 | 73 | 3 |
--we implement forward, backward, viterbi, baum-welch algorithms in this code
--HMM Class :
--- has states, observations, start_probability (states X 1), transition_probability (states X states), emission_probability (states X observations)
module HMM.HMM where
import Debug.Trace
import Data.Maybe
import Data.Array
... | rahulaaj/ML-Library | src/HMM/HMM.hs | gpl-3.0 | 13,778 | 34 | 17 | 2,621 | 3,553 | 1,859 | 1,694 | 141 | 2 |
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE FlexibleInstances #-}
--------------------------------------------------------------------------------
-- |
-- Module : Tct.Method.DP.UsableRules
-- Copyright : (c) Martin Avanzini <martin.avanzini@uibk.ac.at>,
-- Georg Moser <georg.moser@uibk.ac.at>... | mzini/TcT | source/Tct/Method/DP/UsableRules.hs | gpl-3.0 | 6,152 | 0 | 17 | 2,132 | 1,393 | 757 | 636 | 104 | 2 |
module Screen where
type Pos = (Int,Int)
data Color =
BLACK | RED | GREEN | YELLOW |
BLUE | MAGENTA | CYAN | WHITE
data Viewport = Viewport Pos Int Int
-- clear the text screen
cls :: IO()
cls = putStr "\ESC[2J"
-- make a beep
beep :: IO()
beep = putStr "\BEL"
-- move the cursor at the new pos (x,y)
goto :: ... | edoz90/PAP-Assignment | src/pap/ass02/Screen.hs | gpl-3.0 | 1,109 | 6 | 11 | 240 | 409 | 213 | 196 | 35 | 8 |
{-# LANGUAGE FlexibleContexts #-}
module Solver.SComponentWithCut
(checkSComponentWithCutSat)
where
import Data.SBV
import Data.List (genericLength)
import qualified Data.Map as M
import Util
import PetriNet
import Solver
type SizeIndicator = (Integer, Integer, Integer, Integer, Integer)
checkPrePostPlaces :: ... | cryptica/slapnet | src/Solver/SComponentWithCut.hs | gpl-3.0 | 7,349 | 0 | 17 | 2,316 | 2,462 | 1,235 | 1,227 | 133 | 10 |
module Y2017.R1A.D where
import Protolude
import Data.String
import GCJ
parse :: [String] -> [P]
solve' :: P -> S
write :: S -> Text
verify :: P -> S -> Verification
solve :: Bool -> Text -> Text
solve = GCJ.solve (Parse parse) (Solve solve') (Write write) (Verify verify)
example :: String
example = ""
data P = P... | joranvar/GCJ | src/gcj-lib/Y2017/R1A/D.hs | gpl-3.0 | 574 | 0 | 7 | 135 | 215 | 118 | 97 | 19 | 1 |
class X a where
f :: a -> Int
instance X (Maybe a) where
f n = n
main = f (Just 3) | Helium4Haskell/helium | test/typeClasses/ClassInstaneError8.hs | gpl-3.0 | 92 | 0 | 7 | 32 | 55 | 27 | 28 | 5 | 1 |
-----------------------------------------------------------------------------
--
-- Module : Data.DICOM.Tag
-- Copyright : Copyright (c) DICOM Grid 2015
-- License : GPL-3
--
-- Maintainer : paf31@cantab.net
-- Stability : experimental
-- Portability :
--
---------------------------------------------... | dicomgrid/dicom-haskell-library | src/Data/DICOM/Tag.hs | gpl-3.0 | 1,848 | 0 | 10 | 381 | 414 | 238 | 176 | 47 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-dataflow/gen/Network/Google/Resource/Dataflow/Projects/Jobs/Aggregated.hs | mpl-2.0 | 7,207 | 0 | 22 | 1,734 | 1,137 | 656 | 481 | 157 | 1 |
{- ORMOLU_DISABLE -}
-- Implicit CAD. Copyright (C) 2011, Christopher Olah (chris@colah.ca)
-- Copyright (C) 2014 2015, Julia Longtin (julial@turinglace.com)
-- Released under the GNU AGPLV3+, see LICENSE
-- FIXME: what are these for?
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ViewPatterns #-}
-- A Snap(HTTP) se... | colah/ImplicitCAD | programs/implicitsnap.hs | agpl-3.0 | 11,011 | 6 | 24 | 2,969 | 2,901 | 1,584 | 1,317 | 170 | 16 |
{- |
Module : $Header$
Description : Solution to problem 10
License : PublicDomain
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.
-}
module Solutions.Problem010 where
import Data.Numbers.Primes(primes)
solution n = sum (takeWhile (<n) primes)
| jhnesk/project-euler | src/Solutions/Problem010.hs | unlicense | 314 | 0 | 8 | 68 | 41 | 24 | 17 | 3 | 1 |
{-# LANGUAGE OverloadedStrings #-}
-- |
-- Module: Network.Riak.Content
-- Copyright: (c) 2011 MailRank, Inc.
-- License: Apache
-- Maintainer: Nathan Hunter <nhunter@janrain.com>
-- Stability: experimental
-- Portability: portable
--
-- Low-level content and link types and functions.
module Network.Ria... | janrain/riak-haskell-client | src/Network/Riak/Content.hs | apache-2.0 | 1,771 | 0 | 8 | 517 | 356 | 224 | 132 | 36 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE NamedFieldPuns #-}
{-# LANGUAGE PolyKinds #-}
{-# LANG... | dorchard/camfort | src/Language/Fortran/Model/Vars.hs | apache-2.0 | 4,697 | 0 | 16 | 1,055 | 987 | 529 | 458 | -1 | -1 |
-- Copyright 2020 Google LLC
--
-- 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 agreed to in ... | google/cabal2bazel | bzl/tests/rules/DefaultPackageTest.hs | apache-2.0 | 743 | 0 | 11 | 127 | 83 | 53 | 30 | 5 | 1 |
-- |
-- Module : Text.Megaparsec.Pos
-- Copyright : © 2015–2017 Megaparsec contributors
-- License : FreeBSD
--
-- Maintainer : Mark Karpov <markkarpov92@gmail.com>
-- Stability : experimental
-- Portability : portable
--
-- Textual source position. The position includes name of file, line number,
-... | recursion-ninja/megaparsec | Text/Megaparsec/Pos.hs | bsd-2-clause | 3,874 | 0 | 12 | 789 | 634 | 366 | 268 | 68 | 2 |
module Fib where
import CLaSH.Prelude
fib :: Signal (Unsigned 64)
fib = register 1 fib + register 0 (register 0 fib)
topEntity () = fib
expectedOutput :: Signal (Unsigned 64) -> Signal Bool
expectedOutput = outputVerifier $(v [1 :: Unsigned 64,1,2,3,5])
| ggreif/clash-compiler | tests/shouldwork/Feedback/Fib.hs | bsd-2-clause | 258 | 0 | 10 | 45 | 117 | 61 | 56 | -1 | -1 |
{-# LANGUAGE TupleSections #-}
module DuckTest.Infer.AST where
{- This module will, for each statement in an AST, infer
- the type of that statement, as well as collect the
- variables needed. -}
import DuckTest.Types
import DuckTest.Internal.Common
import DuckTest.Monad
import DuckTest.Infer.Functions
import Duck... | jrahm/DuckTest | src/DuckTest/Infer/AST.hs | bsd-2-clause | 1,310 | 0 | 14 | 308 | 306 | 167 | 139 | 22 | 2 |
module Data.MediaBus.Conduit.ReorderSpec
( spec,
)
where
import Conduit
import Control.Monad
import Data.Conduit.List
import Data.MediaBus
import Data.Proxy
import Data.Word
import Debug.Trace
import Test.Hspec
import Test.QuickCheck
spec :: Spec
spec =
describe "reorderFramesBySeqNumC" $ do
let runC inputs... | lindenbaum/mediabus | specs/Data/MediaBus/Conduit/ReorderSpec.hs | bsd-3-clause | 6,102 | 0 | 23 | 2,520 | 1,516 | 761 | 755 | 161 | 2 |
module ANTs
(computeRigid
,computeWarp
,applyTransforms
,upsample
) where
-- import Software.ANTs (ANTs (..))
import Control.Monad.Extra (whenM)
import Data.Maybe (fromMaybe)
import Development.Shake (Action, CmdOption (AddEnv), cmd, liftIO,
... | pnlbwh/test-tensormasking | pipeline-lib/ANTs.hs | bsd-3-clause | 5,763 | 0 | 20 | 1,615 | 1,455 | 773 | 682 | 114 | 2 |
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
module Language.Haskell.HGrep.Print (
printParseError
, printSearchResult
, printSearchResultLocation
) where
import qualified Data.List as L
import qualified Data.Map as Map
import qualified Text.Printf as T
import qualified Language.H... | thumphries/hgrep | src/Language/Haskell/HGrep/Print.hs | bsd-3-clause | 3,231 | 1 | 15 | 764 | 761 | 424 | 337 | 70 | 7 |
{-# LANGUAGE BangPatterns, DeriveDataTypeable, DeriveGeneric, FlexibleInstances, MultiParamTypeClasses #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
module Web.RTBBidder.Protocol.Adx.BidRequest.AdSlot.MediationStatus (MediationStatus(..)) where
import Prelude ((+), (/), (.))
import qualified Prelude as Prelude'
imp... | hiratara/hs-rtb-bidder | src/Web/RTBBidder/Protocol/Adx/BidRequest/AdSlot/MediationStatus.hs | bsd-3-clause | 2,770 | 0 | 11 | 454 | 636 | 351 | 285 | 59 | 1 |
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE FlexibleContexts #-}
import Control.Arrow ((&&&))
import Text.Printf
import qualified Animation as A
import Control.IApplicative
import Control.Mon... | byorgey/new-active | src/old/Test2.hs | bsd-3-clause | 1,444 | 0 | 17 | 445 | 430 | 236 | 194 | 30 | 1 |
module Main where
import Why3.AsProcess
main :: IO ()
main = do
putStrLn $ show $ dischargeTheory Z3 "theory X goal a: forall a:int. a = a end"
| cavi-art/why3-hs | app/Main.hs | bsd-3-clause | 148 | 0 | 8 | 32 | 40 | 21 | 19 | 5 | 1 |
{-
(c) The University of Glasgow 2006
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998
-}
{-# LANGUAGE DeriveDataTypeable, BangPatterns #-}
-- |
-- #name_types#
-- GHC uses several kinds of name internally:
--
-- * 'OccName.OccName' represents names as strings with just a little more information:
-- the \"... | GaloisInc/halvm-ghc | compiler/basicTypes/OccName.hs | bsd-3-clause | 33,071 | 0 | 14 | 8,804 | 5,768 | 3,082 | 2,686 | 475 | 5 |
module GameData.Star where
import qualified Gamgine.Math.Vect as V
import qualified Gamgine.Math.Box as B
import qualified GameData.Entity as E
newStar :: Int -> V.Vect -> E.Entity
newStar id pos = E.Star {
E.starId = id,
E.starPosition = pos,
E.starBound = starBound starSize,
E.starCollected... | dan-t/layers | src/GameData/Star.hs | bsd-3-clause | 479 | 0 | 8 | 106 | 182 | 108 | 74 | 14 | 1 |
module Data.TTask.Types
( module Data.TTask.Types.Types
, module Data.TTask.Types.Lens
, module Data.TTask.Types.Class
) where
import Data.TTask.Types.Types
import Data.TTask.Types.Lens
import Data.TTask.Types.Class
| tokiwoousaka/ttask | src/Data/TTask/Types.hs | bsd-3-clause | 225 | 0 | 5 | 28 | 54 | 39 | 15 | 7 | 0 |
{-# LANGUAGE TemplateHaskell #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE GADTs #-}
module QuakeState ( QuakeState(..)
, initialQuakeState
, globals
, comGlobals
, cmdGlobals
, keyGlobals
, fsGlobals
... | ksaveljev/hake-2 | src/QuakeState.hs | bsd-3-clause | 9,223 | 0 | 6 | 3,553 | 1,184 | 793 | 391 | 214 | 1 |
{-# OPTIONS_GHC -Wall #-}
module System.Console.ShSh.Builtins.Seq ( runSeq ) where
import System.Console.ShSh.IO ( oPutStr )
import System.Console.ShSh.Shell ( Shell )
import System.Exit ( ExitCode(..) )
{-# NOINLINE runSeq #-}
runSeq :: [String] -> Shell ExitCode
runSeq args = do ns <- case args of
... | shicks/shsh | System/Console/ShSh/Builtins/Seq.hs | bsd-3-clause | 657 | 0 | 14 | 209 | 213 | 116 | 97 | 14 | 4 |
{-|
Module : IRTS.Compiler
Description : Coordinates the compilation process.
Copyright :
License : BSD3
Maintainer : The Idris Community.
-}
{-# LANGUAGE PatternGuards, TypeSynonymInstances, CPP #-}
module IRTS.Compiler(compile, generate) where
import IRTS.Lang
import IRTS.LangOpts
import IRTS.Defunction... | ozgurakgun/Idris-dev | src/IRTS/Compiler.hs | bsd-3-clause | 25,108 | 0 | 27 | 8,568 | 8,405 | 4,160 | 4,245 | 462 | 33 |
----------------------------------------------------------------------
-- |
-- Module : WBXML.WbxmlDefs
-- Copyright : Mike Limansky, 2011
-- Licencse : BSD3
--
-- This module contains definition of different contstants defined in
-- WBXML standard.
--
------------------------------------------------------... | limansky/wbxml | src/Wbxml/WbxmlDefs.hs | bsd-3-clause | 1,105 | 0 | 5 | 196 | 199 | 128 | 71 | 27 | 1 |
-- |Nettle with additional features. None of this code is Frenetic-specific.
module Frenetic.NettleEx
( module Nettle.OpenFlow
, module Nettle.Servers.Server
, ethVLANId
, ethVLANPcp
, ethSrcIP
, ethDstIP
, ethProto
, ethTOS
, srcPort
, dstPort
) where
import Frenetic.Common
import qualified Data... | frenetic-lang/netcore-1.0 | src/Frenetic/NettleEx.hs | bsd-3-clause | 2,721 | 0 | 11 | 447 | 998 | 510 | 488 | 69 | 7 |
{-# LANGUAGE FlexibleContexts #-}
module Main where
import qualified Control.Monad.Trans.RSS.Lazy as RSSL
import qualified Control.Monad.Trans.RSS.Strict as RSSS
import qualified Control.Monad.Trans.RWS.Lazy as RWSL
import qualified Control.Monad.Trans.RWS.Strict as RWSS
import Criterion
import Criterion.Main
import... | bartavelle/stateWriter | bench/bench.hs | bsd-3-clause | 1,652 | 0 | 14 | 452 | 570 | 321 | 249 | 37 | 1 |
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE TypeFamilies #-}
module EFA.Application.Optimisation.Loop where
--import qualified Graphics.Gnuplot.Terminal.Default as DefaultTerm
import qualified EFA.Application.Optimisation.Base as Base
import qua... | energyflowanalysis/efa-2.1 | src/EFA/Application/Optimisation/Loop.hs | bsd-3-clause | 17,614 | 0 | 16 | 3,392 | 5,247 | 2,737 | 2,510 | 352 | 5 |
module Main (main) where
import Control.Applicative ((<$>), (<*>), (<*), (*>))
import Control.Monad
import Data.Tuple (swap)
import Data.List
import Network
import System.IO
import Text.Parsec hiding (Reply)
------------------------------------------------------------------------
main :: IO ()
main = vimServer 9191
... | jystic/vim-ghc | src/Main.hs | bsd-3-clause | 4,584 | 0 | 13 | 1,128 | 1,401 | 708 | 693 | 120 | 4 |
{-# LINE 1 "Data.Typeable.Internal.hs" #-}
{-# LANGUAGE Trustworthy #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE CPP #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE NoImplicitPrelude #-... | phischu/fragnix | builtins/base/Data.Typeable.Internal.hs | bsd-3-clause | 15,433 | 0 | 15 | 4,372 | 3,518 | 1,921 | 1,597 | 238 | 3 |
{-|
Module : Translate
Description : Translate Python code to CUDA C++
Maintainer : Josh Acay <cacay@cmu.edu>
Stability : experimental
-}
module Translate (py2cuda) where
import Control.Arrow ((&&&), left)
import Control.Monad (liftM)
import Control.Monad.Error (throwError)
import qualified Data.Map.Strict as ... | oulgen/CudaPy | py2cuda/src/Translate.hs | mit | 1,888 | 0 | 15 | 338 | 614 | 317 | 297 | 40 | 2 |
{-# LANGUAGE TemplateHaskell, CPP #-}
module Yesod.Routes.TH.RenderRoute
( -- ** RenderRoute
mkRenderRouteInstance
, mkRouteCons
, mkRenderRouteClauses
) where
import Yesod.Routes.TH.Types
import Language.Haskell.TH (conT)
import Language.Haskell.TH.Syntax
import Data.Bits (xor)
import Data.Maybe... | s9gf4ult/yesod | yesod-core/Yesod/Routes/TH/RenderRoute.hs | mit | 6,054 | 0 | 21 | 1,828 | 2,043 | 1,041 | 1,002 | 118 | 9 |
{-# LANGUAGE MultiParamTypeClasses, TypeSynonymInstances, FlexibleInstances #-}
{- |
Module : ./Comorphisms/CASL2VSERefine.hs
Description : VSE refinement as comorphism
Copyright : (c) M. Codescu, DFKI Bremen 2008
License : GPLv2 or higher, see LICENSE.txt
Maintainer : Mihai.Codescu@dfki.de
Stability ... | spechub/Hets | Comorphisms/CASL2VSERefine.hs | gpl-2.0 | 38,394 | 0 | 49 | 21,581 | 8,064 | 4,121 | 3,943 | 830 | 14 |
module Ex13 where
f 1 x = 0.0
f n x = (n*x) + f (n-1) x
| roberth/uu-helium | test/typeerrors/Edinburgh/Ex13.hs | gpl-3.0 | 57 | 0 | 8 | 18 | 47 | 25 | 22 | 3 | 1 |
<?xml version="1.0" encoding='ISO-8859-1' ?>
<!DOCTYPE helpset
PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp HelpSet Version 1.0//EN"
"http://java.sun.com/products/javahelp/helpset_1_0.dtd">
<helpset version="2.0">
<title>BEW's help menu</title>
<maps>
<!-- Default page -->
<homeID>index</homeID>
... | sing-group/BEW | plugins_src/bew/help/help_set.hs | gpl-3.0 | 1,036 | 78 | 52 | 233 | 370 | 190 | 180 | -1 | -1 |
{-# OPTIONS_GHC -F -pgmF doctest-discover -optF test/config.json #-}
| adarqui/ToyBox | haskell/haskell/stm/test/doctests.hs | gpl-3.0 | 69 | 0 | 2 | 8 | 3 | 2 | 1 | 1 | 0 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# L... | romanb/amazonka | amazonka-autoscaling/gen/Network/AWS/AutoScaling/EnterStandby.hs | mpl-2.0 | 5,149 | 0 | 10 | 1,093 | 626 | 379 | 247 | 73 | 1 |
f :: Int -> [Int] -> [Int]
f n arr = [x | x <- arr, x < n]
main = do
n <- readLn :: IO Int
inputdata <- getContents
let
numbers = map read (lines inputdata) :: [Int]
putStrLn . unlines $ (map show . f n) numbers
| EdisonAlgorithms/HackerRank | practice/fp/intro/fp-filter-array/fp-filter-array.hs | mit | 242 | 0 | 12 | 80 | 127 | 63 | 64 | 8 | 1 |
main = 3 --> 4
(-->) x y = x + y
| roberth/uu-helium | test/simple/parser/MaximalMunch.hs | gpl-3.0 | 34 | 0 | 5 | 13 | 26 | 14 | 12 | 2 | 1 |
{-# language DeriveDataTypeable #-}
module Base.Configuration.Controls (
Controls,
leftKey,
rightKey,
upKey,
downKey,
jumpKey,
contextKey,
KeysHint(..),
isFullscreenSwapShortcut,
keysContext,
-- * menu
isMenuUp,
isMenuDown,
isMenuConfirmation,
isMenuBack,
... | geocurnoff/nikki | src/Base/Configuration/Controls.hs | lgpl-3.0 | 7,440 | 0 | 14 | 1,571 | 2,130 | 1,179 | 951 | 183 | 2 |
{-# OPTIONS -fno-warn-type-defaults #-}
-- ----------------------------------------------------------------------------
-- | Handle conversion of CmmProc to LLVM code.
--
{-# LANGUAGE GADTs #-}
module LlvmCodeGen.CodeGen ( genLlvmProc ) where
#include "HsVersions.h"
import Llvm
import LlvmCodeGen.Base
import LlvmCod... | lukexi/ghc-7.8-arm64 | compiler/llvmGen/LlvmCodeGen/CodeGen.hs | bsd-3-clause | 61,983 | 0 | 24 | 19,275 | 17,326 | 8,680 | 8,646 | -1 | -1 |
{-# LANGUAGE OverloadedStrings #-}
{-|
Module : WebParsing.GraphConversion
Description : Converts Course records into Dynamic Inductive Graphs for further modification
Stability : experimental
Currently has the ability to extract course information from the database and convert it into a
a extendable inductive... | Ian-Stewart-Binks/courseography | hs/WebParsing/GraphConversion.hs | gpl-3.0 | 8,824 | 0 | 18 | 1,855 | 2,074 | 1,169 | 905 | 116 | 2 |
<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE helpset PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp HelpSet Version 2.0//EN" "http://java.sun.com/products/javahelp/helpset_2_0.dtd">
<helpset version="2.0" xml:lang="sr-CS">
<title>ViewState</title>
<maps>
<homeID>viewstate</homeID>
<mapref location="ma... | kingthorin/zap-extensions | addOns/viewstate/src/main/javahelp/help_sr_CS/helpset_sr_CS.hs | apache-2.0 | 960 | 77 | 66 | 155 | 404 | 205 | 199 | -1 | -1 |
{-# LANGUAGE DataKinds, PolyKinds, ExplicitForAll #-}
module BadTelescope2 where
import Data.Kind
data SameKind :: k -> k -> *
foo :: forall a k (b :: k). SameKind a b
foo = undefined
| sdiehl/ghc | testsuite/tests/dependent/should_fail/BadTelescope2.hs | bsd-3-clause | 189 | 0 | 7 | 38 | 52 | 32 | 20 | -1 | -1 |
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE helpset PUBLIC "-//Sun Microsystems Inc.//DTD JavaHelp HelpSet Version 2.0//EN" "http://java.sun.com/products/javahelp/helpset_2_0.dtd">
<helpset version="2.0" xml:lang="id-ID">
<title>WebSockets | ZAP Extension</title>
<maps>
<homeID>top</homeID>
<mapref ... | msrader/zap-extensions | src/org/zaproxy/zap/extension/websocket/resources/help_id_ID/helpset_id_ID.hs | apache-2.0 | 974 | 80 | 66 | 159 | 413 | 209 | 204 | -1 | -1 |
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE QuasiQuotes #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
import Prelude hiding (filter)
import Database.Persist.Sqlite
import Control.Monad.IO.Class
mkPersist [$persist|
Person sql=PersonTable
name String update Eq Ne Desc In
age Int update "Asc" Lt "some ignored a... | jasonzoladz/persistent | persistent-sqlite/test1.hs | mit | 3,738 | 2 | 12 | 1,000 | 1,561 | 724 | 837 | -1 | -1 |
-- !!! qualified names aren't allowed in local binds either
-- (Haskell 98 (revised) section 5.5.1)
module M where
g x = let M.y = x + 1 in M.y
| wxwxwwxxx/ghc | testsuite/tests/rename/should_fail/rnfail034.hs | bsd-3-clause | 144 | 1 | 9 | 30 | 33 | 18 | 15 | -1 | -1 |
-- !!! a file mailed us by Ryzard Kubiak. This provides a good test of the code
-- !!! handling type signatures and recursive data types.
module ShouldSucceed where
data Boolean = FF | TT
data Pair a b = Mkpair a b
data List alpha = Nil | Cons alpha (List alpha)
data Nat = Zero | Succ Nat
data Tree t = Leaf t | Node ... | siddhanathan/ghc | testsuite/tests/typecheck/should_compile/tc042.hs | bsd-3-clause | 1,829 | 0 | 13 | 787 | 720 | 355 | 365 | 53 | 3 |
module Paths_novel_monad (
version,
getBinDir, getLibDir, getDataDir, getLibexecDir,
getDataFileName, getSysconfDir
) where
import qualified Control.Exception as Exception
import Data.Version (Version(..))
import System.Environment (getEnv)
import Prelude
catchIO :: IO a -> (Exception.IOException -> IO ... | tokiwoousaka/NovelMonad | dist/build/autogen/Paths_novel_monad.hs | mit | 1,362 | 0 | 10 | 182 | 371 | 213 | 158 | 28 | 1 |
{- | Two phase algorithm to solve a Rubik's cube -}
{-# LANGUAGE RecordWildCards, ViewPatterns #-}
module Rubik.Solver.TwoPhase where
import Rubik.Cube
import Rubik.Misc
import Rubik.Solver
import Rubik.Tables.Moves
import Rubik.Tables.Distances
import Data.Function ( on )
import Data.Monoid
{-# INLINE phase1Proj #... | Lysxia/twentyseven | src/Rubik/Solver/TwoPhase.hs | mit | 1,730 | 4 | 14 | 311 | 464 | 260 | 204 | 42 | 1 |
-----------------------------------------------------------------------------
--
-- Module : Language.PureScript.Sugar.Operators
-- Copyright : (c) 2013-15 Phil Freeman, (c) 2014-15 Gary Burgess
-- License : MIT (http://opensource.org/licenses/MIT)
--
-- Maintainer : Phil Freeman <paf31@cantab.net>
-- S... | michaelficarra/purescript | src/Language/PureScript/Sugar/Operators.hs | mit | 6,892 | 0 | 23 | 1,211 | 2,485 | 1,321 | 1,164 | 117 | 4 |
module Escape where
import Data.Text (pack, unpack)
import Data.Text.Encoding (encodeUtf8, decodeUtf8)
import Prelude
import Text.ShellEscape (Bash, escape, bytes)
-- | Escapes ASCII string as a bash literal. Might work for UTF-8, not
-- certain.
stringToBashLiteral :: String -> String
stringToBashLiteral = unpack . ... | mgsloan/compconfig | env/src/Escape.hs | mit | 374 | 0 | 10 | 55 | 91 | 54 | 37 | -1 | -1 |
{-# LANGUAGE AllowAmbiguousTypes #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE CPP #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GADTs #-}
{-# LANG... | VinylRecords/Vinyl | Data/Vinyl/Class/Method.hs | mit | 12,628 | 0 | 14 | 2,935 | 2,341 | 1,239 | 1,102 | 144 | 1 |
{-# LANGUAGE TupleSections #-}
module TypeChecker where
import Control.Applicative hiding (empty)
import Control.Monad
import Control.Monad.Except
import Control.Monad.Reader
import Data.Map (Map,(!),mapWithKey,assocs,filterWithKey,elems,keys
,intersection,intersectionWith,intersectionWithKey
... | linuborj/cubicaltt | TypeChecker.hs | mit | 18,550 | 0 | 31 | 5,589 | 7,445 | 3,630 | 3,815 | 425 | 24 |
module Text.XML.DOM.Parser.Types
(-- * Element matching
ElemMatcher(..)
, emMatch
, emShow
, matchElemName
, elMatch
-- * Name matching
, NameMatcher(..)
, nmMatch
, nmShow
, matchName
, matchLocalName
, matchCILocalName
-- * Parser internals
, DomPath(..)
, ParserError(..)
, peP... | typeable/dom-parser | src/Text/XML/DOM/Parser/Types.hs | mit | 6,207 | 0 | 15 | 1,336 | 1,116 | 653 | 463 | -1 | -1 |
module Main where
import qualified Data.Text as T
import qualified Data.Text.IO as TIO
import Data.Char
import System.Environment (getArgs)
import TopStrings
nFromArgs :: [String] -> Int
nFromArgs [] = 1
nFromArgs (n:_) = read n
comb :: Int -> T.Text -> [T.Text]
comb n = map (T.take n) . T.tails
main :: IO ()
main... | spoj/mwtools | app/topchars.hs | mit | 435 | 0 | 11 | 81 | 180 | 97 | 83 | 15 | 1 |
module Data.AminoAcid where
{--
Continuation of the solution for sequencing amino acids
started with Data.Bases at http://lpaste.net/107069
This module contains quite a bit of commented-out false-starts.
I kept the comments in to show where and how I stumbled, feet
of clay, and all that, please let me know ... | nightski/1HaskellADay | Data/AminoAcid.hs | mit | 8,711 | 0 | 17 | 2,406 | 1,190 | 629 | 561 | 63 | 4 |
{-# OPTIONS -Wall #-}
{-# LANGUAGE ScopedTypeVariables #-}
main :: IO ()
main = do
depths :: [Int] <- map read . filter (not . null) . lines <$> getContents
let answer = length $ filter id $ zipWith (<) depths (tail depths)
print answer
| SamirTalwar/advent-of-code | 2021/AOC_01_1.hs | mit | 244 | 0 | 13 | 52 | 98 | 48 | 50 | 7 | 1 |
module GrData (grdata, grdata', GrData(..)) where
import Data.Array
import qualified Data.Map as Map
import qualified Data.Set as Set
import Groups
import Groups.Internals (factor, (?:), TernaryBranch(..))
data GrData = GrData {
gd_order :: Int, -- Rename "gd_size"?
gd_abelian :: Bool,
gd_nilpotence :: May... | jwodder/groups | haskell/dev/GrData.hs | mit | 3,244 | 26 | 15 | 798 | 1,253 | 709 | 544 | 71 | 1 |
{-# LANGUAGE RecordWildCards #-}
module SessionSpec (spec) where
import Helper
import System.Environment.Blank (setEnv)
import Language.Haskell.GhciWrapper (eval)
import qualified Session
import Session (Session(..), Summary(..), hspecFailureEnvName, hspecPreviousSummary, hspe... | hspec/sensei | test/SessionSpec.hs | mit | 3,626 | 0 | 24 | 905 | 966 | 460 | 506 | 75 | 1 |
{-# LANGUAGE OverloadedStrings #-}
module Main where
import qualified Prelude
import Yage.Prelude
import Yage.Math
import Yage.Data.List (piz)
import Yage.Image
import Data.Text.Read
import Control.Monad (when)
import Codec.Picture
import System.Random
import Control.Monad.Random
import Yage.Texture.Atlas
import Y... | MaxDaten/yage | test/manuals/RndTextureAtlas.hs | mit | 1,742 | 0 | 14 | 470 | 507 | 263 | 244 | 49 | 1 |
import RandomPermutation
import System.Random
main :: IO ()
main = do
contents <- readFile "/home/ildar/Projects/HaskelDev/random_permutation/input.txt"
let numList = map readInt . words $ contents
print "Input:"
print numList
print "imperative:"
print $ imperativePerm... | ILDAR9/permutation_seq | Main.hs | gpl-2.0 | 926 | 0 | 12 | 252 | 198 | 86 | 112 | 23 | 1 |
{-# LANGUAGE TemplateHaskell #-}
module PL.Param where
import PL.Type
import Autolib.Reader
import Autolib.ToDoc
import Data.Typeable
data Param =
Param { model_size :: Int -- TODO: Atleast, Atmost, ...
, formel :: Formel
}
deriving ( Typeable )
example :: Param
example = Param
{ model_size = 4... | florianpilz/autotool | src/PL/Param.hs | gpl-2.0 | 463 | 6 | 9 | 100 | 115 | 69 | 46 | 15 | 1 |
-- |
-- Module: Tasks.Project
--
-- This module contains the Project type.
-- Like the Task type, a Project has a name and may have notes,
-- but it also contains zero or more task entries.
-- Like task, it implements the Binary instance.
module Tasks.Project
(
Project(..) -- The @Project@ type
, projectHasT... | BigEndian/tasks | src/Tasks/Project.hs | gpl-2.0 | 4,450 | 0 | 11 | 1,132 | 1,000 | 570 | 430 | 89 | 2 |
{-# LANGUAGE GeneralizedNewtypeDeriving, TemplateHaskell #-}
module Eval.Types ( Stack
, Eval
, EvalError
, runEval
, stack
, definitions
) where
import Control.Applicative
import Control.Lens
import Control.Mo... | breestanwyck/stack-unification | src/Eval/Types.hs | gpl-2.0 | 929 | 0 | 9 | 303 | 234 | 135 | 99 | 29 | 0 |
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE ScopedTypeVariables #-}
module Commands.Import (commands) where
import Data.Conduit ((.|), runConduit)
import qualified Data.Conduit.Combinators as C
import Data.Proxy (Proxy(Proxy))
import Core
import Options
import Schema
import Sql (F... | merijn/GPU-benchmarks | benchmark-analysis/ingest-src/Commands/Import.hs | gpl-3.0 | 1,560 | 0 | 12 | 346 | 347 | 196 | 151 | 34 | 1 |
{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
module HeroesAndCowards.HACModel where
import System.Random
import Data.Maybe
import Control.DeepSeq
import GHC.Generics (Generic)
import qualified PureAgentsPar as PA
type HACAgentPosition = (Double, Double)
data HACMsg = PositionRequest | PositionUpdate HACAgentPosit... | thalerjonathan/phd | coding/prototyping/haskell/PureAgentsPar/src/HeroesAndCowards/HACModel.hs | gpl-3.0 | 7,602 | 0 | 13 | 1,982 | 2,428 | 1,336 | 1,092 | 146 | 2 |
module Language.Mulang.Inspector.ObjectOriented (
countAttributes,
countClasses,
countInterfaces,
countMethods,
countObjects,
implements,
includes,
inherits,
instantiates,
usesInheritance,
usesMixins,
declaresAttribute,
declaresAttributeMatching,
declaresClass,
declaresClassMatching,
dec... | mumuki/mulang | src/Language/Mulang/Inspector/ObjectOriented.hs | gpl-3.0 | 3,381 | 0 | 11 | 752 | 813 | 444 | 369 | 78 | 2 |
{-# LANGUAGE OverloadedStrings #-}
import Web.Scotty
import CalendarTransformer
import Data.Monoid (mconcat)
import Control.Monad.IO.Class
import Data.Default
import qualified Data.Text.Lazy as TL
transformer = def {eventT = move5thField2Location}
calendar :: Transformer -> String -> IO (Either TL.Text TL.Text)
cale... | nyson/calif | Main.hs | gpl-3.0 | 1,080 | 0 | 14 | 315 | 302 | 154 | 148 | 29 | 2 |
{-# LANGUAGE IncoherentInstances #-}
{-# LANGUAGE OverlappingInstances #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE TypeSynonymInstances #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE GADTs #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
module Test where
import Data.... | haraldsteinlechner/lambdaWolf | EdslTest.hs | gpl-3.0 | 6,727 | 0 | 12 | 1,826 | 3,026 | 1,562 | 1,464 | 187 | 2 |
{-# LANGUAGE OverloadedStrings #-}
module Sound.Tidal.ParseTest where
import TestUtils
import Test.Microspec
import Prelude hiding ((<*), (*>))
import Sound.Tidal.Core
import Sound.Tidal.Pattern
import Sound.Tidal.UI (_degradeBy)
run :: Microspec ()
run =
describe "Sound.Tidal.Parse" $ do
describe "parseBP_E... | d0kt0r0/Tidal | test/Sound/Tidal/ParseTest.hs | gpl-3.0 | 4,442 | 0 | 21 | 1,603 | 1,413 | 695 | 718 | 121 | 1 |
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE RecordWildCards #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators ... | brendanhay/gogol | gogol-shopping-content/gen/Network/Google/Resource/Content/Orders/Refunditem.hs | mpl-2.0 | 5,602 | 0 | 20 | 1,387 | 882 | 511 | 371 | 129 | 1 |
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE OverloadedStrings #-}
{-# OPTIONS_GHC -fno-warn-unused-imports #-}
-- |
-- Module : Network.Google.DoubleClickSearch.Types.Sum
-- Copyright : (c) 2015-20... | brendanhay/gogol | gogol-doubleclick-search/gen/Network/Google/DoubleClickSearch/Types/Sum.hs | mpl-2.0 | 1,237 | 0 | 11 | 292 | 197 | 114 | 83 | 26 | 0 |
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE TemplateHaskell #-}
module BookIndexer.Types.BookInfo (BookInfo(..), id_, rev, read_, token, author, title, epubVersion, onedriveId) where
import Control.Le... | asvyazin/my-books.purs | server/my-books/BookIndexer/Types/BookInfo.hs | mpl-2.0 | 1,545 | 0 | 23 | 355 | 468 | 277 | 191 | 35 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.