cats.cpp 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362
  1. /**
  2. \file cats.cpp
  3. \brief Category management
  4. This program is free software under the GNU General Public
  5. License (>=v2). Read the file COPYING that comes with GRASS
  6. for details.
  7. (C) 2008 by The GRASS development team
  8. \author Martin Landa <landa.martin gmail.com>
  9. \date 2008
  10. */
  11. #include "driver.h"
  12. #include "digit.h"
  13. /**
  14. \brief Initialize cats structure.
  15. \return 0 on success
  16. \return -1 on error
  17. */
  18. int Digit::InitCats()
  19. {
  20. int ndblinks, nfields, field, ncats;
  21. int cat, type, id;
  22. struct field_info *fi;
  23. if (!cats.empty()) {
  24. cats.clear();
  25. }
  26. if (!display->mapInfo) {
  27. /* DisplayMsg(); */
  28. return -1;
  29. }
  30. /* initialization */
  31. ndblinks = Vect_get_num_dblinks(display->mapInfo);
  32. for (int i = 0; i < ndblinks; i++) {
  33. fi = Vect_get_dblink(display->mapInfo, i);
  34. if (fi) {
  35. cats[fi->number] = PORT_INT_MIN;
  36. }
  37. }
  38. /* find max category */
  39. nfields = Vect_cidx_get_num_fields (display->mapInfo);
  40. G_debug(2, "wxDigit.InitCats(): nfields=%d", nfields);
  41. for (int i = 0; i < nfields; i++ ) {
  42. field = Vect_cidx_get_field_number(display->mapInfo, i);
  43. ncats = Vect_cidx_get_num_cats_by_index(display->mapInfo, i);
  44. if (field <= 0) {
  45. continue;
  46. }
  47. for (int j = 0; j < ncats; j++) {
  48. Vect_cidx_get_cat_by_index (display->mapInfo, i, j, &cat, &type, &id);
  49. if (cat > cats[field])
  50. cats[field] = cat;
  51. }
  52. G_debug(3, "wxDigit.InitCats(): layer=%d, cat=%d", field, cats[field]);
  53. }
  54. /* set default values */
  55. for(std::map<int, int>::const_iterator b = cats.begin(), e = cats.end();
  56. b != e; ++b ) {
  57. if (b->second == PORT_INT_MIN) {
  58. cats[b->first] = 0;
  59. G_debug(3, "wxDigit.InitCats(): layer=%d, cat=%d", b->first, cats[b->first]);
  60. }
  61. }
  62. return 0;
  63. }
  64. /**
  65. \brief Get max category number for layer
  66. \param layer layer number
  67. \return category number (1 if no category found)
  68. \return -1 on error
  69. */
  70. int Digit::GetCategory(int layer)
  71. {
  72. if (cats.find(layer) != cats.end()) {
  73. G_debug(3, "v.digit.GetCategory(): layer=%d, cat=%d", layer, cats[layer]);
  74. return cats[layer];
  75. }
  76. return -1;
  77. }
  78. /**
  79. \brief Set max category number for layer
  80. \param layer layer number
  81. \param cats category number to be set
  82. \return previosly set category
  83. \return -1 if layer not available
  84. */
  85. int Digit::SetCategory(int layer, int cat)
  86. {
  87. int old_cat;
  88. if (cats.find(layer) != cats.end()) {
  89. old_cat = cats[layer];
  90. }
  91. else {
  92. old_cat = -1;
  93. }
  94. cats[layer] = cat;
  95. G_debug(3, "wxDigit.SetCategory(): layer=%d, cat=%d old_cat=%d",
  96. layer, cat, old_cat);
  97. return old_cat;
  98. }
  99. /**
  100. Get list of layers
  101. Requires InitCats() to be called.
  102. \return list of layers
  103. */
  104. std::vector<int> Digit::GetLayers()
  105. {
  106. std::vector<int> layers;
  107. for(std::map<int, int>::const_iterator b = cats.begin(), e = cats.end();
  108. b != e; ++b ) {
  109. layers.push_back(b->first);
  110. }
  111. return layers;
  112. }
  113. /**
  114. \brief Get list of layer/category(ies) for selected feature.
  115. \param line feature id (-1 for first selected feature)
  116. \return list of layer/cats
  117. */
  118. std::map<int, std::vector<int> > Digit::GetLineCats(int line_id)
  119. {
  120. std::map<int, std::vector<int> > lc;
  121. int line, n_dblinks;
  122. struct line_cats *Cats;
  123. struct field_info *fi;
  124. if (!display->mapInfo) {
  125. DisplayMsg();
  126. return lc;
  127. }
  128. if (line_id == -1 && display->selected.values->n_values < 1) {
  129. /* GetLineCatsMsg(line_id); */
  130. return lc;
  131. }
  132. line = line_id;
  133. if (line_id == -1) {
  134. line = display->selected.values->value[0];
  135. }
  136. if (!Vect_line_alive(display->mapInfo, line)) {
  137. DeadLineMsg(line);
  138. return lc;
  139. }
  140. Cats = Vect_new_cats_struct();
  141. if (Vect_read_line(display->mapInfo, NULL, Cats, line) < 0) {
  142. Vect_destroy_cats_struct(Cats);
  143. ReadLineMsg(line);
  144. return lc;
  145. }
  146. n_dblinks = Vect_get_num_dblinks(display->mapInfo);
  147. for (int dblink = 0; dblink < n_dblinks; dblink++) {
  148. fi = Vect_get_dblink(display->mapInfo, dblink);
  149. if (fi == NULL) {
  150. DblinkMsg(dblink+1);
  151. continue;
  152. }
  153. std::vector<int> cats;
  154. lc[fi->number] = cats;
  155. }
  156. for (int i = 0; i < Cats->n_cats; i++) {
  157. lc[Cats->field[i]].push_back(Cats->cat[i]);
  158. }
  159. Vect_destroy_cats_struct(Cats);
  160. return lc;
  161. }
  162. /**
  163. \brief Set categories for given feature/layer
  164. \param line feature id (-1 for first selected feature)
  165. \param layer layer number
  166. \param cats list of cats
  167. \param add True for add, False for delete
  168. \return new feature id (feature need to be rewritten)
  169. \return -1 on error
  170. */
  171. int Digit::SetLineCats(int line_id, int layer, std::vector<int> cats, bool add)
  172. {
  173. int line, ret, type;
  174. struct line_pnts *Points;
  175. struct line_cats *Cats;
  176. if (!display->mapInfo) {
  177. DisplayMsg();
  178. return -1;
  179. }
  180. if (line_id == -1 && display->selected.values->n_values < 1) {
  181. GetLineCatsMsg(line_id);
  182. return -1;
  183. }
  184. line = -1;
  185. if (line_id == -1) {
  186. line = display->selected.values->value[0];
  187. }
  188. if (!Vect_line_alive(display->mapInfo, line)) {
  189. DeadLineMsg(line);
  190. return -1;
  191. }
  192. Points = Vect_new_line_struct();
  193. Cats = Vect_new_cats_struct();
  194. type = Vect_read_line(display->mapInfo, Points, Cats, line);
  195. if (type < 0) {
  196. Vect_destroy_line_struct(Points);
  197. Vect_destroy_cats_struct(Cats);
  198. ReadLineMsg(line);
  199. return -1;
  200. }
  201. for (std::vector<int>::const_iterator c = cats.begin(), e = cats.end();
  202. c != e; ++c) {
  203. if (add) {
  204. Vect_cat_set(Cats, layer, *c);
  205. }
  206. else {
  207. Vect_field_cat_del(Cats, layer, *c);
  208. }
  209. G_debug(3, "Digit.SetLineCats(): layer=%d, cat=%d, add=%d",
  210. layer, *c, add);
  211. }
  212. /* register changeset */
  213. AddActionToChangeset(changesets.size(), REWRITE, display->selected.values->value[0]);
  214. ret = Vect_rewrite_line(display->mapInfo, line, type,
  215. Points, Cats);
  216. if (ret > 0) {
  217. /* updates feature id (id is changed since line has been rewriten) */
  218. changesets[changesets.size()-1][0].line = ret;
  219. }
  220. else {
  221. changesets.erase(changesets.size()-1);
  222. }
  223. if (line_id == -1) {
  224. /* update line id since the line was rewritten */
  225. display->selected.values->value[0] = ret;
  226. }
  227. Vect_destroy_line_struct(Points);
  228. Vect_destroy_cats_struct(Cats);
  229. return ret;
  230. }
  231. /**
  232. \brief Copy categories from one vector feature to other
  233. \param fromId list of 'from' feature ids
  234. \param toId list of 'to' feature ids
  235. \return number of modified features
  236. \return -1 on error
  237. */
  238. int Digit::CopyCats(std::vector<int> fromId, std::vector<int> toId)
  239. {
  240. int fline, tline, nlines, type;
  241. bool error;
  242. struct line_pnts *Points;
  243. struct line_cats *Cats_from, *Cats_to;
  244. Points = Vect_new_line_struct();
  245. Cats_from = Vect_new_cats_struct();
  246. Cats_to = Vect_new_cats_struct();
  247. nlines = 0;
  248. error = false;
  249. for (std::vector<int>::const_iterator fi = fromId.begin(), fe = fromId.end();
  250. fi != fe && !error; ++fi) {
  251. fline = *fi;
  252. if (!Vect_line_alive(display->mapInfo, fline))
  253. continue;
  254. type = Vect_read_line(display->mapInfo, NULL, Cats_from, fline);
  255. if (type < 0) {
  256. nlines = -1;
  257. error = true;
  258. }
  259. for(std::vector<int>::const_iterator ti = toId.begin(), te = toId.end();
  260. ti != te && !error; ++ti) {
  261. tline = *ti;
  262. if (!Vect_line_alive(display->mapInfo, tline))
  263. continue;
  264. type = Vect_read_line(display->mapInfo, Points, Cats_to, tline);
  265. if (type < 0) {
  266. nlines = -1;
  267. error = true;
  268. }
  269. for (int i = 0; Cats_from->n_cats; i++) {
  270. if (Vect_cat_set(Cats_to, Cats_from->field[i], Cats_from->field[i]) < 1) {
  271. nlines = -1;
  272. error = true;
  273. }
  274. }
  275. if (Vect_rewrite_line(display->mapInfo, tline, type, Points, Cats_to) < 0) {
  276. nlines = -1;
  277. error = true;
  278. }
  279. nlines++;
  280. }
  281. }
  282. Vect_destroy_line_struct(Points);
  283. Vect_destroy_cats_struct(Cats_from);
  284. Vect_destroy_cats_struct(Cats_to);
  285. return nlines;
  286. }