Merge pull request #9 from ascii-dev/implement_linked_list_based_stack

implement linked list based stack

Author: ascii-dev

c/includes/BUILD.bazel

@@ -1,3 +1,4 @@
 exports_files(["greet.h"])
 exports_files(["vector.h"])
 exports_files(["slinkedlist.h"])
+exports_files(["llstack.h"])

c/includes/llstack.h

@@ -0,0 +1,13 @@
+#ifndef C_LLSTACK_H
+#define C_LLSTACK_H
+#include <stddef.h>
+
+typedef struct LLStack LLStack;
+
+LLStack* llstack_new();
+void llstack_push(LLStack* stack, const void* item);
+void* llstack_pop(LLStack* stack);
+short llstack_empty(LLStack* stack);
+void llstack_free(LLStack* stack);
+
+#endif  // C_LLSTACK_H

c/src/stack/BUILD.bazel

@@ -0,0 +1,10 @@
+load("@rules_cc//cc:defs.bzl", "cc_library")
+
+cc_library(
+    name = "llstack",
+    srcs = ["llstack.c"],
+    hdrs = ["//c/includes:llstack.h", "//c/includes:slinkedlist.h"],
+    strip_include_prefix = "//c",
+    deps = ["//c/src/linkedlist:slinkedlist"],
+    visibility = ["//visibility:public"],
+)

c/src/stack/llstack.c

@@ -0,0 +1,28 @@
+#include "includes/llstack.h"
+
+#include <stdlib.h>
+
+#include "includes/slinkedlist.h"
+
+struct LLStack {
+  SLinkedList* list;
+};
+
+LLStack* llstack_new() {
+  LLStack* stack = malloc(sizeof(LLStack));
+  if (stack == NULL) return NULL;
+
+  stack->list = slinkedlist_new();
+  return stack;
+}
+
+void llstack_push(LLStack* stack, const void* item) { slinkedlist_push_front(stack->list, item); }
+
+void* llstack_pop(LLStack* stack) { return slinkedlist_pop_front(stack->list); }
+
+short llstack_empty(LLStack* stack) { return slinkedlist_empty(stack->list); }
+
+void llstack_free(LLStack* stack) {
+  slinkedlist_free(stack->list);
+  free(stack);
+}

c/tests/BUILD.bazel

@@ -26,3 +26,12 @@ cc_test(
         "@googletest//:gtest_main",
     ],
 )
+
+cc_test(
+    name = "llstack_test",
+    srcs = ["llstack_test.cc"],
+    deps = [
+        "//c/src/stack:llstack",
+        "@googletest//:gtest_main",
+    ],
+)

c/tests/llstack_test.cc

@@ -0,0 +1,34 @@
+#include "gtest/gtest.h"
+
+extern "C" {
+#include "includes/llstack.h"
+}
+
+TEST(LLStackTest, NewLLStack) {
+  LLStack* stack = llstack_new();
+  ASSERT_NE(stack, nullptr);
+  ASSERT_EQ(llstack_empty(stack), 1);
+  llstack_free(stack);
+}
+
+TEST(LLStackTest, PushAndPop) {
+  LLStack* stack = llstack_new();
+  ASSERT_NE(stack, nullptr);
+  ASSERT_EQ(llstack_empty(stack), 1);
+  int item1 = 10;
+  int item2 = 20;
+  int item3 = 30;
+  llstack_push(stack, &item1);
+  llstack_push(stack, &item2);
+  llstack_push(stack, &item3);
+
+  ASSERT_EQ(llstack_empty(stack), 0);
+  ASSERT_EQ(llstack_pop(stack), &item3);
+  ASSERT_EQ(llstack_empty(stack), 0);
+  ASSERT_EQ(llstack_pop(stack), &item2);
+  ASSERT_EQ(llstack_empty(stack), 0);
+  ASSERT_EQ(llstack_pop(stack), &item1);
+  ASSERT_EQ(llstack_empty(stack), 1);
+
+  llstack_free(stack);
+}