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
- EventProviderTraceListener.cs
- RuleSet.cs
- EntityCodeGenerator.cs
- ChameleonKey.cs
- MatchingStyle.cs
- NamespaceDisplay.xaml.cs
- DataGridSortCommandEventArgs.cs
- XPathSelectionIterator.cs
- SwitchLevelAttribute.cs
- TreeNodeBindingCollection.cs
- HttpListenerRequest.cs
- ListViewItem.cs
- SystemIcmpV6Statistics.cs
- FamilyMap.cs
- HandledMouseEvent.cs
- RefreshPropertiesAttribute.cs
- MD5CryptoServiceProvider.cs
- FreezableDefaultValueFactory.cs
- ThaiBuddhistCalendar.cs
- BaseProcessor.cs
- ToolStripProgressBar.cs
- DESCryptoServiceProvider.cs
- SspiHelper.cs
- InkCanvasInnerCanvas.cs
- AdornerPresentationContext.cs
- PathHelper.cs
- DataGridViewRowErrorTextNeededEventArgs.cs
- Rotation3D.cs
- ProtocolsConfigurationEntry.cs
- NetSectionGroup.cs
- AsyncDataRequest.cs
- FileDialogPermission.cs
- RowToParametersTransformer.cs
- Walker.cs
- CompleteWizardStep.cs
- Enlistment.cs
- IndexingContentUnit.cs
- XmlSchemaAny.cs
- UpdateProgress.cs
- ConfigurationValidatorAttribute.cs
- VirtualDirectoryMapping.cs
- ContentPlaceHolder.cs
- RequestCacheManager.cs
- TreeWalker.cs
- TreeNodeStyleCollection.cs
- CodeGeneratorOptions.cs
- Highlights.cs
- ProviderSettings.cs
- CompilerInfo.cs
- AppSettingsExpressionBuilder.cs
- CodeDomSerializationProvider.cs
- TreeViewHitTestInfo.cs
- AuthenticationServiceManager.cs
- RelationshipNavigation.cs
- HotSpot.cs
- DesignerCommandSet.cs
- VerifyHashRequest.cs
- Cursors.cs
- XmlCharCheckingReader.cs
- WebPartUtil.cs
- StorageComplexTypeMapping.cs
- AccessControlList.cs
- ProcessHostMapPath.cs
- AttachInfo.cs
- OdbcStatementHandle.cs
- TemplateAction.cs
- SecurityTokenTypes.cs
- HttpSocketManager.cs
- RoutedEventArgs.cs
- SweepDirectionValidation.cs
- SqlUtil.cs
- XsdDateTime.cs
- WebErrorHandler.cs
- ChangeConflicts.cs
- BaseTemplateCodeDomTreeGenerator.cs
- _LoggingObject.cs
- MSAANativeProvider.cs
- Wizard.cs
- NonceToken.cs
- X509Utils.cs
- ProfileManager.cs
- Imaging.cs
- ClassHandlersStore.cs
- DesignerAttributeInfo.cs
- TreeChangeInfo.cs
- EventTrigger.cs
- WebPartTracker.cs
- NgenServicingAttributes.cs
- BitmapPalettes.cs
- WebPartTracker.cs
- ServicePointManager.cs
- RectangleHotSpot.cs
- Single.cs
- BamlBinaryWriter.cs
- ParentQuery.cs
- ChannelServices.cs
- DataGridViewCellValidatingEventArgs.cs
- XPathDocumentBuilder.cs
- SuppressMessageAttribute.cs
- followingsibling.cs