RepeatList.cs 2.7 KB

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