OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

[fix] rename data_structures namespace (#1061)

Browse Source 
* rename data_structures namespace

* spelling correction

* fix namespace doc name
This commit is contained in:
Krishna Vedala 2020-08-27 17:13:27 -04:00 committed by GitHub
parent b4bbe9dc4e
commit f4fe0c6f5b
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
data_structures/skip_list.cpp
View File

@ -20,10 +20,10 @@
#include <memory>
#include <vector>
/** \namespace data_structure
/** \namespace data_structures
* \brief Data-structure algorithms
*/
namespace data_structure {
namespace data_structures {
constexpr int MAX_LEVEL = 2; ///< Maximum level of skip list
constexpr float PROBABILITY = 0.5; ///< Current probability for "coin toss"
@ -198,7 +198,7 @@ class SkipList {
}
};
} // namespace data_structure
} // namespace data_structures
/**
* Main function:
@ -208,14 +208,14 @@ class SkipList {
int main() {
std::srand(std::time(nullptr));
data_structure::SkipList lst;
data_structures::SkipList lst;
for (int j = 0; j < (1 << (data_structure::MAX_LEVEL + 1)); j++) {
int k = (std::rand() % (1 << (data_structure::MAX_LEVEL + 2)) + 1);
for (int j = 0; j < (1 << (data_structures::MAX_LEVEL + 1)); j++) {
int k = (std::rand() % (1 << (data_structures::MAX_LEVEL + 2)) + 1);
lst.insertElement(k, &j);
}
lst.displayList();
return 0;
}

10
data_structures/trie_tree.cpp
View File

@ -14,10 +14,10 @@
#include <string>
#include <vector>
/** \namespace data_structure
/** \namespace data_structures
* \brief Data-structure algorithms
*/
namespace data_structure {
namespace data_structures {
/**
* @brief [Trie](https://en.wikipedia.org/wiki/Trie) implementation for
* small-case English alphabets `a-z`
@ -50,7 +50,7 @@ class trie {
/** search a string exists inside a given root trie
* @param str string to search for
* @param index start index to search from
* @returns `tre` if found
* @returns `true` if found
* @returns `false` if not found
*/
bool search(const std::shared_ptr<trie>& root, const std::string& str,
@ -169,14 +169,14 @@ class trie {
return false;
}
};
} // namespace data_structure
} // namespace data_structures
/**
* @brief Testing function
* @returns void
*/
static void test() {
data_structure::trie root;
data_structures::trie root;
root.insert("Hello");
root.insert("World");