blob: 06d751b58730c57566c7e1b1130ec024f9d913e6 (
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
/***************************************************************************
csegment.h - K Desktop Planetarium
-------------------
begin : Sun Feb 1 2004
copyright : (C) 2004 by Jason Harris
email : kstars@30doradus.org
***************************************************************************/
/***************************************************************************
* *
* 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. *
* *
***************************************************************************/
#ifndef CSEGMENT_H
#define CSEGMENT_H
#include <tqstring.h>
#include <tqptrlist.h>
/**@class CSegment
*A segment of a constellation boundary. The segment consists
*of two or more SkyPoint "nodes" which are vertices of the
*boundary polygon. A single segment is define as the set of nodes
*that separates a single pair of constellations. An entire
*constellation boundary must consist of many segments, because
*each constellation is surrounded by multiple neighbors.
*
*For example, imagine constellation A is surrounded by constellations
*B, C, and D. One CSegment (AB) will describe the boundary between
*A and B; another (AC) will describe the boundary between A and C;
*and a third (AD) will describe the boundary between A and D.
*/
class SkyPoint;
class CSegment {
public:
/**Constructor*/
CSegment();
/**Destructor (empty)*/
~CSegment() {}
/**Add a SkyPoint node to the boundary segment.
*@p ra the RA of the node
*@p dec the Dec of the node
*/
void addPoint( double ra, double dec );
/**@return the name of one of the constellations
*that borders this boundary segment.
*/
TQString name1() const { return Name1; }
/**@return the name of one of the constellations
*that borders this boundary segment.
*/
TQString name2() const { return Name2; }
/**Set the names of the bounding constellations. Use the IAU
*three-letter abbreviations.
*@p n1 IAU name of one bounding constellation
*@p n2 IAU name of the other bounding constellation
*/
bool setNames( TQString n1, TQString n2 );
/**Determine if a given constellation borders this boundary segment
*@p cname the IAU code of the constellation to be tested.
*/
bool borders( TQString cname );
/**@return pointer to the first node in the segment
*/
SkyPoint* firstNode() { return Nodes.first(); }
/**@return pointer to the next node in the segment.
*If we were on the last node, return the NULL pointer.
*/
SkyPoint* nextNode() { return Nodes.next(); }
/**@return pointer to the list of nodes*/
TQPtrList<SkyPoint>* nodes() { return &Nodes; }
private:
TQPtrList<SkyPoint> Nodes;
TQString Name1, Name2;
};
#endif
|
