js-caesarcipher 1.0.1 → 1.0.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md ADDED
@@ -0,0 +1,26 @@
1
+ # Caesar Cipher
2
+
3
+ # Installation
4
+ Add this script tag to your html code
5
+
6
+ ```html
7
+ <script src="https://cdn.jsdelivr.net/npm/js-caesarcipher@1.0.2/script.js"></script>
8
+ ```
9
+
10
+ # Useage
11
+
12
+ Use the function `new CaesarCipher()`
13
+
14
+ Example: "Hello World", after shifting 2 letters will be "Jgnnq Yqtnf"
15
+
16
+ ```javascript
17
+ let cipher = new CaesarCipher({
18
+ "input": "Hello World",
19
+ "shift": 2
20
+ });
21
+ console.log(cipher.result);
22
+ // The output will be "Jgnnq Yqtnf"
23
+ ```
24
+
25
+ * The `input` is unciphered plain text.
26
+ * The `shift` is shift how many letters.
package/index.html CHANGED
@@ -1 +1,4 @@
1
- <script src="script.js"></script>
1
+ <script src="script.js"></script>
2
+ <script>
3
+
4
+ </script>
package/package.json CHANGED
@@ -1,9 +1,11 @@
1
1
  {
2
2
  "name": "js-caesarcipher",
3
- "version": "1.0.1",
3
+ "version": "1.0.2",
4
4
  "description": "A JavaScript library for Caesar Cipher",
5
5
  "keywords": [
6
- "caesar cipher"
6
+ "caesar cipher",
7
+ "encryption",
8
+ "security"
7
9
  ],
8
10
  "homepage": "https://github.com/RichardLiuCode/CaesarCipher#readme",
9
11
  "bugs": {
package/script.js CHANGED
@@ -1,3 +1,25 @@
1
1
  function CaesarCipher({ input, shift }) {
2
-
2
+ var originalOrderUp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
3
+ var originalOrderLow = "abcdefghijklmnopqrstuvwxyz";
4
+ var result = "";
5
+ var foundFlag = false;
6
+ for (var i = 0; i < input.length; i++) {
7
+ foundFlag = false;
8
+ for (var j = 0; j < originalOrderUp.length; j++) {
9
+ if (input[i] == originalOrderUp[j]) {
10
+ result = result + originalOrderUp[(j + shift) % 26];
11
+ foundFlag = true;
12
+ }
13
+ }
14
+ for (var k = 0; k < originalOrderLow.length; k++) {
15
+ if (input[i] == originalOrderLow[k]) {
16
+ result = result + originalOrderLow[(k + shift) % 26];
17
+ foundFlag = true;
18
+ }
19
+ }
20
+ if (foundFlag == false) {
21
+ result = result + input[i];
22
+ }
23
+ }
24
+ this.result = result;
3
25
  }