mirror of
https://github.com/MichaelGrafnetter/DSInternals
synced 2025-02-04 05:01:31 +00:00
166 lines
5.9 KiB
C#
Vendored
166 lines
5.9 KiB
C#
Vendored
//-----------------------------------------------------------------------
|
|
// <copyright file="StringCache.cs" company="Microsoft Corporation">
|
|
// Copyright (c) Microsoft Corporation.
|
|
// </copyright>
|
|
//-----------------------------------------------------------------------
|
|
|
|
namespace Microsoft.Isam.Esent.Interop
|
|
{
|
|
using System;
|
|
|
|
/// <summary>
|
|
/// Class that helps cache strings.
|
|
/// </summary>
|
|
internal static class StringCache
|
|
{
|
|
/// <summary>
|
|
/// Don't cache strings whose length is longer than this.
|
|
/// </summary>
|
|
private const int MaxLengthToCache = 128;
|
|
|
|
/// <summary>
|
|
/// Number of converted strings to hash.
|
|
/// </summary>
|
|
private const int NumCachedBoxedValues = 1031;
|
|
|
|
/// <summary>
|
|
/// Cached string values.
|
|
/// </summary>
|
|
private static readonly string[] CachedStrings = new string[NumCachedBoxedValues];
|
|
|
|
/// <summary>
|
|
/// Return the interned version of a string, or the original
|
|
/// string if it isn't interned.
|
|
/// </summary>
|
|
/// <param name="s">The string to try to intern.</param>
|
|
/// <returns>An interned copy of the string or the original string.</returns>
|
|
public static string TryToIntern(string s)
|
|
{
|
|
#if MANAGEDESENT_ON_WSA
|
|
// new Windows UI Core CLR does not support string interning.
|
|
return s;
|
|
#else
|
|
return string.IsInterned(s) ?? s;
|
|
#endif
|
|
}
|
|
|
|
/// <summary>
|
|
/// Convert a byte array to a string.
|
|
/// </summary>
|
|
/// <param name="value">The bytes to convert.</param>
|
|
/// <param name="startIndex">The starting index of the data to convert.</param>
|
|
/// <param name="count">The number of bytes to convert.</param>
|
|
/// <returns>A string converted from the data.</returns>
|
|
public static string GetString(byte[] value, int startIndex, int count)
|
|
{
|
|
unsafe
|
|
{
|
|
fixed (byte* data = value)
|
|
{
|
|
char* chars = (char*)(data + startIndex);
|
|
return GetString(chars, 0, count / sizeof(char));
|
|
}
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// Convert a char array to a string, using a cached value if possible.
|
|
/// </summary>
|
|
/// <param name="value">The characters to convert.</param>
|
|
/// <param name="startIndex">The starting index of the data to convert.</param>
|
|
/// <param name="count">The number of characters to convert.</param>
|
|
/// <returns>A string converted from the data.</returns>
|
|
private static unsafe string GetString(char* value, int startIndex, int count)
|
|
{
|
|
string s;
|
|
|
|
if (0 == count)
|
|
{
|
|
s = string.Empty;
|
|
}
|
|
else if (count < MaxLengthToCache)
|
|
{
|
|
uint hash = CalculateHash(value, startIndex, count);
|
|
int index = unchecked((int)(hash % NumCachedBoxedValues));
|
|
s = CachedStrings[index];
|
|
if (null == s || !AreEqual(s, value, startIndex, count))
|
|
{
|
|
s = CreateNewString(value, startIndex, count);
|
|
CachedStrings[index] = s;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
s = CreateNewString(value, startIndex, count);
|
|
}
|
|
|
|
return s;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Calculate the hash of a string.
|
|
/// </summary>
|
|
/// <param name="value">The characters to hash.</param>
|
|
/// <param name="startIndex">The starting index of the data to hash.</param>
|
|
/// <param name="count">The number of characters to hash.</param>
|
|
/// <returns>The hash value of the data.</returns>
|
|
private static unsafe uint CalculateHash(char* value, int startIndex, int count)
|
|
{
|
|
uint hash = 0;
|
|
unchecked
|
|
{
|
|
for (int i = 0; i < count; ++i)
|
|
{
|
|
hash ^= value[startIndex + i];
|
|
hash *= 33;
|
|
}
|
|
}
|
|
|
|
return hash;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Determine if a string matches a char array..
|
|
/// </summary>
|
|
/// <param name="s">The string to compare against.</param>
|
|
/// <param name="value">The characters.</param>
|
|
/// <param name="startIndex">The starting index of the data.</param>
|
|
/// <param name="count">The number of characters.</param>
|
|
/// <returns>True if the string matches the char array.</returns>
|
|
private static unsafe bool AreEqual(string s, char* value, int startIndex, int count)
|
|
{
|
|
if (s.Length != count)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
unchecked
|
|
{
|
|
for (int i = 0; i < s.Length; ++i)
|
|
{
|
|
if (s[i] != value[startIndex + i])
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
/// <summary>
|
|
/// Convert a char array to a string.
|
|
/// </summary>
|
|
/// <param name="value">The characters to convert.</param>
|
|
/// <param name="startIndex">The starting index of the data to convert.</param>
|
|
/// <param name="count">The number of characters to convert.</param>
|
|
/// <returns>A string converted from the data.</returns>
|
|
private static unsafe string CreateNewString(char* value, int startIndex, int count)
|
|
{
|
|
// Encoding.Unicode.GetString copies the data to an array of chars and then
|
|
// makes a string from it, copying the data twice. Use the more efficient
|
|
// char* constructor.
|
|
return new string(value, startIndex, count);
|
|
}
|
|
}
|
|
} |