Heapsort.i

   1 %module "Math::GSL::Heapsort"
   2 %{
   3     #include "gsl/gsl_heapsort.h"
   4 %}
   5
   6 %include "gsl/gsl_heapsort.h"
   7
   8
   9 %perlcode %{
  10 @EXPORT_OK = qw/
  11                gsl_heapsort
  12                gsl_heapsort_index
  13              /;
  14 %EXPORT_TAGS = ( all => [ @EXPORT_OK ] );
  15
  16 __END__
  17
  18 =head1 NAME
  19
  20 Math::GSL::Heapsort - Functions for sorting data, both directly and indirectly (using an index)
  21
  22 =head1 SYNOPSIS
  23
  24 This module is not yet implemented. Patches Welcome!
  25
  26 use Math::GSL::Heapsort qw /:all/;
  27
  28 =head1 DESCRIPTION
  29
  30 Here is a list of all the functions in this module :
  31
  32 =over
  33
  34 =item * gsl_heapsort
  35
  36 =item * gsl_heapsort_index
  37
  38 =back
  39
  40 For more informations on the functions, we refer you to the GSL offcial
  41 documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
  42
  43  Tip : search on google: site:http://www.gnu.org/software/gsl/manual/html_node/ name_of_the_function_you_want
  44
  45
  46 =head1 AUTHORS
  47
  48 Jonathan Leto <jonathan@leto.net> and Thierry Moisan <thierry.moisan@gmail.com>
  49
  50 =head1 COPYRIGHT AND LICENSE
  51
  52 Copyright (C) 2008 Jonathan Leto and Thierry Moisan
  53
  54 This program is free software; you can redistribute it and/or modify it
  55 under the same terms as Perl itself.
  56
  57 =cut
  58
  59 %}