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
- AnnotationMap.cs
- FormatStringEditor.cs
- AppLevelCompilationSectionCache.cs
- ReadOnlyDataSource.cs
- HtmlContainerControl.cs
- FragmentNavigationEventArgs.cs
- CodeCommentStatement.cs
- PersonalizationDictionary.cs
- Byte.cs
- TextRange.cs
- MultipartIdentifier.cs
- CompressEmulationStream.cs
- MetadataItemEmitter.cs
- TaskbarItemInfo.cs
- TreeNodeStyle.cs
- HttpProcessUtility.cs
- ParameterReplacerVisitor.cs
- TriggerActionCollection.cs
- AppSettingsExpressionBuilder.cs
- TextCompositionEventArgs.cs
- MappingItemCollection.cs
- BoolExpr.cs
- ServiceDocumentFormatter.cs
- M3DUtil.cs
- FileDialogCustomPlacesCollection.cs
- RouteCollection.cs
- SelectedDatesCollection.cs
- HeaderedItemsControl.cs
- DbXmlEnabledProviderManifest.cs
- RegexEditorDialog.cs
- NativeActivityTransactionContext.cs
- SafeNativeMethods.cs
- JsonWriterDelegator.cs
- ScalarConstant.cs
- BrowserCapabilitiesFactoryBase.cs
- ContentWrapperAttribute.cs
- WindowExtensionMethods.cs
- SignatureHelper.cs
- XmlSchemaValidator.cs
- InterleavedZipPartStream.cs
- CompositeTypefaceMetrics.cs
- PropertyAccessVisitor.cs
- XmlLinkedNode.cs
- VirtualDirectoryMappingCollection.cs
- ECDiffieHellmanCng.cs
- HexParser.cs
- PtsHelper.cs
- SrgsElementFactoryCompiler.cs
- StylusPointProperty.cs
- NavigationPropertyEmitter.cs
- EntitySqlQueryBuilder.cs
- PipeStream.cs
- WhitespaceSignificantCollectionAttribute.cs
- PropertyGridView.cs
- RightsManagementResourceHelper.cs
- Rotation3D.cs
- DragAssistanceManager.cs
- ServiceNameElement.cs
- ParentUndoUnit.cs
- SystemIcmpV6Statistics.cs
- ProjectionRewriter.cs
- MemberPath.cs
- SiteMapDataSource.cs
- MetadataItemSerializer.cs
- SplashScreenNativeMethods.cs
- RenderData.cs
- ModuleBuilder.cs
- Helper.cs
- dsa.cs
- CountAggregationOperator.cs
- LockRecursionException.cs
- CodeObject.cs
- ConfigurationManagerHelper.cs
- TemplateColumn.cs
- SecurityTokenTypes.cs
- BufferAllocator.cs
- LOSFormatter.cs
- PartialList.cs
- Int64Storage.cs
- SchemaMapping.cs
- Rotation3D.cs
- CodeDomConfigurationHandler.cs
- Container.cs
- DBCommand.cs
- DataBoundControlParameterTarget.cs
- WebServiceEnumData.cs
- PackageRelationshipSelector.cs
- ColumnMap.cs
- ManagementEventArgs.cs
- SiteMapSection.cs
- DeviceSpecific.cs
- FixedSOMLineRanges.cs
- PasswordRecovery.cs
- PeerNearMe.cs
- FlowDocumentReader.cs
- ProxyWebPart.cs
- RotateTransform.cs
- SeekStoryboard.cs
- DataServiceProviderMethods.cs
- InheritanceUI.cs