main.cpp

Go to the documentation of this file.

// Modified 10/08/03
#include <iostream>
#include <vector>

using namespace std;

#include <minmonte.h>
#include <random.h>



// Problem: page 92  of "Introduction to Optimization Theory",
// B.S.Gottried.  
class f1
{
public:
  
  void operator()(double& val, double* v)
    { val = (v[0]-3.0)*(v[0]-3.0)+(v[1]-5.0)*(v[1]-5.0)*9.0; } 
};

template< typename T>
void print( vector<T> const & v)
{
  cout << "[";
  if (v.size()==0) 
  {
    cout << "]";
    return;
  }
  
  cout << v[0];

  if (v.size()==1)
  {
    cout << "]";
    return;
  }

  for (unsigned int i=1; i<v.size(); ++i)
    cout << "," << v[i];

  cout << "]";
}


void test01()
{
  minmonte< f1, random11<double> , double, 80, 2 > m;

  double a0[2] = {1.0,1.0};
  double b0[2] = {8.0,8.0};

  m.setboundingbox(a0,b0);

/*
  cout << "Testing getboundingbox(a,b)" << endl;
  vector<double> a1(2), b1(2);
  m.getboundingbox(a1,b1);
  
  cout << "a=";
  print(a1);
  cout << endl;

  cout << "b=";
  print(b1);
  cout << endl;
*/

  m.printab();
  for (unsigned int k=0; k<5; ++k)
  {
    m(5);
    m.printab();
  }

  cout << "Testing getresult" << endl;

  double v[2];
  double val;
  m.getresult(val,v,0);
  cout << "val=" << val << " v[0]=" << v[0] << " v[1]=" << v[1] << endl;

}

void test02()
{
  cout << "Pointer matrix revision." << endl;

  const unsigned int a(2);
  const unsigned int b(3);
  int v[a][b];

  unsigned int k=0;
  for (unsigned int i=0; i<a; ++i )
  {
    for (unsigned int j=0; j<b; ++j)
      v[i][j] = k++;
  };

  k=0;

  int* p2;
  p2 = (int*)v;
  for ( ; k<a*b; ++k, ++p2 )
  { 
    cout << "k=" << k << "#";
    cout << *p2 << "#" << endl;
  }


}




int main(int argc, char** argv)
{
  test01();



  return 0;
}