algebird-core/src/main/scala/com/twitter/algebird/immutable/BitSet.scala (4 lines):
	- line 659: // TODO: it is unclear why BitSet.Empty isn't okay here.
	- line 819: // TODO: optimize
	- line 927: // TODO: this is the only branch where
	- line 977: // TODO: it is unclear why BitSet.Empty isn't okay here.


algebird-core/src/main/scala/com/twitter/algebird/Interval.scala (4 lines):
	- line 19: // TODO this is clearly more general than summingbird, and should be extended to be a ring (add union, etc...)
	- line 33: * result is meaningless. TODO: It might be good to have types for these properties in algebird.
	- line 343: // TODO https://github.com/twitter/algebird/issues/263
	- line 359: // TODO https://github.com/twitter/algebird/issues/263


algebird-core/src/main/scala/com/twitter/algebird/monad/StateWithError.scala (2 lines):
	- line 36: ): // TODO: deep joins could blow the stack, not yet using trampoline here
	- line 117: // TODO this should move to Monad and work for any Monad


algebird-core/src/main/scala/com/twitter/algebird/DecayingCMS.scala (2 lines):
	- line 192: // TODO: consider a smaller number?
	- line 458: // TODO: we could allocate a mutable scratch pad, write all the


algebird-test/src/main/scala/com/twitter/algebird/ApproximateProperty.scala (2 lines):
	- line 71: // TODO Make sure this is correct
	- line 113: * ApproximateProperties fail. TODO use `new Prop` like the above `toProp` method so that we can have useful


algebird-core/src/main/scala/com/twitter/algebird/Metric.scala (2 lines):
	- line 49: // TODO: copied from IndexedSeq.scala
	- line 72: // TODO: Implement Linf, using an ordering on V


algebird-core/src/main/scala/com/twitter/algebird/package.scala (1 line):
	- line 22: * TODO remove these in scala 2.11 and use the standard there. these are here to avoid massive bloat around


algebird-core/src/main/scala/com/twitter/algebird/BloomFilter.scala (1 line):
	- line 366: // TODO: investigate this upper bound and density more closely (or derive a better formula).


algebird-core/src/main/scala/com/twitter/algebird/CountMinSketch.scala (1 line):
	- line 785: // TODO: implement a dense matrix type, and use it here


algebird-test/src/main/scala/com/twitter/algebird/MonadLaws.scala (1 line):
	- line 115: // TODO: equivT and equivU are unused, only equivR is used


algebird-core/src/main/scala/com/twitter/algebird/Successible.scala (1 line):
	- line 31: // TODO in scala 2.11, there is an AbstractIterable which should be used here


algebird-core/src/main/scala/com/twitter/algebird/Predecessible.scala (1 line):
	- line 28: // TODO in scala 2.11, there is an AbstractIterable which should be used here


algebird-core/src/main/scala/com/twitter/algebird/Max.scala (1 line):
	- line 156: // TODO: Replace with


algebird-core/src/main/scala/com/twitter/algebird/SGDMonoid.scala (1 line):
	- line 95: // TODO make a RightFolded2 which folds A,B => (B,C), and a group on C.


algebird-core/src/main/scala/com/twitter/algebird/SummingCache.scala (1 line):
	- line 66: // TODO fancier caches will give better performance:


project/GenTupleAggregators.scala (1 line):
	- line 106: // TODO: keys for 1 item


scripts/product_generators.rb (1 line):
	- line 11: # TODO: Remove in favour of script/product_generators.rb in the next breaking release


algebird-core/src/main/scala/com/twitter/algebird/immutable/BloomFilter.scala (1 line):
	- line 200: // TODO: investigate this upper bound and density more closely (or derive a better formula).


algebird-core/src/main/scala/com/twitter/algebird/monad/Reader.scala (1 line):
	- line 21: // TODO this is general, move somewhere better


algebird-core/src/main/scala/com/twitter/algebird/JavaMonoids.scala (1 line):
	- line 103: * immutable maps, this operation is much faster TODO extend this to Group, Ring