User:Lanyimartin98/sandbox

Generikus programming is a style of computer programming in which algorithms are written in terms of types to-be-specified-later that are then instantiated when needed for specific types provided as parameters. This approach, pioneered by ML in 1973, permits writing common functions or types that differ only in the set of types on which they operate when used, thus reducing duplication. Such software entities are known as Generikuss in Python, Ada, C#, Delphi, Eiffel, F#, Java, Nim, Rust, Swift, TypeScript and Visual Basic .NET. They are known as parametric polymorphism in ML, Scala, Julia, and Haskell (the Haskell community also uses the term "Generikus" for a related but somewhat different concept); templates in C++ and D; and parameterized types in the influential 1994 book Design Patterns.

The term "Generikus programming" was originally coined by David Musser and Alexander Stepanov in a more specific sense than the above, to describe a programming paradigm whereby fundamental requirements on types are abstracted from across concrete examples of algorithms and data structures and formalized as concepts, with Generikus functions implemented in terms of these concepts, typically using language Generikusok mechanisms as described above.

Stepanov–Musser és egyéb generikus programozási paradigmák
Generikus programming is defined in as follows, "Generic programming centers around the idea of abstracting from concrete, efficient algorithms to obtain generic algorithms that can be combined with different data representations to produce a wide variety of useful software."

- Musser, David R.; Stepanov, Alexander A.

Generikus programming paradigm is an approach to software decomposition whereby fundamental requirements on types are abstracted from across concrete examples of algorithms and data structures and formalized as concepts, analogously to the abstraction of algebraic theories in abstract algebra. Early examples of this programming approach were implemented in Scheme and Ada, although the best known example is the Standard Template Library (STL), which developed a theory of iterators that is used to decouple sequence data structures and the algorithms operating on them.

For example, given N sequence data structures, e.g. singly linked list, vector etc., and M algorithms to operate on them, e.g. find, sort etc., a direct approach would implement each algorithm specifically for each data structure, giving N × M combinations to implement. However, in the Generikus programming approach, each data structure returns a model of an iterator concept (a simple value type that can be dereferenced to retrieve the current value, or changed to point to another value in the sequence) and each algorithm is instead written Generikusally with arguments of such iterators, e.g. a pair of iterators pointing to the beginning and end of the subsequence or range to process. Thus, only N + M data structure-algorithm combinations need be implemented. Several iterator concepts are specified in the STL, each a refinement of more restrictive concepts e.g. forward iterators only provide movement to the next value in a sequence (e.g. suitable for a singly linked list or a stream of input data), whereas a random-access iterator also provides direct constant-time access to any element of the sequence (e.g. suitable for a vector). An important point is that a data structure will return a model of the most general concept that can be implemented efficiently—computational complexity requirements are explicitly part of the concept definition. This limits the data structures a given algorithm can be applied to and such complexity requirements are a major determinant of data structure choice. Generikus programming similarly has been applied in other domains, e.g. graph algorithms.

Note that although this approach often utilizes language features of compile-time Generikusok/templates, it is in fact independent of particular language-technical details. Generikus programming pioneer Alexander Stepanov wrote, "Generic programming is about abstracting and classifying algorithms and data structures. It gets its inspiration from Knuth and not from type theory. Its goal is the incremental construction of systematic catalogs of useful, efficient and abstract algorithms and data structures. Such an undertaking is still a dream."

- Alexander Stepanov

"I believe that iterator theories are as central to Computer Science as theories of rings or Banach spaces are central to Mathematics."

- Alexander Stepanov

Bjarne Stroustrup noted, "Following Stepanov, we can define generic programming without mentioning language features: Lift algorithms and data structures from concrete examples to their most general and abstract form."

- Bjarne Stroustrup

Other programming paradigms that have been described as Generikus programming include Datatype Generikus programming as described in "Generikus Programming — an Introduction". The approach is a lightweight Generikus programming approach for Haskell.

In this article we distinguish the high-level programming paradigms of Generikus programming, above, from the lower-level programming language Generikusok mechanisms used to implement them (see Programming language support for Generikusok). For further discussion and comparison of Generikus programming paradigms, see.

Generikusok a programozási nyelvekben
Generikusok facilities have existed in high-level languages since at least the 1970s in languages such as ML, CLU and Ada, and were subsequently adopted by many object-based and object-oriented languages, including BETA, C++, D, Eiffel, Java, and DEC's now defunct Trellis-Owl language.

