Templates...???

[Bore Biko]

Dear,

I am an ordinary C programmer and I am most interesed
about dynamical data structuring and programming,
I don't like to use matricess and rows, I like to program
with practical programs that doesent use much memory.
I know a lot of C++ programmers ,and they tolded me,
that C++ templates are real solution for dynamical memory
use programming.I readed 3 books about C++ , but I don't
have a practice and a mass things about templates where
mystery for me I didn't undersrand nothing.
So I will be thankfull if somebody solve with templates
these two programs in end of this post...

1)A program which creates a linked list of prim numbers..

/*--------------------------------*/
#include<stdio. h>
#include<malloc .h>
struct lst{
long int value;
struct lst* next;
};

int main(int argc, char* argv[]){
long int i,j,k;
struct lst *prvi, *tekuci_prvi, *tekuci_drugi, *zadnji;
prvi=(struct lst*)malloc(siz eof(struct lst));
prvi->next=(struct lst*)malloc(siz eof(struct lst));
prvi->value=1;
prvi->next->value=2;
tekuci_prvi=prv i->next;
zadnji=prvi->next;
zadnji->next=(struct lst*)NULL;
k=atoi(argv[1]);
tekuci_drugi=pr vi;
for(i=1;i<k;i++ ){
exit:
tekuci_drugi=pr vi;
while(tekuci_dr ugi->next){
if((i%(tekuci_d rugi->value)==0) && tekuci_drugi->value!=1){
if(i==1){
goto exit;
}
i++;
goto exit;
}
tekuci_drugi=te kuci_drugi->next;
}
tekuci_prvi->next=(struct lst*)malloc(siz eof(struct lst));
tekuci_prvi=tek uci_prvi->next;
tekuci_prvi->value=i;
tekuci_prvi->next=(struct lst*)NULL;
/*printf("%ld\n" ,i);*/
}
tekuci_prvi=prv i;
while(tekuci_pr vi->next){
printf("%d\n", tekuci_prvi->value);
tekuci_prvi=tek uci_prvi->next;

}
exit(0);
}

2)A program which creates a file(if you redirect output with ">")
of random numbers use:"rand > file.txt", and "file.txt" is input for third
program...

#include<stdio. h>
#include<stdlib .h>

int main(int argc, char *argv[])
{ int i, j, k;
k=atoi(argv[1]);
srand(k);
for(i=0;i<k;i++ ){
printf("%d\n",r and());
}
exit(0);
}

3)A program which reads a list of random numbers generated with second
program a "file.txt" and make a sorted list of them...

#include<stdio. h>
#define BUFFER 128

struct lst{
int value;
struct lst *next;
};

int main(int argc , char *argv[]){
int i, j ,k;
FILE *fp;
char buffer[BUFFER];
struct lst *prvi, *tekuci_jedan, *tekuci_dva, *zadnji;
fp=(fopen(argv[1],"r"));
if(fp==(FILE*)N ULL){
printf("\nError can't open:%s",argv[1]);
}
prvi=(struct lst*)malloc(siz eof(struct lst));
tekuci_jedan=pr vi;
while(fgets(buf fer, BUFFER+1, fp)){
tekuci_jedan->next=(struct lst*)malloc(siz eof(struct lst));
tekuci_jedan->value=atoi(buf fer);
tekuci_jedan=te kuci_jedan->next;
}
tekuci_jedan->next=(struct lst*)NULL;
tekuci_jedan=pr vi;
while(tekuci_je dan->next){
tekuci_dva=prvi ;
while(tekuci_dv a->next){
if(tekuci_jedan->value < tekuci_dva->value){
/* i=tekuci_jedan->value; */
tekuci_jedan->value=tekuci_j edan->value+tekuci_d va->value;
tekuci_dva->value=tekuci_j edan->value-tekuci_dva->value;
tekuci_jedan->value=tekuci_j edan->value-tekuci_dva->value;
}
tekuci_dva=teku ci_dva->next;
}
tekuci_jedan=te kuci_jedan->next;
}
tekuci_jedan=pr vi;
while(tekuci_je dan->next){
printf("\n%d",t ekuci_jedan->value);
tekuci_jedan=te kuci_jedan->next;
}
exit(0);
}
All programs are commpilled with gcc without any waring...

