dvect2.cpp

Go to the documentation of this file.

/*
 * $Id$
 *
 * Author: David Fournier
 * Copyright (c) 2008-2012 Regents of the University of California
 */
#include <fvar.hpp>
dvector elem_prod(const dvector& t1, const dvector& t2)
  {
     int min = t1.indexmin();
     int max = t1.indexmax();
#ifndef OPT_LIB
     if (min != t2.indexmin() || max != t2.indexmax())
     {
       cerr << "Index bounds do not match in dvector "
       "elem_prod(const dvector&, const dvector&)\n";
       ad_exit(1);
     }
#endif

     dvector tmp(min, max);

     double* ptmp = tmp.get_v() + min;
     double* pt1 = t1.get_v() + min;
     double* pt2 = t2.get_v() + min;
     for (int i = min; i <= max; ++i)
     {
       //tmp[i]=t1[i]*t2[i];
       *ptmp = *pt1 * *pt2;
       ++ptmp;
       ++pt1;
       ++pt2;
     }

     return tmp;
  }

dvector elem_div(const dvector& t1, const dvector& t2)
  {
     int min = t1.indexmin();
     int max = t1.indexmax();
#ifndef OPT_LIB
     if (min != t2.indexmin() || max != t2.indexmax())
     {
       cerr << "Index bounds do not match in "
       "dvector elem_div(const dvector&, const dvector&)\n";
       ad_exit(1);
     }
#endif

     dvector tmp(min, max);

     double* ptmp = tmp.get_v() + min;
     double* pt1 = t1.get_v() + min;
     double* pt2 = t2.get_v() + min;
     for (int i = min; i <= max; ++i)
     {
       //tmp[i]=t1[i]/t2[i];
       *ptmp = *pt1 / *pt2;
       ++ptmp;
       ++pt1;
       ++pt2;
     }

     return tmp;
  }