How to write a function template, C/C++ Programming

Assignment Help:

How to write a function template

A function template should be written at the beginning of the program in the global area, or you may place it into a header file. All function templates begin with a template declaration.

The syntax is :

  • The C++ keyword template
  • A left angle bracket ( < )
  • A comma separates a list of generic types, each one. A generic type having of two parts

1. the keyword class ( this usage of class has nothing to do with the key word class used to make user-defined type.)

2. a variable that shows some generic type, and will be used whenever this type requires to be written in the function definition. Typically the name T is used, but any valid C++ name will do.

  • A right angle bracket ( > ).

e.g.

template < class T>

T max(char x, char y)

                 {

                                return ( x > y) ? x : y ;

                 }

 

                void main()

                {

                  cout << max( 1,2) << endl;

                  cout << max( 5.62,3.48) << endl;

                  cout << max('A','a') << endl;

                  cout << max( 4,3) << endl;

                }

 

The output is :

                                                2

                                                5.62

                                                a

                                                6

 


Related Discussions:- How to write a function template

What are the differences among a struct in c & in c++?, A: In C++ a struct ...

A: In C++ a struct is alike to a class except for the default access specifier( refer to other question in the document). In C we ought to include the struct keyword while declarin

Functions and stack frame, Each function has its own stack frame between %f...

Each function has its own stack frame between %fp and %sp. Let Caller calls Callee. Then Caller's %sp becomes callee's %fp, and callee's %sp set to be a new value (a smaller one be

Explain recursive functions, Recursive Functions Recursion is a process...

Recursive Functions Recursion is a process by which a function includes itself with a condition for its safe exit. It is best suitable for a recursive problem. A typical exampl

Spaning tree , what is the function of spanning tree in graph algorithm?

what is the function of spanning tree in graph algorithm?

Develop online slot video game for facebook, Develop Online Slot Video Game...

Develop Online Slot Video Game for Facebook Prepare an online slot video game for a Facebook promotion in order to draw new visits and Increase the number of "likes" of the Face

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd