[ { "path": ".gitattributes", "content": "###############################################################################\n# Set default behavior to automatically normalize line endings.\n###############################################################################\n* text=auto\n\n###############################################################################\n# Set default behavior for command prompt diff.\n#\n# This is need for earlier builds of msysgit that does not have it on by\n# default for csharp files.\n# Note: This is only used by command line\n###############################################################################\n#*.cs diff=csharp\n\n###############################################################################\n# Set the merge driver for project and solution files\n#\n# Merging from the command prompt will add diff markers to the files if there\n# are conflicts (Merging from VS is not affected by the settings below, in VS\n# the diff markers are never inserted). Diff markers may cause the following \n# file extensions to fail to load in VS. An alternative would be to treat\n# these files as binary and thus will always conflict and require user\n# intervention with every merge. To do so, just uncomment the entries below\n###############################################################################\n#*.sln merge=binary\n#*.csproj merge=binary\n#*.vbproj merge=binary\n#*.vcxproj merge=binary\n#*.vcproj merge=binary\n#*.dbproj merge=binary\n#*.fsproj merge=binary\n#*.lsproj merge=binary\n#*.wixproj merge=binary\n#*.modelproj merge=binary\n#*.sqlproj merge=binary\n#*.wwaproj merge=binary\n\n###############################################################################\n# behavior for image files\n#\n# image files are treated as binary by default.\n###############################################################################\n#*.jpg binary\n#*.png binary\n#*.gif binary\n\n###############################################################################\n# diff behavior for common document formats\n# \n# Convert binary document formats to text before diffing them. This feature\n# is only available from the command line. Turn it on by uncommenting the \n# entries below.\n###############################################################################\n#*.doc diff=astextplain\n#*.DOC diff=astextplain\n#*.docx diff=astextplain\n#*.DOCX diff=astextplain\n#*.dot diff=astextplain\n#*.DOT diff=astextplain\n#*.pdf diff=astextplain\n#*.PDF diff=astextplain\n#*.rtf diff=astextplain\n#*.RTF diff=astextplain\n" }, { "path": ".gitignore", "content": "## Ignore Visual Studio temporary files, build results, and\n## files generated by popular Visual Studio add-ons.\n\n# User-specific files\n*.suo\n*.user\n*.userosscache\n*.sln.docstates\n\n# User-specific files (MonoDevelop/Xamarin Studio)\n*.userprefs\n\n!Source/SightPlayer.Omr.Test/x64/*.dll\n!Source/SightPlayer.Omr.Test/x64/*.exe\n!Source/SightPlayer.Omr.Test/x86/*.exe\n!Source/SightPlayer.Omr.Test/x86/*.dll\n\n# Build results\n[Dd]ebug/\n[Dd]ebugPublic/\n[Rr]elease/\n[Rr]eleases/\nx64/\nx86/\nbuild/\nbld/\n[Bb]in/\n[Oo]bj/\n\n# Visual Studo 2015 cache/options directory\n.vs/\n\n# MSTest test Results\n[Tt]est[Rr]esult*/\n[Bb]uild[Ll]og.*\n\n# NUNIT\n*.VisualState.xml\nTestResult.xml\n\n# Build Results of an ATL Project\n[Dd]ebugPS/\n[Rr]eleasePS/\ndlldata.c\n\n*_i.c\n*_p.c\n*_i.h\n*.ilk\n*.meta\n*.obj\n*.pch\n*.pdb\n*.pgc\n*.pgd\n*.rsp\n*.sbr\n*.tlb\n*.tli\n*.tlh\n*.tmp\n*.tmp_proj\n*.log\n*.vspscc\n*.vssscc\n.builds\n*.pidb\n*.svclog\n*.scc\n\n# Chutzpah Test files\n_Chutzpah*\n\n# Visual C++ cache files\nipch/\n*.aps\n*.ncb\n*.opensdf\n*.sdf\n*.cachefile\n\n# Visual Studio profiler\n*.psess\n*.vsp\n*.vspx\n\n# TFS 2012 Local Workspace\n$tf/\n\n# Guidance Automation Toolkit\n*.gpState\n\n# ReSharper is a .NET coding add-in\n_ReSharper*/\n*.[Rr]e[Ss]harper\n*.DotSettings.user\n\n# JustCode is a .NET coding addin-in\n.JustCode\n\n# TeamCity is a build add-in\n_TeamCity*\n\n# DotCover is a Code Coverage Tool\n*.dotCover\n\n# NCrunch\n_NCrunch_*\n.*crunch*.local.xml\n\n# MightyMoose\n*.mm.*\nAutoTest.Net/\n\n# Web workbench (sass)\n.sass-cache/\n\n# Installshield output folder\n[Ee]xpress/\n\n# DocProject is a documentation generator add-in\nDocProject/buildhelp/\nDocProject/Help/*.HxT\nDocProject/Help/*.HxC\nDocProject/Help/*.hhc\nDocProject/Help/*.hhk\nDocProject/Help/*.hhp\nDocProject/Help/Html2\nDocProject/Help/html\n\n# Click-Once directory\npublish/\n\n# Publish Web Output\n*.[Pp]ublish.xml\n*.azurePubxml\n# TODO: Comment the next line if you want to checkin your web deploy settings \n# but database connection strings (with potential passwords) will be unencrypted\n*.pubxml\n*.publishproj\n\n# NuGet Packages\n*.nupkg\n# The packages folder can be ignored because of Package Restore\n**/packages/*\n# except build/, which is used as an MSBuild target.\n!**/packages/build/\n# Uncomment if necessary however generally it will be regenerated when needed\n#!**/packages/repositories.config\n\n# Windows Azure Build Output\ncsx/\n*.build.csdef\n\n# Windows Store app package directory\nAppPackages/\n\n# Others\n*Resource.Designer.cs\n*.[Cc]ache\nClientBin/\n[Ss]tyle[Cc]op.*\n~$*\n*~\n*.dbmdl\n*.dbproj.schemaview\n*.pfx\n*.publishsettings\nnode_modules/\nbower_components/\n\n# RIA/Silverlight projects\nGenerated_Code/\n\n# Backup & report files from converting an old project file\n# to a newer Visual Studio version. Backup files are not needed,\n# because we have git ;-)\n_UpgradeReport_Files/\nBackup*/\nUpgradeLog*.XML\nUpgradeLog*.htm\n\n# SQL Server files\n*.mdf\n*.ldf\n\n# Business Intelligence projects\n*.rdl.data\n*.bim.layout\n*.bim_*.settings\n\n# Microsoft Fakes\nFakesAssemblies/\n\n# Node.js Tools for Visual Studio\n.ntvs_analysis.dat\n\n# Visual Studio 6 build log\n*.plg\n\n# Visual Studio 6 workspace options file\n*.opt\n\n# Xamarin Components (will be restored like nuget packages)\nComponents" }, { "path": "CONTRIBUTORS.md", "content": "Special thanks to the contributors\n\n- [Steve Hansen](https://github.com/beefo)\n- [Eric Domke](https://github.com/erdomke)\n- [Jonas Nyrup](https://github.com/jnyrup)" }, { "path": "IntervalTree/IIntervalTree.cs", "content": "using System.Collections.Generic;\n\nnamespace IntervalTree\n{\n /// \n /// The standard interval tree implementation. Keeps a root node and forwards all queries to it.\n /// Whenever new items are added or items are removed, the tree goes temporarily \"out of sync\", which means that the\n /// internal index is not updated immediately, but upon the next query operation. \n /// \n /// The type of the range.\n /// The type of the data items.\n public interface IIntervalTree : IEnumerable>\n {\n /// \n /// Returns all items contained in the tree.\n /// \n IEnumerable Values { get; }\n\n /// \n /// Gets the number of elements contained in the tree.\n /// \n int Count { get; }\n\n /// \n /// Performs a point query with a single value. All items with overlapping ranges are returned.\n /// \n IEnumerable Query(TKey value);\n\n /// \n /// Performs a range query. All items with overlapping ranges are returned.\n /// \n IEnumerable Query(TKey from, TKey to);\n\n /// \n /// Adds the specified item.\n /// \n void Add(TKey from, TKey to, TValue value);\n\n /// \n /// Removes the specified item.\n /// \n void Remove(TValue item);\n\n /// \n /// Removes the specified items.\n /// \n void Remove(IEnumerable items);\n\n /// \n /// Removes all elements from the range tree.\n /// \n void Clear();\n }\n}" }, { "path": "IntervalTree/IntervalTree.cs", "content": "using System;\nusing System.Collections;\nusing System.Collections.Generic;\nusing System.Linq;\n\nnamespace IntervalTree\n{\n public class IntervalTree : IIntervalTree\n {\n private IntervalTreeNode root;\n private List> items;\n private readonly IComparer comparer;\n private bool isInSync;\n\n IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();\n\n public TKey Max\n {\n get\n {\n if (!isInSync)\n Rebuild();\n\n return root.Max;\n }\n }\n\n public TKey Min\n {\n get\n {\n if (!isInSync)\n Rebuild();\n\n return root.Min;\n }\n }\n\n public IEnumerable Values => items.Select(i => i.Value);\n\n public int Count => items.Count;\n\n /// \n /// Initializes an empty tree.\n /// \n public IntervalTree() : this(Comparer.Default) { }\n\n /// \n /// Initializes an empty tree.\n /// \n public IntervalTree(IComparer comparer)\n {\n this.comparer = comparer ?? Comparer.Default;\n isInSync = true;\n root = new IntervalTreeNode(this.comparer);\n items = new List>();\n }\n\n public IEnumerable Query(TKey value)\n {\n if (!isInSync)\n Rebuild();\n\n return root.Query(value);\n }\n\n public IEnumerable Query(TKey from, TKey to)\n {\n if (!isInSync)\n Rebuild();\n\n return root.Query(from, to);\n }\n\n public void Add(TKey from, TKey to, TValue value)\n {\n if (comparer.Compare(from, to) > 0)\n throw new ArgumentOutOfRangeException($\"{nameof(from)} cannot be larger than {nameof(to)}\");\n\n isInSync = false;\n items.Add(new RangeValuePair(from, to, value));\n }\n\n public void Remove(TValue value)\n {\n isInSync = false;\n items = items.Where(l => !l.Value.Equals(value)).ToList();\n }\n\n public void Remove(IEnumerable items)\n {\n isInSync = false;\n this.items = this.items.Where(l => !items.Contains(l.Value)).ToList();\n }\n\n public void Clear()\n {\n root = new IntervalTreeNode(comparer);\n items = new List>();\n isInSync = true;\n }\n\n public IEnumerator> GetEnumerator()\n {\n if (!isInSync)\n Rebuild();\n\n return items.GetEnumerator();\n }\n\n private void Rebuild()\n {\n if (isInSync)\n return;\n\n if (items.Count > 0)\n root = new IntervalTreeNode(items, comparer);\n else\n root = new IntervalTreeNode(comparer);\n isInSync = true;\n }\n }\n}" }, { "path": "IntervalTree/IntervalTree.csproj", "content": "\n\n \n netstandard1.2;netstandard2.0;net45\n 3.0.1\n \n \n \n IntervalTree\n A generic implementation of a centered interval tree in C#. \nIn computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.\n True\n False\n Copyright (c) 2020, Matthias Buchetics and Alexander Pacha\n \n https://github.com/mbuchetics/RangeTree\n https://github.com/mbuchetics/RangeTree.git\n git\n range, tree, interval\n 3.0.1\n RangeTree\n Matthias Buchetics, Alexander Pacha and others, see CONTRIBUTORS.md\n IntervalTree - A generic interval tree implementation in C#\n This version contains a bug-fix for elements that have overlapping intervals. \nThanks to @nordic81.\n\nFor a full list changes at https://github.com/mbuchetics/RangeTree/releases\n 3.0.1\n 3.0.1\n Matthias Buchetics, Alexander Pacha\n \n \n \n true\n \n\n \n $(SolutionDir)\\rangetree.ruleset\n LICENSE.txt\n \n\n \n true\n \n\n \n 3\n \n\n \n \n True\n \n \n \n\n\n" }, { "path": "IntervalTree/IntervalTreeNode.cs", "content": "using System.Collections.Generic;\n\nnamespace IntervalTree\n{\n /// \n /// A node of the range tree. Given a list of items, it builds\n /// its subtree. Also contains methods to query the subtree.\n /// Basically, all interval tree logic is here.\n /// \n internal class IntervalTreeNode : IComparer>\n {\n private readonly TKey center;\n\n private readonly IComparer comparer;\n private readonly RangeValuePair[] items;\n private readonly IntervalTreeNode leftNode;\n private readonly IntervalTreeNode rightNode;\n\n /// \n /// Initializes an empty node.\n /// \n /// The comparer used to compare two items.\n public IntervalTreeNode(IComparer comparer)\n {\n this.comparer = comparer ?? Comparer.Default;\n\n center = default;\n leftNode = null;\n rightNode = null;\n items = null;\n }\n\n /// \n /// Initializes a node with a list of items, builds the sub tree.\n /// \n /// The items that should be added to this node\n /// The comparer used to compare two items.\n public IntervalTreeNode(IList> items, IComparer comparer)\n {\n this.comparer = comparer ?? Comparer.Default;\n\n // first, find the median\n var endPoints = new List(items.Count * 2);\n foreach (var item in items)\n {\n endPoints.Add(item.From);\n endPoints.Add(item.To);\n }\n\n endPoints.Sort(this.comparer);\n\n // the median is used as center value\n if (endPoints.Count > 0)\n {\n Min = endPoints[0];\n center = endPoints[endPoints.Count / 2];\n Max = endPoints[endPoints.Count - 1];\n }\n\n var inner = new List>();\n var left = new List>();\n var right = new List>();\n\n // iterate over all items\n // if the range of an item is completely left of the center, add it to the left items\n // if it is on the right of the center, add it to the right items\n // otherwise (range overlaps the center), add the item to this node's items\n foreach (var o in items)\n if (this.comparer.Compare(o.To, center) < 0)\n left.Add(o);\n else if (this.comparer.Compare(o.From, center) > 0)\n right.Add(o);\n else\n inner.Add(o);\n\n // sort the items, this way the query is faster later on\n if (inner.Count > 0)\n {\n if (inner.Count > 1)\n inner.Sort(this);\n this.items = inner.ToArray();\n }\n else\n {\n this.items = null;\n }\n\n // create left and right nodes, if there are any items\n if (left.Count > 0)\n leftNode = new IntervalTreeNode(left, this.comparer);\n if (right.Count > 0)\n rightNode = new IntervalTreeNode(right, this.comparer);\n }\n\n public TKey Max { get; }\n\n public TKey Min { get; }\n\n /// \n /// Returns less than 0 if this range's From is less than the other, greater than 0 if greater.\n /// If both are equal, the comparison of the To values is returned.\n /// 0 if both ranges are equal.\n /// \n /// The first item.\n /// The other item.\n /// \n int IComparer>.Compare(RangeValuePair x,\n RangeValuePair y)\n {\n var fromComp = comparer.Compare(x.From, y.From);\n if (fromComp == 0)\n return comparer.Compare(x.To, y.To);\n return fromComp;\n }\n\n /// \n /// Performs a point query with a single value.\n /// All items with overlapping ranges are returned.\n /// \n public IEnumerable Query(TKey value)\n {\n var results = new List();\n\n // If the node has items, check for leaves containing the value.\n if (items != null)\n foreach (var o in items)\n if (comparer.Compare(o.From, value) > 0)\n break;\n else if (comparer.Compare(value, o.From) >= 0 && comparer.Compare(value, o.To) <= 0)\n results.Add(o.Value);\n\n // go to the left or go to the right of the tree, depending\n // where the query value lies compared to the center\n var centerComp = comparer.Compare(value, center);\n if (leftNode != null && centerComp < 0)\n results.AddRange(leftNode.Query(value));\n else if (rightNode != null && centerComp > 0)\n results.AddRange(rightNode.Query(value));\n\n return results;\n }\n\n /// \n /// Performs a range query.\n /// All items with overlapping ranges are returned.\n /// \n public IEnumerable Query(TKey from, TKey to)\n {\n var results = new List();\n\n // If the node has items, check for leaves intersecting the range.\n if (items != null)\n foreach (var o in items)\n if (comparer.Compare(o.From, to) > 0)\n break;\n else if (comparer.Compare(to, o.From) >= 0 && comparer.Compare(from, o.To) <= 0)\n results.Add(o.Value);\n\n // go to the left or go to the right of the tree, depending\n // where the query value lies compared to the center\n if (leftNode != null && comparer.Compare(from, center) < 0)\n results.AddRange(leftNode.Query(from, to));\n if (rightNode != null && comparer.Compare(to, center) > 0)\n results.AddRange(rightNode.Query(from, to));\n\n return results;\n }\n }\n}" }, { "path": "IntervalTree/RangeValuePair.cs", "content": "using System;\nusing System.Collections.Generic;\n\nnamespace IntervalTree\n{\n /// \n /// Represents a range of values.\n /// Both values must be of the same type and comparable.\n /// \n /// Type of the values.\n public readonly struct RangeValuePair : IEquatable>\n {\n public TKey From { get; }\n public TKey To { get; }\n public TValue Value { get; }\n\n /// \n /// Initializes a new instance.\n /// \n public RangeValuePair(TKey from, TKey to, TValue value) : this()\n {\n From = from;\n To = to;\n Value = value;\n }\n\n /// \n /// Returns a that represents this instance.\n /// \n /// \n /// A that represents this instance.\n /// \n public override string ToString()\n {\n return string.Format(\"[{0} - {1}] {2}\", From, To, Value);\n }\n\n public override int GetHashCode()\n {\n var hash = 23;\n if (From != null)\n hash = hash * 37 + From.GetHashCode();\n if (To != null)\n hash = hash * 37 + To.GetHashCode();\n if (Value != null)\n hash = hash * 37 + Value.GetHashCode();\n return hash;\n }\n\n public bool Equals(RangeValuePair other)\n {\n return EqualityComparer.Default.Equals(From, other.From)\n && EqualityComparer.Default.Equals(To, other.To)\n && EqualityComparer.Default.Equals(Value, other.Value);\n }\n\n public override bool Equals(object obj)\n {\n if (!(obj is RangeValuePair))\n return false;\n\n return Equals((RangeValuePair)obj);\n }\n\n public static bool operator ==(RangeValuePair left, RangeValuePair right)\n {\n return left.Equals(right);\n }\n\n public static bool operator !=(RangeValuePair left, RangeValuePair right)\n {\n return !(left == right);\n }\n }\n}" }, { "path": "IntervalTree.sln", "content": "\nMicrosoft Visual Studio Solution File, Format Version 12.00\n# Visual Studio Version 16\nVisualStudioVersion = 16.0.30011.22\nMinimumVisualStudioVersion = 10.0.40219.1\nProject(\"{9A19103F-16F7-4668-BE54-9A1E7A4F7556}\") = \"IntervalTree\", \"IntervalTree\\IntervalTree.csproj\", \"{A12CFD40-6EA9-459A-84AD-2DF944E332CE}\"\nEndProject\nProject(\"{9A19103F-16F7-4668-BE54-9A1E7A4F7556}\") = \"IntervalTreeExamples\", \"IntervalTreeExamples\\IntervalTreeExamples.csproj\", \"{A2ECC374-8BB1-4B8C-AF67-062595E6FBDB}\"\nEndProject\nProject(\"{9A19103F-16F7-4668-BE54-9A1E7A4F7556}\") = \"IntervalTreeTests\", \"IntervalTreeTests\\IntervalTreeTests.csproj\", \"{087BD1DE-623A-4C8B-A41B-E99938EC9296}\"\nEndProject\nGlobal\n\tGlobalSection(SolutionConfigurationPlatforms) = preSolution\n\t\tDebug|Any CPU = Debug|Any CPU\n\t\tRelease|Any CPU = Release|Any CPU\n\tEndGlobalSection\n\tGlobalSection(ProjectConfigurationPlatforms) = postSolution\n\t\t{A12CFD40-6EA9-459A-84AD-2DF944E332CE}.Debug|Any CPU.ActiveCfg = Debug|Any CPU\n\t\t{A12CFD40-6EA9-459A-84AD-2DF944E332CE}.Debug|Any CPU.Build.0 = Debug|Any CPU\n\t\t{A12CFD40-6EA9-459A-84AD-2DF944E332CE}.Release|Any CPU.ActiveCfg = Release|Any CPU\n\t\t{A12CFD40-6EA9-459A-84AD-2DF944E332CE}.Release|Any CPU.Build.0 = Release|Any CPU\n\t\t{A2ECC374-8BB1-4B8C-AF67-062595E6FBDB}.Debug|Any CPU.ActiveCfg = Debug|Any CPU\n\t\t{A2ECC374-8BB1-4B8C-AF67-062595E6FBDB}.Debug|Any CPU.Build.0 = Debug|Any CPU\n\t\t{A2ECC374-8BB1-4B8C-AF67-062595E6FBDB}.Release|Any CPU.ActiveCfg = Release|Any CPU\n\t\t{A2ECC374-8BB1-4B8C-AF67-062595E6FBDB}.Release|Any CPU.Build.0 = Release|Any CPU\n\t\t{087BD1DE-623A-4C8B-A41B-E99938EC9296}.Debug|Any CPU.ActiveCfg = Debug|Any CPU\n\t\t{087BD1DE-623A-4C8B-A41B-E99938EC9296}.Debug|Any CPU.Build.0 = Debug|Any CPU\n\t\t{087BD1DE-623A-4C8B-A41B-E99938EC9296}.Release|Any CPU.ActiveCfg = Release|Any CPU\n\t\t{087BD1DE-623A-4C8B-A41B-E99938EC9296}.Release|Any CPU.Build.0 = Release|Any CPU\n\tEndGlobalSection\n\tGlobalSection(SolutionProperties) = preSolution\n\t\tHideSolutionNode = FALSE\n\tEndGlobalSection\n\tGlobalSection(ExtensibilityGlobals) = postSolution\n\t\tSolutionGuid = {ECFD1131-4EBD-489E-81BE-550DBF8805EF}\n\tEndGlobalSection\nEndGlobal\n" }, { "path": "IntervalTreeExamples/IntervalTreeExamples.csproj", "content": "\n\n \n netstandard1.6\n \n\n \n \n all\n runtime; build; native; contentfiles; analyzers; buildtransitive\n \n \n\n \n \n \n\n \n $(SolutionDir)\\rangetree.ruleset\n \n Exe\n \n \n\n \n bin\\Release\\netstandard1.3\\RangeTree.Examples.xml\n \n\n \n bin\\Debug\\netstandard1.3\\RangeTree.Examples.xml\n \n\n" }, { "path": "IntervalTreeExamples/Program.cs", "content": "using System;\nusing System.Collections.Generic;\nusing System.Diagnostics;\nusing System.Linq;\nusing IntervalTree;\n\nnamespace IntervalTreeExamples\n{\n class Program\n {\n static void Main(string[] args)\n {\n TreeExample1();\n TreeExample2();\n Console.WriteLine(\"Press any key to continue...\");\n Console.ReadKey();\n }\n\n static void TreeExample1()\n {\n Console.WriteLine(\"Example 1\");\n\n var tree = new IntervalTree()\n {\n { 0, 10, \"1\" },\n { 20, 30, \"2\" },\n { 15, 17, \"3\" },\n { 25, 35, \"4\" },\n };\n\n PrintQueryResult(\"query 1\", tree.Query(5));\n PrintQueryResult(\"query 2\", tree.Query(10));\n PrintQueryResult(\"query 3\", tree.Query(29));\n PrintQueryResult(\"query 4\", tree.Query(5, 15));\n\n Console.WriteLine();\n }\n\n static void TreeExample2()\n {\n Console.WriteLine(\"Example 2\");\n\n var tree = new IntervalTree();\n var stopwatch = new Stopwatch();\n stopwatch.Start();\n\n for (int i = 0; i < 100; i++)\n {\n for (int j = 0; j < 100; j++)\n {\n RandomTreeInsert(tree, 1000);\n }\n\n var resultCount = tree.Query(50, 60).Count();\n Console.WriteLine(\"query: {0} results (tree count: {1})\", resultCount, tree.Count);\n }\n\n stopwatch.Stop();\n Console.WriteLine(\"elapsed time: {0}\", stopwatch.Elapsed);\n }\n\n static Random random = new Random();\n\n static void RandomTreeInsert(IIntervalTree tree, int limit)\n {\n var a = random.Next(limit);\n var b = random.Next(limit);\n\n tree.Add(Math.Min(a, b), Math.Max(a, b), \"value\");\n }\n\n static void PrintQueryResult(string queryTitle, IEnumerable result)\n {\n Console.WriteLine(queryTitle);\n foreach (var item in result)\n {\n Console.WriteLine(item);\n }\n }\n }\n}\n" }, { "path": "IntervalTreeTests/ComparerTests.cs", "content": "using System;\nusing System.Collections.Generic;\nusing IntervalTree;\nusing NUnit.Framework;\n\nnamespace IntervalTreeTests\n{\n [TestFixture]\n public class ComparerTests\n {\n [Test]\n public void AddingAnItem_FromIsLargerThanTo_ShouldThrowException()\n {\n var comparer = Comparer.Create((x, y) => x - y);\n var tree = new IntervalTree(comparer);\n\n Assert.That(() => tree.Add(2, 0, \"FOO\"), Throws.InstanceOf());\n }\n\n [Test]\n public void CreatingTreeWithNullComparer_AddingAnItem_ShouldNotThrowException()\n {\n var tree = new IntervalTree(null);\n\n Assert.That(() => tree.Add(0, 1, \"FOO\"), Throws.Nothing);\n }\n }\n}\n" }, { "path": "IntervalTreeTests/IntervalTreeTests.cs", "content": "using NUnit.Framework;\nusing IntervalTree;\n\nnamespace IntervalTreeTests\n{\n [TestFixture]\n public class IntervalTreeTests\n {\n [Test]\n public void GettingMin_InnerItems()\n {\n var tree = new IntervalTree\n {\n { 1, 5, -1 },\n { 2, 5, -1 },\n { 3, 5, -1 },\n };\n\n var min = tree.Min;\n\n Assert.That(min, Is.EqualTo(1));\n }\n\n [Test]\n public void GettingMin_LeftRecurse()\n {\n var tree = new IntervalTree\n {\n { 1, 2, -1 },\n { 3, 4, -1 }\n };\n\n var min = tree.Min;\n\n Assert.That(min, Is.EqualTo(1));\n }\n\n [Test]\n public void GettingMax_InnerItems()\n {\n var tree = new IntervalTree\n {\n { 1, 2, -1 },\n { 1, 3, -1 },\n { 1, 4, -1 },\n };\n\n var max = tree.Max;\n\n Assert.That(max, Is.EqualTo(4));\n }\n\n [Test]\n public void GettingMax_RightRecurse()\n {\n var tree = new IntervalTree\n {\n { 1, 2, -1 },\n { 3, 4, -1 },\n { 5, 6, -1 }\n };\n\n var max = tree.Max;\n\n Assert.That(max, Is.EqualTo(6));\n }\n\n [Test]\n public void GettingMin_Mixed()\n {\n var tree = new IntervalTree\n {\n { 2, 3, -1 },\n { 8, 9, -1 },\n { 1, 10, -1 },\n };\n\n var min = tree.Min;\n\n Assert.That(min, Is.EqualTo(1));\n }\n \n [Test]\n public void GettingMax_Mixed()\n {\n var tree = new IntervalTree\n {\n { 1, 10, -1 },\n { 2, 3, -1 },\n { 4, 5, -1 },\n { 8, 9, -1 },\n };\n\n var max = tree.Max;\n\n Assert.That(max, Is.EqualTo(10));\n }\n }\n}\n" }, { "path": "IntervalTreeTests/IntervalTreeTests.csproj", "content": "\n\n \n netcoreapp2.1\n \n\n \n \n \n \n all\n runtime; build; native; contentfiles; analyzers; buildtransitive\n \n \n\n \n \n \n\n \n \n \n\n \n \n all\n runtime; build; native; contentfiles; analyzers; buildtransitive\n \n \n\n \n $(SolutionDir)\\rangetree.ruleset\n \n\n \n bin\\Release\\netcoreapp1.1\\.xml\n 3\n \n\n \n bin\\Debug\\netcoreapp1.1\\.xml\n 3\n \n\n\n" }, { "path": "IntervalTreeTests/MultipleComparerTests.cs", "content": "using System;\nusing System.Linq;\nusing NUnit.Framework;\nusing IntervalTree;\n\nnamespace IntervalTreeTests\n{\n [TestFixture]\n public class MultipleComparerTests\n {\n [Test]\n public void CreateTwoTrees_ProvideDifferentComparers_ExpectBothToHaveTheComparersFromConstruction()\n {\n var tree = new IntervalTree(StringComparer.Ordinal)\n {\n { \"a\", \"e\", \"value1\" },\n { \"B\", \"D\", \"value2\" },\n };\n var results = tree.Query(\"c\").ToArray();\n Assert.That(results.Length, Is.EqualTo(1));\n Assert.That(results[0], Is.EqualTo(\"value1\"));\n\n tree = new IntervalTree(StringComparer.OrdinalIgnoreCase)\n {\n { \"a\", \"e\", \"value1\" },\n { \"B\", \"D\", \"value2\" },\n };\n results = tree.Query(\"c\").ToArray();\n Assert.That(results.Length, Is.EqualTo(2));\n Assert.That(results[0], Is.EqualTo(\"value1\"));\n Assert.That(results[1], Is.EqualTo(\"value2\"));\n }\n }\n}\n" }, { "path": "IntervalTreeTests/ReadmeExampleTests.cs", "content": "using System.Linq;\nusing NUnit.Framework;\nusing IntervalTree;\n\nnamespace IntervalTreeTests\n{\n [TestFixture]\n public class ReadmeExampleTests\n {\n [Test]\n public void Query_CreateTreeAndExecuteQuery_ExpectCorrectElementsToBeReturned()\n {\n var tree = new IntervalTree()\n {\n { 0, 10, \"1\" },\n { 20, 30, \"2\" },\n { 15, 17, \"3\" },\n { 25, 35, \"4\" },\n };\n\n var results1 = tree.Query(5).ToArray();\n Assert.That(results1.Count, Is.EqualTo(1));\n Assert.That(results1[0], Is.EqualTo(\"1\"));\n\n var results2 = tree.Query(10).ToArray();\n Assert.That(results2.Count, Is.EqualTo(1));\n Assert.That(results2[0], Is.EqualTo(\"1\"));\n\n var results3 = tree.Query(29).ToArray();\n Assert.That(results3.Count, Is.EqualTo(2));\n Assert.That(results3[0], Is.EqualTo(\"2\"));\n Assert.That(results3[1], Is.EqualTo(\"4\"));\n\n var results4 = tree.Query(5, 15).ToArray();\n Assert.That(results4.Count, Is.EqualTo(2));\n Assert.That(results4[0], Is.EqualTo(\"3\"));\n Assert.That(results4[1], Is.EqualTo(\"1\"));\n }\n }\n}\n" }, { "path": "IntervalTreeTests/TreeOfDateTimeTests.cs", "content": "using System;\nusing System.Linq;\nusing NUnit.Framework;\nusing IntervalTree;\n\nnamespace IntervalTreeTests\n{\n [TestFixture]\n internal class TreeOfDateTimeTests\n {\n private static readonly DateTime ZERO = new DateTime(2001, 01, 01, 10, 00, 00);\n\n [Test]\n public void BuildEmptyIntervalTree()\n {\n var emptyTree = new IntervalTree();\n Assert.Pass();\n }\n\n [Test]\n public void CreateEmptyIntervalTree()\n {\n var emptyTree = new IntervalTree();\n Assert.That(emptyTree, Is.Not.Null);\n }\n\n [Test]\n public void GetIntervalByExactEndTime()\n {\n var tree = new IntervalTree();\n tree.Add(ZERO, ZERO.AddHours(1), 100);\n\n var result = tree.Query(ZERO.AddHours(1)).ToList();\n Assert.That(result.Count, Is.EqualTo(1));\n }\n\n [Test]\n public void GetIntervalByExactStartTime()\n {\n var tree = new IntervalTree();\n tree.Add(ZERO, ZERO.AddHours(1), 100);\n\n var result = tree.Query(ZERO).ToList();\n Assert.That(result.Count, Is.EqualTo(1));\n }\n\n /// \n /// 0-----5-----10------15--------20\n /// |=====100====|\n /// |==200=|\n /// |====300==========|\n /// \n [Test]\n public void OverlapOnExactEndAndStart_AssertCount()\n {\n var tree = new IntervalTree();\n tree.Add(ZERO, ZERO.AddHours(10), 100);\n tree.Add(ZERO.AddHours(10), ZERO.AddHours(15), 200);\n tree.Add(ZERO.AddHours(10), ZERO.AddHours(20), 200);\n\n var result = tree.Query(ZERO.AddHours(10)).ToList();\n Assert.That(result.Count, Is.EqualTo(3));\n }\n\n [Test]\n public void TestSeparateIntervals()\n {\n var tree = new IntervalTree();\n tree.Add(ZERO, ZERO.AddHours(10), 100);\n tree.Add(ZERO.AddHours(20), ZERO.AddHours(30), 200);\n\n var result = tree.Query(ZERO.AddHours(5)).ToList();\n Assert.That(result.Count, Is.EqualTo(1));\n Assert.That(result[0], Is.EqualTo(100));\n }\n\n [Test]\n public void TwoIntersectingIntervals()\n {\n var tree = new IntervalTree();\n tree.Add(ZERO, ZERO.AddHours(10), 100);\n tree.Add(ZERO.AddHours(3), ZERO.AddHours(30), 200);\n\n var result = tree.Query(ZERO.AddHours(5)).ToList();\n Assert.That(result.Count, Is.EqualTo(2));\n Assert.That(result[0], Is.EqualTo(100));\n Assert.That(result[1], Is.EqualTo(200));\n }\n }\n}" }, { "path": "IntervalTreeTests/TreeOfIntTests.cs", "content": "using System.Linq;\nusing NUnit.Framework;\nusing IntervalTree;\n\nnamespace IntervalTreeTests\n{\n [TestFixture]\n internal class TreeOfIntTests\n {\n [Test]\n public void BuildEmptyIntervalTree()\n {\n var emptyTree = new IntervalTree();\n Assert.Pass();\n }\n\n [Test]\n public void CreateEmptyIntervalTree()\n {\n var emptyTree = new IntervalTree();\n Assert.That(emptyTree, Is.Not.Null);\n }\n\n [Test]\n public void TestSeparateIntervals()\n {\n var tree = new IntervalTree();\n tree.Add(0, 10, 100);\n tree.Add(20, 30, 200);\n\n var result = tree.Query(5).ToList();\n Assert.That(result.Count, Is.EqualTo(1));\n Assert.That(result[0], Is.EqualTo(100));\n }\n\n [Test]\n public void TwoIntersectingIntervals()\n {\n var tree = new IntervalTree();\n tree.Add(0, 10, 100);\n tree.Add(3, 30, 200);\n\n var result = tree.Query(5).ToList();\n Assert.That(result.Count, Is.EqualTo(2));\n Assert.That(result[0], Is.EqualTo(100));\n Assert.That(result[1], Is.EqualTo(200));\n }\n\n [Test]\n public void QueryOutOfSyncTree_ExpectObsoleteResults()\n {\n var tree = new IntervalTree();\n tree.Add(0, 10, 100);\n\n var result = tree.Query(5).ToList();\n Assert.That(result.Count, Is.EqualTo(1));\n\n tree.Add(3, 30, 200);\n\n result = tree.Query(5).ToList();\n Assert.That(result.Count, Is.EqualTo(2));\n }\n }\n}" }, { "path": "IntervalTreeTests/TreeSpecs.cs", "content": "using System;\nusing System.Collections;\nusing System.Collections.Generic;\nusing System.Diagnostics;\nusing System.Linq;\nusing NUnit.Framework;\nusing IntervalTree;\n\nnamespace IntervalTreeTests\n{\n [TestFixture]\n public class If_the_user_searches_for_overlapping_entries_in_an_interval_tree : Spec\n {\n private static IEnumerable> TestEntries()\n {\n yield return Tuple.Create(1400, 1500);\n yield return Tuple.Create(0100, 0130);\n yield return Tuple.Create(1700, 1800);\n yield return Tuple.Create(0230, 0240);\n yield return Tuple.Create(0530, 0540);\n yield return Tuple.Create(2330, 2400);\n yield return Tuple.Create(0700, 0800);\n yield return Tuple.Create(0900, 1000);\n yield return Tuple.Create(0000, 0100);\n yield return Tuple.Create(0540, 0700);\n yield return Tuple.Create(1800, 2130);\n yield return Tuple.Create(2130, 2131);\n yield return Tuple.Create(0200, 0230);\n }\n\n private static IEnumerable TestCases\n {\n get\n {\n yield return new TestCaseData(Tuple.Create(2000, 2300)).Returns(2);\n yield return new TestCaseData(Tuple.Create(0000, 0100)).Returns(2);\n yield return new TestCaseData(Tuple.Create(0000, 0000)).Returns(1);\n yield return new TestCaseData(Tuple.Create(0100, 0100)).Returns(2);\n yield return new TestCaseData(Tuple.Create(1000, 1100)).Returns(1);\n yield return new TestCaseData(Tuple.Create(1030, 1400)).Returns(1);\n yield return new TestCaseData(Tuple.Create(0150, 0155)).Returns(0);\n yield return new TestCaseData(Tuple.Create(2132, 2133)).Returns(0);\n yield return new TestCaseData(Tuple.Create(1030, 1350)).Returns(0);\n yield return new TestCaseData(Tuple.Create(0000, 2359)).Returns(13);\n }\n }\n\n [Test]\n [TestCaseSource(\"TestCases\")]\n public int CorrectQuery_BuiltInOrder(Tuple value)\n {\n var tree = CreateTree(TestEntries().OrderBy(interval => interval.Item1));\n return tree\n .Query(value.Item1, value.Item2)\n .Count();\n }\n\n [Test]\n [TestCaseSource(\"TestCases\")]\n public int CorrectQuery_BuiltInReverseOrder(Tuple value)\n {\n var tree = CreateTree(TestEntries().OrderBy(interval => interval.Item1).Reverse());\n return tree\n .Query(value.Item1, value.Item2)\n .Count();\n }\n\n [Test]\n [TestCaseSource(\"TestCases\")]\n public int CorrectQuery_BuiltRandomly(Tuple value)\n {\n var tree = CreateTree(TestEntries());\n return tree\n .Query(value.Item1, value.Item2)\n .Count();\n }\n\n private static IIntervalTree CreateTree(IEnumerable> entries)\n {\n var tree = new IntervalTree();\n\n foreach (var interval in entries)\n {\n tree.Add(interval.Item1, interval.Item2, \"value\");\n }\n\n return tree;\n }\n }\n\n /// \n /// Abstract helper class to make nunit tests more readable.\n /// \n [DebuggerStepThrough]\n [DebuggerNonUserCode]\n public class Spec\n {\n [DebuggerStepThrough]\n [OneTimeSetUp]\n public void SetUp()\n {\n EstablishContext();\n BecauseOf();\n }\n\n [DebuggerStepThrough]\n [OneTimeTearDown]\n public void TearDown()\n {\n Cleanup();\n }\n\n /// \n /// Test setup. Place your initialization code here.\n /// \n [DebuggerStepThrough]\n protected virtual void EstablishContext() { }\n\n /// \n /// Test run. Place the tested method / action here.\n /// \n [DebuggerStepThrough]\n protected virtual void BecauseOf() { }\n\n /// \n /// Test clean. Close/delete files, close database connections ..\n /// \n [DebuggerStepThrough]\n protected virtual void Cleanup() { }\n\n /// \n /// Creates an Action delegate.\n /// \n /// Method the shall be created as delegate.\n /// A delegate of type \n protected Action Invoking(Action func)\n {\n return func;\n }\n }\n}\n" }, { "path": "LICENSE.txt", "content": "If not noted otherwise in the file header, the project uses the MIT license.\n\nCopyright (c) 2020, Matthias Buchetics and Alexander Pacha.\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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." }, { "path": "README.md", "content": "# IntervalTree #\n\n[![Build status](https://ci.appveyor.com/api/projects/status/t8xvh5oquuvk17ks?svg=true)](https://ci.appveyor.com/project/apacha/rangetree)\n[![NuGet version](https://img.shields.io/nuget/v/RangeTree.svg?style=flat-square)](https://www.nuget.org/packages/RangeTree)\n\n## A generic interval tree ##\n\nA generic implementation of a centered interval tree in C#. \n\nFrom [Wikipedia](http://en.wikipedia.org/wiki/Interval_tree):\n> In computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.\n\nBased on the Java implementation found here: http://www.sanfoundry.com/java-program-implement-interval-tree/\n\nQueries require `O(log n + m)` time, with `n` being the total number of intervals and `m` being the number of reported results. Construction requires `O(n log n)` time, and storage requires `O(n)` space.\n\n### Requirements ###\n- Consuming this NuGet package requires .NET Framework >= 4.5 or .NET Standard >= 1.2\n- Developing this project requires Visual Studio 2017 with .NET Framework >= 4.5 and .NET Standard >= 2.0.\n\n## Simple Interface ###\n\n```csharp\npublic interface IIntervalTree \n : IEnumerable>\n{\n IEnumerable Values { get; }\n int Count { get; }\n\n IEnumerable Query(TKey value);\n IEnumerable Query(TKey from, TKey to);\n\n void Add(TKey from, TKey to, TValue value);\n void Remove(TValue item);\n void Remove(IEnumerable items);\n void Clear();\n}\n```\n \n## Usage ###\n\n```csharp\nvar tree = new IntervalTree()\n{\n { 0, 10, \"1\" },\n { 20, 30, \"2\" },\n { 15, 17, \"3\" },\n { 25, 35, \"4\" },\n};\n\n// Alternatively, use the Add method, for example:\n// tree.Add(0, 10, \"1\");\n\nvar results1 = tree.Query(5); // 1 item: [0 - 10]\nvar results2 = tree.Query(10); // 1 item: [0 - 10]\nvar results3 = tree.Query(29); // 2 items: [20 - 30], [25 - 35]\nvar results4 = tree.Query(5, 15); // 2 items: [0 - 10], [15 - 17]\n```\n \nThe solution file contains more examples and tests, that show how to use IntervalTree with other data types.\n \n## Implementation Details ##\n\nIn this implementation, whenever you add or remove items from the tree, the tree goes \"out of sync\" internally, which means that the items are stored, but the tree-index is not updated yet. Upon the next query, the tree structure is automatically rebuild. Subsequent queries will use the cached index and be much faster. The creation of the tree-index requires `O(n log n)` time. Therefore, it is best suited for trees that do not change often or small trees, where the creation time is negligible.\n\n## RangeTree vs. IntervalTree ##\n\nThis project contains an IntervalTree (see [Issue #24](https://github.com/mbuchetics/RangeTree/issues/24)), but was incorrectly named RangeTree at the beginning. It was mostly renamed to IntervalTree in version 3.0.0. However, given that a large number of users are using this project, renaming the NuGet package and repository was not possible without breaking too much, so we settled with (just) renaming all occurences in the source code and documentation." }, { "path": "rangetree.ruleset", "content": "\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n" } ]