C-Enigma/Rotors.cpp at master · ivanmang/C-Enigma · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
//
// Created by ivan on 7/19/18.
//

#include <stdexcept>
#include "Rotors.h"
#include <iostream>
#include <cstring>
#include <iterator>
#include <algorithm>

using namespace std;


Rotors::Rotors() {
}


vector<int> Rotors::tokeniser(char* rotor_config) {
    config_map.clear();
    char* rotor_token = strtok(rotor_config," ");
    int i = 0;
    while(rotor_token){
        config_map.push_back(atoi(rotor_token));
        rotor_token = strtok(NULL, " ");
        i++;
    }
    return config_map;
}


vector<int> Rotors::map_backward(vector<int> config_map) {
    if(config_map.empty()){
        return config_map;
    }
    back_map.clear();
    vector<int>::iterator num;
    for(int i = 0; i < config_map.size(); i++){
        num = find(config_map.begin(),config_map.end(), i);
        if(num != config_map.end()){
            int index = distance(config_map.begin(),num);
            back_map.push_back(index);
        }else{
            cerr << "Missing elements when rotor map backwards";
        }
    }
    //printf("Back map:\n");
    //print_map(back_map);
    //printf("\n\n");
    return back_map;
}

char Rotors::num_to_char(int num) {
    return (char) 65 + num;
}

int Rotors::char_to_num(char c) {
    return (int) c - 65;
}

char Rotors::input_to_front(vector<int>* config, char input, int rotor_num) {
    if(config[0].empty()){
        return input;
    }
    char output = input;
    for(int i = 0; i < rotor_num; i++){
        //print_map(config[i]);
        output = find_char_mapped_to(output,config[i]);
    }

    return output;
}

char Rotors::input_to_back(vector<int>* config, char input, int rotor_num) {
    vector<int> back_config[10];
    for(int i = 0; i < rotor_num; i++){
        //printf("\n\n");
        //print_map(config[i]);
        vector<int> temp = config[i];
        back_config[i] = map_backward(temp);
    }
    char output = input;
    for(int i = 0; i < rotor_num; i++){
        output = find_char_mapped_to(output,back_config[rotor_num-i-1]);
    }

    return output;
}

char Rotors::find_char_mapped_to(char letter, vector<int> config) {
    if(config.empty()){
        return letter;
    }
    //Find the position of the letter
    int char_index = char_to_num(letter);
    //printf("char index %d\n",char_index);
    //Get the letter it mapped to
    for(int i = 0; i < config.size() ;i++){
        if(char_index == i){
            //printf("config[i] %d \n",config.at(i));
            return num_to_char(config.at(i));
        }
    }
}

vector<int>* Rotors::rotate_config(vector<int>* config, int rotor_num) {
    if(config[0].empty()){
        return config;
    }
    vector<int>::iterator it;
    int rotor = 0;
    if(rotor_num>1){
        int next_rotor = rotor + 1;
        it = config[next_rotor].begin();
        int first_elem1 = config[next_rotor].front();
        config[next_rotor].erase(it,it+1);
        config[next_rotor].push_back(first_elem1);
        if(rotate_time == 25){
            int next_rotor1 = rotor + 1;
            it = config[next_rotor1].begin();
            int first_elem2 = config[next_rotor1].front();
            config[next_rotor1].erase(it,it+1);
            config[next_rotor1].push_back(first_elem2);
        }
    }
    it = config[rotor].begin();
    int first_elem = config[rotor].front();
    config[rotor].erase(it,it+1);
    config[rotor].push_back(first_elem);
    rotate_time++;
    return config;
}


void Rotors::print_map(vector<int> config) {
    printf("The config is:");
    for (int i = 0; i < config.size(); i++) {
        printf("%d ",config.at(i));
    }
    printf("\n");
}