-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathbins_prb.f90
1731 lines (1488 loc) · 50.6 KB
/
bins_prb.f90
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
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
program main
!*****************************************************************************80
!
!! BINS_PRB tests routines from the BINS library.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 12 October 2006
!
! Author:
!
! John Burkardt
!
implicit none
call timestamp ( )
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'BINS_PRB'
write ( *, '(a)' ) ' FORTRAN90 version'
write ( *, '(a)' ) ' Test the BINS library.'
call test01 ( )
call test02 ( )
call test03 ( )
call test04 ( )
call test05 ( )
call test05 ( )
call test07 ( )
call test08 ( )
call test09 ( )
call test10 ( )
call test11 ( )
call test12 ( )
call test13 ( )
call test14 ( )
call test15 ( )
call test16 ( )
!
! Terminate.
!
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'BINS_PRB'
write ( *, '(a)' ) ' Normal end of execution.'
write ( *, '(a)' ) ' '
call timestamp ( )
stop
end
subroutine test01 ( )
!*****************************************************************************80
!
!! TEST01 tests BIN_TO_R8_EVEN, R8_TO_BIN_EVEN.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
real ( kind = 8 ), parameter :: a = 10.0D+00
real ( kind = 8 ), parameter :: b = 20.0D+00
integer ( kind = 4 ) bin
real ( kind = 8 ) c
real ( kind = 8 ) cmax
real ( kind = 8 ) cmin
integer ( kind = 4 ) i
integer ( kind = 4 ), parameter :: nbin = 7
real ( kind = 8 ) r8_uniform
real ( kind = 8 ), parameter :: rmax = 23.0D+00
real ( kind = 8 ), parameter :: rmin = 8.0D+00
integer ( kind = 4 ) seed
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST01'
write ( *, '(a)' ) ' R8_TO_BIN_EVEN puts a number into a bin.'
write ( *, '(a)' ) ' BIN_TO_R8_EVEN returns the bin limits.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' The bins are equally spaced between A and B,'
write ( *, '(a)' ) ' with two extra bins, for things less than A,'
write ( *, '(a)' ) ' or greater than B.'
write ( *, '(a)' ) ' '
write ( *, '(a,g14.6)' ) ' A = ', a
write ( *, '(a,g14.6)' ) ' B = ', b
write ( *, '(a,i6)' ) ' Total number of bins = ', nbin
call get_seed ( seed )
write ( *, '(a)' ) ' '
write ( *, '(a,i12)' ) ' Using random seed = ', seed
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Generate some random values C and put them in bins.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' C Bin Bin_Min Bin_Max'
write ( *, '(a)' ) ' '
do i = 1, 30
c = r8_uniform ( rmin, rmax, seed )
call r8_to_bin_even ( nbin, a, b, c, bin )
call bin_to_r8_even ( nbin, bin, a, b, cmin, cmax )
write ( *, '(2x,g14.6,i4,2g14.6)' ) c, bin, cmin, cmax
end do
return
end
subroutine test02 ( )
!*****************************************************************************80
!
!! TEST02 tests BIN_TO_R8_EVEN2, R8_TO_BIN_EVEN2.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
real ( kind = 8 ), parameter :: a = 10.0D+00
real ( kind = 8 ), parameter :: b = 20.0D+00
integer ( kind = 4 ) bin
real ( kind = 8 ) c
real ( kind = 8 ) cmax
real ( kind = 8 ) cmin
integer ( kind = 4 ) i
integer ( kind = 4 ), parameter :: nbin = 5
real ( kind = 8 ) r8_uniform
real ( kind = 8 ), parameter :: rmax = 23.0D+00
real ( kind = 8 ), parameter :: rmin = 8.0D+00
integer ( kind = 4 ) seed
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST02'
write ( *, '(a)' ) ' BIN_TO_R8_EVEN2 returns the bin limits.'
write ( *, '(a)' ) ' R8_TO_BIN_EVEN2 puts a number into a bin.'
write ( *, '(a)' ) ' The bins are equally spaced between A and B.'
write ( *, '(a)' ) ' '
write ( *, '(a,g14.6)' ) ' A = ', a
write ( *, '(a,g14.6)' ) ' B = ', b
write ( *, '(a,i6)' ) ' Total number of bins = ', nbin
call get_seed ( seed )
write ( *, '(a)' ) ' '
write ( *, '(a,i12)' ) ' Using random seed = ', seed
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Generate some random values C and put them in bins.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' C Bin Bin_Min Bin_Max'
write ( *, '(a)' ) ' '
do i = 1, 30
c = r8_uniform ( rmin, rmax, seed )
call r8_to_bin_even2 ( nbin, a, b, c, bin )
call bin_to_r8_even2 ( nbin, bin, a, b, cmin, cmax )
write ( *, '(2x,g14.6,i4,2g14.6)' ) c, bin, cmin, cmax
end do
return
end
subroutine test03 ( )
!*****************************************************************************80
!
!! TEST03 tests BIN_TO_R82_EVEN, R82_TO_BIN_EVEN.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
real ( kind = 8 ), parameter, dimension ( 2 ) :: a = (/ 5.0D+00, 0.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 2 ) :: b = (/ 15.0D+00, 20.0D+00 /)
integer ( kind = 4 ) bin(2)
real ( kind = 8 ) c(2)
real ( kind = 8 ) cmax(2)
real ( kind = 8 ) cmin(2)
integer ( kind = 4 ) i
integer ( kind = 4 ), parameter :: nbin = 7
real ( kind = 8 ), parameter, dimension ( 2 ) :: rmin = (/ &
3.0D+00, -2.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 2 ) :: rmax = (/ &
23.0D+00, 21.0D+00 /)
integer ( kind = 4 ) seed
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST03'
write ( *, '(a)' ) ' BIN_TO_R82_EVEN returns the bin limits.'
write ( *, '(a)' ) ' R82_TO_BIN_EVEN puts a R82 number into a bin.'
write ( *, '(a)' ) ''
write ( *, '(a)' ) ' The bins are equally spaced between A and B,'
write ( *, '(a)' ) ' with two extra bins, for things less than A,'
write ( *, '(a)' ) ' or greater than B.'
write ( *, '(a)' ) ' '
write ( *, '(a,g14.6)' ) ' A(1) = ', a(1)
write ( *, '(a,g14.6)' ) ' B(1) = ', b(1)
write ( *, '(a,g14.6)' ) ' A(2) = ', a(2)
write ( *, '(a,g14.6)' ) ' B(2) = ', b(2)
write ( *, '(a,i6)' ) ' Total number of bins = ', nbin
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Generate some random values C and put them in bins.'
write ( *, '(a)' ) ' We list the X and Y components on separate lines.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' C Bin Bin_Min Bin_Max'
write ( *, '(a)' ) ' '
call get_seed ( seed )
do i = 1, 30
call r82_uniform ( rmin, rmax, seed, c )
call r82_to_bin_even ( nbin, a, b, c, bin )
call bin_to_r82_even ( nbin, bin, a, b, cmin, cmax )
write ( *, '(a)' ) ' '
write ( *, '(2x,g14.6,i4,2g14.6)' ) c(1), bin(1), cmin(1), cmax(1)
write ( *, '(2x,g14.6,i4,2g14.6)' ) c(2), bin(2), cmin(2), cmax(2)
end do
return
end
subroutine test04 ( )
!*****************************************************************************80
!
!! TEST04 tests R82VEC_BIN_EVEN, R82VEC_BINNED_REORDER, R82VEC_BINNED_SORT_A.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: n = 30
integer ( kind = 4 ), parameter :: nbin = 4
real ( kind = 8 ) a(2,n)
real ( kind = 8 ), parameter, dimension ( 2 ) :: amin = (/ &
8.0D+00, 3.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 2 ) :: amax = (/ &
23.0D+00, 12.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 2 ) :: bin_min = (/ &
10.0D+00, 5.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 2 ) :: bin_max = (/ &
20.0D+00, 10.0D+00 /)
integer ( kind = 4 ) bin_last(nbin,nbin)
integer ( kind = 4 ) bin_next(n)
integer ( kind = 4 ) bin_start(nbin,nbin)
integer ( kind = 4 ) i1
integer ( kind = 4 ) i2
integer ( kind = 4 ) j
integer ( kind = 4 ) k
integer ( kind = 4 ) seed
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST04'
write ( *, '(a)' ) ' R82VEC_BIN_EVEN constructs evenly spaced bins and'
write ( *, '(a)' ) ' assigns each element of a R82VEC to a bin.'
write ( *, '(a)' ) ' R82VEC_BINNED_REORDER can reorder the array'
write ( *, '(a)' ) ' to correspond to the bin ordering.'
write ( *, '(a)' ) ' R82VEC_BINNED_SORT_A can sort the individual bins'
write ( *, '(a)' ) ' after the array has been reordered.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' The bins are equally spaced between '
write ( *, '(a)' ) ' BIN_MIN and BIN_MAX,'
write ( *, '(a)' ) ' with two extra bins, for things less than BIN_MIN,'
write ( *, '(a)' ) ' or greater than BIN_MAX.'
write ( *, '(a)' ) ' '
write ( *, '(a,2g14.6)' ) ' Component 1 range: ', bin_min(1), bin_max(1)
write ( *, '(a,2g14.6)' ) ' Component 2 range: ', bin_min(2), bin_max(2)
write ( *, '(a)' ) ' '
write ( *, '(a,i6)' ) ' Number of bins per row and column = ', nbin
write ( *, '(a)' ) ' '
call get_seed ( seed )
call r82vec_uniform ( n, amin, amax, seed, a )
call r82vec_print ( n, a, ' The data vector A to be binned:' )
call r82vec_bin_even ( n, a, nbin, bin_min, bin_max, bin_start, bin_last, &
bin_next )
call i4mat_print ( nbin, nbin, bin_start, ' The BIN_START array:' )
call i4mat_print ( nbin, nbin, bin_start, ' The BIN_LAST array:' )
call i4vec_print ( n, bin_next, ' The BIN_NEXT array:' )
do i1 = 1, nbin
do i2 = 1, nbin
write ( *, '(a)' ) ' '
write ( *, '(a,2i6)' ) ' Contents of bin number ', i1, i2
write ( *, '(a)' ) ' '
j = bin_start(i1,i2)
k = 0
do while ( 0 < j )
k = k + 1
write ( *, '(2x,2i4,2g14.6)' ) k, j, a(1,j), a(2,j)
j = bin_next(j)
end do
end do
end do
!
! Now reorder the data to correspond to the bins.
!
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Call R82VEC_BINNED_REORDER to reorder the array.'
write ( *, '(a)' ) ' '
call r82vec_binned_reorder ( n, a, nbin, bin_start, bin_last, bin_next )
call r82vec_print ( n, a, ' The data vector, sorted by bins:' )
call i4mat_print ( nbin, nbin, bin_start, ' The BIN_START array:' )
call i4mat_print ( nbin, nbin, bin_last, ' The BIN_LAST array:' )
call i4vec_print ( n, bin_next, ' The BIN_NEXT array:' )
!
! Now sort the bins.
!
call r82vec_binned_sort_a ( n, a, nbin, bin_start, bin_last )
call r82vec_print ( n, a, ' The data vector, with sorted bins:' )
return
end
subroutine test05 ( )
!*****************************************************************************80
!
!! TEST05 tests R82VEC_PART_QUICK_A.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: n = 12
real ( kind = 8 ) a(2,n)
real ( kind = 8 ), parameter, dimension ( 2 ) :: alo = (/ 0.0D+00, 2.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 2 ) :: ahi = (/ 10.0D+00, 3.0D+00 /)
integer ( kind = 4 ) l
integer ( kind = 4 ) r
integer ( kind = 4 ) :: seed = 123456789
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST05'
write ( *, '(a)' ) ' R82VEC_PART_QUICK_A reorders an R82VEC'
write ( *, '(a)' ) ' as part of a quick sort.'
write ( *, '(a,i12)' ) ' Using initial random number seed = ', seed
call r82vec_uniform ( n, alo, ahi, seed, a )
call r82vec_print ( n, a, ' Before rearrangment:' )
call r82vec_part_quick_a ( n, a, l, r )
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Rearranged array'
write ( *, '(a,i6)' ) ' Left index = ', l
write ( *, '(a,i6)' ) ' Key index = ', l+1
write ( *, '(a,i6)' ) ' Right index = ', r
write ( *, '(a)' ) ' '
call r82vec_print ( l, a(1:2,1:l), ' Left half:' )
call r82vec_print ( 1, a(1:2,l+1), ' Key:' )
call r82vec_print ( n-l-1, a(1:2,l+2:n), ' Right half:' )
return
end
subroutine test06 ( )
!*****************************************************************************80
!
!! TEST06 tests R82VEC_SORT_QUICK_A.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: n = 12
real ( kind = 8 ) a(2,n)
real ( kind = 8 ), parameter, dimension ( 2 ) :: alo = (/ 0.0D+00, 2.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 2 ) :: ahi = (/ 10.0D+00, 3.0D+00 /)
integer ( kind = 4 ) :: seed = 123456789
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST06'
write ( *, '(a)' ) ' R82VEC_SORT_QUICK_A sorts an R82VEC'
write ( *, '(a)' ) ' using quick sort.'
write ( *, '(a,i12)' ) ' Using initial random number seed = ', seed
call r82vec_uniform ( n, alo, ahi, seed, a )
!
! For better testing, give a few elements the same first component.
!
a(1,3) = a(1,5)
a(1,4) = a(1,12)
!
! Make two entries equal.
!
a(1:2,7) = a(1:2,11)
call r82vec_print ( n, a, ' Before rearrangment:' )
call r82vec_sort_quick_a ( n, a )
call r82vec_print ( n, a, ' Sorted array:' )
return
end
subroutine test07 ( )
!*****************************************************************************80
!
!! TEST07 tests R83VEC_PART_QUICK_A.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: n = 12
real ( kind = 8 ) a(3,n)
real ( kind = 8 ), parameter, dimension ( 3 ) :: alo = (/ &
0.0D+00, 2.0D+00, 1.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 3 ) :: ahi = (/ &
10.0D+00, 3.0D+00, 3.0D+00 /)
integer ( kind = 4 ) l
integer ( kind = 4 ) r
integer ( kind = 4 ) :: seed = 123456789
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST07'
write ( *, '(a)' ) ' R83VEC_PART_QUICK_A reorders an R83VEC'
write ( *, '(a)' ) ' as part of a quick sort.'
write ( *, '(a,i12)' ) ' Using initial random number seed = ', seed
call r83vec_uniform ( n, alo, ahi, seed, a )
call r83vec_print ( n, a, ' Before rearrangment:' )
call r83vec_part_quick_a ( n, a, l, r )
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Rearranged array'
write ( *, '(a,i6)' ) ' Left index = ', l
write ( *, '(a,i6)' ) ' Key index = ', l+1
write ( *, '(a,i6)' ) ' Right index = ', r
write ( *, '(a)' ) ' '
call r83vec_print ( l, a(1:3,1:l), ' Left half:' )
call r83vec_print ( 1, a(1:3,l+1), ' Key:' )
call r83vec_print ( n-l-1, a(1:3,l+2:n), ' Right half:' )
return
end
subroutine test08 ( )
!*****************************************************************************80
!
!! TEST08 tests R83VEC_SORT_QUICK_A.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: n = 12
real ( kind = 8 ) a(3,n)
real ( kind = 8 ), parameter, dimension ( 3 ) :: alo = (/ &
0.0D+00, 2.0D+00, 1.0D+00 /)
real ( kind = 8 ), parameter, dimension ( 3 ) :: ahi = (/ &
10.0D+00, 3.0D+00, 3.0D+00 /)
integer ( kind = 4 ) :: seed = 123456789
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST08'
write ( *, '(a)' ) ' R83VEC_SORT_QUICK_A sorts an R83VEC'
write ( *, '(a)' ) ' using quick sort.'
write ( *, '(a,i12)' ) ' Using initial random number seed = ', seed
call r83vec_uniform ( n, alo, ahi, seed, a )
!
! Give two elements the same first component.
!
a(1,3) = a(1,5)
!
! Give two elements the same first two components.
!
a(1:2,4) = a(1:2,12)
!
! Make two entries equal.
!
a(1:3,7) = a(1:3,11)
call r83vec_print ( n, a, ' Before rearrangment:' )
call r83vec_sort_quick_a ( n, a )
call r83vec_print ( n, a, ' Sorted array:' )
return
end
subroutine test09 ( )
!*****************************************************************************80
!
!! TEST09 tests R8VEC_BIN.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: n = 25
integer ( kind = 4 ), parameter :: nbin = 5
integer ( kind = 4 ) bin(0:nbin+1)
real ( kind = 8 ) bin_limit(0:nbin)
real ( kind = 8 ) bin_max
real ( kind = 8 ) bin_min
integer ( kind = 4 ) i
integer ( kind = 4 ) seed
real ( kind = 8 ) x(n)
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST09'
write ( *, '(a)' ) ' R8VEC_BIN computes bins for an R8VEC.'
call get_seed ( seed )
call r8vec_uniform ( n, -2.0D+00, 11.0D+00, seed, x )
call r8vec_print ( n, x, ' The vector to be binned:' )
bin_min = 0.0D+00
bin_max = 10.0D+00
write ( *, '(a)' ) ' '
write ( *, '(a,i6)' ) ' Number of bins is ', nbin
write ( *, '(a,g14.6)' ) ' Bin minimum is ', bin_min
write ( *, '(a,g14.6)' ) ' Bin maximum is ', bin_max
call r8vec_bin ( n, x, nbin, bin_min, bin_max, bin, bin_limit )
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Lower Limit Upper Limit Count'
write ( *, '(a)' ) ' '
write ( *, '(2x,2f8.4,i4)' ) bin_min, bin_limit(0), bin(0)
do i = 1, nbin
write ( *, '(2x,2f8.4,i4)' ) bin_limit(i-1), bin_limit(i), bin(i)
end do
write ( *, '(2x,f8.4,8x,i4)' ) bin_limit(nbin), bin(nbin+1)
return
end
subroutine test10 ( )
!*****************************************************************************80
!
!! TEST10 tests R8VEC_BIN_EVEN, R8VEC_BINNED_REORDER, R8VEC_BINNED_SORT_A.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: n = 30
integer ( kind = 4 ), parameter :: nbin = 7
real ( kind = 8 ) a(n)
real ( kind = 8 ), parameter :: amax = 23.0D+00
real ( kind = 8 ), parameter :: amin = 8.0D+00
real ( kind = 8 ), parameter :: bin_max = 20.0D+00
real ( kind = 8 ), parameter :: bin_min = 10.0D+00
integer ( kind = 4 ) bin_last(nbin)
integer ( kind = 4 ) bin_next(n)
integer ( kind = 4 ) bin_start(nbin)
integer ( kind = 4 ) i
integer ( kind = 4 ) j
integer ( kind = 4 ) k
integer ( kind = 4 ) seed
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST10'
write ( *, '(a)' ) ' R8VEC_BIN_EVEN constructs evenly spaced bins and'
write ( *, '(a)' ) ' assigns each element of a DVEC to a bin.'
write ( *, '(a)' ) ' R8VEC_BINNED_REORDER can reorder the array'
write ( *, '(a)' ) ' to correspond to the bin ordering.'
write ( *, '(a)' ) ' R8VEC_BINNED_SORT_A can sort the array'
write ( *, '(a)' ) ' once it has been reordered.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' The bins are equally spaced between '
write ( *, '(a)' ) ' BIN_MIN and BIN_MAX,'
write ( *, '(a)' ) ' with two extra bins, for things less than BIN_MIN,'
write ( *, '(a)' ) ' or greater than BIN_MAX.'
write ( *, '(a)' ) ' '
write ( *, '(a,g14.6)' ) ' BIN_MIN = ', bin_min
write ( *, '(a,g14.6)' ) ' BIN_MAX = ', bin_max
write ( *, '(a,i6)' ) ' Total number of bins = ', nbin
write ( *, '(a)' ) ' '
call get_seed ( seed )
call r8vec_uniform ( n, amin, amax, seed, a )
call r8vec_print ( n, a, ' The data vector A to be binned:' )
call r8vec_bin_even ( n, a, nbin, bin_min, bin_max, bin_start, &
bin_last, bin_next )
call i4vec_print ( nbin, bin_start, ' The BIN_START array:' )
call i4vec_print ( nbin, bin_last, ' The BIN_LAST array:' )
call i4vec_print ( n, bin_next, ' The BIN_NEXT array:' )
do i = 1, nbin
write ( *, '(a)' ) ' '
write ( *, '(a,i6)' ) ' Contents of bin number ', i
write ( *, '(a)' ) ' '
j = bin_start(i)
k = 0
do while ( 0 < j )
k = k + 1
write ( *, '(2x,2i4,g14.6)' ) k, j, a(j)
j = bin_next(j)
end do
end do
!
! Now reorder the data to correspond to the bins.
!
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Call R8VEC_BINNED_REORDER to reorder the array.'
write ( *, '(a)' ) ' '
call r8vec_binned_reorder ( n, a, nbin, bin_start, bin_last, bin_next )
call r8vec_print ( n, a, ' The data vector A:' )
call i4vec_print ( nbin, bin_start, ' The BIN_START array:' )
call i4vec_print ( nbin, bin_last, ' The BIN_LAST array:' )
call i4vec_print ( n, bin_next, ' The BIN_NEXT array:' )
!
! Now sort the data, one bin at a time
!
call r8vec_binned_sort_a ( n, a, nbin, bin_start, bin_last )
call r8vec_print ( n, a, ' The sorted data vector A:' )
return
end
subroutine test11 ( )
!*****************************************************************************80
!
!! TEST11 tests POINTS_NEAREST_POINT_BINS_2D, POINTS_NEAREST_POINT_BINS_2D_2,
! POINTS_NEAREST_POINT_BINS_2D_3, POINTS_NEAREST_POINT_NAIVE_2D.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: ndim = 2
integer ( kind = 4 ), parameter :: nbin = 10
integer ( kind = 4 ), parameter, dimension ( ndim ) :: nbin2 = (/ 20, 5 /)
integer ( kind = 4 ), parameter :: nset = 1000
integer ( kind = 4 ), parameter :: ntest = 10
real ( kind = 8 ), parameter, dimension ( ndim ) :: bin_min = (/ &
0.0D+00, 0.0D+00 /)
real ( kind = 8 ), parameter, dimension ( ndim ) :: bin_max = (/ &
20.0D+00, 5.0D+00 /)
integer ( kind = 4 ) bin_last(nbin,nbin)
integer ( kind = 4 ) bin_last2(nbin2(1),nbin2(2))
integer ( kind = 4 ) bin_next(nset)
integer ( kind = 4 ) bin_next2(nset)
integer ( kind = 4 ) bin_start(nbin,nbin)
integer ( kind = 4 ) bin_start2(nbin2(1),nbin2(2))
integer ( kind = 4 ) compares
real ( kind = 8 ) d_min
logical :: debug = .false.
integer ( kind = 4 ) i
integer ( kind = 4 ) i_min
real ( kind = 8 ) p(ndim)
real ( kind = 8 ) pset(ndim,nset)
real ( kind = 8 ) pset2(ndim,nset)
integer ( kind = 4 ) :: seed = 123456789
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST11'
write ( *, '(a)' ) ' Given a point in 2D, we want to find its nearest'
write ( *, '(a)' ) ' neighbor among points in a set.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' POINTS_NEAREST_POINT_NAIVE_2D uses a naive algorithm.'
write ( *, '(a)' ) ' POINTS_NEAREST_POINT_BINS_2D and'
write ( *, '(a)' ) ' POINTS_NEAREST_POINT_BINS_2D_2 use bins, but require'
write ( *, '(a)' ) ' the same number in each direction.'
write ( *, '(a)' ) ' POINTS_NEAREST_POINT_BINS_2D_3 uses bins, and can use'
write ( *, '(a)' ) ' a different number in each direction.'
write ( *, '(a)' ) ' '
write ( *, '(a,i6)' ) ' The number of points in the pointset is ', nset
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' POINTS_NEAREST_POINT_BINS_2D and'
write ( *, '(a,i6)' ) ' POINTS_NEAREST_POINT_BINS_2D_2 use ', nbin
write ( *, '(a)' ) ' bins in each direction.'
write ( *, '(a,2i6)' ) ' POINTS_NEAREST_POINT_BINS_2D_3 uses ', nbin2(1:ndim)
write ( *, '(a)' ) ' bins in each direction.'
write ( *, '(a)' ) ' '
write ( *, '(a,2g14.6)' ) ' The X coordinate range: ', bin_min(1), bin_max(1)
write ( *, '(a,2g14.6)' ) ' The Y coordinate range: ', bin_min(2), bin_max(2)
write ( *, '(a)' ) ' '
write ( *, '(a,2g14.6)' ) ' Test point X range: ', bin_min(1), bin_max(1)
write ( *, '(a,2g14.6)' ) ' Test point Y range: ', bin_min(2), bin_max(2)
!
! Set the pointset.
!
call r82vec_uniform ( nset, bin_min, bin_max, seed, pset )
!
! We need to make a copy of the point set, because it gets sorted.
!
pset2(1:ndim,1:nset) = pset(1:ndim,1:nset)
!
! For the POINTS_NEAREST_POINT_BINS_2D code:
!
! Implicitly bin the data
! Explicitly reorder the data by bins.
! Within each bin, sort the data.
!
call r82vec_bin_even2 ( nset, pset, nbin, bin_min, bin_max, bin_start, &
bin_last, bin_next )
call r82vec_binned_reorder ( nset, pset, nbin, bin_start, bin_last, bin_next )
call r82vec_binned_sort_a ( nset, pset, nbin, bin_start, bin_last )
!
! For the POINTS_NEAREST_POINT_BINS_2D_3 code:
!
! Implicitly bin the data
! Explicitly reorder the data by bins.
! Within each bin, sort the data.
!
call r82vec_bin_even3 ( nset, pset2, nbin2, bin_min, bin_max, bin_start2, &
bin_last2, bin_next2 )
call r82vec_binned_reorder2 ( nset, pset2, nbin2, bin_start2, bin_last2, &
bin_next2 )
call r82vec_binned_sort_a2 ( nset, pset2, nbin2, bin_start2, bin_last2 )
!
! Seek nearest neighbors.
!
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' Test point Neighbor point Distance'
write ( *, '(a)' ) '-------------------- -------------------- ----------'
write ( *, '(a)' ) ' '
do i = 1, ntest
call r82_uniform ( bin_min, bin_max, seed, p )
write ( *, '(a)' ) ' '
call points_nearest_point_naive_2d ( nset, pset, p, i_min, d_min )
compares = nset
write ( *, '(2x,2f10.4,2x,2f10.4,2x,f10.4,2x,i4)' ) p(1:ndim), &
pset(1:ndim,i_min), d_min, compares
call points_nearest_point_bins_2d ( nset, pset, nbin, bin_min, bin_max, &
bin_start, bin_last, bin_next, p, i_min, d_min, compares )
write ( *, '(2x,2f10.4,2x,2f10.4,2x,f10.4,2x,i4)' ) p(1:ndim), &
pset(1:ndim,i_min), d_min, compares
call points_nearest_point_bins_2d_2 ( nset, pset, nbin, bin_min, bin_max, &
bin_start, bin_last, bin_next, p, i_min, d_min, compares )
write ( *, '(2x,2f10.4,2x,2f10.4,2x,f10.4,2x,i4)' ) p(1:ndim), &
pset(1:ndim,i_min), d_min, compares
call points_nearest_point_bins_2d_3 ( nset, pset2, nbin2, bin_min, &
bin_max, bin_start2, bin_last2, bin_next2, p, i_min, d_min, compares )
write ( *, '(2x,2f10.4,2x,2f10.4,2x,f10.4,2x,i4)' ) p(1:ndim), &
pset(1:ndim,i_min), d_min, compares
end do
return
end
subroutine test12 ( )
!*****************************************************************************80
!
!! TEST12 tests POINTS_NEAREST_POINTS_BINS_2D, POINTS_NEAREST_POINTS_BINS_2D_2,
! POINTS_NEAREST_POINTS_BINS_2D_3, POINTS_NEAREST_POINTS_NAIVE_2D.
!
! Licensing:
!
! This code is distributed under the GNU LGPL license.
!
! Modified:
!
! 23 July 2008
!
! Author:
!
! John Burkardt
!
implicit none
integer ( kind = 4 ), parameter :: ndim = 2
integer ( kind = 4 ), parameter :: nbin = 10
integer ( kind = 4 ), parameter, dimension ( ndim ) :: nbin2 = (/ 10, 10 /)
integer ( kind = 4 ), parameter :: nset = 1000
integer ( kind = 4 ), parameter :: ntest = 100
real ( kind = 8 ), parameter, dimension ( ndim ) :: bin_min = (/ &
0.0D+00, 0.0D+00 /)
real ( kind = 8 ), parameter, dimension ( ndim ) :: bin_max = (/ &
10.0D+00, 10.0D+00 /)
integer ( kind = 4 ) bin_last(nbin,nbin)
integer ( kind = 4 ) bin_last2(nbin2(1),nbin2(2))
integer ( kind = 4 ) bin_next(nset)
integer ( kind = 4 ) bin_next2(nset)
integer ( kind = 4 ) bin_start(nbin,nbin)
integer ( kind = 4 ) bin_start2(nbin2(1),nbin2(2))
integer ( kind = 4 ) clock_count1
integer ( kind = 4 ) clock_count2
integer ( kind = 4 ) clock_count3
integer ( kind = 4 ) clock_count4
integer ( kind = 4 ) clock_count5
integer ( kind = 4 ) clock_count6
integer ( kind = 4 ) clock_max
integer ( kind = 4 ) clock_rate
integer ( kind = 4 ) compares(ntest)
real ( kind = 8 ) d_min0(ntest)
real ( kind = 8 ) d_min1(ntest)
real ( kind = 8 ) d_min2(ntest)
real ( kind = 8 ) d_min3(ntest)
real ( kind = 8 ) eps
integer ( kind = 4 ) i
integer ( kind = 4 ) i_min0(ntest)
integer ( kind = 4 ) i_min1(ntest)
integer ( kind = 4 ) i_min2(ntest)
integer ( kind = 4 ) i_min3(ntest)
integer ( kind = 4 ) n_different
real ( kind = 8 ) pset(ndim,nset)
real ( kind = 8 ) ptest(ndim,ntest)
integer ( kind = 4 ) :: seed = 123456789
write ( *, '(a)' ) ' '
write ( *, '(a)' ) 'TEST12'
write ( *, '(a)' ) ' Given a point set in 2D, and a set of test points,'
write ( *, '(a)' ) ' for each testpoint, find the nearest neighbor in'
write ( *, '(a)' ) ' the point set.'
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' POINTS_NEAREST_POINTS_NAIVE_2D uses a naive algorithm.'
write ( *, '(a)' ) ' POINTS_NEAREST_POINTS_BINS_2D uses equal bins.'
write ( *, '(a)' ) ' POINTS_NEAREST_POINTS_BINS_2D_2 uses equal bins.'
write ( *, '(a)' ) ' POINTS_NEAREST_POINTS_BINS_2D_3 uses variable bins.'
write ( *, '(a)' ) ' '
write ( *, '(a,i6)' ) ' The number of points in the pointset is ', nset
write ( *, '(a,i6)' ) ' The number of points in the test set is ', ntest
write ( *, '(a)' ) ' '
write ( *, '(a)' ) ' POINTS_NEAREST_POINTS_BINS_2D and '
write ( *, '(a,i6)' ) ' POINTS_NEAREST_POINTS_BINS_2D_2 use ', nbin
write ( *, '(a)' ) ' bins in each direction.'
write ( *, '(a,2i6)' ) ' POINTS_NEAREST_POINTS_BINS_2D_3 uses ', &
nbin2(1:ndim)
write ( *, '(a)' ) ' bins in each direction.'
write ( *, '(a)' ) ' '
write ( *, '(a,2g14.6)' ) ' The X coordinate range: ', bin_min(1), bin_max(1)
write ( *, '(a,2g14.6)' ) ' The Y coordinate range: ', bin_min(2), bin_max(2)