AggregationList.cs 3.0 KB

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