RangeList.cs 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  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. #if NET_4_0
  27. using System;
  28. using System.Collections;
  29. using System.Collections.Generic;
  30. namespace System.Linq.Parallel
  31. {
  32. internal class RangeList : IList<int>
  33. {
  34. readonly int start;
  35. readonly int count;
  36. public RangeList (int start, int count)
  37. {
  38. this.start = start;
  39. this.count = count;
  40. }
  41. public int IndexOf (int item)
  42. {
  43. if (!Contains(item))
  44. return -1;
  45. return item - start;
  46. }
  47. public void Insert (int index, int item)
  48. {
  49. throw new NotImplementedException();
  50. }
  51. public void RemoveAt (int index)
  52. {
  53. throw new NotImplementedException();
  54. }
  55. public int this[int index] {
  56. get {
  57. if (start + index <= count)
  58. return start + index;
  59. else
  60. return -1;
  61. }
  62. set {
  63. throw new NotImplementedException();
  64. }
  65. }
  66. public void Add (int item)
  67. {
  68. throw new NotImplementedException();
  69. }
  70. public void Clear ()
  71. {
  72. throw new NotImplementedException();
  73. }
  74. public bool Contains (int item)
  75. {
  76. return start <= item && item <= start + count - 1;
  77. }
  78. public void CopyTo (int[] array, int arrayIndex)
  79. {
  80. int counter = start;
  81. for (int i = arrayIndex; i < array.Length && i < (i - arrayIndex) + count; i++)
  82. array[i] = counter++;
  83. }
  84. public bool Remove (int item)
  85. {
  86. throw new NotImplementedException();
  87. }
  88. public int Count {
  89. get {
  90. return count;
  91. }
  92. }
  93. public bool IsReadOnly {
  94. get {
  95. return true;
  96. }
  97. }
  98. IEnumerator<int> IEnumerable<int>.GetEnumerator ()
  99. {
  100. return null;
  101. }
  102. IEnumerator IEnumerable.GetEnumerator ()
  103. {
  104. return null;
  105. }
  106. }
  107. }
  108. #endif