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
appname = central-api | |
httpport = 8080 | |
runmode = dev | |
autorender = false | |
copyrequestbody = true | |
EnableDocs = true | |
RedisHost=172.17.0.2 | |
RedisPort=6379 | |
MySQL=readonly:readonly*34@tcp(146.185.158.165:3306)/container |
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
# install prerequisties | |
xcode-select --install | |
brew tap homebrew/versions | |
brew install cmake maven openssl protobuf250 snappy | |
# download hadoop | |
cd /tmp | |
git clone https://github.com/apache/hadoop.git | |
cd hadoop | |
git checkout rel/release-2.7.3 |
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
// Config that can be loaded externally, similar | |
// to [gulp-starter](https://github.com/greypants/gulp-starter) | |
var src = './app/assets'; | |
var dest = './public'; | |
var config = { | |
javascript: { | |
src: src + '/javascript_app/**/*.{js,coffee}', | |
rootFiles: [ | |
{ |
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
package net.tixxit.levenshtein | |
import scala.math.min | |
object EditDistance { | |
def editDist[A](a: Iterable[A], b: Iterable[A]) = | |
((0 to b.size).toList /: a)((prev, x) => | |
(prev zip prev.tail zip b).scanLeft(prev.head + 1) { | |
case (h, ((d, v), y)) => min(min(h + 1, v + 1), d + (if (x == y) 0 else 1)) | |
}) last |