raelg

package com.ever10.phonewords;

import java.util.*;
import java.util.stream.Collectors;

/**
 * Find possible words in a phone number using the standard keypad letter mapping, and a given dictionary of words (Set<String>).
 * <p>
 * Algorithm: Recursively discovers all matches by exhaustively finding all letter
 * combinations and matching against a word in the specified dictionary.

raelg

import java.awt.Color
import java.awt.image.BufferedImage
import java.io.{File, FilenameFilter}
import java.net.URL
import javax.imageio.ImageIO

import scala.collection.immutable.IndexedSeq
import scala.io.Source
import scala.sys.process._

raelg

import scala.collection.immutable.TreeMap

val NUMBERS = TreeMap(
  1 -> "one", 2 -> "two", 3 -> "three", 4 -> "four", 5 -> "five", 6 -> "six", 7 -> "seven", 8 -> "eight", 9 -> "nine",
  10 -> "ten", 11 -> "eleven", 12 -> "twelve", 13 -> "thirteen", 14 -> "fourteen", 15 -> "fifteen", 16 -> "sixteen",
  17 -> "seventeen", 18 -> "eighteen", 19 -> "nineteen", 20 -> "twenty", 30 -> "thirty", 40 -> "forty",
  50 -> "fifty", 60 -> "sixty", 70 -> "seventy", 80 -> "eighty", 90 -> "ninety"
)

val HUNDREDS = TreeMap(

raelg

package services

import java.lang.reflect.Type

import com.google.gson._
import org.joda.time.format.ISODateTimeFormat
import org.joda.time.{DateTime, DateTimeZone}

object Serializers {