Update to version 0.1.4

CHANGES.md

@@ -1,5 +1,19 @@
 # Algebird #
 
+### Version 0.1.4 ###
+* Count-min-sketch (with Monoid)
+* Added Bloom Filter (with Monoid)
+* HyperLogLog now uses Murmur128 (should be faster)
+* Max/Min/First/Last Monoids
+* VectorSpace trait (implementations for Maps/Vector)
+* DecayedVector for efficient exponential moving average on vectors
+* Metric trait
+* Approximate[Numeric]/Boolean to track error in approximations
+* Adds Semigroup and implicits for usual primitives and collections
+* Fixes EitherMonoid to have a zero
+* Add MinPlus algebra for shortest path calculations
+* Lots of code cleanups
+
 ### Version 0.1.2 ###
 * Improves speed of HyperLogLog.
 * Refactoring of RightFolded Monoid

README.md

@@ -2,10 +2,43 @@
 
 Abstract algebra for Scala. This code is targeted at building aggregation systems (via [Scalding](https://github.com/twitter/scalding) or [Storm](https://github.com/nathanmarz/storm)). It was originally developed as part of Scalding's Matrix API, where Matrices had values which are elements of Monoids, Groups, or Rings. Subsequently, it was clear that the code had broader application within Scalding and on other projects within Twitter.
 
+## What can you do with this code?
+
+```scala
+Welcome to Scala version 2.9.2 (Java HotSpot(TM) 64-Bit Server VM, Java 1.7.0_07).
+Type in expressions to have them evaluated.
+Type :help for more information.
+
+scala> import com.twitter.algebird._
+import com.twitter.algebird._
+
+scala> import com.twitter.algebird.Operators._
+import com.twitter.algebird.Operators._
+
+scala> Map(1 -> Max(2)) + Map(1 -> Max(3)) + Map(2 -> Max(4))
+res1: scala.collection.immutable.Map[Int,com.twitter.algebird.Max[Int]] = Map(2 -> Max(4), 1 -> Max(3))
+```
+In the above, the class Max[T] signifies that the + operator should actually be max (this is
+accomplished by providing an implicit instance of a typeclass for Max that handles +).
+
+* Model a wide class of "reductions" as a sum on some iterator of a particular value type.
+For example, average, moving average, max/min, set
+  union, approximate set size (in much less memory with HyperLogLog), approximate item counting
+  (using CountMinSketch).
+* All of these combine naturally in tuples, vectors, maps, options and more standard scala classes.
+* Implementations of Monoids for interesting approximation algorithms, such as Bloom filter,
+  HyperLogLog and CountMinSketch. These allow you to think of these sophisticated operations like
+  you might numbers, and add them up in hadoop or online to produce powerful statistics and
+  analytics.
+
 ## Maven
-Current version is 0.1.2. groupid="com.twitter" artifact="algebird_2.9.2".
+Current version is 0.1.4. groupid="com.twitter" artifact="algebird_2.9.2".
 
 ## Questions
+> Why not use spire?
+We didn't know about it when we started this code, but it seems like we're more focused on
+large scale analytics.
+
 > Why not use Scalaz's [Monoid](https://github.com/scalaz/scalaz/blob/master/core/src/main/scala/scalaz/Monoid.scala) trait?
 
 The answer is a mix of the following:
@@ -18,7 +51,15 @@ The answer is a mix of the following:
 ## Authors
 
 * Oscar Boykin <http://twitter.com/posco>
+* Avi Bryant <http://twitter.com/avibryant>
+* Edwin Chen <http://twitter.com/echen>
+* ellchow <http://github.com/ellchow>
+* Mike Gagnon <https://twitter.com/MichaelNGagnon>
+* Moses Nakamura <https://twitter.com/mnnakamura>
+* Steven Nobel <http://twitter.com/snoble>
 * Sam Ritchie <http://twitter.com/sritchie>
+* Ashutosh Singhal <http://twitter.com/daashu>
+* Argyris Zymnis <http://twitter.com/argyris>
 
 ## License
 Copyright 2012 Twitter, Inc.

build.sbt

@@ -1,6 +1,6 @@
 name := "algebird"
 
-version := "0.1.4-SNAPSHOT"
+version := "0.1.4"
 
 organization := "com.twitter"