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
- ProfileInfo.cs
- BooleanToVisibilityConverter.cs
- SiteMapNodeCollection.cs
- MobileCategoryAttribute.cs
- FreezableDefaultValueFactory.cs
- Point3DKeyFrameCollection.cs
- BasePattern.cs
- CreateParams.cs
- IndentTextWriter.cs
- AttributeData.cs
- DeviceOverridableAttribute.cs
- NavigationWindow.cs
- RuleElement.cs
- TimeoutHelper.cs
- RawStylusInput.cs
- RsaElement.cs
- QueryExecutionOption.cs
- SqlNodeAnnotation.cs
- Container.cs
- ImmComposition.cs
- AuthenticationSection.cs
- ViewSimplifier.cs
- SocketException.cs
- NumberSubstitution.cs
- RTLAwareMessageBox.cs
- DetailsView.cs
- EventPropertyMap.cs
- EventLogPermission.cs
- SecurityManager.cs
- ManagedFilter.cs
- HealthMonitoringSection.cs
- AddInDeploymentState.cs
- TraceFilter.cs
- LayoutUtils.cs
- DropDownList.cs
- ISFClipboardData.cs
- CoTaskMemHandle.cs
- OperatorExpressions.cs
- TransformerInfoCollection.cs
- SessionStateSection.cs
- ReaderWriterLockSlim.cs
- Vector.cs
- CombinedHttpChannel.cs
- System.Data_BID.cs
- ServiceProviders.cs
- Currency.cs
- EncryptedKeyHashIdentifierClause.cs
- HeaderedItemsControl.cs
- HttpListenerRequest.cs
- SourceChangedEventArgs.cs
- XmlSchemas.cs
- FixedSOMContainer.cs
- VariableAction.cs
- MessagePropertyDescription.cs
- RawUIStateInputReport.cs
- SqlWebEventProvider.cs
- JavascriptCallbackResponseProperty.cs
- RequiredFieldValidator.cs
- LoginName.cs
- FontStretchConverter.cs
- SelectionPattern.cs
- EntitySqlQueryCacheKey.cs
- linebase.cs
- GridSplitterAutomationPeer.cs
- SchemaAttDef.cs
- SafeLibraryHandle.cs
- ContentElementAutomationPeer.cs
- glyphs.cs
- HttpListenerContext.cs
- AudioSignalProblemOccurredEventArgs.cs
- dtdvalidator.cs
- FilteredReadOnlyMetadataCollection.cs
- odbcmetadatacolumnnames.cs
- SqlResolver.cs
- Substitution.cs
- SqlDataSourceView.cs
- XmlMemberMapping.cs
- LogAppendAsyncResult.cs
- TreeViewCancelEvent.cs
- Line.cs
- NameValueSectionHandler.cs
- TextBox.cs
- InkCanvasInnerCanvas.cs
- FactoryId.cs
- MulticastDelegate.cs
- __Filters.cs
- Registry.cs
- WinEventQueueItem.cs
- SqlDependencyListener.cs
- FileInfo.cs
- WebPartEditorCancelVerb.cs
- AppSettingsReader.cs
- MethodToken.cs
- IpcClientChannel.cs
- SwitchElementsCollection.cs
- SimplePropertyEntry.cs
- SiteMapNodeItemEventArgs.cs
- SectionUpdates.cs
- SqlComparer.cs
- EmptyEnumerable.cs