// Copyright © 2016 Jean-Luc Deltombe (LX3JL). All rights reserved.
// ulxd -- The universal reflector
// Copyright © 2021 Thomas A. Early N7TAE
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// 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
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see .
#pragma once
#include "Peer.h"
class CPeers
{
public:
// constructors
CPeers();
// destructors
virtual ~CPeers();
// locks
void Lock(void) { m_Mutex.lock(); }
void Unlock(void) { m_Mutex.unlock(); }
// manage peers
int GetSize(void) const { return (int)m_Peers.size(); }
void AddPeer(std::shared_ptr);
void RemovePeer(std::shared_ptr);
// pass-thru
std::list>::iterator begin() { return m_Peers.begin(); }
std::list>::iterator end() { return m_Peers.end(); }
std::list>::const_iterator cbegin() const { return m_Peers.cbegin(); }
std::list>::const_iterator cend() const { return m_Peers.cend(); }
// find peers
std::shared_ptr FindPeer(const CIp &, int);
std::shared_ptr FindPeer(const CCallsign &, const CIp &, int);
std::shared_ptr FindPeer(const CCallsign &, int);
// iterate on peers
std::shared_ptr FindNextPeer(int, std::list>::iterator &);
protected:
// data
std::mutex m_Mutex;
std::list> m_Peers;
};