job/cached-url.hh

Go to the documentation of this file.

/* $Id: cached-url.hh,v 1.1 2003/08/31 23:52:46 richard Exp $ -*- C++ -*-
  __   _
  |_) /|  Copyright (C) 2003  |  richard@
  | \/¯|  Richard Atterer     |  atterer.net
  ¯ '` ¯
  This program is free software; you can redistribute it and/or modify it
  under the terms of the GNU General Public License, version 2. See the file
  COPYING for details.

*/
#ifndef CACHED_URL_HH
#define CACHED_URL_HH

#include <config.h>

#include <glib.h>
#include <set>

#include <bstream.hh>
#include <datasource.hh>
#include <nocopy.hh>
#include <progress.hh>
//______________________________________________________________________

namespace Job {
  class CachedUrl;
}

class Job::CachedUrl : public Job::DataSource {
public:
  CachedUrl(const string& filename, uint64 prio);
  virtual ~CachedUrl();

  virtual void run();

  virtual bool paused() const;
  virtual void pause();
  virtual void cont();


  virtual const Progress* progress() const;
  virtual const string& location() const;

  //inline const string& filename() const;

private:
  /* Set of all active (non-paused) downloads. After construction, CachedUrls
     are initially paused, run() and cont() are identical. */
  struct Cmp {
    inline bool operator()(const CachedUrl* a, const CachedUrl* b) const;
  };
  friend struct Cmp;
  typedef set<CachedUrl*, Cmp> Set;
  static Set active;
  static unsigned readSpeed; // Bytes per sec read from active.front()->file

  // glib callback, spools data when main loop is otherwise idle.
  static gboolean spoolDataCallback(gpointer);
  static int spoolDataCallbackId; // glib event source ID for above

  string filenameVal;
  uint64 priority;
  Progress progressVal;
  bifstream* file;
};
//______________________________________________________________________

//const string& Job::CachedUrl::filename() const { return filenameVal; }

bool Job::CachedUrl::Cmp::operator()(const CachedUrl* a, const CachedUrl* b)
    const {
  if (a->priority == b->priority) return (a < b);
  else return (a->priority < b->priority);
}

#endif

---