Databases
StackOverflow2013
Postsdbo
PORemoving a node From Doubly Threaded LnkLst
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PORemoving a node From Doubly Threaded LnkLst
    primarykey
    data
    text
    <p>Im trying to remove a single node from a doubly threaded linked list.</p> <p>What I have works..Its just terribly inefficient. </p> <p>I was wondering if I can get some expert advice or some while termination condition tips.</p> <p>Here is the function in which I remove 1 node from a set of Rating Nodes, stored in headByRating and a set of Name nodes, stored in headByName. All of which are sorted....</p> <pre> bool list::remove (const char * const name) { node *currByName = headByName; node *currByRating = headByRating; node *prev_node = NULL; while ( NULL != currByName && ( strcmp( name, currByName->item.getName() ) != 0 ) ) { prev_node = currByName; currByName = currByName->nextByName; prev_node->nextByName = currByName; } if ( currByName == headByName ) { currByName = currByName->nextByName; headByName = currByName; } else if ( currByName->nextByName == NULL ) {//then we must be at the end currByName = prev_node; currByName->nextByName = NULL; //return true; } else { currByName = prev_node; currByName->nextByName = currByName->nextByName->nextByName; //return true; } while ( NULL != currByRating && ( strcmp( name, currByRating->item.getName() ) != 0 ) ) { prev_node = currByRating; currByRating = currByRating->nextByRating; prev_node->nextByRating = currByRating; } if ( currByRating == headByRating ) // was it the head? { currByRating = currByRating->nextByRating; headByRating = currByRating; return true; } else if ( currByRating->nextByRating == NULL ) // could it be the tail? { currByRating = prev_node; currByRating->nextByRating = NULL; return true; } else { currByRating = prev_node; currByRating->nextByRating = currByRating->nextByRating->nextByRating; return true; } return false; }</pre> <p>Yeah i just need help simplifing the code, making it more efficient. I hoping to combine and use only one while loop if thats possible. </p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USuser40120
    1. USuser40120
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload