1
1
George Bosilca 9ba3ae9c9d Reorder the datatype definition and use a storage class coprresponding to the kind of data it's supposed to hold.
Change the stack usage to make things faster:
 - the first of the stack is always used by the count argument
 - the second is initialized to the first position in the elements list.
 - when the ddt engine advance the last stack position hold the informations about the last processed element (the one from where we have to start the next time).

  Modify the pack/unpack relative functions to reflect the changes in the stack usage. In same time I decrease the amount of code (yup yup) and reorder it a little bit. I get some speedup on my laptop ...

This commit was SVN r3221.
2004-10-19 23:36:31 +00:00
..
2004-10-19 16:56:45 +00:00
2004-10-18 16:55:20 +00:00
2004-10-18 16:55:20 +00:00
2004-10-18 16:55:20 +00:00
2004-10-18 16:55:20 +00:00
2004-10-19 22:06:20 +00:00
2004-08-18 23:13:17 +00:00
2004-10-19 23:31:03 +00:00

/** @mainpage

@section mainpage_introduction Introduction

This is the introduction.
This is the introduction.
This is the introduction.
This is the introduction.
This is the introduction.
This is the introduction.
This is the introduction.

@section main_install Installation
 
This is the installation section.
This is the installation section.
This is the installation section.
This is the installation section.
This is the installation section.
This is the installation section.
This is the installation section.

*/