Code:
/ Dotnetfx_Vista_SP2 / Dotnetfx_Vista_SP2 / 8.0.50727.4016 / DEVDIV / depot / DevDiv / releases / whidbey / NetFxQFE / 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
- QilCloneVisitor.cs
- HttpApplicationStateBase.cs
- DocumentReferenceCollection.cs
- Set.cs
- Win32Exception.cs
- SpeechSeg.cs
- EventLogPermissionEntry.cs
- NameNode.cs
- SqlErrorCollection.cs
- XmlEncoding.cs
- SqlServer2KCompatibilityAnnotation.cs
- CheckBoxList.cs
- DataRowView.cs
- DataColumnMapping.cs
- KernelTypeValidation.cs
- UnsafeNativeMethods.cs
- TreeNodeEventArgs.cs
- ReferenceConverter.cs
- InfoCardTrace.cs
- MarshalByRefObject.cs
- MetadataCache.cs
- TemplateFactory.cs
- Resources.Designer.cs
- SubclassTypeValidator.cs
- RequestQueue.cs
- CorrelationManager.cs
- X509Utils.cs
- COAUTHIDENTITY.cs
- ScrollItemProviderWrapper.cs
- TextChange.cs
- ReaderOutput.cs
- X509CertificateTrustedIssuerElement.cs
- xmlsaver.cs
- SplitterCancelEvent.cs
- ZoomingMessageFilter.cs
- XmlTextReader.cs
- DefaultPropertiesToSend.cs
- DbConnectionPoolCounters.cs
- SqlXmlStorage.cs
- ToolConsole.cs
- HttpWebResponse.cs
- TransformProviderWrapper.cs
- PageCodeDomTreeGenerator.cs
- SessionStateContainer.cs
- LinkLabel.cs
- ControlUtil.cs
- EmptyQuery.cs
- CodeDelegateCreateExpression.cs
- SpotLight.cs
- HttpListener.cs
- ConfigXmlSignificantWhitespace.cs
- FrameworkElement.cs
- ScanQueryOperator.cs
- ScalarConstant.cs
- JoinSymbol.cs
- HttpRequest.cs
- Rectangle.cs
- Dictionary.cs
- WindowsEditBox.cs
- InkCanvas.cs
- ContractMethodParameterInfo.cs
- ClientType.cs
- RuntimeArgumentHandle.cs
- SimpleTextLine.cs
- DataSourceXmlSerializer.cs
- DoubleStorage.cs
- Serialization.cs
- JoinGraph.cs
- TimelineCollection.cs
- bindurihelper.cs
- FrugalMap.cs
- Walker.cs
- BackStopAuthenticationModule.cs
- SendMailErrorEventArgs.cs
- DataControlFieldCell.cs
- GeometryCombineModeValidation.cs
- RewritingProcessor.cs
- CSharpCodeProvider.cs
- XmlSchemaAttribute.cs
- PathGeometry.cs
- SQLBytes.cs
- MachineSettingsSection.cs
- WorkflowRuntimeService.cs
- PersistChildrenAttribute.cs
- AmbientLight.cs
- PropertyItemInternal.cs
- BinaryCommonClasses.cs
- CounterSetInstanceCounterDataSet.cs
- FactorySettingsElement.cs
- Comparer.cs
- MenuItem.cs
- RootBrowserWindowProxy.cs
- RefreshResponseInfo.cs
- Camera.cs
- XhtmlTextWriter.cs
- TagPrefixInfo.cs
- KeyEventArgs.cs
- EnumType.cs
- AttachedPropertyInfo.cs
- GlobalizationSection.cs