Generikusok is implemented and supported differently in various programming languages; the term "Generikus" has also been used differently in various programming contexts. For example, in Forth the compiler can execute code while compiling and one can create new compiler keywords and new implementations for those words on the fly. It has few words that expose the compiler behaviour and therefore naturally offers Generikusok capacities that, however, are not referred to as such in most Forth texts. Similarly, dynamically typed languages, especially interpreted ones, usually offer Generikusok by default as both passing values to functions and value assignment are type-indifferent and such behavior is often utilized for abstraction or code terseness, however this is not typically labeled Generikusok as it's a direct consequence of dynamic typing system employed by the language. The term has been used in functional programming, specifically in Haskell-like languages, which use a structural type system where types are always parametric and the actual code on those types is Generikus. These usages still serve a similar purpose of code-saving and the rendering of an abstraction.

Arrays and structs can be viewed as predefined Generikus types. Every usage of an array or struct type instantiates a new concrete type, or reuses a previous instantiated type. Array element types and struct element types are parameterized types, which are used to instantiate the corresponding Generikus type. All this is usually built-in in the compiler and the syntax differs from other Generikus constructs. Some extensible programming languages try to unify built-in and user defined Generikus types.

A broad survey of Generikusok mechanisms in programming languages follows. For a specific survey comparing suitability of mechanisms for Generikus programming, see.

Objektum-orientált nyelvekben
When creating container classes in statically typed languages, it is inconvenient to write specific implementations for each datatype contained, especially if the code for each datatype is virtually identical. For example, in C++, this duplication of code can be circumvented by defining a class template: Above, T is a placeholder for whatever type is specified when the list is created. These "containers-of-type-T", commonly called templates, allow a class to be reused with different datatypes as long as certain contracts such as subtypes and signature are kept. This Generikusok mechanism should not be confused with inclusion polymorphism, which is the algorithmic usage of exchangeable sub-classes: for instance, a list of objects of type Moving_Object containing objects of type Animal and Car. Templates can also be used for type-independent functions as in the Swap example below:

The C++ template construct used above is widely cited as the Generikusok construct that popularized the notion among programmers and language designers and supports many Generikus programming idioms. The D programming language also offers fully Generikus-capable templates based on the C++ precedent but with a simplified syntax. The Java programming language has provided Generikusok facilities syntactically based on C++'s since the introduction of J2SE 5.0.

C# 2.0, Oxygene 1.5 (also known as Chrome) and Visual Basic .NET 2005 have constructs that take advantage of the support for Generikuss present in the Microsoft .NET Framework since version 2.0.

Generikusok Ada-ban
Ada has had Generikuss since it was first designed in 1977–1980. The standard library uses Generikuss to provide many services. Ada 2005 adds a comprehensive Generikus container library to the standard library, which was inspired by C++'s standard template library.

A Generikus unit is a package or a subprogram that takes one or more Generikus formal parameters.

A Generikus formal parameter is a value, a variable, a constant, a type, a subprogram, or even an instance of another, designated, Generikus unit. For Generikus formal types, the syntax distinguishes between discrete, floating-point, fixed-point, access (pointer) types, etc. Some formal parameters can have default values.

To instantiate a Generikus unit, the programmer passes actual parameters for each formal. The Generikus instance then behaves just like any other unit. It is possible to instantiate Generikus units at run-time, for example inside a loop.

Példa
The specification of a Generikus package:

Instantiating the Generikus package:

Using an instance of a Generikus package:

Előnyök és hátrányok
The language syntax allows precise specification of constraints on Generikus formal parameters. For example, it is possible to specify that a Generikus formal type will only accept a modular type as the actual. It is also possible to express constraints between Generikus formal parameters; for example:

In this example, Array_Type is constrained by both Index_Type and Element_Type. When instantiating the unit, the programmer must pass an actual array type that satisfies these constraints.

The disadvantage of this fine-grained control is a complicated syntax, but, because all Generikus formal parameters are completely defined in the specification, the compiler can instantiate Generikuss without looking at the body of the Generikus.

