[初版]
1
POINT A
=
{
100
,
100
}
, B
=
{
200
,
200
}
;
2
void
dda_line(HDC
&
hdc)
3
{
4
double
length;
5
double
dx,dy;
6
double
x,y;
7
char
a[
20
];
8
9
if
(abs(B.x
-
A.x)
>=
abs(B.y
-
A.y))
10 length
=
abs(B.x
-
A.x);
11
else
12 length
=
abs(B.y
-
A.y);
13
14 dx
=
((B.x
-
A.x)
/
length);
15 dy
=
((B.y
-
A.y)
/
length);
16
17 x
=
A.x
+
0.5
;
18 y
=
A.y
+
0.5
;
19 sprintf(a,
"
A(%d,%d)
"
,
int
(x),
int
(y));
20 TextOut(hdc,
int
(x),
int
(y),a,
10
);
21
int
i
=
1
;
22
while
(i
<=
length)
23
{
24 SetPixel(hdc,
int
(x),
int
(y),RGB(
0
,
0
,
0
));
25 x
=
x
+
dx;
26 y
=
y
+
dy;
27 i
++
;
28
}
29 sprintf(a,
"
B(%d,%d)
"
,
int
(x),
int
(y));
30 TextOut(hdc,
int
(x),
int
(y),a,
10
);
31
return
;
32
}
33
POINT A
=
{
100
,
100
}
, B
=
{
200
,
200
}
;2
void
dda_line(HDC
&
hdc)3
{4
double
length;5
double
dx,dy;6
double
x,y;7
char
a[
20
];8
9
if
(abs(B.x
-
A.x)
>=
abs(B.y
-
A.y))10
length
=
abs(B.x
-
A.x);11
else
12
length
=
abs(B.y
-
A.y);13
14
dx
=
((B.x
-
A.x)
/
length);15
dy
=
((B.y
-
A.y)
/
length);16
17
x
=
A.x
+
0.5
;18
y
=
A.y
+
0.5
;19
sprintf(a,
"
A(%d,%d)
"
,
int
(x),
int
(y));20
TextOut(hdc,
int
(x),
int
(y),a,
10
);21
int
i
=
1
;22
while
(i
<=
length)23
{24
SetPixel(hdc,
int
(x),
int
(y),RGB(
0
,
0
,
0
));25
x
=
x
+
dx;26
y
=
y
+
dy;27
i
++
;28
}
29
sprintf(a,
"
B(%d,%d)
"
,
int
(x),
int
(y));30
TextOut(hdc,
int
(x),
int
(y),a,
10
);31
return
;32
}
33
看书上出来的一DDDA法。实践出来了Q拿上来记忆~~
[修改版]
1
void
dda_line(HDC
&
hdc, POINT A, POINT B,
int
color)
2
{
3
double
length;
4
double
dx,dy;
5
double
x,y;
6
if
(abs(B.x
-
A.x)
>=
abs(B.y
-
A.y))
7 length
=
abs(B.x
-
A.x);
8
else
9 length
=
abs(B.y
-
A.y);
10
11 dx
=
((B.x
-
A.x)
/
length);
12 dy
=
((B.y
-
A.y)
/
length);
13
14 x
=
A.x
+
0.5
;
15 y
=
A.y
+
0.5
;
16
int
i
=
1
;
17
while
(i
<=
length)
18
{
19 SetPixel(hdc,
int
(x),
int
(y), color);
20 x
=
x
+
dx;
21 y
=
y
+
dy;
22 i
++
;
23 }
24
return
;
25}
26
void
dda_line(HDC
&
hdc, POINT A, POINT B,
int
color)2
{3
double
length;4
double
dx,dy;5
double
x,y;6
if
(abs(B.x
-
A.x)
>=
abs(B.y
-
A.y))7
length
=
abs(B.x
-
A.x);8
else
9
length
=
abs(B.y
-
A.y);10
11
dx
=
((B.x
-
A.x)
/
length);12
dy
=
((B.y
-
A.y)
/
length);13
14
x
=
A.x
+
0.5
;15
y
=
A.y
+
0.5
;16
int
i
=
1
;17
while
(i
<=
length)18
{19
SetPixel(hdc,
int
(x),
int
(y), color);20
x
=
x
+
dx;21
y
=
y
+
dy;22
i
++
;23
}
24
return
;25
}
26
Zɽ法更适用于各U编E方法，加入A和B的点参数Q更加入颜色值color。在我的实际应用中，color被用来清除上一条画U结果的?
]]>
1
void
Bresenham_line(HDC
&
hdc)
2
{
3
char
a[
20
];
4
double
dx,dy;
5 dx
=
abs(B.x
-
A.x); dy
=
abs(B.y
-
A.y);
6
int
tx
=
(B.x
-
A.x)
>=
0
?
1
:
-
1
;
7
int
ty
=
(B.y
-
A.y)
>=
0
?
1
:
-
1
;
8
int
tag
=
0
;
9
if
(dx
<
dy)
10
{
11 tag
=
1
;
12
double
temp
=
A.x;
//
x1,y1互换
13
A.x
=
A.y;
14 A.y
=
temp;
15 temp
=
B.x;
//
x2,y2互换
16
B.x
=
B.y;
17 B.y
=
temp;
18 temp
=
dx;
//
dx,dy互换
19
dx
=
dy;
20 dy
=
temp;
21 temp
=
tx;
//
tx,ty互换
22
tx
=
ty;
23 ty
=
temp;
24 }
25
int
curx
=
A.x;
26
int
cury
=
A.y;
27
if
(tag)
28
{
29 SetPixel(hdc,cury,
600
-
curx,RGB(
0
,
0
,
0
));
30 sprintf(a,
"
A(%d,%d)
"
,cury,curx);
31 TextOut(hdc,cury,
600
-
curx,a,strlen(a));
32 }
33
else
34
{
35 SetPixel(hdc,curx,
600
-
cury,RGB(
0
,
0
,
0
));
36 sprintf(a,
"
A(%d,%d)
"
,curx,cury);
37 TextOut(hdc,curx,
600
-
cury,a,strlen(a));
38 }
39
double
d
=
2
*
dy
-
dx;
40
while
(cury
<=
B.y
&&
curx
<=
B.x)
41
{
42
if
(d
>=
0
)
43
{
44 d
=
d
+
2
*
(dy
-
dx);
45 cury
+=
ty;
46 }
47
else
48 d
=
d
+
2
*
dy;
49 curx
+=
tx;
50
if
(tag)
51 SetPixel(hdc,cury,
600
-
curx,RGB(
0
,
0
,
0
));
52
else
53 SetPixel(hdc,curx,
600
-
cury,RGB(
0
,
0
,
0
));
54 }
55
if
(tag)
56
{
57 SetPixel(hdc,cury,
600
-
curx,RGB(
0
,
0
,
0
));
58 sprintf(a,
"
B(%d,%d)
"
,cury,curx);
59 TextOut(hdc,cury,
600
-
curx,a,strlen(a));
60 }
61
else
62
{
63 SetPixel(hdc,curx,
600
-
cury,RGB(
0
,
0
,
0
));
64 sprintf(a,
"
B(%d,%d)
"
,curx,cury);
65 TextOut(hdc,curx,
600
-
cury,a,strlen(a));
66 }
67}
void
Bresenham_line(HDC
&
hdc)2
{3
char
a[
20
];4
double
dx,dy;5
dx
=
abs(B.x
-
A.x); dy
=
abs(B.y
-
A.y);6
int
tx
=
(B.x
-
A.x)
>=
0
?
1
:
-
1
;7
int
ty
=
(B.y
-
A.y)
>=
0
?
1
:
-
1
;8
int
tag
=
0
;9
if
(dx
<
dy)10
{11
tag
=
1
;12
double
temp
=
A.x;
//
x1,y1互换
13
A.x
=
A.y;14
A.y
=
temp;15
temp
=
B.x;
//
x2,y2互换
16
B.x
=
B.y;17
B.y
=
temp;18
temp
=
dx;
//
dx,dy互换
19
dx
=
dy;20
dy
=
temp;21
temp
=
tx;
//
tx,ty互换
22
tx
=
ty;23
ty
=
temp;24
}
25
int
curx
=
A.x;26
int
cury
=
A.y;27
if
(tag)28
{29
SetPixel(hdc,cury,
600
-
curx,RGB(
0
,
0
,
0
));30
sprintf(a,
"
A(%d,%d)
"
,cury,curx);31
TextOut(hdc,cury,
600
-
curx,a,strlen(a));32
}
33
else
34
{35
SetPixel(hdc,curx,
600
-
cury,RGB(
0
,
0
,
0
));36
sprintf(a,
"
A(%d,%d)
"
,curx,cury);37
TextOut(hdc,curx,
600
-
cury,a,strlen(a));38
}
39
double
d
=
2
*
dy
-
dx;40
while
(cury
<=
B.y
&&
curx
<=
B.x)41
{42
if
(d
>=
0
)43
{44
d
=
d
+
2
*
(dy
-
dx);45
cury
+=
ty;46
}
47
else
48
d
=
d
+
2
*
dy;49
curx
+=
tx;50
if
(tag)51
SetPixel(hdc,cury,
600
-
curx,RGB(
0
,
0
,
0
));52
else
53
SetPixel(hdc,curx,
600
-
cury,RGB(
0
,
0
,
0
));54
}
55
if
(tag)56
{57
SetPixel(hdc,cury,
600
-
curx,RGB(
0
,
0
,
0
));58
sprintf(a,
"
B(%d,%d)
"
,cury,curx);59
TextOut(hdc,cury,
600
-
curx,a,strlen(a));60
}
61
else
62
{63
SetPixel(hdc,curx,
600
-
cury,RGB(
0
,
0
,
0
));64
sprintf(a,
"
B(%d,%d)
"
,curx,cury);65
TextOut(hdc,curx,
600
-
cury,a,strlen(a));66
}
67
}
]]>
1 #include <queue>
2 #include <iostream>
3 #include <cstdlib>
4
5
6 /*
7 --------+ |Ready Queue 1| --------+ to CPU
8 __________________|
9 +
10 --------+ |Ready Queue 2| --------+ to CPU
11 __________________|
12 +
13 --------+ |Ready Queue 3| --------+ to CPU
14 __________________|
15 +
16 ---------+ |Ready Queue 4| --------+ to CPU
17 +__________________|
18 以上加号E执行流?br />19 */
20
21 int time[4]={1,2,3,4}; //各个队列的时间片
22 char *str[4]={"first","second","third","fourth"};
23 queue<int> Rqueue[4]; //各个优先U队列定义?/span>
24
25 int execu(int n)
26 //n是指哪一个队列?br />27 //proc假设Z个进E?/span>
28 {
29 int proc; //代表一个进E?/span>
30 while(!Rqueue[n-1].empty())
31 {
32 proc=Rqueue[n-1].front(); //取队首进E进行调度?/span>
33 proc = proc - time[n-1]; //旉片轮转，执行调度后得到的q程
34 cout<< proc <<" in the "<<str[n-1]<<" queue"<<endl;
35 if( proc >=0 ) //假设q程旉片用完，但还没有执行完?/span>
36 {
37 if(n-1<3)Rqueue[n].push(proc); //其压入下一个低优先U的队列
38 else
39 Rqueue[n-1].push(proc); //如果是最后一个队列，则压入本w?/span>
40 }
41 Rqueue[n-1].pop(); //q行下一ơ队列调?/span>
42 }
43 return 0; //q回Q代表该队列的所有进E均已调度过
44 }
45
46 int schedule(int& proc) //最初执行一个程序，创徏一个进E，调度法开始?/span>
47 {
48 Rqueue[0].push(proc); //进E压入第一个队列?/span>
49 for(int i=1; i<=4; i++)
50 execu(i);
51 //当execu()q回Ӟ意味着上一优先U队列里的进E均已调度完Q进行下一个队列的调度
52 }
53
54
55 int main(int argc, char* argv[])
56 {
57 /*
58 for(int i=0; i<100; i++)
59 {
60 int n=int(rand())%4;
61 Rqueue[n].push(int(rand())%3);
62 }
63 */
64 int proc=15; //新进E?/span>
65 schedule(proc);
66 system("PAUSE");
67 return 0;
68 }
69
2 #include <iostream>
3 #include <cstdlib>
4
5
6 /*
7 --------+ |Ready Queue 1| --------+ to CPU
8 __________________|
9 +
10 --------+ |Ready Queue 2| --------+ to CPU
11 __________________|
12 +
13 --------+ |Ready Queue 3| --------+ to CPU
14 __________________|
15 +
16 ---------+ |Ready Queue 4| --------+ to CPU
17 +__________________|
18 以上加号E执行流?br />19 */
20
21 int time[4]={1,2,3,4}; //各个队列的时间片
22 char *str[4]={"first","second","third","fourth"};
23 queue<int> Rqueue[4]; //各个优先U队列定义?/span>
24
25 int execu(int n)
26 //n是指哪一个队列?br />27 //proc假设Z个进E?/span>
28 {
29 int proc; //代表一个进E?/span>
30 while(!Rqueue[n-1].empty())
31 {
32 proc=Rqueue[n-1].front(); //取队首进E进行调度?/span>
33 proc = proc - time[n-1]; //旉片轮转，执行调度后得到的q程
34 cout<< proc <<" in the "<<str[n-1]<<" queue"<<endl;
35 if( proc >=0 ) //假设q程旉片用完，但还没有执行完?/span>
36 {
37 if(n-1<3)Rqueue[n].push(proc); //其压入下一个低优先U的队列
38 else
39 Rqueue[n-1].push(proc); //如果是最后一个队列，则压入本w?/span>
40 }
41 Rqueue[n-1].pop(); //q行下一ơ队列调?/span>
42 }
43 return 0; //q回Q代表该队列的所有进E均已调度过
44 }
45
46 int schedule(int& proc) //最初执行一个程序，创徏一个进E，调度法开始?/span>
47 {
48 Rqueue[0].push(proc); //进E压入第一个队列?/span>
49 for(int i=1; i<=4; i++)
50 execu(i);
51 //当execu()q回Ӟ意味着上一优先U队列里的进E均已调度完Q进行下一个队列的调度
52 }
53
54
55 int main(int argc, char* argv[])
56 {
57 /*
58 for(int i=0; i<100; i++)
59 {
60 int n=int(rand())%4;
61 Rqueue[n].push(int(rand())%3);
62 }
63 */
64 int proc=15; //新进E?/span>
65 schedule(proc);
66 system("PAUSE");
67 return 0;
68 }
69
以上即ؓ我的实验成果Q经~译q行后，证明是正的?br />如果中间q有不正的Q请不吝指教?br />谢谢Q?br />
]]>
]]>
?SPAN lang=EN-US>A?SPAN lang=EN-US>A的一个双称?SPAN lang=EN-US>A的一个排列（permutationQ?/SPAN>
如果A={a1,a2,…?an}是有限集Q?SPAN lang=EN-US>p?SPAN lang=EN-US>A上的双射Q可以用另一U方式表C个双，?SPAN lang=EN-US>A?SPAN lang=EN-US>n个元?SPAN lang=EN-US>a1,a2,…?an和对应的n个函数?SPAN lang=EN-US>p(a1),p(a2),…?p(an)排成两行Q如下所C?BR>
A中元素的n个函数?SPAN lang=EN-US>p(a1),p(a2),…?p(an)的序列，实际是A中元素的重新排列?BR>Q这是一U新的方式表C双。注意对比关pȝ有序对表CŞ式，与函数表CŞ式。）
Q未完，待箋Q?/SPAN>
]]>