C / C++ / MFC

A::A()
{
    i = 0;
...

switch (iValue)
{
case Bob: // Here is a label

   goto finished;
   ....
finished: // also a label
   return bIUseGotos;
}

bSuccess = (pFunction != NULL) ? pFunction->DoSomething () : false; // Here is something else - I think part of a ternary

class A
{
public:
   A (int i);
};

class B : public A
{
public:
   A ();
}

B::B ()
{
}

B::B ()
: A (7) // we're calling the A's constructor with a parameter of 7
{
}

A( x, ... )

HDC hDC = GetDC(NULL);
int nBitsPerPixel = GetDeviceCaps(hDC , BITSPIXEL);
ReleaseDC(NULL, hDC );

cmacgowan wrote:

4. Followed by Sphere decending (-0.5, 0.0, 1.0 ...)

#include <stdio.h>
#include <string>
#include <vector>
#include <map>

//save putting std:: infront of everything
using std::string;
using std::map;
using std::vector;

//This struct stores the data that is required for sorting
class ProductTypeKey {
	public:
		ProductTypeKey() { }
		ProductTypeKey(unsigned _nPackageSize, float _nBaseCurve, float _nSphere)
			: nPackageSize(_nPackageSize), nBaseCurve(_nBaseCurve), nSphere(_nSphere) { }

	public:
		unsigned nPackageSize;
		float nBaseCurve;
		float nSphere;
};

//"The data is contained in a struct with other data.". This struct stores "[the] other data"
typedef struct {
	//the other data you spoke of
} ProductTypeData;

struct MyItemCompare {
	bool operator()(const ProductTypeKey &mkLeft, const ProductTypeKey &mkRight) const {
		//Compare the package sizes, if they are not equal, then we are sorting by this key
		if (mkLeft.nPackageSize != mkRight.nPackageSize) {
			//greater than for decending order
			return mkLeft.nPackageSize > mkRight.nPackageSize;
		}
		//Compare the base curves, if they are not equal, then we are sorting by this key
		if (mkLeft.nBaseCurve != mkRight.nBaseCurve) {
			//greater than for decending order
			return mkLeft.nBaseCurve > mkRight.nBaseCurve;
		}
		//Compare the sphere, if they are not equal, then we are sorting by this key
		if (mkLeft.nSphere != mkRight.nSphere) {
			//less than for ascending order
			return mkLeft.nSphere < mkRight.nSphere;
		}
		//We will only make it here if the 2 products are identical from the data we are sorting on.
		return false;
	}
};

//This struct contains the information that is stored in static order
class Product {
	public:
		typedef map<ProductTypeKey, ProductTypeData, MyItemCompare> TypesMap;

	public:
		Product() { }
		Product(const string &_strCompany, const string &_strProduct)
			: strCompany(_strCompany), strProduct(_strProduct) { }
		void AddType(const ProductTypeKey &key, const ProductTypeData &data){
			colTypes.insert(TypesMap::value_type(key, data));
		}

	public:
		string strCompany;
		string strProduct;
		TypesMap colTypes; //this stores the data for this product that in sorted order
};

int main(int argc, char *argv[]) {
	Product prodCibaFocus("Ciba", "Focus");
	//Adding types before insert
	prodCibaFocus.AddType(ProductTypeKey(10, 8.6f, +0.00f), ProductTypeData());
	prodCibaFocus.AddType(ProductTypeKey(20, 8.6f, -0.25f), ProductTypeData());
	prodCibaFocus.AddType(ProductTypeKey(20, 8.6f, -0.10f), ProductTypeData());
	prodCibaFocus.AddType(ProductTypeKey(20, 8.6f, +0.25f), ProductTypeData());
	Product prodCibaAir("Ciba", "Air");
	vector<Product> colProducts;
	colProducts.push_back(prodCibaFocus);
	colProducts.push_back(prodCibaAir);
	//Adding types after insert. prodCibaAir is the 2nd item in the list (index 1)
	colProducts[1].AddType(ProductTypeKey(10, 8.6f, -0.25f), ProductTypeData());
	colProducts[1].AddType(ProductTypeKey(10, 8.6f, -0.10f), ProductTypeData());
	colProducts[1].AddType(ProductTypeKey(20, 8.1f, -0.25f), ProductTypeData());
	colProducts[1].AddType(ProductTypeKey(20, 8.1f, -0.10f), ProductTypeData());
	colProducts[1].AddType(ProductTypeKey(20, 8.1f, +0.00f), ProductTypeData());
	colProducts[1].AddType(ProductTypeKey(20, 8.6f, +0.25f), ProductTypeData());
	colProducts[1].AddType(ProductTypeKey(20, 8.6f, +0.40f), ProductTypeData());
	//now print them
	for (vector<Product>::const_iterator iProduct = colProducts.begin(); iProduct != colProducts.end(); ++iProduct) {
		for (Product::TypesMap::const_iterator iType = iProduct->colTypes.begin(); iType != iProduct->colTypes.end(); ++iType) {
			printf("%s %s %u %.02f %.02f\n", iProduct->strCompany.c_str(), iProduct->strProduct.c_str(),
				iType->first.nPackageSize, iType->first.nBaseCurve, iType->first.nSphere);
		}
	}
	return 0;
}

//contact_lens_data.h

class contact_lens_data
{
    // All the funkiness that's fit to print about contact lenses

    friend bool operator< (const contact_lens_data &left, const contact_lens_data &right );
};

//contact_lens_data.cpp

bool operator< (const contact_lens_data &left, const contact_lens_data &right )
{
    // Put the comparison in here, if left should appear towards the front of the sort order return true
}

RedDragon2k wrote:

without installing any software on the target machine