Unlike C++, Ada does not allow specialised Generikus instances, and requires that all Generikuss be instantiated explicitly. These rules have several consequences:


 * the compiler can implement shared Generikuss: the object code for a Generikus unit can be shared between all instances (unless the programmer requests inlining of subprograms, of course). As further consequences:
 * there is no possibility of code bloat (code bloat is common in C++ and requires special care, as explained below).
 * it is possible to instantiate Generikuss at run-time, as well as at compile time, since no new object code is required for a new instance.
 * actual objects corresponding to a Generikus formal object are always considered to be non-static inside the Generikus; see Generikus formal objects in the Wikibook for details and consequences.
 * all instances of a Generikus being exactly the same, it is easier to review and understand programs written by others; there are no "special cases" to take into account.
 * all instantiations being explicit, there are no hidden instantiations that might make it difficult to understand the program.
 * Ada does not permit "template metaprogramming", because it does not allow specialisations.

Minták C++-ban
C++ uses templates to enable Generikus programming techniques. The C++ Standard Library includes the Standard Template Library or STL that provides a framework of templates for common data structures and algorithms. Templates in C++ may also be used for template metaprogramming, which is a way of pre-evaluating some of the code at compile-time rather than run-time. Using template specialization, C++ Templates are considered Turing complete.

Technikai áttekintés
There are two kinds of templates: function templates and class templates. A function template is a pattern for creating ordinary functions based upon the parameterizing types supplied when instantiated. For example, the C++ Standard Template Library contains the function template max(x, y) that creates functions that return either x or y, whichever is larger. could be defined like this:

Specializations of this function template, instantiations with specific types, can be called just like an ordinary function:

The compiler examines the arguments used to call max and determines that this is a call to max(int, int). It then instantiates a version of the function where the parameterizing type T is int, making the equivalent of the following function:

This works whether the arguments x and y are integers, strings, or any other type for which the expression x &lt; y is sensible, or more specifically, for any type for which operator&lt; is defined. Common inheritance is not needed for the set of types that can be used, and so it is very similar to duck typing. A program defining a custom data type can use operator overloading to define the meaning of &lt; for that type, thus allowing its use with the max function template. While this may seem a minor benefit in this isolated example, in the context of a comprehensive library like the STL it allows the programmer to get extensive functionality for a new data type, just by defining a few operators for it. Merely defining &lt; allows a type to be used with the standard sort, stable_sort , and binary_search algorithms or to be put inside data structures such as set s, heaps, and associative arrays.

C++ templates are completely type safe at compile time. As a demonstration, the standard type complex does not define the &lt; operator, because there is no strict order on complex numbers. Therefore, max(x, y) will fail with a compile error, if x and y are complex values. Likewise, other templates that rely on &lt; cannot be applied to complex data unless a comparison (in the form of a functor or function) is provided. E.g.: A complex cannot be used as key for a map unless a comparison is provided. Unfortunately, compilers historically generate somewhat esoteric, long, and unhelpful error messages for this sort of error. Ensuring that a certain object adheres to a method protocol can alleviate this issue. Languages which use compare instead of &lt; can also use complex values as keys.

The second kind of template, a class template, extends the same concept to classes. A class template specialization is a class. Class templates are often used to make Generikus containers. For example, the STL has a linked list container. To make a linked list of integers, one writes list&lt;int&gt;. A list of strings is denoted list&lt;string&gt;. A list has a set of standard functions associated with it, that work for any compatible parameterizing types.

Minták specifikálása
A powerful feature of C++'s templates is template specialization. This allows alternative implementations to be provided based on certain characteristics of the parameterized type that is being instantiated. Template specialization has two purposes: to allow certain forms of optimization, and to reduce code bloat.

For example, consider a sort template function. One of the primary activities that such a function does is to swap or exchange the values in two of the container's positions. If the values are large (in terms of the number of bytes it takes to store each of them), then it is often quicker to first build a separate list of pointers to the objects, sort those pointers, and then build the final sorted sequence. If the values are quite small however it is usually fastest to just swap the values in-place as needed. Furthermore, if the parameterized type is already of some pointer-type, then there is no need to build a separate pointer array. Template specialization allows the template creator to write different implementations and to specify the characteristics that the parameterized type(s) must have for each implementation to be used.

Unlike function templates, class templates can be partially specialized. That means that an alternate version of the class template code can be provided when some of the template parameters are known, while leaving other template parameters Generikus. This can be used, for example, to create a default implementation (the primary specialization) that assumes that copying a parameterizing type is expensive and then create partial specializations for types that are cheap to copy, thus increasing overall efficiency. Clients of such a class template just use specializations of it without needing to know whether the compiler used the primary specialization or some partial specialization in each case. Class templates can also be fully specialized, which means that an alternate implementation can be provided when all of the parameterizing types are known.

