Untitled

SUBMITTED BY: Guest

DATE: Dec. 10, 2013, 12:07 a.m.

FORMAT: Text only

SIZE: 13.1 kB

Raw Download

HITS: 2156

Report
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5. #include <string.h> //includes strcmp
  6. #include <ctype.h> //isspace
  8. typedef enum
  9. {
  10. FEW_ARG, WRONG_ARG, MANY_ARG, NO_HLINE, NO_VLINE, WRONG_FILE, NO_SQUARE
  11. } ERRORS; //indicates a type of an error
  13. typedef enum
  14. {
  15. INVALID, VALID
  16. }MY_BOOL;
  18. typedef struct {
  19. int rows;
  20. int cols;
  21. char *cells;
  22. } Bitmap;
  24. void Help();
  25. void Error(ERRORS err);
  26. void Tisk_bool(MY_BOOL validni);
  27. char* alloc_Bitmap(int vyska, int sirka, Bitmap* stru);
  28. void free_Bitmap(Bitmap arr);
  29. int test(char* soubor, Bitmap* bitmapa);
  30. void test_bitmap(Bitmap* neco);
  31. char getcolor(Bitmap *bitmap, int x, int y);
  32. int find_vline(Bitmap *bitmap, int *x1, int *y1, int *x2, int *y2);
  33. int find_hline(Bitmap *bitmap, int *x1, int *y1, int *x2, int *y2);
  34. int find_square(Bitmap *bitmap, int *x1, int *y1, int *x2, int *y2);
  36. int main(int argc, char *argv[])
  37. {
  38. Bitmap struktura;
  39. int x1,x2,y1,y2;
  40. int found;
  41. switch (argc)
  42. {
  43. case 1: Error(FEW_ARG);
  44. break;
  45. case 2: if (strcmp(argv[1], "--help" ) == 0)
  46. Help();
  47. else
  48. Error(WRONG_ARG);
  49. break;
  50. case 3: if (strcmp(argv[1], "--test" ) == 0)
  51. {
  52. Tisk_bool(test(argv[2], &struktura)); //zkontroluje a vypíše
  53. }
  54. else if (strcmp(argv[1], "--hline" ) == 0)
  55. {
  56. if(test(argv[2], &struktura ) == 1) //soubor obsahuje bitmapu
  57. {
  58. found = find_hline(&struktura, &x1, &y1, &x2, &y2);
  59. if (found == 0)
  60. {
  61. Error(NO_HLINE);
  62. }
  63. else
  64. {
  65. printf("%d %d %d %d\n", x1, y1, x2, y2);
  66. }
  67. }
  68. else
  69. {
  70. Error(WRONG_FILE);
  71. }
  72. }
  73. else if (strcmp(argv[1], "--vline" ) == 0)
  74. {
  75. if(test(argv[2], &struktura ) == 1) //soubor obsahuje bitmapu
  76. {
  77. found = find_vline(&struktura, &x1, &y1, &x2, &y2);
  78. if (found == 0)
  79. {
  80. Error(NO_VLINE);
  81. }
  82. else
  83. {
  84. printf("%d %d %d %d\n", x1, y1, x2, y2);
  85. }
  86. }
  87. else
  88. {
  89. Error(WRONG_FILE);
  90. }
  91. }
  92. else if (strcmp(argv[1], "--square" ) == 0)
  93. {
  94. if(test(argv[2], &struktura ) == 1) //soubor obsahuje bitmapu
  95. {
  96. found = find_square(&struktura, &x1, &y1, &x2, &y2);
  97. if (found == 0)
  98. {
  99. Error(NO_SQUARE);
  100. }
  101. else
  102. {
  103. printf("%d %d %d %d\n", x1, y1, x2, y2);
  104. }
  105. }
  106. else
  107. {
  108. Error(WRONG_FILE);
  109. }
  110. }
  111. else
  112. Error(WRONG_ARG);
  113. break;
  114. default:
  115. Error(MANY_ARG);
  116. break;
  117. }
  118. free(struktura.cells);
  119. return 0;
  120. }
  122. void Help()
  123. {
  124. printf("Program: 3rd project for IZP - Searching of shapes\n"
  125. "Author: Eliska Chalupova (c) 2013\n \n"
  126. "Control: \n"
  127. "--help prints how to use the program\n"
  128. "--test checks if a file contains a bitmap picture or not\n"
  129. "--hline prints coordinates of the first longest horizontal line segment of a picture\n"
  130. "--vline prints coordinates of the first longest vertical line segment of a picture\n"
  131. "--square prints coordinates of the first biggest square of a picture\n");
  132. }
  134. void Error(ERRORS err)
  135. {
  136. switch(err)
  137. {
  138. case FEW_ARG: fprintf(stderr, "You have not written enough arguments. For help use --help\n");
  139. break;
  140. case WRONG_ARG: fprintf(stderr, "You have used wrong arguments. For help use --help\n");
  141. break;
  142. case MANY_ARG: fprintf(stderr, "You have written too many arguments. For help use --help\n");
  143. break;
  144. case NO_HLINE: fprintf(stderr, "There is no horizontal line in the file.\n");
  145. break;
  146. case NO_VLINE: fprintf(stderr, "There is no vertical line in the file.\n");
  147. break;
  148. case NO_SQUARE: fprintf(stderr, "There is no square in the file.\n");
  149. break;
  150. case WRONG_FILE:fprintf(stderr, "The file does not contain a correct bitmap.\n");
  151. break;
  152. }
  153. }
  155. void Tisk_bool(MY_BOOL validni)
  156. {
  157. switch (validni)
  158. {
  159. case INVALID: printf("Invalid\n");
  160. break;
  161. case VALID: printf("Valid\n");
  162. break;
  163. }
  164. }
  166. int test(char* soubor, Bitmap* bitmapa)
  167. {
  168. FILE* p_file;
  169. p_file = fopen(soubor,"r");
  170. if (p_file == NULL)
  171. {
  172. return INVALID;
  173. }
  174. else //soubor se otevøel
  175. {
  176. int RP = 1; //pro switch
  177. int pocitadlo = 0; //pocitadlo jednicek a nul
  178. int c_predchozi = 0;
  179. int radky = 0;
  180. int sloupce = 0;
  181. int c = 0;
  182. Bitmap struktura;
  183. char* alok_pole = NULL;
  184. int uz_nealokuj = 0; //aby se krok 3 neopakoval vícekrát
  186. while ((c = fgetc(p_file))!=EOF)
  187. {
  188. if(isspace(c)==0) //neni mezera
  189. {
  190. if(isdigit(c)!=0) //je číslo
  191. {
  192. int c_cislo = c - '0';
  193. switch(RP)
  194. {
  195. case 1: radky = c_predchozi*10 + c_cislo;
  196. c_predchozi = c_cislo;
  197. //printf("radky: %d", radky); //OK
  198. bitmapa->rows = radky;
  199. break;
  200. case 2: sloupce = c_predchozi*10 + c_cislo;
  201. c_predchozi = c_cislo;
  202. //printf(" sloupce: %d", sloupce); //OK
  203. bitmapa->cols = sloupce;
  204. break;
  205. case 3: if((c == '1' || c == '0') && pocitadlo <= (radky * sloupce))
  206. {
  207. alok_pole[pocitadlo] = c;
  208. pocitadlo++;
  209. }
  210. else
  211. {
  212. if (alok_pole != NULL)
  213. {
  214. free(alok_pole);
  215. alok_pole = NULL;
  216. }
  217. return INVALID;
  218. }
  219. break;
  220. }
  221. }
  222. else //není èíslo
  223. {
  224. if (alok_pole != NULL)
  225. {
  226. free(alok_pole);
  227. alok_pole = NULL;
  228. }
  229. return INVALID;
  230. }
  231. }
  232. else //je mezera
  233. {
  234. if(radky!=0 && sloupce == 0)
  235. {
  236. RP = 2;
  237. c_predchozi = 0;
  238. }
  239. if(sloupce!=0 && uz_nealokuj == 0)
  240. {
  241. alok_pole = alloc_Bitmap(radky, sloupce, &struktura); //nacte radky, sloupce a alokuje pole o urcite velikosti ve strukture
  242. uz_nealokuj = 1;
  243. RP = 3;
  244. }
  245. }
  246. }
  247. if (pocitadlo < (radky*sloupce)) //
  248. {
  249. if (alok_pole != NULL)
  250. {
  251. free(alok_pole);
  252. alok_pole = NULL;
  253. }
  254. return INVALID;
  255. }
  256. bitmapa->cells = alok_pole;
  257. }
  258. return VALID;
  259. }
  261. char* alloc_Bitmap(int vyska, int sirka, Bitmap* stru)
  262. {
  263. stru->rows = vyska;
  264. stru->cols = sirka;
  265. stru->cells = malloc((vyska*sirka)*sizeof(char));
  266. return stru->cells; //ukazatel
  267. }
  269. void free_Bitmap(Bitmap stru)
  270. {
  271. free(stru.cells);
  272. stru.cells = NULL; //!!!!!
  273. }
  275. void test_bitmap(Bitmap* neco)
  276. {
  277. for(int i = 0; i < neco->rows*neco->cols; i++)
  278. {
  279. printf("%c ",neco->cells[i]);
  280. }
  282. }
  284. char getcolor(Bitmap *bitmap, int x, int y)
  285. {
  286. return bitmap->cells[(((bitmap->cols)*y) + x)];
  287. }
  288. int find_vline(Bitmap *bitmap, int *x1, int *y1, int *x2, int *y2)
  289. {
  290. *x1 = 1;
  291. *y1 = 3;
  292. *x2 = 4;
  293. *y2 = 9;
  294. return 0;
  295. }
  296. int find_hline(Bitmap *bitmap, int *x1, int *y1, int *x2, int *y2)
  297. {
  298. int pocitadlo = 0;
  299. char predch = '0';
  300. int nejdelsi = 0;
  301. int konec = 0;
  302. char akt;
  303. for (int j = 0; j < bitmap->rows; j++)
  304. {
  305. for(int i = 0; i < bitmap->cols; i++)
  306. {
  307. akt = getcolor(bitmap, i, j);
  308. printf("%d . ", akt);
  309. //if(akt!='1' || akt!='0'){exit(100);}
  311. if (i == bitmap->cols - 1)
  312. {
  313. konec = 1;
  314. }
  315. if (akt == '1')
  316. {
  317. pocitadlo++;
  318. }
  320. if(akt == '0')
  321. {
  322. pocitadlo = 0;
  323. }
  325. if ((akt == '0' || konec == 1) && predch == '1' && pocitadlo > nejdelsi)
  326. {
  327. nejdelsi = pocitadlo;
  328. pocitadlo = 0;
  329. if (nejdelsi >= 2)
  330. {
  331. *x2 = i;
  332. *y2 = j;
  333. *x1 = i - nejdelsi;
  334. *y1 = j;
  335. }
  336. else
  337. {
  338. return 10;
  339. }
  340. }
  341. predch = akt;
  342. }
  343. pocitadlo = 0;
  344. predch = 0;
  345. konec = 0;
  346. }
  348. return 1;
  349. }
  350. int find_square(Bitmap *bitmap, int *x1, int *y1, int *x2, int *y2)
  351. {
  352. *x1 = 1;
  353. *y1 = 8;
  354. *x2 = 4;
  355. *y2 = 9;
  356. return 0;
  357. }
comments powered by Disqus