-
Notifications
You must be signed in to change notification settings - Fork 0
/
retraverse.cs
95 lines (65 loc) · 1.92 KB
/
retraverse.cs
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
using System;
using System.Collections.Generic;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Filtermap
{
class retraverse
{
static Bitmap block;
static Bitmap block2;
public Bitmap[,] traverse(Bitmap[,] inarr, int l1, int l2)
{
int d = -1;
int i = 0;
int j = 0;
int i_prev = 0;
int j_prev = 0;
for (int k = 0; k <= inarr.GetLength(0); k++)
{
for (int l = 0; l < inarr.GetLength(1); l++)
{
/* i = i + 1;
j = j + 1;
*/
i += d;
j -= d;
if (i < 0)
{
i++;
d = -d;
}
else if (j < 0)
{
j++;
d = -d;
}
Console.WriteLine("i=" + (i));
Console.WriteLine("j=" + (j));
Console.WriteLine("i_prev=" + (i_prev));
Console.WriteLine("j_prev=" + (j_prev));
toexchange(inarr, i, j, i_prev, j_prev, l1, l2);
i_prev = i;
j_prev = j;
}
}
return inarr;
}
public void toexchange(Bitmap[,] a, int k, int l, int k_prev, int l_prev, int l1, int l2)
{
//block[k,l] = a[k, l];
try
{
block = a[k, l];
block2 = a[k_prev, l_prev];
}
catch (Exception e)
{
e.ToString();
}
// reexchange.exchngeblocks(block, block2, a, k, l, l1, l2);
}
}
}