From 05044451835eb6109ad42a05e6989a63da882680 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Wed, 21 Dec 2022 14:58:14 +0000 Subject: [PATCH] Documentation for 3be7198f03398edc3b7fdeb0081c8ab18a2a0f75 --- ...md_data_structures_stack__r_e_a_d_m_e.html | 4 +- d5/d88/md__d_i_r_e_c_t_o_r_y.html | 36 ++++----- d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html | 2 +- d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html | 52 ++++++++++-- d7/db5/md_exercism__r_e_a_d_m_e.html | 2 +- ...md_data_structures_array__r_e_a_d_m_e.html | 6 +- da/d6c/exponential__search_8c.html | 4 +- ...ta_structures_dictionary__r_e_a_d_m_e.html | 2 +- df/d58/md_leetcode__r_e_a_d_m_e.html | 8 +- index.html | 8 +- navtreedata.js | 80 ++++++++++--------- navtreeindex1.js | 52 ++++++------ navtreeindex2.js | 10 +-- navtreeindex3.js | 14 ++-- navtreeindex4.js | 9 ++- 15 files changed, 164 insertions(+), 125 deletions(-) diff --git a/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html b/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html index aebf2347..80b9c5f2 100644 --- a/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html +++ b/d1/d12/md_data_structures_stack__r_e_a_d_m_e.html @@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d1/d12/md_data_structures_stack__r_e_a

This is a modular generic stack data-structure. The stack is self growing.

-

+

Content

You need to only import the stack.h

-

+

Public interface

void initStack();

Initializes the stack with a capacity of 10 elements.

diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html index f4ed640c..c5c8951b 100644 --- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
-

+

Client Server

-

+

Conversions

-

+

Data Structures

-

+

LeetCode Algorithm

