/[dtapublic]/projs/dtats/trunk/shared_source/c_datd/bstrfunc.c
ViewVC logotype

Diff of /projs/dtats/trunk/shared_source/c_datd/bstrfunc.c

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

to_be_filed/sf_code/esrgpcpj/shared/c_datd/bstrfunc.c revision 29 by dashley, Sat Oct 8 07:08:47 2016 UTC projs/dtats/trunk/shared_source/c_datd/bstrfunc.c revision 98 by dashley, Sun Dec 18 00:57:31 2016 UTC
# Line 1  Line 1 
 // $Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/bstrfunc.c,v 1.6 2001/07/29 07:18:22 dtashley Exp $  
   
 //--------------------------------------------------------------------------------  
 //Copyright 2001 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>.  
 //-------------------------------------------------------------------------------------------------  
 //--------------------------------------------------------------------------------  
 #define MODULE_BSTRFUNC  
   
 #include <assert.h>  
 #include <malloc.h>  
 #include <process.h>  
 #include <stddef.h>  
 #include <string.h>  
   
   
 #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)  
    #include "ccmalloc.h"  
 #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)  
    #include "tclalloc.h"  
 #else  
    /* Do nothing. */  
 #endif  
   
 #include "bstrfunc.h"  
 #include "ccmalloc.h"  
 #include "charfunc.h"  
   
   
 /******************************************************************/  
 /***  CUSTOM ALLOCATION FUNCTIONS   *******************************/  
 /******************************************************************/  
 //We need wrappers because this software module will be used in  
 //more than one kind of software.  This could also be done with  
 //macros, but I like function wrappers better because there  
 //is less ambiguity and more ability to collect information if  
 //something goes wrong.  
 //  
 //07/24/01:  Visual inspection only.  Function deemed too  
 //simple for unit testing.  
 void *BSTRFUNC_malloc( size_t size )  
    {  
    #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)  
       return(CCMALLOC_malloc(size));  
    #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)  
       return(TclpAlloc(size));  
    #else  
       return(malloc(size));  
    #endif  
    }  
   
   
 //07/24/01:  Visual inspection only.  Function deemed too  
 //simple for unit testing.  
 void *BSTRFUNC_calloc( size_t num, size_t size )  
    {  
    #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)  
       return(CCMALLOC_calloc(num, size));  
    #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)  
       return(TclpCalloc(num, size));  
    #else  
       return(calloc(num, size));  
    #endif  
    }  
   
   
 //07/24/01:  Visual inspection only.  Function deemed too  
 //simple for unit testing.  
 void *BSTRFUNC_realloc( void *memblock, size_t size )  
    {  
    #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)  
       return(CCMALLOC_realloc(memblock, size));  
    #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)  
       return(TclpRealloc(memblock, size));  
    #else  
       return(realloc(memblock, size));  
    #endif  
    }  
   
   
 //07/24/01:  Visual inspection only.  Function deemed too  
 //simple for unit testing.  
 void BSTRFUNC_free( void *memblock )  
    {  
    #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)  
       CCMALLOC_free(memblock);  
    #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)  
       TclpFree(memblock);  
    #else  
       free(memblock);  
    #endif  
    }  
   
   
 //07/18/01:  Visual inspection and unit tests passed.  
 int BSTRFUNC_is_uint_wo_commas(const char *arg)  
    {  
    assert(arg != NULL);  
   
    if (!*arg)  
       return(0);  
   
    if (arg[0] == '0')  
       {  
       if (arg[1])  
          {  
          return(0);  
          }  
       else  
          {  
          return(1);  
          }  
       }  
    else  
       {  
       while (*arg)  
          {  
          if ((*arg < '0') || (*arg > '9'))  
             return(0);  
          arg++;  
          }  
   
       return(1);  
       }  
    }  
   
   
 //07/28/01:  Visual inspection only.  
 int BSTRFUNC_is_sint_wo_commas(const char *arg)  
    {  
    //This function will use its unsigned counterpart.  
    //  
    //Eyeball the input parameter.  
    assert(arg != NULL);  
   
    if (!*arg)  //Empty string ain't an integer.  
       return(0);  
   
    if (*arg == '-')  
       {  
       if (arg[1] == '0')  
          return(0);  
       else  
         return(BSTRFUNC_is_uint_wo_commas(arg+1));  
       }  
    else  
       {  
       return(BSTRFUNC_is_uint_wo_commas(arg));  
       }  
    }  
   
   
 //07/18/01:  Visual inspection and unit tests passed.  
 int BSTRFUNC_is_uint_w_commas(const char *arg)  
    {  
    int state;  
   
    //Input pointer cannot be NULL.  
    assert(arg != NULL);  
   
    //Can't be empty string.  
    if (!*arg)  
       return(0);  
   
    //If the first digit is 0, that must be the only digit.  
    if (arg[0] == '0')  
       {  
       if (arg[1])  
          {  
          return(0);  
          }  
       else  
          {  
          return(1);  
          }  
       }  
   
    //The remainder of this function is an efficient state  
    //machine recognizer.  The state machine involved is  
    //pretty simple and was drawn and discarded on a sheet  
    //of paper.  It doesn't need to be filed because it is  
    //so basic.  
    if ((*arg < '0') || (*arg > '9'))  
       return(0);  
   
    state = 0;  
    arg++;  
   
    while(1)  
       {  
       switch (state)  
          {  
          case 0 : if (!*arg)  
                      {  
                      return(1);  
                      }  
                   else if (*arg == ',')  
                      {  
                      state = 3;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      state = 1;  
                      }  
                   else  
                      {  
                      return(0);  
                      }  
                   break;  
          case 1 : if (!*arg)  
                      {  
                      return(1);  
                      }  
                   else if (*arg == ',')  
                      {  
                      state = 3;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      state = 2;  
                      }  
                   else  
                      {  
                      return(0);  
                      }  
                   break;  
          case 2 : if (!*arg)  
                      {  
                      return(1);  
                      }  
                   else if (*arg == ',')  
                      {  
                      state = 3;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      return(0);  
                      }  
                   else  
                      {  
                      return(0);  
                      }  
                   break;  
          case 3 : if (!*arg)  
                      {  
                      return(0);  
                      }  
                   else if (*arg == ',')  
                      {  
                      return(0);  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      state = 4;  
                      }  
                   else  
                      {  
                      return(0);  
                      }  
                   break;  
          case 4 : if (!*arg)  
                      {  
                      return(0);  
                      }  
                   else if (*arg == ',')  
                      {  
                      return(0);  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      state = 5;  
                      }  
                   else  
                      {  
                      return(0);  
                      }  
                   break;  
          case 5 : if (!*arg)  
                      {  
                      return(0);  
                      }  
                   else if (*arg == ',')  
                      {  
                      return(0);  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      state = 6;  
                      }  
                   else  
                      {  
                      return(0);  
                      }  
                   break;  
          case 6 : if (!*arg)  
                      {  
                      return(1);  
                      }  
                   else if (*arg == ',')  
                      {  
                      state = 3;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      return(0);  
                      }  
                   else  
                      {  
                      return(0);  
                      }  
                   break;  
          default:  
                   abort();  
                   break;  
          }  
   
       arg++;  
       }  
       
    //We should never get here.  
    }  
   
   
 //07/28/01:  Visual inspection only.  
 int BSTRFUNC_is_sint_w_commas(const char *arg)  
    {  
    //This function will use its unsigned counterpart.  
    //  
    //Eyeball the input parameter.  
    assert(arg != NULL);  
   
    if (!*arg)  //Empty string ain't an integer.  
       return(0);  
   
    if (*arg == '-')  
       {  
       if (arg[1] == '0')  
          return(0);  
       else  
         return(BSTRFUNC_is_uint_w_commas(arg+1));  
       }  
    else  
       {  
       return(BSTRFUNC_is_uint_w_commas(arg));  
       }  
    }  
   
   
 //07/18/01:  Visual verification only due to simplicity.  
 void BSTRFUNC_str_reverse(char *s)  
    {  
    int l, begin, end;  
    char temp;  
   
    assert(s != NULL);  
   
    l = strlen(s);  
   
    begin = 0;  
    end = l-1;  
   
    while ((end-begin) >=1)  
       {  
       temp = s[begin];  
       s[begin] = s[end];  
       s[end] = temp;  
       begin++;  
       end--;  
       }  
    }  
   
   
 void BSTRFUNC_parse_gen_sci_not_num(const char *s,  
                                     int *failure,  
                                     char *mant_sign,  
                                     size_t *mant_bdp,  
                                     size_t *mant_bdp_len,  
                                     size_t *mant_adp,  
                                     size_t *mant_adp_len,  
                                     char *exp_sign,  
                                     size_t *exp,  
                                     size_t *exp_len)  
    {  
    //For the parameters that can be NULL, these are the  
    //local copies we keep.  We will assign these back to  
    //the caller's area when appropriate before we leave.  
    char i_mant_sign, i_exp_sign;  
    size_t i_mant_bdp, i_mant_bdp_len, i_mant_adp, i_mant_adp_len,  
           i_exp, i_exp_len;  
    size_t i;  
    int state;  
    const char *arg;  
   
    //Check out the parameters that can't be NULL.  
    assert(s != NULL);  
    assert(failure != NULL);  
   
    //Initialize all variables to defaults.  
    *failure           =  0 ;  
    i_mant_sign        = 'N';  
    i_exp_sign         = 'N';  
    i_mant_bdp         =  0 ;  
    i_mant_bdp_len     =  0 ;  
    i_mant_adp         =  0 ;  
    i_mant_adp_len     =  0 ;  
    i_exp              =  0 ;  
    i_exp_len          =  0 ;  
    i                  =  0 ;  
    state              =  0 ;  
   
    //Process the string.  This is a big 10-state state  
    //machine.  Because of the complexity, I've included  
    //some state definitions as well in the comments.  
    arg = s;  
   
    while(1)  
       {  
       switch (state)  
          {  
          //Initial state from which we start processing.  
          case 0 : if (!*arg)  
                      {  
                      //The string is empty.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   else if (*arg == '-')  
                      {  
                      //Leading - on the number.  Fine.  
                      i_mant_sign = '-';  
                      state = 1;  
                      }  
                   else if (*arg == '+')  
                      {  
                      //Leading + on the number.  Fine.  
                      i_mant_sign = '+';  
                      state = 2;  
                      }  
                   else if (*arg == '.')  
                      {  
                      //Leading . on the number.  Fine.  
                      state = 5;  
                      }  
                   else if (*arg == '0')  
                      {  
                      i_mant_bdp = arg - s;  
                      state = 4;  
                      }  
                   else if ((*arg >= '1') && (*arg <= '9'))  
                      {  
                      i_mant_bdp = arg - s;  
                      state = 3;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
          //The leading character of the string was '-'.  We  
          //are processing a negative number.  
          case 1 : if (!*arg)  
                      {  
                      //The string is empty.  This is not OK because  
                      //it means the string was "-".  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   else if (*arg == '.')  
                      {  
                      //We have a - followed by a decimal point.  
                      //This is impolite form, but will accept  
                      //it as a number.  
                      state = 5;  
                      }  
                   else if (*arg == '0')  
                      {  
                      //We have a '-' followed by a '0'.  
                      //Seems reasonable.  
                      i_mant_bdp = arg - s;  
                      state = 4;  
                      }  
                   else if ((*arg >= '1') && (*arg <= '9'))  
                      {  
                      //We have a '-' followed by a non-zero  
                      //digit.  Seems reasonable.  
                      i_mant_bdp = arg - s;  
                      state = 3;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
          //The leading character of the string was '+'.  We  
          //are processing an explicitly declared positive number.  
          case 2 : if (!*arg)  
                      {  
                      //The string is empty.  This is not OK because  
                      //it means the string was "+".  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   else if (*arg == '.')  
                      {  
                      //We have a + followed by a decimal point.  
                      //This is impolite form, but will accept  
                      //it as a number.  
                      state = 5;  
                      }  
                   else if (*arg == '0')  
                      {  
                      //We have a '-' followed by a '0'.  
                      //Seems reasonable.  
                      i_mant_bdp = arg - s;  
                      state = 4;  
                      }  
                   else if ((*arg >= '1') && (*arg <= '9'))  
                      {  
                      //We have a '+' followed by a non-zero  
                      //digit.  Seems reasonable.  
                      i_mant_bdp = arg - s;  
                      state = 3;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
          //We've encountered a non-zero digit either first as part  
          //of the string or later after + or -.  We are processing  
          //a mantissa that does not begin with "0".  
          case 3 : if (!*arg)  
                      {  
                      //We've reached the end of the string.  This is  
                      //fine because we have a simple integer of the  
                      //form NNNN, +NNNN, or -NNNN.  No problem with that.  
                      i_mant_bdp_len = (arg - s) - i_mant_bdp;  
                      *failure = 0;  
                      goto term_seq;  
                      }  
                   else if (*arg == '.')  
                      {  
                      //Number followed by decimal point.  This  
                      //means the mantissa is terminating.  No issue.  
                      i_mant_bdp_len = (arg - s) - i_mant_bdp;  
                      state = 5;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      //Yet more digits.  Seems reasonable.  
                      //The assignment isn't necessary, but it  
                      //is aesthetic.  
                      state = 3;  
                      }  
                   else if ((*arg == 'e') || (*arg == 'E'))  
                      {  
                      //Beginning of an exponent.  This again  
                      //means the mantissa is terminating.  No issue.  
                      i_mant_bdp_len = (arg - s) - i_mant_bdp;  
                      state = 6;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
          //We're processing a mantissa that begins with zero.  There  
          //is only one zero allowed before the decimal point.  
          case 4 : if (!*arg)  
                      {  
                      //We've reached the end of the string.  This is  
                      //fine because it means we have zero.  I'm going  
                      //to be unusually permissive and allow -0 and +0,  
                      //which isn't traditional.  
                      i_mant_bdp_len = (arg - s) - i_mant_bdp;  
                      *failure = 0;  
                      goto term_seq;  
                      }  
                   else if (*arg == '.')  
                      {  
                      //Zero followed by decimal point.  This  
                      //means the mantissa is terminating.  No issue.  
                      i_mant_bdp_len = (arg - s) - i_mant_bdp;  
                      state = 5;  
                      }  
                   else if ((*arg == 'e') || (*arg == 'E'))  
                      {  
                      //Beginning of an exponent.  This again  
                      //means the mantissa is terminating.  No issue.  
                      i_mant_bdp_len = (arg - s) - i_mant_bdp;  
                      state = 6;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
                   //A decimal point has been found in the string.  
                   //This marks the end of the mantissa, for sure.  
          case 5 : if (!*arg)  
                      {  
                      //We've reached the end of the string.  There are  
                      //two possibilities here.  Either there have been no  
                      //digits before the decimal points, which is a no-no,  
                      //or there have been digits, which is fine.  
                      if (i_mant_bdp_len)  
                         {  
                         *failure = 0;  
                         goto term_seq;  
                         }  
                      else  
                         {  
                         *failure = 1;  
                         goto term_seq;  
                         }  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      //Digits after the decimal point.  Need to  
                      //begin the portion after the decimal point.  
                      i_mant_adp = arg - s;  
                      state = 10;  
                      }  
                   else if ((*arg == 'e') || (*arg == 'E'))  
                      {  
                      //Beginning of an exponent.  This means  
                      //that have no digits after the decimal point.  
                      //This is OK.  
                      state = 6;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
                  //The exponent has begin.  
          case 6: if (!*arg)  
                      {  
                      //The string is empty.  This is not OK  
                      //because it would mean an E with nothing  
                      //following it.  This is a no-no.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   else if (*arg == '-')  
                      {  
                      //Leading - on the exponent.  Fine.  
                      i_exp_sign = '-';  
                      state = 8;  
                      }  
                   else if (*arg == '+')  
                      {  
                      //Leading + on the exponent.  Fine.  
                      i_exp_sign = '+';  
                      state = 7;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      //Beginning the digits of the exponent.  Fine.  
                      i_exp = arg - s;  
                      state = 9;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
   
                   //Had a + sign before the exponent.  Now expecting digits.  
          case  7: if (!*arg)  
                      {  
                      //The string is empty.  This is not OK  
                      //because it would mean an E+ with nothing  
                      //following it.  This is a no-no.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      //Beginning the digits of the exponent.  Fine.  
                      i_exp = arg - s;  
                      state = 9;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
                   //Had a - sign before the exponent.  Now expecting digits.  
          case  8: if (!*arg)  
                      {  
                      //The string is empty.  This is not OK  
                      //because it would mean an E- with nothing  
                      //following it.  This is a no-no.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      //Beginning the digits of the exponent.  Fine.  
                      i_exp = arg - s;  
                      state = 9;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
                   //Had one digit of exponent.  Am processing remaining ones.  
          case 9 : if (!*arg)  
                      {  
                      //We've reached the end of the string.  This is  
                      //fine because we have an exponent of the  
                      //form NNNN, +NNNN, or -NNNN.  No problem with that.  
                      i_exp_len = (arg - s) - i_exp;  
                      *failure = 0;  
                      goto term_seq;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      //Yet more digits.  Seems reasonable.  
                      //The assignment isn't necessary, but it  
                      //is aesthetic.  
                      state = 9;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
                   //Processing digits after decimal point.  This state is out  
                   //of sequence because added it after on diagram.  
          case 10: if (!*arg)  
                      {  
                      //We've reached the end of the string.  This is  
                      //fine.  
                      i_mant_adp_len = (arg - s) - i_mant_adp;  
                      *failure = 0;  
                      goto term_seq;  
                      }  
                   else if ((*arg >= '0') && (*arg <= '9'))  
                      {  
                      //Yet more digits.  Seems reasonable.  
                      //The assignment isn't necessary, but it  
                      //is aesthetic.  
                      state = 10;  
                      }  
                   else if ((*arg == 'e') || (*arg == 'E'))  
                      {  
                      //Beginning of an exponent.  This terminates  
                      //the digits after the decimal point.  
                      i_mant_adp_len = (arg - s) - i_mant_adp;  
                      state = 6;  
                      }  
                   else  
                      {  
                      //Unidentifiable crap.  This is not OK.  
                      //Error out.  
                      *failure = 1;  
                      goto term_seq;  
                      }  
                   break;  
          default:  
                   abort();  
                   break;  
          }  
   
       arg++;  
       }  
   
   
    //This is the setup for returning to the caller.  We can  
    //only fill in those data pointer for the caller that are  
    //not NULL.  
    term_seq:  
    if (mant_sign)  
       *mant_sign = i_mant_sign;  
    if (mant_bdp)  
       *mant_bdp = i_mant_bdp;  
    if (mant_bdp_len)  
       *mant_bdp_len = i_mant_bdp_len;  
    if (mant_adp)  
       *mant_adp = i_mant_adp;  
    if (mant_adp_len)  
       *mant_adp_len = i_mant_adp_len;  
    if (exp_sign)  
       *exp_sign = i_exp_sign;  
    if (exp)  
       *exp = i_exp;  
    if (exp_len)  
       *exp_len = i_exp_len;  
    }  
   
   
 //07/18/01:  Has passed visual verification plus unit tests.  
 void BSTRFUNC_commanate(char *s)  
    {  
    int l;  
    int ncommas;  
    char *putpt, *getpt;  
    int ndigits;  
   
    //Adds commas to a numeric string.  The space  
    //must exist in the area passed.  
    assert(s);  
   
    //If the leading character on the string is a  
    //'-', bump the pointer.  Then everything  
    //else applies as for an unsigned.  
    if (*s == '-')  
      s++;  
   
    //Be sure the string currently meets the syntax for  
    //a signed integer.  If not, don't even touch it.  
    if (!BSTRFUNC_is_uint_wo_commas(s))  
       return;  
   
    //Get the length of the current string.  
    l = strlen(s);  
   
    //Let's agree, just in case something slipped through  
    //the cracks, that zero length strings are not of  
    //interest to us.  
    if (l==0)  
      return;  
   
    //The number of commas to add is precisely  
    //(N-1) div 3.  
    if (l==0)  
       ncommas = 0;  
    else  
       ncommas = (l-1)/3;  
   
    //Walk through the string, adding commas.  
    getpt = s + l - 1;  
    putpt = s + l + ncommas;  
   
    *putpt = 0; //Write the zero terminator.  
    putpt--;  
   
    ndigits = 0;  
   
    while ((putpt > s) && (getpt > s))  
       {  
       *putpt = *getpt;  
       putpt--;  
       getpt--;  
       ndigits++;  
       if (((ndigits % 3) == 0) && (putpt != s))  
          {  
          *putpt = ',';  
          putpt--;  
          }  
       assert((putpt >= s) && (getpt>=s));  
       }  
    }  
   
   
 //07/28/01:  Visual inspection only.  
 void BSTRFUNC_decommanate(char *s)  
    {  
    char *src, *dst;  
   
    assert(s != NULL);  
   
    src = dst = s;  
   
    while(1)  
       {  
       if (!*src)  
          {  
          *dst = 0;  
          break;  
          }  
       else if (*src == ',')  
          {  
          src++;  
          }  
       else  
          {  
          *dst = *src;  
          src++;  
          dst++;  
          }  
       }  
    }  
   
   
 void BSTRFUNC_parse_str_to_uint32(const char *s,  
                                   unsigned int *rv,  
                                   int *error)  
    {  
    unsigned _int64 temp;  
    int digval;  
   
    //Eyeball the input arguments.  
    assert(s != NULL);  
    assert(error != NULL);  
   
    //Start off believing there is no error.  
    *error = 0;  
   
    //The string has to parse out as an unsigned integer or an  
    //unsigned integer with commas, or we won't touch it.  
    if (!BSTRFUNC_is_uint_wo_commas(s) && !BSTRFUNC_is_uint_w_commas(s))  
       {  
       *error = 1;  
       return;  
       }  
   
    //OK, we know we have an unsigned integer, either without commas,  
    //or with properly placed commas.  Our only worry now is that it  
    //is of a size that will fit in 32 bits.  The way we can deal with  
    //this is to format it into 64 bits and watch for overflow.  
    temp = 0;  
   
    while (*s)  
       {  
       digval = CHARFUNC_digit_to_val(*s);  
       if (digval >= 0)  
          {  
          temp *= 10;  
          temp += digval;  
          if ((temp >> 32) & 0xFFFFFFFF)  
             {  
             //We've had an overflow.  
             *error = 1;  
             return;  
             }  
          }  
       s++;  
       }  
   
    *rv = (unsigned int)temp;  
    }  
   
   
 const char *BSTRFUNC_cvcinfo(void)  
    {  
    return("$Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/bstrfunc.c,v 1.6 2001/07/29 07:18:22 dtashley Exp $");  
    }  
   
   
 const char *BSTRFUNC_hvcinfo(void)  
    {  
    return(BSTRFUNC_H_VERSION);  
    }  
   
   
 //**************************************************************************  
 // $Log: bstrfunc.c,v $  
 // Revision 1.6  2001/07/29 07:18:22  dtashley  
 // Completion of ARBINT INTFAC extension.  
 //  
 // Revision 1.5  2001/07/25 23:40:02  dtashley  
 // Completion of INTFAC program, many changes to handling of large  
 // integers.  
 //  
 // Revision 1.4  2001/07/23 06:12:49  dtashley  
 // Completion of INTFAC command-line utility.  
 //  
 // Revision 1.3  2001/07/19 20:06:03  dtashley  
 // Division finished.  String formatting functions underway.  Safety check-in.  
 //  
 // Revision 1.2  2001/07/13 21:02:20  dtashley  
 // Version control reporting changes.  
 //  
 // Revision 1.1  2001/07/13 19:05:23  dtashley  
 // Files added.  
 //  
 //**************************************************************************  
 // End of BSTRFUNC.C.  
1    //$Header$
2    //-------------------------------------------------------------------------------------------------
3    //This file is part of "David T. Ashley's Shared Source Code", a set of shared components
4    //integrated into many of David T. Ashley's projects.
5    //-------------------------------------------------------------------------------------------------
6    //This source code and any program in which it is compiled/used is provided under the MIT License,
7    //reproduced below.
8    //-------------------------------------------------------------------------------------------------
9    //Permission is hereby granted, free of charge, to any person obtaining a copy of
10    //this software and associated documentation files(the "Software"), to deal in the
11    //Software without restriction, including without limitation the rights to use,
12    //copy, modify, merge, publish, distribute, sublicense, and / or sell copies of the
13    //Software, and to permit persons to whom the Software is furnished to do so,
14    //subject to the following conditions :
15    //
16    //The above copyright notice and this permission notice shall be included in all
17    //copies or substantial portions of the Software.
18    //
19    //THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20    //IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21    //FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
22    //AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23    //LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24    //OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
25    //SOFTWARE.
26    //-------------------------------------------------------------------------------------------------
27    #define MODULE_BSTRFUNC
28    
29    #include <assert.h>
30    #include <malloc.h>
31    #include <process.h>
32    #include <stddef.h>
33    #include <string.h>
34    
35    
36    #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
37       #include "ccmalloc.h"
38    #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
39       #include "tclalloc.h"
40    #else
41       /* Do nothing. */
42    #endif
43    
44    #include "bstrfunc.h"
45    #include "ccmalloc.h"
46    #include "charfunc.h"
47    
48    
49    /******************************************************************/
50    /***  CUSTOM ALLOCATION FUNCTIONS   *******************************/
51    /******************************************************************/
52    //We need wrappers because this software module will be used in
53    //more than one kind of software.  This could also be done with
54    //macros, but I like function wrappers better because there
55    //is less ambiguity and more ability to collect information if
56    //something goes wrong.
57    //
58    //07/24/01:  Visual inspection only.  Function deemed too
59    //simple for unit testing.
60    void *BSTRFUNC_malloc( size_t size )
61       {
62       #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
63          return(CCMALLOC_malloc(size));
64       #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
65          return(TclpAlloc(size));
66       #else
67          return(malloc(size));
68       #endif
69       }
70    
71    
72    //07/24/01:  Visual inspection only.  Function deemed too
73    //simple for unit testing.
74    void *BSTRFUNC_calloc( size_t num, size_t size )
75       {
76       #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
77          return(CCMALLOC_calloc(num, size));
78       #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
79          return(TclpCalloc(num, size));
80       #else
81          return(calloc(num, size));
82       #endif
83       }
84    
85    
86    //07/24/01:  Visual inspection only.  Function deemed too
87    //simple for unit testing.
88    void *BSTRFUNC_realloc( void *memblock, size_t size )
89       {
90       #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
91          return(CCMALLOC_realloc(memblock, size));
92       #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
93          return(TclpRealloc(memblock, size));
94       #else
95          return(realloc(memblock, size));
96       #endif
97       }
98    
99    
100    //07/24/01:  Visual inspection only.  Function deemed too
101    //simple for unit testing.
102    void BSTRFUNC_free( void *memblock )
103       {
104       #if defined(APP_TYPE_SIMPLE_DOS_CONSOLE)
105          CCMALLOC_free(memblock);
106       #elif defined(APP_TYPE_IJUSCRIPTER_IJUCONSOLE)
107          TclpFree(memblock);
108       #else
109          free(memblock);
110       #endif
111       }
112    
113    
114    //07/18/01:  Visual inspection and unit tests passed.
115    int BSTRFUNC_is_uint_wo_commas(const char *arg)
116       {
117       assert(arg != NULL);
118    
119       if (!*arg)
120          return(0);
121    
122       if (arg[0] == '0')
123          {
124          if (arg[1])
125             {
126             return(0);
127             }
128          else
129             {
130             return(1);
131             }
132          }
133       else
134          {
135          while (*arg)
136             {
137             if ((*arg < '0') || (*arg > '9'))
138                return(0);
139             arg++;
140             }
141    
142          return(1);
143          }
144       }
145    
146    
147    //07/28/01:  Visual inspection only.
148    int BSTRFUNC_is_sint_wo_commas(const char *arg)
149       {
150       //This function will use its unsigned counterpart.
151       //
152       //Eyeball the input parameter.
153       assert(arg != NULL);
154    
155       if (!*arg)  //Empty string ain't an integer.
156          return(0);
157    
158       if (*arg == '-')
159          {
160          if (arg[1] == '0')
161             return(0);
162          else
163            return(BSTRFUNC_is_uint_wo_commas(arg+1));
164          }
165       else
166          {
167          return(BSTRFUNC_is_uint_wo_commas(arg));
168          }
169       }
170    
171    
172    //07/18/01:  Visual inspection and unit tests passed.
173    int BSTRFUNC_is_uint_w_commas(const char *arg)
174       {
175       int state;
176    
177       //Input pointer cannot be NULL.
178       assert(arg != NULL);
179    
180       //Can't be empty string.
181       if (!*arg)
182          return(0);
183    
184       //If the first digit is 0, that must be the only digit.
185       if (arg[0] == '0')
186          {
187          if (arg[1])
188             {
189             return(0);
190             }
191          else
192             {
193             return(1);
194             }
195          }
196    
197       //The remainder of this function is an efficient state
198       //machine recognizer.  The state machine involved is
199       //pretty simple and was drawn and discarded on a sheet
200       //of paper.  It doesn't need to be filed because it is
201       //so basic.
202       if ((*arg < '0') || (*arg > '9'))
203          return(0);
204    
205       state = 0;
206       arg++;
207    
208       while(1)
209          {
210          switch (state)
211             {
212             case 0 : if (!*arg)
213                         {
214                         return(1);
215                         }
216                      else if (*arg == ',')
217                         {
218                         state = 3;
219                         }
220                      else if ((*arg >= '0') && (*arg <= '9'))
221                         {
222                         state = 1;
223                         }
224                      else
225                         {
226                         return(0);
227                         }
228                      break;
229             case 1 : if (!*arg)
230                         {
231                         return(1);
232                         }
233                      else if (*arg == ',')
234                         {
235                         state = 3;
236                         }
237                      else if ((*arg >= '0') && (*arg <= '9'))
238                         {
239                         state = 2;
240                         }
241                      else
242                         {
243                         return(0);
244                         }
245                      break;
246             case 2 : if (!*arg)
247                         {
248                         return(1);
249                         }
250                      else if (*arg == ',')
251                         {
252                         state = 3;
253                         }
254                      else if ((*arg >= '0') && (*arg <= '9'))
255                         {
256                         return(0);
257                         }
258                      else
259                         {
260                         return(0);
261                         }
262                      break;
263             case 3 : if (!*arg)
264                         {
265                         return(0);
266                         }
267                      else if (*arg == ',')
268                         {
269                         return(0);
270                         }
271                      else if ((*arg >= '0') && (*arg <= '9'))
272                         {
273                         state = 4;
274                         }
275                      else
276                         {
277                         return(0);
278                         }
279                      break;
280             case 4 : if (!*arg)
281                         {
282                         return(0);
283                         }
284                      else if (*arg == ',')
285                         {
286                         return(0);
287                         }
288                      else if ((*arg >= '0') && (*arg <= '9'))
289                         {
290                         state = 5;
291                         }
292                      else
293                         {
294                         return(0);
295                         }
296                      break;
297             case 5 : if (!*arg)
298                         {
299                         return(0);
300                         }
301                      else if (*arg == ',')
302                         {
303                         return(0);
304                         }
305                      else if ((*arg >= '0') && (*arg <= '9'))
306                         {
307                         state = 6;
308                         }
309                      else
310                         {
311                         return(0);
312                         }
313                      break;
314             case 6 : if (!*arg)
315                         {
316                         return(1);
317                         }
318                      else if (*arg == ',')
319                         {
320                         state = 3;
321                         }
322                      else if ((*arg >= '0') && (*arg <= '9'))
323                         {
324                         return(0);
325                         }
326                      else
327                         {
328                         return(0);
329                         }
330                      break;
331             default:
332                      abort();
333                      break;
334             }
335    
336          arg++;
337          }
338        
339       //We should never get here.
340       }
341    
342    
343    //07/28/01:  Visual inspection only.
344    int BSTRFUNC_is_sint_w_commas(const char *arg)
345       {
346       //This function will use its unsigned counterpart.
347       //
348       //Eyeball the input parameter.
349       assert(arg != NULL);
350    
351       if (!*arg)  //Empty string ain't an integer.
352          return(0);
353    
354       if (*arg == '-')
355          {
356          if (arg[1] == '0')
357             return(0);
358          else
359            return(BSTRFUNC_is_uint_w_commas(arg+1));
360          }
361       else
362          {
363          return(BSTRFUNC_is_uint_w_commas(arg));
364          }
365       }
366    
367    
368    //07/18/01:  Visual verification only due to simplicity.
369    void BSTRFUNC_str_reverse(char *s)
370       {
371       int l, begin, end;
372       char temp;
373    
374       assert(s != NULL);
375    
376       l = strlen(s);
377    
378       begin = 0;
379       end = l-1;
380    
381       while ((end-begin) >=1)
382          {
383          temp = s[begin];
384          s[begin] = s[end];
385          s[end] = temp;
386          begin++;
387          end--;
388          }
389       }
390    
391    
392    void BSTRFUNC_parse_gen_sci_not_num(const char *s,
393                                        int *failure,
394                                        char *mant_sign,
395                                        size_t *mant_bdp,
396                                        size_t *mant_bdp_len,
397                                        size_t *mant_adp,
398                                        size_t *mant_adp_len,
399                                        char *exp_sign,
400                                        size_t *exp,
401                                        size_t *exp_len)
402       {
403       //For the parameters that can be NULL, these are the
404       //local copies we keep.  We will assign these back to
405       //the caller's area when appropriate before we leave.
406       char i_mant_sign, i_exp_sign;
407       size_t i_mant_bdp, i_mant_bdp_len, i_mant_adp, i_mant_adp_len,
408              i_exp, i_exp_len;
409       size_t i;
410       int state;
411       const char *arg;
412    
413       //Check out the parameters that can't be NULL.
414       assert(s != NULL);
415       assert(failure != NULL);
416    
417       //Initialize all variables to defaults.
418       *failure           =  0 ;
419       i_mant_sign        = 'N';
420       i_exp_sign         = 'N';
421       i_mant_bdp         =  0 ;
422       i_mant_bdp_len     =  0 ;
423       i_mant_adp         =  0 ;
424       i_mant_adp_len     =  0 ;
425       i_exp              =  0 ;
426       i_exp_len          =  0 ;
427       i                  =  0 ;
428       state              =  0 ;
429    
430       //Process the string.  This is a big 10-state state
431       //machine.  Because of the complexity, I've included
432       //some state definitions as well in the comments.
433       arg = s;
434    
435       while(1)
436          {
437          switch (state)
438             {
439             //Initial state from which we start processing.
440             case 0 : if (!*arg)
441                         {
442                         //The string is empty.  This is not OK.
443                         //Error out.
444                         *failure = 1;
445                         goto term_seq;
446                         }
447                      else if (*arg == '-')
448                         {
449                         //Leading - on the number.  Fine.
450                         i_mant_sign = '-';
451                         state = 1;
452                         }
453                      else if (*arg == '+')
454                         {
455                         //Leading + on the number.  Fine.
456                         i_mant_sign = '+';
457                         state = 2;
458                         }
459                      else if (*arg == '.')
460                         {
461                         //Leading . on the number.  Fine.
462                         state = 5;
463                         }
464                      else if (*arg == '0')
465                         {
466                         i_mant_bdp = arg - s;
467                         state = 4;
468                         }
469                      else if ((*arg >= '1') && (*arg <= '9'))
470                         {
471                         i_mant_bdp = arg - s;
472                         state = 3;
473                         }
474                      else
475                         {
476                         //Unidentifiable crap.  This is not OK.
477                         //Error out.
478                         *failure = 1;
479                         goto term_seq;
480                         }
481                      break;
482             //The leading character of the string was '-'.  We
483             //are processing a negative number.
484             case 1 : if (!*arg)
485                         {
486                         //The string is empty.  This is not OK because
487                         //it means the string was "-".
488                         //Error out.
489                         *failure = 1;
490                         goto term_seq;
491                         }
492                      else if (*arg == '.')
493                         {
494                         //We have a - followed by a decimal point.
495                         //This is impolite form, but will accept
496                         //it as a number.
497                         state = 5;
498                         }
499                      else if (*arg == '0')
500                         {
501                         //We have a '-' followed by a '0'.
502                         //Seems reasonable.
503                         i_mant_bdp = arg - s;
504                         state = 4;
505                         }
506                      else if ((*arg >= '1') && (*arg <= '9'))
507                         {
508                         //We have a '-' followed by a non-zero
509                         //digit.  Seems reasonable.
510                         i_mant_bdp = arg - s;
511                         state = 3;
512                         }
513                      else
514                         {
515                         //Unidentifiable crap.  This is not OK.
516                         //Error out.
517                         *failure = 1;
518                         goto term_seq;
519                         }
520                      break;
521             //The leading character of the string was '+'.  We
522             //are processing an explicitly declared positive number.
523             case 2 : if (!*arg)
524                         {
525                         //The string is empty.  This is not OK because
526                         //it means the string was "+".
527                         //Error out.
528                         *failure = 1;
529                         goto term_seq;
530                         }
531                      else if (*arg == '.')
532                         {
533                         //We have a + followed by a decimal point.
534                         //This is impolite form, but will accept
535                         //it as a number.
536                         state = 5;
537                         }
538                      else if (*arg == '0')
539                         {
540                         //We have a '-' followed by a '0'.
541                         //Seems reasonable.
542                         i_mant_bdp = arg - s;
543                         state = 4;
544                         }
545                      else if ((*arg >= '1') && (*arg <= '9'))
546                         {
547                         //We have a '+' followed by a non-zero
548                         //digit.  Seems reasonable.
549                         i_mant_bdp = arg - s;
550                         state = 3;
551                         }
552                      else
553                         {
554                         //Unidentifiable crap.  This is not OK.
555                         //Error out.
556                         *failure = 1;
557                         goto term_seq;
558                         }
559                      break;
560             //We've encountered a non-zero digit either first as part
561             //of the string or later after + or -.  We are processing
562             //a mantissa that does not begin with "0".
563             case 3 : if (!*arg)
564                         {
565                         //We've reached the end of the string.  This is
566                         //fine because we have a simple integer of the
567                         //form NNNN, +NNNN, or -NNNN.  No problem with that.
568                         i_mant_bdp_len = (arg - s) - i_mant_bdp;
569                         *failure = 0;
570                         goto term_seq;
571                         }
572                      else if (*arg == '.')
573                         {
574                         //Number followed by decimal point.  This
575                         //means the mantissa is terminating.  No issue.
576                         i_mant_bdp_len = (arg - s) - i_mant_bdp;
577                         state = 5;
578                         }
579                      else if ((*arg >= '0') && (*arg <= '9'))
580                         {
581                         //Yet more digits.  Seems reasonable.
582                         //The assignment isn't necessary, but it
583                         //is aesthetic.
584                         state = 3;
585                         }
586                      else if ((*arg == 'e') || (*arg == 'E'))
587                         {
588                         //Beginning of an exponent.  This again
589                         //means the mantissa is terminating.  No issue.
590                         i_mant_bdp_len = (arg - s) - i_mant_bdp;
591                         state = 6;
592                         }
593                      else
594                         {
595                         //Unidentifiable crap.  This is not OK.
596                         //Error out.
597                         *failure = 1;
598                         goto term_seq;
599                         }
600                      break;
601             //We're processing a mantissa that begins with zero.  There
602             //is only one zero allowed before the decimal point.
603             case 4 : if (!*arg)
604                         {
605                         //We've reached the end of the string.  This is
606                         //fine because it means we have zero.  I'm going
607                         //to be unusually permissive and allow -0 and +0,
608                         //which isn't traditional.
609                         i_mant_bdp_len = (arg - s) - i_mant_bdp;
610                         *failure = 0;
611                         goto term_seq;
612                         }
613                      else if (*arg == '.')
614                         {
615                         //Zero followed by decimal point.  This
616                         //means the mantissa is terminating.  No issue.
617                         i_mant_bdp_len = (arg - s) - i_mant_bdp;
618                         state = 5;
619                         }
620                      else if ((*arg == 'e') || (*arg == 'E'))
621                         {
622                         //Beginning of an exponent.  This again
623                         //means the mantissa is terminating.  No issue.
624                         i_mant_bdp_len = (arg - s) - i_mant_bdp;
625                         state = 6;
626                         }
627                      else
628                         {
629                         //Unidentifiable crap.  This is not OK.
630                         //Error out.
631                         *failure = 1;
632                         goto term_seq;
633                         }
634                      break;
635                      //A decimal point has been found in the string.
636                      //This marks the end of the mantissa, for sure.
637             case 5 : if (!*arg)
638                         {
639                         //We've reached the end of the string.  There are
640                         //two possibilities here.  Either there have been no
641                         //digits before the decimal points, which is a no-no,
642                         //or there have been digits, which is fine.
643                         if (i_mant_bdp_len)
644                            {
645                            *failure = 0;
646                            goto term_seq;
647                            }
648                         else
649                            {
650                            *failure = 1;
651                            goto term_seq;
652                            }
653                         }
654                      else if ((*arg >= '0') && (*arg <= '9'))
655                         {
656                         //Digits after the decimal point.  Need to
657                         //begin the portion after the decimal point.
658                         i_mant_adp = arg - s;
659                         state = 10;
660                         }
661                      else if ((*arg == 'e') || (*arg == 'E'))
662                         {
663                         //Beginning of an exponent.  This means
664                         //that have no digits after the decimal point.
665                         //This is OK.
666                         state = 6;
667                         }
668                      else
669                         {
670                         //Unidentifiable crap.  This is not OK.
671                         //Error out.
672                         *failure = 1;
673                         goto term_seq;
674                         }
675                      break;
676                     //The exponent has begin.
677             case 6: if (!*arg)
678                         {
679                         //The string is empty.  This is not OK
680                         //because it would mean an E with nothing
681                         //following it.  This is a no-no.
682                         //Error out.
683                         *failure = 1;
684                         goto term_seq;
685                         }
686                      else if (*arg == '-')
687                         {
688                         //Leading - on the exponent.  Fine.
689                         i_exp_sign = '-';
690                         state = 8;
691                         }
692                      else if (*arg == '+')
693                         {
694                         //Leading + on the exponent.  Fine.
695                         i_exp_sign = '+';
696                         state = 7;
697                         }
698                      else if ((*arg >= '0') && (*arg <= '9'))
699                         {
700                         //Beginning the digits of the exponent.  Fine.
701                         i_exp = arg - s;
702                         state = 9;
703                         }
704                      else
705                         {
706                         //Unidentifiable crap.  This is not OK.
707                         //Error out.
708                         *failure = 1;
709                         goto term_seq;
710                         }
711                      break;
712    
713                      //Had a + sign before the exponent.  Now expecting digits.
714             case  7: if (!*arg)
715                         {
716                         //The string is empty.  This is not OK
717                         //because it would mean an E+ with nothing
718                         //following it.  This is a no-no.
719                         //Error out.
720                         *failure = 1;
721                         goto term_seq;
722                         }
723                      else if ((*arg >= '0') && (*arg <= '9'))
724                         {
725                         //Beginning the digits of the exponent.  Fine.
726                         i_exp = arg - s;
727                         state = 9;
728                         }
729                      else
730                         {
731                         //Unidentifiable crap.  This is not OK.
732                         //Error out.
733                         *failure = 1;
734                         goto term_seq;
735                         }
736                      break;
737                      //Had a - sign before the exponent.  Now expecting digits.
738             case  8: if (!*arg)
739                         {
740                         //The string is empty.  This is not OK
741                         //because it would mean an E- with nothing
742                         //following it.  This is a no-no.
743                         //Error out.
744                         *failure = 1;
745                         goto term_seq;
746                         }
747                      else if ((*arg >= '0') && (*arg <= '9'))
748                         {
749                         //Beginning the digits of the exponent.  Fine.
750                         i_exp = arg - s;
751                         state = 9;
752                         }
753                      else
754                         {
755                         //Unidentifiable crap.  This is not OK.
756                         //Error out.
757                         *failure = 1;
758                         goto term_seq;
759                         }
760                      break;
761                      //Had one digit of exponent.  Am processing remaining ones.
762             case 9 : if (!*arg)
763                         {
764                         //We've reached the end of the string.  This is
765                         //fine because we have an exponent of the
766                         //form NNNN, +NNNN, or -NNNN.  No problem with that.
767                         i_exp_len = (arg - s) - i_exp;
768                         *failure = 0;
769                         goto term_seq;
770                         }
771                      else if ((*arg >= '0') && (*arg <= '9'))
772                         {
773                         //Yet more digits.  Seems reasonable.
774                         //The assignment isn't necessary, but it
775                         //is aesthetic.
776                         state = 9;
777                         }
778                      else
779                         {
780                         //Unidentifiable crap.  This is not OK.
781                         //Error out.
782                         *failure = 1;
783                         goto term_seq;
784                         }
785                      break;
786                      //Processing digits after decimal point.  This state is out
787                      //of sequence because added it after on diagram.
788             case 10: if (!*arg)
789                         {
790                         //We've reached the end of the string.  This is
791                         //fine.
792                         i_mant_adp_len = (arg - s) - i_mant_adp;
793                         *failure = 0;
794                         goto term_seq;
795                         }
796                      else if ((*arg >= '0') && (*arg <= '9'))
797                         {
798                         //Yet more digits.  Seems reasonable.
799                         //The assignment isn't necessary, but it
800                         //is aesthetic.
801                         state = 10;
802                         }
803                      else if ((*arg == 'e') || (*arg == 'E'))
804                         {
805                         //Beginning of an exponent.  This terminates
806                         //the digits after the decimal point.
807                         i_mant_adp_len = (arg - s) - i_mant_adp;
808                         state = 6;
809                         }
810                      else
811                         {
812                         //Unidentifiable crap.  This is not OK.
813                         //Error out.
814                         *failure = 1;
815                         goto term_seq;
816                         }
817                      break;
818             default:
819                      abort();
820                      break;
821             }
822    
823          arg++;
824          }
825    
826    
827       //This is the setup for returning to the caller.  We can
828       //only fill in those data pointer for the caller that are
829       //not NULL.
830       term_seq:
831       if (mant_sign)
832          *mant_sign = i_mant_sign;
833       if (mant_bdp)
834          *mant_bdp = i_mant_bdp;
835       if (mant_bdp_len)
836          *mant_bdp_len = i_mant_bdp_len;
837       if (mant_adp)
838          *mant_adp = i_mant_adp;
839       if (mant_adp_len)
840          *mant_adp_len = i_mant_adp_len;
841       if (exp_sign)
842          *exp_sign = i_exp_sign;
843       if (exp)
844          *exp = i_exp;
845       if (exp_len)
846          *exp_len = i_exp_len;
847       }
848    
849    
850    //07/18/01:  Has passed visual verification plus unit tests.
851    void BSTRFUNC_commanate(char *s)
852       {
853       int l;
854       int ncommas;
855       char *putpt, *getpt;
856       int ndigits;
857    
858       //Adds commas to a numeric string.  The space
859       //must exist in the area passed.
860       assert(s);
861    
862       //If the leading character on the string is a
863       //'-', bump the pointer.  Then everything
864       //else applies as for an unsigned.
865       if (*s == '-')
866         s++;
867    
868       //Be sure the string currently meets the syntax for
869       //a signed integer.  If not, don't even touch it.
870       if (!BSTRFUNC_is_uint_wo_commas(s))
871          return;
872    
873       //Get the length of the current string.
874       l = strlen(s);
875    
876       //Let's agree, just in case something slipped through
877       //the cracks, that zero length strings are not of
878       //interest to us.
879       if (l==0)
880         return;
881    
882       //The number of commas to add is precisely
883       //(N-1) div 3.
884       if (l==0)
885          ncommas = 0;
886       else
887          ncommas = (l-1)/3;
888    
889       //Walk through the string, adding commas.
890       getpt = s + l - 1;
891       putpt = s + l + ncommas;
892    
893       *putpt = 0; //Write the zero terminator.
894       putpt--;
895    
896       ndigits = 0;
897    
898       while ((putpt > s) && (getpt > s))
899          {
900          *putpt = *getpt;
901          putpt--;
902          getpt--;
903          ndigits++;
904          if (((ndigits % 3) == 0) && (putpt != s))
905             {
906             *putpt = ',';
907             putpt--;
908             }
909          assert((putpt >= s) && (getpt>=s));
910          }
911       }
912    
913    
914    //07/28/01:  Visual inspection only.
915    void BSTRFUNC_decommanate(char *s)
916       {
917       char *src, *dst;
918    
919       assert(s != NULL);
920    
921       src = dst = s;
922    
923       while(1)
924          {
925          if (!*src)
926             {
927             *dst = 0;
928             break;
929             }
930          else if (*src == ',')
931             {
932             src++;
933             }
934          else
935             {
936             *dst = *src;
937             src++;
938             dst++;
939             }
940          }
941       }
942    
943    
944    void BSTRFUNC_parse_str_to_uint32(const char *s,
945                                      unsigned int *rv,
946                                      int *error)
947       {
948       unsigned _int64 temp;
949       int digval;
950    
951       //Eyeball the input arguments.
952       assert(s != NULL);
953       assert(error != NULL);
954    
955       //Start off believing there is no error.
956       *error = 0;
957    
958       //The string has to parse out as an unsigned integer or an
959       //unsigned integer with commas, or we won't touch it.
960       if (!BSTRFUNC_is_uint_wo_commas(s) && !BSTRFUNC_is_uint_w_commas(s))
961          {
962          *error = 1;
963          return;
964          }
965    
966       //OK, we know we have an unsigned integer, either without commas,
967       //or with properly placed commas.  Our only worry now is that it
968       //is of a size that will fit in 32 bits.  The way we can deal with
969       //this is to format it into 64 bits and watch for overflow.
970       temp = 0;
971    
972       while (*s)
973          {
974          digval = CHARFUNC_digit_to_val(*s);
975          if (digval >= 0)
976             {
977             temp *= 10;
978             temp += digval;
979             if ((temp >> 32) & 0xFFFFFFFF)
980                {
981                //We've had an overflow.
982                *error = 1;
983                return;
984                }
985             }
986          s++;
987          }
988    
989       *rv = (unsigned int)temp;
990       }
991    
992    
993    const char *BSTRFUNC_cvcinfo(void)
994       {
995       return("$Header$");
996       }
997    
998    
999    const char *BSTRFUNC_hvcinfo(void)
1000       {
1001       return(BSTRFUNC_H_VERSION);
1002       }
1003    
1004    //End of bstrfunc.c.
Legend:
Removed from v.29  
changed lines
  Added in v.98
dashley@gmail.com
 ViewVC Help
Powered by ViewVC 1.1.25