add wait guide and mofidication for the heuristic computation

[simgrid.git] / examples / c / dht-kademlia / node.h

diff --git a/examples/c/dht-kademlia/node.h b/examples/c/dht-kademlia/node.h
index f87c7ada4bcb861c96c65dd28ebc38b9d3fc4be2..d545cbe47786c31968331ba057c247c699c94b43 100644 (file)
--- a/examples/c/dht-kademlia/node.h
+++ b/examples/c/dht-kademlia/node.h
@@ -1,4 +1,4 @@
-/* Copyright (c) 2012-2020. The SimGrid Team.
+/* Copyright (c) 2012-2023. The SimGrid Team.
  * All rights reserved.                                                     */
 
 /* This program is free software; you can redistribute it and/or modify it
@@ -60,12 +60,13 @@ node_contact_t node_contact_new(unsigned int id, unsigned int distance);
 node_contact_t node_contact_copy(const_node_contact_t node_contact);
 void node_contact_free(node_contact_t contact);
 
+kademlia_message_t receive(node_t node, sg_mailbox_t mailbox);
 unsigned int join(node_t node, unsigned int id_known);
 unsigned int find_node(node_t node, unsigned int id_to_find, unsigned int count_in_stats);
 void random_lookup(node_t node);
 
 void send_find_node(const_node_t node, unsigned int id, unsigned int destination);
-unsigned int send_find_node_to_best(node_t node, const_answer_t node_list);
+unsigned int send_find_node_to_best(const_node_t node, const_answer_t node_list);
 
 void handle_find_node(const_node_t node, const_kademlia_message_t data);