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
|
/*
Copyright (c) 1993-2008, Cognitive Technologies
All rights reserved.
,
, , :
*
,
.
* /
, ,
,
.
* Cognitive Technologies,
/
, ,
.
/ "
" - , ,
,
. ,
/ ,
Ѩ , , ,
,
( , ,
, / , -
/ ,
), ,
.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the Cognitive Technologies nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef __LINDEFS_H
#define __LINDEFS_H
#include "wind32.h"
#define FILE_PCX 900
#define ONLY_STRETCH 910
#define ONLY_LINE 911
#define ONLY_BOX_LINE 912
#define NO_RASTER 920
#define YES_RASTER 921
#define YES_OUT_LIN 930
#define NO_OUT_LIN 931
#define YES_OUT_BIN 940
#define NO_OUT_BIN 941
#define ID_USER 999
typedef struct lines_par{
int vmaxwid;
int vminlen;
int vlsarea;
int vlconnill;
int vlconnils;
int vlconniss;
int vstartlenf;
int vstartlens;
int gmaxwid;
int gminlen;
int glsarea;
int glconnill;
int glconnils;
int glconniss;
int gstartlenf;
int gstartlens;
int lcont;
int minboxw;
int bsarf;
int psarf;
int psarb;
int gangl;
int langl;
int linnm;
} PAR_LINE;
#define STRETCH struct h_STRETCH // १
#define LINE struct h_LINE //ᠭ
#define BOX struct h_BOX
#define KNOTL struct h_KNOTL //, 騥 祭
#define LINES struct h_LINES // , ᮢ 㧫.
STRETCH
{
POINT Beg,End; //砫 १
POINT BegOld,EndOld; //砫 १
float k; // y=kx+b
float b; //ᬥ饭
short thickness; //। ⮫騭 १
};
LINE
{
int NumStretch;
STRETCH *Stretch; //[NumStretch] - १
};
BOX
{
short Top; // 孥
short Left; //
short Bottom;//
short Right; // ࠢ
short Diag13, Diag24;
};
KNOTL
{
short InVertLine; // ⨪쭮
short InVertStretch;// १ 浪 室 १
short InHorLine; // ਧ⠫쭮
short InHorStretch; // १ 浪 室 १
POINT PointIntersection;//窠 祭
short TypeIntersection;//⨯ 祭
};
LINES
{
short NumAll; //饥
short NumVert; // ⨪
short NumHor; // ਧ⠫
short NumOther;// ⠫
LINE *Line; //[NumAll] - ᨢ
short NumBox; // אַ㣮쭨
BOX *Box; //[NumBox] - ᨢ אַ㣮쭨
short NumKnot;// 㧫
KNOTL *Knotl; //[NumKnotl] - ᨢ 㧫
};
typedef struct h_BMPL
{
int widthBit;
int height;
int widthByte;
int NumBuf;
uchar **bmp; //bmp[NumBuf][64000]
} BMPL;
//typedef int (*FUN_POMP)(void);
//typedef void (*FUN_MESS)(uint16_t wPar,DWORD lPar);
#include "undef32.h"
#endif
|
