summaryrefslogtreecommitdiff
path: root/2004/i/nono/src/path/test_map.cc
blob: 255859b0acd6504de164eb3bbd44853d21d8e5a3 (plain)
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
// test_map.cc
// nono - programme du robot 2004. {{{
//
// Copyright (C) 2004 Nicolas Schodet
//
// Robot APB Team/Efrei 2004.
//        Web: http://assos.efrei.fr/robot/
//      Email: robot AT efrei DOT fr
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// }}}
#include "map.h"

#include <exception>
#include <iostream>
#include <cstdlib>

int
main (int argc, char **argv)
{
    if (argc < 5 || argc % 4 != 1)
      {
	std::cerr << "test_map - Teste Path::Map.\n"
	    " <minx> <miny> <maxx> <maxy>  place un obstacle."
	    << std::endl;
	return 1;
      }
    try
      {
	Path::Map m (0, 0, 300, 300);
	int i = 1;
	while (i < argc - 3)
	  {
	    m.putObstacle (atoi (argv[i]),
			   atoi (argv[i + 1]),
			   atoi (argv[i + 2]),
			   atoi (argv[i + 3]));
	    i += 4;
	  }
	std::cout << m << std::endl;
	return 0;
      }
    catch (const std::exception &e)
      {
	std::cerr << e.what () << std::endl;
	return 1;
      }
}