projs/20161014_cfbrapab/c_main.c

// $Header: /cvsroot/esrg/sfesrg/esrgpcpj/cfbrapab/c_main.c,v 1.6 2002/01/27 17:58:15 dtashley Exp $

//--------------------------------------------------------------------------------
//Copyright 2008 David T. Ashley
//-------------------------------------------------------------------------------------------------
//This source code and any program in which it is compiled/used is provided under the GNU GENERAL
//PUBLIC LICENSE, Version 3, full license text below.
//-------------------------------------------------------------------------------------------------
//                    GNU GENERAL PUBLIC LICENSE
//                       Version 3, 29 June 2007
//
// Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
// Everyone is permitted to copy and distribute verbatim copies
// of this license document, but changing it is not allowed.
//
//                            Preamble
//
//  The GNU General Public License is a free, copyleft license for
//software and other kinds of works.
//
//  The licenses for most software and other practical works are designed
//to take away your freedom to share and change the works.  By contrast,
//the GNU General Public License is intended to guarantee your freedom to
//share and change all versions of a program--to make sure it remains free
//software for all its users.  We, the Free Software Foundation, use the
//GNU General Public License for most of our software; it applies also to
//any other work released this way by its authors.  You can apply it to
//your programs, too.
//
//  When we speak of free software, we are referring to freedom, not
//price.  Our General Public Licenses are designed to make sure that you
//have the freedom to distribute copies of free software (and charge for
//them if you wish), that you receive source code or can get it if you
//want it, that you can change the software or use pieces of it in new
//free programs, and that you know you can do these things.
//
//  To protect your rights, we need to prevent others from denying you
//these rights or asking you to surrender the rights.  Therefore, you have
//certain responsibilities if you distribute copies of the software, or if
//you modify it: responsibilities to respect the freedom of others.
//
//  For example, if you distribute copies of such a program, whether
//gratis or for a fee, you must pass on to the recipients the same
//freedoms that you received.  You must make sure that they, too, receive
//or can get the source code.  And you must show them these terms so they
//know their rights.
//
//  Developers that use the GNU GPL protect your rights with two steps:
//(1) assert copyright on the software, and (2) offer you this License
//giving you legal permission to copy, distribute and/or modify it.
//
//  For the developers' and authors' protection, the GPL clearly explains
//that there is no warranty for this free software.  For both users' and
//authors' sake, the GPL requires that modified versions be marked as
//changed, so that their problems will not be attributed erroneously to
//authors of previous versions.
//
//  Some devices are designed to deny users access to install or run
//modified versions of the software inside them, although the manufacturer
//can do so.  This is fundamentally incompatible with the aim of
//protecting users' freedom to change the software.  The systematic
//pattern of such abuse occurs in the area of products for individuals to
//use, which is precisely where it is most unacceptable.  Therefore, we
//have designed this version of the GPL to prohibit the practice for those
//products.  If such problems arise substantially in other domains, we
//stand ready to extend this provision to those domains in future versions
//of the GPL, as needed to protect the freedom of users.
//
//  Finally, every program is threatened constantly by software patents.
//States should not allow patents to restrict development and use of
//software on general-purpose computers, but in those that do, we wish to
//avoid the special danger that patents applied to a free program could
//make it effectively proprietary.  To prevent this, the GPL assures that
//patents cannot be used to render the program non-free.
//
//  The precise terms and conditions for copying, distribution and
//modification follow.
//
//                       TERMS AND CONDITIONS
//
//  0. Definitions.
//
//  "This License" refers to version 3 of the GNU General Public License.
//
//  "Copyright" also means copyright-like laws that apply to other kinds of
//works, such as semiconductor masks.
//
//  "The Program" refers to any copyrightable work licensed under this
//License.  Each licensee is addressed as "you".  "Licensees" and
//"recipients" may be individuals or organizations.
//
//  To "modify" a work means to copy from or adapt all or part of the work
//in a fashion requiring copyright permission, other than the making of an
//exact copy.  The resulting work is called a "modified version" of the
//earlier work or a work "based on" the earlier work.
//
//  A "covered work" means either the unmodified Program or a work based
//on the Program.
//
//  To "propagate" a work means to do anything with it that, without
//permission, would make you directly or secondarily liable for
//infringement under applicable copyright law, except executing it on a
//computer or modifying a private copy.  Propagation includes copying,
//distribution (with or without modification), making available to the
//public, and in some countries other activities as well.
//
//  To "convey" a work means any kind of propagation that enables other
//parties to make or receive copies.  Mere interaction with a user through
//a computer network, with no transfer of a copy, is not conveying.
//
//  An interactive user interface displays "Appropriate Legal Notices"
//to the extent that it includes a convenient and prominently visible
//feature that (1) displays an appropriate copyright notice, and (2)
//tells the user that there is no warranty for the work (except to the
//extent that warranties are provided), that licensees may convey the
//work under this License, and how to view a copy of this License.  If
//the interface presents a list of user commands or options, such as a
//menu, a prominent item in the list meets this criterion.
//
//  1. Source Code.
//
//  The "source code" for a work means the preferred form of the work
//for making modifications to it.  "Object code" means any non-source
//form of a work.
//
//  A "Standard Interface" means an interface that either is an official
//standard defined by a recognized standards body, or, in the case of
//interfaces specified for a particular programming language, one that
//is widely used among developers working in that language.
//
//  The "System Libraries" of an executable work include anything, other
//than the work as a whole, that (a) is included in the normal form of
//packaging a Major Component, but which is not part of that Major
//Component, and (b) serves only to enable use of the work with that
//Major Component, or to implement a Standard Interface for which an
//implementation is available to the public in source code form.  A
//"Major Component", in this context, means a major essential component
//(kernel, window system, and so on) of the specific operating system
//(if any) on which the executable work runs, or a compiler used to
//produce the work, or an object code interpreter used to run it.
//
//  The "Corresponding Source" for a work in object code form means all
//the source code needed to generate, install, and (for an executable
//work) run the object code and to modify the work, including scripts to
//control those activities.  However, it does not include the work's
//System Libraries, or general-purpose tools or generally available free
//programs which are used unmodified in performing those activities but
//which are not part of the work.  For example, Corresponding Source
//includes interface definition files associated with source files for
//the work, and the source code for shared libraries and dynamically
//linked subprograms that the work is specifically designed to require,
//such as by intimate data communication or control flow between those
//subprograms and other parts of the work.
//
//  The Corresponding Source need not include anything that users
//can regenerate automatically from other parts of the Corresponding
//Source.
//
//  The Corresponding Source for a work in source code form is that
//same work.
//
//  2. Basic Permissions.
//
//  All rights granted under this License are granted for the term of
//copyright on the Program, and are irrevocable provided the stated
//conditions are met.  This License explicitly affirms your unlimited
//permission to run the unmodified Program.  The output from running a
//covered work is covered by this License only if the output, given its
//content, constitutes a covered work.  This License acknowledges your
//rights of fair use or other equivalent, as provided by copyright law.
//
//  You may make, run and propagate covered works that you do not
//convey, without conditions so long as your license otherwise remains
//in force.  You may convey covered works to others for the sole purpose
//of having them make modifications exclusively for you, or provide you
//with facilities for running those works, provided that you comply with
//the terms of this License in conveying all material for which you do
//not control copyright.  Those thus making or running the covered works
//for you must do so exclusively on your behalf, under your direction
//and control, on terms that prohibit them from making any copies of
//your copyrighted material outside their relationship with you.
//
//  Conveying under any other circumstances is permitted solely under
//the conditions stated below.  Sublicensing is not allowed; section 10
//makes it unnecessary.
//
//  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
//
//  No covered work shall be deemed part of an effective technological
//measure under any applicable law fulfilling obligations under article
//11 of the WIPO copyright treaty adopted on 20 December 1996, or
//similar laws prohibiting or restricting circumvention of such
//measures.
//
//  When you convey a covered work, you waive any legal power to forbid
//circumvention of technological measures to the extent such circumvention
//is effected by exercising rights under this License with respect to
//the covered work, and you disclaim any intention to limit operation or
//modification of the work as a means of enforcing, against the work's
//users, your or third parties' legal rights to forbid circumvention of
//technological measures.
//
//  4. Conveying Verbatim Copies.
//
//  You may convey verbatim copies of the Program's source code as you
//receive it, in any medium, provided that you conspicuously and
//appropriately publish on each copy an appropriate copyright notice;
//keep intact all notices stating that this License and any
//non-permissive terms added in accord with section 7 apply to the code;
//keep intact all notices of the absence of any warranty; and give all
//recipients a copy of this License along with the Program.
//
//  You may charge any price or no price for each copy that you convey,
//and you may offer support or warranty protection for a fee.
//
//  5. Conveying Modified Source Versions.
//
//  You may convey a work based on the Program, or the modifications to
//produce it from the Program, in the form of source code under the
//terms of section 4, provided that you also meet all of these conditions:
//
//    a) The work must carry prominent notices stating that you modified
//    it, and giving a relevant date.
//
//    b) The work must carry prominent notices stating that it is
//    released under this License and any conditions added under section
//    7.  This requirement modifies the requirement in section 4 to
//    "keep intact all notices".
//
//    c) You must license the entire work, as a whole, under this
//    License to anyone who comes into possession of a copy.  This
//    License will therefore apply, along with any applicable section 7
//    additional terms, to the whole of the work, and all its parts,
//    regardless of how they are packaged.  This License gives no
//    permission to license the work in any other way, but it does not
//    invalidate such permission if you have separately received it.
//
//    d) If the work has interactive user interfaces, each must display
//    Appropriate Legal Notices; however, if the Program has interactive
//    interfaces that do not display Appropriate Legal Notices, your
//    work need not make them do so.
//
//  A compilation of a covered work with other separate and independent
//works, which are not by their nature extensions of the covered work,
//and which are not combined with it such as to form a larger program,
//in or on a volume of a storage or distribution medium, is called an
//"aggregate" if the compilation and its resulting copyright are not
//used to limit the access or legal rights of the compilation's users
//beyond what the individual works permit.  Inclusion of a covered work
//in an aggregate does not cause this License to apply to the other
//parts of the aggregate.
//
//  6. Conveying Non-Source Forms.
//
//  You may convey a covered work in object code form under the terms
//of sections 4 and 5, provided that you also convey the
//machine-readable Corresponding Source under the terms of this License,
//in one of these ways:
//
//    a) Convey the object code in, or embodied in, a physical product
//    (including a physical distribution medium), accompanied by the
//    Corresponding Source fixed on a durable physical medium
//    customarily used for software interchange.
//
//    b) Convey the object code in, or embodied in, a physical product
//    (including a physical distribution medium), accompanied by a
//    written offer, valid for at least three years and valid for as
//    long as you offer spare parts or customer support for that product
//    model, to give anyone who possesses the object code either (1) a
//    copy of the Corresponding Source for all the software in the
//    product that is covered by this License, on a durable physical
//    medium customarily used for software interchange, for a price no
//    more than your reasonable cost of physically performing this
//    conveying of source, or (2) access to copy the
//    Corresponding Source from a network server at no charge.
//
//    c) Convey individual copies of the object code with a copy of the
//    written offer to provide the Corresponding Source.  This
//    alternative is allowed only occasionally and noncommercially, and
//    only if you received the object code with such an offer, in accord
//    with subsection 6b.
//
//    d) Convey the object code by offering access from a designated
//    place (gratis or for a charge), and offer equivalent access to the
//    Corresponding Source in the same way through the same place at no
//    further charge.  You need not require recipients to copy the
//    Corresponding Source along with the object code.  If the place to
//    copy the object code is a network server, the Corresponding Source
//    may be on a different server (operated by you or a third party)
//    that supports equivalent copying facilities, provided you maintain
//    clear directions next to the object code saying where to find the
//    Corresponding Source.  Regardless of what server hosts the
//    Corresponding Source, you remain obligated to ensure that it is
//    available for as long as needed to satisfy these requirements.
//
//    e) Convey the object code using peer-to-peer transmission, provided
//    you inform other peers where the object code and Corresponding
//    Source of the work are being offered to the general public at no
//    charge under subsection 6d.
//
//  A separable portion of the object code, whose source code is excluded
//from the Corresponding Source as a System Library, need not be
//included in conveying the object code work.
//
//  A "User Product" is either (1) a "consumer product", which means any
//tangible personal property which is normally used for personal, family,
//or household purposes, or (2) anything designed or sold for incorporation
//into a dwelling.  In determining whether a product is a consumer product,
//doubtful cases shall be resolved in favor of coverage.  For a particular
//product received by a particular user, "normally used" refers to a
//typical or common use of that class of product, regardless of the status
//of the particular user or of the way in which the particular user
//actually uses, or expects or is expected to use, the product.  A product
//is a consumer product regardless of whether the product has substantial
//commercial, industrial or non-consumer uses, unless such uses represent
//the only significant mode of use of the product.
//
//  "Installation Information" for a User Product means any methods,
//procedures, authorization keys, or other information required to install
//and execute modified versions of a covered work in that User Product from
//a modified version of its Corresponding Source.  The information must
//suffice to ensure that the continued functioning of the modified object
//code is in no case prevented or interfered with solely because
//modification has been made.
//
//  If you convey an object code work under this section in, or with, or
//specifically for use in, a User Product, and the conveying occurs as
//part of a transaction in which the right of possession and use of the
//User Product is transferred to the recipient in perpetuity or for a
//fixed term (regardless of how the transaction is characterized), the
//Corresponding Source conveyed under this section must be accompanied
//by the Installation Information.  But this requirement does not apply
//if neither you nor any third party retains the ability to install
//modified object code on the User Product (for example, the work has
//been installed in ROM).
//
//  The requirement to provide Installation Information does not include a
//requirement to continue to provide support service, warranty, or updates
//for a work that has been modified or installed by the recipient, or for
//the User Product in which it has been modified or installed.  Access to a
//network may be denied when the modification itself materially and
//adversely affects the operation of the network or violates the rules and
//protocols for communication across the network.
//
//  Corresponding Source conveyed, and Installation Information provided,
//in accord with this section must be in a format that is publicly
//documented (and with an implementation available to the public in
//source code form), and must require no special password or key for
//unpacking, reading or copying.
//
//  7. Additional Terms.
//
//  "Additional permissions" are terms that supplement the terms of this
//License by making exceptions from one or more of its conditions.
//Additional permissions that are applicable to the entire Program shall
//be treated as though they were included in this License, to the extent
//that they are valid under applicable law.  If additional permissions
//apply only to part of the Program, that part may be used separately
//under those permissions, but the entire Program remains governed by
//this License without regard to the additional permissions.
//
//  When you convey a copy of a covered work, you may at your option
//remove any additional permissions from that copy, or from any part of
//it.  (Additional permissions may be written to require their own
//removal in certain cases when you modify the work.)  You may place
//additional permissions on material, added by you to a covered work,
//for which you have or can give appropriate copyright permission.
//
//  Notwithstanding any other provision of this License, for material you
//add to a covered work, you may (if authorized by the copyright holders of
//that material) supplement the terms of this License with terms:
//
//    a) Disclaiming warranty or limiting liability differently from the
//    terms of sections 15 and 16 of this License; or
//
//    b) Requiring preservation of specified reasonable legal notices or
//    author attributions in that material or in the Appropriate Legal
//    Notices displayed by works containing it; or
//
//    c) Prohibiting misrepresentation of the origin of that material, or
//    requiring that modified versions of such material be marked in
//    reasonable ways as different from the original version; or
//
//    d) Limiting the use for publicity purposes of names of licensors or
//    authors of the material; or
//
//    e) Declining to grant rights under trademark law for use of some
//    trade names, trademarks, or service marks; or
//
//    f) Requiring indemnification of licensors and authors of that
//    material by anyone who conveys the material (or modified versions of
//    it) with contractual assumptions of liability to the recipient, for
//    any liability that these contractual assumptions directly impose on
//    those licensors and authors.
//
//  All other non-permissive additional terms are considered "further
//restrictions" within the meaning of section 10.  If the Program as you
//received it, or any part of it, contains a notice stating that it is
//governed by this License along with a term that is a further
//restriction, you may remove that term.  If a license document contains
//a further restriction but permits relicensing or conveying under this
//License, you may add to a covered work material governed by the terms
//of that license document, provided that the further restriction does
//not survive such relicensing or conveying.
//
//  If you add terms to a covered work in accord with this section, you
//must place, in the relevant source files, a statement of the
//additional terms that apply to those files, or a notice indicating
//where to find the applicable terms.
//
//  Additional terms, permissive or non-permissive, may be stated in the
//form of a separately written license, or stated as exceptions;
//the above requirements apply either way.
//
//  8. Termination.
//
//  You may not propagate or modify a covered work except as expressly
//provided under this License.  Any attempt otherwise to propagate or
//modify it is void, and will automatically terminate your rights under
//this License (including any patent licenses granted under the third
//paragraph of section 11).
//
//  However, if you cease all violation of this License, then your
//license from a particular copyright holder is reinstated (a)
//provisionally, unless and until the copyright holder explicitly and
//finally terminates your license, and (b) permanently, if the copyright
//holder fails to notify you of the violation by some reasonable means
//prior to 60 days after the cessation.
//
//  Moreover, your license from a particular copyright holder is
//reinstated permanently if the copyright holder notifies you of the
//violation by some reasonable means, this is the first time you have
//received notice of violation of this License (for any work) from that
//copyright holder, and you cure the violation prior to 30 days after
//your receipt of the notice.
//
//  Termination of your rights under this section does not terminate the
//licenses of parties who have received copies or rights from you under
//this License.  If your rights have been terminated and not permanently
//reinstated, you do not qualify to receive new licenses for the same
//material under section 10.
//
//  9. Acceptance Not Required for Having Copies.
//
//  You are not required to accept this License in order to receive or
//run a copy of the Program.  Ancillary propagation of a covered work
//occurring solely as a consequence of using peer-to-peer transmission
//to receive a copy likewise does not require acceptance.  However,
//nothing other than this License grants you permission to propagate or
//modify any covered work.  These actions infringe copyright if you do
//not accept this License.  Therefore, by modifying or propagating a
//covered work, you indicate your acceptance of this License to do so.
//
//  10. Automatic Licensing of Downstream Recipients.
//
//  Each time you convey a covered work, the recipient automatically
//receives a license from the original licensors, to run, modify and
//propagate that work, subject to this License.  You are not responsible
//for enforcing compliance by third parties with this License.
//
//  An "entity transaction" is a transaction transferring control of an
//organization, or substantially all assets of one, or subdividing an
//organization, or merging organizations.  If propagation of a covered
//work results from an entity transaction, each party to that
//transaction who receives a copy of the work also receives whatever
//licenses to the work the party's predecessor in interest had or could
//give under the previous paragraph, plus a right to possession of the
//Corresponding Source of the work from the predecessor in interest, if
//the predecessor has it or can get it with reasonable efforts.
//
//  You may not impose any further restrictions on the exercise of the
//rights granted or affirmed under this License.  For example, you may
//not impose a license fee, royalty, or other charge for exercise of
//rights granted under this License, and you may not initiate litigation
//(including a cross-claim or counterclaim in a lawsuit) alleging that
//any patent claim is infringed by making, using, selling, offering for
//sale, or importing the Program or any portion of it.
//
//  11. Patents.
//
//  A "contributor" is a copyright holder who authorizes use under this
//License of the Program or a work on which the Program is based.  The
//work thus licensed is called the contributor's "contributor version".
//
//  A contributor's "essential patent claims" are all patent claims
//owned or controlled by the contributor, whether already acquired or
//hereafter acquired, that would be infringed by some manner, permitted
//by this License, of making, using, or selling its contributor version,
//but do not include claims that would be infringed only as a
//consequence of further modification of the contributor version.  For
//purposes of this definition, "control" includes the right to grant
//patent sublicenses in a manner consistent with the requirements of
//this License.
//
//  Each contributor grants you a non-exclusive, worldwide, royalty-free
//patent license under the contributor's essential patent claims, to
//make, use, sell, offer for sale, import and otherwise run, modify and
//propagate the contents of its contributor version.
//
//  In the following three paragraphs, a "patent license" is any express
//agreement or commitment, however denominated, not to enforce a patent
//(such as an express permission to practice a patent or covenant not to
//sue for patent infringement).  To "grant" such a patent license to a
//party means to make such an agreement or commitment not to enforce a
//patent against the party.
//
//  If you convey a covered work, knowingly relying on a patent license,
//and the Corresponding Source of the work is not available for anyone
//to copy, free of charge and under the terms of this License, through a
//publicly available network server or other readily accessible means,
//then you must either (1) cause the Corresponding Source to be so
//available, or (2) arrange to deprive yourself of the benefit of the
//patent license for this particular work, or (3) arrange, in a manner
//consistent with the requirements of this License, to extend the patent
//license to downstream recipients.  "Knowingly relying" means you have
//actual knowledge that, but for the patent license, your conveying the
//covered work in a country, or your recipient's use of the covered work
//in a country, would infringe one or more identifiable patents in that
//country that you have reason to believe are valid.
//
//  If, pursuant to or in connection with a single transaction or
//arrangement, you convey, or propagate by procuring conveyance of, a
//covered work, and grant a patent license to some of the parties
//receiving the covered work authorizing them to use, propagate, modify
//or convey a specific copy of the covered work, then the patent license
//you grant is automatically extended to all recipients of the covered
//work and works based on it.
//
//  A patent license is "discriminatory" if it does not include within
//the scope of its coverage, prohibits the exercise of, or is
//conditioned on the non-exercise of one or more of the rights that are
//specifically granted under this License.  You may not convey a covered
//work if you are a party to an arrangement with a third party that is
//in the business of distributing software, under which you make payment
//to the third party based on the extent of your activity of conveying
//the work, and under which the third party grants, to any of the
//parties who would receive the covered work from you, a discriminatory
//patent license (a) in connection with copies of the covered work
//conveyed by you (or copies made from those copies), or (b) primarily
//for and in connection with specific products or compilations that
//contain the covered work, unless you entered into that arrangement,
//or that patent license was granted, prior to 28 March 2007.
//
//  Nothing in this License shall be construed as excluding or limiting
//any implied license or other defenses to infringement that may
//otherwise be available to you under applicable patent law.
//
//  12. No Surrender of Others' Freedom.
//
//  If conditions are imposed on you (whether by court order, agreement or
//otherwise) that contradict the conditions of this License, they do not
//excuse you from the conditions of this License.  If you cannot convey a
//covered work so as to satisfy simultaneously your obligations under this
//License and any other pertinent obligations, then as a consequence you may
//not convey it at all.  For example, if you agree to terms that obligate you
//to collect a royalty for further conveying from those to whom you convey
//the Program, the only way you could satisfy both those terms and this
//License would be to refrain entirely from conveying the Program.
//
//  13. Use with the GNU Affero General Public License.
//
//  Notwithstanding any other provision of this License, you have
//permission to link or combine any covered work with a work licensed
//under version 3 of the GNU Affero General Public License into a single
//combined work, and to convey the resulting work.  The terms of this
//License will continue to apply to the part which is the covered work,
//but the special requirements of the GNU Affero General Public License,
//section 13, concerning interaction through a network will apply to the
//combination as such.
//
//  14. Revised Versions of this License.
//
//  The Free Software Foundation may publish revised and/or new versions of
//the GNU General Public License from time to time.  Such new versions will
//be similar in spirit to the present version, but may differ in detail to
//address new problems or concerns.
//
//  Each version is given a distinguishing version number.  If the
//Program specifies that a certain numbered version of the GNU General
//Public License "or any later version" applies to it, you have the
//option of following the terms and conditions either of that numbered
//version or of any later version published by the Free Software
//Foundation.  If the Program does not specify a version number of the
//GNU General Public License, you may choose any version ever published
//by the Free Software Foundation.
//
//  If the Program specifies that a proxy can decide which future
//versions of the GNU General Public License can be used, that proxy's
//public statement of acceptance of a version permanently authorizes you
//to choose that version for the Program.
//
//  Later license versions may give you additional or different
//permissions.  However, no additional obligations are imposed on any
//author or copyright holder as a result of your choosing to follow a
//later version.
//
//  15. Disclaimer of Warranty.
//
//  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
//APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
//HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
//OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
//THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
//PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
//IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
//ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
//
//  16. Limitation of Liability.
//
//  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
//WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
//THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
//GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
//USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
//DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
//PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
//EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
//SUCH DAMAGES.
//
//  17. Interpretation of Sections 15 and 16.
//
//  If the disclaimer of warranty and limitation of liability provided
//above cannot be given local legal effect according to their terms,
//reviewing courts shall apply local law that most closely approximates
//an absolute waiver of all civil liability in connection with the
//Program, unless a warranty or assumption of liability accompanies a
//copy of the Program in return for a fee.
//
//                     END OF TERMS AND CONDITIONS
//
//            How to Apply These Terms to Your New Programs
//
//  If you develop a new program, and you want it to be of the greatest
//possible use to the public, the best way to achieve this is to make it
//free software which everyone can redistribute and change under these terms.
//
//  To do so, attach the following notices to the program.  It is safest
//to attach them to the start of each source file to most effectively
//state the exclusion of warranty; and each file should have at least
//the "copyright" line and a pointer to where the full notice is found.
//
//    <one line to give the program's name and a brief idea of what it does.>
//    Copyright (C) <year>  <name of author>
//
//    This program is free software: you can redistribute it and/or modify
//    it under the terms of the GNU General Public License as published by
//    the Free Software Foundation, either version 3 of the License, or
//    (at your option) any later version.
//
//    This program is distributed in the hope that it will be useful,
//    but WITHOUT ANY WARRANTY; without even the implied warranty of
//    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//    GNU General Public License for more details.
//
//    You should have received a copy of the GNU General Public License
//    along with this program.  If not, see <http://www.gnu.org/licenses/>.
//
//Also add information on how to contact you by electronic and paper mail.
//
//  If the program does terminal interaction, make it output a short
//notice like this when it starts in an interactive mode:
//
//    <program>  Copyright (C) <year>  <name of author>
//    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
//    This is free software, and you are welcome to redistribute it
//    under certain conditions; type `show c' for details.
//
//The hypothetical commands `show w' and `show c' should show the appropriate
//parts of the General Public License.  Of course, your program's commands
//might be different; for a GUI interface, you would use an "about box".
//
//  You should also get your employer (if you work as a programmer) or school,
//if any, to sign a "copyright disclaimer" for the program, if necessary.
//For more information on this, and how to apply and follow the GNU GPL, see
//<http://www.gnu.org/licenses/>.
//
//  The GNU General Public License does not permit incorporating your program
//into proprietary programs.  If your program is a subroutine library, you
//may consider it more useful to permit linking proprietary applications with
//the library.  If this is what you want to do, use the GNU Lesser General
//Public License instead of this License.  But first, please read
//<http://www.gnu.org/philosophy/why-not-lgpl.html>.
//-------------------------------------------------------------------------------------------------
//--------------------------------------------------------------------------------
#include <assert.h>
#include <malloc.h>
#include <process.h>
#include <stdio.h>
#include <string.h>
#include <time.h>


