527fbe3413
This is implemented using several URL path helper functions. The functions aren't strictly necessary, but the functions make it easier to implement and test the resolution functionality.
150 lines
4.5 KiB
C++
150 lines
4.5 KiB
C++
// Copyright (C) 2020-2021 Primate Labs Inc.
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * 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.
|
|
// * Neither the names of the copyright holders nor the names of their
|
|
// contributors may be used to endorse or promote products derived from
|
|
// this software without specific prior written permission.
|
|
//
|
|
// 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
|
|
// OWNER 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 "litehtml/url_path.h"
|
|
|
|
#include <iostream>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
using namespace litehtml;
|
|
|
|
namespace {
|
|
|
|
struct url_path_testcase {
|
|
tstring base;
|
|
tstring path;
|
|
tstring expected;
|
|
};
|
|
|
|
} // namespace
|
|
|
|
TEST(URLPathTest, Absolute)
|
|
{
|
|
std::vector<std::pair<tstring, bool>> testcases = {
|
|
{ _t(""), false },
|
|
{ _t("a"), false },
|
|
{ _t("a/"), false },
|
|
{ _t("a/b"), false },
|
|
{ _t("a/b/"), false },
|
|
{ _t("a/b/c"), false },
|
|
{ _t("a/b/c/"), false },
|
|
|
|
{ _t("/"), true },
|
|
{ _t("/a"), true },
|
|
{ _t("/a/"), true },
|
|
{ _t("/a/b"), true },
|
|
{ _t("/a/b/"), true },
|
|
{ _t("/a/b/c"), true },
|
|
{ _t("/a/b/c/"), true },
|
|
};
|
|
|
|
for (auto& testcase : testcases) {
|
|
EXPECT_EQ(testcase.second, is_url_path_absolute(testcase.first));
|
|
}
|
|
}
|
|
|
|
TEST(URLPathTest, DirectoryName)
|
|
{
|
|
std::vector<std::pair<tstring, tstring>> testcases = {
|
|
{ _t(""), _t(".") },
|
|
{ _t("a"), _t(".") },
|
|
{ _t("a/"), _t("a/") },
|
|
{ _t("a/b"), _t("a/") },
|
|
{ _t("a/b/"), _t("a/b/") },
|
|
{ _t("a/b/c"), _t("a/b/") },
|
|
{ _t("a/b/c/"), _t("a/b/c/") },
|
|
|
|
{ _t("/"), _t("/") },
|
|
{ _t("/a"), _t("/") },
|
|
{ _t("/a/"), _t("/a/") },
|
|
{ _t("/a/b"), _t("/a/") },
|
|
{ _t("/a/b/"), _t("/a/b/") },
|
|
{ _t("/a/b/c"), _t("/a/b/") },
|
|
{ _t("/a/b/c/"), _t("/a/b/c/") },
|
|
};
|
|
|
|
for (auto& testcase : testcases) {
|
|
EXPECT_EQ(testcase.second, url_path_directory_name(testcase.first));
|
|
}
|
|
}
|
|
|
|
TEST(URLPathTest, BaseName)
|
|
{
|
|
std::vector<std::pair<tstring, tstring>> testcases = {
|
|
{ _t(""), _t("") },
|
|
{ _t("a"), _t("a") },
|
|
{ _t("a/"), _t("") },
|
|
{ _t("a/b"), _t("b") },
|
|
{ _t("a/b/"), _t("") },
|
|
{ _t("a/b/c"), _t("c") },
|
|
{ _t("a/b/c/"), _t("") },
|
|
|
|
{ _t("/"), _t("") },
|
|
{ _t("/a"), _t("a") },
|
|
{ _t("/a/"), _t("") },
|
|
{ _t("/a/b"), _t("b") },
|
|
{ _t("/a/b/"), _t("") },
|
|
{ _t("/a/b/c"), _t("c") },
|
|
{ _t("/a/b/c/"), _t("") },
|
|
};
|
|
|
|
for (auto& testcase : testcases) {
|
|
EXPECT_EQ(testcase.second, url_path_base_name(testcase.first));
|
|
}
|
|
}
|
|
|
|
TEST(URLPathTest, Append)
|
|
{
|
|
std::vector<url_path_testcase> testcases = {
|
|
{ _t(""), _t("a"), _t("a") },
|
|
{ _t("/"), _t("a"), _t("/a") },
|
|
{ _t("/a"), _t(""), _t("/a") },
|
|
{ _t("/a"), _t("b"), _t("/a/b") },
|
|
};
|
|
|
|
for (auto& testcase : testcases) {
|
|
EXPECT_EQ(testcase.expected, url_path_append(testcase.base, testcase.path));
|
|
}
|
|
}
|
|
|
|
TEST(URLPathTest, Resolve)
|
|
{
|
|
std::vector<url_path_testcase> testcases = {
|
|
{ _t("/"), _t("a"), _t("/a") },
|
|
{ _t("/a"), _t("b"), _t("/b") },
|
|
{ _t("/a"), _t("/b"), _t("/b") },
|
|
};
|
|
|
|
for (auto& testcase : testcases) {
|
|
EXPECT_EQ(testcase.expected, url_path_resolve(testcase.base, testcase.path));
|
|
}
|
|
} |