Difference between revisions of "Source:NetHack 3.6.0/include/qt clust.h"
Jump to navigation
Jump to search
(Created page with "__MIXEDSYNTAXHIGHLIGHT__ Below is the full text to '''qt_clust.h''' from the source code of NetHack 3.6.0. To link to a particular line, writ...") |
|||
Line 3: | Line 3: | ||
{{NGPL}} | {{NGPL}} | ||
− | <span id="line1">1. | + | <span id="line1">1. /* NetHack 3.6 qt_clust.h $NHDT-Date: 1432512779 2015/05/25 00:12:59 $ $NHDT-Branch: master $:$NHDT-Revision: 1.8 $ */</span> |
− | <span id="line2">2. | + | <span id="line2">2. /* Copyright (c) Warwick Allison, 1999. */</span> |
− | <span id="line3">3. | + | <span id="line3">3. /* NetHack may be freely redistributed. See license for details. */</span> |
− | <span id="line4">4. | + | <span id="line4">4. </span> |
− | <span id="line5">5. | + | <span id="line5">5. #ifndef clusterizer_H</span> |
− | <span id="line6">6. | + | <span id="line6">6. #define clusterizer_H</span> |
− | <span id="line7">7. | + | <span id="line7">7. </span> |
− | <span id="line8">8. | + | <span id="line8">8. #include <qrect.h></span> |
− | <span id="line9">9. | + | <span id="line9">9. </span> |
− | <span id="line10">10. | + | <span id="line10">10. class Clusterizer</span> |
− | <span id="line11">11. | + | <span id="line11">11. {</span> |
− | <span id="line12">12. | + | <span id="line12">12. public:</span> |
− | <span id="line13">13. | + | <span id="line13">13. Clusterizer(int maxclusters);</span> |
− | <span id="line14">14. | + | <span id="line14">14. ~Clusterizer();</span> |
− | <span id="line15">15. | + | <span id="line15">15. </span> |
− | <span id="line16">16. | + | <span id="line16">16. void add(int x, int y); // 1x1 rectangle (point)</span> |
− | <span id="line17">17. | + | <span id="line17">17. void add(int x, int y, int w, int h);</span> |
− | <span id="line18">18. | + | <span id="line18">18. void add(const QRect &rect);</span> |
− | <span id="line19">19. | + | <span id="line19">19. </span> |
− | <span id="line20">20. | + | <span id="line20">20. void clear();</span> |
− | <span id="line21">21. | + | <span id="line21">21. int</span> |
− | <span id="line22">22. | + | <span id="line22">22. clusters()</span> |
− | <span id="line23">23. | + | <span id="line23">23. {</span> |
− | <span id="line24">24. | + | <span id="line24">24. return count;</span> |
− | <span id="line25">25. | + | <span id="line25">25. }</span> |
− | <span id="line26">26. | + | <span id="line26">26. const QRect &operator[](int i);</span> |
− | <span id="line27">27. | + | <span id="line27">27. </span> |
− | <span id="line28">28. | + | <span id="line28">28. private:</span> |
− | <span id="line29">29. | + | <span id="line29">29. QRect *cluster;</span> |
− | <span id="line30">30. | + | <span id="line30">30. int count;</span> |
− | <span id="line31">31. | + | <span id="line31">31. const int max;</span> |
− | <span id="line32">32. | + | <span id="line32">32. };</span> |
− | <span id="line33">33. | + | <span id="line33">33. </span> |
− | <span id="line34">34. | + | <span id="line34">34. #endif</span> |
[[Category:NetHack 3.6.0 source code|include/qt_clust.h]] | [[Category:NetHack 3.6.0 source code|include/qt_clust.h]] |
Latest revision as of 13:37, 15 December 2015
Below is the full text to qt_clust.h from the source code of NetHack 3.6.0. To link to a particular line, write [[Source:NetHack 3.6.0/include/qt_clust.h#line123]], for example.
The NetHack General Public License applies to screenshots, source code and other content from NetHack.
This content was modified from the original NetHack source code distribution (by splitting up NetHack content between wiki pages, and possibly further editing). See the page history for a list of who changed it, and on what dates.
/* NetHack 3.6 qt_clust.h $NHDT-Date: 1432512779 2015/05/25 00:12:59 $ $NHDT-Branch: master $:$NHDT-Revision: 1.8 $ */
/* Copyright (c) Warwick Allison, 1999. */
/* NetHack may be freely redistributed. See license for details. */
#ifndef clusterizer_H
#define clusterizer_H
#include <qrect.h>
class Clusterizer
{
public:
Clusterizer(int maxclusters);
~Clusterizer();
void add(int x, int y); // 1x1 rectangle (point)
void add(int x, int y, int w, int h);
void add(const QRect &rect);
void clear();
int
clusters()
{
return count;
}
const QRect &operator[](int i);
private:
QRect *cluster;
int count;
const int max;
};
#endif