Remarks completed.

Author: Berrysoft

doc/Berrysoft.Documents/Berrysoft.Documents.shfbproj

@@ -56,6 +56,7 @@
       <NamespaceSummaryItem name="Berrysoft.Tsinghua.Net" isDocumented="True">A namespace contains classes to connect to Tsinghua campus network.</NamespaceSummaryItem>
       <NamespaceSummaryItem name="Berrysoft.Data" isDocumented="True">A namespace of some complex data structure.</NamespaceSummaryItem>
       <NamespaceSummaryItem name="Berrysoft.Unsafe" isDocumented="True">A namespace comtains unsafe or unmanaged structures and methods. All members support safe languages (like Visual Basic).</NamespaceSummaryItem>
+      <NamespaceSummaryItem name="Berrysoft.Console" isDocumented="True">A namespace comtains classes to parse settings files and write simple logs.</NamespaceSummaryItem>
     </NamespaceSummaries>
     <NamingMethod>MemberName</NamingMethod>
     <VisibleItems>Attributes, ExplicitInterfaceImplementations, InheritedMembers, InheritedFrameworkMembers, Protected, ProtectedInternalAsProtected, NonBrowsable</VisibleItems>

src/Berrysoft.Data/BinaryTree.cs

@@ -58,12 +58,16 @@ int GetDepthInternal(IBinaryTree<T> root, int depth)
         /// <summary>
         /// Get an <see cref="IEnumerable{T}"/> with pre order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with pre order.</returns>
         public static IEnumerable<IBinaryTree<T>> AsPreOrderEnumerable<T>(this IBinaryTree<T> tree)
             => AsPreOrderEnumerableIterator(tree ?? throw ExceptionHelper.ArgumentNull(nameof(tree)));
         /// <summary>
         /// Get an iterator with pre order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with pre order.</returns>
         private static IEnumerable<IBinaryTree<T>> AsPreOrderEnumerableIterator<T>(IBinaryTree<T> tree)
         {
@@ -86,12 +90,16 @@ private static IEnumerable<IBinaryTree<T>> AsPreOrderEnumerableIterator<T>(IBina
         /// <summary>
         /// Get an <see cref="IEnumerable{T}"/> with in order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with in order.</returns>
         public static IEnumerable<IBinaryTree<T>> AsInOrderEnumerable<T>(this IBinaryTree<T> tree)
             => AsInOrderEnumerableIterator(tree ?? throw ExceptionHelper.ArgumentNull(nameof(tree)));
         /// <summary>
         /// Get an iterator with in order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with in order.</returns>
         private static IEnumerable<IBinaryTree<T>> AsInOrderEnumerableIterator<T>(IBinaryTree<T> tree)
         {
@@ -115,12 +123,16 @@ private static IEnumerable<IBinaryTree<T>> AsInOrderEnumerableIterator<T>(IBinar
         /// <summary>
         /// Get an <see cref="IEnumerable{T}"/> with post order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with post order.</returns>
         public static IEnumerable<IBinaryTree<T>> AsPostOrderEnumerable<T>(this IBinaryTree<T> tree)
             => AsPostOrderEnumerableIterator(tree ?? throw ExceptionHelper.ArgumentNull(nameof(tree)));
         /// <summary>
         /// Get an iterator with post order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with post order.</returns>
         private static IEnumerable<IBinaryTree<T>> AsPostOrderEnumerableIterator<T>(IBinaryTree<T> tree)
         {
@@ -152,12 +164,16 @@ private static IEnumerable<IBinaryTree<T>> AsPostOrderEnumerableIterator<T>(IBin
         /// <summary>
         /// Get an <see cref="IEnumerable{T}"/> with level order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with level order.</returns>
         public static IEnumerable<IBinaryTree<T>> AsLevelOrderEnumerable<T>(this IBinaryTree<T> tree)
             => AsLevelOrderEnumerableIterator(tree ?? throw ExceptionHelper.ArgumentNull(nameof(tree)));
         /// <summary>
         /// Get an iterator with level order.
         /// </summary>
+        /// <typeparam name="T">The type of value the node contains.</typeparam>
+        /// <param name="tree">The tree.</param>
         /// <returns>An <see cref="IEnumerable{T}"/> with level order.</returns>
         private static IEnumerable<IBinaryTree<T>> AsLevelOrderEnumerableIterator<T>(IBinaryTree<T> tree)
         {
@@ -335,17 +351,25 @@ public BinaryTree<T> RightChild
                 _right = value;
             }
         }
-
+        /// <summary>
+        /// Left child of the node.
+        /// </summary>
         IBinaryTree<T> IBinaryTree<T>.LeftChild
         {
             get => LeftChild;
             set => LeftChild = (BinaryTree<T>)value;
         }
+        /// <summary>
+        /// Right child of the node.
+        /// </summary>
         IBinaryTree<T> IBinaryTree<T>.RightChild
         {
             get => RightChild;
             set => RightChild = (BinaryTree<T>)value;
         }
+        /// <summary>
+        /// Parent of the node, null when the node is root node of a tree.
+        /// </summary>
         ITreeBase<T> ITreeBase<T>.Parent => Parent;
         /// <summary>
         /// Returns an enumerator that iterates through the <see cref="BinaryTree{T}"/>.

src/Berrysoft.Data/Map.cs

@@ -270,14 +270,20 @@ public Map(IMap<TKey1, TKey2> map, IEqualityComparer<TKey1> comparer1, IEquality
         /// <value><see langword="false"/></value>
         public bool IsReadOnly => false;
         /// <summary>
-        /// Gets an <see cref="ICollection{TKey1}"/> containing the keys in the <see cref="Map{TKey1, TKey2}"/>.
+        /// Gets an <see cref="Dictionary{TKey1, TKey2}.KeyCollection"/> containing the keys in the <see cref="Map{TKey1, TKey2}"/>.
         /// </summary>
         public Dictionary<TKey1, TKey2>.KeyCollection Keys1 => dic.Keys;
+        /// <summary>
+        /// Gets an <see cref="ICollection{TKey1}"/> containing the keys in the <see cref="Map{TKey1, TKey2}"/>.
+        /// </summary>
         ICollection<TKey1> IMap<TKey1, TKey2>.Keys1 => Keys1;
         /// <summary>
-        /// Gets an <see cref="ICollection{TKey2}"/> containing the keys in the <see cref="Map{TKey1, TKey2}"/>.
+        /// Gets an <see cref="Dictionary{TKey2, TKey1}.KeyCollection"/> containing the keys in the <see cref="Map{TKey1, TKey2}"/>.
         /// </summary>
         public Dictionary<TKey2, TKey1>.KeyCollection Keys2 => rev.Keys;
+        /// <summary>
+        /// Gets an <see cref="ICollection{TKey2}"/> containing the keys in the <see cref="Map{TKey1, TKey2}"/>.
+        /// </summary>
         ICollection<TKey2> IMap<TKey1, TKey2>.Keys2 => Keys2;
         /// <summary>
         /// Adds the specified key1 and key2.

src/Berrysoft.Data/Tree.cs

@@ -264,6 +264,9 @@ public T Value
         /// The count of children.
         /// </summary>
         public int Count => _children.Count;
+        /// <summary>
+        /// Parent of the node, null when the node is root node of a tree.
+        /// </summary>
         ITreeBase<T> ITreeBase<T>.Parent => Parent;
         /// <summary>
         /// Add a child.