Code WTF — RSS

class PopulateTimesheetHelper { 400 private final String[] MONTH = {"JANUARY", "FEBRUARY", "MARCH", "APRIL", "MAY", "JUNE", "JULY", "AUGUST", "SEPTEMBER", "OCTOMBER", "NOVEMBER", "DECEMBER"}; 403 private int getMonth(String mnth) { 404 int count = 0, num = 0; 405 while (count < MONTH.length) { 406 if (MONTH[count].equals(mnth)) { 407 num = count; 408 } 409 count++; 410 } 411 return num; 412 } 413 }

Collection >> do: operation separatedBy: separator "Evaluate the argument, operation, for each of the receiver's elements, interspersed with evaluations of the argument, separator. The separator is first evaluated after the first element, and is not evaluated after the last element (i.e. it is not evaluated at all if there are less than two elements)." | sep | "Switch to the real separator after first eval." sep := [sep := separator]. self do: [:e | sep value. operation value: e]. sep := nil.

if ( o->SearchID() == ID_BUTTON || o->SearchID() == ID_TPV_DEFBUTTON || o->SearchID() == ID_TPV_NOTIFY_BUTTON || (((UIW_BUTTON *)o)->value >= PM_CONTROL_LOWER && ((UIW_BUTTON *)o)->value <= PM_CONTROL_UPPER) || (((UIW_BUTTON *)o)->value >= PM_NOTEBOOK_LOWER && ((UIW_BUTTON *)o)->value <= PM_NOTEBOOK_UPPER) ) ; else PM_ENTRY(o).setNonSelectable();

[Error: Irreparable invalid markup ('') in entry. Owner must fix manually. Raw contents below.]

I am new to programming in C++, about a week old. I've got past experience in scripting macros, basic shell scripting, etc. I'm trying to get a very simple method for prime number generation working, but it's dying at my second if statement.. and my brain hurts.

#include

typedef long unsigned int ulong;

long unsigned int mplier1 = 1, mplier2 = 1, pfactor = 1, pcheck, searchcount = 0, usercount = 0;

void primeloop();
ulong mathcheck(ulong x, ulong y);

int main()
{
cout << "How many Primes do you wish to find?: ";
// Define usercount.
cin >> usercount;
cout << "\n";

// Begin the Prime sweep.
primeloop();
return 0;
}

void primeloop()
{
// Has the user's criteria been met?
if ( usercount == searchcount )
{
cout << "\n\nYour Prime criteria of " << usercount << " has been met.\n";
cout << "Exiting...";
return;
}

// Generate product to check against primary factor.
// cout << mathcheck(mplier1,mplier2) << endl;
pcheck = mathcheck(mplier1,mplier2);

// If the neither multiplier is equal to the factor, increase multiplier 2.
if ( ( mplier1 != pcheck ) && ( mplier2 != pcheck ) )
{
// cout << "Check 1\n";
mplier2++;
primeloop();
}

// If multiplier 1 doesn't equal the factor but multiplier 2 does, increment multiplier 1 and reset multiplier 2.
else
if ( ( mplier1 != pcheck ) && ( mplier2 == pcheck ) )
{
// cout << "Check 2\n";
mplier2 = 0;
cout << mplier1++ << endl;
primeloop();
}

// If the factor has been matched by 2 lesser intergers, move to next factor.
if ( ( pfactor == pcheck ) && ( mplier1 != 1 ) && ( mplier2 != pfactor ) )
{
// cout << "Check 3\n";
mplier1 = 1;
mplier2 = 0;
pfactor++;
primeloop();
}

// If the factor cannot be matched by 2 lesser intergers, it is a prime.
if ( ( pfactor == pcheck ) && ( mplier1 == pcheck ) && ( mplier2 == pcheck ) )
{
// cout << "Found prime:\n";
cout << pfactor << endl;
mplier1 = 1;
mplier2 = 0;
pfactor++;
searchcount++;
primeloop();
}

}

ulong mathcheck(ulong x, ulong y)
{
return x * y;
}