forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
bins.html
373 lines (347 loc) · 10.6 KB
/
bins.html
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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
<html>
<head>
<title>
BINS - Order, Sort and Search Data using Bins
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
BINS <br> Order, Sort and Search Data using Bins
</h1>
<hr>
<p>
<b>BINS</b>
is a C++ library which
sorts data into order, or lumps
it into bins, or selects an item of particular rank, or finds
the unique elements in a list.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>BINS</b> is available in
<a href = "../../cpp_src/bins/bins.html">a C++ version</a> and
<a href = "../../f77_src/bins/bins.html">a FORTRAN77 version</a> and
<a href = "../../f_src/bins/bins.html">a FORTRAN90 version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/subpak/subpak.html">
SUBPAK</a>,
a C++ library which
contains many routines
for sorting and searching data.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Jon Bentley, Bruce Weide, Andrew Yao,<br>
Optimal Expected Time Algorithms for Closest Point Problems,<br>
ACM Transactions on Mathematical Software,<br>
Volume 6, Number 4, December 1980, pages 563-580.
</li>
<li>
Thomas Cormen, Charles Leiserson, Ronald Rivest,<br>
Introduction to Algorithms,<br>
MIT Press, 2001,<br>
ISBN: 0262032937.
</li>
<li>
Barry Joe,<br>
GEOMPACK - a software package for the generation of meshes
using geometric algorithms,<br>
Advances in Engineering Software,<br>
Volume 13, 1991, pages 325-331.
</li>
<li>
Albert Nijenhuis, Herbert Wilf,<br>
Combinatorial Algorithms for Computers and Calculators,<br>
Second Edition,<br>
Academic Press, 1978,<br>
ISBN: 0-12-519260-6,<br>
LC: QA164.N54.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "bins.cpp">bins.cpp</a>, the source code.
</li>
<li>
<a href = "bins.hpp">bins.hpp</a>, the include file.
</li>
<li>
<a href = "bins.sh">bins.sh</a>,
commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "bins_prb.cpp">bins_prb.cpp</a>,
a sample calling program.
</li>
<li>
<a href = "bins_prb.sh">bins_prb.sh</a>,
commands to compile and run the sample program.
</li>
<li>
<a href = "bins_prb_output.txt">bins_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>BIN_SEARCH_ONE_2D</b> searches one cell in a 2D array of bins.
</li>
<li>
<b>BIN_TO_R8_EVEN</b> returns the limits for a given "bin" in [A,B].
</li>
<li>
<b>BIN_TO_R8_EVEN2</b> returns the limits for a given "bin" in [A,B].
</li>
<li>
<b>BIN_TO_R82_EVEN2</b> returns the limits for a given R82 "bin" in [A,B].
</li>
<li>
<b>BIN_TO_R82_EVEN3</b> returns the limits for a given R82 "bin" in [A,B].
</li>
<li>
<b>BIN_TO_R83_EVEN2</b> returns the limits for a given R83 "bin" in [A,B].
</li>
<li>
<b>BIN_TO_R83_EVEN3</b> returns the limits for a given R83 "bin" in [A,B].
</li>
<li>
<b>GET_SEED</b> returns a random seed for the random number generator.
</li>
<li>
<b>I4_MAX</b> returns the maximum of two I4's.
</li>
<li>
<b>I4_MAX</b> returns the smaller of two I4's.
</li>
<li>
<b>I4_MODP</b> returns the nonnegative remainder of I4 division.
</li>
<li>
<b>I4_SIGN</b> returns the sign of an I4.
</li>
<li>
<b>I4_SWAP</b> switches two I4's.
</li>
<li>
<b>I4_UNIFORM</b> returns a scaled pseudorandom I4.
</li>
<li>
<b>I4_WRAP</b> forces an I4 to lie between given limits by wrapping.
</li>
<li>
<b>I4MAT_PRINT</b> prints an I4MAT, with an optional title.
</li>
<li>
<b>I4MAT_PRINT_SOME</b> prints some of an I4MAT.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT</b> prints an I4MAT, transposed.
</li>
<li>
<b>I4MAT_TRANSPOSE_PRINT_SOME</b> prints some of an I4MAT, transposed.
</li>
<li>
<b>I4VEC_HEAP_D</b> reorders an I4VEC into a descending heap.
</li>
<li>
<b>I4VEC_INDICATOR</b> sets an I4VEC to the indicator vector.
</li>
<li>
<b>I4VEC_PRINT</b> prints an I4VEC.
</li>
<li>
<b>I4VEC_SORT_HEAP_A</b> ascending sorts an I4VEC using heap sort.
</li>
<li>
<b>I4VEC_SORTED_UNIQUE</b> finds unique elements in a sorted I4VEC.
</li>
<li>
<b>I4VEC2_COMPARE</b> compares pairs of integers stored in two I4VECs.
</li>
<li>
<b>I4VEC2_SORT_A</b> ascending sorts a vector of pairs of integers.
</li>
<li>
<b>I4VEC2_SORTED_UNIQUE</b> finds unique elements in a sorted I4VEC2.
</li>
<li>
<b>INDEX_BOX2_NEXT_2D</b> produces indices on the surface of a box in 2D.
</li>
<li>
<b>INDEX_BOX2_NEXT_3D</b> produces indices on the surface of a box in 3D.
</li>
<li>
<b>PERM_CHECK</b> checks that a vector represents a permutation.
</li>
<li>
<b>PERM_INV</b> inverts a permutation "in place".
</li>
<li>
<b>POINTS_NEAREST_POINT_NAIVE_2D</b> finds the nearest point to a given point in 2D.
</li>
<li>
<b>POINTS_NEAREST_POINT_NAIVE_3D</b> finds the nearest point to a given point in 3D.
</li>
<li>
<b>POINTS_NEAREST_POINT_NAIVE_ND</b> finds the nearest point to a given point in ND.
</li>
<li>
<b>POINTS_NEAREST_POINTS_NAIVE_2D</b> finds the nearest point to given points in 2D.
</li>
<li>
<b>POINTS_NEAREST_POINTS_NAIVE_3D</b> finds the nearest point to given points in 3D.
</li>
<li>
<b>R4_NINT</b> returns the nearest integer to an R4.
</li>
<li>
<b>R8_HUGE</b> returns a "huge" R8 value.
</li>
<li>
<b>R8_TO_BIN_EVEN</b> determines the appropriate "bin" for C in [A,B].
</li>
<li>
<b>R8_TO_BIN_EVEN2</b> determines the appropriate "bin" for C in [A,B].
</li>
<li>
<b>R8_UNIFORM</b> returns a scaled pseudorandom R8.
</li>
<li>
<b>R8_UNIFORM_01</b> returns a unit pseudorandom R8.
</li>
<li>
<b>R82_TO_BIN_EVEN2</b> determines the appropriate "bin" for an R82 value.
</li>
<li>
<b>R82_TO_BIN_EVEN3</b> determines the appropriate "bin" for an R82 value.
</li>
<li>
<b>R82_UNIFORM</b> returns a random R82 value in a given range.
</li>
<li>
<b>R82VEC_PART_QUICK_A</b> reorders an R82 vector as part of a quick sort.
</li>
<li>
<b>R82VEC_PERMUTE</b> permutes an R82VEC in place.
</li>
<li>
<b>R82VEC_PRINT</b> prints an R82VEC.
</li>
<li>
<b>R82VEC_SORT_HEAP_INDEX_A</b> does an indexed heap ascending sort of an R82VEC.
</li>
<li>
<b>R82VEC_SORT_QUICK_A</b> ascending sorts an R82VEC using quick sort.
</li>
<li>
<b>R82VEC_UNIFORM</b> returns a random R82VEC in a given range.
</li>
<li>
<b>R83_TO_BIN_EVEN2</b> determines the appropriate "bin" for an R83.
</li>
<li>
<b>R83_TO_BIN_EVEN3</b> determines the appropriate "bin" for an R83.
</li>
<li>
<b>R83VEC_PART_QUICK_A</b> reorders an R83VEC as part of a quick sort.
</li>
<li>
<b>R83VEC_SORT_QUICK_A</b> ascending sorts an R83VEC using quick sort.
</li>
<li>
<b>R83VEC_UNIFORM</b> returns a random R83VEC in a given range.
</li>
<li>
<b>R8MAT_PRINT</b> prints an R8MAT, with an optional title.
</li>
<li>
<b>R8MAT_PRINT_SOME</b> prints some of an R8MAT.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT</b> prints an R8MAT, transposed.
</li>
<li>
<b>R8MAT_TRANSPOSE_PRINT_SOME</b> prints some of an R8MAT, transposed.
</li>
<li>
<b>R8VEC_BRACKET</b> searches a sorted array for successive brackets of a value.
</li>
<li>
<b>R8VEC_EQ</b> is true if every pair of entries in two vectors is equal.
</li>
<li>
<b>R8VEC_GT</b> == ( A1 > A2 ) for real vectors.
</li>
<li>
<b>R8VEC_LT</b> == ( A1 < A2 ) for real vectors.
</li>
<li>
<b>R8VEC_PRINT</b> prints a R8VEC.
</li>
<li>
<b>R8VEC_SWAP</b> swaps the entries of two R8VEC's.
</li>
<li>
<b>R8VEC_UNIFORM</b> fills an R8VEC with scaled pseudorandom values.
</li>
<li>
<b>S_LEN_TRIM</b> returns the length of a string to the last nonblank.
</li>
<li>
<b>SORT_HEAP_EXTERNAL</b> externally sorts a list of items into ascending order.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
<li>
<b>TUPLE_NEXT2</b> computes the next element of an integer tuple space.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 28 January 2011.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>