+ communication.
+ * Change the prototypes of action replay. Sorry for inconvenience,
+ but this is really more efficient this way (and to adapt your code,
+ you just have to fix the initialization, that shouldn't be too long)
+ * Kill the braindead MSG_task_refcount_dec() function. I guess nobody
+ ever managed to do anything useful with it.
+ * New function MSG_comm_testany(). Similarly to MSG_comm_waitany(), it
+ takes a dynar of communications. It returns immediately and gives the
+ index of a finished communication (if any).
+ * New example: a basic implementation of the Chord P2P algorithm.