jakab922’s gists

jakab922 / template.html

Created June 9, 2016 14:54

	<!DOCTYPE html>
	<html>
	<head>
	<title>Showing the relationship graph for question {{n}}</title>
	<style>
	#graph-container {
	top: 0;
	bottom: 0;
	left: 0;
	right: 0;

jakab922 / descriptive_statistics_final_project.ipynb

Created May 20, 2016 14:44

Sorry, something went wrong. Reload?

Sorry, we cannot display this file.

Sorry, this file is invalid so it cannot be displayed.

jakab922 / battleship.py

Last active May 17, 2016 21:52

	from random import randint as ri, shuffle

	width, height = 5, 5
	ship_count = 5
	try_count = 5

	class NotOnTable(Exception):
	pass

	def guess(row, col):

jakab922 / transform_with_group.hs

Created March 25, 2016 14:55

	{-
	The file is based on:
	https://ocharles.org.uk/blog/guest-posts/2014-12-07-list-comprehensions.html
	-}

	{-# LANGUAGE TransformListComp, RecordWildCards #-}
	import GHC.Exts (groupWith, the)
	import Data.Ord (comparing)
	import Data.List (sortBy)

jakab922 / transform.hs

Created March 25, 2016 11:55

	{-
	Based on
	- https://www.schoolofhaskell.com/school/to-infinity-and-beyond/pick-of-the-week/guide-to-ghc-extensions/list-and-comprehension-extensions
	-}

	{-# LANGUAGE ParallelListComp, TransformListComp #-}

	f :: (Num a, Ord a) => [a] -> [a] -> [(a, a)]
	f xs ys = [(x, y) \| x <- xs,
	then (filter (\z -> z > 10))

jakab922 / aeson build error

Created March 23, 2016 16:14

	Resolving dependencies...
	Configuring aeson-0.11.1.3...
	Building aeson-0.11.1.3...
	Failed to install aeson-0.11.1.3
	Build log ( /home/dani/.cabal/logs/aeson-0.11.1.3.log ):
	Configuring aeson-0.11.1.3...
	Building aeson-0.11.1.3...
	Preprocessing library aeson-0.11.1.3...
	[ 1 of 16] Compiling Data.Aeson.Functions ( Data/Aeson/Functions.hs, dist/build/Data/Aeson/Functions.o )
	[ 2 of 16] Compiling Data.Aeson.Internal.Time ( Data/Aeson/Internal/Time.hs, dist/build/Data/Aeson/Internal/Time.o )

jakab922 / map_insert.py

Created March 23, 2016 09:14

	from random import randint as ri
	from sys import argv

	d = {}
	n = int(argv[1])
	for i in xrange(n):
	d[i] = ri(1, 100)

jakab922 / map_insert.hs

Last active March 23, 2016 09:03

	import qualified Data.Map as M
	import System.Random
	import System.Environment
	import Control.Monad


	insert :: Int -> M.Map Int Int -> [Int] -> M.Map Int Int
	insert n m randoms
	\| n < 1 = m
	\| otherwise = insert (n - 1) new_map new_randoms

jakab922 / view_patterns_example_with_data_sequence.hs

Created March 23, 2016 08:48

	{-# LANGUAGE ViewPatterns #-}

	import qualified Data.Sequence as S
	import System.Environment
	import Control.Monad

	data List a = Nil \| Cons a (List a)

	mylast :: S.Seq a -> Maybe a
	mylast (S.viewr -> xs S.:> x) = Just x

jakab922 / vcard.hs

Created March 11, 2016 11:37

	-- A spinoff of the Vcard.hs example from http://book.realworldhaskell.org/read/programming-with-monads.html
	import Control.Monad

	data Context = Home \| Mobile \| Business
	deriving (Eq, Show)

	type Phone = String
	type Phones = [Phone]

	albulena = [(Home, "+35-1234")]

Daniel Papp jakab922