2 This file is part of GNUnet
3 (C) 2012 Christian Grothoff (and other contributing authors)
5 GNUnet is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published
7 by the Free Software Foundation; either version 3, or (at your
8 option) any later version.
10 GNUnet is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with GNUnet; see the file COPYING. If not, write to the
17 Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA.
21 * @file regex/test_regex_iterate_api.c
22 * @brief test for regex.c
23 * @author Maximilian Szengel
28 #include "gnunet_regex_lib.h"
29 #include "regex_internal.h"
31 static unsigned int transition_counter;
34 key_iterator (void *cls, const struct GNUNET_HashCode *key, const char *proof,
35 int accepting, unsigned int num_edges,
36 const struct GNUNET_REGEX_Edge *edges)
41 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Iterating... (accepting: %i)\n",
45 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Proof: %s\n", proof);
48 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Hash: %s\n", GNUNET_h2s (key));
50 for (i = 0; i < num_edges; i++)
53 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG, "Edge %i: Label: %s Destination: %s\n",
54 i, edges[i].label, GNUNET_h2s (&edges[i].destination));
57 *error += (GNUNET_OK == GNUNET_REGEX_check_proof (proof, key)) ? 0 : 1;
61 main (int argc, char *argv[])
63 GNUNET_log_setup ("test-regex",
73 struct GNUNET_REGEX_Automaton *dfa;
74 unsigned int num_transitions;
78 const char *regex[17] = {
79 "ab(c|d)+c*(a(b|c)+d)+(bla)+",
83 "ab(c|d)+c*(a(b|c)+d)+(bla)(bla)*",
87 "a+X*y+c|p|R|Z*K*y*R+w|Y*6+n+h*k*w+V*F|W*B*e*",
88 "abcd:(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1):(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)(0|1)",
98 for (i = 0; i < 17; i++)
100 transition_counter = 0;
101 dfa = GNUNET_REGEX_construct_dfa (regex[i], strlen (regex[i]));
102 GNUNET_REGEX_iterate_all_edges (dfa, key_iterator, &error);
103 num_transitions = GNUNET_REGEX_get_transition_count (dfa);
104 if (transition_counter != num_transitions)
106 GNUNET_log (GNUNET_ERROR_TYPE_DEBUG,
107 "Automaton has %d transitions, iterated over %d transitions\n",
108 num_transitions, transition_counter);
110 GNUNET_REGEX_automaton_destroy (dfa);
113 for (i = 0; i < 17; i++)
115 dfa = GNUNET_REGEX_construct_dfa (regex[i], strlen (regex[i]));
116 GNUNET_REGEX_add_multi_strides_to_dfa (NULL, dfa, 2);
117 GNUNET_REGEX_iterate_all_edges (dfa, key_iterator, &error);
118 GNUNET_REGEX_automaton_destroy (dfa);