Skip to content

Instantly share code, notes, and snippets.

View matoous's full-sized avatar

Matouš Dzivjak matoous

View GitHub Profile

January trip

Searching for: trip to Canary Islands for 22-28 days in January, 4-6 people, 4 rooms.

Gran Canaria

Gran Canaria is the third largest island.

Flight: ±130 eur (Ryanair, Easyjet, Vueling), dates flexible, flies to Las Palmas

#/bin/sh
if [[ -x $GIT_TOKEN ]]; then
echo "you need to set GIT_TOKEN env variable"
exit 1
fi
# get all merge requests for our team
# filter the merge request for only those that have time spent != null
curl https://gitlab.skypicker.com/api/v4/groups/search-team/merge_requests\?state\=all\&created_after\=$(date -v-1w +%Y/%m/%d)\&per_page\=100 --header "Private-Token: $GIT_TOKEN" -s \
#/bin/sh
if [[ -x $GIT_TOKEN ]]; then
echo "you need to set GIT_TOKEN env variable"
exit 1
fi
# Get all merge requests for search-team, we can't use gonuts here because for example SearchAPI is under search team
# but we still sometimes work at it. Filter the merge request for only those that have time spent != null.
curl https://gitlab.skypicker.com/api/v4/groups/search-team/merge_requests\?state\=all\&per_page\=100 --header "Private-Token: $GIT_TOKEN" -s \
id title
tools
The coolest tools

Generic Essentials

  • Git: The version control system we use
    • macOS: brew install git
  • Linux: it's best to install git using your OS package manager

Keybase proof

I hereby claim:

  • I am matoous on github.
  • I am matousdz (https://keybase.io/matousdz) on keybase.
  • I have a public key ASDbTE8pF-UKuCJv3_Zem6t9p_9ZBwOG-Wh5PgoJNT0jFgo

To claim this, I am signing this object:

module ZipList where
type ZipList a = ([a], [a])
newList :: ZipList a
newList = ([], [])
moveLeft :: ZipList a -> ZipList a
moveLeft ((a:b), c) = (b, (a:c))
moveLeft _ = error "Invalid operation"
normalize :: [Double] -> [Double]
normalize l = map (\x -> x / (maximum normalized)) normalized
where normalized = map (\x -> (x - minimum l)) l
removeMax :: [Int] -> Int -> [Int]
removeMax ls mx = map (\x -> if x == mx then x - 1 else x) ls
increment :: [Int] -> Int -> [Int]
increment (a:b) 0 = (a + 1):b
increment (a:b) y = a:(increment b (y - 1))
#lang scheme
(define new-list '(() ()))
(define (left l) (car l))
(define (right l) (car (cdr l)))
(define (insert x l)
(list (left l) (cons x (right l))))
#lang scheme
(define (rbp n)
(define (help canBeRed n)
(if (= n 0) 1
(if canBeRed (+ (help #t (- n 1)) (help #f (- n 1)))
(help #t (- n 1)))))
(help #t n))
powerset :: [a] -> [[a]]
powerset [] = [[]]
powerset (a:b) = map (a:) p ++ p
where p = powerset b