Upgrades BtnFind

Author: inmem

FriendlyCSharp.Databases/BTreeN/FcsBTreeN.cs

@@ -446,13 +446,16 @@ public virtual void BtnDeleteAll(bool bRunGC)
             btnFast = default(KeyValueFast);
           bNullResult = new bool?(true);
         }
-        if (kvPage.kvPageNextRight == null)
-          QQ = null;
-        else if (high > 0)
-          QQ = kvPage.kvPageNextRight[high];       // right
         else
-          QQ = kvPage.kvPageNextRight[0];          // left
-        bNullResult = _BtnFind(ref key, out value, QQ, out btnFast);
+        {
+          if (kvPage.kvPageNextRight == null)
+            QQ = null;
+          else if (high > 0)
+            QQ = kvPage.kvPageNextRight[high];       // right
+          else
+            QQ = kvPage.kvPageNextRight[0];          // left
+          bNullResult = _BtnFind(ref key, out value, QQ, out btnFast);
+        }
       }
       return bNullResult;
     }

FriendlyCSharp.Databases/BTreeN/FcsDuplValueFastBTreeN.cs

@@ -436,13 +436,16 @@ public virtual void BtnDeleteAll(bool bRunGC)
             btnFast = default(DuplValueFast);
           bNullResult = new bool?(true);
         }
-        if (kvPage.kvPageNextRight == null)
-          QQ = null;
-        else if (high <= 0)
-          QQ = kvPage.kvPageNextRight[0];        // left
         else
-          QQ = kvPage.kvPageNextRight[high];       // right
-        bNullResult = _BtnFind(ref key, out value, QQ, out btnFast);
+        {
+          if (kvPage.kvPageNextRight == null)
+            QQ = null;
+          else if (high <= 0)
+            QQ = kvPage.kvPageNextRight[0];        // left
+          else
+            QQ = kvPage.kvPageNextRight[high];       // right
+          bNullResult = _BtnFind(ref key, out value, QQ, out btnFast);
+        }
       }
       return bNullResult;
     }

FriendlyCSharp.Databases/BTreeN/FcsKeyFastBTreeN.cs

@@ -456,13 +456,16 @@ public virtual void BtnDeleteAll(bool bRunGC)
             btnFast = default(KeyFast);
           bNullResult = new bool?(true);
         }
-        if (keyPage.kvPageNextRight == null)
-          QQ = null;
-        else if (high > 0)
-          QQ = keyPage.kvPageNextRight[high];         // right
         else
-          QQ = keyPage.kvPageNextRight[0];            // left
-        bNullResult = _BtnFind(ref key, QQ, out btnFast, findCmp);
+        {
+          if (keyPage.kvPageNextRight == null)
+            QQ = null;
+          else if (high > 0)
+            QQ = keyPage.kvPageNextRight[high];         // right
+          else
+            QQ = keyPage.kvPageNextRight[0];            // left
+          bNullResult = _BtnFind(ref key, QQ, out btnFast, findCmp);
+        }
       }
       return bNullResult;
     }

FriendlyCSharp.Databases/FriendlyCSharp.Databases.csproj

@@ -13,14 +13,15 @@
 
 The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data.
 </Description>
-    <PackageReleaseNotes>Upgrades with news NETStandard.Library 2.0.2 - FcsKeyFastBTreeN and FcsInmemStream are serialized by binary formatting</PackageReleaseNotes>
+    <PackageReleaseNotes>Upgrades BtnFind</PackageReleaseNotes>
   </PropertyGroup>
 
   <PropertyGroup>
     <TargetFramework>netstandard2.0</TargetFramework>
-    <Version>2.0.2</Version>
-    <AssemblyVersion>2.0.2.0</AssemblyVersion>
-    <FileVersion>2.0.2.0</FileVersion>
+    <Version>2.0.3</Version>
+    <AssemblyVersion>2.0.3.0</AssemblyVersion>
+    <FileVersion>2.0.3.0</FileVersion>
+    <PackageRequireLicenseAcceptance>false</PackageRequireLicenseAcceptance>
   </PropertyGroup>
 
   <PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|AnyCPU'">

FriendlyCSharp.Databases/Storage/FcsInmemStream.cs

@@ -743,9 +743,9 @@ public virtual int ReadNoLock(TImsId offset, T[] aValue, TImsId[] aDel, int inde
       {
         if (aValue == null)
           throw new ArgumentOutOfRangeException(nameof(aValue));
-        if ((index < 0) || (index >= aValue.Length) || (index >= aDel.Length))
+        if ((index < 0) || (index >= aValue.Length))
           throw new ArgumentOutOfRangeException(nameof(index));
-        if ((count == 0) || (count + index > aValue.Length) || (count + index > aDel.Length))
+        if ((count == 0) || (count + index > aValue.Length))
           throw new ArgumentOutOfRangeException(nameof(count));
       }