Style fixes.
continuous-integration/drone/push Build is passing
Details
continuous-integration/drone/push Build is passing
Details
This commit is contained in:
parent
b7f1812153
commit
bfe1fcc805
|
@ -1,5 +1,4 @@
|
||||||
#include "ConstString.hpp"
|
#include "ConstString.hpp"
|
||||||
|
|
||||||
ArbUt::__ConstStringCharHolder* ArbUt::CaseInsensitiveConstString::__emptyString =
|
ArbUt::__ConstStringCharHolder* ArbUt::CaseInsensitiveConstString::__emptyString = new __ConstStringCharHolder("", 0);
|
||||||
new __ConstStringCharHolder("", 0);
|
|
||||||
ArbUt::__ConstStringCharHolder* ArbUt::ConstString::__emptyString = new __ConstStringCharHolder("", 0);
|
ArbUt::__ConstStringCharHolder* ArbUt::ConstString::__emptyString = new __ConstStringCharHolder("", 0);
|
|
@ -66,7 +66,6 @@ namespace ArbUt {
|
||||||
|
|
||||||
const std::vector<ValueT*>& GetStdList() const { return _vector; }
|
const std::vector<ValueT*>& GetStdList() const { return _vector; }
|
||||||
std::vector<ValueT*>& GetStdList() { return _vector; }
|
std::vector<ValueT*>& GetStdList() { return _vector; }
|
||||||
|
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -8,7 +8,7 @@
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#define ConstStringCore(name, hashFunction) \
|
#define ConstStringCore(name, hashFunction) \
|
||||||
namespace ArbUt { \
|
namespace ArbUt { \
|
||||||
class name { \
|
class name { \
|
||||||
private: \
|
private: \
|
||||||
__ConstStringCharHolder* _str; \
|
__ConstStringCharHolder* _str; \
|
||||||
|
@ -112,11 +112,11 @@
|
||||||
} \
|
} \
|
||||||
\
|
\
|
||||||
namespace std { \
|
namespace std { \
|
||||||
template <> struct hash<ArbUt::name> { \
|
template <> struct hash<ArbUt::name> { \
|
||||||
constexpr std::size_t operator()(ArbUt::name const& s) const noexcept { return s.GetHash(); } \
|
constexpr std::size_t operator()(ArbUt::name const& s) const noexcept { return s.GetHash(); } \
|
||||||
}; \
|
}; \
|
||||||
template <> struct hash<ArbUt::name##_Literal> { \
|
template <> struct hash<ArbUt::name##_Literal> { \
|
||||||
constexpr std::size_t operator()(ArbUt::name##_Literal const& s) const noexcept { return s.GetHash(); } \
|
constexpr std::size_t operator()(ArbUt::name##_Literal const& s) const noexcept { return s.GetHash(); } \
|
||||||
}; \
|
}; \
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -3,18 +3,18 @@
|
||||||
#include "../src/Memory/UniquePtrList.hpp"
|
#include "../src/Memory/UniquePtrList.hpp"
|
||||||
using namespace ArbUt;
|
using namespace ArbUt;
|
||||||
|
|
||||||
TEST_CASE("Create Unique Ptr list, append"){
|
TEST_CASE("Create Unique Ptr list, append") {
|
||||||
auto ls = UniquePtrList<uint32_t>();
|
auto ls = UniquePtrList<uint32_t>();
|
||||||
auto v1 = new uint32_t (100);
|
auto v1 = new uint32_t(100);
|
||||||
auto v2 = new uint32_t (5000);
|
auto v2 = new uint32_t(5000);
|
||||||
ls.Append(v1);
|
ls.Append(v1);
|
||||||
ls.Append(v2);
|
ls.Append(v2);
|
||||||
}
|
}
|
||||||
|
|
||||||
TEST_CASE("Create Unique Ptr list, append, retrieve"){
|
TEST_CASE("Create Unique Ptr list, append, retrieve") {
|
||||||
auto ls = UniquePtrList<uint32_t>();
|
auto ls = UniquePtrList<uint32_t>();
|
||||||
auto v1 = new uint32_t (100);
|
auto v1 = new uint32_t(100);
|
||||||
auto v2 = new uint32_t (5000);
|
auto v2 = new uint32_t(5000);
|
||||||
ls.Append(v1);
|
ls.Append(v1);
|
||||||
ls.Append(v2);
|
ls.Append(v2);
|
||||||
REQUIRE(ls.Count() == 2);
|
REQUIRE(ls.Count() == 2);
|
||||||
|
@ -24,17 +24,19 @@ TEST_CASE("Create Unique Ptr list, append, retrieve"){
|
||||||
CHECK(ls[1] == v2);
|
CHECK(ls[1] == v2);
|
||||||
}
|
}
|
||||||
|
|
||||||
TEST_CASE("Create Unique Ptr list, append, iterate"){
|
TEST_CASE("Create Unique Ptr list, append, iterate") {
|
||||||
auto ls = UniquePtrList<uint32_t>();
|
auto ls = UniquePtrList<uint32_t>();
|
||||||
auto v1 = new uint32_t (100);
|
auto v1 = new uint32_t(100);
|
||||||
auto v2 = new uint32_t (5000);
|
auto v2 = new uint32_t(5000);
|
||||||
ls.Append(v1);
|
ls.Append(v1);
|
||||||
ls.Append(v2);
|
ls.Append(v2);
|
||||||
REQUIRE(ls.Count() == 2);
|
REQUIRE(ls.Count() == 2);
|
||||||
auto i = 0;
|
auto i = 0;
|
||||||
for (const auto& v : ls){
|
for (const auto& v : ls) {
|
||||||
if (i == 0) CHECK(v == v1);
|
if (i == 0)
|
||||||
else if (i == 1) CHECK(v == v2);
|
CHECK(v == v1);
|
||||||
|
else if (i == 1)
|
||||||
|
CHECK(v == v2);
|
||||||
i++;
|
i++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue