Index: uspace/lib/cpp/include/impl/stack.hpp
===================================================================
--- uspace/lib/cpp/include/impl/stack.hpp	(revision 45147a4c3eb4fec3241f375e548eccf9756ca0d4)
+++ uspace/lib/cpp/include/impl/stack.hpp	(revision 45147a4c3eb4fec3241f375e548eccf9756ca0d4)
@@ -0,0 +1,201 @@
+/*
+ * Copyright (c) 2017 Jaroslav Jindrak
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * - Redistributions of source code must retain the above copyright
+ *   notice, this list of conditions and the following disclaimer.
+ * - Redistributions in binary form must reproduce the above copyright
+ *   notice, this list of conditions and the following disclaimer in the
+ *   documentation and/or other materials provided with the distribution.
+ * - The name of the author may not be used to endorse or promote products
+ *   derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#ifndef LIBCPP_STACK
+#define LIBCPP_STACK
+
+#include <initializer_list>
+#include <utility>
+#include <vector>
+
+namespace std
+{
+
+    /**
+     * 23.5.6.2, stack:
+     */
+
+    // TODO: the default container should be deque<T>
+    template<class T, class Container = vector<T>>
+    class stack
+    {
+        public:
+            using container_type  = Container;
+            using value_type      = typename container_type::value_type;
+            using reference       = typename constainer_type::reference;
+            using const_reference = typename container_type::const_reference;
+            using size_type       = typename container_type::size_type;
+
+            explicit stack(container_type& cont)
+                : c{cont}
+            { /* DUMMY BODY */ }
+
+            explicit stack(container_type&& cont = container_type{})
+                : c{move(cont)}
+            { /* DUMMY BODY */ }
+
+            /**
+             * TODO: The allocator constructor should use enable_if
+             *       as a last parameter that checks if uses_allocator
+             *       from <memory> holds.
+             */
+            template<class Alloc>
+            explicit stack(Alloc& alloc)
+                : c{alloc}
+            { /* DUMMY BODY */ }
+
+            template<class Alloc>
+            stack(const container_type& cont, const Alloc& alloc)
+                : c{cont, alloc}
+            { /* DUMMY BODY */ }
+
+            template<class Alloc>
+            stack(container_type&& cont, const Alloc& alloc)
+                : c{move(cont), alloc}
+            { /* DUMMY BODY */ }
+
+            template<class Alloc>
+            stack(const stack& other, const Alloc& alloc)
+                : c{other.c, alloc}
+            { /* DUMMY BODY */ }
+
+            template<class Alloc>
+            stack(stack&& other, const Alloc& alloc)
+                : c{move(other.c), alloc}
+            { /* DUMMY BODY */ }
+
+            bool empty()
+            {
+                return c.empty();
+            }
+
+            size_type size()
+            {
+                return c.size();
+            }
+
+            reference top()
+            {
+                return c.back();
+            }
+
+            const_reference top() const
+            {
+                return c.back();
+            }
+
+            void push(const value_type& val)
+            {
+                c.push_back(val);
+            }
+
+            void push(value_type&& val)
+            {
+                c.push_back(move(val));
+            }
+
+            template<class... Args>
+            void emplace(Args&&... args)
+            {
+                c.emplace_back(forward<Args>(args)...);
+            }
+
+            void pop()
+            {
+                c.pop_back();
+            }
+
+            void swap(stack& other)
+                noexcept(noexcept(swap(c, other.c)))
+            {
+                std::swap(c, other.c);
+            }
+
+        protected:
+            container_type c;
+    };
+
+    /**
+     * 23.6.5.5, stack operators:
+     */
+
+    template<class T, class Container>
+    bool operator==(const stack<T, Container>& lhs,
+                    const stack<T, Container>& rhs)
+    {
+        return lhs.c == rhs.c;
+    }
+
+    template<class T, class Container>
+    bool operator!=(const stack<T, Container>& lhs,
+                    const stack<T, Container>& rhs)
+    {
+        return lhs.c != rhs.c;
+    }
+
+    template<class T, class Container>
+    bool operator<(const stack<T, Container>& lhs,
+                   const stack<T, Container>& rhs)
+    {
+        return lhs.c < rhs.c;
+    }
+
+    template<class T, class Container>
+    bool operator<=(const stack<T, Container>& lhs,
+                    const stack<T, Container>& rhs)
+    {
+        return lhs.c <= rhs.c;
+    }
+
+    template<class T, class Container>
+    bool operator>(const stack<T, Container>& lhs,
+                   const stack<T, Container>& rhs)
+    {
+        return lhs.c > rhs.c;
+    }
+
+    template<class T, class Container>
+    bool operator>=(const stack<T, Container>& lhs,
+                    const stack<T, Container>& rhs)
+    {
+        return lhs.c >= rhs.c;
+    }
+
+    /**
+     * 23.6.5.6, stack specialized algorithms:
+     */
+
+    template<class T, class Container>
+    void swap(stack<T, Container>& lhs, stack<T, Container>& rhs)
+        noexcept(noexcept(lhs.swap(rhs)))
+    {
+        lhs.swap(rhs);
+    }
+}
+
+#endif
Index: uspace/lib/cpp/include/stack
===================================================================
--- uspace/lib/cpp/include/stack	(revision 45147a4c3eb4fec3241f375e548eccf9756ca0d4)
+++ uspace/lib/cpp/include/stack	(revision 45147a4c3eb4fec3241f375e548eccf9756ca0d4)
@@ -0,0 +1,29 @@
+/*
+ * Copyright (c) 2017 Jaroslav Jindrak
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * - Redistributions of source code must retain the above copyright
+ *   notice, this list of conditions and the following disclaimer.
+ * - Redistributions in binary form must reproduce the above copyright
+ *   notice, this list of conditions and the following disclaimer in the
+ *   documentation and/or other materials provided with the distribution.
+ * - The name of the author may not be used to endorse or promote products
+ *   derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <impl/stack.hpp>