RepeatList.cs 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. //
  2. // RepeatList.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 RepeatList<T> : IList<T>
  32. {
  33. readonly int count;
  34. readonly T element;
  35. public RepeatList (T element, int count)
  36. {
  37. this.element = element;
  38. this.count = count;
  39. }
  40. public int IndexOf (T item)
  41. {
  42. // No real index, we may just be interested if the value is different from -1
  43. return Contains(item) ? 1 : -1;
  44. }
  45. public void Insert (int index, T item)
  46. {
  47. throw new NotImplementedException();
  48. }
  49. public void RemoveAt (int index)
  50. {
  51. throw new NotImplementedException();
  52. }
  53. public T this[int index] {
  54. get {
  55. return index < count ? element : default(T);
  56. }
  57. set {
  58. throw new NotImplementedException();
  59. }
  60. }
  61. public void Add (T item)
  62. {
  63. throw new NotImplementedException();
  64. }
  65. public void Clear ()
  66. {
  67. throw new NotImplementedException();
  68. }
  69. public bool Contains (T item)
  70. {
  71. return item.Equals(element);
  72. }
  73. public void CopyTo (T[] array, int arrayIndex)
  74. {
  75. for (int i = arrayIndex; i < array.Length && i < (i - arrayIndex) + count; i++)
  76. array[i] = element;
  77. }
  78. public bool Remove (T item)
  79. {
  80. throw new NotImplementedException();
  81. }
  82. public int Count {
  83. get {
  84. return count;
  85. }
  86. }
  87. public bool IsReadOnly {
  88. get {
  89. return true;
  90. }
  91. }
  92. IEnumerator<T> IEnumerable<T>.GetEnumerator ()
  93. {
  94. return null;
  95. }
  96. IEnumerator IEnumerable.GetEnumerator ()
  97. {
  98. return null;
  99. }
  100. }
  101. }