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
- ObjectKeyFrameCollection.cs
- OleDbConnectionInternal.cs
- OperationResponse.cs
- AbstractDataSvcMapFileLoader.cs
- WebServicesInteroperability.cs
- Directory.cs
- DataGridItemCollection.cs
- Run.cs
- UserNamePasswordValidator.cs
- GridViewUpdateEventArgs.cs
- MetadataArtifactLoaderComposite.cs
- SystemColors.cs
- QuaternionAnimationBase.cs
- WebPermission.cs
- AutoScrollHelper.cs
- RequestUriProcessor.cs
- SmiEventStream.cs
- XmlEncodedRawTextWriter.cs
- MessagePropertyVariants.cs
- SymbolTable.cs
- ModuleBuilder.cs
- KeyConstraint.cs
- ModelTreeManager.cs
- EdmPropertyAttribute.cs
- RolePrincipal.cs
- HierarchicalDataBoundControl.cs
- Int64Converter.cs
- SubpageParaClient.cs
- RelationshipSet.cs
- AppliedDeviceFiltersEditor.cs
- KeyValuePairs.cs
- CollectionViewGroupRoot.cs
- ListViewInsertEventArgs.cs
- TypeLibConverter.cs
- ExpressionBuilder.cs
- DependencyObject.cs
- InvalidFilterCriteriaException.cs
- RuleInfoComparer.cs
- SingleAnimationBase.cs
- ExpressionVisitor.cs
- TextServicesDisplayAttributePropertyRanges.cs
- AsnEncodedData.cs
- NamedObject.cs
- ListSortDescription.cs
- DmlSqlGenerator.cs
- XmlTypeMapping.cs
- HeaderCollection.cs
- InputQueueChannelAcceptor.cs
- SBCSCodePageEncoding.cs
- SqlInternalConnectionSmi.cs
- DateTimeParse.cs
- WindowsNonControl.cs
- QilInvokeLateBound.cs
- ProfileInfo.cs
- DiscoveryClientChannelBase.cs
- AnalyzedTree.cs
- TreeView.cs
- SamlDoNotCacheCondition.cs
- ElementUtil.cs
- TranslateTransform3D.cs
- XmlQueryStaticData.cs
- PenContext.cs
- ListParaClient.cs
- PropertyMap.cs
- TimeZone.cs
- StorageMappingItemLoader.cs
- DataFormats.cs
- EventLogTraceListener.cs
- MatrixAnimationUsingKeyFrames.cs
- ResourceCategoryAttribute.cs
- GZipDecoder.cs
- AccessibleObject.cs
- ToolboxComponentsCreatingEventArgs.cs
- Ipv6Element.cs
- OracleMonthSpan.cs
- HttpCookiesSection.cs
- AudioSignalProblemOccurredEventArgs.cs
- ExtentJoinTreeNode.cs
- DataGridViewElement.cs
- GuidelineSet.cs
- VirtualPath.cs
- SerializationException.cs
- OpCellTreeNode.cs
- Frame.cs
- LinkAreaEditor.cs
- Regex.cs
- CodeTypeReference.cs
- SystemResourceHost.cs
- AnimationLayer.cs
- ColorConverter.cs
- TypefaceMetricsCache.cs
- ArraySortHelper.cs
- DbQueryCommandTree.cs
- MdImport.cs
- ListViewTableCell.cs
- PrinterResolution.cs
- CellConstantDomain.cs
- filewebresponse.cs
- SqlDataSourceCommandEventArgs.cs
- SqlDataSourceAdvancedOptionsForm.cs