Data Structures in C - Single Header Library (ds.h)

Welcome to the Data Structures in C project! This repository provides a single-header library, ds.h, that includes implementations for various data structures. Just include this header in your project, and you're ready to use powerful and efficient data structures with ease. Features

The library includes the following data structures:

Hashmaps

A key-value store using chaining to handle hash collisions. Supported Operations:

• insert – Add key-value pairs to the map
• find – Retrieve the value for a given key
• remove – Delete a key-value pair
• print – Display the hashmap contents
• destroy – Clean up memory used by the hashmap

Example:

#include "ds.h"

int main() {
    Hashmap *map = hashmap_create(10);
    if (!map) {
        fprintf(stderr, "Failed to create hashmap\n");
        return 1;
    }

    hashmap_insert(map, "name", "Abena");
    hashmap_insert(map, "age", "24");
    hashmap_insert(map, "city", "Addis Ababa");

    printf("Name: %s\n", (char *)hashmap_get(map, "name"));
    printf("Age: %s\n", (char *)hashmap_get(map, "age"));
    printf("City: %s\n", (char *)hashmap_get(map, "city"));

    hashmap_remove(map, "age");
    printf("Age after removal: %s\n", (char *)hashmap_get(map, "age"));

    hashmap_print(map);

    hashmap_destroy(map);
    return 0;
}

Hybrid Arrays

An automatically resizable array that grows dynamically as elements are added. Supported Operations:

• push_back – Append an element to the array
• get – Access an element at a given index
• print – Display the array contents
• destroy – Free memory allocated to the array

Example: Hybrid Array Usage

#include "ds.h"
#include <stdio.h>

int main() {
    printf("=== Hybrid Array Example ===\n");

    // Initialize a HybridArray
    HybridArray array;
    hybrid_array_init(&array);

    // Add elements to the array
    hybrid_array_push_back(&array, 10);
    hybrid_array_push_back(&array, 20);
    hybrid_array_push_back(&array, 30);

    // Print the array's contents
    printf("Array contents: ");
    hybrid_array_print(&array);

    // Access elements by index
    printf("Element at index 0: %d\n", hybrid_array_get(&array, 0));
    printf("Element at index 1: %d\n", hybrid_array_get(&array, 1));
    printf("Element at index 2: %d\n", hybrid_array_get(&array, 2));

    // Clean up memory
    hybrid_array_destroy(&array);

    return 0;
}

Linked Lists

A singly linked list implementation with convenient operations. Supported Operations:

• insertAtHead – Insert an element at the beginning
• insertAtTail – Insert an element at the end
• deleteNode – Delete a node with a specific value
• search – Find a node by its value
• printList – Display the contents of the list
• freeList – Release memory used by the list

Example: Linked List Usage

#include "linked_list.h"

int main() {
    Node* head = NULL;

    insertAtHead(&head, 10);
    insertAtHead(&head, 20);
    insertAtTail(&head, 30);

    printList(head);

    deleteNode(&head, 20);
    printList(head);

    freeList(head);

    return 0;
}

How to Use

1. Include the Header Download the ds.h file and place it in your project directory. Include it in your source file as follows:

#include "ds.h"

2. Compile Your Code Use a C compiler such as gcc to compile your program. For example:

gcc -o my_program main.c

3. Run the Program Execute the compiled output:

./my_program   # On Linux or macOS
my_program.exe # On Windows

Benefits

Single Header Library: Simple integration – no separate source files needed. Efficient Implementations: Optimized for performance and memory usage. Reusable: Designed for use in various applications without modifications.

License

This project is released under the MIT License. See the LICENSE file for more details. Contributing

We welcome contributions! To improve the library, fix bugs, or add new features:

1. Fork the repository.
2. Create a new branch.
3. Commit your changes.
4. Submit a pull request.

Contact

For questions, suggestions, or feedback, feel free to reach out:

GitHub Issues: Open an issue on this repository.