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
|
<html lang="en">
<head>
<title>Combination allocation - GNU Scientific Library -- Reference Manual</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="GNU Scientific Library -- Reference Manual">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Combinations.html" title="Combinations">
<link rel="prev" href="The-Combination-struct.html" title="The Combination struct">
<link rel="next" href="Accessing-combination-elements.html" title="Accessing combination elements">
<link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
<!--
Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 The GSL Team.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.2 or
any later version published by the Free Software Foundation; with the
Invariant Sections being ``GNU General Public License'' and ``Free Software
Needs Free Documentation'', the Front-Cover text being ``A GNU Manual'',
and with the Back-Cover Text being (a) (see below). A copy of the
license is included in the section entitled ``GNU Free Documentation
License''.
(a) The Back-Cover Text is: ``You have freedom to copy and modify this
GNU Manual, like GNU software.''-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="Combination-allocation"></a>
Next: <a rel="next" accesskey="n" href="Accessing-combination-elements.html">Accessing combination elements</a>,
Previous: <a rel="previous" accesskey="p" href="The-Combination-struct.html">The Combination struct</a>,
Up: <a rel="up" accesskey="u" href="Combinations.html">Combinations</a>
<hr>
</div>
<h3 class="section">10.2 Combination allocation</h3>
<div class="defun">
— Function: gsl_combination * <b>gsl_combination_alloc</b> (<var>size_t n, size_t k</var>)<var><a name="index-gsl_005fcombination_005falloc-1030"></a></var><br>
<blockquote><p>This function allocates memory for a new combination with parameters
<var>n</var>, <var>k</var>. The combination is not initialized and its elements
are undefined. Use the function <code>gsl_combination_calloc</code> if you
want to create a combination which is initialized to the
lexicographically first combination. A null pointer is returned if
insufficient memory is available to create the combination.
</p></blockquote></div>
<div class="defun">
— Function: gsl_combination * <b>gsl_combination_calloc</b> (<var>size_t n, size_t k</var>)<var><a name="index-gsl_005fcombination_005fcalloc-1031"></a></var><br>
<blockquote><p>This function allocates memory for a new combination with parameters
<var>n</var>, <var>k</var> and initializes it to the lexicographically first
combination. A null pointer is returned if insufficient memory is
available to create the combination.
</p></blockquote></div>
<div class="defun">
— Function: void <b>gsl_combination_init_first</b> (<var>gsl_combination * c</var>)<var><a name="index-gsl_005fcombination_005finit_005ffirst-1032"></a></var><br>
<blockquote><p>This function initializes the combination <var>c</var> to the
lexicographically first combination, i.e. (0,1,2,<small class="dots">...</small>,k-1).
</p></blockquote></div>
<div class="defun">
— Function: void <b>gsl_combination_init_last</b> (<var>gsl_combination * c</var>)<var><a name="index-gsl_005fcombination_005finit_005flast-1033"></a></var><br>
<blockquote><p>This function initializes the combination <var>c</var> to the
lexicographically last combination, i.e. (n-k,n-k+1,<small class="dots">...</small>,n-1).
</p></blockquote></div>
<div class="defun">
— Function: void <b>gsl_combination_free</b> (<var>gsl_combination * c</var>)<var><a name="index-gsl_005fcombination_005ffree-1034"></a></var><br>
<blockquote><p>This function frees all the memory used by the combination <var>c</var>.
</p></blockquote></div>
<div class="defun">
— Function: int <b>gsl_combination_memcpy</b> (<var>gsl_combination * dest, const gsl_combination * src</var>)<var><a name="index-gsl_005fcombination_005fmemcpy-1035"></a></var><br>
<blockquote><p>This function copies the elements of the combination <var>src</var> into the
combination <var>dest</var>. The two combinations must have the same size.
</p></blockquote></div>
<hr>The GNU Scientific Library - a free numerical library licensed under the GNU GPL<br>Back to the <a href="/software/gsl/">GNU Scientific Library Homepage</a></body></html>
|
