OptimizeLayoutAlgo Class Reference

#include <optimizelayoutalgo.h>

Inheritance diagram for OptimizeLayoutAlgo:

[legend]Collaboration diagram for OptimizeLayoutAlgo:

[legend]List of all members.

Public Member Functions
	OptimizeLayoutAlgo (TrapperDoc *pDoc_, std::set< db_recno_t > &recnoList, AlgoParam *param)
void	start ()

---

Detailed Description

Definition at line 6 of file optimizelayoutalgo.h.

---

Constructor & Destructor Documentation

OptimizeLayoutAlgo::OptimizeLayoutAlgo	(	TrapperDoc *	pDoc_,
		std::set< db_recno_t > &	recnoList,
		AlgoParam *	param
	)			[inline]

Definition at line 9 of file optimizelayoutalgo.h.

: Algo(pDoc_, recnoList, param) {}

---

Member Function Documentation

void OptimizeLayoutAlgo::start

(

)

[virtual]

Implements Algo.

Definition at line 14 of file optimizelayoutalgo.cc.

References QInputDialog::getInteger(), TrapperView::mousePressedRow(), Algo::my_param, optimize_layout(), Algo::pDoc, Algo::selectedReads, and ViewParam::view().

{

  if ( selectedReads.empty() ) {
    return;
  }

  ViewParam* param = dynamic_cast<ViewParam*>(my_param);
  assert(param);

  bool ok;
  int res = QInputDialog::getInteger(
                                     "Optimize Layout", "Enter start row for selected reads:", param->view()->mousePressedRow(), 1, numeric_limits<int>::max(), 1,
                                     &ok, 0 );
  
  size_t row(1);
  if ( ok ) {
    // user entered something and pressed OK
    row = res;
  } else {
    // user pressed Cancel
    return;
  }

  optimize_layout(row, selectedReads, pDoc);

//   cerr<<"Inserting..."<<endl;
  
//   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 );

//     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);
    
//   }
  
}

---

The documentation for this class was generated from the following files:

• optimizelayoutalgo.h
• optimizelayoutalgo.cc

---