clients.h

Go to the documentation of this file.

/*
-------------------------------------------------------------------------------
                            PLEBBLE
-------------------------------------------------------------------------------
 Copyright (C) 2019-2020 KATLAS Technology. (http://katlastechnology.com)
 Copyright (C) 2017-2020 Marcos Mayorga. (mm@mm-studios.com)
 
 This file is part of our Plebble(R) Platform.
 
 The code below cannot be copied, used for any purpose other than the one
 agreed and/or distributed without the express permission of
 KATLAS Technology.
-------------------------------------------------------------------------------
 
 
*/
#ifndef USGOV_805e6ee810375a936b2b9f95654d0ec0ac9d4f0da47ead6333cc783d44fe4a0c
#define USGOV_805e6ee810375a936b2b9f95654d0ec0ac9d4f0da47ead6333cc783d44fe4a0c
 
#include "gc.h"
#include <us/gov/bgtask.h>
#include <unordered_map>
#include <vector>
#include "client.h"
 
namespace us { namespace gov {
namespace socket {
 
    struct server;
    struct client;
 
    struct clients_t final: unordered_map<int,client*> { //neighbour ring
        typedef unordered_map<int,client*> b;
        typedef us::gov::socket::gc_t gc_t;
        clients_t(server*s);
        clients_t(const clients_t& other)=delete;
        ~clients_t();
        void add(client*);
        void add_update(client*);
        void update(vector<int>& honest, vector<pair<uint32_t,string>>& evil);
        void dump(const string& prefix, ostream& os) const;
        ko start();
        ko wait_ready(const chrono::system_clock::time_point& deadline) const;
        inline void stop() { gc.stop(); }
        inline void join() { gc.join(); }
        void feedlo();
        mutable mutex mx;
        client locli;
        gc_t gc;
        server* svr;
    };
 
}
}}
 
#endif