diff --git a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html index a9328033..3978877f 100644 --- a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html +++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html @@ -237,7 +237,7 @@ my_new_c_struct.c is correct format @subsubsection autotoc_md29 Directory guidelines - We recommend adding files to existing directories as much as possible. -- Use lowercase words with <tt>"_"</tt> as separator ( no spaces or <tt>"-"</tt> allowed ) +- Use lowercase words with <tt>"_"</tt> as a separator ( no spaces or <tt>"-"</tt> allowed ) - For instance @icode{markdown} @@ -248,9 +248,45 @@ some_new_fancy_category is correct - Filepaths will be used to dynamically create a directory of our algorithms. - Filepath validation will run on GitHub Actions to ensure compliance. -@subsubsection autotoc_md30 Commit Guidelines +@paragraph autotoc_md30 Integrating CMake in a new directory -- It is recommended to keep your changes grouped logically within individual commits. Maintainers find it easier to understand changes that are logically spilt across multiple commits. Try to modify just one or two files in the same directory. Pull requests that span multiple directories are often rejected. +In case a new directory is 100% required, <tt>CMakeLists.txt</tt> file in the root directory needs to be updated, and a new <tt>CMakeLists.txt</tt> file needs to be created within the new directory. + +An example of how your new <tt>CMakeLists.txt</tt> file should look like. Note that if there are any extra libraries/setup required, you must include that in this file as well. + +@icode{cmake} +# If necessary, use the RELATIVE flag, otherwise each source file may be listed +# with full pathname. The RELATIVE flag makes it easier to extract an executable's name +# automatically. + +file( GLOB APP_SOURCES RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} *.c ) +foreach( testsourcefile ${APP_SOURCES} ) + string( REPLACE ".c" "" testname ${testsourcefile} ) # File type. Example: `.c`, `.h` + add_executable( ${testname} ${testsourcefile} ) + + if(OpenMP_C_FOUND) + target_link_libraries(${testname} OpenMP::OpenMP_C) + endif() + if(MATH_LIBRARY) + target_link_libraries(${testname} ${MATH_LIBRARY}) + endif() + install(TARGETS ${testname} DESTINATION "bin/<foldername>") # Folder name + +endforeach( testsourcefile ${APP_SOURCES} ) +@endicode + +The <tt>CMakeLists.txt</tt> file in the root directory should be updated to include the new directory.\ +Include your new directory after the last subdirectory. Example: + +@icode{cmake} +... +add_subdirectory(divide_and_conquer) +add_subdirectory(<foldername>) +@endicode + +@subsubsection autotoc_md31 Commit Guidelines + +- It is recommended to keep your changes grouped logically within individual commits. Maintainers find it easier to understand changes that are logically spilled across multiple commits. Try to modify just one or two files in the same directory. Pull requests that span multiple directories are often rejected. @icode{bash} git add file_xyz.c @@ -275,11 +311,11 @@ Common prefixes: - test: Correct existing tests or add new ones - chore: Miscellaneous changes that do not match any of the above. -@subsection autotoc_md31 Pull Requests +@subsection autotoc_md32 Pull Requests - Checkout our <a href="https://github.com/TheAlgorithms/C/blob/master/.github/pull_request_template.md" target="_blank" >pull request template</a> -@subsubsection autotoc_md32 Building Locally +@subsubsection autotoc_md33 Building Locally Before submitting a pull request, build the code locally or using the convenient <a href="https://gitpod.io/#https://github.com/TheAlgorithms/C" target="_blank" ><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code"/></a> service. @@ -287,7 +323,7 @@ Before submitting a pull request, build the code locally or using the convenient cmake -B build -S . @endicode -@subsubsection autotoc_md33 Static Code Analyzer +@subsubsection autotoc_md34 Static Code Analyzer We use <a href="https://clang.llvm.org/extra/clang-tidy/" target="_blank" ><tt>clang-tidy</tt></a> as a static code analyzer with a configuration in <a href=".clang-tidy" target="_blank" ><tt>.clang-tidy</tt></a>. @@ -295,7 +331,7 @@ We use <a href="https://cl clang-tidy --fix --quiet -p build subfolder/file_to_check.c -- @endicode -@subsubsection autotoc_md34 Code Formatter +@subsubsection autotoc_md35 Code Formatter <a href="https://clang.llvm.org/docs/ClangFormat.html" target="_blank" >**<tt>clang-format</tt>**</a> is used for code formatting. @@ -306,7 +342,7 @@ clang-tidy --fix --quiet -p build subfolder/file_to_check.c -- - Linux (Debian): <tt>sudo apt-get install clang-format-10 clang-tidy-10</tt> - Running (all platforms): <tt>clang-format -i -style="file" my_file.c</tt> -@subsubsection autotoc_md35 GitHub Actions +@subsubsection autotoc_md36 GitHub Actions - Enable GitHub Actions on your fork of the repository. After enabling, it will execute <tt>clang-tidy</tt> and <tt>clang-format</tt> after every push (not a commit). diff --git a/d7/db5/md_exercism__r_e_a_d_m_e.html b/d7/db5/md_exercism__r_e_a_d_m_e.html index 3f90ed4a..ae23e899 100644 --- a/d7/db5/md_exercism__r_e_a_d_m_e.html +++ b/d7/db5/md_exercism__r_e_a_d_m_e.html @@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('d7/db5/md_exercism__r_e_a_d_m_e.html',

This directory contains some sample solutions for exercism.io

-

+

Overview