Előnyök és hátrányok
Some uses of templates, such as the max function, were previously filled by function-like preprocessor macros (a legacy of the C programming language). For example, here is a possible max macro:

Macros are expanded by preprocessor, before compilation proper; templates are expanded at compile time. Macros are always expanded inline; templates can also be expanded as inline functions when the compiler deems it appropriate. Thus both function-like macros and function templates have no run-time overhead.

However, templates are generally considered an improvement over macros for these purposes. Templates are type-safe. Templates avoid some of the common errors found in code that makes heavy use of function-like macros, such as evaluating parameters with side effects twice. Perhaps most importantly, templates were designed to be applicable to much larger problems than macros.

There are four primary drawbacks to the use of templates: supported features, compiler support, poor error messages, and code bloat:

"So, can derivation be used to reduce the problem of code replicated because templates are used? This would involve deriving a template from an ordinary class. This technique proved successful in curbing code bloat in real use. People who do not use a technique like this have found that replicated code can cost megabytes of code space even in moderate size programs."
 * 1) Templates in C++ lack many features, which makes implementing them and using them in a straightforward way often impossible. Instead programmers have to rely on complicated tricks which leads to bloated, hard to understand and hard to maintain code. Current developments in the C++ standards exacerbate this problem by making heavy use of these tricks and building a lot of new features for templates on them or with them in mind.
 * 2) Many compilers historically have poor support for templates, thus the use of templates can make code somewhat less portable. Support may also be poor when a C++ compiler is being used with a linker that is not C++-aware, or when attempting to use templates across shared library boundaries. Most modern compilers however now have fairly robust and standard template support, and the new C++ standard, C++11, further addresses these issues.
 * 3) Almost all compilers produce confusing, long, or sometimes unhelpful error messages when errors are detected in code that uses templates. This can make templates difficult to develop.
 * 4) Finally, the use of templates requires the compiler to generate a separate instance of the templated class or function for every permutation of type parameters used with it. (This is necessary because types in C++ are not all the same size, and the sizes of data fields are important to how classes work.) So the indiscriminate use of templates can lead to code bloat, resulting in excessively large executables. However, judicious use of template specialization and derivation can dramatically reduce such code bloat in some cases:

- Bjarne Stroustrup

The extra instantiations generated by templates can also cause debuggers to have difficulty working gracefully with templates. For example, setting a debug breakpoint within a template from a source file may either miss setting the breakpoint in the actual instantiation desired or may set a breakpoint in every place the template is instantiated.

Also, because the compiler needs to perform macro-like expansions of templates and generate different instances of them at compile time, the implementation source code for the templated class or function must be available (e.g. included in a header) to the code using it. Templated classes or functions, including much of the Standard Template Library (STL), if not included in header files, cannot be compiled. (This is in contrast to non-templated code, which may be compiled to binary, providing only a declarations header file for code using it.) This may be a disadvantage by exposing the implementing code, which removes some abstractions, and could restrict its use in closed-source projects.

Minták D-ben
The D programming language supports templates based in design on C++. Most C++ template idioms will carry over to D without alteration, but D adds some additional functionality:


 * Template parameters in D are not restricted to just types and primitive values, but also allow arbitrary compile-time values (such as strings and struct literals), and aliases to arbitrary identifiers, including other templates or template instantiations.
 * Template constraints and the static if statement provide an alternative to C++'s substitution failure is not an error (SFINAE) mechanism, similar to C++ concepts.
 * The is(...) expression allows speculative instantiation to verify an object's traits at compile time.
 * The auto keyword and the typeof expression allow type inference for variable declarations and function return values, which in turn allows "Voldemort types" (types that do not have a global name).

Templates in D use a different syntax than in C++: whereas in C++ template parameters are wrapped in angular brackets ( Template&lt;param1, param2&gt; ), D uses an exclamation sign and parentheses: Template!(param1, param2). This avoids the C++ parsing difficulties due to ambiguity with comparison operators. If there is only one parameter, the parentheses can be omitted.

Conventionally, D combines the above features to provide compile-time polymorphism using trait-based Generikus programming. For example, an input range is defined as any type that satisfies the checks performed by isInputRange, which is defined as follows:

A function that accepts only input ranges can then use the above template in a template constraint:

