Mercurial > hg > dav / file revision

/*
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
 *
 * Copyright 2025 Olaf Wintermann. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *   1. Redistributions of source code must retain the above copyright
 *      notice, this list of conditions and the following disclaimer.
 *
 *   2. Redistributions in binary form must reproduce the above copyright
 *      notice, this list of conditions and the following disclaimer in the
 *      documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "test_resource.h"

#include "helper.h"


CX_TEST(test_resource_iterator_visitor) {
    DavContext *ctx = dav_context_new();
    DavSession *sn = test_session(ctx);
    CX_TEST_DO {
        DavResource *root = dav_resource_new(sn, "/");
        DavResource *c1 = dav_resource_new(sn, "/child1");
        DavResource *c2 = dav_resource_new(sn, "/child2");
        DavResource *c1c1 = dav_resource_new(sn, "/child1/sub1");
        DavResource *c1c2 = dav_resource_new(sn, "/child1/sub2");
        DavResource *c1c2c1 = dav_resource_new(sn, "/child2/sub2/x1");
        DavResource *c1c3 = dav_resource_new(sn, "/child1/sub3");
        DavResource *c3 = dav_resource_new(sn, "/child3");
        
        root->children = c1;
        c1->next = c2; c2->prev = c1;
        c2->next = c3; c3->prev = c2;
        
        c1->parent = root;
        c2->parent = root;
        c3->parent = root;
        
        c1->children = c1c1;
        c1c1->next = c1c2; c1c2->prev = c1c1;
        c1c2->next = c1c3; c1c3->prev = c1c2;
        
        c1c1->parent = c1;
        c1c2->parent = c1;
        c1c3->parent = c1;
        
        c1c2->children = c1c2c1; c1c2c1->parent = c1c2;
        
        DavResource *resources[] = {root, c1, c2, c3, c1c1, c1c2, c1c3, c1c2c1 };
        
        // Iterator Test
        CxTreeIterator i = dav_resource_iterator(root);
        int iterated = 0;
        cx_foreach(DavResource *, res, i) {
            for(int r=0;r<8;r++) {
                if(res == resources[r]) {
                    res->exists = 1;
                    break;
                }
            }
            iterated++;
        }
        CX_TEST_ASSERT(iterated == 8);
        
        for(int ir=0;ir<8;ir++) {
            CX_TEST_ASSERT(resources[ir]->exists);
            resources[ir]->exists = 0; // reset for next test
        }
        
        // Visitor Test
        CxTreeVisitor v = dav_resource_visitor(root);
        int visited = 0;
        cx_foreach(DavResource *, res, v) {
            for(int r=0;r<8;r++) {
                if(res == resources[r]) {
                    res->exists = 1;
                    break;
                }
            }
            visited++;
        }
        CX_TEST_ASSERT(visited == 8);
        
        for(int vr=0;vr<8;vr++) {
            CX_TEST_ASSERT(resources[vr]->exists);
            resources[vr]->exists = 0; // reset for next test
        }
        
        
        // partial test
        i = dav_resource_iterator(c1);
        iterated = 0;
        cx_foreach(DavResource *, res, i) {
            iterated++;
        }
        CX_TEST_ASSERT(iterated == 7);
        
        v = dav_resource_visitor(c1);
        visited = 0;
        cx_foreach(DavResource *, res, v) {
            visited++;
        }
        CX_TEST_ASSERT(visited == 7);
    }
    dav_context_destroy(ctx);
}

CX_TEST(test_resource_map) {
    DavContext *ctx = dav_context_new();
    DavSession *sn = test_session(ctx);
    CX_TEST_DO {
        DavResource *root = dav_resource_new(sn, "/");
        DavResource *c1 = dav_resource_new(sn, "/child1");
        DavResource *c2 = dav_resource_new(sn, "/child2");
        DavResource *c1c1 = dav_resource_new(sn, "/child1/sub1");
        DavResource *c1c2 = dav_resource_new(sn, "/child1/sub2");
        DavResource *c2c2c1 = dav_resource_new(sn, "/child2/sub2/x1");
        DavResource *c1c3 = dav_resource_new(sn, "/child1/sub3");
        DavResource *c3 = dav_resource_new(sn, "/child3");
        
        root->children = c1;
        c1->next = c2; c2->prev = c1;
        c2->next = c3; c3->prev = c2;
        
        c1->parent = root;
        c2->parent = root;
        c3->parent = root;
        
        c1->children = c1c1;
        c1c1->next = c1c2; c1c2->prev = c1c1;
        c1c2->next = c1c3; c1c3->prev = c1c2;
        
        c1c1->parent = c1;
        c1c2->parent = c1;
        c1c3->parent = c1;
        
        c1c2->children = c2c2c1; c2c2c1->parent = c1c2;
        
        CxMap *map = dav_resource_map(root);
        CX_TEST_ASSERT(cxMapGet(map, "/") == root);
        CX_TEST_ASSERT(cxMapGet(map, "/child1") == c1);
        CX_TEST_ASSERT(cxMapGet(map, "/child2") == c2);
        CX_TEST_ASSERT(cxMapGet(map, "/child3") == c3);
        CX_TEST_ASSERT(cxMapGet(map, "/child1/sub1") == c1c1);
        CX_TEST_ASSERT(cxMapGet(map, "/child1/sub2") == c1c2);
        CX_TEST_ASSERT(cxMapGet(map, "/child1/sub3") == c1c3);
        CX_TEST_ASSERT(cxMapGet(map, "/child2/sub2/x1") == c2c2c1);
    }
    dav_context_destroy(ctx);
}