Yes it is a strong bound.


On Mon, Feb 10, 2014 at 6:53 PM, P. Oscar Boykin
<notifications@github.com>wrote:

> In algebird-core/src/main/scala/com/twitter/algebird/StreamSummary.scala:
>
> > +    */
> > +  def min: Long
> > +
> > +  /**
> > +    * Map of item to counter, where each counter consist of a observed count and possible over-estimation (error)
> > +    */
> > +  def counters: Map[T, (Long, Long)]
> > +
> > +  def ++(other: StreamSummary[T]): StreamSummary[T]
> > +
> > +  /**
> > +    * returns the frequency estimate for the item
> > +    */
> > +  def frequency(item: T): Approximate[Long] = {
> > +    val (count, err) = counters.getOrElse(item, (min, min))
> > +    Approximate(count - err, count, count, 1.0)
>
> 1.0 is a strong bound. Is that correct?
>
> --
> Reply to this email directly or view it on GitHub<https://github.com/twitter/algebird/pull/259/files#r9608374>
> .
>