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
- TypeInfo.cs
- KnownBoxes.cs
- WindowsAltTab.cs
- ModelServiceImpl.cs
- IODescriptionAttribute.cs
- MapPathBasedVirtualPathProvider.cs
- DCSafeHandle.cs
- UrlAuthFailedErrorFormatter.cs
- PrintPageEvent.cs
- BufferModesCollection.cs
- DataChangedEventManager.cs
- XmlHierarchicalEnumerable.cs
- SizeAnimationUsingKeyFrames.cs
- XPathNodePointer.cs
- dataprotectionpermission.cs
- WebHttpBinding.cs
- FontUnit.cs
- FormatException.cs
- XhtmlBasicObjectListAdapter.cs
- DataGridViewDataConnection.cs
- SoapTypeAttribute.cs
- Equal.cs
- TextTreeRootNode.cs
- MultilineStringConverter.cs
- PeerNameRecordCollection.cs
- EditorBrowsableAttribute.cs
- WinEventTracker.cs
- LoginName.cs
- Positioning.cs
- MimeTypeMapper.cs
- CorrelationExtension.cs
- StyleSelector.cs
- InfoCardRSAPKCS1SignatureFormatter.cs
- ModelTreeEnumerator.cs
- ListControlConvertEventArgs.cs
- GlyphRun.cs
- InvokePattern.cs
- SymLanguageVendor.cs
- TemplateControl.cs
- TrackingStringDictionary.cs
- SqlClientWrapperSmiStream.cs
- XmlWellformedWriter.cs
- StorageAssociationTypeMapping.cs
- ConfigXmlReader.cs
- SafeLibraryHandle.cs
- Pair.cs
- DocumentReference.cs
- NoneExcludedImageIndexConverter.cs
- XmlReflectionMember.cs
- WhitespaceSignificantCollectionAttribute.cs
- CheckBoxList.cs
- TreeView.cs
- Win32.cs
- CalendarTable.cs
- EmptyStringExpandableObjectConverter.cs
- Properties.cs
- LinkedResourceCollection.cs
- DoubleUtil.cs
- fixedPageContentExtractor.cs
- PathNode.cs
- COM2ColorConverter.cs
- BackgroundFormatInfo.cs
- MetadataSerializer.cs
- RepeaterItemEventArgs.cs
- ToolStripOverflow.cs
- RecognizedAudio.cs
- SQLInt16Storage.cs
- InternalControlCollection.cs
- EntityDataSourceContainerNameItem.cs
- KerberosTicketHashIdentifierClause.cs
- CompressionTransform.cs
- ObjectAnimationUsingKeyFrames.cs
- LineSegment.cs
- ChildChangedEventArgs.cs
- NavigationWindowAutomationPeer.cs
- RelationshipManager.cs
- GacUtil.cs
- DataBindEngine.cs
- QueryContinueDragEventArgs.cs
- DataBoundControlParameterTarget.cs
- MgmtConfigurationRecord.cs
- EDesignUtil.cs
- Formatter.cs
- PrintingPermissionAttribute.cs
- ActivityFunc.cs
- EndEvent.cs
- glyphs.cs
- PartialCachingControl.cs
- TrackingMemoryStreamFactory.cs
- DBAsyncResult.cs
- SqlTrackingService.cs
- PtsPage.cs
- CharacterBuffer.cs
- NullRuntimeConfig.cs
- SpellCheck.cs
- XmlReaderDelegator.cs
- InkSerializer.cs
- Attributes.cs
- ByteKeyFrameCollection.cs
- CheckedListBox.cs