Index: uspace/lib/cpp/src/internal/test/adaptors.cpp
===================================================================
--- uspace/lib/cpp/src/internal/test/adaptors.cpp	(revision 9ab40261c0ea59e9be198f9c17934880512711a1)
+++ uspace/lib/cpp/src/internal/test/adaptors.cpp	(revision 58ff67361d7e02ef95aa3a0c734e33056318b72e)
@@ -153,5 +153,5 @@
 
         test_eq(
-            "priority_queue initialized from iterator range operations",
+            "priority_queue initialized from iterator range ops",
             check1.begin(), check1.end(),
             aux::priority_queue_iterator<int>{q1},
@@ -166,9 +166,9 @@
 
         q2.push(3);
-        test_eq("priority_qeueu push pt1", q2.size(), 6U);
-        test_eq("priority_qeueu push pt2", q2.top(), 1);
+        test_eq("priority_queue push pt1", q2.size(), 6U);
+        test_eq("priority_queue push pt2", q2.top(), 1);
 
         test_eq(
-            "priority_queue initialized from vector and compare operations",
+            "priority_queue initialized from vector and compare ops",
             check2.begin(), check2.end(),
             aux::priority_queue_iterator<int, std::greater<int>>{q2},
@@ -179,4 +179,17 @@
     void adaptors_test::test_stack()
     {
+        std::stack<int> s{std::deque<int>{1}};
+
+        test_eq("stack initialized from deque top", s.top(), 1);
+        test_eq("stack initialized from deque size", s.size(), 1U);
+        test_eq("stack initialized from deque not empty", s.empty(), false);
+
+        s.push(2);
+        test_eq("stack push top", s.top(), 2);
+        test_eq("stack push size", s.size(), 2U);
+
+        s.pop();
+        test_eq("stack pop top", s.top(), 1);
+        test_eq("stack pop size", s.size(), 1U);
     }
 }