int main (int argc, char* argv[])
{
clock_t begin, end;
double time_spent;
//^^^^^^^^^^^^^^^^^^^^^^^^^
//Default part BEGIN
//^^^^^^^^^^^^^^^^^^^^^^^^^
INFO();
CHECK_DEFAULT_ARGS();
char inName[NAME_MAX] = {}, outName[NAME_MAX] = {};
switch (argc)
{
case 3:
strcpy (inName, argv[1]);
strcpy (outName, argv[2]);
break;
case 2:
strcpy (inName, argv[1]);
strcpy (outName, "info.csv");
break;
default:
WRITE_WRONG_USE();
}
// Words will be loaded here
Buffer words = {};
if (!buffer_construct(&words, inName))
return WRONG_USE;
// We'll store lists here
list_t* lists = (list_t*)calloc (HASH_TABLE_SIZE, sizeof(list_t));
for (int i = 0; i < HASH_TABLE_SIZE; i++)\
list_t_construct(lists + i, 0);
//buffer_dump(&words);
size_t counter = 0, total = words.length;
#ifndef NO_OUTPUT
printf ("Progress:\n");
#endif // NO_OUTPUT
// Get the chars array from buffer
begin = clock();
for (char *word = words.chars; counter < words.length; word++){
#ifndef NO_OUTPUT
if (counter % (size_t)total / 1000){
printf ("\r%.1f%%", 100.0*counter/total);
fflush(stdout);
}
#endif // NO_OUTPUT
counter++;
// Locating first letter
if (isalnum (*word)){
//Pointer to the word
char *new_word = word;
// Finding first non-letter
while (isalnum (*word) || strchr(OK_PUNCT, *word)){
word++;
counter++;
}
//Indicating the end
*word = '\0';
//printf ("Trying to add: %s\n", new_word);
// Finding the right place to insert
size_t position;
position = hash_xor_opt(new_word) % HASH_TABLE_SIZE;
list_t_add(lists + position, new_word);
//list_t_dump(lists + position);
}
}
end = clock();
time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
printf ("Hash table creation: %lfms\n", time_spent*1000);
// Newline after progress bar
printf ("\n");
/// Some tests
/*
size_t position;
position = hash_xor_opt("herdersleven") % HASH_TABLE_SIZE;
list_t_dump(lists + position);
list_node_t_remove(lists[position].storage + 3);
list_t_dump(lists + position);
list_t_exchange_num(lists+position, 2,4);
list_t_dump(lists + position);
*/
/// TIME MEASUREMENT
begin = clock();
end = clock();
time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
printf ("Empty timer: %lfms\n", time_spent*1000);
list_node_t* found = NULL;
begin = clock();
found = hash_table_get_node (lists, HASH_TABLE_SIZE, "draagberries");
end = clock();
time_spent = (double)(end - begin) / CLOCKS_PER_SEC;
printf ("Search time: %lfms\n", time_spent*1000);
if (found)
list_node_t_dump(found);
else
printf ("Not found");
/// TIME MEASUREMENT END
#ifndef NO_OUTPUT
open_file (out, outName, "w", "#Output error");
fprintf (out, "Hash value, ");
for (size_t i = 0; i < HASH_TABLE_SIZE; i++)
fprintf (out, "%lu, ", i);
fprintf (out, "\n");
fprintf (out, "Hash type: " "xor_opt" ", ");
for (size_t i = 0; i < HASH_TABLE_SIZE; i++){
fprintf (out, "%lu, ", lists[i].size);
list_t_destruct(lists + i);
}
fprintf (out, "\n");
close_file(out);
#endif // NO_OUTPUT
printf ("\nThe info has been successfully written to %s.\n", outName);
free (lists);
buffer_destruct(&words);
return NO_ERROR;
}
int main(int argc, char **argv)
{
if (argc != 4 && argc != 5 && argc != 6) {
DP("Usage: %s <svc_conf> <svc_name> <uid> [row] [col]", argv[0]);
return -1;
}
int show_one_row = 0;
char *svc_conf = argv[1];
char *svc_name = argv[2];
uint32_t uid = atoi(argv[3]);
if (uid == 0 && argc != 5 && argc != 6) {
DP("Usage: %s <svc_conf> <svc_name> <uid> <row> [col]", argv[0]);
return -1;
}
uint32_t row = 0, col = 0;
if (argc >= 5) {
row = atoi(argv[4]);
show_one_row = 1;
if (argc == 6) {
col = atoi(argv[5]);
show_one_row = 0;
}
}
uint32_t row_num, *nodes_num, *mods;
if (init_system(svc_conf, svc_name, &row_num, &nodes_num, &mods) == -1) {
DP("Failed to init_system");
return -1;
}
if (row >= row_num || col >= nodes_num[row]) {
DP("Invalid row: %u(max: %u), or col: %u(max: %u)",
row, col, row_num, (row < row_num) ? nodes_num[row] : 0);
return -1;
}
struct uid_node_t *uid_node = NULL;
if (show_one_row) { /* show one row */
int c = 0;
for (; c < nodes_num[row]; c++) {
uid_node = hash_table_get_node(uid_nodes_htab, row, c);
if (uid_node->uid == 0) {
//DP("row: %u, col: %u svc: %s is empty", row, c, svc_name);
continue;
}
show_one_uid_node(uid_node, row, c);
}
return 0;
}
if (uid == 0) {
uid_node = hash_table_get_node(uid_nodes_htab, row, col);
if (uid_node->uid == 0) {
DP("row: %u, col: %u svc: %s is empty", row, col, svc_name);
return 0;
}
} else {
uid_node = HTAB_LOOKUP_POSINFO(uid_nodes_htab, uid, row, col);
if (!uid_node) {
DP("uid: %u is not coming in svc: %s", uid, svc_name);
return 0;
}
}
/* show uid_node info */
show_one_uid_node(uid_node, row, col);
return 0;
}
