------------------------------------------------------------------------------
| 2238 | |
| 2239 | //------------------------------------------------------------------------------ |
| 2240 | vtkIdType vtkReebGraph::Implementation::AddMeshVertex(vtkIdType vertexId, double scalar) |
| 2241 | { |
| 2242 | static bool firstVertex = true; |
| 2243 | |
| 2244 | ScalarField[vertexId] = scalar; |
| 2245 | |
| 2246 | vtkIdType N0; |
| 2247 | ResizeMainNodeTable(1); |
| 2248 | |
| 2249 | // create a new node in the graph... |
| 2250 | N0 = this->MainNodeTable.FreeZone; |
| 2251 | this->MainNodeTable.FreeZone = this->GetNode(N0)->ArcDownId; |
| 2252 | ++(this->MainNodeTable.Number); |
| 2253 | memset(this->GetNode(N0), 0, sizeof(vtkReebNode)); |
| 2254 | |
| 2255 | vtkReebNode* node = this->GetNode(N0); |
| 2256 | node->VertexId = vertexId; |
| 2257 | node->Value = scalar; |
| 2258 | node->ArcDownId = 0; |
| 2259 | node->ArcUpId = 0; |
| 2260 | node->IsFinalized = false; |
| 2261 | |
| 2262 | if (firstVertex) |
| 2263 | { |
| 2264 | this->MinimumScalarValue = node->Value; |
| 2265 | this->MaximumScalarValue = node->Value; |
| 2266 | } |
| 2267 | else |
| 2268 | { |
| 2269 | this->MaximumScalarValue = std::max(node->Value, this->MaximumScalarValue); |
| 2270 | this->MinimumScalarValue = std::min(node->Value, this->MinimumScalarValue); |
| 2271 | } |
| 2272 | firstVertex = false; |
| 2273 | |
| 2274 | return N0; |
| 2275 | } |
| 2276 | |
| 2277 | //------------------------------------------------------------------------------ |
| 2278 | vtkIdType vtkReebGraph::Implementation::FindDwLabel(vtkIdType nodeId, vtkReebLabelTag label) |
no test coverage detected