Code:
/ Net / Net / 3.5.50727.3053 / DEVDIV / depot / DevDiv / releases / whidbey / netfxsp / ndp / fx / src / Xml / System / Xml / BitStack.cs / 1 / BitStack.cs
//------------------------------------------------------------------------------ //// Copyright (c) Microsoft Corporation. All rights reserved. // //[....] //----------------------------------------------------------------------------- namespace System.Xml { using System; using System.Diagnostics; ////// Manages a stack of bits. Exposes push, pop, and peek operations. /// internal class BitStack { private uint[] bitStack; private int stackPos; private uint curr; ////// Initialize stack. /// public BitStack() { // Set sentinel bit in 1st position. As bits are shifted onto this.curr, this sentinel // bit shifts to the left. When it's about to overflow, this.curr will be pushed // onto an unsigned int stack and the sentinel bit will be reset to 0x1. this.curr = 0x1; } ////// Push a 0 or 1 bit onto the stack. /// public void PushBit(bool bit) { if ((this.curr & 0x80000000) != 0) { // If sentinel bit has reached the last position, push this.curr PushCurr(); } // Shift new bit onto this.curr (which must have at least one open position) this.curr = (this.curr << 1) | (bit ? 1u : 0u); } ////// Pop the top bit from the stack and return it. /// public bool PopBit() { bool bit; Debug.Assert(this.curr != 0x1, "Stack empty"); // Shift rightmost bit from this.curr bit = (this.curr & 0x1) != 0; this.curr >>= 1; if (this.curr == 0x1) { // If sentinel bit has reached the rightmost position, pop this.curr PopCurr(); } return bit; } ////// Return the top bit on the stack without pushing or popping. /// public bool PeekBit() { Debug.Assert(this.curr != 0x1, "Stack empty"); return (this.curr & 0x1) != 0; } ////// Return true if there are currently no bits on the stack. /// public bool IsEmpty { get { return this.curr == 0x1; } } ////// this.curr has enough space for 31 bits (minus 1 for sentinel bit). Once this space is /// exhausted, a uint stack is created to handle the overflow. /// private void PushCurr() { int len; if (this.bitStack == null) { this.bitStack = new uint[16]; } // Push current unsigned int (which has been filled) onto a stack // and initialize this.curr to be used for future pushes. this.bitStack[this.stackPos++] = this.curr; this.curr = 0x1; // Resize stack if necessary len = this.bitStack.Length; if (this.stackPos >= len) { uint[] bitStackNew = new uint[2 * len]; Array.Copy(this.bitStack, bitStackNew, len); this.bitStack = bitStackNew; } } ////// If all bits have been popped from this.curr, then pop the previous uint value from the stack in /// order to provide another 31 bits. /// private void PopCurr() { if (this.stackPos > 0) this.curr = this.bitStack[--this.stackPos]; } } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007. //------------------------------------------------------------------------------ //// Copyright (c) Microsoft Corporation. All rights reserved. // //[....] //----------------------------------------------------------------------------- namespace System.Xml { using System; using System.Diagnostics; ////// Manages a stack of bits. Exposes push, pop, and peek operations. /// internal class BitStack { private uint[] bitStack; private int stackPos; private uint curr; ////// Initialize stack. /// public BitStack() { // Set sentinel bit in 1st position. As bits are shifted onto this.curr, this sentinel // bit shifts to the left. When it's about to overflow, this.curr will be pushed // onto an unsigned int stack and the sentinel bit will be reset to 0x1. this.curr = 0x1; } ////// Push a 0 or 1 bit onto the stack. /// public void PushBit(bool bit) { if ((this.curr & 0x80000000) != 0) { // If sentinel bit has reached the last position, push this.curr PushCurr(); } // Shift new bit onto this.curr (which must have at least one open position) this.curr = (this.curr << 1) | (bit ? 1u : 0u); } ////// Pop the top bit from the stack and return it. /// public bool PopBit() { bool bit; Debug.Assert(this.curr != 0x1, "Stack empty"); // Shift rightmost bit from this.curr bit = (this.curr & 0x1) != 0; this.curr >>= 1; if (this.curr == 0x1) { // If sentinel bit has reached the rightmost position, pop this.curr PopCurr(); } return bit; } ////// Return the top bit on the stack without pushing or popping. /// public bool PeekBit() { Debug.Assert(this.curr != 0x1, "Stack empty"); return (this.curr & 0x1) != 0; } ////// Return true if there are currently no bits on the stack. /// public bool IsEmpty { get { return this.curr == 0x1; } } ////// this.curr has enough space for 31 bits (minus 1 for sentinel bit). Once this space is /// exhausted, a uint stack is created to handle the overflow. /// private void PushCurr() { int len; if (this.bitStack == null) { this.bitStack = new uint[16]; } // Push current unsigned int (which has been filled) onto a stack // and initialize this.curr to be used for future pushes. this.bitStack[this.stackPos++] = this.curr; this.curr = 0x1; // Resize stack if necessary len = this.bitStack.Length; if (this.stackPos >= len) { uint[] bitStackNew = new uint[2 * len]; Array.Copy(this.bitStack, bitStackNew, len); this.bitStack = bitStackNew; } } ////// If all bits have been popped from this.curr, then pop the previous uint value from the stack in /// order to provide another 31 bits. /// private void PopCurr() { if (this.stackPos > 0) this.curr = this.bitStack[--this.stackPos]; } } } // 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
- ObjectQuery_EntitySqlExtensions.cs
- FormParameter.cs
- StylusEventArgs.cs
- AttributeParameterInfo.cs
- XPathDocumentIterator.cs
- DbConnectionPoolOptions.cs
- DirectionalLight.cs
- PerfCounters.cs
- NodeFunctions.cs
- CqlParserHelpers.cs
- WebPartHeaderCloseVerb.cs
- DynamicRendererThreadManager.cs
- AnnotationResourceChangedEventArgs.cs
- WebServiceFaultDesigner.cs
- BlurBitmapEffect.cs
- BaseTemplateCodeDomTreeGenerator.cs
- WorkflowDesignerMessageFilter.cs
- Choices.cs
- IconConverter.cs
- OlePropertyStructs.cs
- ObjectStorage.cs
- WindowsTokenRoleProvider.cs
- ProcessProtocolHandler.cs
- BaseValidator.cs
- Vector3DAnimation.cs
- WindowsSecurityToken.cs
- KeyBinding.cs
- NameValueSectionHandler.cs
- EventLogPermissionEntry.cs
- MimeXmlImporter.cs
- XsltSettings.cs
- Ray3DHitTestResult.cs
- TabControl.cs
- RuntimeTrackingProfile.cs
- WebPartConnectionsConfigureVerb.cs
- handlecollector.cs
- MinimizableAttributeTypeConverter.cs
- FontNamesConverter.cs
- FixedPageStructure.cs
- ProxySimple.cs
- AliasedSlot.cs
- IntegerFacetDescriptionElement.cs
- BigInt.cs
- ObjectItemCollection.cs
- CssTextWriter.cs
- AdRotator.cs
- SHA384Managed.cs
- ProcessProtocolHandler.cs
- HandlerWithFactory.cs
- EventMappingSettingsCollection.cs
- VoiceChangeEventArgs.cs
- CmsInterop.cs
- Native.cs
- ThreadPool.cs
- PseudoWebRequest.cs
- TypeBrowserDialog.cs
- HostUtils.cs
- FileSystemWatcher.cs
- CriticalHandle.cs
- SweepDirectionValidation.cs
- XmlQueryRuntime.cs
- SafeRegistryHandle.cs
- OutputChannelBinder.cs
- XamlContextStack.cs
- PackageRelationshipCollection.cs
- UnitySerializationHolder.cs
- ConditionalAttribute.cs
- CompoundFileDeflateTransform.cs
- RegexNode.cs
- PlainXmlSerializer.cs
- SecurityResources.cs
- PageVisual.cs
- ConfigurationValidatorAttribute.cs
- ColorTypeConverter.cs
- PointF.cs
- SchemaImporterExtensionElement.cs
- LockCookie.cs
- Point3DValueSerializer.cs
- DesignerAdapterAttribute.cs
- EnumerableRowCollectionExtensions.cs
- FileEnumerator.cs
- DictionarySectionHandler.cs
- CopyNodeSetAction.cs
- PackageRelationshipCollection.cs
- TreeViewItem.cs
- RuleSetDialog.Designer.cs
- OracleParameterBinding.cs
- PointKeyFrameCollection.cs
- AutomationPattern.cs
- LinkedList.cs
- RowToFieldTransformer.cs
- CompilerErrorCollection.cs
- CommandHelpers.cs
- _Semaphore.cs
- PerformanceCounterCategory.cs
- ReadWriteSpinLock.cs
- Blend.cs
- ViewStateException.cs
- ParserOptions.cs
- UTF32Encoding.cs