Added forgotten is_empty method

Author: jkalias

include/set.h

@@ -534,6 +534,22 @@ class set
         return set();
     }
 
+    // Returns true if the set is empty
+    //
+    // example:
+    //      const fcpp::set<int> numbers({1, 4, 2});
+    //
+    //      // returns false
+    //      numbers.is_empty();
+    //
+    //      // returns true
+    //      fcpp::set<int>().is_empty();
+    [[nodiscard]] bool is_empty() const
+    {
+        return m_set.empty();
+    }
+    
+    
     // Returns true if the key is present in the set, otherwise false
     //
     // example:
@@ -551,9 +567,6 @@ class set
         return m_set.size();
     }
 
-    // clear
-    // is_empty
-    
     // Returns the begin iterator, useful for other standard library algorithms
     [[nodiscard]] typename std::set<TKey>::iterator begin()
     {

tests/set_test.cc

@@ -510,6 +510,13 @@ TEST(SetTest, Clearing)
     EXPECT_EQ(3, numbers.size());
 }
 
+TEST(SetTest, IsEmpty)
+{
+    const set<int> numbers({1, 4, 2});
+    EXPECT_FALSE(numbers.is_empty());
+    EXPECT_TRUE(set<int>().is_empty());
+}
+
 TEST(SetTest, Contains)
 {
     const set<int> numbers({1, 4, 2});