#include "bstrfunc.h"
#include "ccmalloc.h"
#include "ccmfatal.h"
#include "charfunc.h"
#include "cu_msgs.h"
#include "fcmiof.h"
#include "gmp_ints.h"
#include "gmp_rats.h"
#include "gmp_ralg.h"
#include "intfunc.h"


#define PNAME "cfbrapab"
#define PNAMEUC "CFBRAPAB"


const char *C_MAIN_cvcinfo(void)
   {
   return("$Header: /cvsroot/esrg/sfesrg/esrgpcpj/cfbrapab/c_main.c,v 1.6 2002/01/27 17:58:15 dtashley Exp $");
   }


//This is a NULL-terminated table of pointers to functions
//which return version control strings for all of the files
//which make up the INTFAC program.  This information would
//be helpful for debugging.
static const char *(*C_MAIN_vcinfoptrs[])(void) =
   {
   //This is the main module, should come first.
   C_MAIN_cvcinfo,

   //And now the others, in alphabetical order.
   BSTRFUNC_hvcinfo,
   BSTRFUNC_cvcinfo,
   CCMALLOC_hvcinfo,
   CCMALLOC_cvcinfo,
   CCMFATAL_hvcinfo,
   CCMFATAL_cvcinfo,
   CHARFUNC_hvcinfo,
   CHARFUNC_cvcinfo,
   CU_MSGS_hvcinfo,
   CU_MSGS_cvcinfo,
   FCMIOF_hvcinfo,
   FCMIOF_cvcinfo,
   GMP_INTS_hvcinfo,
   GMP_INTS_cvcinfo,
   GMP_RALG_hvcinfo,
   GMP_RALG_cvcinfo,
   GMP_RATS_hvcinfo,
   GMP_RATS_cvcinfo,
   INTFUNC_hvcinfo,
   INTFUNC_cvcinfo,
   NULL
   };


