Code:
/ Net / Net / 3.5.50727.3053 / DEVDIV / depot / DevDiv / releases / Orcas / SP / wpf / src / Core / CSharp / MS / Internal / Ink / StrokeIntersection.cs / 1 / StrokeIntersection.cs
//------------------------------------------------------------------------ //// Copyright (c) Microsoft Corporation. All rights reserved. // //----------------------------------------------------------------------- using MS.Internal; using MS.Internal.Ink; using MS.Utility; using System; using System.Windows; using System.Collections.Generic; using System.Globalization; namespace System.Windows.Ink { ////// A helper struct that represents a fragment of a stroke spine. /// internal struct StrokeIntersection { #region Private statics private static StrokeIntersection s_empty = new StrokeIntersection(AfterLast, AfterLast, BeforeFirst, BeforeFirst); private static StrokeIntersection s_full = new StrokeIntersection(BeforeFirst, BeforeFirst, AfterLast, AfterLast); #endregion #region Public API ////// BeforeFirst /// ///internal static double BeforeFirst { get { return StrokeFIndices.BeforeFirst; } } /// /// AfterLast /// ///internal static double AfterLast { get { return StrokeFIndices.AfterLast; } } /// /// Constructor /// /// /// /// /// internal StrokeIntersection(double hitBegin, double inBegin, double inEnd, double hitEnd) { //ISSUE-2004/12/06-XiaoTu: should we validate the input? _hitSegment = new StrokeFIndices(hitBegin, hitEnd); _inSegment = new StrokeFIndices(inBegin, inEnd); } ////// hitBeginFIndex /// ///internal double HitBegin { set { _hitSegment.BeginFIndex = value; } } /// /// hitEndFIndex /// ///internal double HitEnd { get { return _hitSegment.EndFIndex; } set { _hitSegment.EndFIndex = value; } } /// /// InBegin /// ///internal double InBegin { get { return _inSegment.BeginFIndex; } set { _inSegment.BeginFIndex = value; } } /// /// InEnd /// ///internal double InEnd { get { return _inSegment.EndFIndex; } set { _inSegment.EndFIndex = value; } } /// /// ToString /// public override string ToString() { return "{" + StrokeFIndices.GetStringRepresentation(_hitSegment.BeginFIndex) + "," + StrokeFIndices.GetStringRepresentation(_inSegment.BeginFIndex) + "," + StrokeFIndices.GetStringRepresentation(_inSegment.EndFIndex) + "," + StrokeFIndices.GetStringRepresentation(_hitSegment.EndFIndex) + "}"; } ////// Equals /// /// ///public override bool Equals(Object obj) { // Check for null and compare run-time types if (obj == null || GetType() != obj.GetType()) return false; return ((StrokeIntersection)obj == this); } /// /// GetHashCode /// ///public override int GetHashCode() { return _hitSegment.GetHashCode() ^ _inSegment.GetHashCode(); } /// /// operator == /// /// /// ///public static bool operator ==(StrokeIntersection left, StrokeIntersection right) { return (left._hitSegment == right._hitSegment && left._inSegment == right._inSegment); } /// /// operator != /// /// /// ///public static bool operator !=(StrokeIntersection left, StrokeIntersection right) { return !(left == right); } #endregion #region Internal API /// /// /// internal static StrokeIntersection Full { get { return s_full; } } ////// /// internal bool IsEmpty { get { return _hitSegment.IsEmpty; } } ////// /// internal StrokeFIndices HitSegment { get { return _hitSegment; } } ////// /// internal StrokeFIndices InSegment { get { return _inSegment; } } #endregion #region Internal static methods ////// Get the "in-segments" of the intersections. /// internal static StrokeFIndices[] GetInSegments(StrokeIntersection[] intersections) { System.Diagnostics.Debug.Assert(intersections != null); System.Diagnostics.Debug.Assert(intersections.Length > 0); ListinFIndices = new List (intersections.Length); for (int j = 0; j < intersections.Length; j++) { System.Diagnostics.Debug.Assert(!intersections[j].IsEmpty); if (!intersections[j].InSegment.IsEmpty) { if (inFIndices.Count > 0 && inFIndices[inFIndices.Count - 1].EndFIndex >= intersections[j].InSegment.BeginFIndex) { //merge StrokeFIndices sfiPrevious = inFIndices[inFIndices.Count - 1]; sfiPrevious.EndFIndex = intersections[j].InSegment.EndFIndex; inFIndices[inFIndices.Count - 1] = sfiPrevious; } else { inFIndices.Add(intersections[j].InSegment); } } } return inFIndices.ToArray(); } /// /// Get the "hit-segments" /// internal static StrokeFIndices[] GetHitSegments(StrokeIntersection[] intersections) { System.Diagnostics.Debug.Assert(intersections != null); System.Diagnostics.Debug.Assert(intersections.Length > 0); ListhitFIndices = new List (intersections.Length); for (int j = 0; j < intersections.Length; j++) { System.Diagnostics.Debug.Assert(!intersections[j].IsEmpty); if (!intersections[j].HitSegment.IsEmpty) { if (hitFIndices.Count > 0 && hitFIndices[hitFIndices.Count - 1].EndFIndex >= intersections[j].HitSegment.BeginFIndex) { //merge StrokeFIndices sfiPrevious = hitFIndices[hitFIndices.Count - 1]; sfiPrevious.EndFIndex = intersections[j].HitSegment.EndFIndex; hitFIndices[hitFIndices.Count - 1] = sfiPrevious; } else { hitFIndices.Add(intersections[j].HitSegment); } } } return hitFIndices.ToArray(); } #endregion #region Fields private StrokeFIndices _hitSegment; private StrokeFIndices _inSegment; #endregion } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007. //------------------------------------------------------------------------ // // Copyright (c) Microsoft Corporation. All rights reserved. // //----------------------------------------------------------------------- using MS.Internal; using MS.Internal.Ink; using MS.Utility; using System; using System.Windows; using System.Collections.Generic; using System.Globalization; namespace System.Windows.Ink { ////// A helper struct that represents a fragment of a stroke spine. /// internal struct StrokeIntersection { #region Private statics private static StrokeIntersection s_empty = new StrokeIntersection(AfterLast, AfterLast, BeforeFirst, BeforeFirst); private static StrokeIntersection s_full = new StrokeIntersection(BeforeFirst, BeforeFirst, AfterLast, AfterLast); #endregion #region Public API ////// BeforeFirst /// ///internal static double BeforeFirst { get { return StrokeFIndices.BeforeFirst; } } /// /// AfterLast /// ///internal static double AfterLast { get { return StrokeFIndices.AfterLast; } } /// /// Constructor /// /// /// /// /// internal StrokeIntersection(double hitBegin, double inBegin, double inEnd, double hitEnd) { //ISSUE-2004/12/06-XiaoTu: should we validate the input? _hitSegment = new StrokeFIndices(hitBegin, hitEnd); _inSegment = new StrokeFIndices(inBegin, inEnd); } ////// hitBeginFIndex /// ///internal double HitBegin { set { _hitSegment.BeginFIndex = value; } } /// /// hitEndFIndex /// ///internal double HitEnd { get { return _hitSegment.EndFIndex; } set { _hitSegment.EndFIndex = value; } } /// /// InBegin /// ///internal double InBegin { get { return _inSegment.BeginFIndex; } set { _inSegment.BeginFIndex = value; } } /// /// InEnd /// ///internal double InEnd { get { return _inSegment.EndFIndex; } set { _inSegment.EndFIndex = value; } } /// /// ToString /// public override string ToString() { return "{" + StrokeFIndices.GetStringRepresentation(_hitSegment.BeginFIndex) + "," + StrokeFIndices.GetStringRepresentation(_inSegment.BeginFIndex) + "," + StrokeFIndices.GetStringRepresentation(_inSegment.EndFIndex) + "," + StrokeFIndices.GetStringRepresentation(_hitSegment.EndFIndex) + "}"; } ////// Equals /// /// ///public override bool Equals(Object obj) { // Check for null and compare run-time types if (obj == null || GetType() != obj.GetType()) return false; return ((StrokeIntersection)obj == this); } /// /// GetHashCode /// ///public override int GetHashCode() { return _hitSegment.GetHashCode() ^ _inSegment.GetHashCode(); } /// /// operator == /// /// /// ///public static bool operator ==(StrokeIntersection left, StrokeIntersection right) { return (left._hitSegment == right._hitSegment && left._inSegment == right._inSegment); } /// /// operator != /// /// /// ///public static bool operator !=(StrokeIntersection left, StrokeIntersection right) { return !(left == right); } #endregion #region Internal API /// /// /// internal static StrokeIntersection Full { get { return s_full; } } ////// /// internal bool IsEmpty { get { return _hitSegment.IsEmpty; } } ////// /// internal StrokeFIndices HitSegment { get { return _hitSegment; } } ////// /// internal StrokeFIndices InSegment { get { return _inSegment; } } #endregion #region Internal static methods ////// Get the "in-segments" of the intersections. /// internal static StrokeFIndices[] GetInSegments(StrokeIntersection[] intersections) { System.Diagnostics.Debug.Assert(intersections != null); System.Diagnostics.Debug.Assert(intersections.Length > 0); ListinFIndices = new List (intersections.Length); for (int j = 0; j < intersections.Length; j++) { System.Diagnostics.Debug.Assert(!intersections[j].IsEmpty); if (!intersections[j].InSegment.IsEmpty) { if (inFIndices.Count > 0 && inFIndices[inFIndices.Count - 1].EndFIndex >= intersections[j].InSegment.BeginFIndex) { //merge StrokeFIndices sfiPrevious = inFIndices[inFIndices.Count - 1]; sfiPrevious.EndFIndex = intersections[j].InSegment.EndFIndex; inFIndices[inFIndices.Count - 1] = sfiPrevious; } else { inFIndices.Add(intersections[j].InSegment); } } } return inFIndices.ToArray(); } /// /// Get the "hit-segments" /// internal static StrokeFIndices[] GetHitSegments(StrokeIntersection[] intersections) { System.Diagnostics.Debug.Assert(intersections != null); System.Diagnostics.Debug.Assert(intersections.Length > 0); ListhitFIndices = new List (intersections.Length); for (int j = 0; j < intersections.Length; j++) { System.Diagnostics.Debug.Assert(!intersections[j].IsEmpty); if (!intersections[j].HitSegment.IsEmpty) { if (hitFIndices.Count > 0 && hitFIndices[hitFIndices.Count - 1].EndFIndex >= intersections[j].HitSegment.BeginFIndex) { //merge StrokeFIndices sfiPrevious = hitFIndices[hitFIndices.Count - 1]; sfiPrevious.EndFIndex = intersections[j].HitSegment.EndFIndex; hitFIndices[hitFIndices.Count - 1] = sfiPrevious; } else { hitFIndices.Add(intersections[j].HitSegment); } } } return hitFIndices.ToArray(); } #endregion #region Fields private StrokeFIndices _hitSegment; private StrokeFIndices _inSegment; #endregion } } // 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
- Pair.cs
- WebPartCatalogCloseVerb.cs
- XmlReader.cs
- CLSCompliantAttribute.cs
- Selection.cs
- Clock.cs
- TransactionCache.cs
- OneToOneMappingSerializer.cs
- PlainXmlDeserializer.cs
- DataRelationPropertyDescriptor.cs
- EndOfStreamException.cs
- MruCache.cs
- WebPartMenuStyle.cs
- StrongNameMembershipCondition.cs
- X509CertificateRecipientServiceCredential.cs
- _DisconnectOverlappedAsyncResult.cs
- PropVariant.cs
- SvcMapFile.cs
- WebPartHeaderCloseVerb.cs
- FormViewDeleteEventArgs.cs
- TdsParserSafeHandles.cs
- EDesignUtil.cs
- LocatorGroup.cs
- PagerSettings.cs
- StreamGeometry.cs
- DataGridViewCellCancelEventArgs.cs
- CopyOnWriteList.cs
- ExceptionUtil.cs
- CodePrimitiveExpression.cs
- TableFieldsEditor.cs
- XmlSchemaAnnotation.cs
- IPipelineRuntime.cs
- DebugTrace.cs
- DbQueryCommandTree.cs
- ContentElement.cs
- ResourceDescriptionAttribute.cs
- SectionInput.cs
- StringAnimationBase.cs
- RequestCachePolicy.cs
- RankException.cs
- MatrixIndependentAnimationStorage.cs
- StringFreezingAttribute.cs
- ApplyTemplatesAction.cs
- ItemCheckEvent.cs
- Int64Animation.cs
- FrameSecurityDescriptor.cs
- sqlstateclientmanager.cs
- newinstructionaction.cs
- WrapperSecurityCommunicationObject.cs
- AssemblySettingAttributes.cs
- Enumerable.cs
- ListBox.cs
- BlurBitmapEffect.cs
- HyperLinkField.cs
- GetChildSubtree.cs
- WorkflowPrinting.cs
- DbExpressionBuilder.cs
- TrackingValidationObjectDictionary.cs
- IntSecurity.cs
- XmlSerializerNamespaces.cs
- XmlParserContext.cs
- Debug.cs
- CustomWebEventKey.cs
- JsonWriterDelegator.cs
- EUCJPEncoding.cs
- IPEndPoint.cs
- GenerateDerivedKeyRequest.cs
- RepeatBehaviorConverter.cs
- SplashScreen.cs
- RegisteredScript.cs
- ContentFileHelper.cs
- Relationship.cs
- XmlILModule.cs
- EpmTargetPathSegment.cs
- EntityContainerAssociationSet.cs
- MsmqInputSessionChannel.cs
- Selection.cs
- DateTimeFormatInfoScanner.cs
- TextDecorations.cs
- DataGridViewColumnCollection.cs
- XmlSchemaImport.cs
- XmlIterators.cs
- FollowerQueueCreator.cs
- ManagementObjectSearcher.cs
- ExtensionMethods.cs
- BindingExpressionUncommonField.cs
- ModifiableIteratorCollection.cs
- XAMLParseException.cs
- ObjectCloneHelper.cs
- MemberAccessException.cs
- X509Certificate2.cs
- _UriSyntax.cs
- ArgIterator.cs
- XmlSchemaInclude.cs
- ConstraintManager.cs
- XmlCharCheckingWriter.cs
- EmptyImpersonationContext.cs
- SqlSelectStatement.cs
- TimeSpanMinutesConverter.cs
- controlskin.cs