2
0

ReverseList.cs 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119
  1. //
  2. // QueryReverseNode.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.Linq;
  28. using System.Threading;
  29. using System.Collections;
  30. using System.Collections.Generic;
  31. namespace System.Linq.Parallel
  32. {
  33. internal class ReverseList<T> : IList<T>
  34. {
  35. readonly IList<T> backend;
  36. readonly int count;
  37. internal ReverseList (IList<T> backend)
  38. {
  39. this.backend = backend;
  40. this.count = backend.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. return backend[count - 1 - index];
  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. throw new NotImplementedException();
  73. }
  74. public void CopyTo (T[] array, int arrayIndex)
  75. {
  76. throw new NotImplementedException();
  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. }
  102. #endif