|
|
|
@ -14,52 +14,11 @@
|
|
|
|
|
#include <QList>
|
|
|
|
|
#include <QTimer>
|
|
|
|
|
|
|
|
|
|
// private implementation
|
|
|
|
|
class PeerTablePriv
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
/** Local cache of peer information */
|
|
|
|
|
QList<CNodeCombinedStats> cachedNodeStats;
|
|
|
|
|
|
|
|
|
|
/** Pull a full list of peers from vNodes into our cache */
|
|
|
|
|
void refreshPeers(interfaces::Node& node)
|
|
|
|
|
{
|
|
|
|
|
cachedNodeStats.clear();
|
|
|
|
|
|
|
|
|
|
interfaces::Node::NodesStats nodes_stats;
|
|
|
|
|
node.getNodesStats(nodes_stats);
|
|
|
|
|
cachedNodeStats.reserve(nodes_stats.size());
|
|
|
|
|
for (const auto& node_stats : nodes_stats)
|
|
|
|
|
{
|
|
|
|
|
CNodeCombinedStats stats;
|
|
|
|
|
stats.nodeStats = std::get<0>(node_stats);
|
|
|
|
|
stats.fNodeStateStatsAvailable = std::get<1>(node_stats);
|
|
|
|
|
stats.nodeStateStats = std::get<2>(node_stats);
|
|
|
|
|
cachedNodeStats.append(stats);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int size() const
|
|
|
|
|
{
|
|
|
|
|
return cachedNodeStats.size();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
CNodeCombinedStats *index(int idx)
|
|
|
|
|
{
|
|
|
|
|
if (idx >= 0 && idx < cachedNodeStats.size())
|
|
|
|
|
return &cachedNodeStats[idx];
|
|
|
|
|
|
|
|
|
|
return nullptr;
|
|
|
|
|
}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
PeerTableModel::PeerTableModel(interfaces::Node& node, QObject* parent) :
|
|
|
|
|
QAbstractTableModel(parent),
|
|
|
|
|
m_node(node),
|
|
|
|
|
timer(nullptr)
|
|
|
|
|
{
|
|
|
|
|
priv.reset(new PeerTablePriv());
|
|
|
|
|
|
|
|
|
|
// set up timer for auto refresh
|
|
|
|
|
timer = new QTimer(this);
|
|
|
|
|
connect(timer, &QTimer::timeout, this, &PeerTableModel::refresh);
|
|
|
|
@ -84,15 +43,15 @@ void PeerTableModel::stopAutoRefresh()
|
|
|
|
|
timer->stop();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int PeerTableModel::rowCount(const QModelIndex &parent) const
|
|
|
|
|
int PeerTableModel::rowCount(const QModelIndex& parent) const
|
|
|
|
|
{
|
|
|
|
|
if (parent.isValid()) {
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
return priv->size();
|
|
|
|
|
return m_peers_data.size();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int PeerTableModel::columnCount(const QModelIndex &parent) const
|
|
|
|
|
int PeerTableModel::columnCount(const QModelIndex& parent) const
|
|
|
|
|
{
|
|
|
|
|
if (parent.isValid()) {
|
|
|
|
|
return 0;
|
|
|
|
@ -100,7 +59,7 @@ int PeerTableModel::columnCount(const QModelIndex &parent) const
|
|
|
|
|
return columns.length();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
QVariant PeerTableModel::data(const QModelIndex &index, int role) const
|
|
|
|
|
QVariant PeerTableModel::data(const QModelIndex& index, int role) const
|
|
|
|
|
{
|
|
|
|
|
if(!index.isValid())
|
|
|
|
|
return QVariant();
|
|
|
|
@ -173,19 +132,52 @@ Qt::ItemFlags PeerTableModel::flags(const QModelIndex &index) const
|
|
|
|
|
return retval;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
QModelIndex PeerTableModel::index(int row, int column, const QModelIndex &parent) const
|
|
|
|
|
QModelIndex PeerTableModel::index(int row, int column, const QModelIndex& parent) const
|
|
|
|
|
{
|
|
|
|
|
Q_UNUSED(parent);
|
|
|
|
|
CNodeCombinedStats *data = priv->index(row);
|
|
|
|
|
|
|
|
|
|
if (data)
|
|
|
|
|
return createIndex(row, column, data);
|
|
|
|
|
if (0 <= row && row < rowCount() && 0 <= column && column < columnCount()) {
|
|
|
|
|
return createIndex(row, column, const_cast<CNodeCombinedStats*>(&m_peers_data[row]));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return QModelIndex();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void PeerTableModel::refresh()
|
|
|
|
|
{
|
|
|
|
|
Q_EMIT layoutAboutToBeChanged();
|
|
|
|
|
priv->refreshPeers(m_node);
|
|
|
|
|
Q_EMIT layoutChanged();
|
|
|
|
|
interfaces::Node::NodesStats nodes_stats;
|
|
|
|
|
m_node.getNodesStats(nodes_stats);
|
|
|
|
|
decltype(m_peers_data) new_peers_data;
|
|
|
|
|
new_peers_data.reserve(nodes_stats.size());
|
|
|
|
|
for (const auto& node_stats : nodes_stats) {
|
|
|
|
|
const CNodeCombinedStats stats{std::get<0>(node_stats), std::get<2>(node_stats), std::get<1>(node_stats)};
|
|
|
|
|
new_peers_data.append(stats);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Handle peer addition or removal as suggested in Qt Docs. See:
|
|
|
|
|
// - https://doc.qt.io/qt-5/model-view-programming.html#inserting-and-removing-rows
|
|
|
|
|
// - https://doc.qt.io/qt-5/model-view-programming.html#resizable-models
|
|
|
|
|
// We take advantage of the fact that the std::vector returned
|
|
|
|
|
// by interfaces::Node::getNodesStats is sorted by nodeid.
|
|
|
|
|
for (int i = 0; i < m_peers_data.size();) {
|
|
|
|
|
if (i < new_peers_data.size() && m_peers_data.at(i).nodeStats.nodeid == new_peers_data.at(i).nodeStats.nodeid) {
|
|
|
|
|
++i;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
// A peer has been removed from the table.
|
|
|
|
|
beginRemoveRows(QModelIndex(), i, i);
|
|
|
|
|
m_peers_data.erase(m_peers_data.begin() + i);
|
|
|
|
|
endRemoveRows();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (m_peers_data.size() < new_peers_data.size()) {
|
|
|
|
|
// Some peers have been added to the end of the table.
|
|
|
|
|
beginInsertRows(QModelIndex(), m_peers_data.size(), new_peers_data.size() - 1);
|
|
|
|
|
m_peers_data.swap(new_peers_data);
|
|
|
|
|
endInsertRows();
|
|
|
|
|
} else {
|
|
|
|
|
m_peers_data.swap(new_peers_data);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Q_EMIT changed();
|
|
|
|
|
}
|
|
|
|
|