Code:
/ Dotnetfx_Vista_SP2 / Dotnetfx_Vista_SP2 / 8.0.50727.4016 / DEVDIV / depot / DevDiv / releases / whidbey / NetFxQFE / 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
- TaiwanLunisolarCalendar.cs
- DetailsViewInsertEventArgs.cs
- PointAnimationClockResource.cs
- HttpFileCollectionBase.cs
- ObjectDisposedException.cs
- SqlConnectionFactory.cs
- InternalResources.cs
- StateDesigner.cs
- SqlRetyper.cs
- InputProcessorProfiles.cs
- LogStream.cs
- ExpressionBindingCollection.cs
- RenderTargetBitmap.cs
- EventLogReader.cs
- GlyphRunDrawing.cs
- EdmRelationshipRoleAttribute.cs
- sqlmetadatafactory.cs
- Point3DAnimation.cs
- DataPagerFieldCollection.cs
- MsmqChannelListenerBase.cs
- GeneralTransform3DTo2DTo3D.cs
- CornerRadiusConverter.cs
- Table.cs
- GridToolTip.cs
- EntityUtil.cs
- RecognizeCompletedEventArgs.cs
- GifBitmapDecoder.cs
- QilScopedVisitor.cs
- StreamGeometryContext.cs
- HtmlCalendarAdapter.cs
- DeclarativeExpressionConditionDeclaration.cs
- BitStack.cs
- HtmlMobileTextWriter.cs
- ErrorFormatterPage.cs
- LookupBindingPropertiesAttribute.cs
- SiteMapHierarchicalDataSourceView.cs
- DataGridViewCellStyle.cs
- XmlSchemaObject.cs
- CredentialCache.cs
- CodeLinePragma.cs
- COAUTHINFO.cs
- FormViewUpdateEventArgs.cs
- ExtendedProtectionPolicyElement.cs
- WebPart.cs
- DiagnosticsConfigurationHandler.cs
- ButtonAutomationPeer.cs
- DataErrorValidationRule.cs
- _LoggingObject.cs
- ControlCollection.cs
- DataAdapter.cs
- MetadataCache.cs
- unitconverter.cs
- ImportOptions.cs
- ButtonColumn.cs
- SourceFileInfo.cs
- DashStyle.cs
- UrlMappingCollection.cs
- PackWebResponse.cs
- CodePageEncoding.cs
- Vars.cs
- XPathNodeIterator.cs
- CopyAction.cs
- Marshal.cs
- DeclarativeExpressionConditionDeclaration.cs
- RijndaelManaged.cs
- ConvertersCollection.cs
- ToolStripContentPanel.cs
- TableProviderWrapper.cs
- DockPatternIdentifiers.cs
- ServiceElement.cs
- Camera.cs
- FixedSOMImage.cs
- StringFreezingAttribute.cs
- IndentTextWriter.cs
- ProxySimple.cs
- XmlAttributeAttribute.cs
- SerializerProvider.cs
- DesignerRegionMouseEventArgs.cs
- CustomSignedXml.cs
- DataColumnChangeEvent.cs
- Lookup.cs
- CodeAttributeArgumentCollection.cs
- CodeSnippetCompileUnit.cs
- GraphicsContainer.cs
- BrowsableAttribute.cs
- XmlSerializerNamespaces.cs
- AnnouncementSendsAsyncResult.cs
- UnsafeNativeMethods.cs
- UnitySerializationHolder.cs
- X509RawDataKeyIdentifierClause.cs
- EventMappingSettings.cs
- PartialCachingControl.cs
- Wildcard.cs
- FactoryRecord.cs
- VectorConverter.cs
- MachineKeyConverter.cs
- DesignTimeVisibleAttribute.cs
- AddInProcess.cs
- DataObjectCopyingEventArgs.cs
- ControlUtil.cs