httpc/tree_8h_source.html

#ifndef URI_TREE

#define URI_TREE


#include "request_parser.h"

#include "response.h"

typedef void (*callback_t)(request, response*);


typedef struct node {

    char* val;

    struct node* children;

    struct node* siblings;

    callback_t callback;

} node;


node* find_node_by_val(node* n, char* val);

node* trace_tree(char route[], node* origin_node);

node* trace_tree_exact(char route[], node* root);

void destroy_tree(node* n);

void print_tree(node* n, int level);

#endif

request_parser.h

response.h

node
Definition tree.h:36

node::children
struct node * children
All nodes, whose routes include this node's val in their fsegment.
Definition tree.h:40

node::siblings
struct node * siblings
All nodes, whose routes include this node's, parent's, val in their fsegment.
Definition tree.h:42

node::callback
callback_t callback
The function that will be ran when a request comes.
Definition tree.h:44

node::val
char * val
a URI fsegment
Definition tree.h:38

request
Definition request_parser.h:11

response
Definition response.h:12

find_node_by_val
node * find_node_by_val(node *n, char *val)
gets the node that matches a given val in a DFS manner
Definition tree.c:17

trace_tree_exact
node * trace_tree_exact(char route[], node *root)
returns the node of the last segment in the URI. If a complete trace isn't found, return null.
Definition tree.c:55

destroy_tree
void destroy_tree(node *n)
Given a root node, deallocate the entire tree.
Definition tree.c:73

print_tree
void print_tree(node *n, int level)
Given a root node, print the entire tree in a DFS manner, along with the level of each node.
Definition tree.c:88

trace_tree
node * trace_tree(char route[], node *origin_node)
given a route, return the deepest node that exists in the tree that satisfies the route
Definition tree.c:33