Code:
/ 4.0 / 4.0 / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / fx / src / Xml / System / Xml / XPath / Internal / precedingsibling.cs / 1305376 / 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
- XPathSelfQuery.cs
- TerminatorSinks.cs
- TextEncodedRawTextWriter.cs
- OperationAbortedException.cs
- ClientRolePrincipal.cs
- VisualStyleInformation.cs
- ParameterReplacerVisitor.cs
- COSERVERINFO.cs
- DeclarationUpdate.cs
- MarkedHighlightComponent.cs
- XmlUTF8TextWriter.cs
- ArgumentOutOfRangeException.cs
- DesignTimeTemplateParser.cs
- Automation.cs
- ImplicitInputBrush.cs
- RepeatButtonAutomationPeer.cs
- DateTimeSerializationSection.cs
- SizeAnimationBase.cs
- TargetControlTypeCache.cs
- FixedSOMSemanticBox.cs
- FullTextLine.cs
- PaperSize.cs
- ExtendLockCommand.cs
- FieldDescriptor.cs
- HtmlContainerControl.cs
- securitymgrsite.cs
- Contracts.cs
- Brush.cs
- DataSourceConverter.cs
- XslVisitor.cs
- GeneralTransform2DTo3DTo2D.cs
- AsnEncodedData.cs
- XDeferredAxisSource.cs
- TextTreeNode.cs
- AdPostCacheSubstitution.cs
- ModuleBuilder.cs
- CorrelationKey.cs
- BoolExpressionVisitors.cs
- SqlCommandSet.cs
- HtmlLink.cs
- AsymmetricKeyExchangeDeformatter.cs
- mactripleDES.cs
- LocalizationParserHooks.cs
- SimpleWebHandlerParser.cs
- TextParagraphView.cs
- CollectionChangeEventArgs.cs
- CreateCardRequest.cs
- MobileControl.cs
- CombinedGeometry.cs
- SafeThreadHandle.cs
- PopOutPanel.cs
- DocumentEventArgs.cs
- MergeLocalizationDirectives.cs
- odbcmetadatacolumnnames.cs
- ProxyOperationRuntime.cs
- QilNode.cs
- SecureStringHasher.cs
- MetabaseSettingsIis7.cs
- EventLogPermissionEntry.cs
- ListDictionaryInternal.cs
- UIElementCollection.cs
- TempFiles.cs
- ThreadTrace.cs
- GeneratedView.cs
- SharedHttpTransportManager.cs
- PageBuildProvider.cs
- MessageSecurityOverTcpElement.cs
- BitmapEffectDrawing.cs
- StrongNameKeyPair.cs
- CompressEmulationStream.cs
- XmlWrappingReader.cs
- SamlAuthorizationDecisionStatement.cs
- CompiledQuery.cs
- ExeContext.cs
- Cursors.cs
- Socket.cs
- ColorContext.cs
- ScopelessEnumAttribute.cs
- XmlElementCollection.cs
- HelpPage.cs
- GifBitmapEncoder.cs
- IntSecurity.cs
- ConfigurationStrings.cs
- Int64AnimationUsingKeyFrames.cs
- LingerOption.cs
- ExternalCalls.cs
- XamlToRtfParser.cs
- RelatedView.cs
- AccessKeyManager.cs
- ScriptComponentDescriptor.cs
- AdPostCacheSubstitution.cs
- VisualBrush.cs
- PersonalizationAdministration.cs
- RoleManagerModule.cs
- ValidationSummary.cs
- AsymmetricSignatureFormatter.cs
- SafeCertificateStore.cs
- SortedSet.cs
- ToolBarButton.cs
- HttpWebRequest.cs