Thank in advance, Robert...!!!

P.S. I don't know does a gcc support templates if not you can
send mee a version for VC++ 6.0

[Dave Rahardja]

On Sat, 10 Sep 2005 01:47:26 +0200, "Bore Biko" <bo*******@yaho o.co.uk> wrote:

Dear,

I am an ordinary C programmer and I am most interesed
about dynamical data structuring and programming,
I don't like to use matricess and rows, I like to program
with practical programs that doesent use much memory.
I know a lot of C++ programmers ,and they tolded me,
that C++ templates are real solution for dynamical memory
use programming.I readed 3 books about C++ , but I don't
have a practice and a mass things about templates where
mystery for me I didn't undersrand nothing.
So I will be thankfull if somebody solve with templates
these two programs in end of this post...

Templates in C++ is just a tool that you can use to solve certain kinds of
problems. The programs that you have included do not belong to that class of
problems and are therefore not likely to benefit from templates.

Templates allow you to program in a style called "generic programming", a
style that lets you use types as a compile-time parameter in your program.

For example, here's a function that adds two numbers:

template <class T>
T add(T a, T b)
{
return a + b;
}

And here's a program that calls it:

int main()
{
double a = add(0.0, 1.0);
int b = add(1, 2);
return 0;
}

The compiler will automatically generate two instances of add(), one that
deals with doubles, and another that deals with ints. In fact, you can pass as
parameters any class that has the operator + defined (and allow access to the
appropriate assignment and copy constructors).

-dr

[Kai-Uwe Bux]

Bore Biko wrote:

Dear,

I am an ordinary C programmer and I am most interesed
about dynamical data structuring and programming,
I don't like to use matricess and rows, I like to program
with practical programs that doesent use much memory.
I know a lot of C++ programmers ,and they tolded me,
that C++ templates are real solution for dynamical memory
use programming.I readed 3 books about C++ , but I don't
have a practice and a mass things about templates where
mystery for me I didn't undersrand nothing.
So I will be thankfull if somebody solve with templates
these two programs in end of this post...

I tried to keep the spirit of the algorithm and a little bit of the style.
1)A program which creates a linked list of prim numbers..

/*--------------------------------*/
#include<stdio. h>
#include<malloc .h>
struct lst{
long int value;
struct lst* next;
};

int main(int argc, char* argv[]){
long int i,j,k;
struct lst *prvi, *tekuci_prvi, *tekuci_drugi, *zadnji;
prvi=(struct lst*)malloc(siz eof(struct lst));
prvi->next=(struct lst*)malloc(siz eof(struct lst));
prvi->value=1;
prvi->next->value=2;
tekuci_prvi=prv i->next;
zadnji=prvi->next;
zadnji->next=(struct lst*)NULL;
k=atoi(argv[1]);
tekuci_drugi=pr vi;
for(i=1;i<k;i++ ){
exit:
tekuci_drugi=pr vi;
while(tekuci_dr ugi->next){
if((i%(tekuci_d rugi->value)==0) && tekuci_drugi->value!=1){
if(i==1){
goto exit;
}
i++;
goto exit;
}
tekuci_drugi=te kuci_drugi->next;
}
tekuci_prvi->next=(struct lst*)malloc(siz eof(struct lst));
tekuci_prvi=tek uci_prvi->next;
tekuci_prvi->value=i;
tekuci_prvi->next=(struct lst*)NULL;
/*printf("%ld\n" ,i);*/
}
tekuci_prvi=prv i;
while(tekuci_pr vi->next){
printf("%d\n", tekuci_prvi->value);
tekuci_prvi=tek uci_prvi->next;

}
exit(0);
}

#include <iostream>
#include <list>
#include <cstdlib>

typedef std::list< unsigned long > UlongList;

int main ( unsigned int argn, char* args[] ) {
unsigned long upper_bound = std::atoi( args[1] );
UlongList primes;
for ( unsigned long candidate = 2; candidate < upper_bound; ++candidate )
{
for ( UlongList::cons t_iterator iter = primes.begin();
iter != primes.end(); ++ iter ) {
if ( 0 == candidate % *iter ) {
goto failed;
}
}
std::cout << candidate <<'\n';
primes.push_bac k( candidate );
failed : ;
}
}
This produces slightly different output: just the prime numbers strictly
less than the command line argument are printed in ascending order.

