Skip to content

Releases: eef-g-archive/data-structures-c

Release v1.0.0

07 Mar 17:55
@eef-g eef-g
v1.0.0
88c067f
Compare
Choose a tag to compare
Release v1.0.0 Latest
Latest

Base C Data Structures Library

Release v1.0.0: This is the first release of this library for data structures created in C. It contains the necessary functions for using a doubly-linked list, a stack, and a queue in the C language. To use this library, make sure both the .c and .h files are included in your project. While in production, this project was compiled using the GCC compiler, if you run into any issues with other C compilers, please let the creators know about the compile issues.

v1.0.0

Included in this original release of the library are the following features:

  1. Ability to create Doubly Linked Lists, Stacks, and Queues
  2. Full functionality for the previously mentioned ADTs. Including printing, sorting by value or memory address, ability to mix data types within the ADTs, and also dynamically allocating memory depending on the type of data being added to the ADT.

Further Notes

  1. To create an ADT, you will need to assign the output of the ADT's new() function to a pointer of the corresponding type. By default, the namespace of the pointer variables is {ADT_TYPE}ptr, so for a Linked List, it would be a Listptr.
  • For example, in order to create a new Linked List, you would write the line: Listptr test_list = List_new();
  1. Each ADT has functions corresponding to it and need to be called as follows: {ADT}_{FUNCTION_NAME}({OBJECT_POINTER}, {ARGUMENTS})
  • For example, to print a Linked list that is stored in memory as "test_list", you would use: List_printList(test_list)
  1. As of this release, Documentation is still in progress, but an updated release will be published with completed documentation
Assets 3
Loading