Update README.md

Author: FriendlyCSharp

Diff for: README.md

@@ -1,23 +1,23 @@
-# [FriendlyCSharp.Databases](https://github.com/FriendlyCSharp/Databases)
+# FriendlyCSharp.Databases
 
 A library of cross platform C# data structures. Generic [**B-tree**](https://en.wikipedia.org/wiki/B-tree) written in C#, which can be replaced with NoSQL database stored in the memory of discharge requirements in real-time (*Firebase, Redis Cache, SAP HANA, Exadata, OLTP, etc.*). Basic information B-tree can be found in the book N. Wirth, Algorithms + data structures = programs and on Wikipedia, namely:
 >"*In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. 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. B-trees are a good example of a data structure for external memory. It is commonly used in databases and filesystems. (...) Rudolf Bayer and Ed McCreight invented the B-tree while working at Boeing Research Labs in 1971 (Bayer & McCreight 1972), but they did not explain what, if anything, the B stands for.*" - [Wikipedia](https://en.wikipedia.org/wiki/B-tree).
 
  
 ## B-Tree generic class
-#### [FcsBTreeN<TKey, TValue>](FcsBTreeN.cs)
+#### [FcsBTreeN<TKey, TValue>](https://github.com/inmem/FriendlyCSharp.Databases)
    + `Methods:` BtnCompares, BtnUpdates, BtnAdd, BtnDeleteAll, BtnFind, BtnFirst, BtnLast, BtnNext, BtnPrev, BtnSearch, BtnSearchPrev, BtnUpdate and BtnUsedKeys.
-#### [FcsFastBTreeN<TKey, TValue>](FcsFastBTreeN.cs)
+#### [FcsFastBTreeN<TKey, TValue>](https://github.com/inmem/FriendlyCSharp.Databases)
    + `Methods:` BtnCompares, BtnUpdates, BtnAdd, BtnDeleteAll, BtnFind, BtnFirst, BtnLast, BtnNext, BtnPrev, BtnSearch, BtnSearchPrev, BtnUpdate and BtnUsedKeys.
    + `Methods:` BtnFastFind, BtnFastFirst, BtnFastLast, BtnFastNext, BtnFastPrev, BtnFastSearch, BtnFastSearchPrev.
-#### [FcsLockBTreeN<TKey, TValue>](FcsLockBTreeN.cs)
+#### [FcsLockBTreeN<TKey, TValue>](https://github.com/inmem/FriendlyCSharp.Databases)
    + `Methods:` BtnCompares, BtnUpdates, BtnAdd, BtnDeleteAll, BtnFind, BtnFirst, BtnLast, BtnNext, BtnPrev, BtnSearch, BtnSearchPrev, BtnUpdate and BtnUsedKeys.
-#### [FcsFastLockBTreeN<TKey, TValue>](FcsFastLockBTreeN.cs)
+#### [FcsFastLockBTreeN<TKey, TValue>](https://github.com/inmem/FriendlyCSharp.Databases)
    + `Methods:` BtnCompares, BtnUpdates, BtnAdd, BtnDeleteAll, BtnFind, BtnFirst, BtnLast, BtnNext, BtnPrev, BtnSearch, BtnSearchPrev, BtnUpdate and BtnUsedKeys.
    + `Methods:` BtnFastFind, BtnFastFirst, BtnFastLast, BtnFastNext, BtnFastPrev, BtnFastSearch, BtnFastSearchPrev.
 
 ### Source code
-See the [Github](https://github.com/FriendlyCSharp/Databases).
+See the [Github](https://github.com/inmem/FriendlyCSharp.Databases).
 
 ### Performance
 A [**B-tree**](https://en.wikipedia.org/wiki/B-tree) of order m is a tree which satisfies the following properties:
@@ -41,15 +41,15 @@ A [**B-tree**](https://en.wikipedia.org/wiki/B-tree) of order m is a tree which
 ### Benchmark 
 The benchmark was configured as follows:
 * CPU: Intel Xeon E3-1245 @ 3.3 GHz;
-* Windows 10, 64bit, .NET Standard 1.2
+* Windows 10, 64bit, .NET Standard 1.1
 * 4x4GB DDR3 Kingston @ 1333 MHz
 
 >**Adding in a single thread:**
 
 | <int, uint> | sorted by key | iteration | total (ms) | one time (ns) | speed | RAM (MB) | occupied |
 | --- | :---: | ---: | ---: | ---: | :---: | :---: | :---: |
 | [**FcsFastBTreeN<...>**](#fcsfastbtreentkey-tvalue) | **Yes** | 10,000,000 | **6,185** | **619** | **100%** | **128** | **100%** |
-| SortedSet<...> | **Yes** | 10,000,000 | ~~ 19,443 ~~ | ~~ 1,944 ~~ | ~~ 32% ~~ | ~~ 458 ~~ | ~~ 358% ~~ |
+| SortedSet<...> | **Yes** | 10,000,000 | ~~ 19,443 ~~ | ~~ 1,944 ~~ | ~~ 32% ~~ | ~~ 458 ~~ |  358%  |
 | HashSet<...> | No | 10,000,000 | 2,017 | 202 | 307% | 229 | 179% |
 | Dictionary<...> | No | 10,000,000 | 1,378 | 138 | 449% | 229 | 179% |
 
@@ -65,20 +65,20 @@ The benchmark was configured as follows:
 
  
 ### MemoryStream generic class
-#### [FcsInmemStream<T>](FcsInmemStream.cs) \[where T : struct\]
+#### [FcsInmemStream<T>](https://github.com/inmem/FriendlyCSharp.Databases) \[where T : struct\]
    + `Methods:` Append, Close, Length, Open, Position, Read, Seek, Write.
 
 ### Source code
-See the [Github](https://github.com/FriendlyCSharp/Databases).
+See the [Github](https://github.com/inmem/FriendlyCSharp.Databases).
 
 ### Benchmark 
 The benchmark was configured as follows:
 * CPU: Intel Xeon E3-1245 @ 3.3 GHz;
-* Windows 10, 64bit, .NET Standard 1.2
+* Windows 10, 64bit, .NET Standard 1.1
 * 4x4 GB DDR3 Kingston @ 1333 MHz
 * Append, Read, Write (*cache 1,000 T*) and foreach (*cache 128 T*)
 
-| [FcsInmemStream<T>](FcsInmemStream.cs) | Append | Read | Write | foreach |
+| [FcsInmemStream<T>](https://github.com/inmem/FriendlyCSharp.Databases) | Append | Read | Write | foreach |
 | --- | ---: | ---: | ---: | ---: |
 | IOPS \[T =    8 Byte\] | **160**,000,000 | **800**,000,000 | **800**,000,000 | 80,000,000 |
 | IOPS \[T =   16 Byte\] | **140**,000,000 | **500**,000,000 | **400**,000,000 | 80,000,000 |