Code:
/ 4.0 / 4.0 / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / fx / src / Xml / System / Xml / NameTable.cs / 1305376 / NameTable.cs
//------------------------------------------------------------------------------
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// [....]
//-----------------------------------------------------------------------------
using System;
namespace System.Xml {
///
///
/// XmlNameTable implemented as a simple hash table.
///
///
public class NameTable : XmlNameTable {
//
// Private types
//
class Entry {
internal string str;
internal int hashCode;
internal Entry next;
internal Entry( string str, int hashCode, Entry next ) {
this.str = str;
this.hashCode = hashCode;
this.next = next;
}
}
//
// Fields
//
Entry[] entries;
int count;
int mask;
int hashCodeRandomizer;
//
// Constructor
//
///
/// Public constructor.
///
public NameTable() {
mask = 31;
entries = new Entry[mask+1];
hashCodeRandomizer = Environment.TickCount;
}
//
// XmlNameTable public methods
//
///
/// Add the given string to the NameTable or return
/// the existing string if it is already in the NameTable.
///
public override string Add( string key ) {
if ( key == null ) {
throw new ArgumentNullException( "key" );
}
int len = key.Length;
if ( len == 0 ) {
return string.Empty;
}
int hashCode = len + hashCodeRandomizer;
// use key.Length to eliminate the rangecheck
for ( int i = 0; i < key.Length; i++ ) {
hashCode += ( hashCode << 7 ) ^ key[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && e.str.Equals( key ) ) {
return e.str;
}
}
return AddEntry( key, hashCode );
}
///
/// Add the given string to the NameTable or return
/// the existing string if it is already in the NameTable.
///
public override string Add( char[] key, int start, int len ) {
if ( len == 0 ) {
return string.Empty;
}
int hashCode = len + hashCodeRandomizer;
hashCode += ( hashCode << 7 ) ^ key[start]; // this will throw IndexOutOfRangeException in case the start index is invalid
int end = start+len;
for ( int i = start + 1; i < end; i++) {
hashCode += ( hashCode << 7 ) ^ key[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && TextEquals( e.str, key, start, len ) ) {
return e.str;
}
}
return AddEntry( new string( key, start, len ), hashCode );
}
///
/// Find the matching string in the NameTable.
///
public override string Get( string value ) {
if ( value == null ) {
throw new ArgumentNullException("value");
}
if ( value.Length == 0 ) {
return string.Empty;
}
int len = value.Length + hashCodeRandomizer;
int hashCode = len;
// use value.Length to eliminate the rangecheck
for ( int i = 0; i < value.Length; i++ ) {
hashCode += ( hashCode << 7 ) ^ value[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && e.str.Equals( value ) ) {
return e.str;
}
}
return null;
}
///
/// Find the matching string atom given a range of
/// characters.
///
public override string Get( char[] key, int start, int len ) {
if ( len == 0 ) {
return string.Empty;
}
int hashCode = len + hashCodeRandomizer;
hashCode += ( hashCode << 7 ) ^ key[start]; // this will throw IndexOutOfRangeException in case the start index is invalid
int end = start+len;
for ( int i = start + 1; i < end; i++) {
hashCode += ( hashCode << 7 ) ^ key[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && TextEquals( e.str, key, start, len ) ) {
return e.str;
}
}
return null;
}
//
// Private methods
//
private string AddEntry( string str, int hashCode ) {
int index = hashCode & mask;
Entry e = new Entry( str, hashCode, entries[index] );
entries[index] = e;
if ( count++ == mask ) {
Grow();
}
return e.str;
}
private void Grow() {
int newMask = mask * 2 + 1;
Entry[] oldEntries = entries;
Entry[] newEntries = new Entry[newMask+1];
// use oldEntries.Length to eliminate the rangecheck
for ( int i = 0; i < oldEntries.Length; i++ ) {
Entry e = oldEntries[i];
while ( e != null ) {
int newIndex = e.hashCode & newMask;
Entry tmp = e.next;
e.next = newEntries[newIndex];
newEntries[newIndex] = e;
e = tmp;
}
}
entries = newEntries;
mask = newMask;
}
private static bool TextEquals( string str1, char[] str2, int str2Start, int str2Length ) {
if ( str1.Length != str2Length ) {
return false;
}
// use array.Length to eliminate the rangecheck
for ( int i = 0; i < str1.Length; i++ ) {
if ( str1[i] != str2[str2Start+i] ) {
return false;
}
}
return true;
}
}
}
// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
//------------------------------------------------------------------------------
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// [....]
//-----------------------------------------------------------------------------
using System;
namespace System.Xml {
///
///
/// XmlNameTable implemented as a simple hash table.
///
///
public class NameTable : XmlNameTable {
//
// Private types
//
class Entry {
internal string str;
internal int hashCode;
internal Entry next;
internal Entry( string str, int hashCode, Entry next ) {
this.str = str;
this.hashCode = hashCode;
this.next = next;
}
}
//
// Fields
//
Entry[] entries;
int count;
int mask;
int hashCodeRandomizer;
//
// Constructor
//
///
/// Public constructor.
///
public NameTable() {
mask = 31;
entries = new Entry[mask+1];
hashCodeRandomizer = Environment.TickCount;
}
//
// XmlNameTable public methods
//
///
/// Add the given string to the NameTable or return
/// the existing string if it is already in the NameTable.
///
public override string Add( string key ) {
if ( key == null ) {
throw new ArgumentNullException( "key" );
}
int len = key.Length;
if ( len == 0 ) {
return string.Empty;
}
int hashCode = len + hashCodeRandomizer;
// use key.Length to eliminate the rangecheck
for ( int i = 0; i < key.Length; i++ ) {
hashCode += ( hashCode << 7 ) ^ key[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && e.str.Equals( key ) ) {
return e.str;
}
}
return AddEntry( key, hashCode );
}
///
/// Add the given string to the NameTable or return
/// the existing string if it is already in the NameTable.
///
public override string Add( char[] key, int start, int len ) {
if ( len == 0 ) {
return string.Empty;
}
int hashCode = len + hashCodeRandomizer;
hashCode += ( hashCode << 7 ) ^ key[start]; // this will throw IndexOutOfRangeException in case the start index is invalid
int end = start+len;
for ( int i = start + 1; i < end; i++) {
hashCode += ( hashCode << 7 ) ^ key[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && TextEquals( e.str, key, start, len ) ) {
return e.str;
}
}
return AddEntry( new string( key, start, len ), hashCode );
}
///
/// Find the matching string in the NameTable.
///
public override string Get( string value ) {
if ( value == null ) {
throw new ArgumentNullException("value");
}
if ( value.Length == 0 ) {
return string.Empty;
}
int len = value.Length + hashCodeRandomizer;
int hashCode = len;
// use value.Length to eliminate the rangecheck
for ( int i = 0; i < value.Length; i++ ) {
hashCode += ( hashCode << 7 ) ^ value[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && e.str.Equals( value ) ) {
return e.str;
}
}
return null;
}
///
/// Find the matching string atom given a range of
/// characters.
///
public override string Get( char[] key, int start, int len ) {
if ( len == 0 ) {
return string.Empty;
}
int hashCode = len + hashCodeRandomizer;
hashCode += ( hashCode << 7 ) ^ key[start]; // this will throw IndexOutOfRangeException in case the start index is invalid
int end = start+len;
for ( int i = start + 1; i < end; i++) {
hashCode += ( hashCode << 7 ) ^ key[i];
}
// mix it a bit more
hashCode -= hashCode >> 17;
hashCode -= hashCode >> 11;
hashCode -= hashCode >> 5;
for ( Entry e = entries[hashCode & mask]; e != null; e = e.next ) {
if ( e.hashCode == hashCode && TextEquals( e.str, key, start, len ) ) {
return e.str;
}
}
return null;
}
//
// Private methods
//
private string AddEntry( string str, int hashCode ) {
int index = hashCode & mask;
Entry e = new Entry( str, hashCode, entries[index] );
entries[index] = e;
if ( count++ == mask ) {
Grow();
}
return e.str;
}
private void Grow() {
int newMask = mask * 2 + 1;
Entry[] oldEntries = entries;
Entry[] newEntries = new Entry[newMask+1];
// use oldEntries.Length to eliminate the rangecheck
for ( int i = 0; i < oldEntries.Length; i++ ) {
Entry e = oldEntries[i];
while ( e != null ) {
int newIndex = e.hashCode & newMask;
Entry tmp = e.next;
e.next = newEntries[newIndex];
newEntries[newIndex] = e;
e = tmp;
}
}
entries = newEntries;
mask = newMask;
}
private static bool TextEquals( string str1, char[] str2, int str2Start, int str2Length ) {
if ( str1.Length != str2Length ) {
return false;
}
// use array.Length to eliminate the rangecheck
for ( int i = 0; i < str1.Length; i++ ) {
if ( str1[i] != str2[str2Start+i] ) {
return false;
}
}
return true;
}
}
}
// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
Link Menu
This book is available now!
Buy at Amazon US or
Buy at Amazon UK
- DataSysAttribute.cs
- Latin1Encoding.cs
- SafeSystemMetrics.cs
- TreeViewImageIndexConverter.cs
- NominalTypeEliminator.cs
- Iis7Helper.cs
- SequentialOutput.cs
- RegistrationProxy.cs
- ToolbarAUtomationPeer.cs
- TextDecorations.cs
- PointLight.cs
- DocumentPage.cs
- QueryPageSettingsEventArgs.cs
- ProfessionalColorTable.cs
- SqlMethodCallConverter.cs
- XmlDocumentFieldSchema.cs
- NativeObjectSecurity.cs
- XamlReader.cs
- IndicShape.cs
- BookmarkEventArgs.cs
- SqlUDTStorage.cs
- PermissionSet.cs
- Storyboard.cs
- _NegoStream.cs
- HtmlInputReset.cs
- SafeArrayTypeMismatchException.cs
- Cursors.cs
- Wizard.cs
- ModuleBuilder.cs
- WmlPhoneCallAdapter.cs
- MemoryRecordBuffer.cs
- ParamArrayAttribute.cs
- cryptoapiTransform.cs
- ResourceContainer.cs
- CapabilitiesSection.cs
- XmlSortKey.cs
- PropertySet.cs
- RepeatInfo.cs
- CodeCatchClause.cs
- PartEditor.cs
- LoginView.cs
- XmlPreloadedResolver.cs
- MultiAsyncResult.cs
- DurableOperationContext.cs
- NavigatorOutput.cs
- ListBindingHelper.cs
- HtmlButton.cs
- ToolTip.cs
- PrivilegedConfigurationManager.cs
- Array.cs
- BamlResourceSerializer.cs
- SizeChangedEventArgs.cs
- CoreSwitches.cs
- APCustomTypeDescriptor.cs
- LockCookie.cs
- Types.cs
- ProvideValueServiceProvider.cs
- PermissionSet.cs
- RegexGroup.cs
- SystemColorTracker.cs
- DesignerForm.cs
- CustomErrorsSection.cs
- VersionPair.cs
- CapabilitiesState.cs
- IDQuery.cs
- InfoCardTraceRecord.cs
- ErasingStroke.cs
- HttpApplicationFactory.cs
- EUCJPEncoding.cs
- ScaleTransform.cs
- WmlControlAdapter.cs
- PackagingUtilities.cs
- LinkLabelLinkClickedEvent.cs
- ImageField.cs
- MulticastDelegate.cs
- ZipFileInfoCollection.cs
- DataRowView.cs
- DataGridViewRowHeaderCell.cs
- XmlSerializerNamespaces.cs
- ConcurrentQueue.cs
- followingquery.cs
- CounterSample.cs
- LocalServiceSecuritySettingsElement.cs
- WebBrowserNavigatingEventHandler.cs
- RangeContentEnumerator.cs
- WorkflowInstanceExtensionManager.cs
- TextShapeableCharacters.cs
- ToolStripLabel.cs
- DefinitionUpdate.cs
- PasswordDeriveBytes.cs
- WinEventQueueItem.cs
- InlineObject.cs
- BamlResourceDeserializer.cs
- GroupBox.cs
- InlinedLocationReference.cs
- XmlElement.cs
- DataGridViewAccessibleObject.cs
- Soap11ServerProtocol.cs
- Bitmap.cs
- Header.cs