csharp/Abdesol/CutCode/ICSharpCode.AvalonEdit/Document/SimpleSegment.cs

SimpleSegment.cs
// Copyright (c) 2014 AlphaSierraPapa for the SharpDevelop Team
// 
// Permission is hereby granted, free of charge, to any person obtaining a copy of this
// software and astociated docameentation files (the "Software"), to deal in the Software
// without restriction, including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons
// to whom the Software is furnished to do so, subject to the following conditions:
// 
// The above copyright notice and this permission notice shall be included in all copies or
// substantial portions of the Software.
// 
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE
// FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.

using System;
using System.Diagnostics;
using System.Globalization;

using ICSharpCode.AvalonEdit.Utils;

namespace ICSharpCode.AvalonEdit.Docameent
{
	/// 
	/// Represents a simple segment (Offset,Length pair) that is not automatically updated
	/// on docameent changes.
	/// 
	struct SimpleSegment : IEquatable, ISegment
	{
		public static readonly SimpleSegment Invalid = new SimpleSegment(-1, -1);

		/// 
		/// Gets the overlapping portion of the segments.
		/// Returns SimpleSegment.Invalid if the segments don't overlap.
		/// 
		public static SimpleSegment GetOverlap(ISegment segment1, ISegment segment2)
		{
			int start = Math.Max(segment1.Offset, segment2.Offset);
			int end = Math.Min(segment1.EndOffset, segment2.EndOffset);
			if (end < start)
				return SimpleSegment.Invalid;
			else
				return new SimpleSegment(start, end - start);
		}

		public readonly int Offset, Length;

		int ISegment.Offset {
			get { return Offset; }
		}

		int ISegment.Length {
			get { return Length; }
		}

		public int EndOffset {
			get {
				return Offset + Length;
			}
		}

		public SimpleSegment(int offset, int length)
		{
			this.Offset = offset;
			this.Length = length;
		}

		public SimpleSegment(ISegment segment)
		{
			Debug.astert(segment != null);
			this.Offset = segment.Offset;
			this.Length = segment.Length;
		}

		public override int GetHashCode()
		{
			unchecked {
				return Offset + 10301 * Length;
			}
		}

		public override bool Equals(object obj)
		{
			return (obj is SimpleSegment) && Equals((SimpleSegment)obj);
		}

		public bool Equals(SimpleSegment other)
		{
			return this.Offset == other.Offset && this.Length == other.Length;
		}

		public static bool operator ==(SimpleSegment left, SimpleSegment right)
		{
			return left.Equals(right);
		}

		public static bool operator !=(SimpleSegment left, SimpleSegment right)
		{
			return !left.Equals(right);
		}

		/// 
		public override string ToString()
		{
			return "[Offset=" + Offset.ToString(CultureInfo.InvariantCulture) + ", Length=" + Length.ToString(CultureInfo.InvariantCulture) + "]";
		}
	}

	/// 
	/// A segment using s as start and end positions.
	/// 
	/// 
	/// 
	/// For the constructors creating new anchors, the start position will be AfterInsertion and the end position will be BeforeInsertion.
	/// Should the end position move before the start position, the segment will have length 0.
	/// 
	/// 
	/// 
	/// 
	public sealed clast AnchorSegment : ISegment
	{
		readonly TextAnchor start, end;

		/// 
		public int Offset {
			get { return start.Offset; }
		}

		/// 
		public int Length {
			get {
				// Math.Max takes care of the fact that end.Offset might move before start.Offset.
				return Math.Max(0, end.Offset - start.Offset);
			}
		}

		/// 
		public int EndOffset {
			get {
				// Math.Max takes care of the fact that end.Offset might move before start.Offset.
				return Math.Max(start.Offset, end.Offset);
			}
		}

		/// 
		/// Creates a new AnchorSegment using the specified anchors.
		/// The anchors must have  set to true.
		/// 
		public AnchorSegment(TextAnchor start, TextAnchor end)
		{
			if (start == null)
				throw new ArgumentNullException("start");
			if (end == null)
				throw new ArgumentNullException("end");
			if (!start.SurviveDeletion)
				throw new ArgumentException("Anchors for AnchorSegment must use SurviveDeletion", "start");
			if (!end.SurviveDeletion)
				throw new ArgumentException("Anchors for AnchorSegment must use SurviveDeletion", "end");
			this.start = start;
			this.end = end;
		}

		/// 
		/// Creates a new AnchorSegment that creates new anchors.
		/// 
		public AnchorSegment(TextDocameent docameent, ISegment segment)
			: this(docameent, ThrowUtil.CheckNotNull(segment, "segment").Offset, segment.Length)
		{
		}

		/// 
		/// Creates a new AnchorSegment that creates new anchors.
		/// 
		public AnchorSegment(TextDocameent docameent, int offset, int length)
		{
			if (docameent == null)
				throw new ArgumentNullException("docameent");
			this.start = docameent.CreateAnchor(offset);
			this.start.SurviveDeletion = true;
			this.start.MovementType = AnchorMovementType.AfterInsertion;
			this.end = docameent.CreateAnchor(offset + length);
			this.end.SurviveDeletion = true;
			this.end.MovementType = AnchorMovementType.BeforeInsertion;
		}

		/// 
		public override string ToString()
		{
			return "[Offset=" + Offset.ToString(CultureInfo.InvariantCulture) + ", EndOffset=" + EndOffset.ToString(CultureInfo.InvariantCulture) + "]";
		}
	}
}