File: main.c

package info (click to toggle)
grass 6.4.4-1
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 104,028 kB
  • ctags: 40,409
  • sloc: ansic: 419,980; python: 63,559; tcl: 46,692; cpp: 29,791; sh: 18,564; makefile: 7,000; xml: 3,505; yacc: 561; perl: 559; lex: 480; sed: 70; objc: 7
file content (99 lines) | stat: -rw-r--r-- 2,162 bytes parent folder | download | duplicates (7)
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

/****************************************************************************
 *
 * MODULE:       bitmap
 * AUTHOR(S):    David Gerdes (CERL) (original contributor)
 *               Markus Neteler <neteler itc.it>, 
 *               Bernhard Reiter <bernhard intevation.de>, 
 *               Brad Douglas <rez touchofmadness.com>, 
 *               Glynn Clements <glynn gclements.plus.com>
 * PURPOSE:      provides basic support for the creation and manipulation of
 *               two dimensional bitmap arrays
 * COPYRIGHT:    (C) 1999-2006 by the GRASS Development Team
 *
 *               This program is free software under the GNU General Public
 *               License (>=v2). Read the file COPYING that comes with GRASS
 *               for details.
 *
 *****************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <grass/bitmap.h>


static int dump_map(struct BM *map);


int main(int argc, char *argv[])
{
    int SIZE;
    struct BM *map, *map2;
    int i, x, y;
    int dump;
    FILE *fp;

    if (argc < 2)
	SIZE = 11;
    else
	SIZE = atoi(argv[1]);

    if (NULL != getenv("NODUMP"))
	dump = 0;
    else
	dump = 1;

    map = BM_create(SIZE, SIZE);

    /* turn on bits in X pattern */
    for (i = 0; i < SIZE; i++) {
	BM_set(map, i, i, 1);
	BM_set(map, (SIZE - 1) - i, i, 1);
    }


    if (dump)
	dump_map(map);
    fprintf(stdout, "Size = %d\n", BM_get_map_size(map));

    fprintf(stdout, "\n\n");

    /* now invert it */
    for (y = 0; y < SIZE; y++)
	for (x = 0; x < SIZE; x++)
	    BM_set(map, x, y, !BM_get(map, x, y));

    if (dump)
	dump_map(map);

    fprintf(stdout, "Size = %d\n", BM_get_map_size(map));

    {
	fp = fopen("dumpfile", "w");
	BM_file_write(fp, map);
	fclose(fp);

	fp = fopen("dumpfile", "r");
	map2 = BM_file_read(fp);
	fclose(fp);
	dump_map(map2);
    }

    BM_destroy(map);
    BM_destroy(map2);

    return 0;
}


static int dump_map(struct BM *map)
{
    int x, y;

    for (y = 0; y < map->rows; y++) {
	for (x = 0; x < map->cols; x++) {
	    fprintf(stdout, "%c", BM_get(map, x, y) ? '#' : '.');

	}
	fprintf(stdout, "\n");
    }
}