1 /* Copyright (c) 2012. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #ifndef _KADEMLIA_EXAMPLES_ANSWER_H_
7 #define _KADEMLIA_EXAMPLES_ANSWER_H_
9 #include "routing_table.h"
11 * Node query anwser. contains the elements closest
14 typedef struct s_node_answer {
15 unsigned int destination_id;
16 xbt_dynar_t nodes; //Dynar of node_contact_t
18 } s_answer_t, *answer_t;
22 answer_t answer_init(unsigned int destination_id);
23 void answer_free(answer_t answer);
24 void answer_print(answer_t answer);
25 unsigned int answer_merge(answer_t destination, answer_t source);
26 void answer_sort(answer_t answer);
27 void answer_trim(answer_t answer);
28 void answer_add_bucket(bucket_t bucket, answer_t answer);
29 unsigned int answer_contains(answer_t answer, unsigned int id);
30 unsigned int answer_destination_found(answer_t answer);
32 #endif /* _KADEMLIA_EXAMPLES_ANSWER_H_ */