Generic programming

In computer science, generics are a technique that allows one value to take different datatype (so-called polymorphism) as long as certain contracts (so-called subtype) are kept. The programming style with it is called "generic programming".

Among OOP languages, C++, Beta, Eiffel, Ada, and later versions of Java provides generic facility. In C++, templates support generics and popularized the notion of generics.

For example, in C++ code,


template 

T max (T x, T y)

{

 if (x < y)

   return y;

 else

   return x;

}

In this case, a pseudo-datatype T is called "subtype". T can be anything that can be compared.

Uncommon, template metaprogramming is a way of making algorithms evaluate when your code is compiled.


See also Partial evaluation


 
 

Browse articles alphabetically:
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | _ | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
 
[an error occurred while processing this directive]