marionnet-dev team mailing list archive

[noreply@xxxxxxxxxxxxx]

------------------------------------------------------------
revno: 477
committer: Jean-Vincent Loddo <loddo@xxxxxxxxxxxxxxxxxxxx>
branch nick: ocamlbricks
timestamp: Sat 2019-07-20 23:05:45 +0200
message:
  Added the module Range implementing a kind of "delayed list" like the standard module Seq, but with an extensive algebra of constructors (of_*, Int, Rational, Float, Char), combinators (Nest) and evaluators (Fold). All operations remain lazy until the moment we decide to fold the structure. The hidden "state" monad behind the module Nest doesn't correspond to the monad resulting from the standard state transformer (not the same bind). The tools included in this submodule are powerful nestable combinators that preserve the lazy character of computations. Also, among constructors, are available some (lazy) generators of many kind of selections (combinations, permutations, bounded cartesian power, etc). These last operations are implemented with memoization and other techniques (bitmasks) to be fairly efficient (in any case more eficient than the corresponding tools in the module Loop, that should be renamed Fold).
added:
  STRUCTURES/bitmasks.ml
  STRUCTURES/bitmasks.mli
  STRUCTURES/bitmmasks.ml
  STRUCTURES/bitmmasks.mli
  STRUCTURES/range.ml
  STRUCTURES/range.mli
  STRUCTURES/selections.ml
  STRUCTURES/selections.mli
modified:
  Makefile
  STRUCTURES/extreme_sharing.mli
  STRUCTURES/hashmset.ml
  STRUCTURES/hashmset.mli
  STRUCTURES/hashset.ml
  STRUCTURES/hashset.mli
  STRUCTURES/loop.mli
  STRUCTURES/memo.ml
  ocamlbricks.mllib


--
lp:ocamlbricks
https://code.launchpad.net/~marionnet-drivers/ocamlbricks/trunk

Your team marionnet-dev is subscribed to branch lp:ocamlbricks.
To unsubscribe from this branch go to https://code.launchpad.net/~marionnet-drivers/ocamlbricks/trunk/+edit-subscription