1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
# This file was automatically generated by SWIG (https://www.swig.org).
# Version 4.2.0
#
# Do not make changes to this file unless you know what you are doing - modify
# the SWIG interface file instead.
package Math::GSL::Heapsort;
use base qw(Exporter);
use base qw(DynaLoader);
package Math::GSL::Heapsortc;
bootstrap Math::GSL::Heapsort;
package Math::GSL::Heapsort;
@EXPORT = qw();
# ---------- BASE METHODS -------------
package Math::GSL::Heapsort;
sub TIEHASH {
my ($classname,$obj) = @_;
return bless $obj, $classname;
}
sub CLEAR { }
sub FIRSTKEY { }
sub NEXTKEY { }
sub FETCH {
my ($self,$field) = @_;
my $member_func = "swig_${field}_get";
$self->$member_func();
}
sub STORE {
my ($self,$field,$newval) = @_;
my $member_func = "swig_${field}_set";
$self->$member_func($newval);
}
sub this {
my $ptr = shift;
return tied(%$ptr);
}
# ------- FUNCTION WRAPPERS --------
package Math::GSL::Heapsort;
*gsl_error = *Math::GSL::Heapsortc::gsl_error;
*gsl_stream_printf = *Math::GSL::Heapsortc::gsl_stream_printf;
*gsl_strerror = *Math::GSL::Heapsortc::gsl_strerror;
*gsl_set_error_handler = *Math::GSL::Heapsortc::gsl_set_error_handler;
*gsl_set_error_handler_off = *Math::GSL::Heapsortc::gsl_set_error_handler_off;
*gsl_set_stream_handler = *Math::GSL::Heapsortc::gsl_set_stream_handler;
*gsl_set_stream = *Math::GSL::Heapsortc::gsl_set_stream;
*gsl_permutation_alloc = *Math::GSL::Heapsortc::gsl_permutation_alloc;
*gsl_permutation_calloc = *Math::GSL::Heapsortc::gsl_permutation_calloc;
*gsl_permutation_init = *Math::GSL::Heapsortc::gsl_permutation_init;
*gsl_permutation_free = *Math::GSL::Heapsortc::gsl_permutation_free;
*gsl_permutation_memcpy = *Math::GSL::Heapsortc::gsl_permutation_memcpy;
*gsl_permutation_fread = *Math::GSL::Heapsortc::gsl_permutation_fread;
*gsl_permutation_fwrite = *Math::GSL::Heapsortc::gsl_permutation_fwrite;
*gsl_permutation_fscanf = *Math::GSL::Heapsortc::gsl_permutation_fscanf;
*gsl_permutation_fprintf = *Math::GSL::Heapsortc::gsl_permutation_fprintf;
*gsl_permutation_size = *Math::GSL::Heapsortc::gsl_permutation_size;
*gsl_permutation_data = *Math::GSL::Heapsortc::gsl_permutation_data;
*gsl_permutation_swap = *Math::GSL::Heapsortc::gsl_permutation_swap;
*gsl_permutation_valid = *Math::GSL::Heapsortc::gsl_permutation_valid;
*gsl_permutation_reverse = *Math::GSL::Heapsortc::gsl_permutation_reverse;
*gsl_permutation_inverse = *Math::GSL::Heapsortc::gsl_permutation_inverse;
*gsl_permutation_next = *Math::GSL::Heapsortc::gsl_permutation_next;
*gsl_permutation_prev = *Math::GSL::Heapsortc::gsl_permutation_prev;
*gsl_permutation_mul = *Math::GSL::Heapsortc::gsl_permutation_mul;
*gsl_permutation_linear_to_canonical = *Math::GSL::Heapsortc::gsl_permutation_linear_to_canonical;
*gsl_permutation_canonical_to_linear = *Math::GSL::Heapsortc::gsl_permutation_canonical_to_linear;
*gsl_permutation_inversions = *Math::GSL::Heapsortc::gsl_permutation_inversions;
*gsl_permutation_linear_cycles = *Math::GSL::Heapsortc::gsl_permutation_linear_cycles;
*gsl_permutation_canonical_cycles = *Math::GSL::Heapsortc::gsl_permutation_canonical_cycles;
*gsl_permutation_get = *Math::GSL::Heapsortc::gsl_permutation_get;
*gsl_heapsort = *Math::GSL::Heapsortc::gsl_heapsort;
*gsl_heapsort_index = *Math::GSL::Heapsortc::gsl_heapsort_index;
############# Class : Math::GSL::Heapsort::gsl_permutation_struct ##############
package Math::GSL::Heapsort::gsl_permutation_struct;
use vars qw(@ISA %OWNER %ITERATORS %BLESSEDMEMBERS);
@ISA = qw( Math::GSL::Heapsort );
%OWNER = ();
%ITERATORS = ();
*swig_size_get = *Math::GSL::Heapsortc::gsl_permutation_struct_size_get;
*swig_size_set = *Math::GSL::Heapsortc::gsl_permutation_struct_size_set;
*swig_data_get = *Math::GSL::Heapsortc::gsl_permutation_struct_data_get;
*swig_data_set = *Math::GSL::Heapsortc::gsl_permutation_struct_data_set;
sub new {
my $pkg = shift;
my $self = Math::GSL::Heapsortc::new_gsl_permutation_struct(@_);
bless $self, $pkg if defined($self);
}
sub DESTROY {
return unless $_[0]->isa('HASH');
my $self = tied(%{$_[0]});
return unless defined $self;
delete $ITERATORS{$self};
if (exists $OWNER{$self}) {
Math::GSL::Heapsortc::delete_gsl_permutation_struct($self);
delete $OWNER{$self};
}
}
sub DISOWN {
my $self = shift;
my $ptr = tied(%$self);
delete $OWNER{$ptr};
}
sub ACQUIRE {
my $self = shift;
my $ptr = tied(%$self);
$OWNER{$ptr} = 1;
}
# ------- VARIABLE STUBS --------
package Math::GSL::Heapsort;
*GSL_VERSION = *Math::GSL::Heapsortc::GSL_VERSION;
*GSL_MAJOR_VERSION = *Math::GSL::Heapsortc::GSL_MAJOR_VERSION;
*GSL_MINOR_VERSION = *Math::GSL::Heapsortc::GSL_MINOR_VERSION;
*GSL_POSZERO = *Math::GSL::Heapsortc::GSL_POSZERO;
*GSL_NEGZERO = *Math::GSL::Heapsortc::GSL_NEGZERO;
*GSL_SUCCESS = *Math::GSL::Heapsortc::GSL_SUCCESS;
*GSL_FAILURE = *Math::GSL::Heapsortc::GSL_FAILURE;
*GSL_CONTINUE = *Math::GSL::Heapsortc::GSL_CONTINUE;
*GSL_EDOM = *Math::GSL::Heapsortc::GSL_EDOM;
*GSL_ERANGE = *Math::GSL::Heapsortc::GSL_ERANGE;
*GSL_EFAULT = *Math::GSL::Heapsortc::GSL_EFAULT;
*GSL_EINVAL = *Math::GSL::Heapsortc::GSL_EINVAL;
*GSL_EFAILED = *Math::GSL::Heapsortc::GSL_EFAILED;
*GSL_EFACTOR = *Math::GSL::Heapsortc::GSL_EFACTOR;
*GSL_ESANITY = *Math::GSL::Heapsortc::GSL_ESANITY;
*GSL_ENOMEM = *Math::GSL::Heapsortc::GSL_ENOMEM;
*GSL_EBADFUNC = *Math::GSL::Heapsortc::GSL_EBADFUNC;
*GSL_ERUNAWAY = *Math::GSL::Heapsortc::GSL_ERUNAWAY;
*GSL_EMAXITER = *Math::GSL::Heapsortc::GSL_EMAXITER;
*GSL_EZERODIV = *Math::GSL::Heapsortc::GSL_EZERODIV;
*GSL_EBADTOL = *Math::GSL::Heapsortc::GSL_EBADTOL;
*GSL_ETOL = *Math::GSL::Heapsortc::GSL_ETOL;
*GSL_EUNDRFLW = *Math::GSL::Heapsortc::GSL_EUNDRFLW;
*GSL_EOVRFLW = *Math::GSL::Heapsortc::GSL_EOVRFLW;
*GSL_ELOSS = *Math::GSL::Heapsortc::GSL_ELOSS;
*GSL_EROUND = *Math::GSL::Heapsortc::GSL_EROUND;
*GSL_EBADLEN = *Math::GSL::Heapsortc::GSL_EBADLEN;
*GSL_ENOTSQR = *Math::GSL::Heapsortc::GSL_ENOTSQR;
*GSL_ESING = *Math::GSL::Heapsortc::GSL_ESING;
*GSL_EDIVERGE = *Math::GSL::Heapsortc::GSL_EDIVERGE;
*GSL_EUNSUP = *Math::GSL::Heapsortc::GSL_EUNSUP;
*GSL_EUNIMPL = *Math::GSL::Heapsortc::GSL_EUNIMPL;
*GSL_ECACHE = *Math::GSL::Heapsortc::GSL_ECACHE;
*GSL_ETABLE = *Math::GSL::Heapsortc::GSL_ETABLE;
*GSL_ENOPROG = *Math::GSL::Heapsortc::GSL_ENOPROG;
*GSL_ENOPROGJ = *Math::GSL::Heapsortc::GSL_ENOPROGJ;
*GSL_ETOLF = *Math::GSL::Heapsortc::GSL_ETOLF;
*GSL_ETOLX = *Math::GSL::Heapsortc::GSL_ETOLX;
*GSL_ETOLG = *Math::GSL::Heapsortc::GSL_ETOLG;
*GSL_EOF = *Math::GSL::Heapsortc::GSL_EOF;
@EXPORT_OK = qw/
gsl_heapsort
gsl_heapsort_index
/;
%EXPORT_TAGS = ( all => [ @EXPORT_OK ] );
__END__
=encoding utf8
=head1 NAME
Math::GSL::Heapsort - Functions for sorting data, both directly and indirectly (using an index)
=head1 SYNOPSIS
This module is not yet implemented. Patches Welcome!
use Math::GSL::Heapsort qw /:all/;
=head1 DESCRIPTION
Here is a list of all the functions in this module :
=over
=item * gsl_heapsort
=item * gsl_heapsort_index
=back
For more information on the functions, we refer you to the GSL official
documentation: L<http://www.gnu.org/software/gsl/manual/html_node/>
=head1 AUTHORS
Jonathan "Duke" Leto <jonathan@leto.net> and Thierry Moisan <thierry.moisan@gmail.com>
=head1 COPYRIGHT AND LICENSE
Copyright (C) 2008-2024 Jonathan "Duke" Leto and Thierry Moisan
This program is free software; you can redistribute it and/or modify it
under the same terms as Perl itself.
=cut
1;
|
