mirror of
https://bitbucket.org/Mattrixwv/cipherstream.git
synced 2025-12-06 18:33:58 -05:00
Fixed typos
This commit is contained in:
@@ -47,6 +47,7 @@ void Autokey::encodeSet(std::string key, std::string input){
|
|||||||
|
|
||||||
//This will take a long time if the keyword in long
|
//This will take a long time if the keyword in long
|
||||||
//Remove the last letter in the string until it is the same size as the input
|
//Remove the last letter in the string until it is the same size as the input
|
||||||
|
//TODO: Why not just use substring?
|
||||||
while(key.size() > input.size()){
|
while(key.size() > input.size()){
|
||||||
key.erase(key.end() - 1);
|
key.erase(key.end() - 1);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -48,7 +48,7 @@ void Playfair::createGrid(){
|
|||||||
bool found = false;
|
bool found = false;
|
||||||
row = column = 0;
|
row = column = 0;
|
||||||
|
|
||||||
//Add any new leters from the keyword to the grid
|
//Add any new letters from the keyword to the grid
|
||||||
//If you reach row 5 then the entire grid has been filled
|
//If you reach row 5 then the entire grid has been filled
|
||||||
char current;
|
char current;
|
||||||
for(unsigned int cnt = 0;(cnt < keyword.size()) && (row < 5);++cnt){
|
for(unsigned int cnt = 0;(cnt < keyword.size()) && (row < 5);++cnt){
|
||||||
|
|||||||
Reference in New Issue
Block a user