C / C++ / MFC

#include <string>
#include <sstream>

int main()
{
	std::string full_name( "Ashley Christopher Munday" );
	std::istringstream in_str( full_name );

	std::string first_name, second_name, surname;
	in_str >> first_name >> second_name >> surname;

	std::cout << first_name[ 0 ] << ". " << second_name[ 0 ] << ". " << surname << std::endl;
}

class A
{
public:
    A(){} // Constructor
    void One() {} // Method
};

int main()
{
    void (A::*pfn)() = &A::One; // Pointer to member function (Valid)
    void (A::*pfn)() = &A::A; // Pointer to Constructor (Invalid)

    return 0;
}

pMyButton->GetWindowText(cstring);
if (cstring == _T("Continue"))
    pMyButton->SetWindowText("Pause");
else
    pMyButton->SetWindowText("Continue");

«_Superman_» wrote:

if (cstring == _T("Continue"))

CString cstring;
.
.
if (cstring == _T("Continue"))

• Efficiency.
• Maintainability: it will not break if the text on the button is changed and the code not updated.
• i18n.

mrby123 wrote:

Hi I am looking for subroutines to solve linear algebraic equations - fewer unknowns than equations

Walt Fair, Jr. wrote:

The problem is how to ensure that some of the equations are not redundant.

Walt Fair, Jr. wrote:

Actually, if there are fewer unknowns than equations

x + y  = 2
x - y  = 0
x + 3y = 4

CPallini wrote:

Simply put, you cannot solve:

x + y = 2
x - y = 0
x + 3y = 4

[(x + y - 2)^2 + (x - y)^2 + (x + 3*y - 4)^2] w.r.t. x and y

Find the set of x<small>i</small> that minimizes S = Sum{[f<small>j</small>(x<small>i</small>) - C<small>j</small>]^2}.