diff --git a/annotated.html b/annotated.html index a0838d40f..ea857a33d 100644 --- a/annotated.html +++ b/annotated.html @@ -95,7 +95,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
| ▼Nciphers | For std::string |
| ▼Nciphers | Algorithms for encryption and decryption |
| ►Nelliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange |
| CHillCipher | Implementation of Hill Cipher algorithm |
Namespaces | |
| namespace | ciphers |
| for std::string | |
| Algorithms for encryption and decryption. | |
| namespace | XOR |
| Functions for XOR cipher algorithm. | |
Namespaces | |
| namespace | ciphers |
| for std::string | |
| Algorithms for encryption and decryption. | |
| namespace | caesar |
| Functions for Caesar cipher algorithm. | |
@@ -119,10 +119,11 @@ Variables | |
for std::string
+Algorithms for encryption and decryption.
for IO operations
-Algorithms for encryption and decryption.
+for std::string
+for std::transform and std::replace for assert for uint8_t for IO operations for std::map for std::stringstream for std::string for std::vector
for assert for IO operations for std::map
Algorithms for encryption and decryption
In programming, Base64 is a group of binary-to-text encoding schemes that represent binary data (more specifically, a sequence of 8-bit bytes) in an ASCII string format by translating the data into a radix-64 representation. The term Base64 originates from a specific MIME content transfer encoding. Each non-final Base64 digit represents exactly 6 bits of data. Three 8-bit bytes (i.e., a total of 24 bits) can therefore be represented by four 6-bit Base64 digits.
diff --git a/d6/d4e/namespaceciphers.js b/d6/d4e/namespaceciphers.js index d408922ed..0794fa7f0 100644 --- a/d6/d4e/namespaceciphers.js +++ b/d6/d4e/namespaceciphers.js @@ -1,5 +1,9 @@ var namespaceciphers = [ + [ "a1z26", null, [ + [ "decrypt", "de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38", null ], + [ "encrypt", "de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744", null ] + ] ], [ "atbash", null, [ [ "atbash_cipher", "dc/dfb/atbash__cipher_8cpp.html#ae633d82f248dffe0d2f6bdf82e56b7b5", null ] ] ], diff --git a/d7/db9/hill__cipher_8cpp.html b/d7/db9/hill__cipher_8cpp.html index 2bf45ee04..264d78af9 100644 --- a/d7/db9/hill__cipher_8cpp.html +++ b/d7/db9/hill__cipher_8cpp.html @@ -126,7 +126,7 @@ Classes
diff --git a/d8/d2a/namespacea1z26.html b/d8/d2a/namespacea1z26.html
new file mode 100644
index 000000000..a0956adcc
--- /dev/null
+++ b/d8/d2a/namespacea1z26.html
@@ -0,0 +1,111 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+a1z26 Namespace Reference namespace | ciphers | | for std::string | | Functions for Morse Code. | namespace | ciphers | | for std::string | | Functions for the Atbash Cipher implementation. | namespace | ciphers | | for std::string | | Functions for vigenère cipher algorithm. |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+a1z26_cipher.cpp File Reference
+
+
+Implementation of the A1Z26 cipher +More... +#include <algorithm>+ #include <cassert>+ #include <cstdint>+ #include <iostream>+ #include <map>+ #include <sstream>+ #include <string>+ #include <vector>+
+Include dependency graph for a1z26_cipher.cpp:
+
+
+
+
+
Detailed Description+Implementation of the A1Z26 cipher +The A1Z26 cipher is a simple substiution cipher where each letter is replaced by the number of the order they're in. For example, A corresponds to 1, B = 2, C = 3, etc. + +Function Documentation+ +◆ decrypt()+ +
+
+
+
+
+
+
+a1z26 decryption implementation +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ T push_back(T... args) T replace(T... args) T stoi(T... args) T transform(T... args)
+Here is the call graph for this function:
+
+
+
+
+
+◆ encrypt()+ +
+
+
+
+
+
+
+a1z26 encryption implementation +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ T begin(T... args) T end(T... args) T to_string(T... args)
+Here is the call graph for this function:
+
+
+
+
+
+◆ main()+ +
+
+
+
+
+
◆ test()+ +
+
+
+
+
+
+Self-test implementations. +
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ std::string decrypt(const std::string &text, bool bReturnUppercase=false) a1z26 decryption implementation Definition: a1z26_cipher.cpp:78 std::string encrypt(std::string text) a1z26 encryption implementation Definition: a1z26_cipher.cpp:51 T endl(T... args)
+Here is the call graph for this function:
+
+
+
+
+
+Variable Documentation+ +◆ a1z26_decrypt_map+ +
+
+
+
+
+Initial value:
+= {
+ {1, 'a'}, {2, 'b'}, {3, 'c'}, {4, 'd'}, {5, 'e'}, {6, 'f'}, {7, 'g'},
+ {8, 'h'}, {9, 'i'}, {10, 'j'}, {11, 'k'}, {12, 'l'}, {13, 'm'}, {14, 'n'},
+ {15, 'o'}, {16, 'p'}, {17, 'q'}, {18, 'r'}, {19, 's'}, {20, 't'}, {21, 'u'},
+ {22, 'v'}, {23, 'w'}, {24, 'x'}, {25, 'y'}, {26, 'z'},
+}
+◆ a1z26_encrypt_map+ +
+
+
+
+Initial value:
+= {
+ {'a', 1}, {'b', 2}, {'c', 3}, {'d', 4}, {'e', 5}, {'f', 6}, {'g', 7},
+ {'h', 8}, {'i', 9}, {'j', 10}, {'k', 11}, {'l', 12}, {'m', 13}, {'n', 14},
+ {'o', 15}, {'p', 16}, {'q', 17}, {'r', 18}, {'s', 19}, {'t', 20}, {'u', 21},
+ {'v', 22}, {'w', 23}, {'x', 24}, {'y', 25}, {'z', 26}}
+ | Namespaces | Algorithms for encryption and decryption. | namespace | morse | Namespaces | Algorithms for encryption and decryption. | namespace | atbash | Namespaces | Algorithms for encryption and decryption. | namespace | vigenere | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Namespaces | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| namespace | ciphers | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| for std::string | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Algorithms for encryption and decryption. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| namespace | ciphers::elliptic_curve_key_exchange | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| namespace elliptic_curve_key_exchange | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Files | |
| file | a1z26_cipher.cpp |
| Implementation of the A1Z26 cipher | |
| file | atbash_cipher.cpp |
| Atbash Cipher implementation | |
| ► ciphers | |
| ► cpu_scheduling_algorithms | |
| ► data_structures | |
| Nabbreviation | Functions for Abbreviation implementation |
| Nactivations | Various activation functions used in Neural network |
| Natbash | Functions for the Atbash Cipher implementation |
| Naystar_search | Functions for A* Search implementation |
| Nbacktracking | Backtracking algorithms |
| Nbase64_encoding | Functions for Base64 Encoding and Decoding implementation |
| Nbidirectional_dijkstra | Functions for Bidirectional Dijkstra Shortest Path algorithm |
| Nbinomial | Functions for Binomial coefficients implementation |
| Nbit_manipulation | For IO operations |
| Ncaesar | Functions for Caesar cipher algorithm |
| ►Nciphers | For std::string |
| Ncount_of_set_bits | Functions for the count sets bits implementation |
| Ncount_of_trailing_ciphers_in_factorial_n | Functions for the Count the number of ciphers in n! implementation |
| Ncut_rod | Implementation of cutting a rod problem |
| Ncycle_detection | Functions for the Floyd's Cycle Detection algorithm |
| Ncycle_sort | Functions for Cycle sort algorithm |
| Ndata_strcutres | Stack Data Structure Using the Queue Data Structure |
| ►Ndata_structures | Data Structures algorithms |
| Na1z26 | Functions for A1Z26 encryption and decryption implementation |
| Nabbreviation | Functions for Abbreviation implementation |
| Nactivations | Various activation functions used in Neural network |
| Natbash | Functions for the Atbash Cipher implementation |
| Naystar_search | Functions for A* Search implementation |
| Nbacktracking | Backtracking algorithms |
| Nbase64_encoding | Functions for Base64 Encoding and Decoding implementation |
| Nbidirectional_dijkstra | Functions for Bidirectional Dijkstra Shortest Path algorithm |
| Nbinomial | Functions for Binomial coefficients implementation |
| Nbit_manipulation | For IO operations |
| Ncaesar | Functions for Caesar cipher algorithm |
| ►Nciphers | Algorithms for encryption and decryption |
| Ncount_of_set_bits | Functions for the count sets bits implementation |
| Ncount_of_trailing_ciphers_in_factorial_n | Functions for the Count the number of ciphers in n! implementation |
| Ncut_rod | Implementation of cutting a rod problem |
| Ncycle_detection | Functions for the Floyd's Cycle Detection algorithm |
| Ncycle_sort | Functions for Cycle sort algorithm |
| Ndata_strcutres | Stack Data Structure Using the Queue Data Structure |
| ►Ndata_structures | Data Structures algorithms |
| Ndepth_first_search | Functions for Depth First Search algorithm |
| Ndisjoint_union | Functions for Disjoint union implementation |
| Ndivide_and_conquer | For std::vector |
| Ndnf_sort | Functions for the DNF sort implementation |
| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
| Ndynamic_programming | Dynamic Programming algorithms |
| Nfalse_position | Functions for False Position method |
| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) |
| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
| ►Ngeometry | Geometry algorithms |
| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
| ►Ngraph | Graph Algorithms |
| Nhamming_distance | Functions for Hamming distance implementation |
| Nhashing | Hashing algorithms |
| Nheavy_light_decomposition | Heavy light decomposition algorithm |
| Nhorspool | Functions for Horspool's algorithm |
| Nhouse_robber | Functions for the House Robber algorithm |
| Ninorder_successor_of_bst | Functions for the Inorder successor of a binary search tree implementation |
| Ninversion | Functions for counting inversions using Merge Sort algorithm |
| Nis_graph_bipartite | Functions for checking whether a graph is bipartite or not |
| Niterative_tree_traversals | Functions for the Traversal of the Tree algorithm |
| Njarvis | Functions for Jarvis’s algorithm |
| Nkadane | Functions for Kadane algorithm |
| Nkaratsuba_algorithm | Functions for the Karatsuba algorithm for fast multiplication |
| NKnapsack | Implementation of 0-1 Knapsack problem |
| Nlayers | This namespace contains layers used in MLP |
| Nlinear_algebra | For io operations |
| ►Nlinear_probing | An implementation of hash table using linear probing algorithm |
| Nlinear_recurrence_matrix | Functions for Linear Recurrence Matrix implementation |
| Nlinked_list | Functions for singly linked list algorithm |
| Nlist_array | Functions for Dynamic Array algorithm |
| Nlru_cache | Implementation of the LRU caching algorithm |
| Nlru_tests | |
| ►Nmachine_learning | A* search algorithm |
| Nmagic_sequence | Functions for the Magic sequence implementation |
| Nmanacher | Functions for Manacher's Algorithm implementation |
| ►Nmath | For IO operations |
| NMD5 | Functions for the MD5 algorithm implementation |
| Nmedian_search | Functions for Median search algorithm |
| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
| Nmincoins_topdown | Functions for minimum coin exchange problem |
| NMinimum | Implementation of Minimum Edit Distance algorithm |
| Nmodular_division | Functions for Modular Division implementation |
| Nmonte_carlo | Functions for the Monte Carlo Integration implementation |
| Nmorse | Functions for Morse Code |
| Nn_bonacci | Functions for the N-bonacci implementation |
| Nn_queens | Functions for Eight Queens puzzle |
| Nn_queens_all_solutions | Functions for Eight Queens puzzle with all solutions |
| Nn_queens_optimized | Functions for Eight Queens puzzle optimized |
| Nncr_modulo_p | Functions for nCr modulo p implementation |
| Nneural_network | Neural Network or Multilayer Perceptron |
| Nnumerical_methods | For io operations |
| ►Noperations_on_datastructures | For std::vector |
| ►Nothers | For vector |
| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
| Npancake_sort | Functions for Pancake sort algorithm |
| Npostfix_expression | Functions for Postfix Expression algorithm |
| Nprefix_sum_array | Range sum queries using prefix-sum-array |
| ►Nprobability | Probability algorithms |
| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
| Nqueue_using_array | Functions for Queue using Array implementation |
| Nradix_sort | Functions for Radix sort algorithm |
| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
| Nrat_maze | Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to- + |
| Ndepth_first_search | Functions for Depth First Search algorithm |
| Ndisjoint_union | Functions for Disjoint union implementation |
| Ndivide_and_conquer | For std::vector |
| Ndnf_sort | Functions for the DNF sort implementation |
| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
| Ndynamic_programming | Dynamic Programming algorithms |
| Nfalse_position | Functions for False Position method |
| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) |
| Ngeometric_dist | Functions for the Geometric Distribution algorithm implementation |
| ►Ngeometry | Geometry algorithms |
| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
| ►Ngraph | Graph Algorithms |
| Nhamming_distance | Functions for Hamming distance implementation |
| Nhashing | Hashing algorithms |
| Nheavy_light_decomposition | Heavy light decomposition algorithm |
| Nhorspool | Functions for Horspool's algorithm |
| Nhouse_robber | Functions for the House Robber algorithm |
| Ninorder_successor_of_bst | Functions for the Inorder successor of a binary search tree implementation |
| Ninversion | Functions for counting inversions using Merge Sort algorithm |
| Nis_graph_bipartite | Functions for checking whether a graph is bipartite or not |
| Niterative_tree_traversals | Functions for the Traversal of the Tree algorithm |
| Njarvis | Functions for Jarvis’s algorithm |
| Nkadane | Functions for Kadane algorithm |
| Nkaratsuba_algorithm | Functions for the Karatsuba algorithm for fast multiplication |
| NKnapsack | Implementation of 0-1 Knapsack problem |
| Nlayers | This namespace contains layers used in MLP |
| Nlinear_algebra | For io operations |
| ►Nlinear_probing | An implementation of hash table using linear probing algorithm |
| Nlinear_recurrence_matrix | Functions for Linear Recurrence Matrix implementation |
| Nlinked_list | Functions for singly linked list algorithm |
| Nlist_array | Functions for Dynamic Array algorithm |
| Nlru_cache | Implementation of the LRU caching algorithm |
| Nlru_tests | |
| ►Nmachine_learning | A* search algorithm |
| Nmagic_sequence | Functions for the Magic sequence implementation |
| Nmanacher | Functions for Manacher's Algorithm implementation |
| ►Nmath | For IO operations |
| NMD5 | Functions for the MD5 algorithm implementation |
| Nmedian_search | Functions for Median search algorithm |
| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
| Nmincoins_topdown | Functions for minimum coin exchange problem |
| NMinimum | Implementation of Minimum Edit Distance algorithm |
| Nmodular_division | Functions for Modular Division implementation |
| Nmonte_carlo | Functions for the Monte Carlo Integration implementation |
| Nmorse | Functions for Morse Code |
| Nn_bonacci | Functions for the N-bonacci implementation |
| Nn_queens | Functions for Eight Queens puzzle |
| Nn_queens_all_solutions | Functions for Eight Queens puzzle with all solutions |
| Nn_queens_optimized | Functions for Eight Queens puzzle optimized |
| Nncr_modulo_p | Functions for nCr modulo p implementation |
| Nneural_network | Neural Network or Multilayer Perceptron |
| Nnumerical_methods | For io operations |
| ►Noperations_on_datastructures | For std::vector |
| ►Nothers | For vector |
| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
| Npancake_sort | Functions for Pancake sort algorithm |
| Npostfix_expression | Functions for Postfix Expression algorithm |
| Nprefix_sum_array | Range sum queries using prefix-sum-array |
| ►Nprobability | Probability algorithms |
| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
| Nqueue_using_array | Functions for Queue using Array implementation |
| Nradix_sort | Functions for Radix sort algorithm |
| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
| Nrat_maze | Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to- solve-a-rat-in-a-maze-c-java-pytho/" |
| Nreverse_binary_tree | Functions for the Reverse a Binary Tree implementation |
| Nrunge_kutta | Functions for Runge Kutta fourth order method |
| Nsaddleback | Function for implementing Saddleback Algorithm |
| ►Nsearch | For std::vector |
| Nselection_sort_recursive | Functions for the Selection sort implementation using recursion |
| NSHA | Functions for the SHA-1 algorithm implementation |
| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
| Nsorting | Sorting algorithms |
| Nsparse_table | Functions for Implementation of Sparse Table |
| Nspirograph | |
| Nstack_using_queue | Functions for the Stack Using Queue implementation |
| ►Nstatistics | Statistical algorithms |
| ►Nstd | STL namespace |
| Nstrand | Functions for Strand Sort algorithm |
| Nstring_search | String search algorithms |
| Nstrings | Algorithms with strings |
| Nsubarray_sum | Functions for the Subset sum implementation |
| Nsublist_search | Functions for the Sublist Search implementation |
| NSubsets | Functions for the Subset Sum problem |
| Ntests | Testcases to check Reversal of Binary Tree |
| Ntree_234 | Functions for 2–3–4 tree |
| Ntrie_operations | Functions for Trie datastructure implementation |
| Ntrie_using_hashmap | Functions for Trie data structure using hashmap implementation |
| Nutil_functions | Various utility functions used in Neural network |
| Nvector_cross | Functions for Vector Cross Product algorithms |
| Nvigenere | Functions for vigenère cipher algorithm |
| Nwave_sort | Functions for the Wave sort implementation |
| Nwiggle_sort | Functions for Wiggle Sort algorithm |
| Nwildcard_matching | Functions for the Wildcard Matching problem |
| Nwindowed_median | Functions for the Windowed Median algorithm implementation |
| Nword_break | Functions for Word Break problem |
| NXOR | Functions for XOR cipher algorithm |
| Nreverse_binary_tree | Functions for the Reverse a Binary Tree implementation |
| Nrunge_kutta | Functions for Runge Kutta fourth order method |
| Nsaddleback | Function for implementing Saddleback Algorithm |
| ►Nsearch | For std::vector |
| Nselection_sort_recursive | Functions for the Selection sort implementation using recursion |
| NSHA | Functions for the SHA-1 algorithm implementation |
| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
| Nsorting | Sorting algorithms |
| Nsparse_table | Functions for Implementation of Sparse Table |
| Nspirograph | |
| Nstack_using_queue | Functions for the Stack Using Queue implementation |
| ►Nstatistics | Statistical algorithms |
| ►Nstd | STL namespace |
| Nstrand | Functions for Strand Sort algorithm |
| Nstring_search | String search algorithms |
| Nstrings | Algorithms with strings |
| Nsubarray_sum | Functions for the Subset sum implementation |
| Nsublist_search | Functions for the Sublist Search implementation |
| NSubsets | Functions for the Subset Sum problem |
| Ntests | Testcases to check Reversal of Binary Tree |
| Ntree_234 | Functions for 2–3–4 tree |
| Ntrie_operations | Functions for Trie datastructure implementation |
| Ntrie_using_hashmap | Functions for Trie data structure using hashmap implementation |
| Nutil_functions | Various utility functions used in Neural network |
| Nvector_cross | Functions for Vector Cross Product algorithms |
| Nvigenere | Functions for vigenère cipher algorithm |
| Nwave_sort | Functions for the Wave sort implementation |
| Nwiggle_sort | Functions for Wiggle Sort algorithm |
| Nwildcard_matching | Functions for the Wildcard Matching problem |
| Nwindowed_median | Functions for the Windowed Median algorithm implementation |
| Nword_break | Functions for Word Break problem |
| NXOR | Functions for XOR cipher algorithm |