-
Notifications
You must be signed in to change notification settings - Fork 13
Expand file tree
/
Copy pathSVMExtensions.cs
More file actions
82 lines (71 loc) · 2.16 KB
/
Copy pathSVMExtensions.cs
File metadata and controls
82 lines (71 loc) · 2.16 KB
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace Bigtree.Algorithm.SVM
{
internal static class SVMExtensions
{
private const double PRECISION = 1000000.0;
public static double Truncate(this double x)
{
return Math.Round(x * PRECISION) / PRECISION;
}
public static void SwapIndex<T>(this T[] list, int i, int j)
{
T tmp = list[i];
list[i] = list[j];
list[j] = tmp;
}
public static bool IsEqual<T>(this T[][] lhs, T[][] rhs)
{
if (lhs.Length != rhs.Length)
return false;
for (int i = 0; i < lhs.Length; i++)
{
if (!lhs[i].IsEqual(rhs[i]))
return false;
}
return true;
}
public static bool IsEqual<T>(this T[] lhs, T[] rhs)
{
if (lhs.Length != rhs.Length)
return false;
for (int i = 0; i < lhs.Length; i++)
if (!lhs[i].Equals(rhs[i]))
return false;
return true;
}
public static bool IsEqual(this double[] lhs, double[] rhs)
{
if (lhs.Length != rhs.Length)
return false;
for (int i = 0; i < lhs.Length; i++)
{
double x = lhs[i].Truncate();
double y = rhs[i].Truncate();
if (x != y)
return false;
}
return true;
}
public static bool IsEqual(this double[][] lhs, double[][] rhs)
{
if (lhs.Length != rhs.Length)
return false;
for (int i = 0; i < lhs.Length; i++)
if (!lhs[i].IsEqual(rhs[i]))
return false;
return true;
}
public static int ComputeHashcode<T>(this T[] array)
{
return array.Sum(o => o.GetHashCode());
}
public static int ComputeHashcode<T>(this T[][] array)
{
return array.Sum(o => o.ComputeHashcode());
}
}
}