Code:
/ Dotnetfx_Vista_SP2 / Dotnetfx_Vista_SP2 / 8.0.50727.4016 / DEVDIV / depot / DevDiv / releases / whidbey / NetFxQFE / 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
- ConnectionManagementSection.cs
- ObjectView.cs
- ScriptingSectionGroup.cs
- TreeNodeClickEventArgs.cs
- DockProviderWrapper.cs
- ContentFilePart.cs
- PassportAuthenticationEventArgs.cs
- SurrogateEncoder.cs
- StdValidatorsAndConverters.cs
- CodeSnippetExpression.cs
- StackBuilderSink.cs
- StylusDownEventArgs.cs
- RepeaterDesigner.cs
- SqlConnectionFactory.cs
- unsafenativemethodsother.cs
- XPathScanner.cs
- ConfigUtil.cs
- _OSSOCK.cs
- OptionalColumn.cs
- HttpChannelBindingToken.cs
- Tokenizer.cs
- SoapExtensionTypeElementCollection.cs
- DetailsView.cs
- HTTP_SERVICE_CONFIG_URLACL_PARAM.cs
- XhtmlTextWriter.cs
- ArrayExtension.cs
- TaiwanCalendar.cs
- IntegerValidatorAttribute.cs
- TreeNodeConverter.cs
- VersionPair.cs
- UniqueID.cs
- Renderer.cs
- RsaSecurityTokenParameters.cs
- VariableReference.cs
- Selection.cs
- TypeInitializationException.cs
- DesignerContextDescriptor.cs
- UxThemeWrapper.cs
- UserNameSecurityTokenAuthenticator.cs
- BamlVersionHeader.cs
- ListControlConvertEventArgs.cs
- ExtractedStateEntry.cs
- ControlBuilder.cs
- WCFServiceClientProxyGenerator.cs
- StackBuilderSink.cs
- EventLogEntry.cs
- WebPartZone.cs
- DatePickerTextBox.cs
- PageVisual.cs
- FixedSOMImage.cs
- Terminate.cs
- UserControlBuildProvider.cs
- KerberosRequestorSecurityToken.cs
- SystemNetworkInterface.cs
- SafeCoTaskMem.cs
- TranslateTransform.cs
- Msmq.cs
- XmlNamespaceManager.cs
- StrokeIntersection.cs
- ProfessionalColors.cs
- XmlUrlResolver.cs
- PngBitmapDecoder.cs
- AsyncPostBackTrigger.cs
- DriveInfo.cs
- DecimalAnimation.cs
- Int16KeyFrameCollection.cs
- CustomGrammar.cs
- assertwrapper.cs
- FixedPosition.cs
- PtsCache.cs
- XmlConvert.cs
- AppDomainGrammarProxy.cs
- NullableConverter.cs
- IntegerCollectionEditor.cs
- CodeLinePragma.cs
- RegexMatchCollection.cs
- RenamedEventArgs.cs
- ToolStripPanelRow.cs
- CqlParserHelpers.cs
- CapabilitiesSection.cs
- AtomEntry.cs
- IDReferencePropertyAttribute.cs
- LinqDataSourceDeleteEventArgs.cs
- KeyTimeConverter.cs
- List.cs
- LabelEditEvent.cs
- FamilyMapCollection.cs
- XmlWrappingReader.cs
- DependsOnAttribute.cs
- BulletedList.cs
- GrammarBuilderWildcard.cs
- Internal.cs
- SiteMapPath.cs
- RectangleHotSpot.cs
- FormViewCommandEventArgs.cs
- WebControlsSection.cs
- BitConverter.cs
- ThreadAttributes.cs
- BuildProvider.cs
- SqlGatherConsumedAliases.cs