{"shas":[["e504856490eeb7952cdb9b460b2398752b467820","b6b5f08a9ad84752891e1a4399d908390ba0b40c@vt.edu","[docs] Document EnumerableCoda.Sum().","Jonathan Pryor"],["511d2370591a8c2d045835143ccd76967f07b67c","b6b5f08a9ad84752891e1a4399d908390ba0b40c@vt.edu","[docs] Document EnumerableCoda.OrderByNatural().","Jonathan Pryor"],["b3e2556a4e6d4fa006f8d05f45b83d7b3431ca7d","b6b5f08a9ad84752891e1a4399d908390ba0b40c@vt.edu","[Cadenza] Allow EnumerableCoda.Or() to work with infinite lists.\n\nIf Haskell can support infinite lists, so can Cadenza!","Jonathan Pryor"],["87efefd38ac5dfacab68cddab62066553bc2a822","b6b5f08a9ad84752891e1a4399d908390ba0b40c@vt.edu","[Cadenza] Allow EnumerableCoda.And() to work with infinite lists.\n\nIf Haskell can support infinite lists, so can Cadenza!","Jonathan Pryor"],["742399a8cb48e36374a95234ee979fc99d414dfe","b6b5f08a9ad84752891e1a4399d908390ba0b40c@vt.edu","[docs] Document EnumerableCoda.Or().","Jonathan Pryor"],["f8220024f302129a82042dad7c440c918e333ccb","b6b5f08a9ad84752891e1a4399d908390ba0b40c@vt.edu","[docs] Document EnumerableCoda.And().","Jonathan Pryor"]],"ref":"refs/heads/master","size":6,"head":"f8220024f302129a82042dad7c440c918e333ccb","push_id":41581511}