Note: 1 is not a prime number.


2)A program which creates a file(if you redirect output with ">")
of random numbers use:"rand > file.txt", and "file.txt" is input for third
program...

#include<stdio. h>
#include<stdlib .h>

int main(int argc, char *argv[])
{ int i, j, k;
k=atoi(argv[1]);
srand(k);
for(i=0;i<k;i++ ){
printf("%d\n",r and());
}
exit(0);
}
#include <iostream>
#include <cstdlib>

int main ( unsigned int argn, char* args[] ) {
unsigned long count = std::atoi( args[1] );
std::srand( count );
for ( unsigned long i = 0; i < count; ++i ) {
std::cout << std::rand() << '\n';
}
}
This version does not look that much different at all.

3)A program which reads a list of random numbers generated with second
program a "file.txt" and make a sorted list of them...

#include<stdio. h>
#define BUFFER 128

struct lst{
int value;
struct lst *next;
};

int main(int argc , char *argv[]){
int i, j ,k;
FILE *fp;
char buffer[BUFFER];
struct lst *prvi, *tekuci_jedan, *tekuci_dva, *zadnji;
fp=(fopen(argv[1],"r"));
if(fp==(FILE*)N ULL){
printf("\nError can't open:%s",argv[1]);
}
prvi=(struct lst*)malloc(siz eof(struct lst));
tekuci_jedan=pr vi;
while(fgets(buf fer, BUFFER+1, fp)){
tekuci_jedan->next=(struct lst*)malloc(siz eof(struct lst));
tekuci_jedan->value=atoi(buf fer);
tekuci_jedan=te kuci_jedan->next;
}
tekuci_jedan->next=(struct lst*)NULL;
tekuci_jedan=pr vi;
while(tekuci_je dan->next){
tekuci_dva=prvi ;
while(tekuci_dv a->next){
if(tekuci_jedan->value < tekuci_dva->value){
/* i=tekuci_jedan->value; */
tekuci_jedan->value=tekuci_j edan->value+tekuci_d va->value;
tekuci_dva->value=tekuci_j edan->value-tekuci_dva->value;
tekuci_jedan->value=tekuci_j edan->value-tekuci_dva->value;
}
tekuci_dva=teku ci_dva->next;
}
tekuci_jedan=te kuci_jedan->next;
}
tekuci_jedan=pr vi;
while(tekuci_je dan->next){
printf("\n%d",t ekuci_jedan->value);
tekuci_jedan=te kuci_jedan->next;
}
exit(0);
}

#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>

typedef std::vector< int > IntVector;

int main ( unsigned int argn, char* args[] ) {
std::fstream in_file ( args[1] );
if ( ! in_file ) {
std::cerr << "File " << args[1] << " could not be opened.\n";
} else {
IntVector i_vect;
int number;
while ( in_file >> number ) {
i_vect.push_bac k( number );
}
std::sort( i_vect.begin(), i_vect.end() );
std::copy( i_vect.begin(), i_vect.end(),
std::ostream_it erator< int >( std::cout, "\n" ) );
}
}
Here, I changed the data structure to be a vector instead of a list. Using a
list the program would read:

#include <fstream>
#include <iostream>
#include <list>
#include <algorithm>
#include <iterator>

typedef std::list< int > IntList;

int main ( unsigned int argn, char* args[] ) {
std::fstream in_file ( args[1] );
if ( ! in_file ) {
std::cerr << "File " << args[1] << " could not be opened.\n";
} else {
IntList i_list;
int number;
while ( in_file >> number ) {
i_list.push_bac k( number );
}
i_list.sort();
std::copy( i_list.begin(), i_list.end(),
std::ostream_it erator< int >( std::cout, "\n" ) );
}
}
Notice the subtle change in calling the sort algorithm.

P.S. I don't know does a gcc support templates if not you can
send mee a version for VC++ 6.0

g++ supports templates in all recent versions.
Best

Kai-Uwe Bux