Skip to content

Instantly share code, notes, and snippets.

View MrKickkiller's full-sized avatar

Mathieu Coussens MrKickkiller

View GitHub Profile
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
/**
* Created by Mathieu Coussens on 17/03/2015
* Behoort tot driekwartstegels
* Created in IntelliJ
*/
public class MijnBetegelaar implements Betegelaar{
FTB Launcher logs:
[10:43:28] [DEBUG] LaunchFrame.main:219: FTB Launcher CI Build #: 203, Git SHA: 9b3092c84c648524d65019efecfa000588d7773e
[10:43:28] [INFO] JGoogleAnalyticsTracker$2.run:484: AnalyticsBackgroundThread started
[10:43:28] [INFO] LaunchFrameHelpers.printInfo:33: FTBLaunch starting up (version 1.4.3 Build: 10403)
[10:43:28] [INFO] LaunchFrameHelpers.printInfo:34: Java version: 1.8.0_51
[10:43:28] [INFO] LaunchFrameHelpers.printInfo:35: Java vendor: Oracle Corporation
[10:43:28] [INFO] LaunchFrameHelpers.printInfo:36: Java home: C:\Program Files\Java\jre1.8.0_51
[10:43:28] [INFO] LaunchFrameHelpers.printInfo:37: Java specification: Java Virtual Machine Specification version: 1.8 by Oracle Corporation
[10:43:28] [INFO] LaunchFrameHelpers.printInfo:39: Java vm: Java HotSpot(TM) 64-Bit Server VM version: 25.51-b03 by Oracle Corporation
[10:43:28] [INFO] LaunchFrameHelpers.printInfo:40: OS: Windows 8.1 6.3 (64-bit)
public class CookiesCommand implements Command {
Pattern userMatcher = Pattern.compile("[^_][A-z0-9_]*");
HashMap<String, Command> subCommandHashMap = new HashMap<>();
CookieKeeper ck = new CookieKeeper();
public CookiesCommand() {
subCommandHashMap.put("give", new CookiesGiveSubCommand());
David -- Seppe
David && Peck -- xxxx
David && Bert && Rowan -- Veronique
module Parser where
import LoopWhile
import System.IO
import Control.Monad
import Text.ParserCombinators.Parsec
import Text.ParserCombinators.Parsec.Expr
import Text.ParserCombinators.Parsec.Language
import qualified Text.ParserCombinators.Parsec.Token as Token
module Parser where
import LoopWhile
import System.IO
import MBot
import Control.Monad
import Text.ParserCombinators.Parsec
import Text.ParserCombinators.Parsec.Expr
import Text.ParserCombinators.Parsec.Language
1. Lambda calculus: NOT, Add, Mult etc.
2. Fold: Implementeer een andere functie (zoals filter) met fold + Een lambda krijgen en zeggen wat hij zal doen in combinatie met fold.
3. Vul de definitie van een specifieke monad (List, Maybe, Either) aan.
4. Herschrijf met Do- Notatie of met >>= / >>
5. Par & Pseq: Wat doen ze + voorbeeld.
6. StateT transformer bind implementeren (State Monad def is gegeven)
7. Lenzen compositie.
8. Equational reasoning:
-> add n Zero = n
<amadornes> Soaryn said yes a couple of days ago
<amadornes> just as I was leaving
<MrKickkiller> Soaryn said yes! Congrats. You may kiss the bride
#pragma once
#include <ostream>
#include <iostream>
template <typename T>
class BinaryTree{
protected:
T data;
BinaryTree* left;
BinaryTree* right;
/* create node with given ID, return created node or NULL if creation failed */
bstnode* createNode(int id)
{
bstnode* ptr = calloc(1, sizeof(bstnode));
if (!ptr) return NULL;
ptr->id = id;
ptr->nr_of_prices = 0;
ptr->left = ptr->right = ptr->parent = NULL;
ptr->pl = NULL;
return ptr;