//This is the structure type used to hold information about all the
//command-line parameters.
//
struct CfbrapabCmainStruct
   {
   GMP_RATS_mpq_struct rn;
      //The rational number specified on the command line.
      //symmetry.
   GMP_INTS_mpz_struct kmax;
      //The value of KMAX specified on the command line.  This must always
      //be present.
   int hmax_specified;
      //TRUE if HMAX is specified in addition to KMAX.  KMAX is mandatory
      //in all cases.
   GMP_INTS_mpz_struct hmax;
      //The value of HMAX if it is specified.  This is optional.  This will be
      //set to zero if it is not present on the command line.
   int neversmaller_specified;
      //TRUE if the -neversmaller option is specified on the command line.
   int neverlarger_specified;
      //TRUE if the -neverlarger option is specified on the command line.
   int pred_specified;
      //TRUE if the -pred option is specified on the command line.
   int succ_specified;
      //TRUE if the -succ option specified on the command line.
   int n_specified;
      //TRUE if the -n parameter is specified on the command line.
   unsigned n;
      //The value of n if it has been specified.
   CU_MSGS_std_cmd_line_par_results_struct argblock;
      //The block holding the options which are common across all
      //of these command-line utilities.
   };


//Processes the command-line parameters, and abstracts it to a 
//the contents of a structure plus a failure flag.
static void process_command_line_args(struct CfbrapabCmainStruct *parblock,
                                     int argc, 
                                     char* argv[])
   {
   int error_flag;
   int first_dashed_parameter;
   int i;
   int recognized;

   //Eyeball the input parameters.
   assert(parblock != NULL);
   assert(argc >= 1);
   assert(argv != NULL);

   //We have to have at least 3 total parameters.  However, this is covered
   //in main().

   //Process the first parameter, which has to be the rational number we
   //want to approximate.  If there is a problem, give a helpful message
   //and exit with an error code.
   GMP_RATS_mpq_init(&(parblock->rn));
   GMP_RATS_mpq_set_all_format_rat_num( argv[1],
                                       &error_flag,
                                       &(parblock->rn));

   //If there was a parse error, announce and abort.
   if (error_flag || GMP_RATS_mpq_is_nan(&(parblock->rn)))
      {
      printf("\"%s\" is not a properly formatted rational number.\n", argv[1]);
      exit(4);
      }

   //Normalize the rational number specified as input.  It is allowed to
   //be negative.
   GMP_RATS_mpq_normalize(&(parblock->rn));

   //The next item has to be a number, it has to be
   //an integer, it has to be positive, and it
   //is KMAX.  Parse out that.  If there are any
   //errors, abort.
   GMP_INTS_mpz_init(&(parblock->kmax));
   GMP_INTS_mpz_set_general_int(&(parblock->kmax), &error_flag, argv[2]);
   if (error_flag || GMP_INTS_mpz_is_zero(&(parblock->kmax)) || GMP_INTS_mpz_is_neg(&(parblock->kmax)))
      {
      printf("\"%s\" is not a properly formatted positive integer.\n", argv[2]);
      exit(4);
      }

   //Unconditionally allocate space for hmax.
   GMP_INTS_mpz_init(&(parblock->hmax));

   //If there is a third parameter, it can be two things.  It can
   //be either HMAX, or it can be the start of the parameters
   //with dashes.  First, let's decide which case applies.
   if (argc <= 3)
      {
      first_dashed_parameter = 3;
      parblock->hmax_specified = 0;
      }
   else
      {
      if (argv[3][0] == '-')
         {
         first_dashed_parameter = 3;
         parblock->hmax_specified = 0;
         }
      else
         {
         first_dashed_parameter = 4;
         parblock->hmax_specified = 1;

         GMP_INTS_mpz_set_general_int(&(parblock->hmax), &error_flag, argv[3]);
         if (error_flag || GMP_INTS_mpz_is_zero(&(parblock->hmax)) || GMP_INTS_mpz_is_neg(&(parblock->hmax)))
            {
            printf("\"%s\" is not a properly formatted positive integer.\n", argv[3]);
            exit(4);
            }
         }
      }

   //Loop through the remaining parameters, trying to process each
   //one either as a parameter specific to this program or else
   //as a general parameter.
   //
   //Initialize the internal general parameter block.
   CU_MSGS_cmd_line_par_results_struct_create(&(parblock->argblock));
   parblock->neversmaller_specified = 0;
   parblock->neverlarger_specified  = 0;
   parblock->pred_specified         = 0;
   parblock->succ_specified         = 0;
   parblock->n_specified            = 0;
   parblock->n                      = 0;

   for (i=first_dashed_parameter; i<argc; i++)
      {
      if (!strcmp("-neversmaller", argv[i]))
         {
         parblock->neversmaller_specified = 1;
         }
      else if (!strcmp("-neverlarger", argv[i]))
         {
         parblock->neverlarger_specified = 1;
         }
      else if (!strcmp("-pred", argv[i]))
         {
         parblock->pred_specified = 1;
         }
      else if (!strcmp("-succ", argv[i]))
         {
         parblock->succ_specified = 1;
         }
      else if (!strcmp("-n", argv[i]))
         {
         parblock->n_specified = 1;

         //To go along with -n, we have to have a next parameter.
         if (i == (argc-1))
            {
            printf("The \"-n\" parameter must include a following count.\n");
            exit(4);
            }

         //Bump i to index to next par.
         i++;

         //Try to parse this as a UINT24.  It must be that.
         GMP_INTS_mpz_parse_into_uint32(&(parblock->n), &error_flag, argv[i]);

         //If it couldn't be parsed as an integer, flunk it.
         if (error_flag)
            {
            printf("\"%s\" is not a valid unsigned integer or exceeds 24 bits.\n", argv[i]);
            exit(4);
            }

         //If it is too large, flunk it.
         if (parblock->n > 0x00FFFFFF)
            {
            printf("\"%s\" is an unsigned integer but exceeds 24 bits.\n", argv[i]);
            exit(4);
            }

         //OK, we're cool ...
         }
      else
         {
         //Two possibilities left.  Either general parameter, or else unrecognized.
         CU_MSGS_cmd_line_par_results_struct_process_arg(&(parblock->argblock),
                                                         argv[i],
                                                         &recognized);
         if (!recognized)
            {
            printf("\"%s\" is not a recognized command-line parameter.\n", argv[i]);
            exit(4);
            }

         //Was picked up as general parameter.
         }
      }

   //Congeal our thoughts on the "general" command-line parameters.  No errors possible
   //here.
   CU_MSGS_cmd_line_par_results_struct_finalize(&(parblock->argblock));

   //printf("Boo.\n");
   //printf("neverlarger %d succ %d\n", parblock->neverlarger_specified, parblock->succ_specified);

   //Look for mutually exclusive options among the program-specific parameters.
   if (
         (parblock->neversmaller_specified && (parblock->neverlarger_specified || parblock->pred_specified || parblock->succ_specified|| parblock->n_specified))
         ||
         (parblock->neverlarger_specified && (parblock->pred_specified || parblock->succ_specified || parblock->n_specified))
         ||
         (parblock->pred_specified && (parblock->succ_specified|| parblock->n_specified))
         ||
         (parblock->succ_specified && parblock->n_specified)
      )
      {
      printf("The \"-neversmaller\", \"-neverlarger\", \"-pred\", \"-succ\", and \"-n\" options are\nmutually exclusive.\n");
      exit(4);
      }

   //OK, we're clean, all pars in order.
   }


