Wrapper function: Difference between revisions

Content deleted Content added
Adding local short description: "Function whose job is only to call another subroutine", overriding Wikidata description "Subroutine who’s job is only to call another subroutine"
m Bot: http → https
 
(3 intermediate revisions by 3 users not shown)
Line 3:
{{redirect|Wrapper method|wrapper methods in feature selection|Feature selection#Wrapper method}}
 
A '''wrapper function''' is a [[Function (computer programming)|function]] (another word for a ''subroutine'') in a [[Library (computing)|software library]] or a [[computer program]] whose main purpose is to call a second subroutine<ref>{{cite book |title=Using Visual Basic 6 |last=Reselman |first=Bob |author2=Peasley, Richard |author3=Pruchniak, Wayne |year=1998 |publisher=Que |isbn=9780789716330 |page=446 |url=https://books.google.com/books?id=X5ZQAAAAMAAJ }}</ref> or a [[system call]] with little or no additional computation. Wrapper functions are used to makesimplify writing computer programs easier by abstracting away the details of a subroutine's underlying implementation.
 
== Purpose ==
Line 9:
 
=== Programming convenience ===
Wrapper functions can be used to makesimplify writing computer programs easier. AnFor example of this is, the <code>MouseAdapter</code> and similar classes in the [[Java AWT]] library demonstrate this.<ref>[httphttps://java.sun.com/docs/books/tutorial/uiswing/events/mouselistener.html The Java Tutorials]</ref>
Wrapper functionsThey are useful in the development of applications that use third-party library functions. A wrapper can be written for each of the third party functions and used in the native application. In case the third party functions change or are updated, only the wrappers in the native application need to be modified as opposed to changing all instances of third party functions in the native application.
 
===Adapting class/object interfaces===
Line 18:
===Code testing===
Wrapper functions can be used to write [[Debugger|error checking]] routines for pre-existing system functions without increasing the length of a code by a large amount by repeating the same error check for each call to the function.<ref>{{cite book |title=UNIX Network Programming |last=Stevens |first=Richard |author2=Fenner, Bill |author3=Rudoff |author4= Andrew M. |year=2003 |publisher=Addison-Wesley |isbn=9780131411555 |pages=5–6, 29 |url=https://books.google.com/books?id=ptSC4LpwGA0C }}</ref> All calls to the original function can be replaced with calls to the wrapper, allowing the programmer to forget about error checking once the wrapper is written.
A test driver is a kind of wrapper function that exercises a code module, typically calling it repeatedly, with different settings or parameters, in order to rigorously pursue each possible path. It is not deliverable code, but it is not throwaway code either, being typically retained for use in [[regression testing]].
An interface adaptor is a kind of wrapper function that simplifies, tailors, or amplifies the interface to a code module, with the intent of making it more intelligible or relevant to the user. It may rename parameters, combine parameters, set defaults for parameters, and the like.
 
===Multiple inheritance===
In a [[programming language]] that does not support [[multiple inheritance]] of base classes, wrapper functions can be used to simulate it. Below is an example of part of a [[Java (programming language)|Java]] class that "inherits" from LinkedList and HashSet. See [[Method (computer programming)|Methodmethod]] for further implementation details.
<syntaxhighlight lang="Java">
public class Test implements LinkedList, HashSet {
@Override
 
// contains data members and data methods
@Override
// covariant return
//contains data members and data methods
//covariant return
 
}
</syntaxhighlight>
Line 36 ⟶ 34:
Many [[Standard library|library]] functions, such as those in the [[C Standard Library]], act as [[Interface (computing)|interface]]s for [[Abstraction (computer science)|abstract]]ion of [[system call]]s. The ''fork'' and ''execve'' functions in [[glibc]] are examples of this. They call the [[low-level|lower-level]] ''[[Fork (operating system)|fork]]'' and ''[[execve]]'' system calls, respectively.
 
This may lead to incorrectly using the terms "system call" and "syscall" to refer to higher-level library calls rather than the similarly named system calls, which they wrap.<ref>{{Cite web|url=httphttps://man7.org/linux/man-pages/man2/syscalls.2.html|title=syscalls(2) - Linux manual page|website=man7.org|access-date=2020-04-25}}</ref><ref>{{Cite web|url=https://www.gnu.org/software/libc/manual/html_node/System-Calls.html|title=System Calls (The GNU C Library)|website=www.gnu.org|access-date=2020-04-25}}</ref>
 
==Helper function==
A helper function is a function which groups parts of [[computation]] by assigning descriptive names and allowing for the reuse of the computations.<ref>{{cite web|url=https://web.cs.wpi.edu/~cs1101/a05/Docs/creating-helpers.html|archive-url=https://web.archive.org/web/20210507033146/https://web.cs.wpi.edu/~cs1101/a05/Docs/creating-helpers.html|archive-date=7 May 2021|title=CS 1101: Helper functions|first=Kathi|last=Fisler|publisher=[[Worcester Polytechnic Institute]]|year=2005|access-date=17 November 2021|url-status=live}}</ref> Although not all wrappers are helper functions, all helper functions are wrappers, and a notable use of helper functions—grouping frequently utilized operations—is in [[Binary_translation#Dynamic_binary_translation|dynamic binary translation]], in which helper functions of a particular [[Computer architecture|architecture]] isare used in translation of [[Machine code|instructions]] from one [[Instruction set architecture|instruction set]] into another.<ref>{{cite conference|title=Helper function inlining in dynamic binary translation|conference= CC: Compiler Construction|publisher=[[Association for Computing Machinery]]|first=Wenwen|last=Wang|doi=10.1145/3446804.3446851|page=107|url=https://dl.acm.org/doi/10.1145/3446804.3446851|___location=New York, United States|isbn=978-1-4503-8325-7|date=3 March 2021|url-access=subscription}}</ref>
 
==See also==