dotnet format, readme update, version 1.6.0 release

Author: manigandham

README.md

@@ -283,6 +283,12 @@ var hex = hashids.DecodeHex("kRNrpKlJ");
 
 ## Changelog
 
+**v.1.6.0**
+
+-   PR [#66](https://github.com/ullmark/hashids.net/pull/66) - Fixed invalid constant bug.
+-   PR [#67](https://github.com/ullmark/hashids.net/pull/67) and PR [#73](https://github.com/ullmark/hashids.net/pull/73) - Update and cleanup tests and constants.
+-   PR [#65](https://github.com/ullmark/hashids.net/pull/65) - Improved performance and reduced allocations for single number decode.
+
 **v1.5.0**
 
 -   PR [#59](https://github.com/ullmark/hashids.net/pull/59) and PR [#61](https://github.com/ullmark/hashids.net/pull/61) - Project clean up and removal of `net461` target.

src/Hashids.net/Hashids.cs

@@ -521,11 +521,11 @@ private long GetNumberFrom(string hash)
 
             var guardedHash = hash.AsSpan();
             var (count, ranges) = Split(guardedHash, _guards);
-            
+
             var unguardedIndex = count is 3 or 2 ? 1 : 0;
             var (start, offset) = ranges[unguardedIndex];
             var hashBreakdown = guardedHash.Slice(start, offset);
-            
+
             ArrayPool<(int, int)>.Shared.Return(ranges);
 
             var lottery = hashBreakdown[0];
@@ -540,10 +540,10 @@ private long GetNumberFrom(string hash)
             Span<char> buffer = _alphabet.Length < 512 ? stackalloc char[_alphabet.Length] : new char[_alphabet.Length];
             buffer[0] = lottery;
             _salt.AsSpan().Slice(0, Math.Min(_salt.Length, _alphabet.Length - 1)).CopyTo(buffer.Slice(1));
-            
+
             var startIndex = 1 + _salt.Length;
             var length = _alphabet.Length - startIndex;
-            
+
             if (length > 0)
                 alphabet.Slice(0, length).CopyTo(buffer.Slice(startIndex));
 
@@ -665,13 +665,13 @@ private static (int count, (int, int)[] ranges) Split(ReadOnlySpan<char> line, R
                     indexStart++;
                     nextSeparatorIndex = line.Slice(indexStart).IndexOfAny(separators);
                 }
-                
+
                 isLastLoop = nextSeparatorIndex == -1;
                 if (isLastLoop)
                 {
                     nextSeparatorIndex = line.Length - indexStart;
                 }
-                
+
                 var slice = line.Slice(indexStart, nextSeparatorIndex);
                 if (slice.IsEmpty)
                 {

src/Hashids.net/Hashids.net.csproj

@@ -3,8 +3,8 @@
 	<PropertyGroup>
 		<Title>Hashids.net</Title>
 		<Authors>Markus Ullmark</Authors>
-		<Version>1.5.0</Version>
-		<PackageVersion>1.5.0</PackageVersion>
+		<Version>1.6.0</Version>
+		<PackageVersion>1.6.0</PackageVersion>
 		<Description>Generate YouTube-like hashes from one or many numbers. Use hashids when you do not want to expose your database ids to the user.</Description>
 		<PackageIconUrl>https://raw.githubusercontent.com/ullmark/hashids.net/master/hashids.png</PackageIconUrl>
 		<PackageIcon>hashids.png</PackageIcon>

test/Hashids.net.benchmark/HashBenchmarks.cs

@@ -51,7 +51,7 @@ public void SingleNumber()
             var encoded = _hashids.Encode(5);
             var encodeLong = _hashids.EncodeLong(5);
         }
-        
+
         [Benchmark]
         public long[] DecodeNumbers()
         {
@@ -63,7 +63,7 @@ public long DecodeSingleNumber()
         {
             return _hashids.DecodeSingleLong(fiveEncoded);
         }
-        
+
         [Benchmark]
         public void RoundtripSingle()
         {