chris-martin

package vine

import scala.util.parsing.combinator.syntactical._
import util.parsing.input.{CharSequenceReader, Reader}
import java.io.InputStream
import collection.immutable.PagedSeq
import io.Source
import util.parsing.combinator.RegexParsers

object Ply extends RegexParsers {

chris-martin

  trait OrderedByProperty[A <: OrderedByProperty[A]] extends Ordered[A] { a: A =>
    protected def orderBy: Ordered[_]
    override def compare(that: A): Int = orderBy compareTo that.orderBy
  }

chris-martin

Full thread dump

"main@1" prio=5 tid=0x1 nid=NA waiting
  java.lang.Thread.State: WAITING
    at sun.misc.Unsafe.park(Unsafe.java:-1)
	  at java.util.concurrent.locks.LockSupport.park(LockSupport.java:186)
	  at java.util.concurrent.locks.AbstractQueuedSynchronizer$ConditionObject.await(AbstractQueuedSynchronizer.java:2043)
	  at java.util.concurrent.LinkedBlockingQueue.take(LinkedBlockingQueue.java:442)
	  at java.util.concurrent.ExecutorCompletionService.take(ExecutorCompletionService.java:193)
	  at sbt.ConcurrentRestrictions$$anon$4.take(ConcurrentRestrictions.scala:195)

chris-martin

import Ordering.Implicits._
val unsorted = "1.2.3|1.2.0|1.|1.3|1.24|.2|.1.5|.15|.1|2|2.1|3" split '|'
def parseInt(x: String): Int = x match { case "" => 0; case y: String => y.toInt }
unsorted.sortBy(_.split('.').map(parseInt).toSeq)
// Array(.1, .1.5, .2, .15, 1., 1.2.0, 1.2.3, 1.3, 1.24, 2, 2.1, 3)

chris-martin

import Rational._

case class Rational(a: BigInt, b: BigInt = 1) {

  def numerator: BigInt = a
  def demoninator: BigInt = b

  def withNumerator(x: BigInt): Rational = reduced(x, b)
  def withDemominator(x: BigInt): Rational = reduced(a, x)

chris-martin

  case class Mod(q: BigInt) {

    def apply(x: BigInt): BigIntModQ = x

    class BigIntModQ private (val $: BigInt) {
      def pow(exp: BigInt): BigIntModQ = $ modPow (exp, q)
    }

    object BigIntModQ {

chris-martin

import scala.util.Random
import java.security.SecureRandom

/** Adapts a `Random` for generating primes.
  */
case class RandomPrime(r: Random = new SecureRandom) {

  /** @return a random `numbits`-bit prime `p`
    */
  def nextPrime(numbits: Int): BigInt =

chris-martin

  var svgTags = ['g', 'image'];

  ['width', 'height', 'opacity'].forEach(function(p) {
    var o = $.fn[p];
    $.fn[p] = function(x) {
      if (x === undefined) {
        return o.call(this);
      }
      return this.each(function() {

chris-martin

Demonstration of using SBT to invoke jOOQ-codegen

The "jooq-codegen" task generates sources under "src/main/jooq" (which is added as a Java source directory). I put them here instead of "src/main/java" because the directory must be emptied before generation, so I don't want to chance emptying a directory that might contain other sources.

I check the jOOQ-generated code into version control. This makes it easier to work away from the office where I don't have easy access to the database. It also gives me a better picture of database changes, because they are reflected as commits.

chris-martin

import java.util.List;

import com.google.common.collect.ImmutableList;
import com.google.common.collect.Lists;

class LatexEscaper {

    private class Replacement {

        final String toReplace;