cd $YOURPLACE
cabal list --simple | awk '{print ($1)}' | uniq | time xargs -P20 -n1 cabal get
| [("GCC extra via C opts", "") | |
| ,("C compiler command", "gcc") | |
| ,("C compiler flags", "--target=arm64-apple-darwin ") | |
| ,("C++ compiler command", "g++") | |
| ,("C++ compiler flags", "--target=arm64-apple-darwin ") | |
| ,("C compiler link flags", "") | |
| ,("C compiler supports -no-pie", "NO") | |
| ,("Haskell CPP command", "gcc") | |
| ,("Haskell CPP flags", "-E -undef -traditional -Wno-invalid-pp-token -Wno-unicode -Wno-trigraphs") | |
| ,("ld command", "ld") |
| {-# OPTIONS --type-in-type #-} | |
| open import Agda.Builtin.Unit | |
| open import Agda.Builtin.Sigma | |
| open import Data.Product | |
| data Ty : Set where | |
| U : Ty | |
| Pi : (A : Set) -> (A -> Ty) -> Ty | |
| PiInd : Ty -> Ty |
cd $YOURPLACE
cabal list --simple | awk '{print ($1)}' | uniq | time xargs -P20 -n1 cabal get
| $ rg -e fromListN -t haskell ./ | |
| ./network-topic-models-0.2.0.1/RunLDA.hs | |
| 139: let termCounts = V.fromListN (M.size nodeItems) | |
| ./network-topic-models-0.2.0.1/RunCI.hs | |
| 174: let termCounts = V.fromListN (M.size nodeItems) | |
| ./network-topic-models-0.2.0.1/RunST.hs | |
| 171: let termCounts = V.fromListN (M.size nodeItems) |
| d/dx (x ^ a) == d/dx (a -> x ) | |
| we never consider a ^ x === x -> a () | |
| log_x(\nu Y -> T) == \mu Z -> log_X T , where Z == log_X Y | |
| (translation: every time we see log_X Y , in T, replace taht with Z ) |
| module Main where | |
| import Data.Word | |
| import Data.Int | |
| import Foreign.Ptr | |
| import Foreign.C.Types | |
| main = c_MD5Final `seq` print "yay" |
| {-# LANGUAGE QuasiQuotes #-} | |
| {-# LANGUAGE TemplateHaskell #-} | |
| {-# LANGUAGE RoleAnnotations #-} | |
| {-# LANGUAGE ExplicitForAll#-} | |
| module Main where | |
| import Data.Struct | |
| --import Data.Struct.TH | |
| --import qualified Data.Coerce as Crc | |
| import Data.Coerce (coerce) |
| /* ======================================================================== | |
| A MODEL IN ALLOY | |
| OF A CORRECT VERSION OF THE CHORD RING-MAINTENANCE PROTOCOL | |
| Pamela Zave, August 2016. | |
| Copyright AT&T Labs, Inc., 2016, 2018. | |
| ======================================================================== */ | |
| open util/ordering[Time] as trace | |
| open util/ordering[Node] as ring |
| 143 .//sugarhaskell-0.1 | |
| 122 .//morfette-0.4.7 | |
| 53 .//http2-1.6.4 | |
| 40 .//cjk-0.1.0.1 | |
| 39 .//qt-1.1.6.1 | |
| 37 .//uhc-light-1.1.10.0 | |
| 37 .//cld2-0.1.1.1 | |
| 33 .//texmath-0.11.2 | |
| 33 .//happstack-yui-7373.5.3 | |
| 32 .//scholdoc-texmath-0.1.0.1 |
| install("inline")# not needed after the first time | |
| library("inline") | |
| nanBoom <- cfunction(c(dummy="ANY"),body=" | |
| fenv_t fenv; | |
| unsigned int new_excepts = FE_DIVBYZERO | FE_INVALID ; | |
| fegetenv(&fenv); | |
| fenv.__mxcsr &= ~(new_excepts << 7); | |
| fesetenv(&fenv); | |
| return dummy; | |
| ",includes="#include <fenv.h>",language="C") |