Combination.i

   1 %module "Math::GSL::Combination"
   2
   3 FILE * fopen(char *, char *);
   4 int fclose(FILE *);
   5
   6 %{
   7     #include "gsl/gsl_types.h"
   8     #include "gsl/gsl_combination.h"
   9 %}
  10
  11 %include "gsl/gsl_types.h"
  12 %include "gsl/gsl_combination.h"
  13
  14
  15 %perlcode %{
  16 @EXPORT_OK = qw/fopen fclose
  17                gsl_combination_alloc
  18                gsl_combination_calloc
  19                gsl_combination_init_first
  20                gsl_combination_init_last
  21                gsl_combination_free
  22                gsl_combination_memcpy
  23                gsl_combination_fread
  24                gsl_combination_fwrite
  25                gsl_combination_fscanf
  26                gsl_combination_fprintf
  27                gsl_combination_n
  28                gsl_combination_k
  29                gsl_combination_data
  30                gsl_combination_get
  31                gsl_combination_valid
  32                gsl_combination_next
  33                gsl_combination_prev
  34              /;
  35 %EXPORT_TAGS = ( all => [ @EXPORT_OK ] );
  36
  37 __END__
  38
  39 =head1 NAME
  40
  41 Math::GSL::Combination - Functions for creating and manipulating combinations
  42
  43 =head1 SYNOPSIS
  44
  45 use Math::GSL::Combination qw /:all/;
  46
  47 =head1 DESCRIPTION
  48
  49 Here is a list of all the functions in this module :
  50
  51 =over
  52
  53 =item * C<gsl_combination_alloc($n, $k)> - This function allocates memory for a new combination with parameters $n, $k. The combination is not initialized and its elements are undefined. Use the function gsl_combination_calloc if you want to create a combination which is initialized to the lexicographically first combination.
  54
  55 =item * C<gsl_combination_calloc($n, $k)> - This function allocates memory for a new combination with parameters $n, $k and initializes it to the lexicographically first combination.
  56
  57 =item * C<gsl_combination_init_first($c)> - This function initializes the combination $c to the lexicographically first combination, i.e. (0,1,2,...,k-1).
  58
  59 =item * C<gsl_combination_init_last($c)> - This function initializes the combination $c to the lexicographically last combination, i.e. (n-k,n-k+1,...,n-1).
  60
  61 =item * C<gsl_combination_free($c)> - This function frees all the memory used by the combination $c.
  62
  63 =item * C<gsl_combination_memcpy($dest, $src)> - This function copies the elements of the combination $src into the combination $dest. The two combinations must have the same size.
  64
  65 =item * C<gsl_combination_get($c, $i)> - This function returns the value of the i-th element of the combination $c. If $i lies outside the allowed range of 0 to k-1 then the error handler is invoked and 0 is returned.
  66
  67 =item * C<gsl_combination_fwrite($stream, $c)> - This function writes the elements of the combination $c to the stream $stream, opened with the fopen function, in binary format. The function returns $GSL_EFAILED if there was a problem writing to the file. Since the data is written in the native binary format it may not be portable between different architectures.
  68
  69 =item * C<gsl_combination_fread($stream, $c)> - This function reads elements from the open stream $stream, opened with the fopen function into the combination $c in binary format. The combination $c must be preallocated with correct values of n and k since the function uses the size of $c to determine how many bytes to read. The function returns $GSL_EFAILED if there was a problem reading from the file. The data is assumed to have been written in the native binary format on the same architecture.
  70
  71 =item * C<gsl_combination_fprintf($stream, $c, $format)> - This function writes the elements of the combination $c line-by-line to the stream $stream, opened with the fopen function, using the format specifier $format, which should be suitable for a type of size_t. In ISO C99 the type modifier z represents size_t, so "%zu\n" is a suitable format. The function returns $GSL_EFAILED if there was a problem writing to the file.
  72
  73 =item * C<gsl_combination_fscanf($stream, $c)> -This function reads formatted data from the stream $stream into the combination $c. The combination $c must be preallocated with correct values of n and k since the function uses the size of $c to determine how many numbers to read. The function returns $GSL_EFAILED if there was a problem reading from the file.
  74
  75 =item * C<gsl_combination_n($c)> - This function returns the range (n) of the combination $c.
  76
  77 =item * C<gsl_combination_k($c)> - This function returns the number of elements (k) in the combination $c.
  78
  79 =item * C<gsl_combination_data($c)> - This function returns a pointer to the array of elements in the combination $c.
  80
  81 =item * C<gsl_combination_valid($c)> - This function checks that the combination $c is valid. The k elements should lie in the range 0 to n-1, with each value occurring once at most and in increasing order.
  82
  83 =item * C<gsl_combination_next($c)> - This function advances the combination $c to the next combination in lexicographic order and returns $GSL_SUCCESS. If no further combinations are available it returns $GSL_FAILURE and leaves $c unmodified. Starting with the first combination and repeatedly applying this function will iterate through all possible combinations of a given order.
  84
  85 =item * C<gsl_combination_prev($c)> - This function steps backwards from the combination $c to the previous combination in lexicographic order, returning $GSL_SUCCESS. If no previous combination is available it returns $GSL_FAILURE and leaves $c unmodified.
  86
  87 =back
  88
  89
  90 For more informations on the functions, we refer you to the GSL offcial
  91 documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
  92
  93  Tip : search on google: site:http://www.gnu.org/software/gsl/manual/html_node/ name_of_the_function_you_want
  94
  95
  96 =head1 AUTHORS
  97
  98 Jonathan Leto <jonathan@leto.net> and Thierry Moisan <thierry.moisan@gmail.com>
  99
 100 =head1 COPYRIGHT AND LICENSE
 101
 102 Copyright (C) 2008 Jonathan Leto and Thierry Moisan
 103
 104 This program is free software; you can redistribute it and/or modify it
 105 under the same terms as Perl itself.
 106
 107 =cut
 108
 109 %}