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
|
// **********************************************************************
//
// Copyright (c) 2003-2006 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
using System.Collections;
namespace IceUtil
{
public sealed class Arrays
{
public static bool Equals(object[] arr1, object[] arr2)
{
if(object.ReferenceEquals(arr1, arr2))
{
return true;
}
if(arr1.Length == arr2.Length)
{
for(int i = 0; i < arr1.Length; i++)
{
if(!arr1[i].Equals(arr2[i]))
{
return false;
}
}
return true;
}
return false;
}
public static void Sort(ref ArrayList array, IComparer comparator)
{
//
// This Sort method implements the merge sort algorithm
// which is a stable sort (unlike the Sort method of the
// System.Collections.ArrayList which is unstable).
//
Sort1(ref array, 0, array.Count, comparator);
}
private static void Sort1(ref ArrayList array, int begin, int end, IComparer comparator)
{
int mid;
if(end - begin <= 1)
{
return;
}
mid = (begin + end) / 2;
Sort1(ref array, begin, mid, comparator);
Sort1(ref array, mid, end, comparator);
Merge(ref array, begin, mid, end, comparator);
}
private static void Merge(ref ArrayList array, int begin, int mid, int end, IComparer comparator)
{
int i = begin;
int j = mid;
int k = 0;
object[] tmp = new object[end - begin];
while(i < mid && j < end)
{
if(comparator.Compare(array[i], array[j]) <= 0)
{
tmp[k++] = array[i++];
}
else
{
tmp[k++] = array[j++];
}
}
while(i < mid)
{
tmp[k++] = array[i++];
}
while(j < end)
{
tmp[k++] = array[j++];
}
for(i = 0; i < (end - begin); ++i)
{
array[begin + i] = tmp[i];
}
}
}
}
|