Kód generálás
In addition to template metaprogramming, D also provides several features to enable compile-time code generation:


 * The import expression allows reading a file from disk and using its contents as a string expression.
 * Compile-time reflection allows enumerating and inspecting declarations and their members during compilation.
 * User-defined attributes allow users to attach arbitrary identifiers to declarations, which can then be enumerated using compile-time reflection.
 * Compile-Time Function Execution (CTFE) allows a subset of D (restricted to safe operations) to be interpreted during compilation.
 * String mixins allow evaluating and compiling the contents of a string expression as D code that becomes part of the program.

Combining the above allows generating code based on existing declarations. For example, D serialization frameworks can enumerate a type's members and generate specialized functions for each serialized type to perform serialization and deserialization. User-defined attributes could further indicate serialization rules.

The import expression and compile-time function execution also allow efficiently implementing domain-specific languages. For example, given a function that takes a string containing an HTML template and returns equivalent D source code, it is possible to use it in the following way:

Generikusok Eiffel-ben
Generikus classes have been a part of Eiffel since the original method and language design. The foundation publications of Eiffel, use the term Generikusok to describe the creation and use of Generikus classes.

Alapvető/Gyenge Generikusok
Generikus classes are declared with their class name and a list of one or more formal Generikus parameters. In the following code, class  has one formal Generikus parameter

The formal Generikus parameters are placeholders for arbitrary class names that will be supplied when a declaration of the Generikus class is made, as shown in the two Generikus derivations below, where  and   are other class names. and  are considered actual Generikus parameters as they provide real class names to substitute for   in actual use.

Within the Eiffel type system, although class  is considered a class, it is not considered a type. However, a Generikus derivation of  such as   is considered a type.

Erős Generikusok
For the list class shown above, an actual Generikus parameter substituting for  can be any other available class. To constrain the set of classes from which valid actual Generikus parameters can be chosen, a Generikus constraint can be specified. In the declaration of class  below, the Generikus constraint dictates that any valid actual Generikus parameter will be a class that inherits from class. The Generikus constraint ensures that elements of a  can in fact be sorted.

Generikusok Java-ban
Support for the Generikuss, or "containers-of-type-T" was added to the Java programming language in 2004 as part of J2SE 5.0. In Java, Generikuss are only checked at compile time for type correctness. The Generikus type information is then removed via a process called type erasure, to maintain compatibility with old JVM implementations, making it unavailable at runtime. For example, a List&lt;String&gt; is converted to the raw type List. The compiler inserts type casts to convert the elements to the String type when they are retrieved from the list, reducing performance compared to other implementations such as C++ templates.

