src/PredFinder/inference/EIUtils.cpp
// Use the commented-out code to determine how long this sort takes (and hence whether it's worthwhile
// to use a faster sorting routine).
//clock_t start_time = clock();

Use the commented-out code to determine how long this sort takes (and hence whether it's worthwhile
to use a faster sorting routine).
Use the commented - out code to determine how long this sort takes ( and hence whether it ' s worthwhile to use a faster sorting routine ) .
BOOST_FOREACH(ElfIndividual_ptr ind, individuals) {
		EDTOffset start, end;
		ind->get_name_or_desc()->get_offsets(start, end);
		bool inserted = false;
		for (std::list<ElfIndividual_ptr>::iterator iter = sortedList.begin(); iter != sortedList.end(); iter++) {
			EDTOffset iter_start, iter_end;
			(*iter)->get_name_or_desc()->get_offsets(iter_start, iter_end);
			if (start > iter_start) {
				iter++;
				sortedList.insert(iter, ind);
				inserted = true;
				break;
			} else if (start == iter_start && end > iter_end) {
				iter++;
				sortedList.insert(iter, ind);
				inserted = true;
				break;
			}
		}
		if (!inserted) {
			sortedList.push_front(ind);
		}
	}
BOOST_FOREACH ( ElfIndividual_ptr ind , individuals ) { EDTOffset start , end ; ind -> get_name_or_desc ( ) -> get_offsets ( start , end ) ; bool inserted = false ; for ( std :: list < ElfIndividual_ptr > :: iterator iter = sortedList . begin ( ) ; iter != sortedList . end ( ) ; iter ++ ) { EDTOffset iter_start , iter_end ; ( * iter ) -> get_name_or_desc ( ) -> get_offsets ( iter_start , iter_end ) ; if ( start > iter_start ) { iter ++ ; sortedList . insert ( iter , ind ) ; inserted = true ; break ; } else if ( start == iter_start && end > iter_end ) { iter ++ ; sortedList . insert ( iter , ind ) ; inserted = true ; break ; } } if ( ! inserted ) { sortedList . push_front ( ind ) ; } }
Use the commented-out code to determine how long this sort takes (and hence whether it's worthwhile
to use a faster sorting routine).
Use the commented - out code to determine how long this sort takes ( and hence whether it ' s worthwhile to use a faster sorting routine ) .