Scribd
Upload
33 views

Function

1. A function in GAP is defined using the function keyword followed by the formal arguments, an optional local declarations, statements, and end. 2. Functions can call themselves recursively by referring to the function name within the body of the function. 3. When a function is defined with a single argument named arg, GAP stores all actual arguments in a list that is assigned to arg, allowing for optional or variable numbers of arguments.

Uploaded by

ravg10
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Function

1. A function in GAP is defined using the function keyword followed by the formal arguments, an optional local declarations, statements, and end. 2. Functions can call themselves recursively by referring to the function name within the body of the function. 3. When a function is defined with a single argument named arg, GAP stores all actual arguments in a list that is assigned to arg, allowing for optional or variable numbers of arguments.

Uploaded by

ravg10
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Function

By: GAP
 function( [ arg-ident {, arg-ident} ] )
[local loc-ident {, loc-ident} ; ]
statements
end

A function is in fact a literal and not a statement. Such a function literal can be assigned
to a variable or to a list element or a record component. Later this function can be called
as described in Function Calls.

The following is an example of a function definition. It is a function to compute values


of the Fibonacci sequence (see Fibonacci).

gap> fib := function ( n )


> local f1, f2, f3, i;
> f1 := 1; f2 := 1;
> for i in [3..n] do
> f3 := f1 + f2;
> f1 := f2;
> f2 := f3;
> od;
> return f2;
> end;;
gap> List( [1..10], fib );
[ 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 ]

Because for each of the formal arguments arg-ident and for each of the formal
locals loc-ident a new variable is allocated when the function is called (see Function
Calls), it is possible that a function calls itself. This is usually called recursion. The
following is a recursive function that computes values of the Fibonacci sequence

gap> fib := function ( n )


> if n < 3 then
> return 1;
> else
> return fib(n-1) + fib(n-2);
> fi;
> end;;
gap> List( [1..10], fib );
[ 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 ]

Note that the recursive version needs 2 * fib(n)-1 steps to compute fib(n), while
the iterative version of fib needs only n-2 steps. Both are not optimal however, the
library function Fibonacci only needs about Log(n) steps.

As noted in Section Function Calls, the case where a function is defined with exactly
one formal argument with the name arg, is special. It provides a way of defining a
function with a variable number of arguments; the values of all the actual arguments are
stored in a list and this list is assigned to the new variable corresponding to the formal
argument arg. There are two typical scenarios for wanting such a possibility: having
optional arguments and having any number of arguments.

The following example shows one way that the function Position (see Position) might
be encoded and demonstrates the ``optional argument'' scenario.

gap> position := function ( arg )


> local list, obj, pos;
> list := arg[1];
> obj := arg[2];
> if 2 = Length(arg) then
> pos := 0;
> else
> pos := arg[3];
> fi;
> repeat
> pos := pos + 1;
> if pos > Length(list) then
> return fail;
> fi;
> until list[pos] = obj;
> return pos;
> end;
function( arg ) ... end
gap> position([1, 4, 2], 4);
2
gap> position([1, 4, 2], 3);
fail
gap> position([1, 4, 2], 4, 2);
fail

The following example demonstrates the ``any number of arguments'' scenario.

gap> sum := function ( arg )


> local total, x;
> total := 0;
> for x in arg do
> total := total + x;
> od;
> return total;
> end;
function( arg ) ... end
gap> sum(1, 2, 3);
6
gap> sum(1, 2, 3, 4);
10
gap> sum();
0

The user should compare the above with the GAP function Sum (see Sum) which, for
example, may take a list argument and optionally an initial element (which zero should
the sum of an empty list return?).

Note that if a function f is defined as above with the single formal


argument arg then NumberArgumentsFunction(f) returns −1
(see NumberArgumentsFunction).
The argument arg when used as the single argument name of some
function f tells GAP that when it encounters f that it should form a list out of the
arguments of f. What if one wishes to do the ``opposite'': tell GAP that a list should be
``unwrapped'' and passed as several arguments to a function. The
function CallFuncList(see CallFuncList) is provided for this purpose.

Also see Chapter Functions.

 arg-ident -> expr

This is a shorthand for

function ( arg-ident ) return expr; end.

arg-ident must be a single identifier, i.e., it is not possible to write functions of several
arguments this way. Also arg is not treated specially, so it is also impossible to write
functions that take a variable number of arguments this way.

The following is an example of a typical use of such a function

gap> Sum( List( [1..100], x -> x^2 ) );


338350

When the definition of a function fun1 is evaluated inside another


function fun2, GAP binds all the identifiers inside the function fun1 that are identifiers
of an argument or a local of fun2 to the corresponding variable. This set of bindings is
called the environment of the function fun1. When fun1 is called, its body is executed in
this environment. The following implementation of a simple stack uses this. Values can
be pushed onto the stack and then later be popped off again. The interesting thing here
is that the functions push and pop in the record returned by Stack access the local
variable stack of Stack. When Stack is called, a new variable for the
identifier stack is created. When the function definitions of push and pop are then
evaluated (as part of the return statement) each reference tostack is bound to this new
variable. Note also that the two stacks A and B do not interfere, because each call
of Stack creates a new variable for stack.

gap> Stack := function ()


> local stack;
> stack := [];
> return rec(
> push := function ( value )
> Add( stack, value );
> end,
> pop := function ()
> local value;
> value := stack[Length(stack)];
> Unbind( stack[Length(stack)] );
> return value;
> end
> );
> end;;
gap> A := Stack();;
gap> B := Stack();;
gap> A.push( 1 ); A.push( 2 ); A.push( 3 );
gap> B.push( 4 ); B.push( 5 ); B.push( 6 );
gap> A.pop(); A.pop(); A.pop();
3
2
1
gap> B.pop(); B.pop(); B.pop();
6
5
4

This feature should be used rarely, since its implementation in GAP is not very
efficient.

Reference: http://www.gap-system.org/Manuals//doc/htm/ref/CHAP004.htm#SECT022

Date:10-9-2008

You might also like