node_list_model.cpp

Go to the documentation of this file.

// *****************************************************************************
//
// Copyright (c) 2015, Southwest Research Institute® (SwRI®)
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * 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.
//     * Neither the name of Southwest Research Institute® (SwRI®) 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 Southwest Research Institute® 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.
//
// *****************************************************************************
 
#include <stdio.h>
#include <vector>
 
#include <swri_console/node_list_model.h>
#include <swri_console/log_database.h>
 
namespace swri_console
{
NodeListModel::NodeListModel(LogDatabase *db)
  :
  db_(db)
{
  QObject::connect(db_, SIGNAL(databaseCleared()),
                   this, SLOT(handleDatabaseCleared()));
  QObject::connect(db_, SIGNAL(messagesAdded()),
                   this, SLOT(handleMessagesAdded()));
}
 
NodeListModel::~NodeListModel()
{
}
 
int NodeListModel::rowCount(const QModelIndex &parent) const
{
  return ordering_.size();
}
 
std::string NodeListModel::nodeName(const QModelIndex &index) const
{
  if (index.parent().isValid() ||
      static_cast<size_t>(index.row()) > ordering_.size()) {
    return "";
  }
 
  return ordering_[index.row()];
}
 
QVariant NodeListModel::data(const QModelIndex &index, int role) const
{
  if (index.parent().isValid() ||
      static_cast<size_t>(index.row()) > ordering_.size()) {
    return QVariant();
  } 
 
  std::string name = ordering_[index.row()];
  
  if (role == Qt::DisplayRole) {
    char buffer[1023];
    snprintf(buffer, sizeof(buffer), "%s (%lu)",
             name.c_str(),
             data_.find(name)->second);
    return QVariant(QString(buffer));
  }
 
  return QVariant();
}
 
void NodeListModel::clear()
{
  if (ordering_.empty()) {
    return;
  }
  beginRemoveRows(QModelIndex(), 0, ordering_.size()-1);
  data_.clear();
  ordering_.clear();
  endRemoveRows();
}
 
void NodeListModel::handleDatabaseCleared()
{
  // When the database is cleared, we reset all of the counts to zero
  // instead of deleting them from the list.  This allows a user to
  // clear out the logs while retaining their node selection so that
  // they can easily reset the data without having to choose the
  // selection again.  
  std::map<std::string, size_t>::iterator iter;
  for (iter = data_.begin(); iter != data_.end(); ++iter) {
    (*iter).second = 0;
  }
 
  Q_EMIT dataChanged(index(0), index(data_.size()-1));
}
 
void NodeListModel::handleMessagesAdded()
{
  const std::map<std::string, size_t> &msg_counts = db_->messageCounts();
  
  size_t i = 0;
  for (std::map<std::string, size_t>::const_iterator it = msg_counts.begin();
       it != msg_counts.end();
       ++it)
  {
    if (!data_.count(it->first)) {
      beginInsertRows(QModelIndex(), i, i);
      data_[it->first] = it->second;
      ordering_.insert(ordering_.begin() + i, it->first);
      endInsertRows();
    } else {
      data_[it->first] = it->second;
    }
    i++;
  }
  
  Q_EMIT dataChanged(index(0),
                     index(ordering_.size()-1));
}
}  // namespace swri_console