Microsoft.NET.StringTools.net35 Fowler/Noll/Vo hashing. Computes 32 bit Fowler/Noll/Vo-1a hash of a string (regardless of encoding). String to be hashed. 32 bit signed hash Computes 32 bit Fowler/Noll/Vo-1a inspired hash of a string. The hashing algorithm process the data by the whole 16bit chars, instead of by bytes. this speeds up the hashing process almost by 2x, while not significantly increasing collisions rate. Analysis: https://github.com/KirillOsenkov/MSBuildStructuredLog/wiki/String-Hashing#faster-fnv-1a String to be hashed. 32 bit unsigned hash Computes 64 bit Fowler/Noll/Vo-1a inspired hash of a string. The hashing algorithm process the data by the whole 16bit chars, instead of by bytes. this speeds up the hashing process almost by 2x, while not significantly increasing collisions rate. Analysis: https://github.com/KirillOsenkov/MSBuildStructuredLog/wiki/String-Hashing#faster-fnv-1a String to be hashed. 64 bit unsigned hash Computes 64 bit Fowler/Noll/Vo-1a hash of a string (regardless of encoding). String to be hashed. 64 bit unsigned hash Combines two 64 bit hashes generated by class into one. First hash value to be combined. Second hash value to be combined. Represents a string that can be converted to System.String with interning, i.e. by returning an existing string if it has been seen before and is still tracked in the intern table. This is a simple and inefficient implementation compatible with .NET Framework 3.5. Enumerator for the top-level struct. Enumerates characters of the string. The InternableString being enumerated. Index of the current character, -1 if MoveNext has not been called yet. Returns the current character. Moves to the next character. True if there is another character, false if the enumerator reached the end. If this instance wraps a StringBuilder, it uses this backing field. If this instance represents one contiguous string, it may be held in this field. A convenience getter to ensure that we always operate on a non-null string. Constructs a new InternableString wrapping the given string. The string to wrap, must be non-null. Constructs a new InternableString wrapping the given SpanBasedStringBuilder. Gets the length of the string. Creates a new enumerator for enumerating characters in this string. Does not allocate. The enumerator. Returns true if the string is equal to another string by ordinal comparison. Another string. True if this string is equal to . Returns a System.String representing this string. Allocates memory unless this InternableString was created by wrapping a System.String in which case the original string is returned. The string. Returns true if this InternableString wraps a System.String and the same System.String is passed as the argument. The string to compare to. True is this instance wraps the given string. Converts this instance to a System.String while first searching for a match in the intern table. May allocate depending on whether the string has already been interned. Implements the simple yet very decently performing djb2 hash function (xor version). A stable hashcode of the string represented by this instance. A helper to hash one character. The running hash code. The character to hash. True if the index of the character in the string is odd. A simple version of SpanBasedStringBuilder to be used on .NET Framework 3.5. Wraps a . Enumerator for the top-level struct. Enumerates characters of the string. The StringBuilder being enumerated. Index of the current character, -1 if MoveNext has not been called yet. Returns the current character. Moves to the next character. True if there is another character, false if the enumerator reached the end. The backing StringBuilder. Constructs a new SpanBasedStringBuilder containing the given string. The string to wrap, must be non-null. Constructs a new empty SpanBasedStringBuilder with the given expected number of spans. Gets the length of the string. Creates a new enumerator for enumerating characters in this string. Does not allocate. The enumerator. Converts this instance to a System.String while first searching for a match in the intern table. May allocate depending on whether the string has already been interned. Releases this instance. Appends a string. The string to append. Appends a substring. The string to append. The start index of the substring within to append. The length of the substring to append. Clears this instance making it represent an empty string. Per-thread instance of the SpanBasedStringBuilder, created lazily. This field serves as a per-thread one-item object pool, which is adequate for most use cases as the builder is not expected to be held for extended periods of time. Interns the given string, keeping only a weak reference to the returned value. The string to intern. A string equal to , could be the same object as . The intern pool does not retain strong references to the strings it's holding so strings are automatically evicted after they become unrooted. This is in contrast to System.String.Intern which holds strings forever. Returns a new or recycled . The SpanBasedStringBuilder. Call on the returned instance to recycle it. Enables diagnostics in the interner. Call to retrieve the diagnostic data. Retrieves the diagnostic data describing the current state of the interner. Make sure to call beforehand. Returns a instance back to the pool if possible. The instance to return. A cache of weak GC handles pointing to strings. Weak GC handles are functionally equivalent to WeakReference's but have less overhead (they're a struct as opposed to WR which is a finalizable class) at the expense of requiring manual lifetime management. As long as a string has an ordinary strong GC root elsewhere in the process and another string with the same hashcode hasn't reused the entry, the cache has a reference to it and can match it to an internable. When the string is collected, it is also automatically "removed" from the cache by becoming unrecoverable from the GC handle. GC handles that do not reference a live string anymore are freed lazily. Implements the WeakStringCache functionality on .NET Framework 3.5 where ConcurrentDictionary is not available. Debug stats returned by GetDebugInfo(). Holds a weak GC handle to a string. Shared by all strings with the same hash code and referencing the last such string we've seen. Weak GC handle to the last string of the given hashcode we've seen. Returns true if the string referenced by the handle is still alive. Returns the string referenced by this handle if it is equal to the given internable. The internable describing the string we're looking for. The string matching the internable or null if the handle is referencing a collected string or the string is different. Sets the handle to the given string. If the handle is still referencing another live string, that string is effectively forgotten. The string to set. Frees the GC handle. Initial capacity of the underlying dictionary. The maximum size we let the collection grow before scavenging unused entries. Frees all GC handles and clears the cache. Returns internal debug counters calculated based on the current state of the cache. Main entrypoint of this cache. Tries to look up a string that matches the given internable. If it succeeds, returns the string and sets cacheHit to true. If the string is not found, calls ExpensiveConvertToString on the internable, adds the resulting string to the cache, and returns it, setting cacheHit to false. The internable describing the string we're looking for. Whether the entry was already in the cache. A string matching the given internable. Iterates over the cache and removes unused GC handles, i.e. handles that don't reference live strings. This is expensive so try to call such that the cost is amortized to O(1) per GetOrCreateEntry() invocation. Assumes the lock is taken by the caller. Public version of ScavengeUnderLock() which takes the lock. Returns internal debug counters calculated based on the current state of the cache. Implements interning based on a WeakStringCache. Enumerates the possible interning results. The cache to keep strings in. Number of times the regular interning path found the string in the cache. Number of times the regular interning path added the string to the cache. Total number of strings eliminated by interning. Total number of chars eliminated across all strings. Maps strings that went though the interning path to the number of times they have been seen. The higher the number the better the payoff of interning. Null if statistics gathering has not been enabled. Try to intern the string. The return value indicates the how the string was interned. WeakIntern the given InternableString. Returns a string with human-readable statistics. Releases all strings from the underlying intern table. A bare minimum and inefficient version of MemoryExtensions as provided in System.Memory on .NET 4.5.