---

KnotVector.H

Go to the documentation of this file.

#ifndef _KNOTVECTORS_H
#define _KNOTVECTORS_H

#include <iterator>
#include <vector>
#include <error.H>
#include <ListAssignment.H>

using namespace std;

namespace xchen
{
  template<int dims>
  class KnotVectorIterator;
  
  template<int dims>
  class KnotVector
  {
      typedef KnotVectorIterator<dims> iterator;
      typedef ListAssignmentCheckSzRt<double, iterator> lst_asg_t;
      iterator Begin()                                               { return KnotVectorIterator<dims>(*this); }
  public:
      void Insert(double u, int i=0);                                
      int  UpperBound(double u, int& repeat, int i=0);               
      
      vector<double>& operator[](int i)                              { return kv[i]; }      
      vector<double>const& operator[](int i) const                   { return kv[i]; }      
      double& operator()(int j, int i=0)                             { return kv[i][j]; }   
      void operator=(double* v)                                      { copy(v, v+totalSz(), Begin()); }  
      lst_asg_t operator=(double v)                                  { kv[0].front() = v; return lst_asg_t(++Begin(), totalSz()-1); } 

      void Clear()                                                   { ForEachIofDims kv[i].clear(); }

      friend ostream& operator<< <>(ostream&os, KnotVector const&);

  private:
      vector<double> kv[dims];

      int totalSz() 
      {
        int totalsz = 0;
        for(int i=0; i<dims; i++)
          totalsz += kv[i].size();
        return totalsz;
      }
  };

  template<int dims>
  void KnotVector<dims> :: Insert(double u, int i)
  {
    kv[i].insert(  find_if( kv[i].begin(), kv[i].end(),bind2nd(greater_equal<double>(), u) ),  u);
  }
  template<int dims>
  int KnotVector<dims> :: UpperBound(double u, int& repeat, int i)               
  {
    int j = 0;
    while(u > kv[i][j] && j < kv[i].size()) j++;
    for(repeat = 0; u == kv[i][j]; j++, repeat++);
    return j;
  }
  
  template<int dims>
  class KnotVectorIterator
  {
      KnotVector<dims>& kv;
      vector<double>::iterator itr;
  public:
      KnotVectorIterator(KnotVector<dims>& _kv) : kv(_kv), itr(kv[0].begin()) { }
      double& operator*()                                                       { return *itr; }

      KnotVectorIterator& operator++() 
      {
        for(int i=0; i<dims; i++)
        {
          if(itr == kv[i].end())
          {
            if(i==dims-1) error_exit("knotvector iterator passed the end.\n");
            itr = kv[i+1].begin();
            break;
          }
        } 
        ++itr;
        return *this;
      }
  };
  
  
  template<int dims>
  ostream& operator<<(ostream&os, KnotVector<dims>const& kv)
  {
    for(int i=dims-1; i>=0; i--)
    {
      os << "[";
      copy(kv[i].begin(), kv[i].end()-1, ostream_iterator<double>(os, " ")); 
      os << kv[i].back() << "]\t";
    }
    os << endl;
    return os;
  }
  

}//end namespace xchen


#endif

---