#ifndef LLARP_DHT_NODE_HPP
#define LLARP_DHT_NODE_HPP

#include <dht/key.hpp>
#include <router_contact.hpp>
#include <service/IntroSet.hpp>

namespace llarp
{
  namespace dht
  {
    struct RCNode : public util::IStateful
    {
      RouterContact rc;
      Key_t ID;

      RCNode()
      {
        ID.Zero();
      }

      RCNode(const RouterContact& other) : rc(other), ID(other.pubkey)
      {
      }

      void
      ExtractStatus(util::StatusObject& obj) const override
      {
        obj.PutInt("lastUpdated", rc.last_updated);
      }

      bool
      operator<(const RCNode& other) const
      {
        return rc.last_updated < other.rc.last_updated;
      }
    };

    struct ISNode : public util::IStateful
    {
      service::IntroSet introset;

      Key_t ID;

      ISNode()
      {
        ID.Zero();
      }

      ISNode(const service::IntroSet& other) : introset(other)
      {
        introset.A.CalculateAddress(ID.as_array());
      }

      void
      ExtractStatus(util::StatusObject& obj) const override
      {
        obj.PutInt("timestamp", introset.T);

        std::vector< util::StatusObject > introsObjs(introset.I.size());
        size_t idx = 0;
        for(const auto intro : introset.I)
        {
          auto& introObj = introsObjs[idx++];
          introObj.PutString("router", intro.router.ToHex());
          introObj.PutInt("expiresAt", intro.expiresAt);
          introObj.PutInt("latency", intro.latency);
          introObj.PutInt("version", intro.version);
        }
        obj.PutObjectArray("intros", introsObjs);
      }

      bool
      operator<(const ISNode& other) const
      {
        return introset.T < other.introset.T;
      }
    };
  }  // namespace dht
}  // namespace llarp

#endif