AggregationList.cs 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. //
  2. // AggregationList.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 AggregationList<T> : IList<T>
  33. {
  34. readonly IList<IList<T>> listes;
  35. readonly int count;
  36. internal AggregationList (IList<IList<T>> listes)
  37. {
  38. this.listes = listes;
  39. foreach (var l in listes)
  40. count += l.Count;
  41. }
  42. public int IndexOf (T item)
  43. {
  44. throw new NotImplementedException();
  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. int listIndex, newIndex;
  57. GetModifiedIndexes (index, out listIndex, out newIndex);
  58. return listes[listIndex][newIndex];
  59. }
  60. set {
  61. throw new NotImplementedException();
  62. }
  63. }
  64. void GetModifiedIndexes (int index, out int listIndex, out int newIndex)
  65. {
  66. listIndex = 0;
  67. newIndex = index;
  68. while (newIndex >= listes[listIndex].Count) {
  69. newIndex -= listes[listIndex].Count;
  70. listIndex++;
  71. if (listIndex > listes.Count)
  72. throw new ArgumentOutOfRangeException ();
  73. }
  74. }
  75. public void Add (T item)
  76. {
  77. throw new NotImplementedException();
  78. }
  79. public void Clear ()
  80. {
  81. throw new NotImplementedException();
  82. }
  83. public bool Contains (T item)
  84. {
  85. throw new NotImplementedException();
  86. }
  87. public void CopyTo (T[] array, int arrayIndex)
  88. {
  89. throw new NotImplementedException();
  90. }
  91. public bool Remove (T item)
  92. {
  93. throw new NotImplementedException();
  94. }
  95. public int Count {
  96. get {
  97. return count;
  98. }
  99. }
  100. public bool IsReadOnly {
  101. get {
  102. return true;
  103. }
  104. }
  105. IEnumerator<T> IEnumerable<T>.GetEnumerator ()
  106. {
  107. return null;
  108. }
  109. IEnumerator IEnumerable.GetEnumerator ()
  110. {
  111. return null;
  112. }
  113. }
  114. }
  115. #endif