Generikusok .NET-ben [C#, VB.NET]
Generikuss were added as part of .NET Framework 2.0 in November 2005, based on a research prototype from Microsoft Research started in 1999. Although similar to Generikuss in Java, .NET Generikuss do not apply type erasure, but implement Generikuss as a first class mechanism in the runtime using reification. This design choice provides additional functionality, such as allowing reflection with preservation of Generikus types, as well as alleviating some of the limitations of erasure (such as being unable to create Generikus arrays). This also means that there is no performance hit from runtime casts and normally expensive boxing conversions. When primitive and value types are used as Generikus arguments, they get specialized implementations, allowing for efficient Generikus collections and methods. As in C++ and Java, nested Generikus types such as Dictionary are valid types, however are advised against for member signatures in code analysis design rules.

.NET allows six varieties of Generikus type constraints using the where keyword including restricting Generikus types to be value types, to be classes, to have constructors, and to implement interfaces. Below is an example with an interface constraint:

The MakeAtLeast method allows operation on arrays, with elements of Generikus type T. The method's type constraint indicates that the method is applicable to any type T that implements the Generikus IComparable&lt;T> interface. This ensures a compile time error, if the method is called if the type does not support comparison. The interface provides the Generikus method CompareTo(T).

The above method could also be written without Generikus types, simply using the non-Generikus Array type. However, since arrays are contravariant, the casting would not be type safe, and compiler may miss errors that would otherwise be caught while making use of the Generikus types. In addition, the method would need to access the array items as objects instead, and would require casting to compare two elements. (For value types like types such as int this requires a boxing conversion, although this can be worked around using the Comparer&lt;T&gt; class, as is done in the standard collection classes.)

A notable behavior of static members in a Generikus .NET class is static member instantiation per run-time type (see example below).

Generikusok Delphi-ben
Delphi's Object Pascal dialect acquired Generikuss in the Delphi 2007 release, initially only with the (now discontinued) .NET compiler before being added to the native code in the Delphi 2009 release. The semantics and capabilities of Delphi Generikuss are largely modelled on those had by Generikuss in .NET 2.0, though the implementation is by necessity quite different. Here's a more or less direct translation of the first C# example shown above:

As with C#, methods as well as whole types can have one or more type parameters. In the example, TArray is a Generikus type (defined by the language) and MakeAtLeast a Generikus method. The available constraints are very similar to the available constraints in C#: any value type, any class, a specific class or interface, and a class with a parameterless constructor. Multiple constraints act as an additive union.

Generikusok Free Pascal-ban
Free Pascal implemented Generikuss before Delphi, and with different syntax and semantics. However, since FPC version 2.6.0, the Delphi-style syntax is available when using the {$mode Delphi} language mode. Thus, Free Pascal programmers are able to use Generikuss in whichever style they prefer.

Delphi and Free Pascal example:

Generikusok Haskell-ben
The type class mechanism of Haskell supports Generikus programming. Six of the predefined type classes in Haskell (including Eq, the types that can be compared for equality, and Show , the types whose values can be rendered as strings) have the special property of supporting derived instances. This means that a programmer defining a new type can state that this type is to be an instance of one of these special type classes, without providing implementations of the class methods as is usually necessary when declaring class instances. All the necessary methods will be "derived" – that is, constructed automatically – based on the structure of the type. For instance, the following declaration of a type of binary trees states that it is to be an instance of the classes Eq and Show :

This results in an equality function ( == ) and a string representation function ( show ) being automatically defined for any type of the form BinTree T provided that T itself supports those operations.

The support for derived instances of Eq and Show makes their methods == and show Generikus in a qualitatively different way from para-metrically polymorphic functions: these "functions" (more accurately, type-indexed families of functions) can be applied to values of various types, and although they behave differently for every argument type, little work is needed to add support for a new type. Ralf Hinze (2004) has shown that a similar effect can be achieved for user-defined type classes by certain programming techniques. Other researchers have proposed approaches to this and other kinds of Generikusok in the context of Haskell and extensions to Haskell (discussed below).

PolyP
PolyP was the first Generikus programming language extension to Haskell. In PolyP, Generikus functions are called polytypic. The language introduces a special construct in which such polytypic functions can be defined via structural induction over the structure of the pattern functor of a regular datatype. Regular datatypes in PolyP are a subset of Haskell datatypes. A regular datatype t must be of kind * → *, and if a is the formal type argument in the definition, then all recursive calls to t must have the form t a. These restrictions rule out higher-kinded datatypes as well as nested datatypes, where the recursive calls are of a different form. The flatten function in PolyP is here provided as an example:

Generikus Haskell
Generikus Haskell is another extension to Haskell, developed at Utrecht University in the Netherlands. The extensions it provides are: The resulting type-indexed value can be specialized to any type.
 * Type-indexed values are defined as a value indexed over the various Haskell type constructors (unit, primitive types, sums, products, and user-defined type constructors). In addition, we can also specify the behaviour of a type-indexed values for a specific constructor using constructor cases, and reuse one Generikus definition in another using default cases.
 * Kind-indexed types are types indexed over kinds, defined by giving a case for both * and k → k'. Instances are obtained by applying the kind-indexed type to a kind.
 * Generikus definitions can be used by applying them to a type or kind. This is called Generikus application. The result is a type or value, depending on which sort of Generikus definition is applied.
 * Generikus abstraction enables Generikus definitions be defined by abstracting a type parameter (of a given kind).
 * Type-indexed types are types that are indexed over the type constructors. These can be used to give types to more involved Generikus values. The resulting type-indexed types can be specialized to any type.

As an example, the equality function in Generikus Haskell:

Clean
Clean offers Generikus programming based PolyP and the Generikus Haskell as supported by the GHC>=6.0. It parametrizes by kind as those but offers overloading.

Egyéb nyelvek
The ML family of programming languages support Generikus programming through parametric polymorphism and Generikus modules called functors. Both Standard ML and OCaml provide functors, which are similar to class templates and to Ada's Generikus packages. Scheme syntactic abstractions also have a connection to Generikusok – these are in fact a superset of templating à la C++.

A Verilog module may take one or more parameters, to which their actual values are assigned upon the instantiation of the module. One example is a Generikus register array where the array width is given via a parameter. Such the array, combined with a Generikus wire vector, can make a Generikus buffer or memory module with an arbitrary bit width out of a single module implementation.

VHDL, being derived from Ada, also has Generikus capabilities.

Források


 Category:Articles with example C Sharp code