* Added command scheduler, currently it only calls option handler.

git-svn-id: svn://rakshasa.no/libtorrent/trunk/rtorrent@609 e378c898-3ddf-0310-93e7-cc216c733640
This commit is contained in:
rakshasa
2005-12-17 02:50:10 +00:00
parent ca5b5e05ec
commit e45f05ee98
17 changed files with 541 additions and 51 deletions
+14 -12
View File
@@ -56,24 +56,24 @@ public:
m_slot.set(NULL);
}
bool is_valid() const { return m_slot.is_valid(); }
bool is_queued() const { return m_time != timer(); }
bool is_valid() const { return m_slot.is_valid(); }
bool is_queued() const { return m_time != timer(); }
void call() { m_slot(); }
void set_slot(function_base<void>* s) { m_slot.set(s); }
void call() { m_slot(); }
void set_slot(function0<void>::base_type* s) { m_slot.set(s); }
const timer& time() const { return m_time; }
void clear_time() { m_time = timer(); }
void set_time(const timer& t) { m_time = t; }
const timer& time() const { return m_time; }
void clear_time() { m_time = timer(); }
void set_time(const timer& t) { m_time = t; }
bool compare(const timer& t) const { return m_time > t; }
bool compare(const timer& t) const { return m_time > t; }
private:
priority_item(const priority_item&);
void operator = (const priority_item&);
timer m_time;
function<void> m_slot;
function0<void> m_slot;
};
struct priority_compare {
@@ -105,12 +105,14 @@ priority_queue_insert(priority_queue_default* queue, priority_item* item, timer
inline void
priority_queue_erase(priority_queue_default* queue, priority_item* item) {
if (!item->is_valid())
throw std::logic_error("priority_queue_erase(...) called on an invalid item.");
if (!item->is_queued())
return;
// Check is_valid() after is_queued() so that it is safe to call
// erase on untouched instances.
if (!item->is_valid())
throw std::logic_error("priority_queue_erase(...) called on an invalid item.");
// Clear time before erasing to force it to the top.
item->clear_time();