测试

Author: masx200

design-linked-list/test.cpp

@@ -14,19 +14,18 @@ using namespace std;
 using std::vector;
 
 #ifdef __TEST__
-struct ListNodeInspector
-{
-    unordered_set<DLinkListNode *> nodes;
-    eventpp::CallbackList<void(DLinkListNode *)>::Handle handleNew;
-    eventpp::CallbackList<void(DLinkListNode *)>::Handle handleDelete;
+struct ListNodeInspector {
+    unordered_set<DLinkListNode*> nodes;
+    eventpp::CallbackList<void(DLinkListNode*)>::Handle handleNew;
+    eventpp::CallbackList<void(DLinkListNode*)>::Handle handleDelete;
     ListNodeInspector()
     {
-        auto handleNew = DLinkListNode::CallbackNew.append([this](auto *node) {
+        auto handleNew = DLinkListNode::CallbackNew.append([this](auto* node) {
             std::cout << "DLinkListNode New:" << node << std::endl;
             nodes.insert(node);
         });
         this->handleNew = handleNew;
-        auto handleDelete = DLinkListNode::CallbackDelete.append([this](auto *node) {
+        auto handleDelete = DLinkListNode::CallbackDelete.append([this](auto* node) {
             std::cout << "DLinkListNode Delete:" << node << std::endl;
 
             nodes.erase(node);
@@ -46,58 +45,48 @@ TEST(design_linked_list, test1)
     ListNodeInspector inspector;
 #endif
 
-
-    MyLinkedList *myLinkedList1 = new MyLinkedList();
+    MyLinkedList* myLinkedList1 = new MyLinkedList();
     myLinkedList1->addAtHead(1);
     myLinkedList1->addAtTail(3);
     myLinkedList1->addAtIndex(1, 2); // 链表变为 1->2->3
-  ASSERT_EQ(2,  myLinkedList1->get(1));                   
-    myLinkedList1->deleteAtIndex(1);    // 现在，链表 ->3
-  ASSERT_EQ(3,   myLinkedList1->get(1));              // 返回 3
- //haha
-            delete myLinkedList1;
-
-
-
-
-    //haha
+    ASSERT_EQ(2, myLinkedList1->get(1));
+    myLinkedList1->deleteAtIndex(1); // 现在，链表 ->3
+    ASSERT_EQ(3, myLinkedList1->get(1)); // 返回 3
+    // haha
+    delete myLinkedList1;
 
+    // haha
 
 #ifdef __TEST__
 
-
     ASSERT_EQ
 
-(size_t(0), inspector.nodes.size());
+        (size_t(0), inspector.nodes.size());
 #endif
 }
 TEST(design_linked_list, test2)
 {
 #ifdef __TEST__
     ListNodeInspector inspector;
 #endif
-   
 
-    MyLinkedList *myLinkedList1 = new MyLinkedList();
+    MyLinkedList* myLinkedList1 = new MyLinkedList();
     myLinkedList1->addAtHead(1);
     myLinkedList1->addAtTail(3);
     myLinkedList1->addAtIndex(1, 2); // 链表变为 1->2->3
-      ASSERT_EQ(1,  myLinkedList1->get(0));  
-  ASSERT_EQ(2,  myLinkedList1->get(1));                   
-    //myLinkedList1->deleteAtIndex(1);    // 现在，链表 ->3
-  ASSERT_EQ(3,   myLinkedList1->get(2));              // 返回 3
- //haha
-            delete myLinkedList1;
-
-
-
+    ASSERT_EQ(1, myLinkedList1->get(0));
+    ASSERT_EQ(2, myLinkedList1->get(1));
+    // myLinkedList1->deleteAtIndex(1);    // 现在，链表 ->3
+    ASSERT_EQ(3, myLinkedList1->get(2)); // 返回 3
+    // haha
+    delete myLinkedList1;
 
-    //haha
+    // haha
 
 #ifdef __TEST__
     ASSERT_EQ
 
-(size_t(0), inspector.nodes.size());
+        (size_t(0), inspector.nodes.size());
 #endif
 }
 

design-linked-list/xmake.lua

@@ -1,11 +1,16 @@
 if is_mode("test") then add_requires("vcpkg::eventpp") end
 add_rules("mode.debug", "mode.release")
 set_languages('cxx20')
+add_requires("vcpkg::gtest") 
 target("design-linked-list")
 set_kind("static")
 
 
 add_files("*.ixx", {install = true})
+if is_mode("test") then
+    add_defines("__TEST__")
+    add_packages("vcpkg::eventpp")
+end
 target_end()
 target("design-linked-list-test");
 set_group('test')

split-a-circular-linked-list/test.cpp

@@ -17,31 +17,28 @@ using namespace leetcode_test::split_a_circular_linked_list;
 using namespace std;
 using std::vector;
 template <class T>
-concept sizable = requires(T& t)
-{
+concept sizable = requires(T& t) {
     {
         t.size()
-        } -> std::same_as<size_t>;
+    } -> std::same_as<size_t>;
 };
 template <class T>
-concept iterable = requires(T& t)
-{
+concept iterable = requires(T& t) {
     ++t.begin();
     {
         t.begin() != t.end()
 
-        } -> std::same_as<bool>;
+    } -> std::same_as<bool>;
 };
 
 template <class T, typename Y>
-concept equalable = requires(T& t, Y& y, size_t i)
-{
+concept equalable = requires(T& t, Y& y, size_t i) {
     {
         *t.begin() == *y.begin()
-        } -> std::same_as<bool>;
+    } -> std::same_as<bool>;
 };
 template <typename T, typename Y>
-requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
+    requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
 auto assertContentEquals(T& left, Y& right)
 {