In this directory you will find (in the right order):

  • hello-world
  • diff --git a/d9/d41/md_data_structures_array__r_e_a_d_m_e.html b/d9/d41/md_data_structures_array__r_e_a_d_m_e.html index 5560fa90..250db802 100644 --- a/d9/d41/md_data_structures_array__r_e_a_d_m_e.html +++ b/d9/d41/md_data_structures_array__r_e_a_d_m_e.html @@ -101,17 +101,17 @@ $(document).ready(function(){initNavTree('d9/d41/md_data_structures_array__r_e_a

Simple array of integers. With I/O functions, Sort Functions and Search Functions.

-

+

Sort Function

The Sort function sorts the elements in the range in a particular order. The different types of sorting methods are Bubble Sort, Selection Sort, Merge Sort and Quick Sort. Bubble Sort repeatedly sorts the adjacent elements if they are in wrong order.

-

+

Structure

typedef struct CArray {
int *array;
int size;
} CArray;
Definition: carray.h:32
-

+

Files

  • CArray.c - Array Implementations
  • diff --git a/da/d6c/exponential__search_8c.html b/da/d6c/exponential__search_8c.html index ca290136..d151fe8a 100644 --- a/da/d6c/exponential__search_8c.html +++ b/da/d6c/exponential__search_8c.html @@ -183,7 +183,7 @@ Functions

Function: binary_search.

algorithm that search the index of the given item

recursive function that search the given element in

-

+

the array using the <a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Search%20Algorithms/Binary%20Search.md" target="_blank" >Binary Search</a>

Parameters
@@ -253,7 +253,7 @@ Here is the call graph for this function:

Function: exponential_search.

algorithm that search the index of the given item

recursive function that take an array and quickly find the range

-

+

where to apply the binary search algorithm to find the given element

Parameters
diff --git a/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html b/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html index c72b78cb..3f9fc57f 100644 --- a/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html +++ b/de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html @@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('de/d20/md_data_structures_dictionary__

This is simple and generic dictionary. You can instantiate multiple dictionaries with the constructor. See interface below.

Each dictionary has space for 1000 elements.

You need add the files dic.c and dic.h in your project directory. After that you include dic.h

-

+

Overview about functions

Dictionary * create_dict(void);

create_dict: is a simple constructor for creating a dictionary and setting up the member field 'number_of_elements' and prepares the inner array 'elements'

diff --git a/df/d58/md_leetcode__r_e_a_d_m_e.html b/df/d58/md_leetcode__r_e_a_d_m_e.html index 72c2a0b2..b21b7c88 100644 --- a/df/d58/md_leetcode__r_e_a_d_m_e.html +++ b/df/d58/md_leetcode__r_e_a_d_m_e.html @@ -101,13 +101,13 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',

We're glad you're interested in adding C LeetCode solutions to the repository.\ Here we'll be explaining how to contribute to LeetCode solutions properly.

-

+

💻 Cloning/setting up the project 💻

First off, you'll need to fork the repository here.\ Then, you'll need to clone the repository to your local machine.

git clone https://github.com/your-username/C.git

After that, you'll need to create a new branch for your solution.

git checkout -b solution/your-solution-name
-

+

📝 Adding a new solution 📝

All LeetCode problems can be found here.\ If you have a solution to any of these problems (which are not being repeated), that's great! Here are the steps:

    @@ -127,12 +127,12 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
  1. Doxygen documentation isn't used in LeetCode solutions. Simple/small documentation or comments should be fine.
  2. Don't include libraries/headers such as stdio.h. Your file should be the solution to the problem only.
-

+

📜 Adding your new solution to the list 📜

Great! You've added your solution. Now, you'll have to add it to leetcode/DIRECTORY.md.\ Please use numerical order. For example: if the solution's number is 98, add your solution after 97, if available.

This is the required format for new solutinos:

| <solution number> | [<solution name>](<leetcode link to problem>) | [C](./src/<filename>.c) | <difficulty> |
-

+

📦 Committing your changes 📦

Once you're done with adding a new LeetCode solution, it's time we make a pull request.

    diff --git a/index.html b/index.html index dfccdb8c..03bb535b 100644 --- a/index.html +++ b/index.html @@ -102,10 +102,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });

    Gitpod Ready-to-Code CodeQL CI Gitter chat contributions welcome GitHub repo size Doxygen CI Awesome CI Income Discord chat Donate

    -

    +

    Overview

    The repository is a collection of open-source implementations of a variety of algorithms implemented in C and licensed under GPLv3 License. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and their associated documentations are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using different algorithm strategies and optimizations.

    -

    +

    Features

    • The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C.
    • @@ -116,12 +116,12 @@ Features
    • Self-checks within programs ensure correct implementations with confidence.
    • Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.
    -

    +

    Documentation

    Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. Click on Files menu to see the list of all the files documented with the code.

    Documentation of Algorithms in C by The Algorithms Contributors is licensed under CC BY-SA 4.0
    Creative Commons LicenseCredit must be given to the creatorAdaptations must be shared under the same terms

    -

    +

    Contributions

    As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.

    diff --git a/navtreedata.js b/navtreedata.js index aa68ee86..dd7abadd 100644 --- a/navtreedata.js +++ b/navtreedata.js @@ -26,10 +26,10 @@ var NAVTREE = [ [ "Algorithms_in_C", "index.html", [ [ "The Algorithms - C", "index.html", [ - [ "Overview", "index.html#autotoc_md75", null ], - [ "Features", "index.html#autotoc_md76", null ], - [ "Documentation", "index.html#autotoc_md77", null ], - [ "Contributions", "index.html#autotoc_md78", null ] + [ "Overview", "index.html#autotoc_md76", null ], + [ "Features", "index.html#autotoc_md77", null ], + [ "Documentation", "index.html#autotoc_md78", null ], + [ "Contributions", "index.html#autotoc_md79", null ] ] ], [ "Contributor Covenant Code of Conduct", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html", [ [ "Our Pledge", "d4/d4c/md__c_o_d_e__o_f__c_o_n_d_u_c_t.html#autotoc_md1", null ], @@ -61,53 +61,55 @@ var NAVTREE = [ "Test", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26", null ], [ "Typical structure of a program", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27", null ], [ "File name guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28", null ], - [ "Directory guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29", null ], - [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30", null ] + [ "Directory guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29", [ + [ "Integrating CMake in a new directory", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30", null ] + ] ], + [ "Commit Guidelines", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", null ] ] ], - [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31", [ - [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", null ], - [ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", null ], - [ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34", null ], - [ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35", null ] + [ "Pull Requests", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32", [ + [ "Building Locally", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33", null ], + [ "Static Code Analyzer", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34", null ], + [ "Code Formatter", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35", null ], + [ "GitHub Actions", "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36", null ] ] ] ] ] ] ], [ "Array", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html", [ - [ "Sort Function", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md37", null ], - [ "Structure", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38", null ], - [ "Files", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39", null ] + [ "Sort Function", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38", null ], + [ "Structure", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39", null ], + [ "Files", "d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40", null ] ] ], [ "Dictionary", "de/d20/md_data_structures_dictionary__r_e_a_d_m_e.html", null ], [ "Simple generic Stack", "d1/d12/md_data_structures_stack__r_e_a_d_m_e.html", null ], [ "Audio", "d5/d88/md__d_i_r_e_c_t_o_r_y.html", [ - [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46", null ], - [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ], - [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ], - [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ], - [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ], - [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ], - [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ], - [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ], - [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ], - [ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ], - [ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ], - [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ], - [ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ], - [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ], - [ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ], - [ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ], - [ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ], - [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ] + [ "Client Server", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47", null ], + [ "Conversions", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48", null ], + [ "Data Structures", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49", null ], + [ "Developer Tools", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50", null ], + [ "Exercism", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51", null ], + [ "Games", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52", null ], + [ "Geometry", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53", null ], + [ "Graphics", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54", null ], + [ "Greedy Approach", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55", null ], + [ "Hash", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56", null ], + [ "Leetcode", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57", null ], + [ "Machine Learning", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58", null ], + [ "Misc", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59", null ], + [ "Numerical Methods", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60", null ], + [ "Process Scheduling Algorithms", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61", null ], + [ "Project Euler", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62", null ], + [ "Searching", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63", null ], + [ "Sorting", "d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64", null ] ] ], [ "Sample solutions for exercism.io", "d7/db5/md_exercism__r_e_a_d_m_e.html", null ], [ "Hash algorithms", "d4/dcb/md_hash__r_e_a_d_m_e.html", null ], [ "LeetCode", "d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html", null ], [ "📚 Contributing 📚", "df/d58/md_leetcode__r_e_a_d_m_e.html", [ - [ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md70", null ], - [ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71", [ - [ "📜 Adding your new solution to the list 📜", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72", null ] + [ "💻 Cloning/setting up the project 💻", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71", null ], + [ "📝 Adding a new solution 📝", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72", [ + [ "📜 Adding your new solution to the list 📜", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73", null ] ] ], - [ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73", null ] + [ "📦 Committing your changes 📦", "df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74", null ] ] ], [ "ProjectEuler", "d8/d81/md_project_euler__r_e_a_d_m_e.html", null ], [ "Guidelines for reviewers and maintainers", "dc/db4/md__r_e_v_i_e_w_e_r__c_o_d_e.html", null ], @@ -137,9 +139,9 @@ var NAVTREEINDEX = [ "annotated.html", "d4/d68/qr__decompose_8h_source.html", -"d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c", -"dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd", -"globals_func_c.html" +"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235", +"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df", +"globals_func_b.html" ]; var SYNCONMSG = 'click to disable panel synchronisation'; diff --git a/navtreeindex1.js b/navtreeindex1.js index 51a77ca8..d3a58819 100644 --- a/navtreeindex1.js +++ b/navtreeindex1.js @@ -79,24 +79,24 @@ var NAVTREEINDEX1 = "d5/d7c/problem__5_2sol3_8c.html#ae9606f1867e9921867d6572f51377b4c":[16,0,16,18,2,1], "d5/d7e/struct_t.html":[15,0,40], "d5/d88/md__d_i_r_e_c_t_o_r_y.html":[7], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46":[7,0], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[7,1], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[7,2], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[7,3], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[7,4], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[7,5], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[7,6], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[7,7], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[7,8], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[7,9], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[7,10], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[7,11], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[7,12], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,13], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,14], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,15], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,16], -"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,17], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[7,0], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[7,1], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[7,2], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[7,3], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[7,4], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[7,5], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[7,6], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[7,7], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[7,8], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[7,9], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[7,10], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[7,11], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[7,12], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[7,13], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[7,14], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[7,15], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[7,16], +"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[7,17], "d5/da1/structnode.html":[15,0,28], "d5/da1/structnode.html#a111a569ab2765add9b91c9f94cf9f063":[15,0,28,6], "d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2":[15,0,28,3], @@ -178,12 +178,13 @@ var NAVTREEINDEX1 = "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,3,3], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,3,4], "d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,3,5], -"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,3,6], -"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,4], -"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,4,0], -"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,4,1], -"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,2], -"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,3], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,3,5,0], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,3,6], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,4], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,4,0], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,4,1], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,4,2], +"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,4,3], "d6/ded/shell__sort2_8c.html":[16,0,18,11], "d6/ded/shell__sort2_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,18,11,0], "d6/df3/graph_8h_source.html":[16,0,3,4,0], @@ -248,6 +249,5 @@ var NAVTREEINDEX1 = "d8/d32/problem__25_2sol1_8c.html":[16,0,16,13,0], "d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61":[16,0,16,13,0,0], "d8/d32/problem__25_2sol1_8c.html#a0ddf1224851353fc92bfbff6f499fa97":[16,0,16,13,0,3], -"d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783":[16,0,16,13,0,2], -"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,16,13,0,4] +"d8/d32/problem__25_2sol1_8c.html#a2b90df6bfbf0d18cd9a19c1a71453783":[16,0,16,13,0,2] }; diff --git a/navtreeindex2.js b/navtreeindex2.js index 5ce065a7..6b3523f3 100644 --- a/navtreeindex2.js +++ b/navtreeindex2.js @@ -1,5 +1,6 @@ var NAVTREEINDEX2 = { +"d8/d32/problem__25_2sol1_8c.html#abe5bc1f170b2108a19d0a16d30bd3235":[16,0,16,13,0,4], "d8/d32/problem__25_2sol1_8c.html#af9729befaffc1aab9ac9fedc4706e66c":[16,0,16,13,0,1], "d8/d38/queue_8h_source.html":[16,0,3,4,1], "d8/d71/group__k__means.html":[14,2,1], @@ -26,9 +27,9 @@ var NAVTREEINDEX2 = "d8/de0/problem__9_2sol2_8c.html":[16,0,16,22,1], "d8/de0/problem__9_2sol2_8c.html#a840291bc02cba5474a4cb46a9b9566fe":[16,0,16,22,1,0], "d9/d41/md_data_structures_array__r_e_a_d_m_e.html":[4], -"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md37":[4,0], -"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38":[4,1], -"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39":[4,2], +"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md38":[4,0], +"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md39":[4,1], +"d9/d41/md_data_structures_array__r_e_a_d_m_e.html#autotoc_md40":[4,2], "d9/d66/group__machine__learning.html":[14,2], "d9/d8b/structmat__3x3__.html":[14,0,1,0], "d9/d8b/structmat__3x3__.html#a490bb6be52ea95b333b55b236af41563":[14,0,1,0,2], @@ -248,6 +249,5 @@ var NAVTREEINDEX2 = "dc/de5/structsubset.html":[15,0,38], "dd/d06/structsegment__tree.html":[15,0,34], "dd/d06/structsegment__tree.html#a5373ee53a5ac1cd7a9dcb89a4c23a04a":[15,0,34,2], -"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,34,3], -"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,34,0] +"dd/d06/structsegment__tree.html#a5ad61abcbd2c25a4a71416281dba8f1e":[15,0,34,3] }; diff --git a/navtreeindex3.js b/navtreeindex3.js index e23bd508..bdcc838f 100644 --- a/navtreeindex3.js +++ b/navtreeindex3.js @@ -1,5 +1,6 @@ var NAVTREEINDEX3 = { +"dd/d06/structsegment__tree.html#a973ab017a97678fdc6774543585897df":[15,0,34,0], "dd/d06/structsegment__tree.html#aa18d7cb422873a807707b26448dce7cd":[15,0,34,4], "dd/d06/structsegment__tree.html#aa9dc376b5b219c4cec6546483527b853":[15,0,34,1], "dd/d08/newton__raphson__root_8c.html":[16,0,14,2], @@ -137,10 +138,10 @@ var NAVTREEINDEX3 = "df/d43/postfix__evaluation_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[16,0,13,8,2], "df/d43/postfix__evaluation_8c.html#af395c540f7e70a8d82d055a0aa42bbef":[16,0,13,8,4], "df/d58/md_leetcode__r_e_a_d_m_e.html":[11], -"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md70":[11,0], -"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71":[11,1], -"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72":[11,1,0], -"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73":[11,2], +"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md71":[11,0], +"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md72":[11,1], +"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md73":[11,1,0], +"df/d58/md_leetcode__r_e_a_d_m_e.html#autotoc_md74":[11,2], "df/d83/selection__sort_8c.html":[16,0,18,9], "df/d83/selection__sort_8c.html#aa8dca7b867074164d5f45b0f3851269d":[16,0,18,9,3], "df/d83/selection__sort_8c.html#ac0f2228420376f4db7e1274f2b41667c":[16,0,18,9,0], @@ -246,8 +247,7 @@ var NAVTREEINDEX3 = "globals_defs.html":[16,1,4], "globals_e.html":[16,1,0,5], "globals_f.html":[16,1,0,6], -"globals_func.html":[16,1,1], "globals_func.html":[16,1,1,0], -"globals_func_a.html":[16,1,1,1], -"globals_func_b.html":[16,1,1,2] +"globals_func.html":[16,1,1], +"globals_func_a.html":[16,1,1,1] }; diff --git a/navtreeindex4.js b/navtreeindex4.js index df8e60a8..49ba2d03 100644 --- a/navtreeindex4.js +++ b/navtreeindex4.js @@ -1,5 +1,6 @@ var NAVTREEINDEX4 = { +"globals_func_b.html":[16,1,1,2], "globals_func_c.html":[16,1,1,3], "globals_func_d.html":[16,1,1,4], "globals_func_e.html":[16,1,1,5], @@ -44,10 +45,10 @@ var NAVTREEINDEX4 = "globals_x.html":[16,1,0,24], "index.html":[], "index.html":[0], -"index.html#autotoc_md75":[0,0], -"index.html#autotoc_md76":[0,1], -"index.html#autotoc_md77":[0,2], -"index.html#autotoc_md78":[0,3], +"index.html#autotoc_md76":[0,0], +"index.html#autotoc_md77":[0,1], +"index.html#autotoc_md78":[0,2], +"index.html#autotoc_md79":[0,3], "modules.html":[14], "pages.html":[] };