//Releases the dynamic memory associated with the parameter block.
static void release_command_line_args(struct CfbrapabCmainStruct *parblock)
   {
   assert(parblock != NULL);

   //This function is superfluous, since in a command-line utility it doesn't really
   //matter if everything is released.  But, here goes.
   CU_MSGS_cmd_line_par_results_struct_destroy(&(parblock->argblock));
   GMP_RATS_mpq_clear(&(parblock->rn));
   GMP_INTS_mpz_clear(&(parblock->kmax));
   GMP_INTS_mpz_clear(&(parblock->hmax));
   }


//Prints out a single rational number in the format endorsed
//by this program.  This often includes DAP information
//and difference information.  It is assumed that the
//previous information is terminated by a horizontal line,
//and this function terminates with a horizontal line.
static void CMAIN_print_app_in_std_form(FILE *s,
                                        int index,
                                        GMP_RATS_mpq_struct *rn,
                                        GMP_RATS_mpq_struct *approx,
                                        int nf,
                                        int show_diff,
                                        int show_dap,
                                        GMP_INTS_mpz_struct *dap_den)
   {
   char sbuf[250];
   GMP_RATS_mpq_struct diff, q_temp1;
   GMP_INTS_mpz_struct z_temp1, quotient, remainder;

   //Eyeball the input parameters.
   assert(s != NULL);
   assert(rn != NULL);
   assert(approx != NULL);
   assert(dap_den != NULL);

   //Allocate.
   GMP_RATS_mpq_init(&diff);
   GMP_RATS_mpq_init(&q_temp1);
   GMP_INTS_mpz_init(&z_temp1);
   GMP_INTS_mpz_init(&quotient);
   GMP_INTS_mpz_init(&remainder);

   //Print out the approximation numerator.
   sprintf(sbuf, "approx_num(%d)", index);
   if (!nf)
      {
      GMP_INTS_mpz_long_int_format_to_stream(s,
                                             &(approx->num),
                                             sbuf);
      }
   else
      {
      int nreserved;
      char *p;
      
      fprintf(s, "%d\n", index);
      
      nreserved = GMP_INTS_mpz_size_in_base_10(&(approx->num));
      p = CCMALLOC_malloc(sizeof(char) * nreserved);
      GMP_INTS_mpz_to_string(p, &(approx->num));
      fprintf(s, "%s\n", p);
      CCMALLOC_free(p);
      }

   if (!nf)
      FCMIOF_hline();

   //Print out the approximation denominator.
   sprintf(sbuf, "approx_den(%d)", index);
   if (!nf)
      {
      GMP_INTS_mpz_long_int_format_to_stream(s,
                                             &(approx->den),
                                             sbuf);
      }
   else
      {
      int nreserved;
      char *p;

      nreserved = GMP_INTS_mpz_size_in_base_10(&(approx->den));
      p = CCMALLOC_malloc(sizeof(char) * nreserved);
      GMP_INTS_mpz_to_string(p, &(approx->den));
      fprintf(s, "%s\n", p);
      CCMALLOC_free(p);
      }

   if (!nf)
      FCMIOF_hline();


   //If the "dap" flag is set, calculate and display decimal equivalent of the 
   //approximation.
   if (show_dap)
      {
      //Make the calculation for decimal approximation.
      GMP_RATS_mpq_copy(&q_temp1, approx);
      GMP_RATS_mpq_normalize(&q_temp1);
      GMP_INTS_mpz_mul(&z_temp1, dap_den, &q_temp1.num);
      GMP_INTS_mpz_tdiv_qr(&quotient, &remainder,
                           &z_temp1, &q_temp1.den);

      sprintf(sbuf, "dap_num(%d)", index);
      if (!nf)
         {
         GMP_INTS_mpz_long_int_format_to_stream(s,
                                                &(quotient),
                                                sbuf);
         }
      else
         {
         int nreserved;
         char *p;

         nreserved = GMP_INTS_mpz_size_in_base_10(&(quotient));
         p = CCMALLOC_malloc(sizeof(char) * nreserved);
         GMP_INTS_mpz_to_string(p, &(quotient));
         fprintf(s, "%s\n", p);
         CCMALLOC_free(p);
         }

      if (!nf)
         FCMIOF_hline();

      //Print out the approximation denominator.
      sprintf(sbuf, "dap_den(%d)", index);
      if (!nf)
         {
         GMP_INTS_mpz_long_int_format_to_stream(s,
                                                dap_den,
                                                sbuf);
         }
      else
         {
         int nreserved;
         char *p;

         nreserved = GMP_INTS_mpz_size_in_base_10(dap_den);
         p = CCMALLOC_malloc(sizeof(char) * nreserved);
         GMP_INTS_mpz_to_string(p, dap_den);
         fprintf(s, "%s\n", p);
         CCMALLOC_free(p);
         }

      if (!nf)
         FCMIOF_hline();
      }

   
   //If the "diff" flag is set, calculate and display the rational difference.
   if (show_diff)
      {
      GMP_RATS_mpq_sub(&diff, approx, rn);
      GMP_RATS_mpq_normalize(&diff);

      sprintf(sbuf, "error_num(%d)", index);
      if (!nf)
         {
         GMP_INTS_mpz_long_int_format_to_stream(s,
                                                &(diff.num),
                                                sbuf);
         }
      else
         {
         int nreserved;
         char *p;

         nreserved = GMP_INTS_mpz_size_in_base_10(&(diff.num));
         p = CCMALLOC_malloc(sizeof(char) * nreserved);
         GMP_INTS_mpz_to_string(p, &(diff.num));
         fprintf(s, "%s\n", p);
         CCMALLOC_free(p);
         }

      if (!nf)
         FCMIOF_hline();

      //Print out the approximation denominator.
      sprintf(sbuf, "error_den(%d)", index);
      if (!nf)
         {
         GMP_INTS_mpz_long_int_format_to_stream(s,
                                                &(diff.den),
                                                sbuf);
         }
      else
         {
         int nreserved;
         char *p;

         nreserved = GMP_INTS_mpz_size_in_base_10(&(diff.den));
         p = CCMALLOC_malloc(sizeof(char) * nreserved);
         GMP_INTS_mpz_to_string(p, &(diff.den));
         fprintf(s, "%s\n", p);
         CCMALLOC_free(p);
         }

      if (!nf)
         FCMIOF_hline();
      }

   //Deallocate.
   GMP_RATS_mpq_clear(&diff);
   GMP_RATS_mpq_clear(&q_temp1);
   GMP_INTS_mpz_clear(&z_temp1);
   GMP_INTS_mpz_clear(&quotient);
   GMP_INTS_mpz_clear(&remainder);
   }


