Skip to content

Commit 9c27262

Browse files
salehhashemi1992salehhashemi1992
committed
fix cs errors to follow the psr12 standard and also some minor fixes
1 parent d7d34e3 commit 9c27262

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

72 files changed

+573
-574
lines changed

‎Ciphers/CaesarCipher.php

+4-4
Original file line numberDiff line numberDiff line change
@@ -3,8 +3,8 @@
33
/**
44
* Encrypt given text using caesar cipher.
55
*
6-
* @param string text text to be encrypted
7-
* @param int shift number of shifts to be applied
6+
* @param string $text text text to be encrypted
7+
* @param int $shift shift number of shifts to be applied
88
* @return string new encrypted text
99
*/
1010
function encrypt(string $text, int $shift): string
@@ -27,8 +27,8 @@ function encrypt(string $text, int $shift): string
2727

2828
/**
2929
* Decrypt given text using caesar cipher.
30-
* @param string text text to be decrypted
31-
* @param int shift number of shifts to be applied
30+
* @param string $text text text to be decrypted
31+
* @param int $shift shift number of shifts to be applied
3232
* @return string new decrypted text
3333
*/
3434
function decrypt(string $text, int $shift): string

‎Ciphers/MonoAlphabeticCipher.php

+34-32
Original file line numberDiff line numberDiff line change
@@ -1,32 +1,34 @@
1-
<?php
2-
// A mono-alphabetic cipher is a simple substitution cipher
3-
// https://www.101computing.net/mono-alphabetic-substitution-cipher/
4-
5-
function monoAlphabeticCipher($key, $alphabet, $text){
6-
7-
$cipherText = ''; // the cipher text (can be decrypted and encrypted)
8-
9-
if ( strlen($key) != strlen($alphabet) ) { return false; } // check if the text length matches
10-
$text = preg_replace('/[0-9]+/', '', $text); // remove all the numbers
11-
12-
for( $i = 0; $i < strlen($text); $i++ ){
13-
$index = strripos( $alphabet, $text[$i] );
14-
if( $text[$i] == " " ){ $cipherText .= " "; }
15-
else{ $cipherText .= ( ctype_upper($text[$i]) ? strtoupper($key[$index]) : $key[$index] ); }
16-
}
17-
return $cipherText;
18-
}
19-
20-
function maEncrypt($key, $alphabet, $text){
21-
22-
return monoAlphabeticCipher($key, $alphabet, $text);
23-
24-
}
25-
26-
function maDecrypt($key, $alphabet, $text){
27-
28-
return monoAlphabeticCipher($alphabet, $key, $text);
29-
30-
}
31-
32-
?>
1+
<?php
2+
3+
// A mono-alphabetic cipher is a simple substitution cipher
4+
// https://www.101computing.net/mono-alphabetic-substitution-cipher/
5+
6+
function monoAlphabeticCipher($key, $alphabet, $text)
7+
{
8+
$cipherText = ''; // the cipher text (can be decrypted and encrypted)
9+
10+
if (strlen($key) != strlen($alphabet)) {
11+
return false;
12+
} // check if the text length matches
13+
$text = preg_replace('/[0-9]+/', '', $text); // remove all the numbers
14+
15+
for ($i = 0; $i < strlen($text); $i++) {
16+
$index = strripos($alphabet, $text[$i]);
17+
if ($text[$i] == " ") {
18+
$cipherText .= " ";
19+
} else {
20+
$cipherText .= ( ctype_upper($text[$i]) ? strtoupper($key[$index]) : $key[$index] );
21+
}
22+
}
23+
return $cipherText;
24+
}
25+
26+
function maEncrypt($key, $alphabet, $text)
27+
{
28+
return monoAlphabeticCipher($key, $alphabet, $text);
29+
}
30+
31+
function maDecrypt($key, $alphabet, $text)
32+
{
33+
return monoAlphabeticCipher($alphabet, $key, $text);
34+
}

‎Ciphers/MorseCode.php

+5-3
Original file line numberDiff line numberDiff line change
@@ -3,8 +3,9 @@
33
/**
44
* Encode text to Morse Code.
55
*
6-
* @param string text to encode
6+
* @param string $text text to encode
77
* @return string encoded text
8+
* @throws \Exception
89
*/
910
function encode(string $text): string
1011
{
@@ -57,13 +58,14 @@ function encode(string $text): string
5758
throw new \Exception("Invalid character: $c");
5859
}
5960
}
60-
substr_replace($encodedText ,"", -1); // Removes trailing space
61+
substr_replace($encodedText, "", -1); // Removes trailing space
6162
return $encodedText;
6263
}
6364

