deploy: 8d1505d

index.html

@@ -50,7 +50,7 @@
         <h1>
           CContainer
         </h1>
-<p><a name="md_README"></a></p><img class="m-image" src="https://raw.githubusercontent.com/lvntky/ccontainer/master/docs/cc_logo.png" alt="Image" /><p><a href="https://app.codacy.com/gh/lvntky/ccontainer/dashboard?utm_source=gh&amp;utm_medium=referral&amp;utm_content=&amp;utm_campaign=Badge_grade"><img class="m-image" src="https://app.codacy.com/project/badge/Grade/b38128bf0876489a91f2a8c420866aca" alt="Image" /></a></p><img class="m-image" src="https://img.shields.io/codecov/c/gh/lvntky/ccontainer" alt="Image" /><img class="m-image" src="https://img.shields.io/github/check-runs/lvntky/ccontainer/master" alt="Image" /><p>CContainer is a comprehensive STB style header-only library of data structures implemented in C. This library provides a variety of container types that are essential for managing collections of data in C programs. Each container is designed to be efficient, easy to use, and flexible, making CContainer a valuable tool for C developers.</p><section id="autotoc_md1"><h2><a href="#autotoc_md1">Features</a></h2><ul><li>Dynamic Array (Vector)<ul><li>Dynamic resizing</li><li>Random access</li><li>Efficient indexing</li><li>Functions: Initialization, Insertion, Deletion, Access, Resizing, Cleanup-</li></ul></li><li>Linked List<ul><li>Dynamic size</li><li>Efficient insertions/deletions at both ends</li><li>Sequential access</li><li>Functions: Initialization, Insertion, Deletion, Access, Cleanup-</li></ul></li><li>Doubly Linked List<ul><li>Dynamic size</li><li>Efficient insertions/deletions at both ends</li><li>Bidirectional sequential access</li><li>Functions: Initialization, Insertion, Deletion, Access, Cleanup-</li></ul></li><li>Stack<ul><li>LIFO (Last In, First Out) access</li><li>Functions: Initialization, Push, Pop, Peek, Cleanup-</li></ul></li><li>Queue<ul><li>FIFO (First In, First Out) access</li><li>Functions: Initialization, Enqueue, Dequeue, Peek, Cleanup-</li></ul></li><li>Hash Map<ul><li>Key-value pair storage</li><li>Efficient lookups, insertions, and deletions</li><li>Functions: Initialization, Insert, Remove, Get, Cleanup-</li></ul></li><li>Set<ul><li>Unique element storage</li><li>Efficient membership testing, insertion, and deletion</li><li>Functions: Initialization, Insert, Remove, Contains, Cleanup-</li></ul></li><li>Binary Search Tree (BST)<ul><li>Ordered elements</li><li>Efficient insertions, deletions, and lookups</li><li>Functions: Initialization, Insertion, Deletion, Search, Traversal, Cleanup-</li></ul></li><li>Red-Black Tree<ul><li>Self-balancing BST</li><li>Ensures balanced height for efficient operations</li><li>Functions: Initialization, Insertion, Deletion, Search, Traversal, Cleanup-</li></ul></li><li>Heap (Priority Queue)<ul><li>Efficient retrieval of the maximum or minimum element</li><li>Supports both max-heap and min-heap configurations</li><li>Functions: Initialization, Insertion, Deletion, Peek, Cleanup-</li></ul></li><li>Graph<ul><li>Nodes and edges</li><li>Supports directed and undirected graphs</li><li>Functions: Initialization, Add node, Add edge, Remove node, Remove edge, Traversal, Cleanup-</li></ul></li><li>Trie (Prefix Tree)<ul><li>Efficient prefix-based search</li><li>Useful for implementing dictionaries and autocomplete</li><li>Functions: Initialization, Insertion, Deletion, Search, Cleanup-</li></ul></li><li>Bloom Filter<ul><li>Probabilistic data structure for set membership testing</li><li>Space-efficient</li><li>Functions: Initialization, Add, Query, Cleanup-</li></ul></li><li>B-Tree<ul><li>Balanced tree for efficient disk storage operations</li><li>Used in databases and filesystems</li><li>Functions: Initialization, Insertion, Deletion, Search, Traversal, Cleanup-</li></ul></li></ul></section><section id="autotoc_md2"><h2><a href="#autotoc_md2">Building and installing</a></h2><p>See the BUILDING document.</p></section><section id="autotoc_md3"><h2><a href="#autotoc_md3">Contributing</a></h2><p>See the CONTRIBUTING document.</p></section><section id="autotoc_md4"><h2><a href="#autotoc_md4">Development Status</a></h2><p>You can check and inform development and implementation status of containers from DEVELOPMENT document.</p></section><section id="autotoc_md5"><h2><a href="#autotoc_md5">Licensing</a></h2><p>This software is available under 2 [licenses](LICENSE) &ndash; choose whichever you prefer.</p></section>
+<p><a name="md_README"></a></p><img class="m-image" src="https://raw.githubusercontent.com/lvntky/ccontainer/master/docs/cc_logo.png" alt="Image" /><p><a href="https://app.codacy.com/gh/lvntky/ccontainer/dashboard?utm_source=gh&amp;utm_medium=referral&amp;utm_content=&amp;utm_campaign=Badge_grade"><img class="m-image" src="https://app.codacy.com/project/badge/Grade/b38128bf0876489a91f2a8c420866aca" alt="Image" /></a></p><img class="m-image" src="https://img.shields.io/codecov/c/gh/lvntky/ccontainer" alt="Image" /><img class="m-image" src="https://img.shields.io/github/check-runs/lvntky/ccontainer/master" alt="Image" /><p>CContainer is a comprehensive STB style header-only library of data structures implemented in C. This library provides a variety of container types that are essential for managing collections of data in C programs. Each container is designed to be efficient, easy to use, and flexible, making CContainer a valuable tool for C developers.</p><section id="autotoc_md1"><h2><a href="#autotoc_md1">Features</a></h2><ul><li>Dynamic Array (Vector)<ul><li>Dynamic resizing</li><li>Random access</li><li>Efficient indexing</li><li>Functions: Initialization, Insertion, Deletion, Access, Resizing, Cleanup-</li></ul></li><li>Linked List<ul><li>Dynamic size</li><li>Efficient insertions/deletions at both ends</li><li>Sequential access</li><li>Functions: Initialization, Insertion, Deletion, Access, Cleanup-</li></ul></li><li>Doubly Linked List<ul><li>Dynamic size</li><li>Efficient insertions/deletions at both ends</li><li>Bidirectional sequential access</li><li>Functions: Initialization, Insertion, Deletion, Access, Cleanup-</li></ul></li><li>Stack<ul><li>LIFO (Last In, First Out) access</li><li>Functions: Initialization, Push, Pop, Peek, Cleanup-</li></ul></li><li>Queue<ul><li>FIFO (First In, First Out) access</li><li>Functions: Initialization, Enqueue, Dequeue, Peek, Cleanup-</li></ul></li><li>Hash Map<ul><li>Key-value pair storage</li><li>Efficient lookups, insertions, and deletions</li><li>Functions: Initialization, Insert, Remove, Get, Cleanup-</li></ul></li><li>Set<ul><li>Unique element storage</li><li>Efficient membership testing, insertion, and deletion</li><li>Functions: Initialization, Insert, Remove, Contains, Cleanup-</li></ul></li><li>Binary Search Tree (BST)<ul><li>Ordered elements</li><li>Efficient insertions, deletions, and lookups</li><li>Functions: Initialization, Insertion, Deletion, Search, Traversal, Cleanup-</li></ul></li><li>Red-Black Tree<ul><li>Self-balancing BST</li><li>Ensures balanced height for efficient operations</li><li>Functions: Initialization, Insertion, Deletion, Search, Traversal, Cleanup-</li></ul></li><li>Heap (Priority Queue)<ul><li>Efficient retrieval of the maximum or minimum element</li><li>Supports both max-heap and min-heap configurations</li><li>Functions: Initialization, Insertion, Deletion, Peek, Cleanup-</li></ul></li><li>Graph<ul><li>Nodes and edges</li><li>Supports directed and undirected graphs</li><li>Functions: Initialization, Add node, Add edge, Remove node, Remove edge, Traversal, Cleanup-</li></ul></li><li>Trie (Prefix Tree)<ul><li>Efficient prefix-based search</li><li>Useful for implementing dictionaries and autocomplete</li><li>Functions: Initialization, Insertion, Deletion, Search, Cleanup-</li></ul></li><li>Bloom Filter<ul><li>Probabilistic data structure for set membership testing</li><li>Space-efficient</li><li>Functions: Initialization, Add, Query, Cleanup-</li></ul></li><li>B-Tree<ul><li>Balanced tree for efficient disk storage operations</li><li>Used in databases and filesystems</li><li>Functions: Initialization, Insertion, Deletion, Search, Traversal, Cleanup-</li></ul></li></ul></section><section id="autotoc_md2"><h2><a href="#autotoc_md2">Building and installing</a></h2><p>See the BUILDING document.</p></section><section id="autotoc_md3"><h2><a href="#autotoc_md3">Contributing</a></h2><p>See the CONTRIBUTING document.</p></section><section id="autotoc_md4"><h2><a href="#autotoc_md4">Development Status</a></h2><p>You can check and inform development and implementation status of containers from DEVELOPMENT document.</p></section><section id="autotoc_md5"><h2><a href="#autotoc_md5">Unit Test Coverage Graph Per File</a></h2><img class="m-image" src="https://codecov.io/gh/lvntky/ccontainer/graphs/tree.svg?token=0aUe4T51Su" alt="Image" /></section><section id="autotoc_md6"><h2><a href="#autotoc_md6">Licensing</a></h2><p>This software is available under 2 [licenses](LICENSE) &ndash; choose whichever you prefer.</p></section>
       </div>
     </div>
   </div>