1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
//
// QueryReverseNode.cs
//
// Author:
// Jérémie "Garuma" Laval <jeremie.laval@gmail.com>
//
// Copyright (c) 2010 Jérémie "Garuma" Laval
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#if NET_4_0
using System.Linq;
using System.Threading;
using System.Collections;
using System.Collections.Generic;
namespace System.Linq.Parallel
{
internal class ReverseList<T> : IList<T>
{
readonly IList<T> backend;
readonly int count;
internal ReverseList (IList<T> backend)
{
this.backend = backend;
this.count = backend.Count;
}
public int IndexOf (T item)
{
throw new NotImplementedException();
}
public void Insert (int index, T item)
{
throw new NotImplementedException();
}
public void RemoveAt (int index)
{
throw new NotImplementedException();
}
public T this[int index] {
get {
return backend[count - 1 - index];
}
set {
throw new NotImplementedException();
}
}
public void Add (T item)
{
throw new NotImplementedException();
}
public void Clear ()
{
throw new NotImplementedException();
}
public bool Contains (T item)
{
throw new NotImplementedException();
}
public void CopyTo (T[] array, int arrayIndex)
{
throw new NotImplementedException();
}
public bool Remove (T item)
{
throw new NotImplementedException();
}
public int Count {
get {
return count;
}
}
public bool IsReadOnly {
get {
return true;
}
}
IEnumerator<T> IEnumerable<T>.GetEnumerator ()
{
return null;
}
IEnumerator IEnumerable.GetEnumerator ()
{
return null;
}
}
}
#endif
|
