*/
void join();
+ /**
+ * Returns true while the sorter is running.
+ */
+ bool running();
+
/**
* Tell the sorter to stop execution.
*/
/**
* Waits for progress.
*
- * \param time Max time to wait for.
+ * \param time Max time to wait for, in seconds.
* \param solutions The minimum number of solutions we'll wait for.
+ * \return The best score so far.
*/
- double progress(int time, int solutions = 1);
+ double wait(time_t time, size_t solutions = 1);
/**
* Get the full list of solutions.