MCPcopy Create free account
hub / github.com/DescentDevelopers/Descent3 / RemapEdgeNodesEqualAndAbove

Function RemapEdgeNodesEqualAndAbove

editor/ebnode.cpp:510–528  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

508}
509
510void RemapEdgeNodesEqualAndAbove(int croom, int sroom, int spnt) {
511 int i;
512 int j;
513
514 bn_list *cnlist;
515 cnlist = BNode_GetBNListPtr(croom);
516 if (!cnlist)
517 return;
518
519 for (i = 0; i < cnlist->num_nodes; i++) {
520 for (j = 0; j < cnlist->nodes[i].num_edges; j++) {
521 if (cnlist->nodes[i].edges[j].end_room == sroom && cnlist->nodes[i].edges[j].end_index >= spnt) {
522 // The assert is because all these edges should have been deleted!
523 ASSERT(cnlist->nodes[i].edges[j].end_index != spnt);
524 cnlist->nodes[i].edges[j].end_index--;
525 }
526 }
527 }
528}
529
530void RemapPortalNodeIndices(int roomnum, int pnt) {
531 int i;

Callers 1

EBNode_RemoveNodeFunction · 0.85

Calls 1

BNode_GetBNListPtrFunction · 0.85

Tested by

no test coverage detected