Skip to content

Remove superfluous nodes #9369

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 4, 2023
Merged

Remove superfluous nodes #9369

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 3 additions & 5 deletions xml/Microsoft.Extensions.Primitives/StringSegment.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -315,12 +315,10 @@
<ReturnType>System.String</ReturnType>
</ReturnValue>
<Docs>
<summary>Gets the <see cref="T:System.String" /> buffer for this <see cref="T:Microsoft.Extensions.Primitives.StringSegment" />.</summary>
<value>The <see cref="T:System.String" /> buffer for this <see cref="T:Microsoft.Extensions.Primitives.StringSegment" />.</value>
<summary>Gets the value of this segment as a string.</summary>
<value>The string buffer for this segment.</value>
<remarks>To be added.</remarks>
</Docs>
<summary>Gets the value of this segment as a <see cref="T:System.String" />.</summary>
<value>The value of this segment as a <see cref="T:System.String" />.</value>
</Member>
<Member MemberName="Compare">
<MemberSignature Language="C#" Value="public static int Compare (Microsoft.Extensions.Primitives.StringSegment a, Microsoft.Extensions.Primitives.StringSegment b, StringComparison comparisonType);" />
Expand Down Expand Up @@ -723,7 +721,7 @@
<summary>Returns the hash code for this instance.</summary>
<returns>A 32-bit signed integer that is the hash code for this instance.</returns>
<remarks>The returned hash code is suitable for use in hashing algorithms and data structures, for example, a hash table.

This method is expensive since it allocates on every call. However, the allocation is required to retain any behavior (such as hash code randomization) that <see cref="M:System.String.GetHashCode" /> has.</remarks>
</Docs>
</Member>
Expand Down