24 using std::lower_bound;
31 m_increasing ( true ),
38 : m_column ( sorter.m_column ),
39 m_increasing ( sorter.m_increasing ),
65 rowwiseCopy ( std::vector < std::vector < double > * > & row_copy )
70 for (
unsigned int row = 0; row <
rows; row++ ) {
72 vector < double > * p =
new vector < double > ( v );
73 row_copy.push_back ( p );
80 std::vector < double > * y )
const
82 double left = x -> operator[] (
m_column );
83 double right = y -> operator[] (
m_column );
92 vector < vector < double > * > table;
95 std::sort ( table.begin(), table.end(), *this );
99 vector < vector < double > * > :: iterator first = table.begin ();
100 while ( first != table.end () ) {
101 vector < double > * p = *first++;
117 addRow (
const std::vector < double > & row )
122 vector < double > ::const_iterator first;
125 first = lower_bound ( column.begin(), column.end(), sort_value );
128 first = lower_bound ( column.begin(), column.end(),
129 sort_value, greater< double >() );
131 unsigned int index = distance ( column.begin(), first );
157 const vector < double > &