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
- BinaryNode.cs
- BinaryMessageEncodingElement.cs
- DateRangeEvent.cs
- Bezier.cs
- RuleRefElement.cs
- ConfigurationSectionHelper.cs
- LineSegment.cs
- ServerIdentity.cs
- MediaEntryAttribute.cs
- TdsParserSessionPool.cs
- AsyncCodeActivityContext.cs
- ScriptComponentDescriptor.cs
- DataGridViewColumnCollection.cs
- SqlFileStream.cs
- ToolStripGrip.cs
- InvalidPrinterException.cs
- UserInitiatedNavigationPermission.cs
- EventArgs.cs
- TypeSource.cs
- oledbconnectionstring.cs
- srgsitem.cs
- GPPOINTF.cs
- UserPreferenceChangedEventArgs.cs
- PackWebRequest.cs
- CompleteWizardStep.cs
- ExtentJoinTreeNode.cs
- PaginationProgressEventArgs.cs
- BitmapImage.cs
- ModelMemberCollection.cs
- SoapTypeAttribute.cs
- StickyNoteAnnotations.cs
- Int64KeyFrameCollection.cs
- WindowsRichEdit.cs
- GeneratedContractType.cs
- ParseHttpDate.cs
- IList.cs
- BaseTreeIterator.cs
- DbProviderSpecificTypePropertyAttribute.cs
- ListItemCollection.cs
- ProfileGroupSettingsCollection.cs
- DirectionalLight.cs
- FileLoadException.cs
- EventDescriptor.cs
- ScriptingRoleServiceSection.cs
- Graphics.cs
- ClientApiGenerator.cs
- NavigateEvent.cs
- TempFiles.cs
- CaseInsensitiveOrdinalStringComparer.cs
- XmlSchemaAnyAttribute.cs
- WebPartCancelEventArgs.cs
- PersonalizationProvider.cs
- JournalEntry.cs
- HeaderedContentControl.cs
- Floater.cs
- StaticFileHandler.cs
- CodeExpressionStatement.cs
- ResourceIDHelper.cs
- HttpServerVarsCollection.cs
- SettingsPropertyValueCollection.cs
- FormViewCommandEventArgs.cs
- CodePageEncoding.cs
- SizeAnimationClockResource.cs
- SettingsAttributes.cs
- DataQuery.cs
- TraceXPathNavigator.cs
- ArgumentValueSerializer.cs
- ListDataBindEventArgs.cs
- SQLString.cs
- TypeDescriptionProvider.cs
- ClientSession.cs
- RawKeyboardInputReport.cs
- NTAccount.cs
- HandledEventArgs.cs
- IntellisenseTextBox.cs
- TemplateInstanceAttribute.cs
- DocumentPageView.cs
- EventLogPermissionAttribute.cs
- CodeAttributeArgument.cs
- ScriptServiceAttribute.cs
- BitStream.cs
- ExpressionStringBuilder.cs
- AuthenticationService.cs
- Model3D.cs
- GuidelineSet.cs
- UnionExpr.cs
- Events.cs
- DetectEofStream.cs
- MarshalByValueComponent.cs
- AssemblyAttributes.cs
- XhtmlCssHandler.cs
- DrawingVisual.cs
- WebPartExportVerb.cs
- TextBoxBase.cs
- MaterialGroup.cs
- CmsInterop.cs
- NetTcpSectionData.cs
- RootAction.cs
- Point4D.cs
- EntityProxyFactory.cs