Code:
/ Net / Net / 3.5.50727.3053 / DEVDIV / depot / DevDiv / releases / whidbey / netfxsp / 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
- ResourceIDHelper.cs
- RolePrincipal.cs
- StoreItemCollection.Loader.cs
- EntityTypeBase.cs
- SQLInt64Storage.cs
- DataSourceXmlSubItemAttribute.cs
- OutputCacheProfileCollection.cs
- DocumentSequenceHighlightLayer.cs
- FormViewDeletedEventArgs.cs
- NativeMethods.cs
- MasterPageBuildProvider.cs
- ListViewDataItem.cs
- SponsorHelper.cs
- MSAAEventDispatcher.cs
- ContentFileHelper.cs
- EditorAttribute.cs
- SessionPageStatePersister.cs
- FormViewCommandEventArgs.cs
- SerializationEventsCache.cs
- WindowsProgressbar.cs
- DESCryptoServiceProvider.cs
- FormViewUpdateEventArgs.cs
- TargetPerspective.cs
- InsufficientMemoryException.cs
- StatusBarAutomationPeer.cs
- WindowsTokenRoleProvider.cs
- ConfigurationPropertyAttribute.cs
- CacheVirtualItemsEvent.cs
- XmlCodeExporter.cs
- TextStore.cs
- EventLogPermissionEntryCollection.cs
- XmlSchemaObject.cs
- SymbolType.cs
- HuffCodec.cs
- MimeObjectFactory.cs
- returneventsaver.cs
- VirtualizingPanel.cs
- SizeLimitedCache.cs
- ObjectTokenCategory.cs
- input.cs
- PersonalizationEntry.cs
- SharedUtils.cs
- PageStatePersister.cs
- ReferencedAssembly.cs
- ListBindableAttribute.cs
- JsonReaderDelegator.cs
- IntegerValidatorAttribute.cs
- StreamingContext.cs
- ThreadStaticAttribute.cs
- Attributes.cs
- CustomTypeDescriptor.cs
- XmlSerializerNamespaces.cs
- WindowsListViewSubItem.cs
- controlskin.cs
- ProtectedConfiguration.cs
- StorageMappingFragment.cs
- Convert.cs
- ThreadAbortException.cs
- documentsequencetextcontainer.cs
- DropTarget.cs
- DependencyPropertyKind.cs
- RootDesignerSerializerAttribute.cs
- _AutoWebProxyScriptEngine.cs
- ParameterCollectionEditorForm.cs
- XmlILOptimizerVisitor.cs
- parserscommon.cs
- DataViewListener.cs
- RectangleGeometry.cs
- SettingsBase.cs
- StylusButton.cs
- ServiceOperationDetailViewControl.cs
- DynamicValidatorEventArgs.cs
- TextAutomationPeer.cs
- Int32Rect.cs
- OleDbException.cs
- ForwardPositionQuery.cs
- DefaultEvaluationContext.cs
- TdsParserSafeHandles.cs
- FontSource.cs
- MediaElementAutomationPeer.cs
- PieceNameHelper.cs
- EntityDataSourceReferenceGroup.cs
- FaultReason.cs
- CollectionViewGroup.cs
- XmlParserContext.cs
- QilName.cs
- InspectionWorker.cs
- SignedXml.cs
- PrivateFontCollection.cs
- StackBuilderSink.cs
- InstanceData.cs
- ToolStripLabel.cs
- DecoderFallbackWithFailureFlag.cs
- XpsS0ValidatingLoader.cs
- ProtocolsConfigurationHandler.cs
- SerializationSectionGroup.cs
- BinaryKeyIdentifierClause.cs
- TreeIterator.cs
- CryptographicAttribute.cs
- ArrangedElement.cs