Kommentare

	// Temp Stuff
	int i,j,k;
	
	// Counters and CountPtr
	int cnt_ptr;
	int *cnt=malloc(sizeof(int)*list_len);
	
	// Calc Number of Combinations 
	int obj_count=n_over_k(pool_size+list_len-1,list_len);
	
	// Collect a list of Objects to sum 
	int **sum_obj=malloc(sizeof(int)*obj_count);
	for(i=0;i<obj_count;i++) sum_obj[i]=malloc(sizeof(int)*list_len);
	int sum_ptr=0;
	
	// pipe info 
	char *pipe_info=malloc(sizeof(char)*obj_count);
	char *pipe=malloc(sizeof(char)*list_len);
	int pipebreak;
	pipe[0]=24;		// Init Pipe to invalid

	// compute bitposition in prime_mat entry
	int32u bitpos;		
	bitpos=prime_mod_tab1[number&0xFF]+prime_mod_tab2[(number&0xFF00)>>8]+prime_mod_tab2[(number&0xFF0000)>>16]+prime_mod_tab2[number>>24];
	
	// bailout if excluded by hardwired primes (could be removed?)
	if(prime_bit_sel[bitpos]==10) return PRIMECHK_NO_PRIME;
		
	// compute bytepos
	int32u bytepos;		// the byte in prime_mat
	bytepos=number/30;
	
	// read data for that value out of prime_mat	
	int32u bitsel;		// specs the absolute bit in given byte
	int8u bitmask;		// specs the bitmask to easy access prime_mat
	int8u valdata;		// dataset in prime_mat

{*------------------------------------------------------------------------------
  Hochkomplexe mathematische Prozedur zur Erhöhung der Chargennummer um 1.
-------------------------------------------------------------------------------}
procedure TGiessofen.Charge_Erhoehen();
begin
  inc(Charge);
  Charge_Ausgeben();
end;

// inc chargenum

string a;

string *a=new string();

.h
class bestellung
{
privat:
int anzahl;
String Bestellung;
public:
void sendbestellung();
}
.cpp
void bestellung::sendbestellung()
 {
 // Entweder Zugriff auf anzahl mit anzahl=0; oder this->anzahl=0;
 }

.h
class bestellung
{
privat:
int m_anzahl;
String m_Bestellung;
public:
void sendbestellung();
}
.cpp
void bestellung::sendbestellung()
 {
 m_anzahl=0;
 }

/**
 * @ param parameter1
 * @ throws exptionxxx
**/