Attention: the list was moved to
https://github.com/dypsilon/frontend-dev-bookmarks
This page is not maintained anymore, please update your bookmarks.
Zilvinas Kucinskas ZilvinasKucinskas
ZilvinasKucinskas
/ frontendDevlopmentBookmarks.md
Created
February 3, 2016 11:46
— forked from dypsilon/frontendDevlopmentBookmarks.md
A badass list of frontend development resources I collected over time.
ZilvinasKucinskas
/ gist:8a2c3828bd1dc9dcaa98
Created
August 7, 2014 20:38
— forked from rodionmoiseev/gist:2484934
This file contains hidden or 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
| apply plugin: 'java' | |
| apply plugin: 'scala' | |
| // For those using Eclipse or IntelliJ IDEA | |
| apply plugin: 'eclipse' | |
| apply plugin: 'idea' | |
| def findPlay20(){ | |
| def pathEnvName = ['PATH', 'Path'].find{ System.getenv()[it] != null } | |
| for(path in System.getenv()[pathEnvName].split(File.pathSeparator)){ | |
| for(playExec in ['play.bat', 'play.sh', 'play']){ |
ZilvinasKucinskas
/ gist:7015751
Last active
December 25, 2015 17:49
Merge sort function in Scala; Average complexity: O(n * log(n));
Worst complexity: O(n * log(n));
This file contains hidden or 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
| def msort[T](xs: List[T])(implicit ord: Ordering[T]): List[T] = { | |
| val n = xs.length / 2 | |
| if (n == 0) xs | |
| else { | |
| def merge(xs: List[T], ys: List[T]) : List[T] = { | |
| (xs, ys) match { | |
| case (Nil, ys) => ys | |
| case (xs, Nil) => xs | |
| case (x :: xs1, y :: ys1) => { | |
| if (ord.lt(x, y)) x :: merge(xs1, ys) |
NewerOlder