6465
/**
6566
* Decode Morse Code to text.
66-
* @param string text to decode
67+
* @param string $text text to decode
68+
* @throws \Exception
6769
*/
6870
function decode(string $text): string
6971
{

‎Ciphers/XORCipher.php

+2-4
Original file line numberDiff line numberDiff line change
@@ -7,18 +7,16 @@
77
* character with the key.
88
* The key is repeated until it is the same length as the input.
99
*
10-
* @param string $input The input string.
10+
* @param string $input_string The input string.
1111
* @param string $key The key to use.
1212
* @return string The encrypted string.
1313
*/
1414
function xorCipher(string $input_string, string $key)
1515
{
16-
1716
$key_len = strlen($key);
1817
$result = array();
1918

20-
for ($idx = 0; $idx < strlen($input_string); $idx++)
21-
{
19+
for ($idx = 0; $idx < strlen($input_string); $idx++) {
2220
array_push($result, $input_string[$idx] ^ $key[$idx % $key_len]);
2321
}
2422

‎Conversions/BinaryToDecimal.php

+2-1
Original file line numberDiff line numberDiff line change
@@ -11,8 +11,9 @@
1111
* (2 + 0) base 10
1212
* 2 base 10
1313
*
14-
* @param string $binaryNumber
14+
* @param string $binaryNumber
1515
* @return int
16+
* @throws \Exception
1617
*/
1718
function binaryToDecimal($binaryNumber)
1819
{

‎Conversions/DecimalToBinary.php

+2-1
Original file line numberDiff line numberDiff line change
@@ -5,8 +5,9 @@
55
* submitted Decimal Number to
66
* Binary Number.
77
*
8-
* @param string $decimalNumber
8+
* @param string $decimalNumber
99
* @return string
10+
* @throws \Exception
1011
*/
1112
function decimalToBinary($decimalNumber)
1213
{

‎Conversions/OctalToDecimal.php

+4-2
Original file line numberDiff line numberDiff line change
@@ -10,8 +10,9 @@
1010
* (1 * (8 ^ 1) + 0 * (8 ^ 0)) base 10
1111
* (8 + 0) base 10
1212
* 9 base 10
13-
* @param string $octalNumber
13+
* @param string $octalNumber
1414
* @return int
15+
* @throws \Exception
1516
*/
1617
function octalToDecimal($octalNumber)
1718
{
@@ -34,8 +35,9 @@ function octalToDecimal($octalNumber)
3435
* submitted Decimal Number to
3536
* Octal Number.
3637
*
37-
* @param string $decimalNumber
38+
* @param string $decimalNumber
3839
* @return string
40+
* @throws \Exception
3941
*/
4042
function decimalToOctal($decimalNumber)
4143
{

‎Conversions/SpeedConversion.php

+9-8
Original file line numberDiff line numberDiff line change
@@ -14,25 +14,26 @@
1414
* kn -> 1 knot which is equal to 1 nautical mile (1852 km/h)
1515
* The conversion is made using kilometers as base
1616
*
17-
* @param float $speed
18-
* @param string $unitFrom
19-
* @param string $unitTo
20-
* @return int
17+
* @param float $speed
18+
* @param string $unitFrom
19+
* @param string $unitTo
20+
* @return float
21+
* @throws \Exception
2122
*/
2223
function convertSpeed(float $speed, string $unitFrom, string $unitTo)
2324
{
2425
$speedUnitsFrom = [
2526
'mph' => 1.609344,
2627
'km/h' => 1,
27-
'm/s'=> 3.6,
28-
'ft/s'=> 1.097,
28+
'm/s' => 3.6,
29+
'ft/s' => 1.097,
2930
'kn' => 1.852,
3031
];
3132
$speedUnitsTo = [
3233
'mph' => 0.6213712,
3334
'km/h' => 1,
34-
'm/s'=> 0.277778,
35-
'ft/s'=> 0.911344,
35+
'm/s' => 0.277778,
36+
'ft/s' => 0.911344,
3637
'kn' => 0.539957,
3738
];
3839
$availableUnits = array_keys($speedUnitsFrom);

‎DataStructures/SinglyLinkedList.php

+1-5
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,12 @@
11
<?php
2+
23
/**
34
* Singly Linked List
45
*/
5-
66
class SinglyLinkedList
77
{
88
public ?SinglyLinkedList $next = null;
99
public $data;
10-
1110
public function __construct($data)
1211
{
1312
$this->data = $data;
@@ -16,7 +15,6 @@ public function __construct($data)
1615
public function append($data): void
1716
{
1817
$current = $this;
19-
2018
while ($current instanceof SinglyLinkedList && isset($current->next)) {
2119
$current = $current->next;
2220
}
@@ -27,15 +25,13 @@ public function append($data): void
2725
public function delete($data): SinglyLinkedList
2826
{
2927
$current = $this;
30-
3128
if ($current->data == $data) {
3229
return $current->next;
3330
}
3431

3532
while ($current instanceof SinglyLinkedList && isset($current->next)) {
3633
if ($current->next->data === $data) {
3734
$current->next = $current->next->next;
38-
3935
return $this;
4036
}
4137

‎Graphs/BreadthFirstSearch.php

+7-6
Original file line numberDiff line numberDiff line change
@@ -3,21 +3,22 @@
33
/**
44
* Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property.
55
* (https://en.wikipedia.org/wiki/Breadth-first_search).
6-
*
7-
* This is a non recursive implementation.
8-
*
6+
*
7+
* This is a non-recursive implementation.
8+
*
99
* References:
1010
* https://cp-algorithms.com/graph/breadth-first-search.html
11-
*
11+
*
1212
* https://the-algorithms.com/algorithm/depth-first-search?lang=python
13-
*
13+
*
1414
* @author Aryansh Bhargavan https://github.com/aryanshb
1515
* @param array $adjList An array representing the grapth as an Adjacent List
1616
* @param int|string $start The starting vertex
1717
* @return bool if path between start and end vertex exists
1818
*/
1919

20-
function bfs($adjList, $start, $end, $yes = false){
20+
function bfs($adjList, $start, $end, $yes = false)
21+
{
2122
$visited = [];
2223
$queue = [$start];
2324
while (!empty($queue)) {

‎Graphs/DepthFirstSearch.php

+9-8
Original file line numberDiff line numberDiff line change
@@ -1,20 +1,20 @@
11
<?php
22

33
/**
4-
* The Depth-first Search is an algorithm used for traversing or searching trees or graphs
4+
* The Depth-first Search is an algorithm used for traversing or searching trees or graphs
55
* (https://en.wikipedia.org/wiki/Depth-first_search).
6-
*
7-
* This is a non recursive implementation.
8-
*
6+
*
7+
* This is a non-recursive implementation.
8+
*
99
* References:
1010
* https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/
11-
*
11+
*
1212
* https://the-algorithms.com/algorithm/depth-first-search?lang=python
13-
*
13+
*
1414
* @author Andre Alves https://github.com/andremralves
1515
* @param array $adjList An array representing the grapth as an Adjacent List
1616
* @param int|string $start The starting vertex
17-
* @return array The visited vertices
17+
* @return array The visited vertices
1818
*/
1919
function dfs($adjList, $start)
2020
{
@@ -27,8 +27,9 @@ function dfs($adjList, $start)
2727

2828
// Checks each adjacent vertex of $v and add to the stack if not visited
2929
foreach (array_reverse($adjList[$v]) as $adj) {
30-
if (!array_key_exists($adj, $visited))
30+
if (!array_key_exists($adj, $visited)) {
3131
array_push($stack, $adj);
32+
}
3233
}
3334
}
3435
return array_keys($visited);

‎Maths/AbsoluteMax.php

+3-1
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,14 @@
11
<?php
2+
23
/**
34
* This function calculates
45
* Absolute max values from
56
* the different numbers
67
* provided
78
*
8-
* @param decimal $numbers A variable sized number input
9+
* @param decimal $numbers A variable sized number input
910
* @return decimal $absoluteMax Absolute max value
11+
* @throws \Exception
1012
*/
1113
function absolute_max(...$numbers)
1214
{

‎Maths/AbsoluteMin.php

+3-1
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,14 @@
11
<?php
2+
23
/**
34
* This function calculates
45
* Absolute min values from
56
* the different numbers
67
* provided.
78
*
8-
* @param decimal $numbers A variable sized number input
9+
* @param decimal $numbers A variable sized number input
910
* @return decimal $absoluteMin Absolute min value
11+
* @throws \Exception
1012
*/
1113
function absolute_min(...$numbers)
1214
{

‎Maths/ArmstrongNumber.php

+11-12
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
11
<?php
2+
23
/**
34
* This function checks if given number is Armstrong
45
* e.g. 153
@@ -7,16 +8,14 @@
78
*/
89
function isNumberArmstrong(int $input): bool
910
{
10-
$arr = array_map('intval', str_split($input));
11-
$sumOfCubes = 0;
12-
foreach ($arr as $num) {
13-
$sumOfCubes += $num * $num * $num;
14-
}
15-
if ($sumOfCubes == $input) {
16-
return true;
17-
}
18-
else {
19-
return false;
20-
}
11+
$arr = array_map('intval', str_split($input));
12+
$sumOfCubes = 0;
13+
foreach ($arr as $num) {
14+
$sumOfCubes += $num * $num * $num;
15+
}
16+
if ($sumOfCubes == $input) {
17+
return true;
18+
} else {
19+
return false;
20+
}
2121
}
22-
?>

0 commit comments

Comments
 (0)