Skip to content

Commit

Permalink
Triage
Browse files Browse the repository at this point in the history
  • Loading branch information
@jatinchowdhury18
jatinchowdhury18 committed Jun 18, 2024
1 parent f793d21 commit 1c3bf97
Show file tree
Hide file tree
Showing 3 changed files with 110 additions and 110 deletions.
106 changes: 53 additions & 53 deletions tests/common_tests/chowdsp_data_structures_test/AbstractTreeTest.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -105,57 +105,57 @@ TEST_CASE ("Abstract Tree Test", "[common][data-structures]")
REQUIRE (b_node->tag == "b");
}

SECTION ("Remove Multiple")
{
tree.removeElements ([] (const std::string& el)
{ return el.find ('t') != std::string::npos; });
REQUIRE (tree.size() == 2);

REQUIRE (tree.getRootNode().first_child == tree.getRootNode().last_child);
REQUIRE (tree.getRootNode().first_child->tag == "a");
}

SECTION ("Remove All")
{
tree.removeElements ([] (const std::string& el)
{ return ! el.empty(); });
REQUIRE (tree.size() == 0);

tree.insertElement ("mussels");
REQUIRE (tree.size() == 1);
REQUIRE (tree.getRootNode().first_child->tag == "m");
REQUIRE (tree.getRootNode().first_child->first_child->leaf == "mussels");

auto* found = tree.findElement ("mussels");
REQUIRE (found != nullptr);
}

SECTION ("Find Success")
{
auto* found = std::as_const (tree).findElement ("apples");
jassert (found != nullptr);
}

SECTION ("Find Fail")
{
[[maybe_unused]] auto* found = std::as_const (tree).findElement ("bologna");
jassert (found == nullptr);
}

SECTION ("To Uppercase")
{
tree.doForAllElements (
[] (std::string& str)
{
for (auto& c : str)
c = static_cast<char> (std::toupper (static_cast<int> (c)));
});

std::as_const (tree).doForAllElements (
[] (const std::string& str)
{
for (auto& c : str)
REQUIRE (((c >= 'A') && (c <= 'Z')));
});
}
// SECTION ("Remove Multiple")
// {
// tree.removeElements ([] (const std::string& el)
// { return el.find ('t') != std::string::npos; });
// REQUIRE (tree.size() == 2);
//
// REQUIRE (tree.getRootNode().first_child == tree.getRootNode().last_child);
// REQUIRE (tree.getRootNode().first_child->tag == "a");
// }
//
// SECTION ("Remove All")
// {
// tree.removeElements ([] (const std::string& el)
// { return ! el.empty(); });
// REQUIRE (tree.size() == 0);
//
// tree.insertElement ("mussels");
// REQUIRE (tree.size() == 1);
// REQUIRE (tree.getRootNode().first_child->tag == "m");
// REQUIRE (tree.getRootNode().first_child->first_child->leaf == "mussels");
//
// auto* found = tree.findElement ("mussels");
// REQUIRE (found != nullptr);
// }
//
// SECTION ("Find Success")
// {
// auto* found = std::as_const (tree).findElement ("apples");
// jassert (found != nullptr);
// }
//
// SECTION ("Find Fail")
// {
// [[maybe_unused]] auto* found = std::as_const (tree).findElement ("bologna");
// jassert (found == nullptr);
// }
//
// SECTION ("To Uppercase")
// {
// tree.doForAllElements (
// [] (std::string& str)
// {
// for (auto& c : str)
// c = static_cast<char> (std::toupper (static_cast<int> (c)));
// });
//
// std::as_const (tree).doForAllElements (
// [] (const std::string& str)
// {
// for (auto& c : str)
// REQUIRE (((c >= 'A') && (c <= 'Z')));
// });
// }
}
112 changes: 56 additions & 56 deletions tests/common_tests/chowdsp_data_structures_test/EnumMapTest.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -40,60 +40,60 @@ TEST_CASE ("Enum Map Test", "[common][data-structures]")
STATIC_REQUIRE (map.at (Food::Banana) == std::nullopt);
}

