ziti-sdk-c/tests/collections_tests.cpp

// Copyright (c) 2020-2023.  NetFoundry Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

#include "catch2_includes.hpp"

#include <ziti/model_collections.h>
#include <cstring>


TEST_CASE("model bench", "[model]") {
    char key[128];
    model_map m = {nullptr};
    for (int i = 0; i < 50000; i++) {
        snprintf(key, sizeof(key), "key%d", i);
        model_map_set(&m, key, strdup(key));
    }

    model_map_iter it = model_map_iterator(&m);

    int i = 0;
    while(it != nullptr) {
        void *val = model_map_it_value(it);
        if (i++ % 2 == 0) {
            free(val);
            it = model_map_it_remove(it);
        } else {
            it = model_map_it_next(it);
        }
    }

    for (i = 0; i < 50000; i++) {
        snprintf(key, sizeof(key), "key%d", i);
        void *val = model_map_remove(&m, key);
        if (val) { free(val); }
    }

    model_map_clear(&m, free);
}

TEST_CASE("map[long->str] bench", "[model]") {
    char key[128];
    model_map m = {nullptr};
    long i;
    for (i = 0; i < 50000; i++) {
        snprintf(key, sizeof(key), "%ld", i);
        model_map_setl(&m, i, strdup(key));
    }

    for (i = 0; i < 50000; i++) {
        const char *val = static_cast<const char *>(model_map_getl(&m, i));
        CHECK(i == atol(val));
    }

    model_map_iter it = model_map_iterator(&m);

    while (it != nullptr) {
        char *val = static_cast<char *>(model_map_it_value(it));
        long k = model_map_it_lkey(it);
        REQUIRE(k == atol(val));
        if (k % 2 == 0) {
            free(val);
            it = model_map_it_remove(it);
        } else {
            it = model_map_it_next(it);
        }
    }

    model_map_clear(&m, free);
}

TEST_CASE("remove last element", "[model]") {
    model_map m = {nullptr};
    char key[128];
    for (int i = 0; i < 50; i++) {
        snprintf(key, sizeof(key), "%d", i);
        model_map_setl(&m, i, strdup(key));
    }

    for (int i = 0; i < 50; i++) {
        auto val = model_map_removel(&m, i);
        free(val);
    }

    REQUIRE(m.impl == nullptr);
}

TEST_CASE("it remove last element", "[model]") {
    model_map m = {nullptr};
    char key[128];
    for (int i = 0; i < 50; i++) {
        snprintf(key, sizeof(key), "%d", i);
        model_map_setl(&m, i, strdup(key));
    }

    auto it = model_map_iterator(&m);
    while (it != nullptr) {
        auto val = model_map_it_value(it);
        it = model_map_it_remove(it);
        free(val);
    }

    REQUIRE(m.impl == nullptr);
}

TEST_CASE("list tests", "[model]") {
    model_list l = {nullptr};
    const void *msg;


    CHECK(model_list_size(&l) == 0);
    CHECK(model_list_iterator(&l) == nullptr);
    CHECK(model_list_pop(&l) == nullptr);
    MODEL_LIST_FOREACH(msg, l) {
        FAIL_CHECK("should not make here");
    }

    auto msg1 = "this is message1";
    auto msg2 = "this is message2";

    model_list_append(&l, (void *) msg1);
    CHECK(model_list_size(&l) == 1);
    CHECK(model_list_head(&l) == msg1);
    CHECK(model_list_it_element(model_list_iterator(&l)) == msg1);

    model_list_append(&l, (void *) msg2);
    CHECK(model_list_size(&l) == 2);
    CHECK(model_list_head(&l) == msg1);
    CHECK(model_list_it_element(model_list_iterator(&l)) == msg1);
    CHECK(model_list_it_element(
            model_list_it_next(
                    model_list_iterator(&l))) == msg2);

    MODEL_LIST_FOREACH(msg, l) {
        printf("msg = %s\n", (const char *) msg);
    }

    auto it = model_list_iterator(&l);
    it = model_list_it_remove(it);
    CHECK(model_list_size(&l) == 1);
    CHECK(model_list_head(&l) == msg2);
    CHECK(model_list_it_element(it) == msg2);
    CHECK(model_list_it_next(it) == nullptr);
    CHECK(model_list_it_element(model_list_iterator(&l)) == msg2);

    CHECK(model_list_it_remove(it) == nullptr);
    CHECK(model_list_size(&l) == 0);
    CHECK(l.impl == nullptr);
}

TEST_CASE("map-non-terminated-string-keys", "[model]") {
    char keys[] = "aaaaaaaaaaaaaaaa";

    model_map m = {nullptr};
    for (int i = 1; i < sizeof(keys); i++) {
        model_map_set_key(&m, keys, i, (void *) (intptr_t) (i));
    }

    CHECK(model_map_size(&m) == strlen(keys));
    for (int i = 1; i < sizeof(keys); i++) {
        int v = (int) (intptr_t) model_map_get_key(&m, keys, i);
        CHECK(v == i);
    }

    auto it = model_map_iterator(&m);
    while (it) {
        const char *key = model_map_it_key(it);
        int v = (int) (intptr_t) model_map_it_value(it);
        CHECK(strlen(key) == v);
        it = model_map_it_next(it);
    }

    model_map_clear(&m, nullptr);
}

TEST_CASE("map remove inside foreach", "[model]") {
    model_map m = {nullptr};
    char key[128];
    for (int i = 0; i < 50; i++) {
        snprintf(key, sizeof(key), "%d", i);
        model_map_set(&m, key, strdup(key));
    }

    const char *k;
    const char *val;
    MODEL_MAP_FOREACH(k, val, &m) {
        void *v = model_map_remove(&m, k);
        free(v);
    }

    REQUIRE(m.impl == nullptr);
}

TEST_CASE("map remove it inside foreach", "[model]") {
    model_map m = {nullptr};
    char key[128];
    for (int i = 0; i < 50; i++) {
        snprintf(key, sizeof(key), "%d", i);
        model_map_set(&m, key, strdup(key));
    }

    MODEL_MAP_FOR(it, m) {
        auto val = model_map_it_value(it);
        model_map_it_remove(it);
        free(val);
    }

    REQUIRE(m.impl == nullptr);
}

TEST_CASE("list remove inside foreach", "[model]") {
    model_list l{};
    char key[128];
    for (int i = 0; i < 50; i++) {
        snprintf(key, sizeof(key), "%d", i);
        model_list_append(&l, strdup(key));
    }

    MODEL_LIST_FOR(it, l) {
        auto val = model_list_it_element(it);
        model_list_it_remove(it);
        free((void*)val);
    }

    REQUIRE(l.impl == nullptr);
}