RangeList.cs 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  1. //
  2. // RangeList.cs
  3. //
  4. // Author:
  5. // Jérémie "Garuma" Laval <[email protected]>
  6. //
  7. // Copyright (c) 2010 Jérémie "Garuma" Laval
  8. //
  9. // Permission is hereby granted, free of charge, to any person obtaining a copy
  10. // of this software and associated documentation files (the "Software"), to deal
  11. // in the Software without restriction, including without limitation the rights
  12. // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. // copies of the Software, and to permit persons to whom the Software is
  14. // furnished to do so, subject to the following conditions:
  15. //
  16. // The above copyright notice and this permission notice shall be included in
  17. // all copies or substantial portions of the Software.
  18. //
  19. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. // THE SOFTWARE.
  26. using System;
  27. using System.Collections;
  28. using System.Collections.Generic;
  29. namespace System.Linq.Parallel
  30. {
  31. internal class RangeList : IList<int>
  32. {
  33. readonly int start;
  34. readonly int count;
  35. public RangeList (int start, int count)
  36. {
  37. this.start = start;
  38. this.count = count;
  39. }
  40. public int IndexOf (int item)
  41. {
  42. if (!Contains(item))
  43. return -1;
  44. return item - start;
  45. }
  46. public void Insert (int index, int item)
  47. {
  48. throw new NotImplementedException();
  49. }
  50. public void RemoveAt (int index)
  51. {
  52. throw new NotImplementedException();
  53. }
  54. public int this[int index] {
  55. get {
  56. if (index <= count)
  57. return start + index;
  58. return -1;
  59. }
  60. set {
  61. throw new NotImplementedException();
  62. }
  63. }
  64. public void Add (int item)
  65. {
  66. throw new NotImplementedException();
  67. }
  68. public void Clear ()
  69. {
  70. throw new NotImplementedException();
  71. }
  72. public bool Contains (int item)
  73. {
  74. return start <= item && item <= start + count - 1;
  75. }
  76. public void CopyTo (int[] array, int arrayIndex)
  77. {
  78. int counter = start;
  79. for (int i = arrayIndex; i < array.Length && i < (i - arrayIndex) + count; i++)
  80. array[i] = counter++;
  81. }
  82. public bool Remove (int item)
  83. {
  84. throw new NotImplementedException();
  85. }
  86. public int Count {
  87. get {
  88. return count;
  89. }
  90. }
  91. public bool IsReadOnly {
  92. get {
  93. return true;
  94. }
  95. }
  96. IEnumerator<int> IEnumerable<int>.GetEnumerator ()
  97. {
  98. return null;
  99. }
  100. IEnumerator IEnumerable.GetEnumerator ()
  101. {
  102. return null;
  103. }
  104. }
  105. }