1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219
|
//
// File: test_text_tools.cpp
// Authors:
// Julien Dutheil
// Francois Gindraud (2017)
// Created: 2011-11-05 16:12:00
// Last modified: 2017-06-26
//
/*
Copyright or © or Copr. Bio++ Development Team, (November 17, 2004)
This software is a computer program whose purpose is to provide classes
for numerical calculus. This file is part of the Bio++ project.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include "doctest.h"
#include <Bpp/Text/StringTokenizer.h>
#include <Bpp/Text/TextTools.h>
#include <iostream>
#include <string>
namespace TextTools = bpp::TextTools;
using bpp::StringTokenizer;
TEST_CASE("string capitalization")
{
CHECK(TextTools::toUpper("aBcDEF ") == "ABCDEF ");
CHECK(TextTools::toLower("aBcDEF ") == "abcdef ");
}
TEST_CASE("string stripping")
{
std::string base_text = "abc def";
std::string base_text_no_spaces = "abcdef";
std::string empty = "";
std::string all_space = " \t\n";
std::string no_space = base_text;
std::string leading_space_only = " " + base_text;
std::string trailing_space_only = base_text + " ";
std::string multi_space = " " + base_text + " ";
SUBCASE("Remove all whitespace")
{
CHECK(TextTools::removeWhiteSpaces(empty) == empty);
CHECK(TextTools::removeWhiteSpaces(all_space) == empty);
CHECK(TextTools::removeWhiteSpaces(no_space) == base_text_no_spaces);
CHECK(TextTools::removeWhiteSpaces(leading_space_only) == base_text_no_spaces);
CHECK(TextTools::removeWhiteSpaces(trailing_space_only) == base_text_no_spaces);
CHECK(TextTools::removeWhiteSpaces(multi_space) == base_text_no_spaces);
}
SUBCASE("Remove leading space")
{
CHECK(TextTools::removeFirstWhiteSpaces(empty) == "");
CHECK(TextTools::removeFirstWhiteSpaces(all_space) == "");
CHECK(TextTools::removeFirstWhiteSpaces(no_space) == base_text);
CHECK(TextTools::removeFirstWhiteSpaces(leading_space_only) == base_text);
CHECK(TextTools::removeFirstWhiteSpaces(trailing_space_only) == trailing_space_only);
CHECK(TextTools::removeFirstWhiteSpaces(multi_space) == trailing_space_only);
}
SUBCASE("Remove trailing space")
{
CHECK(TextTools::removeLastWhiteSpaces(empty) == "");
CHECK(TextTools::removeLastWhiteSpaces(all_space) == "");
CHECK(TextTools::removeLastWhiteSpaces(no_space) == base_text);
CHECK(TextTools::removeLastWhiteSpaces(leading_space_only) == leading_space_only);
CHECK(TextTools::removeLastWhiteSpaces(trailing_space_only) == base_text);
CHECK(TextTools::removeLastWhiteSpaces(multi_space) == leading_space_only);
}
SUBCASE("Remove leading and trailing space")
{
CHECK(TextTools::removeSurroundingWhiteSpaces(empty) == "");
CHECK(TextTools::removeSurroundingWhiteSpaces(all_space) == "");
CHECK(TextTools::removeSurroundingWhiteSpaces(no_space) == base_text);
CHECK(TextTools::removeSurroundingWhiteSpaces(leading_space_only) == base_text);
CHECK(TextTools::removeSurroundingWhiteSpaces(trailing_space_only) == base_text);
CHECK(TextTools::removeSurroundingWhiteSpaces(multi_space) == base_text);
}
}
TEST_CASE("string conversion")
{
CHECK_FALSE(TextTools::isDecimalNumber("aazz"));
CHECK_FALSE(TextTools::isDecimalNumber("-aazz"));
CHECK_FALSE(TextTools::isDecimalNumber("-3.45z"));
CHECK(TextTools::isDecimalNumber("0"));
CHECK(TextTools::isDecimalNumber("123"));
CHECK(TextTools::isDecimalNumber("-123"));
CHECK(TextTools::isDecimalNumber("-123.456"));
CHECK(TextTools::isDecimalInteger("123456"));
CHECK(TextTools::isDecimalInteger("-7890"));
CHECK(TextTools::isDecimalNumber("-123.456e-5"));
CHECK_FALSE(TextTools::isDecimalNumber("-123.456e-5.8"));
CHECK(TextTools::isDecimalInteger("-123e6"));
CHECK_FALSE(TextTools::isDecimalInteger("-123.456e5"));
CHECK_FALSE(TextTools::isDecimalInteger("-123e-6"));
}
TEST_CASE("string resizing")
{
std::string t = "hello world";
CHECK(TextTools::resizeRight(t, 4) == "hell");
CHECK(TextTools::resizeRight(t, 20) == t + std::string(20 - t.size(), ' '));
CHECK(TextTools::resizeLeft(t, 4) == "orld");
CHECK(TextTools::resizeLeft(t, 20) == std::string(20 - t.size(), ' ') + t);
}
TEST_CASE("string splitting")
{
std::vector<std::string> r1 {"hell", "o wo", "rld"};
CHECK(TextTools::split("hello world", 4) == r1);
std::vector<std::string> r2 {"hell", "o wo", "rld!"};
CHECK(TextTools::split("hello world!", 4) == r2);
}
TEST_CASE("string search")
{
std::string t = "hello world world !";
SUBCASE("startswith")
{
CHECK(TextTools::startsWith(t, "hello"));
CHECK_FALSE(TextTools::startsWith(t, "blah"));
CHECK(TextTools::startsWith(t, ""));
CHECK_FALSE(TextTools::startsWith("", "blah"));
}
SUBCASE("endswith")
{
CHECK(TextTools::endsWith(t, "world !"));
CHECK_FALSE(TextTools::endsWith(t, "blah"));
CHECK(TextTools::endsWith(t, ""));
CHECK_FALSE(TextTools::endsWith("", "blah"));
}
SUBCASE("hasSubstring")
{
CHECK(TextTools::hasSubstring(t, "world"));
CHECK_FALSE(TextTools::hasSubstring(t, "blah"));
CHECK(TextTools::hasSubstring(t, ""));
CHECK_FALSE(TextTools::hasSubstring("", "blah"));
}
SUBCASE("count")
{
CHECK(TextTools::count(t, "world") == 2);
CHECK(TextTools::count(t, "blah") == 0);
CHECK(TextTools::count(t, "hell") == 1);
CHECK(TextTools::count("", "blah") == 0);
}
}
TEST_CASE("string replace")
{
std::string t = "hello world world !";
TextTools::replaceAll (t, "world", "sun");
CHECK (t == "hello sun sun !");
std::string t2 = "hell";
TextTools::replaceAll (t2, "world", "sun");
CHECK (t2 == "hell");
}
TEST_CASE("string tokenizer")
{
SUBCASE("Case 1")
{
StringTokenizer st(" aaazzer aeerd a eer", " \t", false, false);
CHECK(st.numberOfRemainingTokens() == 4);
CHECK(st.nextToken() == "aaazzer");
CHECK(st.nextToken() == "aeerd");
CHECK(st.nextToken() == "a");
CHECK(st.nextToken() == "eer");
}
SUBCASE("Case 2")
{
StringTokenizer st(" aaazzer aeerd a eer", " \t", false, true);
CHECK(st.numberOfRemainingTokens() == 8);
CHECK(st.nextToken() == "aaazzer");
CHECK(st.nextToken() == "");
CHECK(st.nextToken() == "aeerd");
CHECK(st.nextToken() == "a");
CHECK(st.nextToken() == "");
CHECK(st.nextToken() == "");
CHECK(st.nextToken() == "");
CHECK(st.nextToken() == "eer");
}
SUBCASE("Case 3")
{
StringTokenizer st(" aaazzer aeerd a eer", " \t", true, false);
CHECK(st.numberOfRemainingTokens() == 1);
CHECK(st.nextToken() == " aaazzer aeerd a eer");
}
}
|