summaryrefslogtreecommitdiff
path: root/2004/i/nono/src/path/map_segm.h
blob: 78b87e721d4b3a303a9ddecda7cbcc607105b208 (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
62
63
64
65
66
67
#ifndef map_segm_h
#define map_segm_h
// map_segm.h
// 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 <vector>
#include <iostream>

namespace Path {

/// Carte de path finding.
class MapSegm
{
    /// Limites des cases.
    int minx_, miny_, maxx_, maxy_;
    typedef std::vector<int> MapLimits;
    MapLimits mapLimitsX_, mapLimitsY_;
    /// Contenu des cases.
    typedef std::vector<int> MapRow;
    typedef std::vector<MapRow> MapCells;
    MapCells mapCells_;
  public:
    /// Constructeur.
    MapSegm (int minx, int miny, int maxx, int maxy);
    /// Place un obstacle (mm).
    void putObstacle (int minx, int miny, int maxx, int maxy);
    /// Sort sur std::ostream.
    friend std::ostream &operator<< (std::ostream &os, const Map &m);
  protected:
    /// Split la carte � une colonne donn�e.
    void splitCol (int col, int x);
    /// Split la carte � une ligne donn�e.
    void splitRow (int row, int y);
    /// Trouve la colonne correspondante � une abscisse (mm).
    int findCol (int x) const;
    /// Trouve la ligne correspondante � une ordonn�e (mm).
    int findRow (int y) const;
};

/// Sort sur std::ostream.
std::ostream &operator<< (std::ostream &os, const MapSegm &m);

} // namespace Path

#endif // map_segm_h