o3dgcAdjacencyInfo.h 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155
  1. /*
  2. Copyright (c) 2013 Khaled Mammou - Advanced Micro Devices, Inc.
  3. Permission is hereby granted, free of charge, to any person obtaining a copy
  4. of this software and associated documentation files (the "Software"), to deal
  5. in the Software without restriction, including without limitation the rights
  6. to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  7. copies of the Software, and to permit persons to whom the Software is
  8. furnished to do so, subject to the following conditions:
  9. The above copyright notice and this permission notice shall be included in
  10. all copies or substantial portions of the Software.
  11. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  12. IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  13. FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  14. AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  15. LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  16. OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  17. THE SOFTWARE.
  18. */
  19. #pragma once
  20. #ifndef O3DGC_ADJACENCY_INFO_H
  21. #define O3DGC_ADJACENCY_INFO_H
  22. #include "o3dgcCommon.h"
  23. namespace o3dgc
  24. {
  25. const long O3DGC_MIN_NEIGHBORS_SIZE = 128;
  26. const long O3DGC_MIN_NUM_NEIGHBORS_SIZE = 16;
  27. //!
  28. class AdjacencyInfo
  29. {
  30. public:
  31. //! Constructor.
  32. AdjacencyInfo(long numNeighborsSize = O3DGC_MIN_NUM_NEIGHBORS_SIZE,
  33. long neighborsSize = O3DGC_MIN_NUM_NEIGHBORS_SIZE)
  34. {
  35. m_numElements = 0;
  36. m_neighborsSize = neighborsSize;
  37. m_numNeighborsSize = numNeighborsSize;
  38. m_numNeighbors = new long [m_numNeighborsSize];
  39. m_neighbors = new long [m_neighborsSize ];
  40. };
  41. //! Destructor.
  42. ~AdjacencyInfo(void)
  43. {
  44. delete [] m_neighbors;
  45. delete [] m_numNeighbors;
  46. };
  47. O3DGCErrorCode Allocate(long numNeighborsSize, long neighborsSize)
  48. {
  49. m_numElements = numNeighborsSize;
  50. if (neighborsSize > m_neighborsSize)
  51. {
  52. delete [] m_numNeighbors;
  53. m_neighborsSize = neighborsSize;
  54. m_numNeighbors = new long [m_numNeighborsSize];
  55. }
  56. if (numNeighborsSize > m_numNeighborsSize)
  57. {
  58. delete [] m_neighbors;
  59. m_numNeighborsSize = numNeighborsSize;
  60. m_neighbors = new long [m_neighborsSize];
  61. }
  62. return O3DGC_OK;
  63. }
  64. O3DGCErrorCode AllocateNumNeighborsArray(long numElements)
  65. {
  66. if (numElements > m_numNeighborsSize)
  67. {
  68. delete [] m_numNeighbors;
  69. m_numNeighborsSize = numElements;
  70. m_numNeighbors = new long [m_numNeighborsSize];
  71. }
  72. m_numElements = numElements;
  73. return O3DGC_OK;
  74. }
  75. O3DGCErrorCode AllocateNeighborsArray()
  76. {
  77. for(long i = 1; i < m_numElements; ++i)
  78. {
  79. m_numNeighbors[i] += m_numNeighbors[i-1];
  80. }
  81. if (m_numNeighbors[m_numElements-1] > m_neighborsSize)
  82. {
  83. delete [] m_neighbors;
  84. m_neighborsSize = m_numNeighbors[m_numElements-1];
  85. m_neighbors = new long [m_neighborsSize];
  86. }
  87. return O3DGC_OK;
  88. }
  89. O3DGCErrorCode ClearNumNeighborsArray()
  90. {
  91. memset(m_numNeighbors, 0x00, sizeof(long) * m_numElements);
  92. return O3DGC_OK;
  93. }
  94. O3DGCErrorCode ClearNeighborsArray()
  95. {
  96. memset(m_neighbors, 0xFF, sizeof(long) * m_neighborsSize);
  97. return O3DGC_OK;
  98. }
  99. O3DGCErrorCode AddNeighbor(long element, long neighbor)
  100. {
  101. assert(m_numNeighbors[element] <= m_numNeighbors[m_numElements-1]);
  102. long p0 = Begin(element);
  103. long p1 = End(element);
  104. for(long p = p0; p < p1; p++)
  105. {
  106. if (m_neighbors[p] == -1)
  107. {
  108. m_neighbors[p] = neighbor;
  109. return O3DGC_OK;
  110. }
  111. }
  112. return O3DGC_ERROR_BUFFER_FULL;
  113. }
  114. long Begin(long element) const
  115. {
  116. assert(element < m_numElements);
  117. assert(element >= 0);
  118. return (element>0)?m_numNeighbors[element-1]:0;
  119. }
  120. long End(long element) const
  121. {
  122. assert(element < m_numElements);
  123. assert(element >= 0);
  124. return m_numNeighbors[element];
  125. }
  126. long GetNeighbor(long element) const
  127. {
  128. assert(element < m_neighborsSize);
  129. assert(element >= 0);
  130. return m_neighbors[element];
  131. }
  132. long GetNumNeighbors(long element) const
  133. {
  134. return End(element) - Begin(element);
  135. }
  136. long * const GetNumNeighborsBuffer() { return m_numNeighbors;}
  137. long * const GetNeighborsBuffer() { return m_neighbors;}
  138. private:
  139. long m_neighborsSize; // actual allocated size for m_neighbors
  140. long m_numNeighborsSize; // actual allocated size for m_numNeighbors
  141. long m_numElements; // number of elements
  142. long * m_neighbors; //
  143. long * m_numNeighbors; //
  144. };
  145. }
  146. #endif // O3DGC_ADJACENCY_INFO_H