| (* | |
| * Finder Open iTerm Here - v1.0.2 - 4/14/2011 | |
| * http://benalman.com/ | |
| * | |
| * Copyright (c) 2011 "Cowboy" Ben Alman | |
| * Dual licensed under the MIT and GPL licenses. | |
| * http://benalman.com/about/license/ | |
| *) | |
| tell application "Finder" |
| // A couple of inlined utility functions: the first is just a syntax convenience, the second lets us use | |
| // Kotlin's string interpolation efficiently: the message is never calculated/concatenated together unless | |
| // logging at that level is enabled. | |
| inline fun <reified T : Any> loggerFor(): org.slf4j.Logger = LoggerFactory.getLogger(T::class.java) | |
| inline fun org.slf4j.Logger.trace(msg: () -> String) { | |
| if (isTraceEnabled) trace(msg()) | |
| } | |
| /** | |
| * A Java logging formatter that writes more compact output than the default. |
If a project has to have multiple git repos (e.g. Bitbucket and Github) then it's better that they remain in sync.
Usually this would involve pushing each branch to each repo in turn, but actually Git allows pushing to multiple repos in one go.
If in doubt about what git is doing when you run these commands, just
| #!/bin/bash | |
| ### Method 1 | |
| ### | |
| mvn deploy:deploy-file \ | |
| -DgroupId=com.github.diegopacheco.sandbox.devops \ | |
| -DartifactId=fpmtest \ | |
| -Dversion=1.0.0 \ | |
| -DgeneratePom=true \ | |
| -Dpackaging=rpm \ |
| import java.util.Iterator; | |
| import java.util.function.BiFunction; | |
| import java.util.stream.Stream; | |
| import java.util.stream.StreamSupport; | |
| /** | |
| * Zipping streams into parallel or sequential stream using JDK8 with lambda | |
| * | |
| * @author Karol Krol | |
| */ |
| import scala.concurrent.duration._ | |
| import scala.concurrent.ExecutionContext | |
| import scala.concurrent.Future | |
| import akka.pattern.after | |
| import akka.actor.Scheduler | |
| /** | |
| * Given an operation that produces a T, returns a Future containing the result of T, unless an exception is thrown, | |
| * in which case the operation will be retried after _delay_ time, if there are more possible retries, which is configured through | |
| * the _retries_ parameter. If the operation does not succeed and there is no retries left, the resulting Future will contain the last failure. |
| # | |
| # UPDATE for 10.10.4+: please consider this patch obsolete, as apple provides a tool called "trimforce" to enable trim support for 3rd party SSDs | |
| # just run "sudo trimforce enable" to activate the trim support from now on! | |
| # | |
| # Original version by Grant Parnell is offline (http://digitaldj.net/2011/07/21/trim-enabler-for-lion/) | |
| # Update July 2014: no longer offline, see https://digitaldj.net/blog/2011/11/17/trim-enabler-for-os-x-lion-mountain-lion-mavericks/ | |
| # | |
| # Looks for "Apple" string in HD kext, changes it to a wildcard match for anything | |
| # | |
| # Alternative to http://www.groths.org/trim-enabler-3-0-released/ |
| def countChange(money: Int, coins: List[Int]): Int = | |
| if (money < 0 || coins.isEmpty) | |
| 0 | |
| else if (money == 0) | |
| 1 | |
| else | |
| countChange(money - coins.head, coins) + countChange(money, coins.tail) |
| Latency Comparison Numbers (~2012) | |
| ---------------------------------- | |
| L1 cache reference 0.5 ns | |
| Branch mispredict 5 ns | |
| L2 cache reference 7 ns 14x L1 cache | |
| Mutex lock/unlock 25 ns | |
| Main memory reference 100 ns 20x L2 cache, 200x L1 cache | |
| Compress 1K bytes with Zippy 3,000 ns 3 us | |
| Send 1K bytes over 1 Gbps network 10,000 ns 10 us | |
| Read 4K randomly from SSD* 150,000 ns 150 us ~1GB/sec SSD |
| /** | |
| * watcher.scala | |
| * | |
| * Uses the Java 7 WatchEvent filesystem API from within Scala. | |
| * Based on http://markusjais.com/file-system-events-with-java-7/ | |
| * | |
| * @author Chris Eberle <eberle1080@gmail.com> | |
| * @version 0.1 | |
| */ |