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
- DefaultTextStoreTextComposition.cs
- DataGrid.cs
- Delegate.cs
- DataGridViewColumnEventArgs.cs
- DataGridViewBand.cs
- RightsManagementManager.cs
- ControlFilterExpression.cs
- SByteStorage.cs
- PositiveTimeSpanValidator.cs
- ExtensionSimplifierMarkupObject.cs
- FlowLayoutPanel.cs
- ExtensionFile.cs
- EntitySetBaseCollection.cs
- SafeCloseHandleCritical.cs
- UrlPropertyAttribute.cs
- SamlAuthorityBinding.cs
- GeometryModel3D.cs
- SchemaNamespaceManager.cs
- Stopwatch.cs
- DaylightTime.cs
- TypeForwardedToAttribute.cs
- SizeConverter.cs
- IERequestCache.cs
- SplitterEvent.cs
- PrincipalPermissionMode.cs
- SafeEventLogWriteHandle.cs
- ListViewDataItem.cs
- CapabilitiesSection.cs
- CommonGetThemePartSize.cs
- NTAccount.cs
- SmiGettersStream.cs
- OracleInternalConnection.cs
- DataTemplate.cs
- WindowsRichEditRange.cs
- WebPartCollection.cs
- NullReferenceException.cs
- SecurityTokenAuthenticator.cs
- RegexCharClass.cs
- ContentValidator.cs
- VisualState.cs
- ResXDataNode.cs
- SystemSounds.cs
- ObjectParameterCollection.cs
- Ref.cs
- ByteStream.cs
- FunctionImportMapping.ReturnTypeRenameMapping.cs
- TranslateTransform.cs
- GiveFeedbackEventArgs.cs
- SQLBinaryStorage.cs
- ArgIterator.cs
- SynthesizerStateChangedEventArgs.cs
- CompilationSection.cs
- EntityDataSourceDesigner.cs
- QfeChecker.cs
- DecoderFallbackWithFailureFlag.cs
- SystemFonts.cs
- DurableServiceAttribute.cs
- Oci.cs
- CollectionsUtil.cs
- IntSecurity.cs
- XsltInput.cs
- EntityCommandCompilationException.cs
- ComNativeDescriptor.cs
- PolicyLevel.cs
- NavigateEvent.cs
- ReferencedCollectionType.cs
- DataObjectFieldAttribute.cs
- FontDialog.cs
- ListViewCommandEventArgs.cs
- WizardForm.cs
- RootBrowserWindowProxy.cs
- ImageMap.cs
- DataBindingExpressionBuilder.cs
- MenuAutoFormat.cs
- OleDbEnumerator.cs
- ActivityExecutionFilter.cs
- ResXResourceSet.cs
- MessageAction.cs
- DataGridViewSelectedCellCollection.cs
- DataKey.cs
- HotSpot.cs
- ActivitySurrogateSelector.cs
- RemoteWebConfigurationHostServer.cs
- dataobject.cs
- QueryOperator.cs
- ConvertTextFrag.cs
- CodeMethodReturnStatement.cs
- ExpressionBuilderCollection.cs
- TypeConverterAttribute.cs
- ComponentConverter.cs
- XmlSerializerVersionAttribute.cs
- CounterSetInstanceCounterDataSet.cs
- ParameterBuilder.cs
- TrackingParameters.cs
- Parser.cs
- RegexCharClass.cs
- BindingExpressionBase.cs
- GridViewUpdateEventArgs.cs
- RegistrationContext.cs
- WebPartConnectionCollection.cs