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
- EmptyCollection.cs
- ReadOnlyDataSourceView.cs
- VisualStateManager.cs
- SqlVersion.cs
- XsdSchemaFileEditor.cs
- Stylus.cs
- Ipv6Element.cs
- TreeBuilder.cs
- Model3DGroup.cs
- PopOutPanel.cs
- ItemsPresenter.cs
- CLRBindingWorker.cs
- ToolStripSeparator.cs
- SerializationObjectManager.cs
- MailBnfHelper.cs
- Accessible.cs
- WeakReferenceList.cs
- _NetworkingPerfCounters.cs
- TraceUtils.cs
- CommonDialog.cs
- EntitySqlQueryCacheKey.cs
- CroppedBitmap.cs
- BuildProvider.cs
- GeneralTransformCollection.cs
- HtmlInputCheckBox.cs
- Codec.cs
- SearchForVirtualItemEventArgs.cs
- GuidelineSet.cs
- DataBindingList.cs
- TextBoxDesigner.cs
- FontStretch.cs
- XmlHierarchyData.cs
- HybridDictionary.cs
- DataGridViewCellParsingEventArgs.cs
- ResourceKey.cs
- StructuredTypeEmitter.cs
- XsltLoader.cs
- DataList.cs
- PersonalizationDictionary.cs
- Token.cs
- ApplicationInterop.cs
- StringValidator.cs
- SpeakProgressEventArgs.cs
- Source.cs
- EmissiveMaterial.cs
- EventHandlersDesigner.cs
- TimelineClockCollection.cs
- HttpCapabilitiesSectionHandler.cs
- DataServiceQueryException.cs
- InheritedPropertyChangedEventArgs.cs
- CreationContext.cs
- ButtonBase.cs
- UdpDuplexChannel.cs
- WmlLabelAdapter.cs
- ThrowHelper.cs
- ThicknessAnimation.cs
- ServiceModelActivationSectionGroup.cs
- InputChannelBinder.cs
- AssemblyUtil.cs
- CompressEmulationStream.cs
- MetadataCollection.cs
- TextWriterEngine.cs
- MimeMultiPart.cs
- ArrayWithOffset.cs
- EmbeddedObject.cs
- HTTPNotFoundHandler.cs
- CounterCreationDataCollection.cs
- NavigationWindowAutomationPeer.cs
- wmiprovider.cs
- ItemMap.cs
- PaperSize.cs
- EntityContainerRelationshipSet.cs
- HandlerBase.cs
- tooltip.cs
- Helpers.cs
- COM2FontConverter.cs
- MatrixTransform.cs
- WS2007HttpBinding.cs
- IPipelineRuntime.cs
- Hash.cs
- ResourceReader.cs
- WindowsTokenRoleProvider.cs
- X509Certificate2.cs
- Int32RectValueSerializer.cs
- CustomDictionarySources.cs
- LazyTextWriterCreator.cs
- MouseEvent.cs
- SafeRegistryHandle.cs
- EventLogPermissionAttribute.cs
- PrintingPermissionAttribute.cs
- BasicExpressionVisitor.cs
- OracleConnectionString.cs
- LogArchiveSnapshot.cs
- PixelFormats.cs
- ContextMenuStripActionList.cs
- MembershipPasswordException.cs
- DocumentsTrace.cs
- Decoder.cs
- BasicBrowserDialog.cs
- StateElementCollection.cs