///###////////////////////////////////////////////////////////////////////////
//
// Burton Computer Corporation
// http://www.burton-computer.com
// http://www.cooldevtools.com
// $Id: CleanupManager.h 272 2007-01-06 19:37:27Z brian $
//
// Copyright (C) 2007 Burton Computer Corporation
// ALL RIGHTS RESERVED
//
// This program is open source software; you can redistribute it
// and/or modify it under the terms of the Q Public License (QPL)
// version 1.0. Use of this software in whole or in part, including
// linking it (modified or unmodified) into other programs is
// subject to the terms of the QPL.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// Q Public License for more details.
//
// You should have received a copy of the Q Public License
// along with this program; see the file LICENSE.txt.  If not, visit
// the Burton Computer Corporation or CoolDevTools web site
// QPL pages at:
//
//    http://www.burton-computer.com/qpl.html
//    http://www.cooldevtools.com/qpl.html
//

#ifndef _CleanupManager_h
#define _CleanupManager_h

#include <vector>
#include "WordData.h"

class CleanupManager
{
public:
  CleanupManager();
  CleanupManager(int junk_count,
                 int max_age);
  ~CleanupManager();

  void addLimit(int junk_count,
                int max_age);

  bool shouldDelete(const WordData &word_data) const;

private:
  /// Not implemented.
  CleanupManager(const CleanupManager &);

  /// Not implemented.
  CleanupManager& operator=(const CleanupManager &);

private:
  struct CleanupNode {
    CleanupNode(int _junk_count, int _max_age) : junk_count(_junk_count), max_age(_max_age) {}
    int junk_count;
    int max_age;
  };
  typedef vector<CleanupNode>::const_iterator NodeIter_t;
  vector<CleanupNode> m_nodes;
};

#endif // _CleanupManager_h