mirror of
https://bitbucket.org/Mattrixwv/cipherstream.git
synced 2025-12-06 18:33:58 -05:00
Fixed typos
This commit is contained in:
@@ -15,11 +15,11 @@
|
||||
class Vigenere{
|
||||
protected:
|
||||
class emptyKeyword{}; //A class to help with error handling
|
||||
std::string inputString; //This is the string that you want to encode or decode
|
||||
std::string outputString; //This is the string that is output from encoding or decoding
|
||||
std::string keyword; //This is the keyword that is the resposible for determining the offsets that you change each character by
|
||||
std::string inputString; //This is the string that you want to encode or decode
|
||||
std::string outputString; //This is the string that is output from encoding or decoding
|
||||
std::string keyword; //This is the keyword that is the resposible for determining the offsets that you change each character by
|
||||
static const std::string version; //The current library's version number
|
||||
std::vector<unsigned int> offset; //This holds the offsets computed from each character in the keyword
|
||||
std::vector<unsigned int> offset; //This holds the offsets computed from each character in the keyword
|
||||
void setOffset(); //Uses keyword to calculate the offset for the Caesar cipher for each character
|
||||
void setInputString(std::string input); //Sets inputString
|
||||
void setKeyword(std::string key); //Sets keyword
|
||||
@@ -30,7 +30,7 @@ public:
|
||||
~Vigenere();
|
||||
std::string getInputString() const; //Returns the current inputString
|
||||
std::string getOutputString() const; //Returns the current outputString
|
||||
std::string getKeyword() const; //Returns the current keyword
|
||||
std::string getKeyword() const; //Returns the current keyword
|
||||
std::vector<unsigned int> getOffsets() const; //Returns the current offsets (Used mostly in bug fixing)
|
||||
std::string encode(std::string key, std::string input); //Encodes input using key and returns the result
|
||||
std::string decode(std::string key, std::string input); //Decodes input using key and returns the result
|
||||
|
||||
@@ -47,6 +47,7 @@ void Autokey::encodeSet(std::string key, std::string input){
|
||||
|
||||
//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
|
||||
//TODO: Why not just use substring?
|
||||
while(key.size() > input.size()){
|
||||
key.erase(key.end() - 1);
|
||||
}
|
||||
|
||||
@@ -48,7 +48,7 @@ void Playfair::createGrid(){
|
||||
bool found = false;
|
||||
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
|
||||
char current;
|
||||
for(unsigned int cnt = 0;(cnt < keyword.size()) && (row < 5);++cnt){
|
||||
|
||||
Reference in New Issue
Block a user