Code:
/ Net / Net / 3.5.50727.3053 / DEVDIV / depot / DevDiv / releases / whidbey / netfxsp / 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
- EditingCommands.cs
- StylusShape.cs
- MeasurementDCInfo.cs
- ContextMenuStrip.cs
- OutputCacheProfileCollection.cs
- WindowsFont.cs
- HttpCookie.cs
- CheckableControlBaseAdapter.cs
- RegexCompilationInfo.cs
- GridViewCancelEditEventArgs.cs
- GridItem.cs
- Int16Storage.cs
- TextElement.cs
- DataGridViewButtonCell.cs
- TrackingStringDictionary.cs
- DataGridDetailsPresenterAutomationPeer.cs
- WizardPanel.cs
- ContentPlaceHolder.cs
- SHA384Managed.cs
- ObjectViewListener.cs
- ImageSource.cs
- ExtensionWindowHeader.cs
- WebScriptClientGenerator.cs
- StylusPointPropertyInfoDefaults.cs
- DoubleLinkListEnumerator.cs
- ValidatorCompatibilityHelper.cs
- VariableReference.cs
- DeclarativeExpressionConditionDeclaration.cs
- shaperfactoryquerycachekey.cs
- DataTableReader.cs
- ImageAttributes.cs
- SuppressMergeCheckAttribute.cs
- RtfToXamlLexer.cs
- TextRangeSerialization.cs
- SqlDataSourceQuery.cs
- assertwrapper.cs
- WebResourceUtil.cs
- HttpListenerException.cs
- CmsInterop.cs
- UriSchemeKeyedCollection.cs
- CodeAttributeDeclaration.cs
- AppDomainFactory.cs
- Stackframe.cs
- GeometryGroup.cs
- ServerValidateEventArgs.cs
- EditingScope.cs
- ImageAutomationPeer.cs
- Mutex.cs
- FixUpCollection.cs
- ShortcutKeysEditor.cs
- IgnoreDeviceFilterElement.cs
- FormParameter.cs
- NavigateEvent.cs
- WarningException.cs
- PropertyEntry.cs
- SourceSwitch.cs
- DWriteFactory.cs
- DataGridViewRowConverter.cs
- ToolStripItemClickedEventArgs.cs
- FormsIdentity.cs
- Cell.cs
- EntityClassGenerator.cs
- TextWriter.cs
- PeerNameResolver.cs
- HttpListener.cs
- KeyedCollection.cs
- WebColorConverter.cs
- AdapterUtil.cs
- DataGridViewElement.cs
- MethodSet.cs
- DataGridViewCellEventArgs.cs
- Thread.cs
- TransformedBitmap.cs
- TileBrush.cs
- RelationshipWrapper.cs
- SvcFileManager.cs
- QuaternionAnimationBase.cs
- ScriptReferenceEventArgs.cs
- ShaderEffect.cs
- EncoderBestFitFallback.cs
- DataKeyArray.cs
- Root.cs
- MediaTimeline.cs
- ConnectionConsumerAttribute.cs
- UnsafeNativeMethods.cs
- SqlDataSourceSummaryPanel.cs
- PersonalizationProvider.cs
- SqlDataReaderSmi.cs
- AmbientLight.cs
- OracleConnectionFactory.cs
- MethodBuilder.cs
- ProbeMatchesMessageCD1.cs
- HierarchicalDataBoundControlAdapter.cs
- EncoderParameters.cs
- WeakEventManager.cs
- FrameworkContentElementAutomationPeer.cs
- ComContractElementCollection.cs
- Grid.cs
- AssemblyHash.cs
- ChannelSinkStacks.cs