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
- TripleDES.cs
- ParseNumbers.cs
- WriteableOnDemandPackagePart.cs
- SrgsElementFactory.cs
- DataRelationCollection.cs
- WithParamAction.cs
- FormatterConverter.cs
- StrokeCollectionConverter.cs
- CurrentChangingEventManager.cs
- SerialReceived.cs
- NetMsmqSecurityMode.cs
- TypeResolvingOptions.cs
- Events.cs
- InfoCardArgumentException.cs
- Decimal.cs
- HttpMethodAttribute.cs
- SqlInternalConnection.cs
- UITypeEditor.cs
- Nullable.cs
- peernodeimplementation.cs
- DataServiceProviderMethods.cs
- ServicePoint.cs
- WindowsButton.cs
- RemotingException.cs
- LateBoundBitmapDecoder.cs
- ProgressBar.cs
- CodeGotoStatement.cs
- FontInfo.cs
- mactripleDES.cs
- DataRowCollection.cs
- ApplicationId.cs
- XamlToRtfWriter.cs
- IntSecurity.cs
- Parameter.cs
- PersonalizationAdministration.cs
- Journal.cs
- dtdvalidator.cs
- InitiatorSessionSymmetricTransportSecurityProtocol.cs
- StylusButtonEventArgs.cs
- BezierSegment.cs
- WinCategoryAttribute.cs
- StreamInfo.cs
- SchemaNotation.cs
- FixedTextContainer.cs
- TextElementCollection.cs
- StatusCommandUI.cs
- ShutDownListener.cs
- SurrogateEncoder.cs
- UnknownBitmapDecoder.cs
- OleDbConnectionFactory.cs
- LayoutEditorPart.cs
- CompiledXpathExpr.cs
- SynchronizedDispatch.cs
- HtmlElementErrorEventArgs.cs
- HttpApplicationFactory.cs
- XPathDocumentNavigator.cs
- UserCancellationException.cs
- BufferAllocator.cs
- RowTypePropertyElement.cs
- XmlSchemaSimpleContent.cs
- TextRunTypographyProperties.cs
- CharKeyFrameCollection.cs
- WmlLiteralTextAdapter.cs
- SuppressMessageAttribute.cs
- PartitionResolver.cs
- BevelBitmapEffect.cs
- AutoSizeToolBoxItem.cs
- ShapingEngine.cs
- MatrixTransform3D.cs
- EntryIndex.cs
- Double.cs
- WindowsNonControl.cs
- BaseDataListPage.cs
- NullableConverter.cs
- Error.cs
- SByte.cs
- TextEffect.cs
- UpDownBase.cs
- XPathArrayIterator.cs
- FontUnit.cs
- ConfigurationValidatorBase.cs
- Method.cs
- SrgsElement.cs
- BoundField.cs
- CompiledIdentityConstraint.cs
- BrowserDefinition.cs
- ToolStripPanelCell.cs
- OrderedDictionaryStateHelper.cs
- SizeChangedInfo.cs
- IImplicitResourceProvider.cs
- FixedDocument.cs
- ItemContainerGenerator.cs
- Int32.cs
- DataGridTable.cs
- RepeatInfo.cs
- DrawingBrush.cs
- BinaryWriter.cs
- ObjectTag.cs
- objectquery_tresulttype.cs
- InputScopeConverter.cs