vcglib/apps/nexus/border.h

95 lines
3.4 KiB
C
Raw Normal View History

2004-07-02 15:00:02 +02:00
/****************************************************************************
* VCGLib o o *
* Visual and Computer Graphics Library o o *
* _ O _ *
* Copyright(C) 2004 \/)\/ *
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | *
* \ *
* All rights reserved. *
* *
* 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 (http://www.gnu.org/licenses/gpl.txt) *
* for more details. *
* *
****************************************************************************/
/****************************************************************************
History
$Log: not supported by cvs2svn $
2005-01-21 18:09:13 +01:00
Revision 1.5 2004/10/08 14:46:26 ponchio
Working version.
2004-10-08 16:46:26 +02:00
Revision 1.4 2004/09/30 00:27:08 ponchio
Added used counter.
2004-09-30 02:27:08 +02:00
Revision 1.3 2004/07/05 17:02:17 ponchio
Couple of const missing.
2004-07-05 19:02:17 +02:00
Revision 1.2 2004/07/04 14:21:31 ponchio
Added operator< to Link
2004-07-04 16:21:31 +02:00
Revision 1.1 2004/07/02 13:00:02 ponchio
Created.
2004-07-02 15:00:02 +02:00
****************************************************************************/
#ifndef NXS_BORDER_H
#define NXS_BORDER_H
namespace nxs {
struct Link {
2004-07-04 16:21:31 +02:00
Link(): start_vert(0xffff), end_vert(0xffff), end_patch(0xffffffff) {}
Link(unsigned short sv, unsigned short ev, unsigned int ep):
start_vert(sv), end_vert(ev), end_patch(ep) {}
unsigned short start_vert;
unsigned short end_vert;
2004-07-02 15:00:02 +02:00
unsigned int end_patch;
2004-07-04 16:21:31 +02:00
bool IsNull() { return end_patch == 0xffffffff; }
2004-07-05 19:02:17 +02:00
bool operator==(const Link &l) const {
2004-07-04 16:21:31 +02:00
return end_patch == l.end_patch &&
end_vert == l.end_vert &&
start_vert == l.start_vert;
}
2004-07-05 19:02:17 +02:00
bool operator<(const Link &l) const {
2004-07-04 16:21:31 +02:00
if(end_patch == l.end_patch) {
if(start_vert == l.start_vert) {
return end_vert < l.end_vert;
} else
return start_vert < l.start_vert;
} else
return end_patch < l.end_patch;
}
2004-07-02 15:00:02 +02:00
};
class Border {
public:
2004-09-30 02:27:08 +02:00
Border(Link *l = NULL, unsigned short _used = 0, unsigned short _size = 0):
2005-01-21 18:09:13 +01:00
links(l), used(_used), size(_size), start(0) {}
2004-09-30 02:27:08 +02:00
unsigned int Size() { return used; }
2004-10-08 16:46:26 +02:00
//TODO rename available to capacity.
2004-09-30 02:27:08 +02:00
unsigned int Available() { return size; }
2005-01-21 18:09:13 +01:00
Link &operator[](unsigned int i) { return links[i]; }
Link *Start() { return links; }
2004-07-04 16:21:31 +02:00
2005-01-21 18:09:13 +01:00
//TODO implement an iterator!
Link *links;
unsigned int used;
unsigned int size;
unsigned int start;
2004-07-02 15:00:02 +02:00
};
}
#endif