JoshuaManton

{
    "selector": "source.odin",
    "file_regex": "^(.*.odin)[(]([0-9]+):([0-9]+)[)](.*)",
    "variants": [
        {
            "name": "Check",
            "cmd": ["odin", "check", ".", "-ignore-unknown-attributes"],
            "shell": false,
            "quiet": true,
        },

debasishg

General Background and Overview

1. Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
2. Models and Issues in Data Stream Systems
3. Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

paulp

trait Collections {
  type CC[+X]         // the overarching container type (in scala: any covariant collection, e.g. List, Vector)
  type Min[+X]        // the minimum type constructor which can be reconstituted to CC[X] (in scala: GenTraversableOnce)
  type Opt[+X]        // the container type for optional results (in scala: Option)
  type CCPair[+X]     // some representation of a divided CC[A] (at simplest, (CC[A], CC[A]))
  type ~>[-V1, +V2]   // some means of composing operations (at simplest, Function1)

  type Iso[A]            = CC[A] ~> CC[A]       // e.g. filter, take, drop, reverse, etc.
  type Map[-A, +B]       = CC[A] ~> CC[B]       // e.g. map, collect
  type FlatMap[-A, +B]   = CC[A] ~> Min[B]      // e.g. flatMap