Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7004949
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T21:15:54+00:00 2026-05-27T21:15:54+00:00

The second while loop is throwing an exception in xstring line 1441 on the

  • 0

The second while loop is throwing an exception in xstring line 1441 on the second iteration, which it should not do. This is because on the first pass:

Testthis->NAME[n] = 'B'
Testthis->NAME[n+1] = 'O'
Testthis->NAME = "BOD MQL"

are all verified from the debug cout statements. I am stumped on this one.

struct Node * ProbableMatch(struct Node * Look_in, int MaxNodes, char Findthis[64]){
system("cls");
int i=0,proba=100,CurrentHigh=100;
size_t pos1=1,n1=0,n2=0,pos2=1;
//char s[64];
struct Node * CurrentHighProb;
struct Node * Testthis;
CurrentHighProb=new(Node);
Testthis=new(Node);
Testthis=Look_in;
//for(i=0;i==MaxNodes;i++)
while(!Testthis || i!=ccounter)
{
    gotoxy(0,0);
    int n=0;
    n1=sizeof(Look_in->NAME);
    n2=sizeof(Findthis);
    string str1;
    char str2[64];
    cout<<Testthis->NAME[n]<<endl<<Testthis->NAME<<endl;
    cout<<Testthis->NAME[n+1]<<endl;

    while(Testthis->NAME[n]!='\0'){  //mannually coverts the strings since I am having hell with the inbuilt functions
        cout<<Testthis->NAME[n];
        str1[n]=Testthis->NAME[n];
        if(Testthis->NAME[n+1]=='\0'){str1[n+1]='\0';}//makes NULL terminated strings
        n++;
    }//end of while

    //strcpy_s(cstr, str1.length());
    //strcpy_s(str1,sizeof(Look_in->NAME),Look_in->NAME);
    //strcpy_s(str2,sizeof(Findthis),Findthis);
    //char * cstr1 = new char[str1.length()+1];
    cout<<str1.compare(pos1,n1,Findthis,0,n2)<<" is the value of the string compare "<<endl;
    proba=str1.compare(pos1,n1,Findthis,0,n2);//compares Findthis to the varibles read from the database from string matches

    //DEBUG STUFF
    cout<<endl<<sizeof(Look_in->NAME)<<" sizeof(Look_in->NAME)"<<Look_in->NAME<<endl;
    cout<<sizeof(Findthis)<<" sizeof(Findthis)"<<Findthis<<endl;
    cout<<sizeof(str1)<<" "<<str1<<" string1   string2 "<<str2<<" "<<sizeof(str2)<<endl;
    //cout<<sizeof(str1)<<" reinterpret_cast< char *>(str1)"<<endl;
    system("PAUSE");
    cout<<"\n Probability of "<<Look_in->NAME<<" matching "<<Findthis<<" is "<<proba<<" ."<<endl;
    //ENDOFDEBUG FOR FUNCTION
    Testthis->prob=proba;
    if(proba==0)
    {
        cout<<"proba equals zero, match found returning "<<Look_in<<endl;
        //delete[] cstr1;
        return Testthis;  // returns the pointer of the varible that best matched the search
    }
    if(proba<CurrentHigh){
        CurrentHigh=proba;
        CurrentHighProb=Testthis;
    }
    i++;
    Testthis=Testthis->next;
}
cout<<"Perfect match not found after "<<i<<" number of searches, returning this highest probable match "<<CurrentHighProb<<" "<<proba<<endl;

system("PAUSE");
//delete[] cstr1;
return CurrentHighProb;
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T21:15:55+00:00Added an answer on May 27, 2026 at 9:15 pm
    string str1;
    

    declares a zero-length std::string.

    str1[n]=Testthis->NAME[n];
    

    references the (non-existent) n’th element of str1.

    Perhaps you mean to create a string with a definite length:

    string str1(n1, ' ');
    

    Or, perhaps you mean to allocate the string data during the copy:

    str1.push_back(Testthis->NAME[n]);
    

    There are other errors in your code, but this one likely produced the exception you describe.

    You can avoid all of these errors simply. Replace the inner while loop with this:

    str1 = Testthis->NAME;
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

This program is supposed to run through a while loop twice. The first time
I need to set/get the cookies stored at first.example while browsing second.example , I
I have a while loop from a query called $result . Inside this while
I'm getting an error on the second while loop invalid pointer operation i thinking
In the below written code, i want the second while loop to read from
I thought I correctly implemented a while loop, but why am I not getting
How do I delay a while loop to 1 second intervals without slowing down
Newbie python here. How can I break out of the second while loop if
In my program I have a while loop which iterates through an array list
I need to dispay three divs alternatively inside a while loop . The first

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.