optimizelayout.cc File Reference

#include "optimizelayout.h"
#include "generaldata.h"
#include "readdata.h"
#include <vector>
#include <cassert>

Include dependency graph for optimizelayout.cc:

Go to the source code of this file.

Functions
void	optimize_layout (int start_row, set< db_recno_t > &selectedReads, TrapperDoc *pDoc)

---

Function Documentation

void optimize_layout	(	int	start_row,
		set< db_recno_t > &	selectedReads,
		TrapperDoc *	pDoc
	)

Definition at line 10 of file optimizelayout.cc.

References sort_struct::begin, GeneralData::copy(), Database::Creator< T >::create(), Database::Creator< T >::data(), sort_struct::end, ReadData::endPos(), sort_struct::ID, ReadData::row(), sort_struct::row, GeneralData::setRecno(), ReadData::setRow(), and ReadData::startPos().

Referenced by TrapperParser::endElement(), OptimizeLayoutAlgo::start(), and TrapperParser::startElement().

{
  if ( selectedReads.empty()) {
    return;
  }
  cerr<<"  Optimizing layout... "<<endl;

  int row = start_row;
  
  multiset<sort_struct, compBeg> set_begin;

  for (set< db_recno_t >::iterator it = selectedReads.begin(); it != selectedReads.end(); it++ ){

    Database::PrimaryIterator<ReadData> read_it(pDoc, "ReadData");
    int ret_read = read_it.setFromRecno(*it);
    ReadData* r_test = (ret_read != DB_NOTFOUND) ? read_it.answer() : 0;
    assert( r_test );
    assert( ret_read == 0 );
    
    sort_struct s;
    s.begin = r_test->startPos();
    s.end = r_test->endPos() + 1;
    s.ID = *it;
    
    set_begin.insert(s);
    
  }
//   cerr<<"Reading..."<<endl;
  
  multiset<sort_struct, compBeg>::iterator it = set_begin.begin();
  sort_struct tmp(*it);
  tmp.begin = tmp.end;
  vector<sort_struct> row_vec;
  row_vec.push_back(tmp);

  vector<sort_struct> result_vec;
  tmp.row = row;
  result_vec.push_back(tmp);
  set_begin.erase( set_begin.begin() );
  
  while ( !set_begin.empty() ) {
    it = set_begin.lower_bound( row_vec[ row_vec.size() - 1 ] );
    
    if ( it == set_begin.end() ) {
      //New row
      
      row_vec.clear();
      ++row;
      it = set_begin.begin();
    }
    
    tmp = *it;
    tmp.begin = tmp.end;
    row_vec.push_back(tmp);

    tmp.row = row;
    result_vec.push_back(tmp);
    set_begin.erase(it);
  } 
//   cerr<<"Writing..."<<endl;

  for( size_t i = 0; i < result_vec.size(); i++ ) {
    Database::PrimaryIterator<ReadData>* read_it = new Database::PrimaryIterator<ReadData>(pDoc, "ReadData");
    int ret_read = read_it->setFromRecno(result_vec[i].ID);
    ReadData* r_test = (ret_read != DB_NOTFOUND) ? read_it->answer() : 0;
    assert( r_test );
    assert( ret_read == 0 );

    if ( r_test->row() == result_vec[i].row ) {
      //No need to do anything
      delete read_it;
      continue;
    }

    Database::Creator<ReadData> a_creator(pDoc, "ReadData");
    
    a_creator.data()->copy(r_test);
    a_creator.data()->setRecno(result_vec[i].ID);
    a_creator.data()->setRow(result_vec[i].row);
    
    delete read_it;
    a_creator.create(true);
    
  }
  cerr<<"  Done optimizing layout"<<endl;
}

---