main.cpp

Go to the documentation of this file.

// ----------------------------------------------------------------------------------
//              TEST PROGRAM FOR PARALLEL CLASSES
// ----------------------------------------------------------------------------------
#include "par.h"
#include <iostream>

using namespace std;

int main()
{

// ***************** TEST #1 CALCULATE PI *****************
par<double> x(100000);
double pi;
addr(x);
pi += 4.0/(1.0+(x*2.0))*pow(-1.0,x); 
cout << "PI = " << setw(30) <<setprecision(25)<< pi << endl << endl;

// ***************** TEST #2 SHUFFLE EXCHANGE SORT (not working!) *********************
int const N=6;
par<int> list(N), LEFT(N), RIGHT(N), self(N), temp(N);
int l[]={80, 40 , 30 , 50 , 60, 10 };
list = l;
addr(self);

for (int j=1; j<=N/2; j++)
        {
        cout << "-->  " << list << endl;
        LEFT = rotate(list,-1);
        cout << "left " << LEFT << endl;
        RIGHT = rotate(list,1);
        cout << "right" << RIGHT << endl;
        ifp (self%2 == 0 )
                {
                ifp (RIGHT < list)
                        { list=RIGHT; }
                        endifp  
                ifp (LEFT >= list) 
                        { list=LEFT; }
                        endifp
                }
                endifp
/*    cout << "-->  " << list << endl;
        LEFT = rotate(list,-1);
        cout << "left " << LEFT << endl;
        RIGHT = rotate(list,1);
        cout << "right" << RIGHT << endl;
        ifp ((self+1)%2 == 0 && self!=(N-1))
                {
                ifp (RIGHT > list)
                        { list=RIGHT; }
                        endifp  
                ifp (RIGHT >= list)
                        { list=LEFT; }
                        endifp
                }
                endifp
*/      }
cout << "FINAL" << list << endl;


// ******************* TEST #3 PRIMES BY SEIVE ***************
const int psize=100;
par<int> primes(psize);
par<bool> pflag(psize);
int p=2;

cout << "primes -> " << endl;
pflag = true; pflag[0]=false; pflag[1]=false;
addr(primes);
while (any(pflag))
        {
        cerr << p << " ";
        pflag = (pflag & ((primes % p) != 0 ));
        ifp (pflag==true)       
                p = first_index(pflag);         
        endifp
        }
cout << endl;

return 0;
}

---