code style formatting

Author: manigandham

src/Hashids.net/Hashids.cs

@@ -54,14 +54,10 @@ public Hashids(
             string alphabet = DEFAULT_ALPHABET,
             string seps = DEFAULT_SEPS)
         {
-            if (salt == null)
-                throw new ArgumentNullException(nameof(salt));
-            if (string.IsNullOrWhiteSpace(alphabet))
-                throw new ArgumentNullException(nameof(alphabet));
-            if (minHashLength < 0)
-                throw new ArgumentOutOfRangeException(nameof(minHashLength), "Value must be zero or greater.");
-            if (string.IsNullOrWhiteSpace(seps))
-                throw new ArgumentNullException(nameof(seps));
+            if (salt == null) throw new ArgumentNullException(nameof(salt));
+            if (minHashLength < 0) throw new ArgumentOutOfRangeException(nameof(minHashLength), "Value must be zero or greater.");
+            if (string.IsNullOrWhiteSpace(alphabet)) throw new ArgumentNullException(nameof(alphabet));
+            if (string.IsNullOrWhiteSpace(seps)) throw new ArgumentNullException(nameof(seps));
 
             _salt = salt.Trim().ToCharArray();
             _minHashLength = minHashLength;
@@ -75,26 +71,18 @@ private static (char[] alphabetChars, char[] sepChars, char[] guardChars) InitCh
             var guardChars = new char[0];
 
             if (alphabetChars.Length < MIN_ALPHABET_LENGTH)
-            {
                 throw new ArgumentException($"Alphabet must contain at least {MIN_ALPHABET_LENGTH:N0} unique characters.", paramName: nameof(alphabet));
-            }
 
             // seperator characters can only be chosen from the characters in the alphabet
             if (sepChars.Length > 0)
-            {
                 sepChars = sepChars.Intersect(alphabetChars).ToArray();
-            }
 
             // once separator characters are chosen, they must be removed from the alphabet availble for hash generation
             if (sepChars.Length > 0)
-            {
                 alphabetChars = alphabetChars.Except(sepChars).ToArray();
-            }
 
             if (alphabetChars.Length < (MIN_ALPHABET_LENGTH - 6))
-            {
                 throw new ArgumentException($"Alphabet must contain at least {MIN_ALPHABET_LENGTH:N0} unique characters that are also not present in .", paramName: nameof(alphabet));
-            }
 
             ConsistentShuffle(alphabet: sepChars, alphabetLength: sepChars.Length, salt: salt, saltLength: salt.Length);
 
@@ -103,9 +91,7 @@ private static (char[] alphabetChars, char[] sepChars, char[] guardChars) InitCh
                 var sepsLength = (int)Math.Ceiling((float)alphabetChars.Length / SEP_DIV);
 
                 if (sepsLength == 1)
-                {
                     sepsLength = 2;
-                }
 
                 if (sepsLength > sepChars.Length)
                 {
@@ -268,7 +254,8 @@ public virtual string EncodeHex(string hex)
                 return string.Empty;
 
             var matches = hexSplitter.Value.Matches(hex);
-            if (matches.Count == 0) return string.Empty;
+            if (matches.Count == 0)
+                return string.Empty;
 
             var numbers = new long[matches.Count];
             for (int i = 0; i < numbers.Length; i++)
@@ -295,11 +282,8 @@ public virtual string DecodeHex(string hash)
             foreach (var number in numbers)
             {
                 var s = number.ToString("X");
-
                 for (var i = 1; i < s.Length; i++)
-                {
                     builder.Append(s[i]);
-                }
             }
 
             var result = builder.ToString();
@@ -312,21 +296,19 @@ private string GenerateHashFrom(ReadOnlySpan<long> numbers)
             if (numbers.Length == 0)
                 return string.Empty;
 
-            foreach (var item in numbers)
-                if (item < 0)
+            foreach (var num in numbers)
+                if (num < 0)
                     return string.Empty;
 
             long numbersHashInt = 0;
             for (var i = 0; i < numbers.Length; i++)
-            {
                 numbersHashInt += numbers[i] % (i + 100);
-            }
 
             var builder = _sbPool.Get();
-
             char[] shuffleBuffer = null;
-            var alphabet = _alphabet.CopyPooled();
             var hashBuffer = ArrayPool<char>.Shared.Rent(MaxNumberHashLength);
+            var alphabet = _alphabet.CopyPooled();
+
             try
             {
                 var lottery = alphabet[numbersHashInt % _alphabet.Length];
@@ -341,17 +323,13 @@ private string GenerateHashFrom(ReadOnlySpan<long> numbers)
                     var number = numbers[i];
 
                     if (length > 0)
-                    {
                         Array.Copy(alphabet, 0, shuffleBuffer, startIndex, length);
-                    }
 
                     ConsistentShuffle(alphabet, _alphabet.Length, shuffleBuffer, _alphabet.Length);
                     var hashLength = BuildReversedHash(number, alphabet, hashBuffer);
 
                     for (var j = hashLength - 1; j > -1; j--)
-                    {
                         builder.Append(hashBuffer[j]);
-                    }
 
                     if (i + 1 < numbers.Length)
                     {
@@ -486,9 +464,7 @@ private long[] GetNumbersFrom(string hash)
             }
 
             if (EncodeLong(result) == hash)
-            {
                 return result;
-            }
 
             return Array.Empty<long>();
         }