//Handles the classic case of finding the closest
//neighbor(s).
static int CMAIN_classic_closest_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;

   //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 Rep Of Abs Value Of 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 Rep Of Reciprocal Of Abs Value Of 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,
           1,
           &neighbor_data);

   //Print the neighbor data block for debugging.
   #if 0
   GMP_RALG_consecutive_fab_terms_result_dump(stdout, &neighbor_data);
   #endif

   //There are four possibilities at this point.
   //  a)Attempting to find the rational neighbors generated an error.
   //  b)The rational number specified was already in the series of interest,
   //    in which case we will use it.
   //  c)The left neighbor is closer or in a tie we want to choose it.
   //  d)The right neighbor is closer or in a tie we want to choose it.
   if (neighbor_data.error)
      {
      //
      printf("Internal error: %s\n", neighbor_data.error);
      }
   else if (neighbor_data.equality)
      {
      CMAIN_print_app_in_std_form(stdout,
                                  0,
                                  &(neighbor_data.rn_in),
                                  &(neighbor_data.rn_in),
                                  parblock->argblock.noformat,
                                  0,
                                  1,
                                  &dap_denominator);
      }
   else
      {
      GMP_RATS_mpq_struct left_neighbor, right_neighbor,
                          left_diff, right_diff,
                          left_abs, right_abs;
      int error_cmp;
      int mag_cmp;

      GMP_RATS_mpq_init(&left_neighbor);
      GMP_RATS_mpq_init(&right_neighbor);
      GMP_RATS_mpq_init(&left_diff);
      GMP_RATS_mpq_init(&right_diff);
      GMP_RATS_mpq_init(&left_abs);
      GMP_RATS_mpq_init(&right_abs);

      //Snatch the left neighbor.
      if (neighbor_data.n_left_out)
         {
         GMP_RATS_mpq_copy(&left_neighbor, &(neighbor_data.lefts[0].neighbor));
         }

      //Snatch the right neighbor.
      if (neighbor_data.n_right_out)
         {
         GMP_RATS_mpq_copy(&right_neighbor, &(neighbor_data.rights[0].neighbor));
         }

      //Calculate the differences, take their absolute
      //values.
      GMP_RATS_mpq_sub(&left_diff,  &left_neighbor,  &(neighbor_data.rn_in));
      GMP_RATS_mpq_sub(&right_diff, &right_neighbor, &(neighbor_data.rn_in));
      GMP_RATS_mpq_normalize(&left_diff);
      GMP_RATS_mpq_normalize(&right_diff);
      GMP_INTS_mpz_abs(&(left_diff.num));
      GMP_INTS_mpz_abs(&(right_diff.num));

      //Now that the differences are calculated, take the
      //absolute values of the neighbors themselves.
      //We will use this to break ties.
      GMP_RATS_mpq_normalize(&left_neighbor);
      GMP_RATS_mpq_normalize(&right_neighbor);
      GMP_INTS_mpz_abs(&(left_neighbor.num));
      GMP_INTS_mpz_abs(&(right_neighbor.num));

      //Compare the relative differences and magnitudes.
      error_cmp = GMP_RATS_mpq_cmp(&left_diff, &right_diff, NULL);
      mag_cmp   = GMP_RATS_mpq_cmp(&left_neighbor, &right_neighbor, NULL);

      //Figure out which to present as the best approximation and
      //do it.
      if (!(parblock->neversmaller_specified) &&
         ((parblock->neverlarger_specified) || (error_cmp < 0) || ((error_cmp == 0) && (mag_cmp < 0))))
         {
         CMAIN_print_app_in_std_form(stdout,
                                     -1,
                                     &(neighbor_data.rn_in),
                                     &(neighbor_data.lefts[0].neighbor),
                                     parblock->argblock.noformat,
                                     1,
                                     1,
                                     &dap_denominator);
         }
      else
         {
         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.