File utils.c

File List > gen-rlitt > test > utils > utils.c
/* */
/* Created by joe on 4/25/25. */
/* */
#include "utils.h"
#include "storage_defs.h"
#include "stdbool.h"

static bool nodes_walk(const note_wptt_node_t *node1,
                       const note_wptt_node_t *node2);

/******************************************************************************/
/*******************************Test Data******** ************************/
/******************************************************************************/
static note_wptt_node_t        note_wptt_node[200 * UTIL_TANG_DEFS_MAX_CROSSINGNUM];
static note_wptt_node_buffer_t buffer = { note_wptt_node,
                                          200u * UTIL_TANG_DEFS_MAX_CROSSINGNUM,
                                          0 };

static note_wptt_t note_wptt_buffer[100 * UTIL_TANG_DEFS_MAX_CROSSINGNUM];
static size_t      note_wptt_buffer_idx = 0;
/******************************************************************************/
/*******************************Test Functions******** ************************/
/******************************************************************************/

static bool nodes_walk(const note_wptt_node_t *node1,
                       const note_wptt_node_t *node2)
{
    if ((node1->number_of_rings == node2->number_of_rings) &&
        (node1->number_of_children == node2->number_of_children) &&
        (node1->order == node2->order))
    {
        int i = 0;
        for (; i < node1->number_of_children; i++)
        {
            if (node1->weights[i] != node2->weights[i])
            {
                return false;
            }
            if (false == nodes_walk(node1->children[i], node2->children[i]))
            {
                return false;
            }
        }
        if (node1->weights[node1->number_of_children] !=
            node2->weights[node1->number_of_children])
        {
            return false;
        }
    }
    else
    {
        return false;
    }
    return true;
}

bool test_util_trees_equal(const note_wptt_t *tree1, const note_wptt_t *tree2)
{
    if ((tree1->label == tree2->label))
    {
        return nodes_walk(tree1->root, tree2->root);
    }
    return false;
}

note_wptt_node_buffer_t *test_util_get_buffer(void)
{
    return &buffer;
}

void test_util_clear_buffer()
{
    size_t i;

    for (i = 0; i < 2 * UTIL_TANG_DEFS_MAX_CROSSINGNUM; i++)
    {
        size_t j;
        for (j = 0; j < UTIL_TANG_DEFS_MAX_CROSSINGNUM; j++)
        {
            buffer.buffer[i].children[j] = NULL;
            buffer.buffer[i].weights[j]  = 0;
        }
        buffer.buffer[i].weights[j]         = 0;
        buffer.buffer[i].number_of_children = 0;
        buffer.buffer[i].number_of_rings    = 0;
        buffer.buffer[i].order = NOTE_WPTT_ORDER_UNINIT;
    }
    buffer.idx  = 0;
    buffer.size = 2 * UTIL_TANG_DEFS_MAX_CROSSINGNUM;
    for (i = 0; i < 20 * UTIL_TANG_DEFS_MAX_CROSSINGNUM; i++)
    {
        note_wptt_buffer[i].root        = NULL;
        note_wptt_buffer[i].label       = NOTE_WPTT_V4_LABEL_UNINIT;
        note_wptt_buffer[i].node_buffer = NULL;
    }
}

void load_note(note_wptt_t **list, char **strings, size_t count)
{
    size_t i;

    for (i = 0; i < count; i++)
    {
        list[i] = &note_wptt_buffer[note_wptt_buffer_idx];
        note_wptt_buffer_idx++;
        list[i]->node_buffer = &buffer;
        if (NOTE_DEFS_DECODE_SUCCESS != note_wptt_decode(strings[i], list[i]))
        {
            note_wptt_buffer_idx = 0;
        }
    }
}