X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/0746edb369906f57c331d9336bf85ae91094ad51..0bfafcab47ae9cd7856bd8d129404c33079d6afe:/examples/s4u/dht-kademlia/answer.hpp

diff --git a/examples/s4u/dht-kademlia/answer.hpp b/examples/s4u/dht-kademlia/answer.hpp
deleted file mode 100644
index 659528425a..0000000000
--- a/examples/s4u/dht-kademlia/answer.hpp
+++ /dev/null
@@ -1,34 +0,0 @@
-/* Copyright (c) 2012-2021. The SimGrid Team.
- * All rights reserved.                                                     */
-
-/* This program is free software; you can redistribute it and/or modify it
- * under the terms of the license (GNU LGPL) which comes with this package. */
-
-#ifndef _KADEMLIA_ANSWER_HPP_
-#define _KADEMLIA_ANSWER_HPP_
-
-#include "node.hpp"
-#include "routing_table.hpp"
-#include <set>
-
-namespace kademlia {
-/* Node query answer. contains the elements closest to the id given. */
-class Answer {
-  unsigned int destination_id_;
-  std::vector<std::pair<unsigned int, unsigned int>> nodes_;
-
-public:
-  explicit Answer(unsigned int destination_id) : destination_id_(destination_id) {}
-  virtual ~Answer() = default;
-  unsigned int getDestinationId() const { return destination_id_; }
-  size_t getSize() const { return nodes_.size(); }
-  const std::vector<std::pair<unsigned int, unsigned int>>& getNodes() const { return nodes_; }
-  void print() const;
-  unsigned int merge(const Answer* a);
-  void trim();
-  bool destinationFound() const;
-  void addBucket(const kademlia::Bucket* bucket);
-};
-} // namespace kademlia
-
-#endif