marionnet-dev team mailing list archive

[noreply@xxxxxxxxxxxxx]

------------------------------------------------------------
revno: 387
committer: Jean-Vincent Loddo <loddo@xxxxxxxxxxxxxxxxxxxx>
branch nick: ocamlbricks
timestamp: Sun 2013-11-17 17:11:52 +0100
message:
  Major changes and additions in the module Forest. Iterators as `iter' and `fold' may be used with the (depth-first) post-order discipline (by default is pre-order). The main addition is the kit of functions useful to evaluate a structure (forest/tree) from leafs to roots back-propagating values. Another important addition is the couple of functions sorting a structure recursively.
  val iter   : ?post_order:unit -> ?parent:'a -> ('a -> 'a option -> unit) -> 'a t -> unit
  val fold   : ?post_order:unit -> ?parent:'a -> ('b -> 'a -> 'a option -> 'b) -> 'b ->  'a t -> 'b
  
  val backprop_tree          : ('a -> 'b list -> 'b) -> 'a tree -> 'b
  val backprop_tree_parallel : ('a -> 'b list -> 'b) -> 'a tree -> 'b
  
  val backprop               : ('a -> 'b list -> 'b) -> 'a t -> 'b list
  val backprop_parallel      : ('a -> 'b list -> 'b) -> 'a t -> 'b list
  
  (** Sort all levels of the forest recursively. *)
  val sort      : ('a -> 'a -> int) -> 'a t -> 'a t
  
  (** Sort all levels of the tree recursively. *)
  val sort_tree : ('a -> 'a -> int) -> 'a tree -> 'a tree
modified:
  STRUCTURES/forest.ml
  STRUCTURES/forest.mli


--
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