///###////////////////////////////////////////////////////////////////////////
//
// Burton Computer Corporation
// http://www.burton-computer.com
// http://www.cooldevtools.com
// $Id: CleanupManager.cc 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
//

#include "CleanupManager.h"

CleanupManager::CleanupManager()
{
}

CleanupManager::CleanupManager(int junk_count,
                               int max_age)
{
  addLimit(junk_count, max_age);
}

CleanupManager::~CleanupManager()
{
}

void CleanupManager::addLimit(int junk_count,
                              int max_age)
{
  m_nodes.push_back(CleanupNode(junk_count, max_age));
  if (is_debug) {
    cerr << "CleanupManager added limit: count " << junk_count << " age " << max_age << endl;
  }
}

bool CleanupManager::shouldDelete(const WordData &word_data) const
{
  for (NodeIter_t i = m_nodes.begin(); i != m_nodes.end(); ++i) {
    if (word_data.totalCount() <= i->junk_count && word_data.age() > i->max_age) {
      if (is_debug) {
        cerr << "CleanupManager triggered limit:"
             << " count " << word_data.totalCount() << " <= " << i->junk_count
             << " age " << word_data.age() << " > " << i->max_age
             << endl;
      }
      return true;
    }
  }
  return false;
}