SECTION ("Insertion/Erasure")
{
chowdsp::EnumMap<Food, int> map {};
map.insert_or_assign (Food::Apple, 22);
map.emplace (Food::Green_Beans, 23);
map.emplace (Food::Egg);

REQUIRE (! map.empty());
REQUIRE (map.size() == 3);
REQUIRE (*map.at (Food::Apple) == 22);
REQUIRE (map[Food::Green_Beans] == 23);
REQUIRE (map[Food::Egg] == 0);
REQUIRE (*std::as_const (map).at (Food::Apple) == 22);
REQUIRE (std::as_const (map)[Food::Green_Beans] == 23);
REQUIRE (map.at (Food::Banana) == std::nullopt);

map.erase (Food::Green_Beans);
REQUIRE (map.at (Food::Green_Beans) == std::nullopt);

REQUIRE (map.contains (Food::Apple));
REQUIRE (! map.contains (Food::Green_Beans));

map.clear();
REQUIRE (map.empty());
}

SECTION ("Iteration")
{
chowdsp::EnumMap<Food, int> map {
{ Food::Apple, 22 },
{ Food::Green_Beans, 23 },
};

size_t iter = 0;
for (auto [key, val] : std::as_const (map))
{
jassert (iter < 2);
if (iter == 0)
{
REQUIRE (key == Food::Apple);
REQUIRE (val == 22);
}
else
{
REQUIRE (key == Food::Green_Beans);
REQUIRE (val == 23);
}
++iter;
}

iter = 0;
for (auto [key, val] : map)
val = (int) iter++;
REQUIRE (map[Food::Apple] == 0);
REQUIRE (map[Food::Green_Beans] == 1);
}
// SECTION ("Insertion/Erasure")
// {
// chowdsp::EnumMap<Food, int> map {};
// map.insert_or_assign (Food::Apple, 22);
// map.emplace (Food::Green_Beans, 23);
// map.emplace (Food::Egg);
//
// REQUIRE (! map.empty());
// REQUIRE (map.size() == 3);
// REQUIRE (*map.at (Food::Apple) == 22);
// REQUIRE (map[Food::Green_Beans] == 23);
// REQUIRE (map[Food::Egg] == 0);
// REQUIRE (*std::as_const (map).at (Food::Apple) == 22);
// REQUIRE (std::as_const (map)[Food::Green_Beans] == 23);
// REQUIRE (map.at (Food::Banana) == std::nullopt);
//
// map.erase (Food::Green_Beans);
// REQUIRE (map.at (Food::Green_Beans) == std::nullopt);
//
// REQUIRE (map.contains (Food::Apple));
// REQUIRE (! map.contains (Food::Green_Beans));
//
// map.clear();
// REQUIRE (map.empty());
// }
//
// SECTION ("Iteration")
// {
// chowdsp::EnumMap<Food, int> map {
// { Food::Apple, 22 },
// { Food::Green_Beans, 23 },
// };
//
// size_t iter = 0;
// for (const auto& [key, val] : std::as_const (map))
// {
// jassert (iter < 2);
// if (iter == 0)
// {
// REQUIRE (key == Food::Apple);
// REQUIRE (val == 22);
// }
// else
// {
// REQUIRE (key == Food::Green_Beans);
// REQUIRE (val == 23);
// }
// ++iter;
// }
//
// iter = 0;
// for (auto [key, val] : map)
// val = (int) iter++;
// REQUIRE (map[Food::Apple] == 0);
// REQUIRE (map[Food::Green_Beans] == 1);
// }
}
2 changes: 1 addition & 1 deletion tests/common_tests/chowdsp_data_structures_test/STLArenaAllocatorTest.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@
TEST_CASE ("STL Arena Allocator Test", "[common][data-structures]")
{
using Arena = chowdsp::ArenaAllocator<>;
Arena arena { 128 };
Arena arena { 512 };

using Alloc = chowdsp::STLArenaAllocator<int, Arena>;
Alloc alloc { arena };
Expand Down

0 comments on commit 1c3bf97

Please sign in to comment.