Code:
/ Dotnetfx_Win7_3.5.1 / Dotnetfx_Win7_3.5.1 / 3.5.1 / DEVDIV / depot / DevDiv / releases / whidbey / NetFXspW7 / ndp / fx / src / Xml / System / Xml / XPath / Internal / precedingsibling.cs / 1 / precedingsibling.cs
//------------------------------------------------------------------------------ //// Copyright (c) Microsoft Corporation. All rights reserved. // //[....] //----------------------------------------------------------------------------- namespace MS.Internal.Xml.XPath { using System; using System.Xml; using System.Xml.XPath; using System.Diagnostics; using System.Collections.Generic; // This class can be rewritten much more efficient. // Algorithm could be like one for FollowingSibling: // - Build InputArrays: pares (first, sentinel) // -- Cash all input nodes as sentinel // -- Add firts node of its parent for each input node. // -- Sort these pares by first nodes. // - Advance algorithm will look like: // -- For each row in InputArays we will output first node + all its following nodes which are < sentinel // -- Before outputing each node in row #I we will check that it is < first node in row #I+1 // --- if true we actualy output it // --- if false, we hold with row #I and apply this algorith starting for row #I+1 // --- when we done with #I+1 we continue with row #I internal class PreSiblingQuery : CacheAxisQuery { public PreSiblingQuery(Query qyInput, string name, string prefix, XPathNodeType typeTest) : base (qyInput, name, prefix, typeTest) {} protected PreSiblingQuery(PreSiblingQuery other) : base(other) {} private bool NotVisited(XPathNavigator nav, ListparentStk){ XPathNavigator nav1 = nav.Clone(); nav1.MoveToParent(); for (int i = 0; i < parentStk.Count; i++) { if (nav1.IsSamePosition(parentStk[i])) { return false; } } parentStk.Add(nav1); return true; } public override object Evaluate(XPathNodeIterator context) { base.Evaluate(context); // Fill up base.outputBuffer List parentStk = new List (); Stack inputStk = new Stack (); while ((currentNode = qyInput.Advance()) != null) { inputStk.Push(currentNode.Clone()); } while (inputStk.Count != 0) { XPathNavigator input = inputStk.Pop(); if (input.NodeType == XPathNodeType.Attribute || input.NodeType == XPathNodeType.Namespace) { continue; } if (NotVisited(input, parentStk)) { XPathNavigator prev = input.Clone(); if (prev.MoveToParent()) { bool test = prev.MoveToFirstChild(); Debug.Assert(test, "We just moved to parent, how we can not have first child?"); while (!prev.IsSamePosition(input)) { if (matches(prev)) { Insert(outputBuffer, prev); } if (!prev.MoveToNext()) { Debug.Fail("We managed to miss sentinel node (input)"); break; } } } } } return this; } public override XPathNodeIterator Clone() { return new PreSiblingQuery(this); } public override QueryProps Properties { get { return base.Properties | QueryProps.Reverse; } } } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007. //------------------------------------------------------------------------------ // // Copyright (c) Microsoft Corporation. All rights reserved. // //[....] //----------------------------------------------------------------------------- namespace MS.Internal.Xml.XPath { using System; using System.Xml; using System.Xml.XPath; using System.Diagnostics; using System.Collections.Generic; // This class can be rewritten much more efficient. // Algorithm could be like one for FollowingSibling: // - Build InputArrays: pares (first, sentinel) // -- Cash all input nodes as sentinel // -- Add firts node of its parent for each input node. // -- Sort these pares by first nodes. // - Advance algorithm will look like: // -- For each row in InputArays we will output first node + all its following nodes which are < sentinel // -- Before outputing each node in row #I we will check that it is < first node in row #I+1 // --- if true we actualy output it // --- if false, we hold with row #I and apply this algorith starting for row #I+1 // --- when we done with #I+1 we continue with row #I internal class PreSiblingQuery : CacheAxisQuery { public PreSiblingQuery(Query qyInput, string name, string prefix, XPathNodeType typeTest) : base (qyInput, name, prefix, typeTest) {} protected PreSiblingQuery(PreSiblingQuery other) : base(other) {} private bool NotVisited(XPathNavigator nav, ListparentStk){ XPathNavigator nav1 = nav.Clone(); nav1.MoveToParent(); for (int i = 0; i < parentStk.Count; i++) { if (nav1.IsSamePosition(parentStk[i])) { return false; } } parentStk.Add(nav1); return true; } public override object Evaluate(XPathNodeIterator context) { base.Evaluate(context); // Fill up base.outputBuffer List parentStk = new List (); Stack inputStk = new Stack (); while ((currentNode = qyInput.Advance()) != null) { inputStk.Push(currentNode.Clone()); } while (inputStk.Count != 0) { XPathNavigator input = inputStk.Pop(); if (input.NodeType == XPathNodeType.Attribute || input.NodeType == XPathNodeType.Namespace) { continue; } if (NotVisited(input, parentStk)) { XPathNavigator prev = input.Clone(); if (prev.MoveToParent()) { bool test = prev.MoveToFirstChild(); Debug.Assert(test, "We just moved to parent, how we can not have first child?"); while (!prev.IsSamePosition(input)) { if (matches(prev)) { Insert(outputBuffer, prev); } if (!prev.MoveToNext()) { Debug.Fail("We managed to miss sentinel node (input)"); break; } } } } } return this; } public override XPathNodeIterator Clone() { return new PreSiblingQuery(this); } public override QueryProps Properties { get { return base.Properties | QueryProps.Reverse; } } } } // 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
- ReliabilityContractAttribute.cs
- DataSourceXmlSerializer.cs
- IntranetCredentialPolicy.cs
- PersonalizationDictionary.cs
- SqlFileStream.cs
- EntityViewContainer.cs
- EmptyEnumerable.cs
- EventToken.cs
- SQLBinaryStorage.cs
- ObjectKeyFrameCollection.cs
- DocumentApplicationState.cs
- MemberHolder.cs
- PropertyFilterAttribute.cs
- OleDbCommandBuilder.cs
- DataColumnMapping.cs
- TextEditorTyping.cs
- TextEffect.cs
- HandlerFactoryWrapper.cs
- SafeRightsManagementPubHandle.cs
- SystemFonts.cs
- InputLanguageSource.cs
- InputLanguageCollection.cs
- Menu.cs
- SystemInformation.cs
- ContractSearchPattern.cs
- QueueException.cs
- XmlChildEnumerator.cs
- PointAnimationUsingPath.cs
- Module.cs
- AutomationPropertyChangedEventArgs.cs
- BamlResourceSerializer.cs
- AdjustableArrowCap.cs
- UrlPropertyAttribute.cs
- TraceProvider.cs
- SortExpressionBuilder.cs
- MouseDevice.cs
- PointAnimation.cs
- DataRow.cs
- BoolExpression.cs
- WebPartTracker.cs
- Baml6ConstructorInfo.cs
- GlyphRunDrawing.cs
- KoreanCalendar.cs
- TabControl.cs
- SuppressMessageAttribute.cs
- SafeBitVector32.cs
- ExtendedProperty.cs
- TableDetailsRow.cs
- UserInitiatedRoutedEventPermissionAttribute.cs
- XmlSignatureProperties.cs
- OracleDateTime.cs
- GeneratedContractType.cs
- DrawingImage.cs
- WebServiceParameterData.cs
- Geometry3D.cs
- TextFragmentEngine.cs
- _IPv4Address.cs
- _PooledStream.cs
- CqlWriter.cs
- VisualTreeHelper.cs
- LinkedResource.cs
- NullableConverter.cs
- LinqDataSourceUpdateEventArgs.cs
- ByteRangeDownloader.cs
- Transform3DGroup.cs
- CodeTypeMemberCollection.cs
- Model3DGroup.cs
- PolicyException.cs
- EventHandlersStore.cs
- WorkflowTraceTransfer.cs
- ColorIndependentAnimationStorage.cs
- DbBuffer.cs
- ChtmlPageAdapter.cs
- HttpWebResponse.cs
- StreamAsIStream.cs
- LocatorBase.cs
- FixedSOMTable.cs
- PackageRelationshipSelector.cs
- ListViewTableRow.cs
- DataReaderContainer.cs
- PrintPreviewGraphics.cs
- LinkArea.cs
- SiteMapNode.cs
- CounterSampleCalculator.cs
- DataGridViewTopLeftHeaderCell.cs
- ContentElement.cs
- MimeMultiPart.cs
- ELinqQueryState.cs
- Unit.cs
- Rotation3DAnimationUsingKeyFrames.cs
- ToolStripContentPanel.cs
- XmlQueryRuntime.cs
- SqlException.cs
- SendSecurityHeader.cs
- GeneralTransform3D.cs
- DataGridViewLinkCell.cs
- InstallHelper.cs
- MobileDeviceCapabilitiesSectionHandler.cs
- CorePropertiesFilter.cs
- CopyAttributesAction.cs