/*
 * Copyright (c) 2015, University of Kaiserslautern
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * 3. Neither the name of the copyright holder nor the names of its
 *    contributors may be used to endorse or promote products derived from
 *    this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * Authors:
 *    Janik Schlemminger
 *    Robert Gernhardt
 *    Matthias Jung
 */


// * ThreadLoad.cpp
// *
// *  Created on: Apr 9, 2014
// *      Author: robert
// */

//#include "ThreadLoad.h"

//namespace scheduler {

//using namespace std;

//ThreadLoad::ThreadLoad()
//{
//  // TODO Auto-generated constructor stub

//}

//ThreadLoad::~ThreadLoad()
//{
//  // TODO Auto-generated destructor stub
//}

//unsigned int ThreadLoad::getMaxBankLoad() const
//{
//  unsigned int maxLoad = 0;
//  for (auto& bankVectorPair : load)
//  {
//      if (bankVectorPair.second.size() > maxLoad)
//          maxLoad = bankVectorPair.second.size();
//  }
//  return maxLoad;
//}

//unsigned int ThreadLoad::getTotalLoad() const
//{
//  unsigned int totalLoad = 0;
//  for (auto& bankVectorPair : load)
//  {
//      totalLoad += bankVectorPair.second.size();
//  }
//  return totalLoad;
//}

//void ThreadLoad::addTransaction(gp* payload)
//{
//  load[DramExtension::getExtension(payload).getBank()].push_back(payload);
//}

//bool operator<(const ThreadLoad& lhs, const ThreadLoad& rhs)
//{
//  if (lhs.getMaxBankLoad() < rhs.getMaxBankLoad())
//      return true;
//  else if (lhs.getMaxBankLoad() == rhs.getMaxBankLoad())
//      return lhs.getTotalLoad() < rhs.getTotalLoad();
//  else
//      return false;
//}

//vector<gp*> ThreadLoad::getTransactions()
//{
//  vector<gp*> result;
//  for (auto& bankVectorPair : load)
//  {
//      result.insert(result.end(), bankVectorPair.second.begin(), bankVectorPair.second.end());
//  }
//  return result;
//}

//} /* namespace scheduler
