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
- RowToParametersTransformer.cs
- MetafileHeaderWmf.cs
- TextLineResult.cs
- File.cs
- Size.cs
- AutoResetEvent.cs
- EndpointDesigner.cs
- KeyedCollection.cs
- WebPartActionVerb.cs
- TabPage.cs
- TemplateFactory.cs
- PropertyMap.cs
- SoapAttributeOverrides.cs
- BitConverter.cs
- SymLanguageType.cs
- CodeSnippetCompileUnit.cs
- EditingCommands.cs
- HtmlDocument.cs
- DeflateStream.cs
- StringCollection.cs
- SkinBuilder.cs
- VectorKeyFrameCollection.cs
- AliasGenerator.cs
- HandlerWithFactory.cs
- CodeDelegateInvokeExpression.cs
- EncodingDataItem.cs
- SerializationEventsCache.cs
- ActiveXSite.cs
- DeleteMemberBinder.cs
- AutoGeneratedField.cs
- TextBoxBase.cs
- HtmlInputHidden.cs
- SoapObjectWriter.cs
- WebRequestModuleElementCollection.cs
- Point4DConverter.cs
- LinkedResourceCollection.cs
- ProcessModuleCollection.cs
- CacheEntry.cs
- securestring.cs
- CacheAxisQuery.cs
- DeferredSelectedIndexReference.cs
- TraceHandlerErrorFormatter.cs
- ApplicationManager.cs
- CodeExpressionStatement.cs
- BufferAllocator.cs
- EnumerationRangeValidationUtil.cs
- MimeTypeAttribute.cs
- InheritanceRules.cs
- WebPartsPersonalizationAuthorization.cs
- EventlogProvider.cs
- ToolboxCategoryItems.cs
- HttpListenerElement.cs
- QilGenerator.cs
- WebPartConnectionsCloseVerb.cs
- RightsManagementPermission.cs
- TextTreeUndo.cs
- AlphaSortedEnumConverter.cs
- HttpPostedFile.cs
- _LoggingObject.cs
- DefaultWorkflowSchedulerService.cs
- ControlType.cs
- ColumnResizeUndoUnit.cs
- XmlSchemaSimpleTypeRestriction.cs
- SchemaType.cs
- IpcChannel.cs
- LookupBindingPropertiesAttribute.cs
- HttpValueCollection.cs
- TextRunCache.cs
- PoisonMessageException.cs
- EventToken.cs
- input.cs
- TypeForwardedToAttribute.cs
- PolyBezierSegment.cs
- LateBoundBitmapDecoder.cs
- TableDetailsRow.cs
- ItemDragEvent.cs
- CodeDomConfigurationHandler.cs
- Encoder.cs
- PenLineJoinValidation.cs
- KeyMatchBuilder.cs
- ConsoleCancelEventArgs.cs
- ListDesigner.cs
- HtmlElementEventArgs.cs
- ResolveMatchesMessage11.cs
- SoapProtocolImporter.cs
- ToolStripContentPanelRenderEventArgs.cs
- EmptyQuery.cs
- LinkedList.cs
- TemplateBuilder.cs
- ClonableStack.cs
- TextBlockAutomationPeer.cs
- TableParagraph.cs
- ValidationRule.cs
- BufferedOutputAsyncStream.cs
- glyphs.cs
- SafeSecurityHandles.cs
- QueryParameter.cs
- ProviderConnectionPoint.cs
- CacheSection.cs
- PersistenceException.cs