🏳️⚧️
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/bin/bash | |
mkdir -p HPMoR | |
cd HPMoR | |
for episode in `wget -q -O - http://www.hpmorpodcast.com/?page_id=56 | sed -n -e "s/.*http\(.*\)\\.mp3.*/http\1.mp3/p" | uniq` | |
do | |
file="`echo "$episode" | sed -n -e 's/.*\/\([^/].*\)\.mp3.*/\1.mp3/p'`" | |
if [[ -f "$file" ]]; then | |
echo "$file exists. Skipping." | |
else |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{-# LANGUAGE LambdaCase #-} | |
module Main where | |
import Control.Applicative | |
data Parser a = | |
Parser { | |
runParser :: String -> (Either String a, String) | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{-# LANGUAGE MultiParamTypeClasses #-} | |
{-# LANGUAGE FlexibleInstances #-} | |
module Graph where | |
import Data.IntMap as IM | |
import Data.Maybe | |
-- unsere "oberste" Klasse | |
class HasGraph g n e where |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
all: ma.md bibma.bib template.tex settings/abkuerzungen.tex settings/commands.tex settings/environments.tex settings/hyphenation.tex settings/packages.tex files/titlepage.tex files/erklaerung.tex | |
pandoc -s -N --template=template.tex ma.md -o ma.tex | |
rm -f ma.pdf ma.aux ma.idx ma.lof ma.log ma.lot ma.out ma.tdo ma.toc ma.bbl ma.blg ma.loa | |
xelatex -interaction batchmode ma.tex || true | |
bibtexu ma | |
xelatex -interaction batchmode ma.tex || true | |
while test `cat ma.log | grep -e "Rerun to get \(citations correct\|cross-references right\)" | wc -l` -gt 0 ; do \ | |
rm ma.log && (xelatex -interaction batchmode ma.tex || true) \ | |
done | |
rm -f ma.aux ma.idx ma.lof ma.lot ma.out ma.tdo ma.toc ma.bbl ma.blg ma.loa |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Hi Spiegel, | |
da ich eine Statische IP besitzte und diese zweifelsohne ein personenbezogenes Datum ist | |
(der BGH hat unlängst geurteilt, dass selbst DYNAMISCHE IPs personenbezogene Daten sind, | |
obschon die idR. nur 24hgültig sind) und es mir passiert ist, dass ich auf Websites ihrer | |
Gruppe gesurft bin, möchte ich gerne mein Recht auf Löschung aller Daten bezüglich meiner IP | |
xxx.xxx.xxx.xxx | |
aus sämtlichen ihrer Datenspeicher bestehen (Art 15 Abs. 1 e) EU-DSGVO). |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function groupby | |
for o in (cut -d ',' -f 1 $argv[1] | uniq) | |
echo -n "{\"$o\":[" | |
grep "$o" $argv[1] | cut -d ',' -f 2 | sed 's/^\(.*\)$/"\1"/' | tr '\n' ','| sed 's/,$//' | |
echo "]}" | |
end | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function first | |
for file in $argv | |
echo "$file" | |
dd if="$file" count=25 status=none | head -n1 | |
echo "" | |
end | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function first | |
for file in $argv | |
echo "$file" | |
dd if="$file" count=25 status=none | head -n1 | |
echo "" | |
end | |
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import Data.Data | |
import Data.Functor.Const | |
import Data.Generics.Product.Types | |
-- This works on Data/Typeable, which is basically duck-typing from python | |
-- instead of GHC.Generics which work only at compile-time & have no runtime-cost. | |
extractAny :: (Data a, Typeable b) => a -> [b] | |
extractAny = getConst . gfoldl (\xs d -> case cast d of | |
Just a -> Const (a:getConst xs) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
>>> Define least and greatest fixpoint over a generation functor for me and explain how they are isomorphic in Haskell. Provide the proof of that isomorphism in Haskell-Code as well. | |
--- | |
In Haskell, the least fixpoint and the greatest fixpoint of a generation functor are defined as follows: | |
Least fixpoint: | |
f_least :: (a -> a) -> a | |
f_least f = f (f_least f) |
OlderNewer