/[dtapublic]/projs/trunk/projs/20161014_cfbrapab/c_main.c
ViewVC logotype

Diff of /projs/trunk/projs/20161014_cfbrapab/c_main.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 45 by dashley, Fri Oct 14 02:15:26 2016 UTC revision 71 by dashley, Sat Nov 5 11:07:06 2016 UTC
# Line 1  Line 1 
1  // $Header: /cvsroot/esrg/sfesrg/esrgpcpj/cfbrapab/c_main.c,v 1.6 2002/01/27 17:58:15 dtashley Exp $  // $Header: svn://localhost/dtapublic/projs/trunk/projs/20161014_cfbrapab/cfbrapab.cpp 47 2016-10-17 00:04:56Z dashley $
2    //-------------------------------------------------------------------------------------------------
3  //--------------------------------------------------------------------------------  //This file is part of "cfbrapab", a program for determining the best rational approximation to a
4  //Copyright 2008 David T. Ashley  //real number, subject to constraints on the numerator and denominator, using continued fraction
5  //-------------------------------------------------------------------------------------------------  //algorithms.
6  //This source code and any program in which it is compiled/used is provided under the GNU GENERAL  //-------------------------------------------------------------------------------------------------
7  //PUBLIC LICENSE, Version 3, full license text below.  //This source code and any program in which it is compiled/used is provided under the MIT License,
8  //-------------------------------------------------------------------------------------------------  //reproduced below.
9  //                    GNU GENERAL PUBLIC LICENSE  //-------------------------------------------------------------------------------------------------
10  //                       Version 3, 29 June 2007  //Permission is hereby granted, free of charge, to any person obtaining a copy of
11  //  //this software and associated documentation files(the "Software"), to deal in the
12  // Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>  //Software without restriction, including without limitation the rights to use,
13  // Everyone is permitted to copy and distribute verbatim copies  //copy, modify, merge, publish, distribute, sublicense, and / or sell copies of the
14  // of this license document, but changing it is not allowed.  //Software, and to permit persons to whom the Software is furnished to do so,
15  //  //subject to the following conditions :
16  //                            Preamble  //
17  //  //The above copyright notice and this permission notice shall be included in all
18  //  The GNU General Public License is a free, copyleft license for  //copies or substantial portions of the Software.
19  //software and other kinds of works.  //
20  //  //THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
21  //  The licenses for most software and other practical works are designed  //IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
22  //to take away your freedom to share and change the works.  By contrast,  //FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
23  //the GNU General Public License is intended to guarantee your freedom to  //AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
24  //share and change all versions of a program--to make sure it remains free  //LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
25  //software for all its users.  We, the Free Software Foundation, use the  //OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
26  //GNU General Public License for most of our software; it applies also to  //SOFTWARE.
27  //any other work released this way by its authors.  You can apply it to  //-------------------------------------------------------------------------------------------------
28  //your programs, too.  #include <assert.h>
29  //  #include <malloc.h>
30  //  When we speak of free software, we are referring to freedom, not  #include <process.h>
31  //price.  Our General Public Licenses are designed to make sure that you  #include <stdio.h>
32  //have the freedom to distribute copies of free software (and charge for  #include <string.h>
33  //them if you wish), that you receive source code or can get it if you  #include <time.h>
34  //want it, that you can change the software or use pieces of it in new  
35  //free programs, and that you know you can do these things.  
36  //  #include "bstrfunc.h"
37  //  To protect your rights, we need to prevent others from denying you  #include "ccmalloc.h"
38  //these rights or asking you to surrender the rights.  Therefore, you have  #include "ccmfatal.h"
39  //certain responsibilities if you distribute copies of the software, or if  #include "charfunc.h"
40  //you modify it: responsibilities to respect the freedom of others.  #include "cu_msgs.h"
41  //  #include "fcmiof.h"
42  //  For example, if you distribute copies of such a program, whether  #include "gmp_ints.h"
43  //gratis or for a fee, you must pass on to the recipients the same  #include "gmp_rats.h"
44  //freedoms that you received.  You must make sure that they, too, receive  #include "gmp_ralg.h"
45  //or can get the source code.  And you must show them these terms so they  #include "intfunc.h"
46  //know their rights.  
47  //  
48  //  Developers that use the GNU GPL protect your rights with two steps:  #define PNAME "cfbrapab"
49  //(1) assert copyright on the software, and (2) offer you this License  #define PNAMEUC "CFBRAPAB"
50  //giving you legal permission to copy, distribute and/or modify it.  
51  //  
52  //  For the developers' and authors' protection, the GPL clearly explains  const char *C_MAIN_cvcinfo(void)
53  //that there is no warranty for this free software.  For both users' and     {
54  //authors' sake, the GPL requires that modified versions be marked as     return("$Header: /cvsroot/esrg/sfesrg/esrgpcpj/cfbrapab/c_main.c,v 1.6 2002/01/27 17:58:15 dtashley Exp $");
55  //changed, so that their problems will not be attributed erroneously to     }
56  //authors of previous versions.  
57  //  
58  //  Some devices are designed to deny users access to install or run  //This is a NULL-terminated table of pointers to functions
59  //modified versions of the software inside them, although the manufacturer  //which return version control strings for all of the files
60  //can do so.  This is fundamentally incompatible with the aim of  //which make up the INTFAC program.  This information would
61  //protecting users' freedom to change the software.  The systematic  //be helpful for debugging.
62  //pattern of such abuse occurs in the area of products for individuals to  static const char *(*C_MAIN_vcinfoptrs[])(void) =
63  //use, which is precisely where it is most unacceptable.  Therefore, we     {
64  //have designed this version of the GPL to prohibit the practice for those     //This is the main module, should come first.
65  //products.  If such problems arise substantially in other domains, we     C_MAIN_cvcinfo,
66  //stand ready to extend this provision to those domains in future versions  
67  //of the GPL, as needed to protect the freedom of users.     //And now the others, in alphabetical order.
68  //     BSTRFUNC_hvcinfo,
69  //  Finally, every program is threatened constantly by software patents.     BSTRFUNC_cvcinfo,
70  //States should not allow patents to restrict development and use of     CCMALLOC_hvcinfo,
71  //software on general-purpose computers, but in those that do, we wish to     CCMALLOC_cvcinfo,
72  //avoid the special danger that patents applied to a free program could     CCMFATAL_hvcinfo,
73  //make it effectively proprietary.  To prevent this, the GPL assures that     CCMFATAL_cvcinfo,
74  //patents cannot be used to render the program non-free.     CHARFUNC_hvcinfo,
75  //     CHARFUNC_cvcinfo,
76  //  The precise terms and conditions for copying, distribution and     CU_MSGS_hvcinfo,
77  //modification follow.     CU_MSGS_cvcinfo,
78  //     FCMIOF_hvcinfo,
79  //                       TERMS AND CONDITIONS     FCMIOF_cvcinfo,
80  //     GMP_INTS_hvcinfo,
81  //  0. Definitions.     GMP_INTS_cvcinfo,
82  //     GMP_RALG_hvcinfo,
83  //  "This License" refers to version 3 of the GNU General Public License.     GMP_RALG_cvcinfo,
84  //     GMP_RATS_hvcinfo,
85  //  "Copyright" also means copyright-like laws that apply to other kinds of     GMP_RATS_cvcinfo,
86  //works, such as semiconductor masks.     INTFUNC_hvcinfo,
87  //     INTFUNC_cvcinfo,
88  //  "The Program" refers to any copyrightable work licensed under this     NULL
89  //License.  Each licensee is addressed as "you".  "Licensees" and     };
90  //"recipients" may be individuals or organizations.  
91  //  
92  //  To "modify" a work means to copy from or adapt all or part of the work  //This is the structure type used to hold information about all the
93  //in a fashion requiring copyright permission, other than the making of an  //command-line parameters.
94  //exact copy.  The resulting work is called a "modified version" of the  //
95  //earlier work or a work "based on" the earlier work.  struct CfbrapabCmainStruct
96  //     {
97  //  A "covered work" means either the unmodified Program or a work based     GMP_RATS_mpq_struct rn;
98  //on the Program.        //The rational number specified on the command line.
99  //        //symmetry.
100  //  To "propagate" a work means to do anything with it that, without     GMP_INTS_mpz_struct kmax;
101  //permission, would make you directly or secondarily liable for        //The value of KMAX specified on the command line.  This must always
102  //infringement under applicable copyright law, except executing it on a        //be present.
103  //computer or modifying a private copy.  Propagation includes copying,     int hmax_specified;
104  //distribution (with or without modification), making available to the        //TRUE if HMAX is specified in addition to KMAX.  KMAX is mandatory
105  //public, and in some countries other activities as well.        //in all cases.
106  //     GMP_INTS_mpz_struct hmax;
107  //  To "convey" a work means any kind of propagation that enables other        //The value of HMAX if it is specified.  This is optional.  This will be
108  //parties to make or receive copies.  Mere interaction with a user through        //set to zero if it is not present on the command line.
109  //a computer network, with no transfer of a copy, is not conveying.     int neversmaller_specified;
110  //        //TRUE if the -neversmaller option is specified on the command line.
111  //  An interactive user interface displays "Appropriate Legal Notices"     int neverlarger_specified;
112  //to the extent that it includes a convenient and prominently visible        //TRUE if the -neverlarger option is specified on the command line.
113  //feature that (1) displays an appropriate copyright notice, and (2)     int pred_specified;
114  //tells the user that there is no warranty for the work (except to the        //TRUE if the -pred option is specified on the command line.
115  //extent that warranties are provided), that licensees may convey the     int succ_specified;
116  //work under this License, and how to view a copy of this License.  If        //TRUE if the -succ option specified on the command line.
117  //the interface presents a list of user commands or options, such as a     int n_specified;
118  //menu, a prominent item in the list meets this criterion.        //TRUE if the -n parameter is specified on the command line.
119  //     unsigned n;
120  //  1. Source Code.        //The value of n if it has been specified.
121  //     CU_MSGS_std_cmd_line_par_results_struct argblock;
122  //  The "source code" for a work means the preferred form of the work        //The block holding the options which are common across all
123  //for making modifications to it.  "Object code" means any non-source        //of these command-line utilities.
124  //form of a work.     };
125  //  
126  //  A "Standard Interface" means an interface that either is an official  
127  //standard defined by a recognized standards body, or, in the case of  //Processes the command-line parameters, and abstracts it to a
128  //interfaces specified for a particular programming language, one that  //the contents of a structure plus a failure flag.
129  //is widely used among developers working in that language.  static void process_command_line_args(struct CfbrapabCmainStruct *parblock,
130  //                                       int argc,
131  //  The "System Libraries" of an executable work include anything, other                                       char* argv[])
132  //than the work as a whole, that (a) is included in the normal form of     {
133  //packaging a Major Component, but which is not part of that Major     int error_flag;
134  //Component, and (b) serves only to enable use of the work with that     int first_dashed_parameter;
135  //Major Component, or to implement a Standard Interface for which an     int i;
136  //implementation is available to the public in source code form.  A     int recognized;
137  //"Major Component", in this context, means a major essential component  
138  //(kernel, window system, and so on) of the specific operating system     //Eyeball the input parameters.
139  //(if any) on which the executable work runs, or a compiler used to     assert(parblock != NULL);
140  //produce the work, or an object code interpreter used to run it.     assert(argc >= 1);
141  //     assert(argv != NULL);
142  //  The "Corresponding Source" for a work in object code form means all  
143  //the source code needed to generate, install, and (for an executable     //We have to have at least 3 total parameters.  However, this is covered
144  //work) run the object code and to modify the work, including scripts to     //in main().
145  //control those activities.  However, it does not include the work's  
146  //System Libraries, or general-purpose tools or generally available free     //Process the first parameter, which has to be the rational number we
147  //programs which are used unmodified in performing those activities but     //want to approximate.  If there is a problem, give a helpful message
148  //which are not part of the work.  For example, Corresponding Source     //and exit with an error code.
149  //includes interface definition files associated with source files for     GMP_RATS_mpq_init(&(parblock->rn));
150  //the work, and the source code for shared libraries and dynamically     GMP_RATS_mpq_set_all_format_rat_num( argv[1],
151  //linked subprograms that the work is specifically designed to require,                                         &error_flag,
152  //such as by intimate data communication or control flow between those                                         &(parblock->rn));
153  //subprograms and other parts of the work.  
154  //     //If there was a parse error, announce and abort.
155  //  The Corresponding Source need not include anything that users     if (error_flag || GMP_RATS_mpq_is_nan(&(parblock->rn)))
156  //can regenerate automatically from other parts of the Corresponding        {
157  //Source.        printf("\"%s\" is not a properly formatted rational number.\n", argv[1]);
158  //        exit(4);
159  //  The Corresponding Source for a work in source code form is that        }
160  //same work.  
161  //     //Normalize the rational number specified as input.  It is allowed to
162  //  2. Basic Permissions.     //be negative.
163  //     GMP_RATS_mpq_normalize(&(parblock->rn));
164  //  All rights granted under this License are granted for the term of  
165  //copyright on the Program, and are irrevocable provided the stated     //The next item has to be a number, it has to be
166  //conditions are met.  This License explicitly affirms your unlimited     //an integer, it has to be positive, and it
167  //permission to run the unmodified Program.  The output from running a     //is KMAX.  Parse out that.  If there are any
168  //covered work is covered by this License only if the output, given its     //errors, abort.
169  //content, constitutes a covered work.  This License acknowledges your     GMP_INTS_mpz_init(&(parblock->kmax));
170  //rights of fair use or other equivalent, as provided by copyright law.     GMP_INTS_mpz_set_general_int(&(parblock->kmax), &error_flag, argv[2]);
171  //     if (error_flag || GMP_INTS_mpz_is_zero(&(parblock->kmax)) || GMP_INTS_mpz_is_neg(&(parblock->kmax)))
172  //  You may make, run and propagate covered works that you do not        {
173  //convey, without conditions so long as your license otherwise remains        printf("\"%s\" is not a properly formatted positive integer.\n", argv[2]);
174  //in force.  You may convey covered works to others for the sole purpose        exit(4);
175  //of having them make modifications exclusively for you, or provide you        }
176  //with facilities for running those works, provided that you comply with  
177  //the terms of this License in conveying all material for which you do     //Unconditionally allocate space for hmax.
178  //not control copyright.  Those thus making or running the covered works     GMP_INTS_mpz_init(&(parblock->hmax));
179  //for you must do so exclusively on your behalf, under your direction  
180  //and control, on terms that prohibit them from making any copies of     //If there is a third parameter, it can be two things.  It can
181  //your copyrighted material outside their relationship with you.     //be either HMAX, or it can be the start of the parameters
182  //     //with dashes.  First, let's decide which case applies.
183  //  Conveying under any other circumstances is permitted solely under     if (argc <= 3)
184  //the conditions stated below.  Sublicensing is not allowed; section 10        {
185  //makes it unnecessary.        first_dashed_parameter = 3;
186  //        parblock->hmax_specified = 0;
187  //  3. Protecting Users' Legal Rights From Anti-Circumvention Law.        }
188  //     else
189  //  No covered work shall be deemed part of an effective technological        {
190  //measure under any applicable law fulfilling obligations under article        if (argv[3][0] == '-')
191  //11 of the WIPO copyright treaty adopted on 20 December 1996, or           {
192  //similar laws prohibiting or restricting circumvention of such           first_dashed_parameter = 3;
193  //measures.           parblock->hmax_specified = 0;
194  //           }
195  //  When you convey a covered work, you waive any legal power to forbid        else
196  //circumvention of technological measures to the extent such circumvention           {
197  //is effected by exercising rights under this License with respect to           first_dashed_parameter = 4;
198  //the covered work, and you disclaim any intention to limit operation or           parblock->hmax_specified = 1;
199  //modification of the work as a means of enforcing, against the work's  
200  //users, your or third parties' legal rights to forbid circumvention of           GMP_INTS_mpz_set_general_int(&(parblock->hmax), &error_flag, argv[3]);
201  //technological measures.           if (error_flag || GMP_INTS_mpz_is_zero(&(parblock->hmax)) || GMP_INTS_mpz_is_neg(&(parblock->hmax)))
202  //              {
203  //  4. Conveying Verbatim Copies.              printf("\"%s\" is not a properly formatted positive integer.\n", argv[3]);
204  //              exit(4);
205  //  You may convey verbatim copies of the Program's source code as you              }
206  //receive it, in any medium, provided that you conspicuously and           }
207  //appropriately publish on each copy an appropriate copyright notice;        }
208  //keep intact all notices stating that this License and any  
209  //non-permissive terms added in accord with section 7 apply to the code;     //Loop through the remaining parameters, trying to process each
210  //keep intact all notices of the absence of any warranty; and give all     //one either as a parameter specific to this program or else
211  //recipients a copy of this License along with the Program.     //as a general parameter.
212  //     //
213  //  You may charge any price or no price for each copy that you convey,     //Initialize the internal general parameter block.
214  //and you may offer support or warranty protection for a fee.     CU_MSGS_cmd_line_par_results_struct_create(&(parblock->argblock));
215  //     parblock->neversmaller_specified = 0;
216  //  5. Conveying Modified Source Versions.     parblock->neverlarger_specified  = 0;
217  //     parblock->pred_specified         = 0;
218  //  You may convey a work based on the Program, or the modifications to     parblock->succ_specified         = 0;
219  //produce it from the Program, in the form of source code under the     parblock->n_specified            = 0;
220  //terms of section 4, provided that you also meet all of these conditions:     parblock->n                      = 0;
221  //  
222  //    a) The work must carry prominent notices stating that you modified     for (i=first_dashed_parameter; i<argc; i++)
223  //    it, and giving a relevant date.        {
224  //        if (!strcmp("-neversmaller", argv[i]))
225  //    b) The work must carry prominent notices stating that it is           {
226  //    released under this License and any conditions added under section           parblock->neversmaller_specified = 1;
227  //    7.  This requirement modifies the requirement in section 4 to           }
228  //    "keep intact all notices".        else if (!strcmp("-neverlarger", argv[i]))
229  //           {
230  //    c) You must license the entire work, as a whole, under this           parblock->neverlarger_specified = 1;
231  //    License to anyone who comes into possession of a copy.  This           }
232  //    License will therefore apply, along with any applicable section 7        else if (!strcmp("-pred", argv[i]))
233  //    additional terms, to the whole of the work, and all its parts,           {
234  //    regardless of how they are packaged.  This License gives no           parblock->pred_specified = 1;
235  //    permission to license the work in any other way, but it does not           }
236  //    invalidate such permission if you have separately received it.        else if (!strcmp("-succ", argv[i]))
237  //           {
238  //    d) If the work has interactive user interfaces, each must display           parblock->succ_specified = 1;
239  //    Appropriate Legal Notices; however, if the Program has interactive           }
240  //    interfaces that do not display Appropriate Legal Notices, your        else if (!strcmp("-n", argv[i]))
241  //    work need not make them do so.           {
242  //           parblock->n_specified = 1;
243  //  A compilation of a covered work with other separate and independent  
244  //works, which are not by their nature extensions of the covered work,           //To go along with -n, we have to have a next parameter.
245  //and which are not combined with it such as to form a larger program,           if (i == (argc-1))
246  //in or on a volume of a storage or distribution medium, is called an              {
247  //"aggregate" if the compilation and its resulting copyright are not              printf("The \"-n\" parameter must include a following count.\n");
248  //used to limit the access or legal rights of the compilation's users              exit(4);
249  //beyond what the individual works permit.  Inclusion of a covered work              }
250  //in an aggregate does not cause this License to apply to the other  
251  //parts of the aggregate.           //Bump i to index to next par.
252  //           i++;
253  //  6. Conveying Non-Source Forms.  
254  //           //Try to parse this as a UINT24.  It must be that.
255  //  You may convey a covered work in object code form under the terms           GMP_INTS_mpz_parse_into_uint32(&(parblock->n), &error_flag, argv[i]);
256  //of sections 4 and 5, provided that you also convey the  
257  //machine-readable Corresponding Source under the terms of this License,           //If it couldn't be parsed as an integer, flunk it.
258  //in one of these ways:           if (error_flag)
259  //              {
260  //    a) Convey the object code in, or embodied in, a physical product              printf("\"%s\" is not a valid unsigned integer or exceeds 24 bits.\n", argv[i]);
261  //    (including a physical distribution medium), accompanied by the              exit(4);
262  //    Corresponding Source fixed on a durable physical medium              }
263  //    customarily used for software interchange.  
264  //           //If it is too large, flunk it.
265  //    b) Convey the object code in, or embodied in, a physical product           if (parblock->n > 0x00FFFFFF)
266  //    (including a physical distribution medium), accompanied by a              {
267  //    written offer, valid for at least three years and valid for as              printf("\"%s\" is an unsigned integer but exceeds 24 bits.\n", argv[i]);
268  //    long as you offer spare parts or customer support for that product              exit(4);
269  //    model, to give anyone who possesses the object code either (1) a              }
270  //    copy of the Corresponding Source for all the software in the  
271  //    product that is covered by this License, on a durable physical           //OK, we're cool ...
272  //    medium customarily used for software interchange, for a price no           }
273  //    more than your reasonable cost of physically performing this        else
274  //    conveying of source, or (2) access to copy the           {
275  //    Corresponding Source from a network server at no charge.           //Two possibilities left.  Either general parameter, or else unrecognized.
276  //           CU_MSGS_cmd_line_par_results_struct_process_arg(&(parblock->argblock),
277  //    c) Convey individual copies of the object code with a copy of the                                                           argv[i],
278  //    written offer to provide the Corresponding Source.  This                                                           &recognized);
279  //    alternative is allowed only occasionally and noncommercially, and           if (!recognized)
280  //    only if you received the object code with such an offer, in accord              {
281  //    with subsection 6b.              printf("\"%s\" is not a recognized command-line parameter.\n", argv[i]);
282  //              exit(4);
283  //    d) Convey the object code by offering access from a designated              }
284  //    place (gratis or for a charge), and offer equivalent access to the  
285  //    Corresponding Source in the same way through the same place at no           //Was picked up as general parameter.
286  //    further charge.  You need not require recipients to copy the           }
287  //    Corresponding Source along with the object code.  If the place to        }
288  //    copy the object code is a network server, the Corresponding Source  
289  //    may be on a different server (operated by you or a third party)     //Congeal our thoughts on the "general" command-line parameters.  No errors possible
290  //    that supports equivalent copying facilities, provided you maintain     //here.
291  //    clear directions next to the object code saying where to find the     CU_MSGS_cmd_line_par_results_struct_finalize(&(parblock->argblock));
292  //    Corresponding Source.  Regardless of what server hosts the  
293  //    Corresponding Source, you remain obligated to ensure that it is     //printf("Boo.\n");
294  //    available for as long as needed to satisfy these requirements.     //printf("neverlarger %d succ %d\n", parblock->neverlarger_specified, parblock->succ_specified);
295  //  
296  //    e) Convey the object code using peer-to-peer transmission, provided     //Look for mutually exclusive options among the program-specific parameters.
297  //    you inform other peers where the object code and Corresponding     if (
298  //    Source of the work are being offered to the general public at no           (parblock->neversmaller_specified && (parblock->neverlarger_specified || parblock->pred_specified || parblock->succ_specified|| parblock->n_specified))
299  //    charge under subsection 6d.           ||
300  //           (parblock->neverlarger_specified && (parblock->pred_specified || parblock->succ_specified || parblock->n_specified))
301  //  A separable portion of the object code, whose source code is excluded           ||
302  //from the Corresponding Source as a System Library, need not be           (parblock->pred_specified && (parblock->succ_specified|| parblock->n_specified))
303  //included in conveying the object code work.           ||
304  //           (parblock->succ_specified && parblock->n_specified)
305  //  A "User Product" is either (1) a "consumer product", which means any        )
306  //tangible personal property which is normally used for personal, family,        {
307  //or household purposes, or (2) anything designed or sold for incorporation        printf("The \"-neversmaller\", \"-neverlarger\", \"-pred\", \"-succ\", and \"-n\" options are\nmutually exclusive.\n");
308  //into a dwelling.  In determining whether a product is a consumer product,        exit(4);
309  //doubtful cases shall be resolved in favor of coverage.  For a particular        }
310  //product received by a particular user, "normally used" refers to a  
311  //typical or common use of that class of product, regardless of the status     //OK, we're clean, all pars in order.
312  //of the particular user or of the way in which the particular user     }
313  //actually uses, or expects or is expected to use, the product.  A product  
314  //is a consumer product regardless of whether the product has substantial  
315  //commercial, industrial or non-consumer uses, unless such uses represent  //Releases the dynamic memory associated with the parameter block.
316  //the only significant mode of use of the product.  static void release_command_line_args(struct CfbrapabCmainStruct *parblock)
317  //     {
318  //  "Installation Information" for a User Product means any methods,     assert(parblock != NULL);
319  //procedures, authorization keys, or other information required to install  
320  //and execute modified versions of a covered work in that User Product from     //This function is superfluous, since in a command-line utility it doesn't really
321  //a modified version of its Corresponding Source.  The information must     //matter if everything is released.  But, here goes.
322  //suffice to ensure that the continued functioning of the modified object     CU_MSGS_cmd_line_par_results_struct_destroy(&(parblock->argblock));
323  //code is in no case prevented or interfered with solely because     GMP_RATS_mpq_clear(&(parblock->rn));
324  //modification has been made.     GMP_INTS_mpz_clear(&(parblock->kmax));
325  //     GMP_INTS_mpz_clear(&(parblock->hmax));
326  //  If you convey an object code work under this section in, or with, or     }
327  //specifically for use in, a User Product, and the conveying occurs as  
328  //part of a transaction in which the right of possession and use of the  
329  //User Product is transferred to the recipient in perpetuity or for a  //Prints out a single rational number in the format endorsed
330  //fixed term (regardless of how the transaction is characterized), the  //by this program.  This often includes DAP information
331  //Corresponding Source conveyed under this section must be accompanied  //and difference information.  It is assumed that the
332  //by the Installation Information.  But this requirement does not apply  //previous information is terminated by a horizontal line,
333  //if neither you nor any third party retains the ability to install  //and this function terminates with a horizontal line.
334  //modified object code on the User Product (for example, the work has  static void CMAIN_print_app_in_std_form(FILE *s,
335  //been installed in ROM).                                          int index,
336  //                                          GMP_RATS_mpq_struct *rn,
337  //  The requirement to provide Installation Information does not include a                                          GMP_RATS_mpq_struct *approx,
338  //requirement to continue to provide support service, warranty, or updates                                          int nf,
339  //for a work that has been modified or installed by the recipient, or for                                          int show_diff,
340  //the User Product in which it has been modified or installed.  Access to a                                          int show_dap,
341  //network may be denied when the modification itself materially and                                          GMP_INTS_mpz_struct *dap_den)
342  //adversely affects the operation of the network or violates the rules and     {
343  //protocols for communication across the network.     char sbuf[250];
344  //     GMP_RATS_mpq_struct diff, q_temp1;
345  //  Corresponding Source conveyed, and Installation Information provided,     GMP_INTS_mpz_struct z_temp1, quotient, remainder;
346  //in accord with this section must be in a format that is publicly  
347  //documented (and with an implementation available to the public in     //Eyeball the input parameters.
348  //source code form), and must require no special password or key for     assert(s != NULL);
349  //unpacking, reading or copying.     assert(rn != NULL);
350  //     assert(approx != NULL);
351  //  7. Additional Terms.     assert(dap_den != NULL);
352  //  
353  //  "Additional permissions" are terms that supplement the terms of this     //Allocate.
354  //License by making exceptions from one or more of its conditions.     GMP_RATS_mpq_init(&diff);
355  //Additional permissions that are applicable to the entire Program shall     GMP_RATS_mpq_init(&q_temp1);
356  //be treated as though they were included in this License, to the extent     GMP_INTS_mpz_init(&z_temp1);
357  //that they are valid under applicable law.  If additional permissions     GMP_INTS_mpz_init(&quotient);
358  //apply only to part of the Program, that part may be used separately     GMP_INTS_mpz_init(&remainder);
359  //under those permissions, but the entire Program remains governed by  
360  //this License without regard to the additional permissions.     //Print out the approximation numerator.
361  //     sprintf(sbuf, "approx_num(%d)", index);
362  //  When you convey a copy of a covered work, you may at your option     if (!nf)
363  //remove any additional permissions from that copy, or from any part of        {
364  //it.  (Additional permissions may be written to require their own        GMP_INTS_mpz_long_int_format_to_stream(s,
365  //removal in certain cases when you modify the work.)  You may place                                               &(approx->num),
366  //additional permissions on material, added by you to a covered work,                                               sbuf);
367  //for which you have or can give appropriate copyright permission.        }
368  //     else
369  //  Notwithstanding any other provision of this License, for material you        {
370  //add to a covered work, you may (if authorized by the copyright holders of        int nreserved;
371  //that material) supplement the terms of this License with terms:        char *p;
372  //        
373  //    a) Disclaiming warranty or limiting liability differently from the        fprintf(s, "%d\n", index);
374  //    terms of sections 15 and 16 of this License; or        
375  //        nreserved = GMP_INTS_mpz_size_in_base_10(&(approx->num));
376  //    b) Requiring preservation of specified reasonable legal notices or        p = CCMALLOC_malloc(sizeof(char) * nreserved);
377  //    author attributions in that material or in the Appropriate Legal        GMP_INTS_mpz_to_string(p, &(approx->num));
378  //    Notices displayed by works containing it; or        fprintf(s, "%s\n", p);
379  //        CCMALLOC_free(p);
380  //    c) Prohibiting misrepresentation of the origin of that material, or        }
381  //    requiring that modified versions of such material be marked in  
382  //    reasonable ways as different from the original version; or     if (!nf)
383  //        FCMIOF_hline();
384  //    d) Limiting the use for publicity purposes of names of licensors or  
385  //    authors of the material; or     //Print out the approximation denominator.
386  //     sprintf(sbuf, "approx_den(%d)", index);
387  //    e) Declining to grant rights under trademark law for use of some     if (!nf)
388  //    trade names, trademarks, or service marks; or        {
389  //        GMP_INTS_mpz_long_int_format_to_stream(s,
390  //    f) Requiring indemnification of licensors and authors of that                                               &(approx->den),
391  //    material by anyone who conveys the material (or modified versions of                                               sbuf);
392  //    it) with contractual assumptions of liability to the recipient, for        }
393  //    any liability that these contractual assumptions directly impose on     else
394  //    those licensors and authors.        {
395  //        int nreserved;
396  //  All other non-permissive additional terms are considered "further        char *p;
397  //restrictions" within the meaning of section 10.  If the Program as you  
398  //received it, or any part of it, contains a notice stating that it is        nreserved = GMP_INTS_mpz_size_in_base_10(&(approx->den));
399  //governed by this License along with a term that is a further        p = CCMALLOC_malloc(sizeof(char) * nreserved);
400  //restriction, you may remove that term.  If a license document contains        GMP_INTS_mpz_to_string(p, &(approx->den));
401  //a further restriction but permits relicensing or conveying under this        fprintf(s, "%s\n", p);
402  //License, you may add to a covered work material governed by the terms        CCMALLOC_free(p);
403  //of that license document, provided that the further restriction does        }
404  //not survive such relicensing or conveying.  
405  //     if (!nf)
406  //  If you add terms to a covered work in accord with this section, you        FCMIOF_hline();
407  //must place, in the relevant source files, a statement of the  
408  //additional terms that apply to those files, or a notice indicating  
409  //where to find the applicable terms.     //If the "dap" flag is set, calculate and display decimal equivalent of the
410  //     //approximation.
411  //  Additional terms, permissive or non-permissive, may be stated in the     if (show_dap)
412  //form of a separately written license, or stated as exceptions;        {
413  //the above requirements apply either way.        //Make the calculation for decimal approximation.
414  //        GMP_RATS_mpq_copy(&q_temp1, approx);
415  //  8. Termination.        GMP_RATS_mpq_normalize(&q_temp1);
416  //        GMP_INTS_mpz_mul(&z_temp1, dap_den, &q_temp1.num);
417  //  You may not propagate or modify a covered work except as expressly        GMP_INTS_mpz_tdiv_qr(&quotient, &remainder,
418  //provided under this License.  Any attempt otherwise to propagate or                             &z_temp1, &q_temp1.den);
419  //modify it is void, and will automatically terminate your rights under  
420  //this License (including any patent licenses granted under the third        sprintf(sbuf, "dap_num(%d)", index);
421  //paragraph of section 11).        if (!nf)
422  //           {
423  //  However, if you cease all violation of this License, then your           GMP_INTS_mpz_long_int_format_to_stream(s,
424  //license from a particular copyright holder is reinstated (a)                                                  &(quotient),
425  //provisionally, unless and until the copyright holder explicitly and                                                  sbuf);
426  //finally terminates your license, and (b) permanently, if the copyright           }
427  //holder fails to notify you of the violation by some reasonable means        else
428  //prior to 60 days after the cessation.           {
429  //           int nreserved;
430  //  Moreover, your license from a particular copyright holder is           char *p;
431  //reinstated permanently if the copyright holder notifies you of the  
432  //violation by some reasonable means, this is the first time you have           nreserved = GMP_INTS_mpz_size_in_base_10(&(quotient));
433  //received notice of violation of this License (for any work) from that           p = CCMALLOC_malloc(sizeof(char) * nreserved);
434  //copyright holder, and you cure the violation prior to 30 days after           GMP_INTS_mpz_to_string(p, &(quotient));
435  //your receipt of the notice.           fprintf(s, "%s\n", p);
436  //           CCMALLOC_free(p);
437  //  Termination of your rights under this section does not terminate the           }
438  //licenses of parties who have received copies or rights from you under  
439  //this License.  If your rights have been terminated and not permanently        if (!nf)
440  //reinstated, you do not qualify to receive new licenses for the same           FCMIOF_hline();
441  //material under section 10.  
442  //        //Print out the approximation denominator.
443  //  9. Acceptance Not Required for Having Copies.        sprintf(sbuf, "dap_den(%d)", index);
444  //        if (!nf)
445  //  You are not required to accept this License in order to receive or           {
446  //run a copy of the Program.  Ancillary propagation of a covered work           GMP_INTS_mpz_long_int_format_to_stream(s,
447  //occurring solely as a consequence of using peer-to-peer transmission                                                  dap_den,
448  //to receive a copy likewise does not require acceptance.  However,                                                  sbuf);
449  //nothing other than this License grants you permission to propagate or           }
450  //modify any covered work.  These actions infringe copyright if you do        else
451  //not accept this License.  Therefore, by modifying or propagating a           {
452  //covered work, you indicate your acceptance of this License to do so.           int nreserved;
453  //           char *p;
454  //  10. Automatic Licensing of Downstream Recipients.  
455  //           nreserved = GMP_INTS_mpz_size_in_base_10(dap_den);
456  //  Each time you convey a covered work, the recipient automatically           p = CCMALLOC_malloc(sizeof(char) * nreserved);
457  //receives a license from the original licensors, to run, modify and           GMP_INTS_mpz_to_string(p, dap_den);
458  //propagate that work, subject to this License.  You are not responsible           fprintf(s, "%s\n", p);
459  //for enforcing compliance by third parties with this License.           CCMALLOC_free(p);
460  //           }
461  //  An "entity transaction" is a transaction transferring control of an  
462  //organization, or substantially all assets of one, or subdividing an        if (!nf)
463  //organization, or merging organizations.  If propagation of a covered           FCMIOF_hline();
464  //work results from an entity transaction, each party to that        }
465  //transaction who receives a copy of the work also receives whatever  
466  //licenses to the work the party's predecessor in interest had or could    
467  //give under the previous paragraph, plus a right to possession of the     //If the "diff" flag is set, calculate and display the rational difference.
468  //Corresponding Source of the work from the predecessor in interest, if     if (show_diff)
469  //the predecessor has it or can get it with reasonable efforts.        {
470  //        GMP_RATS_mpq_sub(&diff, approx, rn);
471  //  You may not impose any further restrictions on the exercise of the        GMP_RATS_mpq_normalize(&diff);
472  //rights granted or affirmed under this License.  For example, you may  
473  //not impose a license fee, royalty, or other charge for exercise of        sprintf(sbuf, "error_num(%d)", index);
474  //rights granted under this License, and you may not initiate litigation        if (!nf)
475  //(including a cross-claim or counterclaim in a lawsuit) alleging that           {
476  //any patent claim is infringed by making, using, selling, offering for           GMP_INTS_mpz_long_int_format_to_stream(s,
477  //sale, or importing the Program or any portion of it.                                                  &(diff.num),
478  //                                                  sbuf);
479  //  11. Patents.           }
480  //        else
481  //  A "contributor" is a copyright holder who authorizes use under this           {
482  //License of the Program or a work on which the Program is based.  The           int nreserved;
483  //work thus licensed is called the contributor's "contributor version".           char *p;
484  //  
485  //  A contributor's "essential patent claims" are all patent claims           nreserved = GMP_INTS_mpz_size_in_base_10(&(diff.num));
486  //owned or controlled by the contributor, whether already acquired or           p = CCMALLOC_malloc(sizeof(char) * nreserved);
487  //hereafter acquired, that would be infringed by some manner, permitted           GMP_INTS_mpz_to_string(p, &(diff.num));
488  //by this License, of making, using, or selling its contributor version,           fprintf(s, "%s\n", p);
489  //but do not include claims that would be infringed only as a           CCMALLOC_free(p);
490  //consequence of further modification of the contributor version.  For           }
491  //purposes of this definition, "control" includes the right to grant  
492  //patent sublicenses in a manner consistent with the requirements of        if (!nf)
493  //this License.           FCMIOF_hline();
494  //  
495  //  Each contributor grants you a non-exclusive, worldwide, royalty-free        //Print out the approximation denominator.
496  //patent license under the contributor's essential patent claims, to        sprintf(sbuf, "error_den(%d)", index);
497  //make, use, sell, offer for sale, import and otherwise run, modify and        if (!nf)
498  //propagate the contents of its contributor version.           {
499  //           GMP_INTS_mpz_long_int_format_to_stream(s,
500  //  In the following three paragraphs, a "patent license" is any express                                                  &(diff.den),
501  //agreement or commitment, however denominated, not to enforce a patent                                                  sbuf);
502  //(such as an express permission to practice a patent or covenant not to           }
503  //sue for patent infringement).  To "grant" such a patent license to a        else
504  //party means to make such an agreement or commitment not to enforce a           {
505  //patent against the party.           int nreserved;
506  //           char *p;
507  //  If you convey a covered work, knowingly relying on a patent license,  
508  //and the Corresponding Source of the work is not available for anyone           nreserved = GMP_INTS_mpz_size_in_base_10(&(diff.den));
509  //to copy, free of charge and under the terms of this License, through a           p = CCMALLOC_malloc(sizeof(char) * nreserved);
510  //publicly available network server or other readily accessible means,           GMP_INTS_mpz_to_string(p, &(diff.den));
511  //then you must either (1) cause the Corresponding Source to be so           fprintf(s, "%s\n", p);
512  //available, or (2) arrange to deprive yourself of the benefit of the           CCMALLOC_free(p);
513  //patent license for this particular work, or (3) arrange, in a manner           }
514  //consistent with the requirements of this License, to extend the patent  
515  //license to downstream recipients.  "Knowingly relying" means you have        if (!nf)
516  //actual knowledge that, but for the patent license, your conveying the           FCMIOF_hline();
517  //covered work in a country, or your recipient's use of the covered work        }
518  //in a country, would infringe one or more identifiable patents in that  
519  //country that you have reason to believe are valid.     //Deallocate.
520  //     GMP_RATS_mpq_clear(&diff);
521  //  If, pursuant to or in connection with a single transaction or     GMP_RATS_mpq_clear(&q_temp1);
522  //arrangement, you convey, or propagate by procuring conveyance of, a     GMP_INTS_mpz_clear(&z_temp1);
523  //covered work, and grant a patent license to some of the parties     GMP_INTS_mpz_clear(&quotient);
524  //receiving the covered work authorizing them to use, propagate, modify     GMP_INTS_mpz_clear(&remainder);
525  //or convey a specific copy of the covered work, then the patent license     }
526  //you grant is automatically extended to all recipients of the covered  
527  //work and works based on it.  
528  //  //Handles the classic case of finding the closest
529  //  A patent license is "discriminatory" if it does not include within  //neighbor(s).
530  //the scope of its coverage, prohibits the exercise of, or is  static int CMAIN_classic_closest_neighbor(struct CfbrapabCmainStruct *parblock)
531  //conditioned on the non-exercise of one or more of the rights that are     {
532  //specifically granted under this License.  You may not convey a covered     int rv = 0;
533  //work if you are a party to an arrangement with a third party that is     GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;
534  //in the business of distributing software, under which you make payment     GMP_INTS_mpz_struct dap_denominator;
535  //to the third party based on the extent of your activity of conveying     GMP_RALG_cf_app_struct cf_decomp;
536  //the work, and under which the third party grants, to any of the     GMP_RALG_fab_neighbor_collection_struct neighbor_data;
537  //parties who would receive the covered work from you, a discriminatory     int error_flag;
538  //patent license (a) in connection with copies of the covered work  
539  //conveyed by you (or copies made from those copies), or (b) primarily     //Allocate all dynamic memory.
540  //for and in connection with specific products or compilations that     GMP_RATS_mpq_init(&hmax_over_one);
541  //contain the covered work, unless you entered into that arrangement,     GMP_RATS_mpq_init(&hmax_over_kmax);
542  //or that patent license was granted, prior to 28 March 2007.     GMP_INTS_mpz_init(&dap_denominator);
543  //     GMP_RATS_mpq_init(&rn_in_abs);
544  //  Nothing in this License shall be construed as excluding or limiting  
545  //any implied license or other defenses to infringement that may     //Set the DAP denominator to 1e108.
546  //otherwise be available to you under applicable patent law.     GMP_INTS_mpz_set_general_int(&dap_denominator,
547  //                                  &error_flag,
548  //  12. No Surrender of Others' Freedom.                                  "1e108");
549  //  
550  //  If conditions are imposed on you (whether by court order, agreement or     //By convention, we will not mess with anything with an
551  //otherwise) that contradict the conditions of this License, they do not     //absolute value greater than HMAX/1.  If such a condition exists, puke out.
552  //excuse you from the conditions of this License.  If you cannot convey a     //Form up the value of HMAX/1 if HMAX was specified.
553  //covered work so as to satisfy simultaneously your obligations under this     if (parblock->hmax_specified)
554  //License and any other pertinent obligations, then as a consequence you may        {
555  //not convey it at all.  For example, if you agree to terms that obligate you        GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));
556  //to collect a royalty for further conveying from those to whom you convey        GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);
557  //the Program, the only way you could satisfy both those terms and this        GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));
558  //License would be to refrain entirely from conveying the Program.        GMP_INTS_mpz_abs(&(rn_in_abs.num));
559  //        if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)
560  //  13. Use with the GNU Affero General Public License.           {
561  //           printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"
562  //  Notwithstanding any other provision of this License, you have                  "has no neighbors in the series of interest.  Calculation cannot continue.\n");
563  //permission to link or combine any covered work with a work licensed           exit(4);
564  //under version 3 of the GNU Affero General Public License into a single           }
565  //combined work, and to convey the resulting work.  The terms of this        }
566  //License will continue to apply to the part which is the covered work,  
567  //but the special requirements of the GNU Affero General Public License,     //If the "verbose" option is specified, we want to give the continued fraction
568  //section 13, concerning interaction through a network will apply to the     //partial quotients and convergents of either the number to approximate,
569  //combination as such.     //its reciprocal, or none of the above, as appropriate; and give a bit more
570  //     //information, in addition.
571  //  14. Revised Versions of this License.     if (parblock->argblock.verbose)
572  //        {
573  //  The Free Software Foundation may publish revised and/or new versions of        if (parblock->hmax_specified)
574  //the GNU General Public License from time to time.  Such new versions will           {
575  //be similar in spirit to the present version, but may differ in detail to           //Stuff HMAX/KMAX.  This is necessary for comparison.
576  //address new problems or concerns.           GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));
577  //           GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));
578  //  Each version is given a distinguishing version number.  If the           }
579  //Program specifies that a certain numbered version of the GNU General  
580  //Public License "or any later version" applies to it, you have the        if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))
581  //option of following the terms and conditions either of that numbered           {
582  //version or of any later version published by the Free Software           //Either HMAX was not specified or else we are below the corner point on the
583  //Foundation.  If the Program does not specify a version number of the           //integer lattice.  Get the continued fraction representation of the number
584  //GNU General Public License, you may choose any version ever published           //rather than its reciprocal.
585  //by the Free Software Foundation.           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));
586  //  
587  //  If the Program specifies that a proxy can decide which future           //Print out the continued fraction decomposition of the rational number.
588  //versions of the GNU General Public License can be used, that proxy's           GMP_RALG_cfdecomp_emit(stdout,
589  //public statement of acceptance of a version permanently authorizes you                                  "CF Rep Of Abs Value Of Number Specified",
590  //to choose that version for the Program.                                  &cf_decomp,
591  //                                  0,
592  //  Later license versions may give you additional or different                                  1,
593  //permissions.  However, no additional obligations are imposed on any                                  &dap_denominator);
594  //author or copyright holder as a result of your choosing to follow a  
595  //later version.           //Destroy the decomposition--free the memory.
596  //           GMP_RALG_cfdecomp_destroy(&cf_decomp);
597  //  15. Disclaimer of Warranty.           }
598  //        else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)
599  //  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY           {
600  //APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT           //In this case, the rational number specified is exactly the same in
601  //HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY           //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.
602  //OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,           printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");
603  //THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR           }
604  //PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM        else
605  //IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF           {
606  //ALL NECESSARY SERVICING, REPAIR OR CORRECTION.           //The number specified is beyond the corner point.  It is appropriate to
607  //           //provide the decomposition of the reciprocal rather than of the number
608  //  16. Limitation of Liability.           //itself.
609  //           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));
610  //  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING  
611  //WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS           //Print out the continued fraction decomposition of the rational number.
612  //THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY           GMP_RALG_cfdecomp_emit(stdout,
613  //GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE                                  "CF Rep Of Reciprocal Of Abs Value Of Number Specified",
614  //USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF                                  &cf_decomp,
615  //DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD                                  0,
616  //PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),                                  1,
617  //EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF                                  &dap_denominator);
618  //SUCH DAMAGES.  
619  //           //Destroy the decomposition--free the memory.
620  //  17. Interpretation of Sections 15 and 16.           GMP_RALG_cfdecomp_destroy(&cf_decomp);
621  //           }
622  //  If the disclaimer of warranty and limitation of liability provided        } //End if verbose.
623  //above cannot be given local legal effect according to their terms,  
624  //reviewing courts shall apply local law that most closely approximates     //Do all the work to get the neighbors of the number passed.
625  //an absolute waiver of all civil liability in connection with the     GMP_RALG_consecutive_fab_terms(
626  //Program, unless a warranty or assumption of liability accompanies a             &(parblock->rn),
627  //copy of the Program in return for a fee.             &(parblock->kmax),
628  //             (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),
629  //                     END OF TERMS AND CONDITIONS             1,
630  //             1,
631  //            How to Apply These Terms to Your New Programs             &neighbor_data);
632  //  
633  //  If you develop a new program, and you want it to be of the greatest     //Print the neighbor data block for debugging.
634  //possible use to the public, the best way to achieve this is to make it     #if 0
635  //free software which everyone can redistribute and change under these terms.     GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);
636  //     #endif
637  //  To do so, attach the following notices to the program.  It is safest  
638  //to attach them to the start of each source file to most effectively     //There are four possibilities at this point.
639  //state the exclusion of warranty; and each file should have at least     //  a)Attempting to find the rational neighbors generated an error.
640  //the "copyright" line and a pointer to where the full notice is found.     //  b)The rational number specified was already in the series of interest,
641  //     //    in which case we will use it.
642  //    <one line to give the program's name and a brief idea of what it does.>     //  c)The left neighbor is closer or in a tie we want to choose it.
643  //    Copyright (C) <year>  <name of author>     //  d)The right neighbor is closer or in a tie we want to choose it.
644  //     if (neighbor_data.error)
645  //    This program is free software: you can redistribute it and/or modify        {
646  //    it under the terms of the GNU General Public License as published by        //
647  //    the Free Software Foundation, either version 3 of the License, or        printf("Internal error: %s\n", neighbor_data.error);
648  //    (at your option) any later version.        }
649  //     else if (neighbor_data.equality)
650  //    This program is distributed in the hope that it will be useful,        {
651  //    but WITHOUT ANY WARRANTY; without even the implied warranty of        CMAIN_print_app_in_std_form(stdout,
652  //    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the                                    0,
653  //    GNU General Public License for more details.                                    &(neighbor_data.rn_in),
654  //                                    &(neighbor_data.rn_in),
655  //    You should have received a copy of the GNU General Public License                                    parblock->argblock.noformat,
656  //    along with this program.  If not, see <http://www.gnu.org/licenses/>.                                    0,
657  //                                    1,
658  //Also add information on how to contact you by electronic and paper mail.                                    &dap_denominator);
659  //        }
660  //  If the program does terminal interaction, make it output a short     else
661  //notice like this when it starts in an interactive mode:        {
662  //        GMP_RATS_mpq_struct left_neighbor, right_neighbor,
663  //    <program>  Copyright (C) <year>  <name of author>                            left_diff, right_diff,
664  //    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.                            left_abs, right_abs;
665  //    This is free software, and you are welcome to redistribute it        int error_cmp;
666  //    under certain conditions; type `show c' for details.        int mag_cmp;
667  //  
668  //The hypothetical commands `show w' and `show c' should show the appropriate        GMP_RATS_mpq_init(&left_neighbor);
669  //parts of the General Public License.  Of course, your program's commands        GMP_RATS_mpq_init(&right_neighbor);
670  //might be different; for a GUI interface, you would use an "about box".        GMP_RATS_mpq_init(&left_diff);
671  //        GMP_RATS_mpq_init(&right_diff);
672  //  You should also get your employer (if you work as a programmer) or school,        GMP_RATS_mpq_init(&left_abs);
673  //if any, to sign a "copyright disclaimer" for the program, if necessary.        GMP_RATS_mpq_init(&right_abs);
674  //For more information on this, and how to apply and follow the GNU GPL, see  
675  //<http://www.gnu.org/licenses/>.        //Snatch the left neighbor.
676  //        if (neighbor_data.n_left_out)
677  //  The GNU General Public License does not permit incorporating your program           {
678  //into proprietary programs.  If your program is a subroutine library, you           GMP_RATS_mpq_copy(&left_neighbor, &(neighbor_data.lefts[0].neighbor));
679  //may consider it more useful to permit linking proprietary applications with           }
680  //the library.  If this is what you want to do, use the GNU Lesser General  
681  //Public License instead of this License.  But first, please read        //Snatch the right neighbor.
682  //<http://www.gnu.org/philosophy/why-not-lgpl.html>.        if (neighbor_data.n_right_out)
683  //-------------------------------------------------------------------------------------------------           {
684  //--------------------------------------------------------------------------------           GMP_RATS_mpq_copy(&right_neighbor, &(neighbor_data.rights[0].neighbor));
685  #include <assert.h>           }
686  #include <malloc.h>  
687  #include <process.h>        //Calculate the differences, take their absolute
688  #include <stdio.h>        //values.
689  #include <string.h>        GMP_RATS_mpq_sub(&left_diff,  &left_neighbor,  &(neighbor_data.rn_in));
690  #include <time.h>        GMP_RATS_mpq_sub(&right_diff, &right_neighbor, &(neighbor_data.rn_in));
691          GMP_RATS_mpq_normalize(&left_diff);
692          GMP_RATS_mpq_normalize(&right_diff);
693  #include "bstrfunc.h"        GMP_INTS_mpz_abs(&(left_diff.num));
694  #include "ccmalloc.h"        GMP_INTS_mpz_abs(&(right_diff.num));
695  #include "ccmfatal.h"  
696  #include "charfunc.h"        //Now that the differences are calculated, take the
697  #include "cu_msgs.h"        //absolute values of the neighbors themselves.
698  #include "fcmiof.h"        //We will use this to break ties.
699  #include "gmp_ints.h"        GMP_RATS_mpq_normalize(&left_neighbor);
700  #include "gmp_rats.h"        GMP_RATS_mpq_normalize(&right_neighbor);
701  #include "gmp_ralg.h"        GMP_INTS_mpz_abs(&(left_neighbor.num));
702  #include "intfunc.h"        GMP_INTS_mpz_abs(&(right_neighbor.num));
703    
704          //Compare the relative differences and magnitudes.
705  #define PNAME "cfbrapab"        error_cmp = GMP_RATS_mpq_cmp(&left_diff, &right_diff, NULL);
706  #define PNAMEUC "CFBRAPAB"        mag_cmp   = GMP_RATS_mpq_cmp(&left_neighbor, &right_neighbor, NULL);
707    
708          //Figure out which to present as the best approximation and
709  const char *C_MAIN_cvcinfo(void)        //do it.
710     {        if (!(parblock->neversmaller_specified) &&
711     return("$Header: /cvsroot/esrg/sfesrg/esrgpcpj/cfbrapab/c_main.c,v 1.6 2002/01/27 17:58:15 dtashley Exp $");           ((parblock->neverlarger_specified) || (error_cmp < 0) || ((error_cmp == 0) && (mag_cmp < 0))))
712     }           {
713             CMAIN_print_app_in_std_form(stdout,
714                                         -1,
715  //This is a NULL-terminated table of pointers to functions                                       &(neighbor_data.rn_in),
716  //which return version control strings for all of the files                                       &(neighbor_data.lefts[0].neighbor),
717  //which make up the INTFAC program.  This information would                                       parblock->argblock.noformat,
718  //be helpful for debugging.                                       1,
719  static const char *(*C_MAIN_vcinfoptrs[])(void) =                                       1,
720     {                                       &dap_denominator);
721     //This is the main module, should come first.           }
722     C_MAIN_cvcinfo,        else
723             {
724     //And now the others, in alphabetical order.           CMAIN_print_app_in_std_form(stdout,
725     BSTRFUNC_hvcinfo,                                       1,
726     BSTRFUNC_cvcinfo,                                       &(neighbor_data.rn_in),
727     CCMALLOC_hvcinfo,                                       &(neighbor_data.rights[0].neighbor),
728     CCMALLOC_cvcinfo,                                       parblock->argblock.noformat,
729     CCMFATAL_hvcinfo,                                       1,
730     CCMFATAL_cvcinfo,                                       1,
731     CHARFUNC_hvcinfo,                                       &dap_denominator);
732     CHARFUNC_cvcinfo,           }
733     CU_MSGS_hvcinfo,  
734     CU_MSGS_cvcinfo,        //Deallocate.
735     FCMIOF_hvcinfo,        GMP_RATS_mpq_clear(&left_neighbor);
736     FCMIOF_cvcinfo,        GMP_RATS_mpq_clear(&right_neighbor);
737     GMP_INTS_hvcinfo,        GMP_RATS_mpq_clear(&left_diff);
738     GMP_INTS_cvcinfo,        GMP_RATS_mpq_clear(&right_diff);
739     GMP_RALG_hvcinfo,        GMP_RATS_mpq_clear(&left_abs);
740     GMP_RALG_cvcinfo,        GMP_RATS_mpq_clear(&right_abs);
741     GMP_RATS_hvcinfo,        }
742     GMP_RATS_cvcinfo,  
743     INTFUNC_hvcinfo,     //Deallocate all dynamic memory.
744     INTFUNC_cvcinfo,     GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);
745     NULL     GMP_RATS_mpq_clear(&hmax_over_one);
746     };     GMP_RATS_mpq_clear(&hmax_over_kmax);
747       GMP_INTS_mpz_clear(&dap_denominator);
748       GMP_RATS_mpq_clear(&rn_in_abs);
749  //This is the structure type used to hold information about all the  
750  //command-line parameters.     return(rv);
751  //     }
752  struct CfbrapabCmainStruct  
753     {  
754     GMP_RATS_mpq_struct rn;  //Handles the case of finding multiple neighbors.
755        //The rational number specified on the command line.  
756        //symmetry.  static int CMAIN_multiple_neighbor(struct CfbrapabCmainStruct *parblock)
757     GMP_INTS_mpz_struct kmax;     {
758        //The value of KMAX specified on the command line.  This must always     int rv = 0;
759        //be present.     GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;
760     int hmax_specified;     GMP_INTS_mpz_struct dap_denominator;
761        //TRUE if HMAX is specified in addition to KMAX.  KMAX is mandatory     GMP_RALG_cf_app_struct cf_decomp;
762        //in all cases.     GMP_RALG_fab_neighbor_collection_struct neighbor_data;
763     GMP_INTS_mpz_struct hmax;     int error_flag;
764        //The value of HMAX if it is specified.  This is optional.  This will be     int i;
765        //set to zero if it is not present on the command line.  
766     int neversmaller_specified;     //Allocate all dynamic memory.
767        //TRUE if the -neversmaller option is specified on the command line.     GMP_RATS_mpq_init(&hmax_over_one);
768     int neverlarger_specified;     GMP_RATS_mpq_init(&hmax_over_kmax);
769        //TRUE if the -neverlarger option is specified on the command line.     GMP_INTS_mpz_init(&dap_denominator);
770     int pred_specified;     GMP_RATS_mpq_init(&rn_in_abs);
771        //TRUE if the -pred option is specified on the command line.  
772     int succ_specified;     //Set the DAP denominator to 1e108.
773        //TRUE if the -succ option specified on the command line.     GMP_INTS_mpz_set_general_int(&dap_denominator,
774     int n_specified;                                  &error_flag,
775        //TRUE if the -n parameter is specified on the command line.                                  "1e108");
776     unsigned n;  
777        //The value of n if it has been specified.     //By convention, we will not mess with anything with an
778     CU_MSGS_std_cmd_line_par_results_struct argblock;     //absolute value greater than HMAX/1.  If such a condition exists, puke out.
779        //The block holding the options which are common across all     //Form up the value of HMAX/1 if HMAX was specified.
780        //of these command-line utilities.     if (parblock->hmax_specified)
781     };        {
782          GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));
783          GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);
784  //Processes the command-line parameters, and abstracts it to a        GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));
785  //the contents of a structure plus a failure flag.        GMP_INTS_mpz_abs(&(rn_in_abs.num));
786  static void process_command_line_args(struct CfbrapabCmainStruct *parblock,        if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)
787                                       int argc,           {
788                                       char* argv[])           printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"
789     {                  "has no neighbors in the series of interest.  Calculation cannot continue.\n");
790     int error_flag;           exit(4);
791     int first_dashed_parameter;           }
792     int i;        }
793     int recognized;  
794       //If the "verbose" option is specified, we want to give the continued fraction
795     //Eyeball the input parameters.     //partial quotients and convergents of either the number to approximate,
796     assert(parblock != NULL);     //its reciprocal, or none of the above, as appropriate; and give a bit more
797     assert(argc >= 1);     //information, in addition.
798     assert(argv != NULL);     if (parblock->argblock.verbose)
799          {
800     //We have to have at least 3 total parameters.  However, this is covered        if (parblock->hmax_specified)
801     //in main().           {
802             //Stuff HMAX/KMAX.  This is necessary for comparison.
803     //Process the first parameter, which has to be the rational number we           GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));
804     //want to approximate.  If there is a problem, give a helpful message           GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));
805     //and exit with an error code.           }
806     GMP_RATS_mpq_init(&(parblock->rn));  
807     GMP_RATS_mpq_set_all_format_rat_num( argv[1],        if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))
808                                         &error_flag,           {
809                                         &(parblock->rn));           //Either HMAX was not specified or else we are below the corner point on the
810             //integer lattice.  Get the continued fraction representation of the number
811     //If there was a parse error, announce and abort.           //rather than its reciprocal.
812     if (error_flag || GMP_RATS_mpq_is_nan(&(parblock->rn)))           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));
813        {  
814        printf("\"%s\" is not a properly formatted rational number.\n", argv[1]);           //Print out the continued fraction decomposition of the rational number.
815        exit(4);           GMP_RALG_cfdecomp_emit(stdout,
816        }                                  "CF Representation Of Absolute Value Of Rational Number Specified",
817                                    &cf_decomp,
818     //Normalize the rational number specified as input.  It is allowed to                                  0,
819     //be negative.                                  1,
820     GMP_RATS_mpq_normalize(&(parblock->rn));                                  &dap_denominator);
821    
822     //The next item has to be a number, it has to be           //Destroy the decomposition--free the memory.
823     //an integer, it has to be positive, and it           GMP_RALG_cfdecomp_destroy(&cf_decomp);
824     //is KMAX.  Parse out that.  If there are any           }
825     //errors, abort.        else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)
826     GMP_INTS_mpz_init(&(parblock->kmax));           {
827     GMP_INTS_mpz_set_general_int(&(parblock->kmax), &error_flag, argv[2]);           //In this case, the rational number specified is exactly the same in
828     if (error_flag || GMP_INTS_mpz_is_zero(&(parblock->kmax)) || GMP_INTS_mpz_is_neg(&(parblock->kmax)))           //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.
829        {           printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");
830        printf("\"%s\" is not a properly formatted positive integer.\n", argv[2]);           }
831        exit(4);        else
832        }           {
833             //The number specified is beyond the corner point.  It is appropriate to
834     //Unconditionally allocate space for hmax.           //provide the decomposition of the reciprocal rather than of the number
835     GMP_INTS_mpz_init(&(parblock->hmax));           //itself.
836             GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));
837     //If there is a third parameter, it can be two things.  It can  
838     //be either HMAX, or it can be the start of the parameters           //Print out the continued fraction decomposition of the rational number.
839     //with dashes.  First, let's decide which case applies.           GMP_RALG_cfdecomp_emit(stdout,
840     if (argc <= 3)                                  "CF Representation Of Reciprocal Of Absolute Value Of Rational Number Specified",
841        {                                  &cf_decomp,
842        first_dashed_parameter = 3;                                  0,
843        parblock->hmax_specified = 0;                                  1,
844        }                                  &dap_denominator);
845     else  
846        {           //Destroy the decomposition--free the memory.
847        if (argv[3][0] == '-')           GMP_RALG_cfdecomp_destroy(&cf_decomp);
848           {           }
849           first_dashed_parameter = 3;        } //End if verbose.
850           parblock->hmax_specified = 0;  
851           }     //Do all the work to get the neighbors of the number passed.
852        else     GMP_RALG_consecutive_fab_terms(
853           {             &(parblock->rn),
854           first_dashed_parameter = 4;             &(parblock->kmax),
855           parblock->hmax_specified = 1;             (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),
856               parblock->n,
857           GMP_INTS_mpz_set_general_int(&(parblock->hmax), &error_flag, argv[3]);             parblock->n,
858           if (error_flag || GMP_INTS_mpz_is_zero(&(parblock->hmax)) || GMP_INTS_mpz_is_neg(&(parblock->hmax)))             &neighbor_data);
859              {  
860              printf("\"%s\" is not a properly formatted positive integer.\n", argv[3]);     //Print the neighbor data block for debugging.
861              exit(4);     #if 0
862              }     GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);
863           }     #endif
864        }  
865       //Loop through, printing out the left neighbors in order.
866     //Loop through the remaining parameters, trying to process each     for (i = neighbor_data.n_left_out - 1; i >= 0; i--)
867     //one either as a parameter specific to this program or else        {
868     //as a general parameter.        CMAIN_print_app_in_std_form(stdout,
869     //                                    -(i + 1),
870     //Initialize the internal general parameter block.                                    &(neighbor_data.rn_in),
871     CU_MSGS_cmd_line_par_results_struct_create(&(parblock->argblock));                                    &(neighbor_data.lefts[i].neighbor),
872     parblock->neversmaller_specified = 0;                                    parblock->argblock.noformat,
873     parblock->neverlarger_specified  = 0;                                    1,
874     parblock->pred_specified         = 0;                                    1,
875     parblock->succ_specified         = 0;                                    &dap_denominator);
876     parblock->n_specified            = 0;        }
877     parblock->n                      = 0;  
878       //If the number itself appears in the series of interest, spit that out.
879     for (i=first_dashed_parameter; i<argc; i++)     if (neighbor_data.equality)
880        {        {
881        if (!strcmp("-neversmaller", argv[i]))        CMAIN_print_app_in_std_form(stdout,
882           {                                    0,
883           parblock->neversmaller_specified = 1;                                    &(neighbor_data.rn_in),
884           }                                    &(neighbor_data.norm_rn),
885        else if (!strcmp("-neverlarger", argv[i]))                                    parblock->argblock.noformat,
886           {                                    1,
887           parblock->neverlarger_specified = 1;                                    1,
888           }                                    &dap_denominator);
889        else if (!strcmp("-pred", argv[i]))        }
890           {  
891           parblock->pred_specified = 1;     //Loop through, printing out the right neighbors in order.
892           }     for (i = 0; i < neighbor_data.n_right_out; i++)
893        else if (!strcmp("-succ", argv[i]))        {
894           {        CMAIN_print_app_in_std_form(stdout,
895           parblock->succ_specified = 1;                                    i+1,
896           }                                    &(neighbor_data.rn_in),
897        else if (!strcmp("-n", argv[i]))                                    &(neighbor_data.rights[i].neighbor),
898           {                                    parblock->argblock.noformat,
899           parblock->n_specified = 1;                                    1,
900                                      1,
901           //To go along with -n, we have to have a next parameter.                                    &dap_denominator);
902           if (i == (argc-1))        }
903              {  
904              printf("The \"-n\" parameter must include a following count.\n");     //Deallocate all dynamic memory.
905              exit(4);     GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);
906              }     GMP_RATS_mpq_clear(&hmax_over_one);
907       GMP_RATS_mpq_clear(&hmax_over_kmax);
908           //Bump i to index to next par.     GMP_INTS_mpz_clear(&dap_denominator);
909           i++;     GMP_RATS_mpq_clear(&rn_in_abs);
910    
911           //Try to parse this as a UINT24.  It must be that.     return(rv);
912           GMP_INTS_mpz_parse_into_uint32(&(parblock->n), &error_flag, argv[i]);     }
913    
914           //If it couldn't be parsed as an integer, flunk it.  
915           if (error_flag)  //Handles the case of finding the predecessor.
916              {  int CMAIN_predecessor(struct CfbrapabCmainStruct *parblock)
917              printf("\"%s\" is not a valid unsigned integer or exceeds 24 bits.\n", argv[i]);     {
918              exit(4);     int rv = 0;
919              }     GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;
920       GMP_INTS_mpz_struct dap_denominator;
921           //If it is too large, flunk it.     GMP_RALG_cf_app_struct cf_decomp;
922           if (parblock->n > 0x00FFFFFF)     GMP_RALG_fab_neighbor_collection_struct neighbor_data;
923              {     int error_flag;
924              printf("\"%s\" is an unsigned integer but exceeds 24 bits.\n", argv[i]);  
925              exit(4);     //Allocate all dynamic memory.
926              }     GMP_RATS_mpq_init(&hmax_over_one);
927       GMP_RATS_mpq_init(&hmax_over_kmax);
928           //OK, we're cool ...     GMP_INTS_mpz_init(&dap_denominator);
929           }     GMP_RATS_mpq_init(&rn_in_abs);
930        else  
931           {     //Set the DAP denominator to 1e108.
932           //Two possibilities left.  Either general parameter, or else unrecognized.     GMP_INTS_mpz_set_general_int(&dap_denominator,
933           CU_MSGS_cmd_line_par_results_struct_process_arg(&(parblock->argblock),                                  &error_flag,
934                                                           argv[i],                                  "1e108");
935                                                           &recognized);  
936           if (!recognized)     //By convention, we will not mess with anything with an
937              {     //absolute value greater than HMAX/1.  If such a condition exists, puke out.
938              printf("\"%s\" is not a recognized command-line parameter.\n", argv[i]);     //Form up the value of HMAX/1 if HMAX was specified.
939              exit(4);     if (parblock->hmax_specified)
940              }        {
941          GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));
942           //Was picked up as general parameter.        GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);
943           }        GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));
944        }        GMP_INTS_mpz_abs(&(rn_in_abs.num));
945          if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)
946     //Congeal our thoughts on the "general" command-line parameters.  No errors possible           {
947     //here.           printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"
948     CU_MSGS_cmd_line_par_results_struct_finalize(&(parblock->argblock));                  "has no neighbors in the series of interest.  Calculation cannot continue.\n");
949             exit(4);
950     //printf("Boo.\n");           }
951     //printf("neverlarger %d succ %d\n", parblock->neverlarger_specified, parblock->succ_specified);        }
952    
953     //Look for mutually exclusive options among the program-specific parameters.     //If the "verbose" option is specified, we want to give the continued fraction
954     if (     //partial quotients and convergents of either the number to approximate,
955           (parblock->neversmaller_specified && (parblock->neverlarger_specified || parblock->pred_specified || parblock->succ_specified|| parblock->n_specified))     //its reciprocal, or none of the above, as appropriate; and give a bit more
956           ||     //information, in addition.
957           (parblock->neverlarger_specified && (parblock->pred_specified || parblock->succ_specified || parblock->n_specified))     if (parblock->argblock.verbose)
958           ||        {
959           (parblock->pred_specified && (parblock->succ_specified|| parblock->n_specified))        if (parblock->hmax_specified)
960           ||           {
961           (parblock->succ_specified && parblock->n_specified)           //Stuff HMAX/KMAX.  This is necessary for comparison.
962        )           GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));
963        {           GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));
964        printf("The \"-neversmaller\", \"-neverlarger\", \"-pred\", \"-succ\", and \"-n\" options are\nmutually exclusive.\n");           }
965        exit(4);  
966        }        if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))
967             {
968     //OK, we're clean, all pars in order.           //Either HMAX was not specified or else we are below the corner point on the
969     }           //integer lattice.  Get the continued fraction representation of the number
970             //rather than its reciprocal.
971             GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));
972  //Releases the dynamic memory associated with the parameter block.  
973  static void release_command_line_args(struct CfbrapabCmainStruct *parblock)           //Print out the continued fraction decomposition of the rational number.
974     {           GMP_RALG_cfdecomp_emit(stdout,
975     assert(parblock != NULL);                                  "CF Representation Of Absolute Value Of Rational Number Specified",
976                                    &cf_decomp,
977     //This function is superfluous, since in a command-line utility it doesn't really                                  0,
978     //matter if everything is released.  But, here goes.                                  1,
979     CU_MSGS_cmd_line_par_results_struct_destroy(&(parblock->argblock));                                  &dap_denominator);
980     GMP_RATS_mpq_clear(&(parblock->rn));  
981     GMP_INTS_mpz_clear(&(parblock->kmax));           //Destroy the decomposition--free the memory.
982     GMP_INTS_mpz_clear(&(parblock->hmax));           GMP_RALG_cfdecomp_destroy(&cf_decomp);
983     }           }
984          else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)
985             {
986  //Prints out a single rational number in the format endorsed           //In this case, the rational number specified is exactly the same in
987  //by this program.  This often includes DAP information           //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.
988  //and difference information.  It is assumed that the           printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");
989  //previous information is terminated by a horizontal line,           }
990  //and this function terminates with a horizontal line.        else
991  static void CMAIN_print_app_in_std_form(FILE *s,           {
992                                          int index,           //The number specified is beyond the corner point.  It is appropriate to
993                                          GMP_RATS_mpq_struct *rn,           //provide the decomposition of the reciprocal rather than of the number
994                                          GMP_RATS_mpq_struct *approx,           //itself.
995                                          int nf,           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));
996                                          int show_diff,  
997                                          int show_dap,           //Print out the continued fraction decomposition of the rational number.
998                                          GMP_INTS_mpz_struct *dap_den)           GMP_RALG_cfdecomp_emit(stdout,
999     {                                  "CF Representation Of Reciprocal Of Absolute Value Of Rational Number Specified",
1000     char sbuf[250];                                  &cf_decomp,
1001     GMP_RATS_mpq_struct diff, q_temp1;                                  0,
1002     GMP_INTS_mpz_struct z_temp1, quotient, remainder;                                  1,
1003                                    &dap_denominator);
1004     //Eyeball the input parameters.  
1005     assert(s != NULL);           //Destroy the decomposition--free the memory.
1006     assert(rn != NULL);           GMP_RALG_cfdecomp_destroy(&cf_decomp);
1007     assert(approx != NULL);           }
1008     assert(dap_den != NULL);        } //End if verbose.
1009    
1010     //Allocate.     //Do all the work to get the neighbors of the number passed.
1011     GMP_RATS_mpq_init(&diff);     GMP_RALG_consecutive_fab_terms(
1012     GMP_RATS_mpq_init(&q_temp1);             &(parblock->rn),
1013     GMP_INTS_mpz_init(&z_temp1);             &(parblock->kmax),
1014     GMP_INTS_mpz_init(&quotient);             (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),
1015     GMP_INTS_mpz_init(&remainder);             1,
1016               0,
1017     //Print out the approximation numerator.             &neighbor_data);
1018     sprintf(sbuf, "approx_num(%d)", index);  
1019     if (!nf)     //Print the neighbor data block for debugging.
1020        {     #if 0
1021        GMP_INTS_mpz_long_int_format_to_stream(s,     GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);
1022                                               &(approx->num),     #endif
1023                                               sbuf);  
1024        }     //Print the neighbor on the left, if it exists.
1025     else     if (neighbor_data.n_left_out)
1026        {        {
1027        int nreserved;        CMAIN_print_app_in_std_form(stdout,
1028        char *p;                                    -1,
1029                                            &(neighbor_data.rn_in),
1030        fprintf(s, "%d\n", index);                                    &(neighbor_data.lefts[0].neighbor),
1031                                            parblock->argblock.noformat,
1032        nreserved = GMP_INTS_mpz_size_in_base_10(&(approx->num));                                    0,
1033        p = CCMALLOC_malloc(sizeof(char) * nreserved);                                    0,
1034        GMP_INTS_mpz_to_string(p, &(approx->num));                                    &dap_denominator);
1035        fprintf(s, "%s\n", p);        }
1036        CCMALLOC_free(p);  
1037        }     //Deallocate all dynamic memory.
1038       GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);
1039     if (!nf)     GMP_RATS_mpq_clear(&hmax_over_one);
1040        FCMIOF_hline();     GMP_RATS_mpq_clear(&hmax_over_kmax);
1041       GMP_INTS_mpz_clear(&dap_denominator);
1042     //Print out the approximation denominator.     GMP_RATS_mpq_clear(&rn_in_abs);
1043     sprintf(sbuf, "approx_den(%d)", index);  
1044     if (!nf)     return(rv);
1045        {     }
1046        GMP_INTS_mpz_long_int_format_to_stream(s,  
1047                                               &(approx->den),  
1048                                               sbuf);  //Handles the case of finding the successor.
1049        }  int CMAIN_successor(struct CfbrapabCmainStruct *parblock)
1050     else     {
1051        {     int rv = 0;
1052        int nreserved;     GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;
1053        char *p;     GMP_INTS_mpz_struct dap_denominator;
1054       GMP_RALG_cf_app_struct cf_decomp;
1055        nreserved = GMP_INTS_mpz_size_in_base_10(&(approx->den));     GMP_RALG_fab_neighbor_collection_struct neighbor_data;
1056        p = CCMALLOC_malloc(sizeof(char) * nreserved);     int error_flag;
1057        GMP_INTS_mpz_to_string(p, &(approx->den));  
1058        fprintf(s, "%s\n", p);     //Allocate all dynamic memory.
1059        CCMALLOC_free(p);     GMP_RATS_mpq_init(&hmax_over_one);
1060        }     GMP_RATS_mpq_init(&hmax_over_kmax);
1061       GMP_INTS_mpz_init(&dap_denominator);
1062     if (!nf)     GMP_RATS_mpq_init(&rn_in_abs);
1063        FCMIOF_hline();  
1064       //Set the DAP denominator to 1e108.
1065       GMP_INTS_mpz_set_general_int(&dap_denominator,
1066     //If the "dap" flag is set, calculate and display decimal equivalent of the                                  &error_flag,
1067     //approximation.                                  "1e108");
1068     if (show_dap)  
1069        {     //By convention, we will not mess with anything with an
1070        //Make the calculation for decimal approximation.     //absolute value greater than HMAX/1.  If such a condition exists, puke out.
1071        GMP_RATS_mpq_copy(&q_temp1, approx);     //Form up the value of HMAX/1 if HMAX was specified.
1072        GMP_RATS_mpq_normalize(&q_temp1);     if (parblock->hmax_specified)
1073        GMP_INTS_mpz_mul(&z_temp1, dap_den, &q_temp1.num);        {
1074        GMP_INTS_mpz_tdiv_qr(&quotient, &remainder,        GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));
1075                             &z_temp1, &q_temp1.den);        GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);
1076          GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));
1077        sprintf(sbuf, "dap_num(%d)", index);        GMP_INTS_mpz_abs(&(rn_in_abs.num));
1078        if (!nf)        if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)
1079           {           {
1080           GMP_INTS_mpz_long_int_format_to_stream(s,           printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"
1081                                                  &(quotient),                  "has no neighbors in the series of interest.  Calculation cannot continue.\n");
1082                                                  sbuf);           exit(4);
1083           }           }
1084        else        }
1085           {  
1086           int nreserved;     //If the "verbose" option is specified, we want to give the continued fraction
1087           char *p;     //partial quotients and convergents of either the number to approximate,
1088       //its reciprocal, or none of the above, as appropriate; and give a bit more
1089           nreserved = GMP_INTS_mpz_size_in_base_10(&(quotient));     //information, in addition.
1090           p = CCMALLOC_malloc(sizeof(char) * nreserved);     if (parblock->argblock.verbose)
1091           GMP_INTS_mpz_to_string(p, &(quotient));        {
1092           fprintf(s, "%s\n", p);        if (parblock->hmax_specified)
1093           CCMALLOC_free(p);           {
1094           }           //Stuff HMAX/KMAX.  This is necessary for comparison.
1095             GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));
1096        if (!nf)           GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));
1097           FCMIOF_hline();           }
1098    
1099        //Print out the approximation denominator.        if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))
1100        sprintf(sbuf, "dap_den(%d)", index);           {
1101        if (!nf)           //Either HMAX was not specified or else we are below the corner point on the
1102           {           //integer lattice.  Get the continued fraction representation of the number
1103           GMP_INTS_mpz_long_int_format_to_stream(s,           //rather than its reciprocal.
1104                                                  dap_den,           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));
1105                                                  sbuf);  
1106           }           //Print out the continued fraction decomposition of the rational number.
1107        else           GMP_RALG_cfdecomp_emit(stdout,
1108           {                                  "CF Representation Of Absolute Value Of Rational Number Specified",
1109           int nreserved;                                  &cf_decomp,
1110           char *p;                                  0,
1111                                    1,
1112           nreserved = GMP_INTS_mpz_size_in_base_10(dap_den);                                  &dap_denominator);
1113           p = CCMALLOC_malloc(sizeof(char) * nreserved);  
1114           GMP_INTS_mpz_to_string(p, dap_den);           //Destroy the decomposition--free the memory.
1115           fprintf(s, "%s\n", p);           GMP_RALG_cfdecomp_destroy(&cf_decomp);
1116           CCMALLOC_free(p);           }
1117           }        else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)
1118             {
1119        if (!nf)           //In this case, the rational number specified is exactly the same in
1120           FCMIOF_hline();           //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.
1121        }           printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");
1122             }
1123            else
1124     //If the "diff" flag is set, calculate and display the rational difference.           {
1125     if (show_diff)           //The number specified is beyond the corner point.  It is appropriate to
1126        {           //provide the decomposition of the reciprocal rather than of the number
1127        GMP_RATS_mpq_sub(&diff, approx, rn);           //itself.
1128        GMP_RATS_mpq_normalize(&diff);           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));
1129    
1130        sprintf(sbuf, "error_num(%d)", index);           //Print out the continued fraction decomposition of the rational number.
1131        if (!nf)           GMP_RALG_cfdecomp_emit(stdout,
1132           {                                  "CF Representation Of Reciprocal Of Absolute Value Of Rational Number Specified",
1133           GMP_INTS_mpz_long_int_format_to_stream(s,                                  &cf_decomp,
1134                                                  &(diff.num),                                  0,
1135                                                  sbuf);                                  1,
1136           }                                  &dap_denominator);
1137        else  
1138           {           //Destroy the decomposition--free the memory.
1139           int nreserved;           GMP_RALG_cfdecomp_destroy(&cf_decomp);
1140           char *p;           }
1141          } //End if verbose.
1142           nreserved = GMP_INTS_mpz_size_in_base_10(&(diff.num));  
1143           p = CCMALLOC_malloc(sizeof(char) * nreserved);     //Do all the work to get the neighbors of the number passed.
1144           GMP_INTS_mpz_to_string(p, &(diff.num));     GMP_RALG_consecutive_fab_terms(
1145           fprintf(s, "%s\n", p);             &(parblock->rn),
1146           CCMALLOC_free(p);             &(parblock->kmax),
1147           }             (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),
1148               0,
1149        if (!nf)             1,
1150           FCMIOF_hline();             &neighbor_data);
1151    
1152        //Print out the approximation denominator.     //Print the neighbor data block for debugging.
1153        sprintf(sbuf, "error_den(%d)", index);     #if 0
1154        if (!nf)     GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);
1155           {     #endif
1156           GMP_INTS_mpz_long_int_format_to_stream(s,  
1157                                                  &(diff.den),     //Print the neighbor on the right, if it exists.
1158                                                  sbuf);     if (neighbor_data.n_right_out)
1159           }        {
1160        else        CMAIN_print_app_in_std_form(stdout,
1161           {                                    -1,
1162           int nreserved;                                    &(neighbor_data.rn_in),
1163           char *p;                                    &(neighbor_data.rights[0].neighbor),
1164                                      parblock->argblock.noformat,
1165           nreserved = GMP_INTS_mpz_size_in_base_10(&(diff.den));                                    0,
1166           p = CCMALLOC_malloc(sizeof(char) * nreserved);                                    0,
1167           GMP_INTS_mpz_to_string(p, &(diff.den));                                    &dap_denominator);
1168           fprintf(s, "%s\n", p);        }
1169           CCMALLOC_free(p);  
1170           }     //Deallocate all dynamic memory.
1171       GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);
1172        if (!nf)     GMP_RATS_mpq_clear(&hmax_over_one);
1173           FCMIOF_hline();     GMP_RATS_mpq_clear(&hmax_over_kmax);
1174        }     GMP_INTS_mpz_clear(&dap_denominator);
1175       GMP_RATS_mpq_clear(&rn_in_abs);
1176     //Deallocate.  
1177     GMP_RATS_mpq_clear(&diff);     return(rv);
1178     GMP_RATS_mpq_clear(&q_temp1);     }
1179     GMP_INTS_mpz_clear(&z_temp1);  
1180     GMP_INTS_mpz_clear(&quotient);  
1181     GMP_INTS_mpz_clear(&remainder);  int c_main(int argc, char* argv[])
1182     }     {
1183       int rv=0;
1184       struct CfbrapabCmainStruct parblock;
1185  //Handles the classic case of finding the closest  
1186  //neighbor(s).     if (argc==2 && !strcmp(argv[1], "-help"))
1187  static int CMAIN_classic_closest_neighbor(struct CfbrapabCmainStruct *parblock)        {
1188     {        FCMIOF_hline();
1189     int rv = 0;        printf("DESCRIPTION\n");
1190     GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;        printf("   This utility calculates best rational approximations of the form h/k\n");
1191     GMP_INTS_mpz_struct dap_denominator;        printf("   under the constraint k <= KMAX (i.e. in the Farey series of order KMAX),\n");
1192     GMP_RALG_cf_app_struct cf_decomp;        printf("   or under the constraints k <= KMAX and h <= HMAX (i.e. in a rectangular\n");
1193     GMP_RALG_fab_neighbor_collection_struct neighbor_data;        printf("   region of the integer lattice).  This utility uses continued fraction\n");
1194     int error_flag;        printf("   algorithms presented in the accompanying book \"A Practitioner's Guide\n");
1195          printf("   ...\", and this book (a work in progress) should be consulted both as a\n");
1196     //Allocate all dynamic memory.        printf("   reference to the algorithms and a reference for this utility.  All\n");
1197     GMP_RATS_mpq_init(&hmax_over_one);        printf("   rational numbers calculated are in lowest terms.  This utility will\n");
1198     GMP_RATS_mpq_init(&hmax_over_kmax);        printf("   operate on negative numbers, but all results are produced by symmetry\n");
1199     GMP_INTS_mpz_init(&dap_denominator);        printf("   (the continued fraction representation of negative numbers is NOT\n");
1200     GMP_RATS_mpq_init(&rn_in_abs);        printf("   calculated).  The default operation of this utility is to calculated the\n");
1201          printf("   closest rational number in the series of interest.  If the rational\n");
1202     //Set the DAP denominator to 1e108.        printf("   number supplied is equidistant between two formable rational numbers in\n");
1203     GMP_INTS_mpz_set_general_int(&dap_denominator,        printf("   the series of interest, the neighbor smaller in magnitude is returned.  If\n");
1204                                  &error_flag,        printf("   the rational number supplied is already formable, it is returned in lowest\n");
1205                                  "1e108");        printf("   terms.  If the rational number supplied does not have neighbors (i.e. it\n");
1206          printf("   is larger than HMAX/1), an error is generated.\n");
1207     //By convention, we will not mess with anything with an        printf("\n");
1208     //absolute value greater than HMAX/1.  If such a condition exists, puke out.        printf("USAGE\n");
1209     //Form up the value of HMAX/1 if HMAX was specified.        printf("   cfbrapab srn urn_kmax [options]\n");
1210     if (parblock->hmax_specified)        printf("   cfbrapab srn urn_kmax urn_hmax [options]\n");
1211        {        printf("   cfbrapab -help\n");
1212        GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));        printf("\n");
1213        GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);        printf("OPTIONS\n");
1214        GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));        printf("   -neversmaller, -neverlarger\n");
1215        GMP_INTS_mpz_abs(&(rn_in_abs.num));        printf("      The -neversmaller option will prohibit this utility from choosing a\n");
1216        if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)        printf("      rational approximation which is smaller than the rational number\n");
1217           {        printf("      supplied.  Thus, this option will force the utility to choose the right\n");
1218           printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"        printf("      neighbor rather than the left, regardless of relative distance.  The\n");
1219                  "has no neighbors in the series of interest.  Calculation cannot continue.\n");        printf("      behavior if the rational number supplied is formable under the \n");
1220           exit(4);        printf("      constraints is unchanged.  The -neverlarger option is analogous.\n");
1221           }        printf("      These options cannot be used with -n, -pred, or -succ.\n");
1222        }        printf("   -pred, -succ\n");
1223          printf("      Will cause the utility to find the predecessor or successor in the\n");
1224     //If the "verbose" option is specified, we want to give the continued fraction        printf("      series of interest to the rational number supplied (in the event the\n");
1225     //partial quotients and convergents of either the number to approximate,        printf("      number supplied is already formable under the constraints).  For\n");
1226     //its reciprocal, or none of the above, as appropriate; and give a bit more        printf("      numbers not already formable under the constraints, the left or right\n");
1227     //information, in addition.        printf("      formable neighbor will be returned.  Supplying a rational number that\n");
1228     if (parblock->argblock.verbose)        printf("      does not have a predecessor or successor (i.e. < 0/1 or > HMAX/1) will\n");
1229        {        printf("      generate an error.  These options cannot be used with -neversmaller,\n");
1230        if (parblock->hmax_specified)        printf("      -neverlarger, or -n.\n");
1231           {        CU_MSGS_std_options(stdout, PNAME);
1232           //Stuff HMAX/KMAX.  This is necessary for comparison.        FCMIOF_hline();
1233           GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));        CU_MSGS_toolset_info_msg(stdout, PNAME);
1234           GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));        FCMIOF_hline();
1235           }        }
1236       else if (argc < 3)
1237        if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))        {
1238           {        CU_MSGS_too_few_args_msg(stdout, PNAME);
1239           //Either HMAX was not specified or else we are below the corner point on the        rv = 4;
1240           //integer lattice.  Get the continued fraction representation of the number        goto ret_pt;
1241           //rather than its reciprocal.        }
1242           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));     else
1243          {
1244           //Print out the continued fraction decomposition of the rational number.        //In this branch, we must have an invocation of the form
1245           GMP_RALG_cfdecomp_emit(stdout,        //   cfbrapab SRN KMAX <options>
1246                                  "CF Rep Of Abs Value Of Number Specified",        //or
1247                                  &cf_decomp,        //   cfbrapab SRN KMAX HMAX <options>
1248                                  0,        //
1249                                  1,        //Call the function to collect all the command-line parameters.
1250                                  &dap_denominator);        //This function takes care of error processing, as well.  If there
1251          //is an error of any kind, the function will simply abort and
1252           //Destroy the decomposition--free the memory.        //supply the right return error code of 4.
1253           GMP_RALG_cfdecomp_destroy(&cf_decomp);        process_command_line_args(&parblock,
1254           }                                   argc,
1255        else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)                                   argv);
1256           {  
1257           //In this case, the rational number specified is exactly the same in        //If the debug option was set, emit the debugging information.
1258           //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.        if (parblock.argblock.debug)
1259           printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");           {
1260           }           FCMIOF_hline();
1261        else           CU_MSGS_emit_vcinfo_from_ptr_table(stdout,C_MAIN_vcinfoptrs,PNAMEUC);
1262           {           }
1263           //The number specified is beyond the corner point.  It is appropriate to  
1264           //provide the decomposition of the reciprocal rather than of the number        //Emit the opening horizontal line iff the -nf option isn't set.
1265           //itself.        if (!(parblock.argblock.noformat))
1266           GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));           FCMIOF_hline();
1267    
1268           //Print out the continued fraction decomposition of the rational number.        //Print out a major mode message to indicate what we are trying to do.
1269           GMP_RALG_cfdecomp_emit(stdout,        if (!(parblock.argblock.noformat))
1270                                  "CF Rep Of Reciprocal Of Abs Value Of Number Specified",           {
1271                                  &cf_decomp,           if (!parblock.neversmaller_specified && !parblock.neverlarger_specified && !parblock.pred_specified && !parblock.succ_specified)
1272                                  0,              {
1273                                  1,              printf("MAJOR MODE:  Finding closest rational number(s) under the constraints.\n");
1274                                  &dap_denominator);              }
1275             else if (parblock.neversmaller_specified)
1276           //Destroy the decomposition--free the memory.              {
1277           GMP_RALG_cfdecomp_destroy(&cf_decomp);              printf("MAJOR MODE:  Finding closest rational number with magnitude not smaller under\n             the constraints.\n");
1278           }              }
1279        } //End if verbose.           else if (parblock.neverlarger_specified)
1280                {
1281     //Do all the work to get the neighbors of the number passed.              printf("MAJOR MODE:  Finding closest rational number with magnitude not larger under\n             the constraints.\n");
1282     GMP_RALG_consecutive_fab_terms(              }
1283             &(parblock->rn),           else if (parblock.pred_specified)
1284             &(parblock->kmax),              {
1285             (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),              printf("MAJOR MODE:  Finding predecessor under the constraints.\n");
1286             1,              }
1287             1,           else if (parblock.succ_specified)
1288             &neighbor_data);              {
1289                printf("MAJOR MODE:  Finding successor under the constraints.\n");
1290     //Print the neighbor data block for debugging.              }
1291     #if 0           else
1292     GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);              {
1293     #endif              assert(0);
1294                }
1295     //There are four possibilities at this point.  
1296     //  a)Attempting to find the rational neighbors generated an error.           FCMIOF_hline();
1297     //  b)The rational number specified was already in the series of interest,           }
1298     //    in which case we will use it.  
1299     //  c)The left neighbor is closer or in a tie we want to choose it.        //Echo back the command-line parameters.
1300     //  d)The right neighbor is closer or in a tie we want to choose it.        if (!(parblock.argblock.noformat))
1301     if (neighbor_data.error)           {
1302        {           GMP_INTS_mpz_long_int_format_to_stream(stdout,
1303        //                                                  &(parblock.rn.num),
1304        printf("Internal error: %s\n", neighbor_data.error);                                                  "RI_IN   Numerator");
1305        }           FCMIOF_hline();
1306     else if (neighbor_data.equality)           GMP_INTS_mpz_long_int_format_to_stream(stdout,
1307        {                                                  &(parblock.rn.den),
1308        CMAIN_print_app_in_std_form(stdout,                                                  "RI_IN Denominator");
1309                                    0,           FCMIOF_hline();
1310                                    &(neighbor_data.rn_in),  
1311                                    &(neighbor_data.rn_in),           GMP_INTS_mpz_long_int_format_to_stream(stdout,
1312                                    parblock->argblock.noformat,                                                  &(parblock.kmax),
1313                                    0,                                                  "K_MAX");
1314                                    1,           FCMIOF_hline();
1315                                    &dap_denominator);  
1316        }           if (parblock.hmax_specified)
1317     else              {
1318        {              GMP_INTS_mpz_long_int_format_to_stream(stdout,
1319        GMP_RATS_mpq_struct left_neighbor, right_neighbor,                                                     &(parblock.hmax),
1320                            left_diff, right_diff,                                                     "H_MAX");
1321                            left_abs, right_abs;              FCMIOF_hline();
1322        int error_cmp;              }
1323        int mag_cmp;  
1324             if (parblock.n_specified)
1325        GMP_RATS_mpq_init(&left_neighbor);              {
1326        GMP_RATS_mpq_init(&right_neighbor);              GMP_INTS_mpz_struct temp24;
1327        GMP_RATS_mpq_init(&left_diff);  
1328        GMP_RATS_mpq_init(&right_diff);              GMP_INTS_mpz_init(&temp24);
1329        GMP_RATS_mpq_init(&left_abs);  
1330        GMP_RATS_mpq_init(&right_abs);              GMP_INTS_mpz_set_ui(&temp24, parblock.n);
1331    
1332        //Snatch the left neighbor.              GMP_INTS_mpz_long_int_format_to_stream(stdout,
1333        if (neighbor_data.n_left_out)                                                     &temp24,
1334           {                                                     "Number Of Neighbors");
1335           GMP_RATS_mpq_copy(&left_neighbor, &(neighbor_data.lefts[0].neighbor));  
1336           }              FCMIOF_hline();
1337    
1338        //Snatch the right neighbor.              GMP_INTS_mpz_clear(&temp24);
1339        if (neighbor_data.n_right_out)              }
1340           {           }
1341           GMP_RATS_mpq_copy(&right_neighbor, &(neighbor_data.rights[0].neighbor));  
1342           }        //We need to split now into distinct cases
1343          //depending on the command-line parameters.  We will
1344        //Calculate the differences, take their absolute        //then hack out solutions for each case.
1345        //values.        if (!parblock.pred_specified && !parblock.succ_specified && !parblock.n_specified)
1346        GMP_RATS_mpq_sub(&left_diff,  &left_neighbor,  &(neighbor_data.rn_in));           {
1347        GMP_RATS_mpq_sub(&right_diff, &right_neighbor, &(neighbor_data.rn_in));           //Classic closest neighbor case.
1348        GMP_RATS_mpq_normalize(&left_diff);           rv = CMAIN_classic_closest_neighbor(&parblock);
1349        GMP_RATS_mpq_normalize(&right_diff);           }
1350        GMP_INTS_mpz_abs(&(left_diff.num));        else if (parblock.n_specified)
1351        GMP_INTS_mpz_abs(&(right_diff.num));           {
1352             //Classic multiple neighbor case.
1353        //Now that the differences are calculated, take the           rv = CMAIN_multiple_neighbor(&parblock);
1354        //absolute values of the neighbors themselves.           }
1355        //We will use this to break ties.        else if (parblock.pred_specified)
1356        GMP_RATS_mpq_normalize(&left_neighbor);           {
1357        GMP_RATS_mpq_normalize(&right_neighbor);           rv = CMAIN_predecessor(&parblock);
1358        GMP_INTS_mpz_abs(&(left_neighbor.num));           }
1359        GMP_INTS_mpz_abs(&(right_neighbor.num));        else if (parblock.succ_specified)
1360             {
1361        //Compare the relative differences and magnitudes.           rv = CMAIN_successor(&parblock);
1362        error_cmp = GMP_RATS_mpq_cmp(&left_diff, &right_diff, NULL);           }
1363        mag_cmp   = GMP_RATS_mpq_cmp(&left_neighbor, &right_neighbor, NULL);        else
1364             {
1365        //Figure out which to present as the best approximation and           assert(0);
1366        //do it.           }
1367        if (!(parblock->neversmaller_specified) &&  
1368           ((parblock->neverlarger_specified) || (error_cmp < 0) || ((error_cmp == 0) && (mag_cmp < 0))))        //Emit the closing horizontal line iff the -nf option isn't set.
1369           {        //if (!(parblock.argblock.noformat))
1370           CMAIN_print_app_in_std_form(stdout,        //   FCMIOF_hline();
1371                                       -1,  
1372                                       &(neighbor_data.rn_in),        //Release all dynamic memory.
1373                                       &(neighbor_data.lefts[0].neighbor),        release_command_line_args(&parblock);
1374                                       parblock->argblock.noformat,        }
1375                                       1,  
1376                                       1,     ret_pt:
1377                                       &dap_denominator);     return(rv);
1378           }     }
1379        else  
1380           {  // End of c_main.c.
          CMAIN_print_app_in_std_form(stdout,  
                                      1,  
                                      &(neighbor_data.rn_in),  
                                      &(neighbor_data.rights[0].neighbor),  
                                      parblock->argblock.noformat,  
                                      1,  
                                      1,  
                                      &dap_denominator);  
          }  
   
       //Deallocate.  
       GMP_RATS_mpq_clear(&left_neighbor);  
       GMP_RATS_mpq_clear(&right_neighbor);  
       GMP_RATS_mpq_clear(&left_diff);  
       GMP_RATS_mpq_clear(&right_diff);  
       GMP_RATS_mpq_clear(&left_abs);  
       GMP_RATS_mpq_clear(&right_abs);  
       }  
   
    //Deallocate all dynamic memory.  
    GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);  
    GMP_RATS_mpq_clear(&hmax_over_one);  
    GMP_RATS_mpq_clear(&hmax_over_kmax);  
    GMP_INTS_mpz_clear(&dap_denominator);  
    GMP_RATS_mpq_clear(&rn_in_abs);  
   
    return(rv);  
    }  
   
   
 //Handles the case of finding multiple neighbors.  
   
 static int CMAIN_multiple_neighbor(struct CfbrapabCmainStruct *parblock)  
    {  
    int rv = 0;  
    GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;  
    GMP_INTS_mpz_struct dap_denominator;  
    GMP_RALG_cf_app_struct cf_decomp;  
    GMP_RALG_fab_neighbor_collection_struct neighbor_data;  
    int error_flag;  
    int i;  
   
    //Allocate all dynamic memory.  
    GMP_RATS_mpq_init(&hmax_over_one);  
    GMP_RATS_mpq_init(&hmax_over_kmax);  
    GMP_INTS_mpz_init(&dap_denominator);  
    GMP_RATS_mpq_init(&rn_in_abs);  
   
    //Set the DAP denominator to 1e108.  
    GMP_INTS_mpz_set_general_int(&dap_denominator,  
                                 &error_flag,  
                                 "1e108");  
   
    //By convention, we will not mess with anything with an  
    //absolute value greater than HMAX/1.  If such a condition exists, puke out.  
    //Form up the value of HMAX/1 if HMAX was specified.  
    if (parblock->hmax_specified)  
       {  
       GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));  
       GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);  
       GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));  
       GMP_INTS_mpz_abs(&(rn_in_abs.num));  
       if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)  
          {  
          printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"  
                 "has no neighbors in the series of interest.  Calculation cannot continue.\n");  
          exit(4);  
          }  
       }  
   
    //If the "verbose" option is specified, we want to give the continued fraction  
    //partial quotients and convergents of either the number to approximate,  
    //its reciprocal, or none of the above, as appropriate; and give a bit more  
    //information, in addition.  
    if (parblock->argblock.verbose)  
       {  
       if (parblock->hmax_specified)  
          {  
          //Stuff HMAX/KMAX.  This is necessary for comparison.  
          GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));  
          GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));  
          }  
   
       if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))  
          {  
          //Either HMAX was not specified or else we are below the corner point on the  
          //integer lattice.  Get the continued fraction representation of the number  
          //rather than its reciprocal.  
          GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));  
   
          //Print out the continued fraction decomposition of the rational number.  
          GMP_RALG_cfdecomp_emit(stdout,  
                                 "CF Representation Of Absolute Value Of Rational Number Specified",  
                                 &cf_decomp,  
                                 0,  
                                 1,  
                                 &dap_denominator);  
   
          //Destroy the decomposition--free the memory.  
          GMP_RALG_cfdecomp_destroy(&cf_decomp);  
          }  
       else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)  
          {  
          //In this case, the rational number specified is exactly the same in  
          //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.  
          printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");  
          }  
       else  
          {  
          //The number specified is beyond the corner point.  It is appropriate to  
          //provide the decomposition of the reciprocal rather than of the number  
          //itself.  
          GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));  
   
          //Print out the continued fraction decomposition of the rational number.  
          GMP_RALG_cfdecomp_emit(stdout,  
                                 "CF Representation Of Reciprocal Of Absolute Value Of Rational Number Specified",  
                                 &cf_decomp,  
                                 0,  
                                 1,  
                                 &dap_denominator);  
   
          //Destroy the decomposition--free the memory.  
          GMP_RALG_cfdecomp_destroy(&cf_decomp);  
          }  
       } //End if verbose.  
   
    //Do all the work to get the neighbors of the number passed.  
    GMP_RALG_consecutive_fab_terms(  
            &(parblock->rn),  
            &(parblock->kmax),  
            (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),  
            parblock->n,  
            parblock->n,  
            &neighbor_data);  
   
    //Print the neighbor data block for debugging.  
    #if 0  
    GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);  
    #endif  
   
    //Loop through, printing out the left neighbors in order.  
    for (i = neighbor_data.n_left_out - 1; i >= 0; i--)  
       {  
       CMAIN_print_app_in_std_form(stdout,  
                                   -(i + 1),  
                                   &(neighbor_data.rn_in),  
                                   &(neighbor_data.lefts[i].neighbor),  
                                   parblock->argblock.noformat,  
                                   1,  
                                   1,  
                                   &dap_denominator);  
       }  
   
    //If the number itself appears in the series of interest, spit that out.  
    if (neighbor_data.equality)  
       {  
       CMAIN_print_app_in_std_form(stdout,  
                                   0,  
                                   &(neighbor_data.rn_in),  
                                   &(neighbor_data.norm_rn),  
                                   parblock->argblock.noformat,  
                                   1,  
                                   1,  
                                   &dap_denominator);  
       }  
   
    //Loop through, printing out the right neighbors in order.  
    for (i = 0; i < neighbor_data.n_right_out; i++)  
       {  
       CMAIN_print_app_in_std_form(stdout,  
                                   i+1,  
                                   &(neighbor_data.rn_in),  
                                   &(neighbor_data.rights[i].neighbor),  
                                   parblock->argblock.noformat,  
                                   1,  
                                   1,  
                                   &dap_denominator);  
       }  
   
    //Deallocate all dynamic memory.  
    GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);  
    GMP_RATS_mpq_clear(&hmax_over_one);  
    GMP_RATS_mpq_clear(&hmax_over_kmax);  
    GMP_INTS_mpz_clear(&dap_denominator);  
    GMP_RATS_mpq_clear(&rn_in_abs);  
   
    return(rv);  
    }  
   
   
 //Handles the case of finding the predecessor.  
 int CMAIN_predecessor(struct CfbrapabCmainStruct *parblock)  
    {  
    int rv = 0;  
    GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;  
    GMP_INTS_mpz_struct dap_denominator;  
    GMP_RALG_cf_app_struct cf_decomp;  
    GMP_RALG_fab_neighbor_collection_struct neighbor_data;  
    int error_flag;  
   
    //Allocate all dynamic memory.  
    GMP_RATS_mpq_init(&hmax_over_one);  
    GMP_RATS_mpq_init(&hmax_over_kmax);  
    GMP_INTS_mpz_init(&dap_denominator);  
    GMP_RATS_mpq_init(&rn_in_abs);  
   
    //Set the DAP denominator to 1e108.  
    GMP_INTS_mpz_set_general_int(&dap_denominator,  
                                 &error_flag,  
                                 "1e108");  
   
    //By convention, we will not mess with anything with an  
    //absolute value greater than HMAX/1.  If such a condition exists, puke out.  
    //Form up the value of HMAX/1 if HMAX was specified.  
    if (parblock->hmax_specified)  
       {  
       GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));  
       GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);  
       GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));  
       GMP_INTS_mpz_abs(&(rn_in_abs.num));  
       if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)  
          {  
          printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"  
                 "has no neighbors in the series of interest.  Calculation cannot continue.\n");  
          exit(4);  
          }  
       }  
   
    //If the "verbose" option is specified, we want to give the continued fraction  
    //partial quotients and convergents of either the number to approximate,  
    //its reciprocal, or none of the above, as appropriate; and give a bit more  
    //information, in addition.  
    if (parblock->argblock.verbose)  
       {  
       if (parblock->hmax_specified)  
          {  
          //Stuff HMAX/KMAX.  This is necessary for comparison.  
          GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));  
          GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));  
          }  
   
       if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))  
          {  
          //Either HMAX was not specified or else we are below the corner point on the  
          //integer lattice.  Get the continued fraction representation of the number  
          //rather than its reciprocal.  
          GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));  
   
          //Print out the continued fraction decomposition of the rational number.  
          GMP_RALG_cfdecomp_emit(stdout,  
                                 "CF Representation Of Absolute Value Of Rational Number Specified",  
                                 &cf_decomp,  
                                 0,  
                                 1,  
                                 &dap_denominator);  
   
          //Destroy the decomposition--free the memory.  
          GMP_RALG_cfdecomp_destroy(&cf_decomp);  
          }  
       else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)  
          {  
          //In this case, the rational number specified is exactly the same in  
          //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.  
          printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");  
          }  
       else  
          {  
          //The number specified is beyond the corner point.  It is appropriate to  
          //provide the decomposition of the reciprocal rather than of the number  
          //itself.  
          GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));  
   
          //Print out the continued fraction decomposition of the rational number.  
          GMP_RALG_cfdecomp_emit(stdout,  
                                 "CF Representation Of Reciprocal Of Absolute Value Of Rational Number Specified",  
                                 &cf_decomp,  
                                 0,  
                                 1,  
                                 &dap_denominator);  
   
          //Destroy the decomposition--free the memory.  
          GMP_RALG_cfdecomp_destroy(&cf_decomp);  
          }  
       } //End if verbose.  
   
    //Do all the work to get the neighbors of the number passed.  
    GMP_RALG_consecutive_fab_terms(  
            &(parblock->rn),  
            &(parblock->kmax),  
            (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),  
            1,  
            0,  
            &neighbor_data);  
   
    //Print the neighbor data block for debugging.  
    #if 0  
    GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);  
    #endif  
   
    //Print the neighbor on the left, if it exists.  
    if (neighbor_data.n_left_out)  
       {  
       CMAIN_print_app_in_std_form(stdout,  
                                   -1,  
                                   &(neighbor_data.rn_in),  
                                   &(neighbor_data.lefts[0].neighbor),  
                                   parblock->argblock.noformat,  
                                   0,  
                                   0,  
                                   &dap_denominator);  
       }  
   
    //Deallocate all dynamic memory.  
    GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);  
    GMP_RATS_mpq_clear(&hmax_over_one);  
    GMP_RATS_mpq_clear(&hmax_over_kmax);  
    GMP_INTS_mpz_clear(&dap_denominator);  
    GMP_RATS_mpq_clear(&rn_in_abs);  
   
    return(rv);  
    }  
   
   
 //Handles the case of finding the successor.  
 int CMAIN_successor(struct CfbrapabCmainStruct *parblock)  
    {  
    int rv = 0;  
    GMP_RATS_mpq_struct hmax_over_one, hmax_over_kmax, rn_in_abs;  
    GMP_INTS_mpz_struct dap_denominator;  
    GMP_RALG_cf_app_struct cf_decomp;  
    GMP_RALG_fab_neighbor_collection_struct neighbor_data;  
    int error_flag;  
   
    //Allocate all dynamic memory.  
    GMP_RATS_mpq_init(&hmax_over_one);  
    GMP_RATS_mpq_init(&hmax_over_kmax);  
    GMP_INTS_mpz_init(&dap_denominator);  
    GMP_RATS_mpq_init(&rn_in_abs);  
   
    //Set the DAP denominator to 1e108.  
    GMP_INTS_mpz_set_general_int(&dap_denominator,  
                                 &error_flag,  
                                 "1e108");  
   
    //By convention, we will not mess with anything with an  
    //absolute value greater than HMAX/1.  If such a condition exists, puke out.  
    //Form up the value of HMAX/1 if HMAX was specified.  
    if (parblock->hmax_specified)  
       {  
       GMP_INTS_mpz_copy(&(hmax_over_one.num), &(parblock->hmax));  
       GMP_INTS_mpz_set_ui(&(hmax_over_one.den), 1);  
       GMP_RATS_mpq_copy(&rn_in_abs, &(parblock->rn));  
       GMP_INTS_mpz_abs(&(rn_in_abs.num));  
       if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_one, NULL) > 0)  
          {  
          printf("The magnitude of the number supplied exceeds HMAX/1, and hence the number\n"  
                 "has no neighbors in the series of interest.  Calculation cannot continue.\n");  
          exit(4);  
          }  
       }  
   
    //If the "verbose" option is specified, we want to give the continued fraction  
    //partial quotients and convergents of either the number to approximate,  
    //its reciprocal, or none of the above, as appropriate; and give a bit more  
    //information, in addition.  
    if (parblock->argblock.verbose)  
       {  
       if (parblock->hmax_specified)  
          {  
          //Stuff HMAX/KMAX.  This is necessary for comparison.  
          GMP_INTS_mpz_copy(&(hmax_over_kmax.num), &(parblock->hmax));  
          GMP_INTS_mpz_copy(&(hmax_over_kmax.den), &(parblock->kmax));  
          }  
   
       if (!(parblock->hmax_specified) || (GMP_RATS_mpq_cmp(&(parblock->rn), &hmax_over_kmax, NULL) < 0))  
          {  
          //Either HMAX was not specified or else we are below the corner point on the  
          //integer lattice.  Get the continued fraction representation of the number  
          //rather than its reciprocal.  
          GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.num), &(rn_in_abs.den));  
   
          //Print out the continued fraction decomposition of the rational number.  
          GMP_RALG_cfdecomp_emit(stdout,  
                                 "CF Representation Of Absolute Value Of Rational Number Specified",  
                                 &cf_decomp,  
                                 0,  
                                 1,  
                                 &dap_denominator);  
   
          //Destroy the decomposition--free the memory.  
          GMP_RALG_cfdecomp_destroy(&cf_decomp);  
          }  
       else if (GMP_RATS_mpq_cmp(&(rn_in_abs), &hmax_over_kmax, NULL) == 0)  
          {  
          //In this case, the rational number specified is exactly the same in  
          //magnitude as HMAX/KMAX.  I am inclined to suppress the CF decomp.  
          printf("Rational number specified is HMAX/KMAX.  CF decomp not provided.\n");  
          }  
       else  
          {  
          //The number specified is beyond the corner point.  It is appropriate to  
          //provide the decomposition of the reciprocal rather than of the number  
          //itself.  
          GMP_RALG_cfdecomp_init(&cf_decomp, &error_flag, &(rn_in_abs.den), &(rn_in_abs.num));  
   
          //Print out the continued fraction decomposition of the rational number.  
          GMP_RALG_cfdecomp_emit(stdout,  
                                 "CF Representation Of Reciprocal Of Absolute Value Of Rational Number Specified",  
                                 &cf_decomp,  
                                 0,  
                                 1,  
                                 &dap_denominator);  
   
          //Destroy the decomposition--free the memory.  
          GMP_RALG_cfdecomp_destroy(&cf_decomp);  
          }  
       } //End if verbose.  
   
    //Do all the work to get the neighbors of the number passed.  
    GMP_RALG_consecutive_fab_terms(  
            &(parblock->rn),  
            &(parblock->kmax),  
            (parblock->hmax_specified) ? (&(parblock->hmax)) : (NULL),  
            0,  
            1,  
            &neighbor_data);  
   
    //Print the neighbor data block for debugging.  
    #if 0  
    GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);  
    #endif  
   
    //Print the neighbor on the right, if it exists.  
    if (neighbor_data.n_right_out)  
       {  
       CMAIN_print_app_in_std_form(stdout,  
                                   -1,  
                                   &(neighbor_data.rn_in),  
                                   &(neighbor_data.rights[0].neighbor),  
                                   parblock->argblock.noformat,  
                                   0,  
                                   0,  
                                   &dap_denominator);  
       }  
   
    //Deallocate all dynamic memory.  
    GMP_RALG_consecutive_fab_terms_result_free(&neighbor_data);  
    GMP_RATS_mpq_clear(&hmax_over_one);  
    GMP_RATS_mpq_clear(&hmax_over_kmax);  
    GMP_INTS_mpz_clear(&dap_denominator);  
    GMP_RATS_mpq_clear(&rn_in_abs);  
   
    return(rv);  
    }  
   
   
 int c_main(int argc, char* argv[])  
    {  
    int rv=0;  
    struct CfbrapabCmainStruct parblock;  
   
    if (argc==2 && !strcmp(argv[1], "-help"))  
       {  
       FCMIOF_hline();  
       printf("DESCRIPTION\n");  
       printf("   This utility calculates best rational approximations of the form h/k\n");  
       printf("   under the constraint k <= KMAX (i.e. in the Farey series of order KMAX),\n");  
       printf("   or under the constraints k <= KMAX and h <= HMAX (i.e. in a rectangular\n");  
       printf("   region of the integer lattice).  This utility uses continued fraction\n");  
       printf("   algorithms presented in the accompanying book \"A Practitioner's Guide\n");  
       printf("   ...\", and this book (a work in progress) should be consulted both as a\n");  
       printf("   reference to the algorithms and a reference for this utility.  All\n");  
       printf("   rational numbers calculated are in lowest terms.  This utility will\n");  
       printf("   operate on negative numbers, but all results are produced by symmetry\n");  
       printf("   (the continued fraction representation of negative numbers is NOT\n");  
       printf("   calculated).  The default operation of this utility is to calculated the\n");  
       printf("   closest rational number in the series of interest.  If the rational\n");  
       printf("   number supplied is equidistant between two formable rational numbers in\n");  
       printf("   the series of interest, the neighbor smaller in magnitude is returned.  If\n");  
       printf("   the rational number supplied is already formable, it is returned in lowest\n");  
       printf("   terms.  If the rational number supplied does not have neighbors (i.e. it\n");  
       printf("   is larger than HMAX/1), an error is generated.\n");  
       printf("\n");  
       printf("USAGE\n");  
       printf("   cfbrapab srn urn_kmax [options]\n");  
       printf("   cfbrapab srn urn_kmax urn_hmax [options]\n");  
       printf("   cfbrapab -help\n");  
       printf("\n");  
       printf("OPTIONS\n");  
       printf("   -neversmaller, -neverlarger\n");  
       printf("      The -neversmaller option will prohibit this utility from choosing a\n");  
       printf("      rational approximation which is smaller than the rational number\n");  
       printf("      supplied.  Thus, this option will force the utility to choose the right\n");  
       printf("      neighbor rather than the left, regardless of relative distance.  The\n");  
       printf("      behavior if the rational number supplied is formable under the \n");  
       printf("      constraints is unchanged.  The -neverlarger option is analogous.\n");  
       printf("      These options cannot be used with -n, -pred, or -succ.\n");  
       printf("   -pred, -succ\n");  
       printf("      Will cause the utility to find the predecessor or successor in the\n");  
       printf("      series of interest to the rational number supplied (in the event the\n");  
       printf("      number supplied is already formable under the constraints).  For\n");  
       printf("      numbers not already formable under the constraints, the left or right\n");  
       printf("      formable neighbor will be returned.  Supplying a rational number that\n");  
       printf("      does not have a predecessor or successor (i.e. < 0/1 or > HMAX/1) will\n");  
       printf("      generate an error.  These options cannot be used with -neversmaller,\n");  
       printf("      -neverlarger, or -n.\n");  
       CU_MSGS_std_options(stdout, PNAME);  
       FCMIOF_hline();  
       CU_MSGS_toolset_info_msg(stdout, PNAME);  
       FCMIOF_hline();  
       }  
    else if (argc < 3)  
       {  
       CU_MSGS_too_few_args_msg(stdout, PNAME);  
       rv = 4;  
       goto ret_pt;  
       }  
    else  
       {  
       //In this branch, we must have an invocation of the form  
       //   cfbrapab SRN KMAX <options>  
       //or  
       //   cfbrapab SRN KMAX HMAX <options>  
       //  
       //Call the function to collect all the command-line parameters.  
       //This function takes care of error processing, as well.  If there  
       //is an error of any kind, the function will simply abort and  
       //supply the right return error code of 4.  
       process_command_line_args(&parblock,  
                                  argc,  
                                  argv);  
   
       //If the debug option was set, emit the debugging information.  
       if (parblock.argblock.debug)  
          {  
          FCMIOF_hline();  
          CU_MSGS_emit_vcinfo_from_ptr_table(stdout,C_MAIN_vcinfoptrs,PNAMEUC);  
          }  
   
       //Emit the opening horizontal line iff the -nf option isn't set.  
       if (!(parblock.argblock.noformat))  
          FCMIOF_hline();  
   
       //Print out a major mode message to indicate what we are trying to do.  
       if (!(parblock.argblock.noformat))  
          {  
          if (!parblock.neversmaller_specified && !parblock.neverlarger_specified && !parblock.pred_specified && !parblock.succ_specified)  
             {  
             printf("MAJOR MODE:  Finding closest rational number(s) under the constraints.\n");  
             }  
          else if (parblock.neversmaller_specified)  
             {  
             printf("MAJOR MODE:  Finding closest rational number with magnitude not smaller under\n             the constraints.\n");  
             }  
          else if (parblock.neverlarger_specified)  
             {  
             printf("MAJOR MODE:  Finding closest rational number with magnitude not larger under\n             the constraints.\n");  
             }  
          else if (parblock.pred_specified)  
             {  
             printf("MAJOR MODE:  Finding predecessor under the constraints.\n");  
             }  
          else if (parblock.succ_specified)  
             {  
             printf("MAJOR MODE:  Finding successor under the constraints.\n");  
             }  
          else  
             {  
             assert(0);  
             }  
   
          FCMIOF_hline();  
          }  
   
       //Echo back the command-line parameters.  
       if (!(parblock.argblock.noformat))  
          {  
          GMP_INTS_mpz_long_int_format_to_stream(stdout,  
                                                 &(parblock.rn.num),  
                                                 "RI_IN   Numerator");  
          FCMIOF_hline();  
          GMP_INTS_mpz_long_int_format_to_stream(stdout,  
                                                 &(parblock.rn.den),  
                                                 "RI_IN Denominator");  
          FCMIOF_hline();  
   
          GMP_INTS_mpz_long_int_format_to_stream(stdout,  
                                                 &(parblock.kmax),  
                                                 "K_MAX");  
          FCMIOF_hline();  
   
          if (parblock.hmax_specified)  
             {  
             GMP_INTS_mpz_long_int_format_to_stream(stdout,  
                                                    &(parblock.hmax),  
                                                    "H_MAX");  
             FCMIOF_hline();  
             }  
   
          if (parblock.n_specified)  
             {  
             GMP_INTS_mpz_struct temp24;  
   
             GMP_INTS_mpz_init(&temp24);  
   
             GMP_INTS_mpz_set_ui(&temp24, parblock.n);  
   
             GMP_INTS_mpz_long_int_format_to_stream(stdout,  
                                                    &temp24,  
                                                    "Number Of Neighbors");  
   
             FCMIOF_hline();  
   
             GMP_INTS_mpz_clear(&temp24);  
             }  
          }  
   
       //We need to split now into distinct cases  
       //depending on the command-line parameters.  We will  
       //then hack out solutions for each case.  
       if (!parblock.pred_specified && !parblock.succ_specified && !parblock.n_specified)  
          {  
          //Classic closest neighbor case.  
          rv = CMAIN_classic_closest_neighbor(&parblock);  
          }  
       else if (parblock.n_specified)  
          {  
          //Classic multiple neighbor case.  
          rv = CMAIN_multiple_neighbor(&parblock);  
          }  
       else if (parblock.pred_specified)  
          {  
          rv = CMAIN_predecessor(&parblock);  
          }  
       else if (parblock.succ_specified)  
          {  
          rv = CMAIN_successor(&parblock);  
          }  
       else  
          {  
          assert(0);  
          }  
   
       //Emit the closing horizontal line iff the -nf option isn't set.  
       //if (!(parblock.argblock.noformat))  
       //   FCMIOF_hline();  
   
       //Release all dynamic memory.  
       release_command_line_args(&parblock);  
       }  
   
    ret_pt:  
    return(rv);  
    }  
   
   
 //**************************************************************************  
 // $Log: c_main.c,v $  
 // Revision 1.6  2002/01/27 17:58:15  dtashley  
 // CRC32, other programs modified to work under new directory structure.  
 //  
 // Revision 1.5  2001/08/16 19:49:36  dtashley  
 // Beginning to prepare for v1.05 release.  
 //  
 // Revision 1.4  2001/08/15 06:55:59  dtashley  
 // Substantial progress.  Safety check-in.  
 //  
 // Revision 1.3  2001/08/12 10:20:58  dtashley  
 // Safety check-in.  Substantial progress.  
 //  
 // Revision 1.2  2001/07/26 03:53:17  dtashley  
 // Utilities that are under constructions stubbed to announce this,  
 // batch build file enhanced.  
 //  
 // Revision 1.1  2001/07/23 08:53:17  dtashley  
 // Initial check-in.  
 //  
 //**************************************************************************  
 // End of C_MAIN.C.  
Legend:
Removed from v.45  
changed lines
  Added in v.71
dashley@gmail.com
 ViewVC Help
Powered by ViewVC 1.1.25