Welcome to mirror list, hosted at ThFree Co, Russian Federation.

SupportClasses.cs « Test « Mono.C5 « class « mcs - github.com/mono/mono.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: c6221c010655edfadda038beb892296a8b917634 (plain)
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
#if NET_2_0
/*
 Copyright (c) 2003-2004 Niels Kokholm <kokholm@itu.dk> and Peter Sestoft <sestoft@dina.kvl.dk>
 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.
*/

using System;
using C5;
using NUnit.Framework;
using MSG = System.Collections.Generic;
using C = System.Collections;

namespace nunit
{
	using System;
	using C5;
	using NUnit.Framework;
	class SC: IComparer<string>
	{
		public int Compare(string a, string b)
		{
			return a.CompareTo(b);
		}


		public void appl(String s)
		{
			System.Console.WriteLine("--{0}", s);
		}
	}



	class IC: IComparer<int>, IComparable<int>, IComparer<IC>, IComparable<IC>
	{
		public int Compare(int a, int b)
		{
			return a > b ? 1 : a < b ? -1 : 0;
		}


		public int Compare(IC a, IC b)
		{
			return a._i > b._i ? 1 : a._i < b._i ? -1 : 0;
		}


		private int _i;


		public int i
		{
			get { return _i; }
			set { _i = value; }
		}


		public IC() { }


		public IC(int i) { _i = i; }


		public int CompareTo(int that) 		{			return _i > that ? 1 : _i < that ? -1 : 0;		}

        public bool Equals(int that) { return _i == that; }


        public int CompareTo(IC that) { return _i > that._i ? 1 : _i < that._i ? -1 : 0; }
        public bool Equals(IC that) { return _i == that._i; }


        public static bool eq(MSG.IEnumerable<int> me, params int[] that)
		{
			int i = 0, maxind = that.Length - 1;

			foreach (int item in me)
				if (i > maxind || item != that[i++])
					return false;

			return i == maxind + 1;
		}
		public static bool seq(ICollection<int> me, params int[] that)
		{
			int[] me2 = me.ToArray();

			Array.Sort(me2);

			int i = 0, maxind = that.Length - 1;

			foreach (int item in me2)
				if (i > maxind || item != that[i++])
					return false;

			return i == maxind + 1;
		}
	}

	
	class RevIC: IComparer<int>
	{
		public int Compare(int a, int b)
		{
			return a > b ? -1 : a < b ? 1 : 0;
		}
	}



	public delegate int Int2Int(int i);


	public class FunEnumerable: MSG.IEnumerable<int>
	{
		int size;

		Int2Int f;


		public FunEnumerable(int size, Int2Int f)
		{
			this.size = size; this.f = f;
		}


		public bool Exists(Filter<int> filter) { return false; }


		public bool All(Filter<int> filter) { return false; }


		public MSG.IEnumerator<int> GetEnumerator()
		{
			for (int i = 0; i < size; i++)
				yield return f(i);
		}

		C.IEnumerator C.IEnumerable.GetEnumerator ()
		{
			return GetEnumerator ();
		}

		public void Apply(Applier<int> a) { }
	}

}
#endif