travis-src-190101/ 0040777 0000000 0000000 00000000000 13412726057 010651 5 ustar 00 travis-src-190101/COPYING 0100777 0000000 0000000 00000104514 11643644067 011715 0 ustar 00 GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
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.
Copyright (C)
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 .
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:
Copyright (C)
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
.
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
.
travis-src-190101/Makefile 0100777 0000000 0000000 00000004341 13412726130 012303 0 ustar 00 #*****************************************************************************
# TRAVIS - Trajectory Analyzer and Visualizer
# http://www.travis-analyzer.de/
#
# Copyright (c) 2009-2019 Martin Brehm
# 2012-2019 Martin Thomas
# 2016-2019 Sascha Gehrke
#
# This file written by Martin Brehm.
#
# 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 .
#*****************************************************************************
# TRAVIS Makefile
# Edit the follwing lines according to your needs
# Your C++ compiler
CXX = g++
#**************************************************************************
# You should not need to edit the following part
#**************************************************************************
CFLAGS = -g -Wall -Wextra -Wformat -Wformat-security -pedantic -ansi -O2 $(FFTW_INCLUDE)
CFLAGS_PROF = -g -Wall -Wextra -Wformat -Wformat-security -pedantic -ansi -O2 -pg $(FFTW_INCLUDE)
CFLAGS_DEB = -g -Wall -Wextra -Wformat -Wformat-security -pedantic -ansi -O0 $(FFTW_INCLUDE)
CFLAGS_REL = -g -Wall -Wextra -Wformat -Wformat-security -pedantic -ansi -O3 $(FFTW_INCLUDE) -march=athlon-fx
LDFLAGS = $(FFTW_LIB)
SRC = $(wildcard src/*.cpp)
OBJ = $(SRC:%.cpp=%.o)
BIN = exe/travis
all: executable
debug: CFLAGS = $(CFLAGS_DEB)
debug: executable
release: CFLAGS = $(CFLAGS_REL)
release: executable
profile: CFLAGS = $(CFLAGS_PROF)
profile: executable
executable: $(OBJ)
mkdir -p exe
$(CXX) $(CFLAGS) -o $(BIN) $(OBJ) $(LDFLAGS)
%.o: %.cpp
$(CXX) $(CFLAGS) -c $< -o $@
.PHONY: clean
clean:
rm -f $(OBJ)
.PHONY: distclean
distclean:
rm -f $(OBJ)
rm -rf exe
travis-src-190101/README 0100777 0000000 0000000 00000002445 13412726076 011537 0 ustar 00
***************************************************
*** TRAVIS - Trajectory Analyzer and Visualizer ***
***************************************************
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
Please read our article:
M. Brehm and B. Kirchner, J. Chem. Inf. Model. 2011, 51 (8), pp 2007-2023
TRAVIS ("TRajectory Analyzer and VISualizer") is a program package
for analyzing and visualizing Monte Carlo and molecular dynamics trajectories.
TRAVIS is open-source freeware and licensed under the terms of the
GNU General Public License v3 (see file COPYING).
* Installation *
To compile TRAVIS, open the Makefile and set the CXX variable
to the C++ compiler of your choice. Then just enter "make". If everything
worked, an executable ("travis") should appear in the "exe" directory.
TRAVIS does not require any external libraries.
When compiling TRAVIS on systems that are not running Linux, you may have to
edit the "config.h" file in the "src" directory. Comment out the "TARGET_LINUX" line.
If you are building an Windows version, you may want to uncomment the "TARGET_WINDOWS" line.
With both lines commented out, you get a platform-independent build without
special features.
travis-src-190101/src/ 0040777 0000000 0000000 00000000000 13412726045 011435 5 ustar 00 travis-src-190101/src/2df.cpp 0100777 0000000 0000000 00001006721 13412725624 012625 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "2df.h"
#include "travis.h"
const char *GetRevisionInfo_2df(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_2df() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
C2DF::C2DF()
{
m_sLabelX = NULL;
m_sLabelY = NULL;
m_sLabelZ = NULL;
m_pBin = NULL;
m_pStepsY = NULL;
m_fCountX = NULL;
m_fCountY = NULL;
m_iHistogramRes = 0;
m_iPlotType = 1;
m_iSmoothGrade = 1;
m_iInterpolationOrder = 2;
if (g_pDatabase != NULL)
m_fPlotExp = g_pDatabase->GetFloat("/PLOT2D/DEFAULTS/PLOT_EXP");
else
m_fPlotExp = 0.5;
m_iExpLegend = 1;
m_iColorScale = 1;
m_iGPInterpolation = 5;
m_bContourLines = true;
m_fAspectRatio = 1.0;
m_bDrawMesh = true;
if (g_pDatabase != NULL)
m_iPlotPixel = g_pDatabase->GetInt("/PLOT2D/DEFAULTS/IMAGE_RES");
else
m_iPlotPixel = 1000;
if (g_pDatabase != NULL)
m_iContourLines = g_pDatabase->GetInt("/PLOT2D/DEFAULTS/CONTOUR_LINES");
else
m_iContourLines = 30;
m_oaCircles.SetName("C2DF::m_oaCircles");
}
C2DF::~C2DF()
{
if (m_sLabelX != NULL)
{
delete[] m_sLabelX;
m_sLabelX = NULL;
}
if (m_sLabelY != NULL)
{
delete[] m_sLabelY;
m_sLabelY = NULL;
}
if (m_sLabelZ != NULL)
{
delete[] m_sLabelZ;
m_sLabelZ = NULL;
}
if (m_pBin != NULL)
{
delete[] m_pBin;
m_pBin = NULL;
}
if (m_pStepsY != NULL)
{
delete[] m_pStepsY;
m_pStepsY = NULL;
}
if (m_fCountX != NULL)
{
delete[] m_fCountX;
m_fCountX = NULL;
}
if (m_fCountY != NULL)
{
delete[] m_fCountY;
m_fCountY = NULL;
}
}
void C2DF::CorrectAngle(int channel)
{
BTIN;
int z, z2;
double d;
if (channel == 0)
{
for (z=0;z m_fMaxVal[0]) || (y > m_fMaxVal[1]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = (x-m_fMinVal[0])*m_fFac[0] - 0.5;
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
ry = (y-m_fMinVal[1])*m_fFac[1] - 0.5;
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
m_pBin[ iy * m_iRes[0] + ix ] += (1.0-rx) * (1.0-ry);
m_pBin[ iy * m_iRes[0] + ix + 1] += rx * (1.0-ry);
m_pBin[(iy+1) * m_iRes[0] + ix ] += (1.0-rx) * ry;
m_pBin[(iy+1) * m_iRes[0] + ix + 1] += rx * ry;
m_fCountX[ix ] += (1.0-rx);
m_fCountX[ix+1] += rx;
m_fCountY[iy ] += (1.0-ry);
m_fCountY[iy+1] += ry;
BXOUT;
}
void C2DF::AddToBin(double x, double y, double val)
{
BXIN;
double rx, ry;
int ix, iy;
if ((x < m_fMinVal[0]) || (y < m_fMinVal[1]) || (x > m_fMaxVal[0]) || (y > m_fMaxVal[1]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = (x-m_fMinVal[0])*m_fFac[0] - 0.5;
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
ry = (y-m_fMinVal[1])*m_fFac[1] - 0.5;
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
m_pBin[ iy * m_iRes[0] + ix ] += (1.0-rx) * (1.0-ry) * val;
m_pBin[ iy * m_iRes[0] + ix + 1] += rx * (1.0-ry) * val;
m_pBin[(iy+1) * m_iRes[0] + ix ] += (1.0-rx) * ry * val;
m_pBin[(iy+1) * m_iRes[0] + ix + 1] += rx * ry * val;
m_fCountX[ix ] += (1.0-rx);
m_fCountX[ix+1] += rx;
m_fCountY[iy ] += (1.0-ry);
m_fCountY[iy+1] += ry;
BXOUT;
}
void C2DF::AddToBin_IntX(int x, double y, double val)
{
BXIN;
double ry;
int iy;
if ((y < m_fMinVal[1]) || (y > m_fMaxVal[1]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
ry = (y-m_fMinVal[1])*m_fFac[1] - 0.5;
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
m_pBin[ iy * m_iRes[0] + x] += (1.0-ry) * val;
m_pBin[(iy+1) * m_iRes[0] + x] += ry * val;
m_fCountX[x]++;
m_fCountY[iy ] += (1.0-ry);
m_fCountY[iy+1] += ry;
BXOUT;
}
void C2DF::AddToBin_IntY(double x, int y, double val)
{
BXIN;
double rx;
int ix;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = (x-m_fMinVal[0])*m_fFac[0] - 0.5;
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
m_pBin[ ix + y * m_iRes[0]] += (1.0-rx) * val;
m_pBin[(ix+1) + y * m_iRes[0]] += rx * val;
m_fCountY[y]++;
m_fCountX[ix ] += (1.0-rx);
m_fCountX[ix+1] += rx;
BXOUT;
}
void C2DF::AddToBin_IntY(double x, int y)
{
BXIN;
double rx;
int ix;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = (x-m_fMinVal[0])*m_fFac[0] - 0.5;
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
m_pBin[ ix + y * m_iRes[0]] += (1.0-rx);
m_pBin[(ix+1) + y * m_iRes[0]] += rx ;
m_fCountY[y]++;
m_fCountX[ix ] += (1.0-rx);
m_fCountX[ix+1] += rx;
BXOUT;
}
/*void C2DF::AddToSingleBin(double x, double y, double val)
{
BXIN;
double rx, ry;
int ix, iy;
if ((x < m_fMinVal[0]) || (y < m_fMinVal[1]) || (x > m_fMaxVal[0]) || (y > m_fMaxVal[1]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = ((x-m_fMinVal[0])/(m_fMaxVal[0]-m_fMinVal[0]))*((double)m_iRes[0]-1);
ry = ((y-m_fMinVal[1])/(m_fMaxVal[1]-m_fMinVal[1]))*((double)m_iRes[1]-1);
ix = (int)(rx+0.5);
iy = (int)(ry+0.5);
m_pBin[iy*(m_iRes[0]+1) + ix] += val;
BXOUT;
}*/
//DEL void C2DF::CorrectRadialDist(bool xdim)
//DEL {
//DEL BTIN;
//DEL int x, y;
//DEL double f;
//DEL
//DEL if (xdim)
//DEL {
//DEL for (x=0;xm_laSingleMolIndex.GetSize();
if (f < m_pBin[z])
f = m_pBin[z];
}
BTOUT;
return f;
}
void C2DF::NormalizeBin(double mi, double ma)
{
BTIN;
int z;
double tmi, tma, d, td;
tmi = 99999999.0;
tma = 0.0;
for (z=0;z tma)
tma = m_pBin[z];
}
if (tma-tmi < 1E-20)
tma += 0.00001;
d = ma - mi;
td = tma - tmi;
for (z=0;zCurrentGraph()->m_bLegend = true;
if (channel == 0)
{
g->SetLabelX(m_sLabelY);
if (m_sLabelZ == NULL)
g->SetLabelY("Occurrence");
else g->SetLabelY(m_sLabelZ);
CalcMaxEntry();
g->SetRangeX(m_fMinVal[1],m_fMaxVal[1]);
g->SetRangeY(0,m_fMaxEntry*1.1*fac);
g->MakeTicks();
// sprintf(buf,"Legend unit is %s",m_sLabelX);
buf.sprintf("Legend unit is %s",m_sLabelX);
g->SetSubTitle(buf);
for (x=0;xAddDataset();
// sprintf(buf,"%.2f",m_fMinVal[0]+t*(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0]);
buf.sprintf("%.2f",m_fMinVal[0]+t*(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0]);
g->SetDatasetName(buf);
g->CurrentGraph()->CurrentDataset()->m_faValues.SetMaxSize(m_iRes[1]*2);
for (y=0;yAddXYTupel(m_fMinVal[1]+(y+0.5)*(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1],m_pBin[y*m_iRes[0]+t]*fac);
}
} else
{
g->SetLabelX(m_sLabelX);
if (m_sLabelZ == NULL)
g->SetLabelY("Occurrence");
else g->SetLabelY(m_sLabelZ);
CalcMaxEntry();
g->SetRangeX(m_fMinVal[0],m_fMaxVal[0]);
g->SetRangeY(0,m_fMaxEntry*1.1*fac);
g->MakeTicks();
// sprintf(buf,"Legend unit is %s",m_sLabelY);
buf.sprintf("Legend unit is %s",m_sLabelY);
g->SetSubTitle(buf);
for (y=0;yAddDataset();
// sprintf(buf,"%.2f",m_fMinVal[1]+t*(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1]);
buf.sprintf("%.2f",m_fMinVal[1]+t*(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1]);
g->SetDatasetName(buf);
g->CurrentGraph()->CurrentDataset()->m_faValues.SetMaxSize(m_iRes[0]*2);
for (x=0;xAddXYTupel(m_fMinVal[0]+(x+0.5)*(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0],m_pBin[t*m_iRes[0]+x]*fac);
}
}
// strcpy(buf,prefix);
// strcat(buf,name);
// strcat(buf,suffix);
buf.strcpy(prefix);
buf.strcat(name);
buf.strcat(suffix);
g->WriteAgr(buf,false);
*strrchr(buf.GetWritePointer(),'.') = 0;
buf.strcat(".csv");
g->WriteCSV(buf);
BTOUT;
}
void C2DF::WriteCSV(const char *prefix, const char *name, const char *suffix)
{
BTIN;
FILE *a;
int z, z2;
// char buf[32768];
CxString buf;
// strcpy(buf,prefix);
// strcat(buf,name);
// strcat(buf,suffix);
buf.strcpy(prefix);
buf.strcat(name);
buf.strcat(suffix);
a = OpenFileWrite(buf,true);
if (m_sLabelX == NULL)
mfprintf(a,"(no label) \\ ");
else mfprintf(a,"%s \\ ",m_sLabelX);
if (m_sLabelY == NULL)
mfprintf(a,"(no label)");
else mfprintf(a,"%s",m_sLabelY);
for (z=0;z abs(s_zmax)) s_zmax=abs(s_zmin); else s_zmin=-abs(s_zmax)\n\n");
mfprintf(b,"font_string = sprintf(\"%cs,%cd\", \"Helvetica\", 24*s_scale)\n",'%','%');
mfprintf(b,"titlefont_string = sprintf(\"%cs,%cd\", \"Helvetica\", 24*1.2*s_scale*s_titlefontscale)\n",'%','%');
mfprintf(b,"labelfont_string = sprintf(\"%cs,%cd\", \"Helvetica\", 24*s_scale*s_labelfontscale)\n",'%','%');
mfprintf(b,"ticsfont_string = sprintf(\"%cs,%cd\", \"Helvetica\", 24*s_scale*s_ticsfontscale)\n",'%','%');
mfprintf(b,"\n");
mfprintf(b,"set term pngcairo enhanced font font_string linewidth 4.0*s_scale size 1024*s_scale,1024*s_scale\n");
mfprintf(b,"set output \"%s.png\"\n",(const char*)out2);
mfprintf(b,"set size ratio s_ratio\n");
mfprintf(b,"\n");
mfprintf(b,"set title s_title font titlefont_string\n");
mfprintf(b,"set xlabel s_xtitle font labelfont_string\n");
mfprintf(b,"set ylabel s_ytitle font labelfont_string\n");
mfprintf(b,"unset key\n");
mfprintf(b,"unset clabel\n");
mfprintf(b,"\n");
mfprintf(b,"set pm3d interpolate s_xipl,s_yipl map\n");
mfprintf(b,"\n");
if (m_iColorScale == 4) // Plus-Minus-Plot
mfprintf(b,"set palette model RGB functions gray<=0.0 ? 0.0 : gray<0.1 ? 0.0 : gray<0.4 ? 0.0 : gray<0.5 ? (gray-0.4)/0.1 : gray<0.6 ? 1.0 : gray<0.8 ? 1.0 : gray<1.0 ? 1.0 : 1.0, gray<=0.0 ? 0.0 : gray<0.1 ? 0.0 : gray<0.4 ? (gray-0.1)/0.3 : gray<0.5 ? 1.0 : gray<0.6 ? 1.0 : gray<0.8 ? ((0.8-gray)/0.2)**0.5 : gray<1.0 ? 0.0 : 0.0, gray<=0.0 ? 0.5 : gray<0.1 ? 0.5+gray*5.0 : gray<0.4 ? 1.0 : gray<0.5 ? 1.0 : gray<0.6 ? (0.6-gray)/0.1 : gray<0.8 ? 0.0 : gray<1.0 ? (gray-0.8)/0.1 : 1.0\n");
else
mfprintf(b,"set palette model RGB functions gray<=0.0 ? 1.0 : gray<0.2 ? 1.0-(5.0**1.5*gray**1.5)*0.8 : gray<0.4 ? 0.2-(gray-0.2) : gray<0.6 ? 5.0**0.5*(gray-0.4)**0.5 : gray<0.8 ? 1.0 : gray<1.0 ? 1.0 : 1.0, gray<=0.0 ? 1.0 : gray<0.2 ? 1.0-(5.0**1.5*gray**1.5)*0.8 : gray<0.4 ? 0.2+0.8*(5.0**0.75*(gray-0.2)**0.75) : gray<0.6 ? 1.0 : gray<0.8 ? 1.0-5.0*(gray-0.6) : gray<1.0 ? 0.0 : 0.0, gray<=0.0 ? 1.0 : gray<0.2 ? 1.0 : gray<0.4 ? 1.0-5.0**1.33*(gray-0.2)**1.33 : gray<0.6 ? 0.0 : gray<0.8 ? 0.0 : gray<1.0 ? 5.0*(gray-0.8) : 1.0\n");
mfprintf(b,"\n");
mfprintf(b,"if (s_contour) set palette maxcolors s_ncontour; else set palette maxcolors 0\n");
mfprintf(b,"\n");
mfprintf(b,"set xrange [s_xmin:s_xmax]\n");
mfprintf(b,"set yrange [s_ymin:s_ymax]\n");
mfprintf(b,"set zrange [f_plot(s_zmin):f_plot(s_zmax)]\n");
mfprintf(b,"set cbrange [f_plot(s_zmin):f_plot(s_zmax)]\n");
mfprintf(b,"unset colorbox\n");
mfprintf(b,"\n");
mfprintf(b,"set tics font ticsfont_string\n");
mfprintf(b,"set xtics s_xtics out scale 0.5*s_borderscale offset 0,0.5\n");
mfprintf(b,"set mxtics s_mxtics\n");
mfprintf(b,"set ytics s_ytics out scale 0.5*s_borderscale offset 0.5,0\n");
mfprintf(b,"set mytics s_mytics\n");
mfprintf(b,"\n");
mfprintf(b,"set border linewidth s_borderscale\n");
mfprintf(b,"\n");
mfprintf(b,"set multiplot\n");
mfprintf(b,"\n");
mfprintf(b,"set origin -0.05,-0.05\n");
mfprintf(b,"set size 1.15,1.15\n");
mfprintf(b,"\n");
mfprintf(b,"splot \"%s\" matrix using ($2*%G+%G):($1*%G+%G):(f_plot($3))\n",(const char*)out,(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0],m_fMinVal[0]+(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0]/2.0,(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1],m_fMinVal[1]+(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1]/2.0);
// mfprintf(b,"splot \"test5.dat\" matrix using ($2*1.5+50.75):($1*5.0+2.5):(f_plot($3))\n");
mfprintf(b,"\n");
mfprintf(b,"set grid xtics mxtics ytics mytics back linestyle -1 linewidth 0.15*s_gridscale linecolor rgbcolor \"gray40\"\n");
mfprintf(b,"set title \"\"\n");
mfprintf(b,"set xlabel \"\"\n");
mfprintf(b,"set ylabel \"\"\n");
mfprintf(b,"set xtics in format \"\"\n");
mfprintf(b,"set ytics in format \"\"\n");
mfprintf(b,"if (s_contour) set contour base; set cntrparam bspline; set cntrparam levels incremental f_plot(s_zmin),1.0*(f_plot(s_zmax)-f_plot(s_zmin))/s_ncontour,f_plot(s_zmax)\n");
mfprintf(b,"\n");
mfprintf(b,"splot \"%s\" matrix using ($2*%G+%G):($1*%G+%G):(s_contour ? f_plot($3) : 1/0) with lines linewidth 0.15*s_contourscale linecolor rgbcolor \"black\" nosurface\n",(const char*)out,(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0],m_fMinVal[0]+(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0]/2.0,(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1],m_fMinVal[1]+(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1]/2.0);
mfprintf(b,"\n");
mfprintf(b,"unset multiplot\n");
mfprintf(b,"\n");
mfprintf(b,"if (s_lorient) t_x = 196*s_scale; else t_x = 896*s_scale\n");
mfprintf(b,"if (s_lorient) t_y = 896*s_scale; else t_y = 196*s_scale\n");
mfprintf(b,"\n");
mfprintf(b,"set term pngcairo enhanced font font_string linewidth 4.0*s_scale size t_x,t_y\n");
mfprintf(b,"set output \"%s_box.png\"\n",(const char*)out2);
mfprintf(b,"\n");
mfprintf(b,"if (s_lorient) t_ratio = 20; else t_ratio = 0.05\n");
mfprintf(b,"\n");
mfprintf(b,"set origin -0.13,-0.13\n");
mfprintf(b,"set size ratio t_ratio 1.25,1.25\n");
mfprintf(b,"\n");
mfprintf(b,"unset title\n");
mfprintf(b,"unset xlabel\n");
mfprintf(b,"unset ylabel\n");
mfprintf(b,"\n");
mfprintf(b,"set grid front\n");
mfprintf(b,"unset grid\n");
mfprintf(b,"\n");
mfprintf(b,"if (s_lorient) set xrange [0:1]; else set xrange [s_zmin:s_zmax]\n");
mfprintf(b,"if (s_lorient) set yrange [s_zmin:s_zmax]; else set yrange [0:1]\n");
mfprintf(b,"if (s_lorient) set format y; else set format x\n");
mfprintf(b,"if (s_zauto) set xtics scale 0.5*s_borderscale offset s_lorient ? -0.5 : 0,s_lorient ? 0 : 0.5 autofreq; else set xtics scale 0.5*s_borderscale offset 0,0.5 s_ztics\n");
mfprintf(b,"if (s_zauto) set mxtics default; else set mxtics s_mztics\n");
mfprintf(b,"if (s_zauto) set ytics scale 0.5*s_borderscale offset s_lorient ? -0.5 : 0,s_lorient ? 0 : 0.5 autofreq; else set ytics scale 0.5*s_borderscale offset 0,0.5 s_ztics\n");
mfprintf(b,"if (s_zauto) set mytics default; else set mytics s_mztics\n");
mfprintf(b,"if (s_lorient) unset xtics; else unset ytics\n");
mfprintf(b,"\n");
mfprintf(b,"if (s_lorient) set isosamples 2,500\n");
mfprintf(b,"\n");
mfprintf(b,"if (s_lorient) set view 0,0; set border 15; unset ztics; set size 0.85,1.5; set origin -0.13,-0.25\n");
mfprintf(b,"\n");
mfprintf(b,"splot f_plot(s_lorient ? y : x) nocontour, s_contour ? f_plot(s_lorient ? y : x) : 1/0 with lines linewidth 0.15*s_contourscale linecolor rgbcolor \"black\" nosurface\n");
fclose(b);
}
void C2DF::WriteMathematicaNb(const char *prefix, const char *name, const char *suffix, bool manrange, bool printinfo)
{
BTIN;
FILE *a;
int z, z2;
// char buf[32768];
CxString buf;
int minorx, majorx, minory, majory;
// strcpy(buf,prefix);
// strcat(buf,name);
// strcat(buf,suffix);
buf.strcpy(prefix);
buf.strcat(name);
buf.strcat(suffix);
if (!manrange)
CalcMaxEntry();
if ((m_iPlotType == 1) && (!m_bContourLines))
m_iPlotType = 2;
CreateTicks(m_fMinVal[0],m_fMaxVal[0],majorx,minorx,printinfo);
CreateTicks(m_fMinVal[1],m_fMaxVal[1],majory,minory,printinfo);
a = OpenFileWrite(buf,true);
mfprintf(a,"\n");
mfprintf(a,"Notebook[{\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," StyleBox[\n");
mfprintf(a," RowBox[{\"TRAVIS\", \" \", \"Analysis\"}], \"Section\",\n");
mfprintf(a," Evaluatable->False]], \"Input\",\n");
mfprintf(a," Evaluatable->False],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"Cell[\"Input Data\", \"Section\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"=\",\n");
mfprintf(a," RowBox[{\"dat2\", \"=\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
for (z=0;zDynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"prim\", \"=\", \n");
mfprintf(a," RowBox[{\"{\", \"}\"}]}], \";\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcX\", \"=\", \n");
mfprintf(a," RowBox[{\"{\", \"}\"}]}], \";\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcY\", \"=\", \n");
mfprintf(a," RowBox[{\"{\", \"}\"}]}], \";\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"x\", \"=.\"}], \";\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"s\", \"=.\"}], \";\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"maxsig\", \"[\",\n");
mfprintf(a," RowBox[{\"x_\", \",\", \"s_\"}], \"]\"}], \"=\",\n");
mfprintf(a," RowBox[{\"N\", \"[\",\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"x\", \"\\[Equal]\", \"0\"}], \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Ceiling\", \"[\", \n");
mfprintf(a," RowBox[{\"x\", \"/\", \n");
mfprintf(a," RowBox[{\"10\", \"^\", \n");
mfprintf(a," RowBox[{\"Floor\", \"[\", \n");
mfprintf(a," RowBox[{\"N\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Log\", \"[\", \n");
mfprintf(a," RowBox[{\"10\", \",\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}]}], \"]\"}], \"+\", \"1\", \"-\", \"s\"}],\n");
mfprintf(a," \"]\"}], \"]\"}]}]}], \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\"10\", \"^\", \n");
mfprintf(a," RowBox[{\"Floor\", \"[\", \n");
mfprintf(a," RowBox[{\"N\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Log\", \"[\", \n");
mfprintf(a," RowBox[{\"10\", \",\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}]}], \"]\"}], \"+\", \"1\", \"-\", \"s\"}], \n");
mfprintf(a," \"]\"}], \"]\"}]}]}]}], \"]\"}], \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}], \"/\", \"1000000\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\"}], \"\\n\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minsig\", \"[\", \n");
mfprintf(a," RowBox[{\"x_\", \",\", \"s_\"}], \"]\"}], \"=\", \n");
mfprintf(a," RowBox[{\"N\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"x\", \"\\[Equal]\", \"0\"}], \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Floor\", \"[\", \n");
mfprintf(a," RowBox[{\"x\", \"/\", \n");
mfprintf(a," RowBox[{\"10\", \"^\", \n");
mfprintf(a," RowBox[{\"Floor\", \"[\", \n");
mfprintf(a," RowBox[{\"N\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Log\", \"[\", \n");
mfprintf(a," RowBox[{\"10\", \",\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}]}], \"]\"}], \"+\", \"1\", \"-\", \"s\"}],\n");
mfprintf(a," \"]\"}], \"]\"}]}]}], \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\"10\", \"^\", \n");
mfprintf(a," RowBox[{\"Floor\", \"[\", \n");
mfprintf(a," RowBox[{\"N\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Log\", \"[\", \n");
mfprintf(a," RowBox[{\"10\", \",\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}]}], \"]\"}], \"+\", \"1\", \"-\", \"s\"}], \n");
mfprintf(a," \"]\"}], \"]\"}]}]}]}], \"]\"}], \"-\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}], \"/\", \"1000000\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\"}], \"\\n\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"prec\", \"[\", \"x_\", \"]\"}], \"=\", \n");
mfprintf(a," RowBox[{\"Max\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Floor\", \"[\", \n");
mfprintf(a," RowBox[{\"N\", \"[\", \n");
mfprintf(a," RowBox[{\"Log\", \"[\", \n");
mfprintf(a," RowBox[{\"10\", \",\", \n");
mfprintf(a," RowBox[{\"1\", \"/\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}]}]}], \"]\"}], \"]\"}], \"]\"}], \"+\", \n");
mfprintf(a," \"2\"}]}], \"]\"}]}], \";\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plot\", \":=\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"x\", \"=.\"}], \";\", \n");
mfprintf(a," RowBox[{\"y\", \"=.\"}], \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"Select\", \" \", \"Color\", \" \", \"Function\"}], \" \", \"*)\"}],");
mfprintf(a," \"\\[IndentingNewLine]\",");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"coloring\", \"\\[Equal]\", \"1\"}], \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \"x_\", \"]\"}], \"=\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"\\[LessEqual]\", \"0\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", \"1\", \",\", \"1\"}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", ");
mfprintf(a," RowBox[{\"1\", \"/\", \"5\"}]}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"1\", \"-\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"5\", \"^\", \"1.5\"}], \"*\", ");
mfprintf(a," RowBox[{\"x\", \"^\", \"1.5\"}]}], \")\"}], \"*\", \"0.8\"}]}], \",\", ");
mfprintf(a," RowBox[{\"1\", \"-\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"5\", \"^\", \"1.5\"}], \"*\", ");
mfprintf(a," RowBox[{\"x\", \"^\", \"1.5\"}]}], \")\"}], \"*\", \"0.8\"}]}], \",\", ");
mfprintf(a," \"1\"}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", ");
mfprintf(a," RowBox[{\"2\", \"/\", \"5\"}]}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"0.2\", \"-\", ");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", ");
mfprintf(a," RowBox[{\"1\", \"/\", \"5\"}]}], \")\"}]}], \",\", ");
mfprintf(a," RowBox[{\"0.2\", \"+\", ");
mfprintf(a," RowBox[{\"0.8\", \"*\", ");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"5\", \"^\", \"0.75\"}], \"*\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", ");
mfprintf(a," RowBox[{\"1\", \"/\", \"5\"}]}], \")\"}], \"^\", \"0.75\"}]}], ");
mfprintf(a," \")\"}]}]}], \",\", ");
mfprintf(a," RowBox[{\"1\", \"-\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"5\", \"^\", \"1.33\"}], \"*\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", ");
mfprintf(a," RowBox[{\"1\", \"/\", \"5\"}]}], \")\"}], \"^\", \"1.33\"}]}]}]}], ");
mfprintf(a," \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", ");
mfprintf(a," RowBox[{\"3\", \"/\", \"5\"}]}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"5\", \"^\", \"0.5\"}], \"*\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", ");
mfprintf(a," RowBox[{\"2\", \"/\", \"5\"}]}], \")\"}], \"^\", \"0.5\"}]}], \",\", ");
mfprintf(a," \"1\", \",\", \"0\"}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", ");
mfprintf(a," RowBox[{\"4\", \"/\", \"5\"}]}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", ");
mfprintf(a," RowBox[{\"1\", \"-\", ");
mfprintf(a," RowBox[{\"5\", \"*\", ");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", ");
mfprintf(a," RowBox[{\"3\", \"/\", \"5\"}]}], \")\"}]}]}], \",\", \"0\"}], \"]\"}], ");
mfprintf(a," \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", \"1\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", \"0\", \",\", ");
mfprintf(a," RowBox[{\"5\", \"*\", ");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", ");
mfprintf(a," RowBox[{\"4\", \"/\", \"5\"}]}], \")\"}]}]}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", \"0\", \",\", \"1\"}], \"]\"}]}], \"]\"}]}], ");
mfprintf(a," \"]\"}]}], \"]\"}]}], \"]\"}]}], \"]\"}]}], \"]\"}]}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"coloring\", \"\\[Equal]\", \"2\"}], \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \"x_\", \"]\"}], \"=\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"1\", \"-\", \"x\"}], \",\", ");
mfprintf(a," RowBox[{\"1\", \"-\", \"x\"}], \",\", ");
mfprintf(a," RowBox[{\"1\", \"-\", \"x\"}]}], \"]\"}]}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"coloring\", \"\\[Equal]\", \"3\"}], \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \"x_\", \"]\"}], \"=\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"ColorData\", \"[\", \"\\\"\\\\\"\", \"]\"}], \"[\", ");
mfprintf(a," \"x\", \"]\"}]}], \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \"x_\", \"]\"}], \"=\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"\\[LessEqual]\", \"0\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0.5\"}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", \"0.1\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", ");
mfprintf(a," RowBox[{\"0.5\", \"+\", ");
mfprintf(a," RowBox[{\"5\", \"*\", \"x\"}]}]}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", \"0.4\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"0\", \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", \"0.1\"}], \")\"}], \"/\", \"0.3\"}], \",\", ");
mfprintf(a," \"1\"}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", \"0.5\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", \"0.4\"}], \")\"}], \"/\", \"0.1\"}], \",\", \"1\", ");
mfprintf(a," \",\", \"1\"}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", \"0.6\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", \"1\", \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"0.6\", \"-\", \"x\"}], \")\"}], \"*\", \"10\"}]}], \"]\"}], ");
mfprintf(a," \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", \"0.8\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"0.8\", \"-\", \"x\"}], \")\"}], \"/\", \"0.2\"}], \")\"}], ");
mfprintf(a," \"^\", \"0.5\"}], \",\", \"0\"}], \"]\"}], \",\", ");
mfprintf(a," RowBox[{\"If\", \"[\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"x\", \"<\", \"1\"}], \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", \"0\", \",\", ");
mfprintf(a," RowBox[{");
mfprintf(a," RowBox[{\"(\", ");
mfprintf(a," RowBox[{\"x\", \"-\", \"0.9\"}], \")\"}], \"*\", \"10\"}]}], \"]\"}], ");
mfprintf(a," \",\", ");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", ");
mfprintf(a," RowBox[{\"1\", \",\", \"0\", \",\", \"1\"}], \"]\"}]}], \"]\"}]}], ");
mfprintf(a," \"]\"}]}], \"]\"}]}], \"]\"}]}], \"]\"}]}], \"]\"}]}], \"]\"}]}]}], ");
mfprintf(a," \"]\"}]}], \"]\"}]}], \"]\"}], \";\", \"\\[IndentingNewLine]\", ");
mfprintf(a," \"\\[IndentingNewLine]\", ");
mfprintf(a," RowBox[{\"oplotrangeX1\", \"=\", \"%f\"}], \";\", \"\\[IndentingNewLine]\", \n",m_fMinVal[0]);
mfprintf(a," RowBox[{\"oplotrangeY1\", \"=\", \"%f\"}], \";\", \"\\[IndentingNewLine]\", \n",m_fMinVal[1]);
mfprintf(a," RowBox[{\"oplotrangeX2\", \"=\", \"%f\"}], \";\", \"\\[IndentingNewLine]\", \n",m_fMaxVal[0]);
mfprintf(a," RowBox[{\"oplotrangeY2\", \"=\", \"%f\"}], \";\", \"\\[IndentingNewLine]\", \n",m_fMaxVal[1]);
mfprintf(a," RowBox[{\"oplotresX\", \"=\", \"%d\"}], \";\", \"\\[IndentingNewLine]\", \n",m_iRes[0]);
mfprintf(a," RowBox[{\"oplotresY\", \"=\", \"%d\"}], \";\", \"\\[IndentingNewLine]\", \n",m_iRes[1]);
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"=\", \n");
mfprintf(a," RowBox[{\"Ceiling\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotrangeX2\", \"-\", \"plotrangeX1\"}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"oplotrangeX2\", \"-\", \"oplotrangeX1\"}], \")\"}]}], \"*\", \n");
mfprintf(a," \"oplotresX\"}], \"]\"}]}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"plotresY\", \"=\", \n");
mfprintf(a," RowBox[{\"Ceiling\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotrangeY2\", \"-\", \"plotrangeY1\"}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"oplotrangeY2\", \"-\", \"oplotrangeY1\"}], \")\"}]}], \"*\", \n");
mfprintf(a," \"oplotresY\"}], \"]\"}]}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"plotresIndX\", \"=\", \n");
mfprintf(a," RowBox[{\"Ceiling\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotrangeX1\", \"-\", \"oplotrangeX1\"}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"oplotrangeX2\", \"-\", \"oplotrangeX1\"}], \")\"}]}], \"*\", \n");
mfprintf(a," \"oplotresX\"}], \"]\"}]}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"plotresIndY\", \"=\", \n");
mfprintf(a," RowBox[{\"Ceiling\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotrangeY1\", \"-\", \"oplotrangeY1\"}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"oplotrangeY2\", \"-\", \"oplotrangeY1\"}], \")\"}]}], \"*\", \n");
mfprintf(a," \"oplotresY\"}], \"]\"}]}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"Smoothen\", \" \", \"Data\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"dat\", \"=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ox\", \"=\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"plotresX\"}], \"]\"}], \"+\", \"plotresIndX\"}]}], \n");
mfprintf(a," \";\", \n");
mfprintf(a," RowBox[{\"oy\", \"=\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Quotient\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"plotresX\"}], \"]\"}], \"+\", \"plotresIndY\"}]}], \n");
mfprintf(a," \";\", \n");
mfprintf(a," RowBox[{\"x\", \"=\", \n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"plotresX\"}], \"]\"}]}], \";\", \n");
mfprintf(a," RowBox[{\"y\", \"=\", \n");
mfprintf(a," RowBox[{\"Quotient\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"plotresX\"}], \"]\"}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotrangeX1\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotrangeX2\", \"-\", \"plotrangeX1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"x\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"-\", \"1\"}], \")\"}]}]}]}], \",\", \n");
mfprintf(a," RowBox[{\"plotrangeY1\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotrangeY2\", \"-\", \"plotrangeY1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"y\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"plotresY\", \"-\", \"1\"}], \")\"}]}]}]}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"s\", \"=\", \"0\"}], \";\", \n");
mfprintf(a," RowBox[{\"t\", \"=\", \"0\"}], \";\", \n");
mfprintf(a," RowBox[{\"For\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ty\", \"=\", \n");
mfprintf(a," RowBox[{\"-\", \"smoothgrade\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ty\", \"\\[LessEqual]\", \"smoothgrade\"}], \",\", \n");
mfprintf(a," RowBox[{\"ty\", \"++\"}], \",\", \n");
mfprintf(a," RowBox[{\"For\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tx\", \"=\", \n");
mfprintf(a," RowBox[{\"-\", \"smoothgrade\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"tx\", \"\\[LessEqual]\", \"smoothgrade\"}], \",\", \n");
mfprintf(a," RowBox[{\"tx\", \"++\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tx\", \"^\", \"2\"}], \"+\", \n");
mfprintf(a," RowBox[{\"ty\", \"^\", \"2\"}]}], \"\\[LessEqual]\", \n");
mfprintf(a," RowBox[{\"smoothgrade\", \"^\", \"2\"}]}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"r\", \"=\", \n");
mfprintf(a," RowBox[{\"1\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tx\", \"^\", \"2\"}], \"+\", \n");
mfprintf(a," RowBox[{\"ty\", \"^\", \"2\"}], \"+\", \"1\"}], \")\"}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"t\", \"+=\", \"r\"}], \";\", \n");
mfprintf(a," RowBox[{\"s\", \"+=\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat2\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Max\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Min\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ox\", \"+\", \"tx\"}], \",\", \n");
mfprintf(a," RowBox[{\"oplotresX\", \"-\", \"1\"}]}], \"]\"}], \",\", \"0\"}], \n");
mfprintf(a," \"]\"}], \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Max\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Min\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"oy\", \"+\", \"ty\"}], \",\", \n");
mfprintf(a," RowBox[{\"oplotresY\", \"-\", \"1\"}]}], \"]\"}], \",\", \"0\"}], \n");
mfprintf(a," \"]\"}], \"*\", \"oplotresX\"}], \"+\", \"1\"}], \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"*\", \"r\"}]}]}], \",\"}], \n");
mfprintf(a," \"]\"}]}], \"]\"}]}], \"]\"}], \";\", \n");
mfprintf(a," RowBox[{\"s\", \"/\", \"t\"}]}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotresX\", \"*\", \"plotresY\"}], \"-\", \"1\"}]}], \"}\"}]}], \n");
mfprintf(a," \"]\"}]}], \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Add\", \" \", \"Functions\", \" \", \"to\", \" \", \"primitive\", \" \", \"list\"}], \n");
mfprintf(a," \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"For\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"=\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"i\", \"<=\", \n");
mfprintf(a," RowBox[{\"Length\", \"[\", \"funcX\", \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"i\", \"++\"}], \",\", \n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"prim\", \",\", \n");
mfprintf(a," RowBox[{\"ListLinePlot\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"x\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcX\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}]}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"x\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcX\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcX\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcX\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"-\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcX\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}]}], \")\"}], \"/\", \"1000\"}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"PlotStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Evaluate\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcX\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}]}]}], \"]\"}]}], \"]\"}]}], \n");
mfprintf(a," \"]\"}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"For\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"=\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"i\", \"<=\", \n");
mfprintf(a," RowBox[{\"Length\", \"[\", \"funcY\", \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"i\", \"++\"}], \",\", \n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"prim\", \",\", \n");
mfprintf(a," RowBox[{\"ListLinePlot\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcY\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}], \",\", \"y\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"y\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcY\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcY\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcY\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"-\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcY\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}]}], \")\"}], \"/\", \"1000\"}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"PlotStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Evaluate\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"funcY\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}]}]}], \"]\"}]}], \"]\"}]}], \n");
mfprintf(a," \"]\"}], \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tfx\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminX\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksX\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxX\", \"-\", \"tickminX\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksX\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"ticklabelprefixX\", \"<>\", \n");
mfprintf(a," RowBox[{\"ToString\", \"[\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecX\", \"\\[Equal]\", \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"Round\", \"[\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \"1\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"PaddedForm\", \"[\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"20\", \",\", \"tickprecX\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"NumberPadding\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"\\\"\\<\\>\\\"\", \",\", \"\\\"\\<0\\>\\\"\"}], \"}\"}]}]}], \n");
mfprintf(a," \"]\"}]}], \"]\"}], \"]\"}], \"<>\", \"ticklabelsuffixX\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksX\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \"majortickshift\"}]}], \"}\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \"minortickshift\"}]}], \"}\"}]}],\n");
mfprintf(a," \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksX\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tfxnolabel\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminX\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksX\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxX\", \"-\", \"tickminX\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \"\\\"\\<\\>\\\"\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksX\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \"majortickshift\"}]}], \"}\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \"minortickshift\"}]}], \"}\"}]}],\n");
mfprintf(a," \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksX\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tfy\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminY\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksY\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxY\", \"-\", \"tickminY\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksY\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"ticklabelprefixY\", \"<>\", \n");
mfprintf(a," RowBox[{\"ToString\", \"[\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecY\", \"\\[Equal]\", \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"Round\", \"[\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \"1\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"PaddedForm\", \"[\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"20\", \",\", \"tickprecY\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"NumberPadding\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"\\\"\\<\\>\\\"\", \",\", \"\\\"\\<0\\>\\\"\"}], \"}\"}]}]}], \n");
mfprintf(a," \"]\"}]}], \"]\"}], \"]\"}], \"<>\", \"ticklabelsuffixY\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksY\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \"majortickshift\"}]}], \"}\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \"minortickshift\"}]}], \"}\"}]}],\n");
mfprintf(a," \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksY\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tfynolabel\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminY\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksY\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxY\", \"-\", \"tickminY\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \"\\\"\\<\\>\\\"\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksY\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \"majortickshift\"}]}], \"}\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \"minortickshift\"}]}], \"}\"}]}],\n");
mfprintf(a," \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksY\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tfz\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminZ\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksZ\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksZ\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxZ\", \"-\", \"tickminZ\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksZ\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"ticklabelprefixZ\", \"<>\", \n");
mfprintf(a," RowBox[{\"ToString\", \"[\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecZ\", \"\\[Equal]\", \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"Round\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"^\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"/\", \"exp\"}], \")\"}]}], \",\", \"1\"}], \"]\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"PaddedForm\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"^\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"/\", \"exp\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"20\", \",\", \"tickprecZ\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"NumberPadding\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"\\\"\\<\\>\\\"\", \",\", \"\\\"\\<0\\>\\\"\"}], \"}\"}]}]}], \n");
mfprintf(a," \"]\"}]}], \"]\"}], \"]\"}], \"<>\", \"ticklabelsuffixZ\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksZ\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \"majortickshift\"}]}], \"}\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \"minortickshift\"}]}], \"}\"}]}],\n");
mfprintf(a," \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksZ\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksZ\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tfznolabel\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminZ\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksZ\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksZ\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxZ\", \"-\", \"tickminZ\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \"\\\"\\<\\>\\\"\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksZ\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklength\", \"*\", \"majortickshift\"}]}], \"}\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshift\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklength\", \"*\", \"minortickshift\"}]}], \"}\"}]}],\n");
mfprintf(a," \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksZ\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksZ\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tfl\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminL\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksL\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksL\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxL\", \"-\", \"tickminL\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksL\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"ToString\", \"[\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecL\", \"\\[Equal]\", \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"Round\", \"[\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \"1\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"PaddedForm\", \"[\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"20\", \",\", \"tickprecL\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"NumberPadding\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"\\\"\\<\\>\\\"\", \",\", \"\\\"\\<0\\>\\\"\"}], \"}\"}]}]}], \n");
mfprintf(a," \"]\"}]}], \"]\"}], \"]\"}], \",\", \"\\\"\\<\\>\\\"\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksL\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklengthL\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshiftL\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklengthL\", \"*\", \"majortickshiftL\"}]}], \"}\"}],\n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklengthL\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshiftL\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklengthL\", \"*\", \"minortickshiftL\"}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksL\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksL\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"tflnolabel\", \":=\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i2\", \"=\", \n");
mfprintf(a," RowBox[{\"tickminL\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksL\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksL\", \"+\", \"1\"}], \")\"}]}], \")\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"tickmaxL\", \"-\", \"tickminL\"}], \")\"}]}]}]}], \";\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i2\", \",\", \"\\\"\\<\\>\\\"\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mod\", \"[\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \n");
mfprintf(a," RowBox[{\"minorticksL\", \"+\", \"1\"}]}], \"]\"}], \"\\[Equal]\", \n");
mfprintf(a," \"0\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklengthL\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"majortickshiftL\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticklengthL\", \"*\", \"majortickshiftL\"}]}], \"}\"}],\n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklengthL\", \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"-\", \"minortickshiftL\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"minorticklengthL\", \"*\", \"minortickshiftL\"}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"0\", \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksL\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"minorticksL\", \"+\", \"1\"}], \")\"}]}]}], \"}\"}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"Create\", \" \", \"Contour\", \" \", \"Plot\"}], \" \", \"*)\"}], \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"datmin\", \"=\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," \"mincolorvalue\", \",\", \n");
mfprintf(a," RowBox[{\"Min\", \"[\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"1\", \",\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"*\", \"plotresY\"}]}], \"}\"}]}], \"]\"}], \n");
mfprintf(a," \"]\"}]}], \"]\"}]}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"datminexp\", \"=\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \n");
mfprintf(a," RowBox[{\"mincolorvalue\", \"^\", \"exp\"}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"datmin\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \n");
mfprintf(a," RowBox[{\"datmin\", \"^\", \"exp\"}], \"]\"}]}]}], \"]\"}]}], \";\", \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"datmax\", \"=\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," \"maxcolorvalue\", \",\", \n");
mfprintf(a," RowBox[{\"Max\", \"[\", \n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"1\", \",\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"*\", \"plotresY\"}]}], \"}\"}]}], \"]\"}], \n");
mfprintf(a," \"]\"}]}], \"]\"}]}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"=\",\n");
mfprintf(a," RowBox[{\"If\", \"[\",\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"maxcolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"maxcolorvalue\", \"]\"}], \"^\", \"exp\"}]}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"datmax\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datmax\", \"]\"}], \"^\", \"exp\"}]}]}], \"]\"}]}], \n");
mfprintf(a," \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"coloring\", \"\\[Equal]\", \"4\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datmin\", \"]\"}], \">\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datmax\", \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"datmax\", \"=\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datmin\", \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"datmin\", \"=\", \n");
mfprintf(a," RowBox[{\"-\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datmax\", \"]\"}]}]}]}], \"]\"}], \";\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datminexp\", \"]\"}], \">\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datmaxexp\", \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"=\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datminexp\", \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"datminexp\", \"=\", \n");
mfprintf(a," RowBox[{\"-\", \n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"datmaxexp\", \"]\"}]}]}]}], \"]\"}]}], \",\"}], \n");
mfprintf(a," \"]\"}], \";\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\",\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plottype\", \"\\[Equal]\", \"1\"}], \",\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"Show\", \"[\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ListContourPlot\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"^\", \"exp\"}]}]}], \n");
mfprintf(a," \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"1\", \",\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"*\", \"plotresY\"}]}], \"}\"}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"PlotRange\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datminexp\", \",\", \"datmaxexp\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunction\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Function\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \"z\", \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \"+\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"-\", \n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"datminexp\"}]}], \"]\"}]}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"maxcolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"maxcolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \"-\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}]}], \",\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"-\", \"datminexp\"}]}], \"]\"}], \"/\", \n");
mfprintf(a," \"colorscale\"}], \")\"}]}], \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunctionScaling\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"Contours\", \"\\[Rule]\", \"contours\"}], \",\", \n");
mfprintf(a," RowBox[{\"PlotRangePadding\", \"\\[Rule]\", \"framemargins\"}], \",\", \n");
mfprintf(a," RowBox[{\"FrameStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"framethickness\", \"]\"}], \"]\"}]}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"FrameTicks\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfy\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"ticksbothsidesY\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"labelsbothsidesY\", \"]\"}], \",\", \n");
mfprintf(a," \"tfy\", \",\", \"tfynolabel\"}], \"]\"}], \",\", \"None\"}], \"]\"}]}],\n");
mfprintf(a," \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfx\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"ticksbothsidesX\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"labelsbothsidesX\", \"]\"}], \",\", \n");
mfprintf(a," \"tfx\", \",\", \"tfxnolabel\"}], \"]\"}], \",\", \"None\"}], \"]\"}]}],\n");
mfprintf(a," \"}\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"FrameLabel\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"xlabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"ylabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ContourLabels\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"usecontourlabels\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Text\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"#3\", \"^\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"1\", \"/\", \"exp\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"FontFamily\", \"\\[Rule]\", \"\\\"\\\\\"\"}], \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"contourlabelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"#1\", \",\", \"#2\"}], \"}\"}]}], \"]\"}], \"&\"}], \")\"}], \n");
mfprintf(a," \",\", \"None\"}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"InterpolationOrder\", \"\\[Rule]\", \"interpolationorder\"}],\n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"ContourStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"contourthickness\", \"]\"}], \",\", \n");
mfprintf(a," \"contourcolor\", \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"contouropacity\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Dashing\", \"[\", \"contourdash\", \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"LabelStyle\", \"\\[Rule]\", \n"); /*********************************************/
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"FontFamily\", \"\\[Rule]\", \"\\\"\\\\\"\"}], \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"ticklabelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"AspectRatio\", \"\\[Rule]\", \"aspectratio\"}], \",\", \n");
mfprintf(a," RowBox[{\"ImageSize\", \"\\[Rule]\", \"plotpixels\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"drawmesh\", \"\\[Equal]\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mesh\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"2\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," \"minorticksX\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"2\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," \"minorticksY\"}]}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"MeshFunctions\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"#1\", \"&\"}], \",\", \n");
mfprintf(a," RowBox[{\"#2\", \"&\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"MeshStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"meshthicknessX\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"meshopacityX\", \"]\"}], \",\", \n");
mfprintf(a," \"meshcolorX\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"meshthicknessY\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"meshopacityY\", \"]\"}], \",\", \n");
mfprintf(a," \"meshcolorY\"}], \"]\"}]}], \"}\"}]}]}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"Mesh\", \"\\[Rule]\", \"None\"}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"PerformanceGoal\", \"\\[Rule]\", \"\\\"\\\\\"\"}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}], \",\", \"\\[IndentingNewLine]\", \"prim\"}], \"]\"}], \",\",\n");
mfprintf(a," \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plottype\", \"\\[Equal]\", \"2\"}], \",\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"Show\", \"[\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ListDensityPlot\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"^\", \"exp\"}]}]}], \n");
mfprintf(a," \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"1\", \",\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"*\", \"plotresY\"}]}], \"}\"}]}], \"]\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"PlotRange\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datminexp\", \",\", \"datmaxexp\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunction\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Function\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \"z\", \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \"+\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"-\", \n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"datminexp\"}]}], \"]\"}]}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"maxcolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"maxcolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \"-\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}]}], \",\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"-\", \"datminexp\"}]}], \"]\"}], \"/\", \n");
mfprintf(a," \"colorscale\"}], \")\"}]}], \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunctionScaling\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"PlotRangePadding\", \"\\[Rule]\", \"framemargins\"}], \",\", \n");
mfprintf(a," RowBox[{\"FrameStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"framethickness\", \"]\"}], \"]\"}]}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"FrameTicks\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfy\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"ticksbothsidesY\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"labelsbothsidesY\", \"]\"}], \",\", \n");
mfprintf(a," \"tfy\", \",\", \"tfynolabel\"}], \"]\"}], \",\", \"None\"}], \"]\"}]}],\n");
mfprintf(a," \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfx\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"ticksbothsidesX\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"labelsbothsidesX\", \"]\"}], \",\", \n");
mfprintf(a," \"tfx\", \",\", \"tfxnolabel\"}], \"]\"}], \",\", \"None\"}], \"]\"}]}],\n");
mfprintf(a," \"}\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"FrameLabel\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"xlabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"ylabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"InterpolationOrder\", \"\\[Rule]\", \"interpolationorder\"}], \",\", \n");
mfprintf(a," RowBox[{\"LabelStyle\", \"\\[Rule]\", \n"); /*********************************************/
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"FontFamily\", \"\\[Rule]\", \"\\\"\\\\\"\"}], \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"ticklabelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"AspectRatio\", \"\\[Rule]\", \"aspectratio\"}], \",\", \n");
mfprintf(a," RowBox[{\"ImageSize\", \"\\[Rule]\", \"plotpixels\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"drawmesh\", \"\\[Equal]\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Mesh\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"2\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksX\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," \"minorticksX\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"2\", \"+\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"majorticksY\", \"-\", \"1\"}], \")\"}], \"*\", \n");
mfprintf(a," \"minorticksY\"}]}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"MeshFunctions\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"#1\", \"&\"}], \",\", \n");
mfprintf(a," RowBox[{\"#2\", \"&\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"MeshStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"meshthicknessX\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"meshopacityX\", \"]\"}], \",\", \n");
mfprintf(a," \"meshcolorX\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"meshthicknessY\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"meshopacityY\", \"]\"}], \",\", \n");
mfprintf(a," \"meshcolorY\"}], \"]\"}]}], \"}\"}]}]}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"Mesh\", \"\\[Rule]\", \"None\"}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"PerformanceGoal\", \"\\[Rule]\", \"\\\"\\\\\"\"}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}], \",\", \"\\[IndentingNewLine]\", \"prim\"}], \"]\"}], \n");
mfprintf(a," \",\", \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plottype\", \"\\[Equal]\", \"3\"}], \",\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"ReliefPlot\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"*\", \"plotresX\"}], \"+\", \"j\"}], \"]\"}], \"]\"}], \n");
mfprintf(a," \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"i\", \"*\", \"plotresX\"}], \"+\", \"j\"}], \"]\"}], \"]\"}], \n");
mfprintf(a," \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"^\", \"exp\"}]}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"1\", \",\", \n");
mfprintf(a," RowBox[{\"plotresY\", \"-\", \"1\"}]}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"j\", \",\", \"1\", \",\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"-\", \"1\"}]}], \"}\"}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"PlotRange\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datminexp\", \",\", \"datmaxexp\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunction\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Function\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \"z\", \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \"+\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"-\", \n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"datminexp\"}]}], \"]\"}]}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"maxcolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"maxcolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \"-\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}]}], \",\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"-\", \"datminexp\"}]}], \"]\"}], \"/\", \n");
mfprintf(a," \"colorscale\"}], \")\"}]}], \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunctionScaling\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"PlotRangePadding\", \"\\[Rule]\", \"framemargins\"}], \",\", \n");
mfprintf(a," RowBox[{\"FrameStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"framethickness\", \"]\"}], \"]\"}]}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"FrameTicks\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfy\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"ticksbothsidesY\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"labelsbothsidesY\", \"]\"}], \",\", \n");
mfprintf(a," \"tfy\", \",\", \"tfynolabel\"}], \"]\"}], \",\", \"None\"}], \"]\"}]}],\n");
mfprintf(a," \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfx\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"ticksbothsidesX\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"labelsbothsidesX\", \"]\"}], \",\", \n");
mfprintf(a," \"tfx\", \",\", \"tfxnolabel\"}], \"]\"}], \",\", \"None\"}], \"]\"}]}],\n");
mfprintf(a," \"}\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"FrameLabel\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"xlabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"ylabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"AspectRatio\", \"\\[Rule]\", \"aspectratio\"}], \",\", \n");
mfprintf(a," RowBox[{\"ImageSize\", \"\\[Rule]\", \"plotpixels\"}], \",\", \n");
mfprintf(a," RowBox[{\"DataRange\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"plotrangeX1\", \",\", \"plotrangeX2\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"plotrangeY1\", \",\", \"plotrangeY2\"}], \"}\"}]}], \n");
mfprintf(a," \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"LabelStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"FontFamily\", \"\\[Rule]\", \"\\\"\\\\\"\"}], \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"ticklabelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"}\"}]}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}], \",\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plottype\", \"\\[Equal]\", \"4\"}], \",\", \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"ListPlot3D\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Table\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"1\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"2\", \"]\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"dat\", \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"i\", \"]\"}], \"]\"}], \"[\", \n");
mfprintf(a," RowBox[{\"[\", \"3\", \"]\"}], \"]\"}], \"]\"}], \"^\", \"exp\"}]}]}], \n");
mfprintf(a," \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"i\", \",\", \"1\", \",\", \n");
mfprintf(a," RowBox[{\"plotresX\", \"*\", \"plotresY\"}]}], \"}\"}]}], \"]\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"PlotRange\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datminexp\", \",\", \"datmaxexp\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunction\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Function\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"x\", \",\", \"y\", \",\", \"z\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \"+\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"-\", \n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}]}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"datminexp\"}]}], \"]\"}]}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"maxcolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"maxcolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}], \"-\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"mincolorvalue\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"mincolorvalue\", \"]\"}], \"^\", \n");
mfprintf(a," \"exp\"}]}]}], \",\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"-\", \"datminexp\"}]}], \"]\"}], \"/\", \n");
mfprintf(a," \"colorscale\"}], \")\"}]}], \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunctionScaling\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"PlotRangePadding\", \"\\[Rule]\", \"framemargins\"}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"InterpolationOrder\", \"\\[Rule]\", \"2\"}], \",\", \n");
mfprintf(a," RowBox[{\"AspectRatio\", \"\\[Rule]\", \"aspectratio\"}], \",\", \n");
mfprintf(a," RowBox[{\"ImageSize\", \"\\[Rule]\", \"plotpixels\"}], \",\", \n");
mfprintf(a," RowBox[{\"Mesh\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"gridxcount\", \",\", \"gridycount\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"MeshStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"gridxthickness\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"gridxopacity\", \"]\"}], \",\", \n");
mfprintf(a," \"gridxcolor\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"gridythickness\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"gridyopacity\", \"]\"}], \",\", \n");
mfprintf(a," \"gridycolor\"}], \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"Boxed\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"boxed\", \"]\"}], \",\", \"True\", \",\", \n");
mfprintf(a," \"False\"}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"BoxStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\"boxcolor\", \",\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"boxthickness\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"boxopacity\", \"]\"}]}], \"]\"}]}], \n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"Ticks\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfx\", \",\", \"tfy\", \",\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"labelsz\", \"]\"}], \",\", \"tfz\", \",\", \n");
mfprintf(a," \"tfznolabel\"}], \"]\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"TicksStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"axesthickness\", \"]\"}], \"]\"}]}],\n");
mfprintf(a," \",\", \n");
mfprintf(a," RowBox[{\"AxesStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"axesthickness\", \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"AxesEdge\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"xaxisposition\", \",\", \"yaxisposition\", \",\", \n");
mfprintf(a," \"zaxisposition\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"AxesLabel\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"xlabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"ylabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"zlabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}]}], \n");
mfprintf(a," \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"LabelStyle\", \"\\[Rule]\", \n"); /*********************************************/
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"FontFamily\", \"\\[Rule]\", \"\\\"\\\\\"\"}], \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"ticklabelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"}\"}]}]}], \n");
mfprintf(a," \"}\"}]}], \"]\"}], \"\\[IndentingNewLine]\", \",\"}], \"]\"}]}], \n");
mfprintf(a," \"]\"}]}], \"]\"}]}], \"]\"}]}], \"\\[IndentingNewLine]\", \")\"}]}], \";\"}], \n");
mfprintf(a," \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"Create\", \" \", \"Legend\"}], \" \", \"*)\"}]}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotlegend\", \":=\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"x\", \"=.\"}], \";\", \n");
mfprintf(a," RowBox[{\"y\", \"=.\"}], \";\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plottype\", \">\", \"1\"}], \",\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"DensityPlot\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"explegend\", \"==\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"x\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}], \"^\", \"exp\"}]}], \",\", \"x\"}], \n");
mfprintf(a," \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"x\", \",\", \"datmin\", \",\", \"datmax\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"y\", \",\", \"0\", \",\", \"1\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"PlotRange\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"explegend\", \"==\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datminexp\", \",\", \"datmaxexp\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datmin\", \",\", \"datmax\"}], \"}\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunction\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Function\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \"z\", \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"explegend\", \"==\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \" \", \"-\", \"datminexp\"}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"-\", \"datminexp\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \"+\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"mincolorvalue\"}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"datmin\"}]}], \"]\"}]}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"maxcolorvalue\", \"-\", \"mincolorvalue\"}], \",\", \n");
mfprintf(a," RowBox[{\"datmax\", \"-\", \"datmin\"}]}], \"]\"}]}]}], \"]\"}], \n");
mfprintf(a," \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunctionScaling\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"Axes\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"Frame\", \"\\[Rule]\", \"True\"}], \",\", \n");
mfprintf(a," RowBox[{\"FrameStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"framethickness\", \"]\"}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"FrameTicks\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"None\", \",\", \"None\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfl\", \",\", \"None\"}], \"}\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"PlotRangePadding\", \"\\[Rule]\", \"None\"}], \",\", \n");
mfprintf(a," RowBox[{\"FrameLabel\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"zlabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\", \",\", \"\\\"\\<\\>\\\"\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"LabelStyle\", \"\\[Rule]\", \n"); /*********************************************/
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"FontFamily\", \"\\[Rule]\", \"\\\"\\\\\"\"}], \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"ticklabelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"AspectRatio\", \"\\[Rule]\", \"0.04\"}], \",\", \n");
mfprintf(a," RowBox[{\"ImageSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"*\", \n");
mfprintf(a," RowBox[{\"7\", \"/\", \"8\"}]}]}], \",\", \n");
mfprintf(a," RowBox[{\"PlotPoints\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"2000\", \",\", \"2\"}], \"}\"}]}]}], \"}\"}]}], \"]\"}], \",\", \n");
mfprintf(a," \"\\[IndentingNewLine]\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"ContourPlot\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"explegend\", \"==\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sign\", \"[\", \"x\", \"]\"}], \"*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Abs\", \"[\", \"x\", \"]\"}], \"^\", \"exp\"}]}], \",\", \"x\"}], \n");
mfprintf(a," \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"x\", \",\", \"datmin\", \",\", \"datmax\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"y\", \",\", \"0\", \",\", \"1\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"PlotRange\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"explegend\", \"==\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datminexp\", \",\", \"datmaxexp\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"datmin\", \",\", \"datmax\"}], \"}\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunction\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Function\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \"z\", \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"ColFunc\", \"[\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"explegend\", \"==\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \" \", \"-\", \"datminexp\"}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \"-\", \"datminexp\"}], \")\"}]}], \",\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"z\", \"+\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"mincolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"mincolorvalue\"}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"datmin\"}]}], \"]\"}]}], \")\"}], \"/\", \n");
mfprintf(a," RowBox[{\"If\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ValueQ\", \"[\", \"maxcolorvalue\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"maxcolorvalue\", \"-\", \"mincolorvalue\"}], \",\", \n");
mfprintf(a," RowBox[{\"datmax\", \"-\", \"datmin\"}]}], \"]\"}]}]}], \"]\"}], \n");
mfprintf(a," \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"ColorFunctionScaling\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"Axes\", \"\\[Rule]\", \"False\"}], \",\", \n");
mfprintf(a," RowBox[{\"Frame\", \"\\[Rule]\", \"True\"}], \",\", \n");
mfprintf(a," RowBox[{\"FrameStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"framethickness\", \"]\"}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"Contours\", \"\\[Rule]\", \"contours\"}], \",\", \n");
mfprintf(a," RowBox[{\"FrameTicks\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"None\", \",\", \"None\"}], \"}\"}], \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"tfl\", \",\", \"None\"}], \"}\"}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"PlotRangePadding\", \"\\[Rule]\", \"None\"}], \",\", \n");
mfprintf(a," RowBox[{\"ContourStyle\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"Directive\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"contourthickness\", \"]\"}], \",\", \n");
mfprintf(a," \"contourcolor\", \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"contouropacity\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Dashing\", \"[\", \"contourdash\", \"]\"}]}], \"]\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"FrameLabel\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Style\", \"[\", \n");
mfprintf(a," RowBox[{\"zlabel\", \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"labelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"]\"}], \",\", \n");
mfprintf(a," \"\\\"\\<\\>\\\"\", \",\", \"\\\"\\<\\>\\\"\"}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"LabelStyle\", \"\\[Rule]\", \n"); /*********************************************/
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"FontFamily\", \"\\[Rule]\", \"\\\"\\\\\"\"}], \",\", \n");
mfprintf(a," RowBox[{\"FontSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"ticklabelsize\", \"*\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"/\", \"800\"}]}]}]}], \"}\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"AspectRatio\", \"\\[Rule]\", \"0.04\"}], \",\", \n");
mfprintf(a," RowBox[{\"ImageSize\", \"\\[Rule]\", \n");
mfprintf(a," RowBox[{\"plotpixels\", \"*\", \n");
mfprintf(a," RowBox[{\"7\", \"/\", \"8\"}]}]}]}], \"}\"}]}], \"]\"}]}], \"]\"}]}], \n");
mfprintf(a," \")\"}]}], \";\"}]}], \"Input\" ]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Plotting Parameters\", \"Section\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell],\n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Misc. Properties\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = True}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Choose\", \" \", \"the\", \" \", \"plot\", \" \", \n");
mfprintf(a," RowBox[{\"type\", \".\", \" \", \"1\"}]}], \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"Contour\", \" \", \"Plot\"}]}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"2\", \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"Density\", \" \", \"Plot\"}]}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"3\", \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"Relief\", \" \", \"Plot\"}]}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"4\", \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"3\", \"D\", \" \", \"Plot\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plottype\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",m_iPlotType);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Choose\", \" \", \"the\", \" \", \"color\", \" \", \n");
mfprintf(a," RowBox[{\"scale\", \":\", \"1\"}]}], \"=\", \n");
mfprintf(a," RowBox[{\"Travis\", \" \", \"Scale\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"2\", \"=\", \n");
mfprintf(a," RowBox[{\"black\", \" \", \"and\", \" \", \"white\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"3\", \"=\", \n");
mfprintf(a," RowBox[{\"Temperature\", \" \", \"scale\"}]}], \",\", \n");
mfprintf(a," RowBox[{\"4\", \"=\", \n");
mfprintf(a," RowBox[{\"PlusMinus\", \" \", \"scale\"}]}]}], \" \", \"*)\"}], \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"coloring\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",m_iColorScale);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Choose\", \" \", \"the\", \" \", \"exponent\", \" \", \"your\", \" \", \"data\", \" \", \n");
mfprintf(a," \"will\", \" \", \"be\", \" \", \"processed\", \" \", \n");
mfprintf(a," RowBox[{\"with\", \".\", \" \", \"Try\"}], \" \", \"values\", \" \", \"between\", \" \", \n");
mfprintf(a," \"0.2\", \" \", \"and\", \" \", \"1.\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"exp\", \"=\", \"%.1f\"}], \";\"}]}]], \"Input\"],\n",m_fPlotExp);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Also\", \" \", \"scale\", \" \", \"the\", \" \", \"legend\", \" \", \"with\", \" \", \"the\", \n");
mfprintf(a," \" \", \"exponent\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"explegend\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",m_iExpLegend);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Choose\", \" \", \"the\", \" \", \"smoothing\", \" \", \"grade\", \" \", \"for\", \" \", \n");
mfprintf(a," \"your\", \" \", \n");
mfprintf(a," RowBox[{\"data\", \".\", \" \", \"The\"}], \" \", \"higher\", \" \", \"it\", \" \", \"is\"}],\n");
mfprintf(a," \",\", \" \", \n");
mfprintf(a," RowBox[{\"the\", \" \", \"longer\", \" \", \"it\", \" \", \n");
mfprintf(a," RowBox[{\"takes\", \".\", \" \", \"0\"}], \" \", \"means\", \" \", \"no\", \" \", \n");
mfprintf(a," RowBox[{\"smoothing\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"smoothgrade\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",m_iSmoothGrade);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"interpolation\", \" \", \"order\", \" \", \"mathematica\", \" \", \"uses\",\n");
mfprintf(a," \" \", \"between\", \" \", \"the\", \" \", \"data\", \" \", \n");
mfprintf(a," RowBox[{\"points\", \".\", \" \", \"0\"}], \" \", \"shows\", \" \", \"the\", \" \", \"data\", \n");
mfprintf(a," \" \", \"points\", \" \", \"like\", \" \", \"they\", \" \", \n");
mfprintf(a," RowBox[{\"are\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"interpolationorder\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",m_iInterpolationOrder);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"Choose\", \" \", \"the\", \" \", \"color\", \" \", \n");
mfprintf(a," RowBox[{\"scaling\", \".\", \" \", \"1\"}], \" \", \"means\", \" \", \"that\", \" \", \"the\",\n");
mfprintf(a," \" \", \"highest\", \" \", \"peak\", \" \", \"only\", \" \", \"gets\", \" \", \"the\", \" \", \n");
mfprintf(a," \"highest\", \" \", \n");
mfprintf(a," RowBox[{\"color\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"colorscale\", \"=\", \"1.0\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"width\", \" \", \"of\", \" \", \"the\", \" \", \"Plot\", \" \", \"in\", \" \", \n");
mfprintf(a," \"pixels\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotpixels\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",m_iPlotPixel);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"The\", \" \", \"aspect\", \" \", \"ratio\", \" \", \"of\", \" \", \"the\", \" \", \n");
mfprintf(a," RowBox[{\"plot\", \".\", \" \", \"1\"}], \" \", \"means\", \" \", \n");
mfprintf(a," RowBox[{\"quadratic\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"aspectratio\", \"=\", \"%f\"}], \";\"}]}]], \"Input\"],\n",m_fAspectRatio);
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Controls\", \" \", \"if\", \" \", \"a\", \" \", \"mesh\", \" \", \"is\", \" \", \"drawn\", \n");
mfprintf(a," \" \", \"across\", \" \", \"the\", \" \", \n");
mfprintf(a," RowBox[{\"plot\", \".\", \" \", \"1\"}]}], \"=\", \"enable\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0\", \"=\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"disable\", \".\", \" \", \"For\"}], \" \", \"mesh\", \" \", \"appearance\", \n");
mfprintf(a," \" \", \"see\", \" \", \"\\\"\\\\\"\"}], \" \", \"\\[Rule]\", \" \", \n");
mfprintf(a," \"\\\"\\\\\"\"}]}]}], \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"drawmesh\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"]\n",m_bDrawMesh?1:0);
mfprintf(a,"}, Open ]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Contour Properties\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Choose\", \" \", \"the\", \" \", \"number\", \" \", \"of\", \" \", \"contours\", \" \", \n");
mfprintf(a," \"that\", \" \", \"will\", \" \", \"be\", \" \", \"displayed\"}], \" \", \"*)\"}], \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"contours\", \"=\", \"%lu\"}], \";\"}]}]], \"Input\"],\n",m_iContourLines);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Print\", \" \", \"the\", \" \", \"height\", \" \", \"value\", \" \", \"onto\", \" \", \n");
mfprintf(a," \"each\", \" \", \"contour\", \" \", \n");
mfprintf(a," RowBox[{\"line\", \"?\", \" \", \"If\"}], \" \", \"desired\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"replace\", \" \", \"the\", \" \", \"dot\", \" \", \"by\", \" \", \n");
mfprintf(a," RowBox[{\"\\\"\\<1\\>\\\"\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"usecontourlabels\", \"=.\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"If\", \" \", \"contour\", \" \", \"labels\", \" \", \"are\", \" \", \n");
mfprintf(a," RowBox[{\"used\", \":\", \" \", \n");
mfprintf(a," RowBox[{\"The\", \" \", \"font\", \" \", \"size\", \" \", \"of\", \" \", \"these\", \" \", \n");
mfprintf(a," RowBox[{\"labels\", \".\"}]}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"contourlabelsize\", \"=\", \"10\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"thickness\", \" \", \"of\", \" \", \"the\", \" \", \"contour\", \" \", \n");
mfprintf(a," \"lines\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"relative\", \" \", \"to\", \" \", \"the\", \" \", \"overall\", \" \", \"plot\", \" \", \n");
mfprintf(a," \"width\"}], \")\"}], \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"contourthickness\", \"=\", \"0.001\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"The\", \" \", \"color\", \" \", \"of\", \" \", \"the\", \" \", \"contour\", \" \", \n");
mfprintf(a," RowBox[{\"lines\", \".\", \" \", \"Enter\"}], \" \", \"three\", \" \", \"values\", \" \", \n");
mfprintf(a," \"between\", \" \", \"0\", \" \", \"and\", \" \", \"1\", \" \", \"for\", \" \", \"red\"}], \",\",\n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"green\", \" \", \"and\", \" \", \"blue\", \" \", \"color\", \" \", \n");
mfprintf(a," RowBox[{\"component\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"contourcolor\", \"=\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"The\", \" \", \"opacity\", \" \", \"of\", \" \", \"the\", \" \", \"contour\", \" \", \n");
mfprintf(a," RowBox[{\"lines\", \".\", \" \", \"1\"}], \" \", \"means\", \" \", \"fully\", \" \", \n");
mfprintf(a," \"opaque\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0\", \" \", \"means\", \" \", \"totally\", \" \", \"transparent\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \"invisible\", \")\"}], \".\"}]}]}], \" \", \"*)\"}], \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"contouropacity\", \"=\", \"0.7\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"The\", \" \", \"pattern\", \" \", \"of\", \" \", \"the\", \" \", \"contour\", \" \", \n");
mfprintf(a," RowBox[{\"lines\", \".\", \" \", \"Large\"}], \" \", \"values\", \" \", \"like\", \" \", \n");
mfprintf(a," \"1000\", \" \", \"mean\", \" \", \"no\", \" \", \n");
mfprintf(a," RowBox[{\"dashing\", \".\", \" \", \"e\", \".\", \"g\", \".\", \" \", \"0.01\"}], \" \", \n");
mfprintf(a," \"results\", \" \", \"in\", \" \", \"dashed\", \" \", \n");
mfprintf(a," RowBox[{\"lines\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"contourdash\", \"=\", \"1000\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"3D Plot Properties\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Draw\", \" \", \"Tick\", \" \", \"labels\", \" \", \"on\", \" \", \"the\", \" \", \"Z\", \" \", \n");
mfprintf(a," \"axis\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"labelsz\", \"=\", \".\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Draw\", \" \", \"a\", \" \", \"rectangular\", \" \", \"box\", \" \", \"around\", \" \", \n");
mfprintf(a," \"the\", \" \", \"3\", \"D\", \" \", \"plot\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"boxed\", \"=\", \".\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"line\", \" \", \"width\", \" \", \"of\", \" \", \"this\", \" \", \"box\"}], \n");
mfprintf(a," \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"boxthickness\", \"=\", \"0.002\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"The\", \" \", \"color\", \" \", \"of\", \" \", \"this\", \" \", \"box\"}], \" \", \n");
mfprintf(a," \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"boxcolor\", \"=\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"The\", \" \", \"opacity\", \" \", \"of\", \" \", \"this\", \" \", \"box\"}], \" \", \n");
mfprintf(a," \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"boxopacity\", \"=\", \"1\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"May\", \" \", \"be\", \" \", \"either\", \" \", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"y\", \",\", \"z\"}], \"}\"}], \" \", \"with\", \" \", \"y\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"z\", \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"1\", \" \", \"/\", \" \", \n");
mfprintf(a," RowBox[{\"-\", \"1\"}]}]}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"or\", \" \", \"Automatic\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"or\", \" \", \"None\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"xaxisposition\", \"=\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"-\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"1\"}]}], \"}\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"May\", \" \", \"be\", \" \", \"either\", \" \", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"x\", \",\", \"z\"}], \"}\"}], \" \", \"with\", \" \", \"x\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"z\", \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"1\", \" \", \"/\", \" \", \n");
mfprintf(a," RowBox[{\"-\", \"1\"}]}]}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"or\", \" \", \"Automatic\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"or\", \" \", \"None\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"yaxisposition\", \"=\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"-\", \"1\"}], \",\", \n");
mfprintf(a," RowBox[{\"-\", \"1\"}]}], \"}\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"May\", \" \", \"be\", \" \", \"either\", \" \", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"x\", \",\", \"y\"}], \"}\"}], \" \", \"with\", \" \", \"x\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"y\", \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"1\", \" \", \"/\", \" \", \n");
mfprintf(a," RowBox[{\"-\", \"1\"}]}]}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"or\", \" \", \"Automatic\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"or\", \" \", \"None\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"zaxisposition\", \"=\", \"None\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"thickness\", \" \", \"of\", \" \", \"the\", \" \", \"axes\", \" \", \"and\", \n");
mfprintf(a," \" \", \"tick\", \" \", \"marks\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"axesthickness\", \"=\", \"0.005\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"label\", \" \", \"to\", \" \", \"plot\", \" \", \"on\", \" \", \"the\", \" \", \n");
mfprintf(a," \"Z\", \" \", \"axis\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
if (m_sLabelZ == NULL)
mfprintf(a," RowBox[{\"zlabel\", \"=\", \"\\\"\\\\\"\"}], \";\"}]}]], \"Input\"],\n");
else
mfprintf(a," RowBox[{\"zlabel\", \"=\", \"\\\"\\<%s\\>\\\"\"}], \";\"}]}]], \"Input\"],\n",m_sLabelZ);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"How\", \" \", \"many\", \" \", \"grid\", \" \", \"lines\", \" \", \"to\", \" \", \"draw\", \" \",\n");
mfprintf(a," \"in\", \" \", \"X\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridxcount\", \"=\", \"25\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Color\", \" \", \"for\", \" \", \"the\", \" \", \"grid\", \" \", \"lines\", \" \", \"in\", \" \",\n");
mfprintf(a," \"X\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridxcolor\", \"=\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Thickness\", \" \", \"of\", \" \", \"the\", \" \", \"grid\", \" \", \"lines\", \" \", \"in\", \n");
mfprintf(a," \" \", \"X\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridxthickness\", \"=\", \"0.001\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Opacity\", \" \", \"of\", \" \", \"the\", \" \", \"grid\", \" \", \"lines\", \" \", \"in\", \n");
mfprintf(a," \" \", \"X\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridxopacity\", \"=\", \"1\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"How\", \" \", \"many\", \" \", \"grid\", \" \", \"lines\", \" \", \"to\", \" \", \"draw\", \" \",\n");
mfprintf(a," \"in\", \" \", \"Y\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridycount\", \"=\", \"25\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Color\", \" \", \"for\", \" \", \"the\", \" \", \"grid\", \" \", \"lines\", \" \", \"in\", \" \",\n");
mfprintf(a," \"Y\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridycolor\", \"=\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Thickness\", \" \", \"of\", \" \", \"the\", \" \", \"grid\", \" \", \"lines\", \" \", \"in\", \n");
mfprintf(a," \" \", \"Y\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridythickness\", \"=\", \"0.001\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Opacity\", \" \", \"of\", \" \", \"the\", \" \", \"grid\", \" \", \"lines\", \" \", \"in\", \n");
mfprintf(a," \" \", \"Y\", \" \", \"direction\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"gridyopacity\", \"=\", \"1\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Plot Range\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\"(*\", \" \",\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Here\", \" \", \"you\", \" \", \"can\", \" \", \"\\\"\\\\\"\", \" \", \"into\", \" \", \n");
mfprintf(a," \"a\", \" \", \"specified\", \" \", \"area\", \" \", \"of\", \" \", \"your\", \" \", \n");
mfprintf(a," RowBox[{\"plot\", \".\", \" \", \"The\"}], \" \", \"range\", \" \", \"of\", \" \", \"your\", \n");
mfprintf(a," \" \", \"data\", \" \", \"was\", \" \", \"originally\", \" \", \"X1\"}], \"=\", \"%f\"}], \n",m_fMinVal[0]);
mfprintf(a," \",\", \" \", \n");
mfprintf(a," RowBox[{\"Y1\", \"=\", \"%f\"}], \",\", \" \", \n",m_fMinVal[1]);
mfprintf(a," RowBox[{\"X2\", \"=\", \"%f\"}], \",\", \" \", \n",m_fMaxVal[0]);
mfprintf(a," RowBox[{\"Y2\", \"=\", \"%f.\"}]}], \" \", \"*)\"}]], \"Input\"],\n",m_fMaxVal[1]);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotrangeX1\", \"=\", \"%f\"}], \";\"}]], \"Input\"],\n",m_fMinVal[0]);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotrangeY1\", \"=\", \"%f\"}], \";\"}]], \"Input\"],\n",m_fMinVal[1]);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotrangeX2\", \"=\", \"%f\"}], \";\"}]], \"Input\"],\n",m_fMaxVal[0]);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"plotrangeY2\", \"=\", \"%f\"}], \";\"}]], \"Input\"]\n",m_fMaxVal[1]);
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Manual Color/Contour Scale\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Enter\", \" \", \"a\", \" \", \"value\", \" \", \"here\", \" \", \"ONLY\", \" \", \"if\", \n");
mfprintf(a," \" \", \"you\", \" \", \"want\", \" \", \"to\", \" \", \"create\", \" \", \"different\", \n");
mfprintf(a," \" \", \"plots\", \" \", \"with\", \" \", \"the\", \" \", \"same\", \" \", \"color\", \" \", \n");
mfprintf(a," RowBox[{\"scale\", \".\", \"\\[IndentingNewLine]\", \"Then\"}], \" \", \"no\", \" \", \n");
mfprintf(a," \"rescaling\", \" \", \"for\", \" \", \"smoothened\", \" \", \"data\", \" \", \"will\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"occur\", \".\", \" \", \"Data\"}], \" \", \"for\", \" \", \"this\", \" \", \n");
mfprintf(a," RowBox[{\"plot\", \":\", \" \", \"maxcolorvalue\"}]}], \" \", \"=\", \" \", \n");
mfprintf(a," \"%f\"}], \";\", \" \", \n",m_fMaxEntry);
mfprintf(a," RowBox[{\"mincolorvalue\", \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"%c\", \"%f\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n",(m_fMinEntry<0)?'-':'+',m_fMinEntry);
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
if (manrange)
mfprintf(a," RowBox[{\"mincolorvalue\", \"=\", \"%f\"}], \";\"}], \"\\[IndentingNewLine]\", \n",0.0);
else
mfprintf(a," RowBox[{\"mincolorvalue\", \"=.\"}], \";\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
if (manrange)
mfprintf(a," RowBox[{\"maxcolorvalue\", \"=\", \"%f\"}], \";\"}]}]}]], \"Input\"],\n",m_fMaxEntry);
else
mfprintf(a," RowBox[{\"maxcolorvalue\", \"=.\"}], \";\"}]}]}]], \"Input\"]\n");
mfprintf(a,"\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Frame Thickness / Font Sizes\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Choose\", \" \", \"the\", \" \", \"font\", \" \", \"size\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"tick\", \" \", \"labels\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticklabelsize\", \"=\", \"28\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Choose\", \" \", \"the\", \" \", \"font\", \" \", \"size\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"axis\", \" \", \"labels\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"labelsize\", \"=\", \"32\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Choose\", \" \", \"the\", \" \", \"thickness\", \" \", \"of\", \" \", \"the\", \" \", \n");
mfprintf(a," \"frame\", \" \", \"and\", \" \", \"the\", \" \", \"axis\", \" \", \"ticks\"}], \" \", \"*)\"}],\n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"framethickness\", \"=\", \"0.005\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Define\", \" \", \"if\", \" \", \"space\", \" \", \"should\", \" \", \"be\", \" \", \"left\", \n");
mfprintf(a," \" \", \"between\", \" \", \"the\", \" \", \"plot\", \" \", \"and\", \" \", \"the\", \" \", \n");
mfprintf(a," RowBox[{\"axes\", \".\", \" \", \"Set\"}], \" \", \"this\", \" \", \"to\", \" \", \n");
mfprintf(a," \"\\\"\\\\\"\", \" \", \"or\", \" \", \"to\", \" \", \n");
mfprintf(a," RowBox[{\"\\\"\\<0\\>\\\"\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"framemargins\", \"=\", \"0\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Axis Properties\", \"Section\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"General Properties\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"length\", \" \", \"of\", \" \", \"the\", \" \", \"major\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \"on\", \" \", \"the\", \" \", \n");
mfprintf(a," RowBox[{\"axes\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklength\", \"=\", \"0.03\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"length\", \" \", \"of\", \" \", \"the\", \" \", \"minor\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"the\", \" \", \"ones\", \" \", \"without\", \" \", \"tick\", \" \", \"labels\"}],\n");
mfprintf(a," \")\"}], \" \", \"on\", \" \", \"the\", \" \", \n");
mfprintf(a," RowBox[{\"axes\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklength\", \"=\", \"0.015\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Controls\", \" \", \"if\", \" \", \"the\", \" \", \"major\", \" \", \"ticks\", \" \", \n");
mfprintf(a," \"point\", \" \", \"to\", \" \", \"the\", \" \", \"inside\", \" \", \"or\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\", \" \", \"0\"}], \" \", \"is\", \" \", \"inside\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0.5\", \" \", \"is\", \" \", \"symmetrical\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"1\", \" \", \"is\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majortickshift\", \"=\", \"0.5\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Controls\", \" \", \"if\", \" \", \"the\", \" \", \"minor\", \" \", \"ticks\", \" \", \n");
mfprintf(a," \"point\", \" \", \"to\", \" \", \"the\", \" \", \"inside\", \" \", \"or\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\", \" \", \"0\"}], \" \", \"is\", \" \", \"inside\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0.5\", \" \", \"is\", \" \", \"symmetrical\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"1\", \" \", \"is\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minortickshift\", \"=\", \"0.5\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Mesh Properties\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]],\n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"thickness\", \" \", \"of\", \" \", \"the\", \" \", \"mesh\", \" \", \n");
mfprintf(a," \"perpendicular\", \" \", \"to\", \" \", \"the\", \" \", \"X\", \" \", \"axis\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"relative\", \" \", \"to\", \" \", \"the\", \" \", \"overall\", \" \", \"plot\", \" \", \n");
mfprintf(a," \"width\"}], \")\"}], \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"meshthicknessX\", \"=\", \"0.002\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \",\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"color\", \" \", \"of\", \" \", \"the\", \" \", \"mesh\", \" \", \n");
mfprintf(a," \"perpendicular\", \" \", \"to\", \" \", \"the\", \" \", \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\", \" \", \"Enter\"}], \" \", \"three\", \" \", \"values\", \" \", \n");
mfprintf(a," \"between\", \" \", \"0\", \" \", \"and\", \" \", \"1\", \" \", \"for\", \" \", \"red\"}], \",\",\n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"green\", \" \", \"and\", \" \", \"blue\", \" \", \"color\", \" \", \n");
mfprintf(a," RowBox[{\"component\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"meshcolorX\", \"=\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"opacity\", \" \", \"of\", \" \", \"the\", \" \", \"mesh\", \" \", \n");
mfprintf(a," \"perpendicular\", \" \", \"to\", \" \", \"the\", \" \", \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\", \" \", \"1\"}], \" \", \"means\", \" \", \"fully\", \" \", \n");
mfprintf(a," \"opaque\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0\", \" \", \"means\", \" \", \"totally\", \" \", \"transparent\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \"invisible\", \")\"}], \".\"}]}]}], \" \", \"*)\"}], \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"meshopacityX\", \"=\", \"0.5\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"thickness\", \" \", \"of\", \" \", \"the\", \" \", \"mesh\", \" \", \n");
mfprintf(a," \"perpendicular\", \" \", \"to\", \" \", \"the\", \" \", \"Y\", \" \", \"axis\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"relative\", \" \", \"to\", \" \", \"the\", \" \", \"overall\", \" \", \"plot\", \" \", \n");
mfprintf(a," \"width\"}], \")\"}], \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"meshthicknessY\", \"=\", \"0.002\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"color\", \" \", \"of\", \" \", \"the\", \" \", \"mesh\", \" \", \n");
mfprintf(a," \"perpendicular\", \" \", \"to\", \" \", \"the\", \" \", \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\", \" \", \"Enter\"}], \" \", \"three\", \" \", \"values\", \" \", \n");
mfprintf(a," \"between\", \" \", \"0\", \" \", \"and\", \" \", \"1\", \" \", \"for\", \" \", \"red\"}], \",\",\n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"green\", \" \", \"and\", \" \", \"blue\", \" \", \"color\", \" \", \n");
mfprintf(a," RowBox[{\"component\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"meshcolorY\", \"=\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"opacity\", \" \", \"of\", \" \", \"the\", \" \", \"mesh\", \" \", \n");
mfprintf(a," \"perpendicular\", \" \", \"to\", \" \", \"the\", \" \", \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\", \" \", \"1\"}], \" \", \"means\", \" \", \"fully\", \" \", \n");
mfprintf(a," \"opaque\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0\", \" \", \"means\", \" \", \"totally\", \" \", \"transparent\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \"invisible\", \")\"}], \".\"}]}]}], \" \", \"*)\"}], \n");
mfprintf(a," \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"meshopacityY\", \"=\", \"0.5\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed ]],\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"X Axis\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"label\", \" \", \"to\", \" \", \"appear\", \" \", \"on\", \" \", \"the\", \" \", \n");
mfprintf(a," \"x\", \" \", \"axis\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"xlabel\", \"=\", \"\\\"\\<%s\\>\\\"\"}], \n",m_sLabelX);
mfprintf(a," \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"lowest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"x\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickminX\", \":=\", \n");
mfprintf(a," RowBox[{\"maxsig\", \"[\", \n");
mfprintf(a," RowBox[{\"plotrangeX1\", \",\", \"2\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"highest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"x\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickmaxX\", \":=\", \n");
mfprintf(a," RowBox[{\"minsig\", \"[\", \n");
mfprintf(a," RowBox[{\"plotrangeX2\", \",\", \"2\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Print\", \" \", \"this\", \" \", \"number\", \" \", \"of\", \" \", \"digits\", \" \", \n");
mfprintf(a," \"after\", \" \", \"the\", \" \", \"decimal\", \" \", \"point\", \" \", \"of\", \" \", \"the\", \n");
mfprintf(a," \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"labels\", \".\", \" \", \"0\"}], \" \", \"means\", \" \", \"no\", \" \", \n");
mfprintf(a," \"decimal\", \" \", \n");
mfprintf(a," RowBox[{\"point\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecX\", \":=\", \n");
mfprintf(a," RowBox[{\"prec\", \"[\", \"plotrangeX2\", \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Use\", \" \", \"this\", \" \", \"count\", \" \", \"of\", \" \", \"major\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"with\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"on\", \" \", \n");
mfprintf(a," \"the\", \" \", \"x\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticksX\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",majorx);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"How\", \" \", \"many\", \" \", \"minor\", \" \", \"ticks\", \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"without\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"to\", \" \", \n");
mfprintf(a," \"show\", \" \", \"PER\", \" \", \"MAJOR\", \" \", \n");
mfprintf(a," RowBox[{\"TICK\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticksX\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",minorx);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"A\", \" \", \"character\", \" \", \"string\", \" \", \"to\", \" \", \"stand\", \" \", \n");
mfprintf(a," \"before\", \" \", \"each\", \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"label\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticklabelprefixX\", \"=\", \"\\\"\\<\\>\\\"\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"A\", \" \", \"character\", \" \", \"string\", \" \", \"to\", \" \", \"stand\", \" \", \n");
mfprintf(a," \"after\", \" \", \"each\", \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"label\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticklabelsuffixX\", \"=\", \"\\\"\\<\\>\\\"\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Show\", \" \", \"tick\", \" \", \"marks\", \" \", \"on\", \" \", \"both\", \" \", \"the\", \" \",\n");
mfprintf(a," \"top\", \" \", \"X\", \" \", \"axis\", \" \", \"and\", \" \", \"the\", \" \", \"bottom\", \" \",\n");
mfprintf(a," \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \"?\", \" \", \"Set\"}], \" \", \"to\", \" \", \"\\\"\\<1\\>\\\"\", \" \", \"if\",\n");
mfprintf(a," \" \", \"desired\", \" \", \"or\", \" \", \"to\", \" \", \"\\\"\\<.\\>\\\"\", \" \", \"if\", \" \", \n");
mfprintf(a," RowBox[{\"not\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticksbothsidesX\", \"=\", \"1\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Show\", \" \", \"tick\", \" \", \"labels\", \" \", \"on\", \" \", \"both\", \" \", \"the\", \n");
mfprintf(a," \" \", \"top\", \" \", \"X\", \" \", \"axis\", \" \", \"and\", \" \", \"the\", \" \", \"bottom\", \n");
mfprintf(a," \" \", \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \"?\", \" \", \"Set\"}], \" \", \"to\", \" \", \"\\\"\\<1\\>\\\"\", \" \", \"if\",\n");
mfprintf(a," \" \", \"desired\", \" \", \"or\", \" \", \"to\", \" \", \"\\\"\\<.\\>\\\"\", \" \", \"if\", \" \", \n");
mfprintf(a," RowBox[{\"not\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"labelsbothsidesX\", \"=.\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Y Axis\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"label\", \" \", \"to\", \" \", \"appear\", \" \", \"on\", \" \", \"the\", \" \", \n");
mfprintf(a," \"Y\", \" \", \"axis\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ylabel\", \"=\", \"\\\"\\<%s\\>\\\"\"}], \n",m_sLabelY);
mfprintf(a," \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"lowest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickminY\", \":=\", \n");
mfprintf(a," RowBox[{\"maxsig\", \"[\", \n");
mfprintf(a," RowBox[{\"plotrangeY1\", \",\", \"2\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"highest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickmaxY\", \":=\", \n");
mfprintf(a," RowBox[{\"minsig\", \"[\", \n");
mfprintf(a," RowBox[{\"plotrangeY2\", \",\", \"2\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Print\", \" \", \"this\", \" \", \"number\", \" \", \"of\", \" \", \"digits\", \" \", \n");
mfprintf(a," \"after\", \" \", \"the\", \" \", \"decimal\", \" \", \"point\", \" \", \"of\", \" \", \"the\", \n");
mfprintf(a," \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"labels\", \".\", \" \", \"0\"}], \" \", \"means\", \" \", \"no\", \" \", \n");
mfprintf(a," \"decimal\", \" \", \n");
mfprintf(a," RowBox[{\"point\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecY\", \":=\", \n");
mfprintf(a," RowBox[{\"prec\", \"[\", \"plotrangeY2\", \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Use\", \" \", \"this\", \" \", \"count\", \" \", \"of\", \" \", \"major\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"with\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"on\", \" \", \n");
mfprintf(a," \"the\", \" \", \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticksY\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",majory);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"How\", \" \", \"many\", \" \", \"minor\", \" \", \"ticks\", \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"without\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"to\", \" \", \n");
mfprintf(a," \"show\", \" \", \"PER\", \" \", \"MAJOR\", \" \", \n");
mfprintf(a," RowBox[{\"TICK\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticksY\", \"=\", \"%d\"}], \";\"}]}]], \"Input\"],\n",minory);
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"A\", \" \", \"character\", \" \", \"string\", \" \", \"to\", \" \", \"stand\", \" \", \n");
mfprintf(a," \"before\", \" \", \"each\", \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"label\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticklabelprefixY\", \"=\", \"\\\"\\<\\>\\\"\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"A\", \" \", \"character\", \" \", \"string\", \" \", \"to\", \" \", \"stand\", \" \", \n");
mfprintf(a," \"after\", \" \", \"each\", \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"label\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticklabelsuffixY\", \"=\", \"\\\"\\<\\>\\\"\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Show\", \" \", \"tick\", \" \", \"marks\", \" \", \"on\", \" \", \"both\", \" \", \"the\", \" \",\n");
mfprintf(a," \"left\", \" \", \"Y\", \" \", \"axis\", \" \", \"and\", \" \", \"the\", \" \", \"right\", \" \",\n");
mfprintf(a," \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \"?\", \" \", \"Set\"}], \" \", \"to\", \" \", \"\\\"\\<1\\>\\\"\", \" \", \"if\",\n");
mfprintf(a," \" \", \"desired\", \" \", \"or\", \" \", \"to\", \" \", \"\\\"\\<.\\>\\\"\", \" \", \"if\", \" \", \n");
mfprintf(a," RowBox[{\"not\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticksbothsidesY\", \"=\", \"1\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Show\", \" \", \"tick\", \" \", \"labels\", \" \", \"on\", \" \", \"both\", \" \", \"the\", \n");
mfprintf(a," \" \", \"left\", \" \", \"Y\", \" \", \"axis\", \" \", \"and\", \" \", \"the\", \" \", \"right\", \n");
mfprintf(a," \" \", \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \"?\", \" \", \"Set\"}], \" \", \"to\", \" \", \"\\\"\\<1\\>\\\"\", \" \", \"if\",\n");
mfprintf(a," \" \", \"desired\", \" \", \"or\", \" \", \"to\", \" \", \"\\\"\\<.\\>\\\"\", \" \", \"if\", \" \", \n");
mfprintf(a," RowBox[{\"not\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"labelsbothsidesY\", \"=.\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Z Axis\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False},\n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"label\", \" \", \"to\", \" \", \"appear\", \" \", \"on\", \" \", \"the\", \" \", \n");
mfprintf(a," \"Z\", \" \", \"axis\"}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
if (m_sLabelZ == NULL)
mfprintf(a," RowBox[{\"zlabel\", \"=\", \"\\\"\\\\\"\"}], \n");
else
mfprintf(a," RowBox[{\"zlabel\", \"=\", \"\\\"\\<%s\\>\\\"\"}], \n",m_sLabelZ);
mfprintf(a," \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"lowest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"Z\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickminZ\", \":=\", \n");
mfprintf(a," RowBox[{\"maxsig\", \"[\", \n");
mfprintf(a," RowBox[{\"datminexp\", \",\", \"2\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"highest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"Z\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickmaxZ\", \":=\", \n");
mfprintf(a," RowBox[{\"minsig\", \"[\", \n");
mfprintf(a," RowBox[{\"datmaxexp\", \",\", \"2\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Print\", \" \", \"this\", \" \", \"number\", \" \", \"of\", \" \", \"digits\", \" \", \n");
mfprintf(a," \"after\", \" \", \"the\", \" \", \"decimal\", \" \", \"point\", \" \", \"of\", \" \", \"the\", \n");
mfprintf(a," \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"labels\", \".\", \" \", \"0\"}], \" \", \"means\", \" \", \"no\", \" \", \n");
mfprintf(a," \"decimal\", \" \", \n");
mfprintf(a," RowBox[{\"point\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecZ\", \":=\", \n");
mfprintf(a," RowBox[{\"prec\", \"[\", \"datmaxexp\", \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Use\", \" \", \"this\", \" \", \"count\", \" \", \"of\", \" \", \"major\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"with\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"on\", \" \", \n");
mfprintf(a," \"the\", \" \", \"Z\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticksZ\", \"=\", \"5\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"How\", \" \", \"many\", \" \", \"minor\", \" \", \"ticks\", \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"without\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"to\", \" \", \n");
mfprintf(a," \"show\", \" \", \"PER\", \" \", \"MAJOR\", \" \", \n");
mfprintf(a," RowBox[{\"TICK\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticksZ\", \"=\", \"3\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"A\", \" \", \"character\", \" \", \"string\", \" \", \"to\", \" \", \"stand\", \" \", \n");
mfprintf(a," \"before\", \" \", \"each\", \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"label\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticklabelprefixZ\", \"=\", \"\\\"\\<\\>\\\"\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"A\", \" \", \"character\", \" \", \"string\", \" \", \"to\", \" \", \"stand\", \" \", \n");
mfprintf(a," \"after\", \" \", \"each\", \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"label\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"ticklabelsuffixZ\", \"=\", \"\\\"\\<\\>\\\"\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Legend Axis\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"lowest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"legend\", \" \", \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\", \" \", \"\\\"\\\\\"\"}], \" \", \"sets\", \" \", \"this\", \n");
mfprintf(a," \" \", \"automatically\", \" \", \"to\", \" \", \"the\", \" \", \"lowest\", \" \", \"plot\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"element\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickminL\", \":=\", \n");
mfprintf(a," RowBox[{\"maxsig\", \"[\", \n");
mfprintf(a," RowBox[{\"datmin\", \",\", \"3\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"highest\", \" \", \"tick\", \" \", \"value\", \" \", \"for\", \" \", \"the\", \n");
mfprintf(a," \" \", \"legend\", \" \", \"Y\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\", \" \", \"\\\"\\\\\"\"}], \" \", \"sets\", \" \", \"this\", \n");
mfprintf(a," \" \", \"automatically\", \" \", \"to\", \" \", \"the\", \" \", \"highest\", \" \", \"plot\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"element\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickmaxL\", \":=\", \n");
mfprintf(a," RowBox[{\"minsig\", \"[\", \n");
mfprintf(a," RowBox[{\"datmax\", \",\", \"3\"}], \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Print\", \" \", \"this\", \" \", \"number\", \" \", \"of\", \" \", \"digits\", \" \", \n");
mfprintf(a," \"after\", \" \", \"the\", \" \", \"decimal\", \" \", \"point\", \" \", \"of\", \" \", \"the\", \n");
mfprintf(a," \" \", \"tick\", \" \", \n");
mfprintf(a," RowBox[{\"labels\", \".\", \" \", \"0\"}], \" \", \"means\", \" \", \"no\", \" \", \n");
mfprintf(a," \"decimal\", \" \", \n");
mfprintf(a," RowBox[{\"point\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"tickprecL\", \":=\", \n");
mfprintf(a," RowBox[{\"prec\", \"[\", \"datmax\", \"]\"}]}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Use\", \" \", \"this\", \" \", \"count\", \" \", \"of\", \" \", \"major\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"with\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"on\", \" \", \n");
mfprintf(a," \"the\", \" \", \"legend\", \" \", \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticksL\", \"=\", \"5\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"How\", \" \", \"many\", \" \", \"minor\", \" \", \"ticks\", \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"without\", \" \", \"tick\", \" \", \"label\"}], \")\"}], \" \", \"to\", \" \", \n");
mfprintf(a," \"show\", \" \", \"PER\", \" \", \"MAJOR\", \" \", \n");
mfprintf(a," RowBox[{\"TICK\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticksL\", \"=\", \"3\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"length\", \" \", \"of\", \" \", \"the\", \" \", \"major\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \"on\", \" \", \"the\", \" \", \"legend\", \" \", \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majorticklengthL\", \"=\", \"0.015\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"The\", \" \", \"length\", \" \", \"of\", \" \", \"the\", \" \", \"minor\", \" \", \"ticks\", \n");
mfprintf(a," \" \", \n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"the\", \" \", \"ones\", \" \", \"without\", \" \", \"tick\", \" \", \"labels\"}],\n");
mfprintf(a," \")\"}], \" \", \"on\", \" \", \"the\", \" \", \"legend\", \" \", \"X\", \" \", \n");
mfprintf(a," RowBox[{\"axis\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minorticklengthL\", \"=\", \"0.008\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Controls\", \" \", \"if\", \" \", \"the\", \" \", \"major\", \" \", \"ticks\", \" \", \n");
mfprintf(a," \"point\", \" \", \"to\", \" \", \"the\", \" \", \"inside\", \" \", \"or\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\", \" \", \"0\"}], \" \", \"is\", \" \", \"inside\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0.5\", \" \", \"is\", \" \", \"symmetrical\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"1\", \" \", \"is\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"majortickshiftL\", \"=\", \"0\"}], \";\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Controls\", \" \", \"if\", \" \", \"the\", \" \", \"minor\", \" \", \"ticks\", \" \", \n");
mfprintf(a," \"point\", \" \", \"to\", \" \", \"the\", \" \", \"inside\", \" \", \"or\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\", \" \", \"0\"}], \" \", \"is\", \" \", \"inside\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"0.5\", \" \", \"is\", \" \", \"symmetrical\"}], \",\", \" \", \n");
mfprintf(a," RowBox[{\"1\", \" \", \"is\", \" \", \n");
mfprintf(a," RowBox[{\"outside\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"minortickshiftL\", \"=\", \"0\"}], \";\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Lines / Rectangles / Functions\", \"Section\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Function Drawing\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Here\", \" \", \"some\", \" \", \"functions\", \" \", \"of\", \" \", \"the\", \" \", \"form\",\n");
mfprintf(a," \" \", \"f\", \n");
mfprintf(a," RowBox[{\"(\", \"x\", \")\"}]}], \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"y\", \" \", \"are\", \" \", \n");
mfprintf(a," RowBox[{\"defined\", \".\", \" \", \"Uncomment\"}], \" \", \"them\", \" \", \"for\", \" \",\n");
mfprintf(a," \"testing\", \" \", \"and\", \" \", \"define\", \" \", \"your\", \" \", \"own\", \" \", \n");
mfprintf(a," RowBox[{\"ones\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"funcX\", \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"x\", \"/\", \"%f\"}], \")\"}], \"^\", \"2\"}], \"*\", \n",m_fMaxVal[0]);
mfprintf(a," \"%f\"}], \",\", \n",m_fMaxVal[1]);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", \n",m_fMinVal[0],m_fMaxVal[0]);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"0.01\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"1\", \",\", \"1\", \",\", \"0\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Dashing\", \"[\", \"0.02\", \"]\"}]}], \"}\"}]}], \"}\"}]}], \"]\"}], \n");
mfprintf(a," \";\"}], \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"funcX\", \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(\", \n");
mfprintf(a," RowBox[{\"x\", \"/\", \"%f\"}], \")\"}], \"^\", \"3\"}], \"*\", \n",m_fMaxVal[0]);
mfprintf(a," \"%f\"}], \",\", \n",m_fMaxVal[1]);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", \n",m_fMinVal[0]+(m_fMaxVal[0]-m_fMinVal[0])*0.2,m_fMaxVal[0]-(m_fMaxVal[0]-m_fMinVal[0])*0.2);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"0.02\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"1\", \",\", \"1\"}], \"]\"}]}], \"}\"}]}], \"}\"}]}], \n");
mfprintf(a," \"]\"}], \";\"}], \"*)\"}]}]], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," \"Here\", \" \", \"some\", \" \", \"functions\", \" \", \"of\", \" \", \"the\", \" \", \"form\",\n");
mfprintf(a," \" \", \"f\", \n");
mfprintf(a," RowBox[{\"(\", \"y\", \")\"}]}], \" \", \"=\", \" \", \n");
mfprintf(a," RowBox[{\"x\", \" \", \"are\", \" \", \n");
mfprintf(a," RowBox[{\"defined\", \".\", \" \", \"Uncomment\"}], \" \", \"them\", \" \", \"for\", \" \",\n");
mfprintf(a," \"testing\", \" \", \"and\", \" \", \"define\", \" \", \"your\", \" \", \"own\", \" \", \n");
mfprintf(a," RowBox[{\"ones\", \".\"}]}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"funcY\", \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Sin\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"y\", \"/\", \"%f\"}], \"*\", \"10\", \"Pi\"}], \"]\"}], \"*\", \n",m_fMaxVal[1]);
mfprintf(a," \"%f\"}], \",\", \n",m_fMaxVal[0]*0.5);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", \n",m_fMinVal[1],m_fMaxVal[1]);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"0.01\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \"}\"}]}], \"}\"}]}], \n");
mfprintf(a," \"]\"}], \";\"}], \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"funcY\", \",\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"y\", \"*\", \"%f\"}], \",\", \n",m_fMaxVal[0]/m_fMaxVal[1]);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", \n",m_fMinVal[1],m_fMaxVal[1]*0.5);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"0.02\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"1\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \"}\"}]}], \"}\"}]}], \n");
mfprintf(a," \"]\"}], \";\"}], \"*)\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"Cell[\"Rectangle and Circle Drawing\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"Draw\", \" \", \"Rectangles\", \" \", \"and\", \" \", \n");
mfprintf(a," RowBox[{\"Circles\", \".\", \" \", \"Uncomment\"}], \" \", \"the\", \" \", \"examples\", \n");
mfprintf(a," \" \", \"below\", \" \", \"and\", \" \", \"try\", \" \", \"it\", \" \", \n");
mfprintf(a," RowBox[{\"out\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"prim\", \",\", \n");
mfprintf(a," RowBox[{\"Graphics\", \"[\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"EdgeForm\", \"[\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"0.006\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"1\", \",\", \"0\", \",\", \"1\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Dashing\", \"[\", \"0.02\", \"]\"}]}], \"}\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"1\", \",\", \"0\", \",\", \"0\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"0\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Rectangle\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"%f\"}], \",\", \n",m_fMinVal[0]);
mfprintf(a," RowBox[{\"%f\"}]}], \"}\"}], \",\", \n",m_fMinVal[1]);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}]}], \"]\"}]}], \n",m_fMaxVal[0]*0.7,m_fMaxVal[1]*0.3);
mfprintf(a," \"}\"}], \"]\"}]}], \"]\"}], \";\", \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"prim\", \",\", \n");
mfprintf(a," RowBox[{\"Graphics\", \"[\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"EdgeForm\", \"[\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"0.004\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"0\"}], \"]\"}]}], \"}\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"1\", \",\", \"0\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"1\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Disk\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", RowBox[{\"{\", RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}]}], \"]\"}]}], \"}\"}], \n",m_fMinVal[0]+(m_fMaxVal[0]-m_fMinVal[0])*0.41666,(m_fMaxVal[0]-m_fMinVal[0])*0.0625,(m_fMaxVal[0]-m_fMinVal[0])*0.0625,(m_fMaxVal[1]-m_fMinVal[1])*0.0625);
mfprintf(a," \"]\"}]}], \"]\"}], \";\"}], \"*)\"}]\n");
if (m_oaCircles.GetSize() > 0)
{
mfprintf(a,",\"\\[IndentingNewLine]\", \n");
mfprintf(a,"RowBox[{\n");
for (z=0;zm_fColorR,((CMathematicaCircle*)m_oaCircles[z])->m_fColorG,((CMathematicaCircle*)m_oaCircles[z])->m_fColorB);
mfprintf(a," RowBox[{\"Opacity\", \"[\", \"1\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Disk\", \"[\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", \"%f\"}], \"]\"}]}], \"}\"}], \n",((CMathematicaCircle*)m_oaCircles[z])->m_fPosX,((CMathematicaCircle*)m_oaCircles[z])->m_fPosY,((CMathematicaCircle*)m_oaCircles[z])->m_fRadius);
mfprintf(a," \"]\"}]}], \"]\"}], \";\"}]");
if (z < m_oaCircles.GetSize()-1)
mfprintf(a,", \"\\[IndentingNewLine]\", ");
mfprintf(a,"\n");
}
mfprintf(a,"}]\n");
}
mfprintf(a,"}]], \"Input\"]\n");
mfprintf(a,"}, Closed ]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"Line Drawing\", \"Subsection\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = False},\n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"(*\", \" \", \n");
mfprintf(a," RowBox[{\"Draw\", \" \", \n");
mfprintf(a," RowBox[{\"Lines\", \".\", \" \", \"Uncomment\"}], \" \", \"the\", \" \", \"example\", \" \",\n");
mfprintf(a," \"below\", \" \", \"and\", \" \", \"try\", \" \", \"it\", \" \", \n");
mfprintf(a," RowBox[{\"out\", \".\"}]}], \" \", \"*)\"}], \"\\[IndentingNewLine]\", \n");
mfprintf(a," RowBox[{\"(*\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"AppendTo\", \"[\", \n");
mfprintf(a," RowBox[{\"prim\", \",\", \n");
mfprintf(a," RowBox[{\"Graphics\", \"[\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"Thickness\", \"[\", \"0.01\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"RGBColor\", \"[\", \n");
mfprintf(a," RowBox[{\"0\", \",\", \"0\", \",\", \"1\"}], \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Dashing\", \"[\", \"1000\", \"]\"}], \",\", \n");
mfprintf(a," RowBox[{\"Line\", \"[\", \n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\n");
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", \n",m_fMinVal[0],m_fMinVal[1]);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}], \",\", \n",m_fMaxVal[0]*0.4,m_fMaxVal[1]*0.8);
mfprintf(a," RowBox[{\"{\", \n");
mfprintf(a," RowBox[{\"%f\", \",\", \"%f\"}], \"}\"}]}], \"}\"}], \"]\"}]}],\n",m_fMaxVal[0]*0.4,m_fMinVal[1]);
mfprintf(a," \"}\"}], \"]\"}]}], \"]\"}], \";\"}], \"*)\"}]}]], \"Input\"]\n");
mfprintf(a,"}, Closed]]\n");
mfprintf(a,"}, Closed]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[CellGroupData[{\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[\"\\<\\\n");
mfprintf(a,"Plot output. Click \\\"Evaluation -> Evaluate Notebook\\\" to draw/redraw!\\\n");
mfprintf(a,"\\>\", \"Section\",\n");
mfprintf(a," CellDingbat->DynamicModuleBox[{$CellContext`state$$ = True}, \n");
mfprintf(a," OpenerBox[\n");
mfprintf(a," Dynamic[$CellContext`state$$, (FrontEndExecute[{\n");
mfprintf(a," FrontEnd`SelectionMove[\n");
mfprintf(a," FrontEnd`ButtonNotebook[], All, ButtonCell], \n");
mfprintf(a," FrontEndToken[\"OpenCloseGroup\"]}]; $CellContext`state$$ = #)& ]], \n");
mfprintf(a," DynamicModuleValues :> {}]],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\"plot\"], \"Input\"],\n");
mfprintf(a,"\n");
mfprintf(a,"Cell[BoxData[\"plotlegend\"], \"Input\"]\n");
mfprintf(a,"}, Open ]]\n");
mfprintf(a,"}\n");
mfprintf(a,"]\n");
fclose(a);
BTOUT;
}
void C2DF::NormRDF(double n)
{
BTIN;
int x, y;
double f;
for (y=0;y m_fMaxEntry)
m_fMaxEntry = m_pBin[z*m_iRes[0]+z2];
if (m_pBin[z*m_iRes[0]+z2] < m_fMinEntry)
m_fMinEntry = m_pBin[z*m_iRes[0]+z2];
}
}
if (fabs(m_fMinEntry) > m_fMaxEntry)
a = fabs(m_fMinEntry);
else
a = m_fMaxEntry;
m_fEps = nextafter(a,2.0*a) - a;
BTOUT;
}
void C2DF::SetLabelX(const char *s)
{
if (m_sLabelX != NULL)
delete[] m_sLabelX;
try { m_sLabelX = new char[strlen(s)+1]; } catch(...) { m_sLabelX = NULL; }
if (m_sLabelX == NULL) NewException((double)(strlen(s)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelX,s);
}
void C2DF::SetLabelY(const char *s)
{
if (m_sLabelY != NULL)
delete[] m_sLabelY;
try { m_sLabelY = new char[strlen(s)+1]; } catch(...) { m_sLabelY = NULL; }
if (m_sLabelY == NULL) NewException((double)(strlen(s)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelY,s);
}
void C2DF::SetLabelZ(const char *s)
{
if (m_sLabelZ != NULL)
delete[] m_sLabelZ;
try { m_sLabelZ = new char[strlen(s)+1]; } catch(...) { m_sLabelZ = NULL; }
if (m_sLabelZ == NULL) NewException((double)(strlen(s)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelZ,s);
}
void C2DF::MakeTensorProduct(C2DF *inp)
{
int x, y;
double tf, *px, *py;
try { px = new double[m_iRes[0]]; } catch(...) { px = NULL; }
if (px == NULL) NewException((double)m_iRes[0]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
try { py = new double[m_iRes[1]]; } catch(...) { py = NULL; }
if (py == NULL) NewException((double)m_iRes[1]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (y=0;ym_pBin[y*m_iRes[0]+x];
tf /= (double)m_iRes[0];
py[y] = tf;
}
for (x=0;xm_pBin[y*m_iRes[0]+x];
tf /= (double)m_iRes[1];
px[x] = tf;
}
for (x=0;xm_sLabelX != NULL)
{
try { m_sLabelX = new char[strlen(df->m_sLabelX)+1]; } catch(...) { m_sLabelX = NULL; }
if (m_sLabelX == NULL) NewException((double)(strlen(df->m_sLabelX)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelX,df->m_sLabelX);
}
if (df->m_sLabelY != NULL)
{
try { m_sLabelY = new char[strlen(df->m_sLabelY)+1]; } catch(...) { m_sLabelY = NULL; }
if (m_sLabelY == NULL) NewException((double)(strlen(df->m_sLabelY)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelY,df->m_sLabelY);
}
if (df->m_sLabelZ != NULL)
{
try { m_sLabelZ = new char[strlen(df->m_sLabelZ)+1]; } catch(...) { m_sLabelZ = NULL; }
if (m_sLabelZ == NULL) NewException((double)(strlen(df->m_sLabelZ)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelZ,df->m_sLabelZ);
}
m_iRes[0] = df->m_iRes[0];
m_iRes[1] = df->m_iRes[1];
m_fMinVal[0] = df->m_fMinVal[0];
m_fMinVal[1] = df->m_fMinVal[1];
m_fMaxVal[0] = df->m_fMaxVal[0];
m_fMaxVal[1] = df->m_fMaxVal[1];
try { m_fCountX = new double[m_iRes[0]]; } catch(...) { m_fCountX = NULL; }
if (m_fCountX == NULL) NewException((double)m_iRes[0]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
try { m_fCountY = new double[m_iRes[1]]; } catch(...) { m_fCountY = NULL; }
if (m_fCountY == NULL) NewException((double)m_iRes[1]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
try { m_pStepsY = new unsigned long[m_iRes[1]]; } catch(...) { m_pStepsY = NULL; }
if (m_pStepsY == NULL) NewException((double)m_iRes[0]*sizeof(unsigned long),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (z=0;zm_fCountX[z];
for (z=0;zm_fCountY[z];
m_pStepsY[z] = df->m_pStepsY[z];
}
try { m_pBin = new double[m_iRes[0]*m_iRes[1]]; } catch(...) { m_pBin = NULL; }
if (m_pBin == NULL) NewException((double)m_iRes[0]*m_iRes[1]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (z=0;zm_pBin[z];
m_fFac[0] = m_iRes[0] / (m_fMaxVal[0]-m_fMinVal[0]);
m_fFac[1] = m_iRes[1] / (m_fMaxVal[1]-m_fMinVal[1]);
m_fBinEntries = df->m_fBinEntries;
m_fSkipEntries = df->m_fSkipEntries;
// m_fMathematicaColorScale = df->m_fMathematicaColorScale;
// m_fMathematicaColorOffset = df->m_fMathematicaColorOffset;
m_pChannels[0] = df->m_pChannels[0];
m_pChannels[1] = df->m_pChannels[1];
}
void C2DF::Subtract(C2DF *df)
{
int z;
if ((m_iRes[0] != df->m_iRes[0]) || (m_iRes[1] != df->m_iRes[1]))
{
eprintf("C2DF::Subtract(C2DF*): Resolution of CDFs must be identical.\n");
return;
}
for (z=0;zm_pBin[z];
}
void C2DF::WriteCombinedPlot(const char *prefix, const char *name, const char *suffix)
{
CGrace *comb;
// char buf[32768];
CxString buf;
int z;
try { comb = new CGrace(); } catch(...) { comb = NULL; }
if (comb == NULL) NewException((double)sizeof(CGrace),__FILE__,__LINE__,__PRETTY_FUNCTION__);
m_pChannels[0]->CalcMinMax();
m_pChannels[1]->CalcMinMax();
comb->SetViewport(0.15,0.8,0.8,0.95);
comb->CurrentGraph()->m_bTicks = false;
comb->CurrentGraph()->m_bTickLabels = false;
comb->CurrentGraph()->m_fFrameWidth = 0.5;
comb->SetRangeX(m_pChannels[0]->m_fMinVal,m_pChannels[0]->m_fMaxVal);
comb->SetRangeY(/*m_pChannels[0]->m_fMinEntry*/0.0,m_pChannels[0]->m_fMaxEntry+(m_pChannels[0]->m_fMaxEntry/*-m_pChannels[0]->m_fMinEntry*/)*0.1);
comb->MakeTicks();
if (g_iObsChannel[0] == 0) // RDF
comb->AddLine(m_pChannels[0]->m_fMinVal,1,m_pChannels[0]->m_fMaxVal,1,1,1);
comb->AddDataset();
comb->CurrentGraph()->CurrentDataset()->m_faValues.SetMaxSize(m_pChannels[0]->m_iResolution*2);
for (z=0;zm_iResolution-1;z++)
comb->AddXYTupel(0,m_pChannels[0]->m_fMinVal+(z+0.5)*(m_pChannels[0]->m_fMaxVal-m_pChannels[0]->m_fMinVal)/m_pChannels[0]->m_iResolution,m_pChannels[0]->m_pBin[z]);
comb->AddGraph();
comb->SetViewport(0.8, 0.15, 0.95, 0.8);
comb->CurrentGraph()->m_bTicks = false;
comb->CurrentGraph()->m_bTickLabels = false;
comb->CurrentGraph()->m_fFrameWidth = 0.5;
comb->SetRangeX(/*m_pChannels[1]->m_fMinEntry*/0.0,m_pChannels[1]->m_fMaxEntry+(m_pChannels[1]->m_fMaxEntry/*-m_pChannels[1]->m_fMinEntry*/)*0.1);
comb->SetRangeY(m_pChannels[1]->m_fMinVal,m_pChannels[1]->m_fMaxVal);
comb->MakeTicks();
if (g_iObsChannel[1] == 0) // RDF
comb->AddLine(1,m_pChannels[1]->m_fMinVal,1,m_pChannels[1]->m_fMaxVal,1,1);
comb->AddDataset();
comb->CurrentGraph()->CurrentDataset()->m_faValues.SetMaxSize(m_pChannels[1]->m_iResolution*2);
for (z=0;zm_iResolution-1;z++)
comb->AddXYTupel(0,m_pChannels[1]->m_pBin[z],m_pChannels[1]->m_fMinVal+(z+0.5)*(m_pChannels[1]->m_fMaxVal-m_pChannels[1]->m_fMinVal)/m_pChannels[1]->m_iResolution);
comb->AddGraph();
comb->SetViewport(0.15, 0.15, 0.8, 0.8);
comb->CurrentGraph()->m_bTicksBothSidesX = true;
comb->CurrentGraph()->m_bTicksBothSidesY = true;
comb->CurrentGraph()->m_bTickInX = false;
comb->CurrentGraph()->m_bTickInY = false;
comb->SetLabelX(m_sLabelX);
comb->SetLabelY(m_sLabelY);
comb->SetRangeX(m_pChannels[0]->m_fMinVal,m_pChannels[0]->m_fMaxVal);
comb->SetRangeY(m_pChannels[1]->m_fMinVal,m_pChannels[1]->m_fMaxVal);
comb->MakeTicks();
comb->AddDataset();
/* strcpy(buf,prefix);
strcat(buf,name);
strcat(buf,suffix);*/
buf.strcpy(prefix);
buf.strcat(name);
buf.strcat(suffix);
comb->WriteAgr(buf,false);
}
void C2DF::Mirror(double plane, int channel)
{
int x, y, t;
double *tbin, p;
try { tbin = new double[m_iRes[0]*m_iRes[1]]; } catch(...) { tbin = NULL; }
if (tbin == NULL) NewException((double)m_iRes[0]*m_iRes[1]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
if (channel == 0)
{
p = (plane-m_fMinVal[0])*m_fFac[0];
for (x=0;x= 0) && (t < m_iRes[0]))
{
tbin[y*m_iRes[0]+x] += m_pBin[y*m_iRes[0]+t];
tbin[y*m_iRes[0]+x] /= 2.0;
}
}
}
} else if (channel == 1)
{
p = (plane-m_fMinVal[1])*m_fFac[1];
for (x=0;x= 0) && (t < m_iRes[1]))
{
tbin[y*m_iRes[0]+x] += m_pBin[t*m_iRes[0]+x];
tbin[y*m_iRes[0]+x] /= 2.0;
}
}
}
}
delete[] m_pBin;
m_pBin = tbin;
}
void C2DF::SwapAxes()
{
char *t;
int x, y;
double *pd;
double d;
int i;
CDF *df;
t = m_sLabelX;
m_sLabelX = m_sLabelY;
m_sLabelY = t;
try { pd = new double[m_iRes[0]*m_iRes[1]]; } catch(...) { pd = NULL; }
if (pd == NULL) NewException((double)m_iRes[0]*m_iRes[1]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (y=0;ym_fPosX = x;
c->m_fPosY = y;
c->m_fRadius = r;
c->m_fColorR = cr;
c->m_fColorG = cg;
c->m_fColorB = cb;
m_oaCircles.Add(c);
}
double C2DF::GetValue(double x, double y)
{
BXIN;
double rx, ry, r;
int ix, iy;
if ((x < m_fMinVal[0]) || (y < m_fMinVal[1]) || (x > m_fMaxVal[0]) || (y > m_fMaxVal[1]))
{
BXOUT;
return 0;
}
rx = (x-m_fMinVal[0])*m_fFac[0] - 0.5;
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
ry = (y-m_fMinVal[1])*m_fFac[1] - 0.5;
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
r = m_pBin[ iy * m_iRes[0] + ix ] * (1.0-rx) * (1.0-ry);
r += m_pBin[ iy * m_iRes[0] + ix + 1] * rx * (1.0-ry);
r += m_pBin[(iy+1) * m_iRes[0] + ix ] * (1.0-rx) * ry;
r += m_pBin[(iy+1) * m_iRes[0] + ix + 1] * rx * ry;
BXOUT;
return r;
}
void C2DF::AddToBin(int x, int y, double val)
{
BXIN;
m_fBinEntries++;
m_pBin[y*m_iRes[0] + x] += val;
m_fCountX[x]++;
m_fCountY[y]++;
BXOUT;
}
void C2DF::CalcHistogram()
{
int z, z2, t;
CalcMaxEntry();
try { m_pHistogram = new double[m_iHistogramRes]; } catch(...) { m_pHistogram = NULL; }
if (m_pHistogram == NULL) NewException((double)m_iHistogramRes*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (z=0;z= 1.0E-10)
m_pBin[z] = log10(m_pBin[z])+10.0;
else m_pBin[z] = 0;
}
}
void C2DF::NormalizeUniform(double fac)
{
int zx, zy;
double r1, r2, a1, a2, dca, vol;
for (zy=0;zy.
*****************************************************************************/
#ifndef _2DF_H
#define _2DF_H
// This must always be the first include directive
#include "config.h"
#include
#include
#include "xdvector3.h"
#include "xdoublearray.h"
#include "backtrace.h"
#include "df.h"
class CMathematicaCircle : public CxObject
{
public:
CMathematicaCircle() { }
~CMathematicaCircle() { }
double m_fPosX, m_fPosY, m_fRadius;
double m_fColorR, m_fColorG, m_fColorB;
};
class C2DF : public CxObject
{
public:
double CalcCorrelationFactor();
void NormalizeUniform(double fac);
void Log();
void WriteHistogram(const char *prefix, const char *name, const char *suffix);
void CalcHistogram();
double GetValue(double x, double y);
void AddCircle(double x, double y, double r, double cr, double cg, double cb);
void NormalizeYCount();
void NormalizeXCount();
void SwapAxes();
void Mirror(double plane, int channel);
void WriteCombinedPlot(const char *prefix, const char *name, const char *suffix);
// double m_fMathematicaColorOffset;
// double m_fMathematicaColorScale;
void Subtract(C2DF *df);
void CopyFrom(C2DF *df);
void MakeTensorProduct(C2DF *inp);
void SetLabelX(const char *s);
void SetLabelY(const char *s);
void SetLabelZ(const char *s);
void CalcMaxEntry();
void StepY(int y);
void NormRDF(double n);
C2DF();
~C2DF();
void MultiplyBin(double m);
// void AddToBin(double x, const CxVector3 &vec);
void AddToBin(double x, double y);
// void AddToBin(double x, int y);
void AddToBin(int x, int y, double val);
void AddToBin(double x, double y, double val);
void AddToBin_IntX(int x, double y, double val);
void AddToBin_IntY(double x, int y, double val);
void AddToBin_IntY(double x, int y);
// void AddToBin_IntX_fast(int x, double y);
// void AddToSingleBin(double x, double y, double val);
void NormalizeBin(double mi, double ma);
double NormalizeBinIntegral(double val);
double PPMBin();
void Write(const char *prefix, const char *name, const char *suffix);
void WriteGraceBunch(int channel, int graphs, double fac, const char *prefix, const char *name, const char *suffix);
void WriteCSV(const char *prefix, const char *name, const char *suffix);
void WriteXProjection(const char *prefix, const char *name, const char *suffix);
void WriteYProjection(const char *prefix, const char *name, const char *suffix);
void WriteMathematica(const char *prefix, const char *name, const char *suffix);
void WriteGnuplotInput(const char *prefix, const char *name, const char *suffix, bool manrange, bool printinfo=true);
void WriteMathematicaNb(const char *prefix, const char *name, const char *suffix, bool manrange, bool printinfo=true);
void Create();
void CorrectRadialDist(int channel);
void CorrectLiRadialDist(int channel);
void UnCorrectRadialDist(int channel);
void CorrectAngle(int channel);
void UnCorrectAngle(int channel);
// void AngleCorrectX();
double m_fMinVal[2];
double m_fMaxVal[2];
double m_fFac[2];
CDF *m_pChannels[2];
double m_fAspectRatio;
double m_fMinEntry;
double m_fMaxEntry;
char *m_sLabelX;
char *m_sLabelY;
char *m_sLabelZ;
char* m_sName;
char* m_sShortName;
double *m_fCountX;
double *m_fCountY;
int m_iRes[2];
int m_iHistogramRes;
double *m_pBin;
double *m_pHistogram;
double m_fBinEntries;
double m_fSkipEntries;
unsigned long *m_pStepsY;
int m_iPlotType;
int m_iSmoothGrade;
int m_iInterpolationOrder;
double m_fPlotExp;
unsigned long m_iContourLines;
bool m_bDrawMesh;
int m_iExpLegend;
int m_iColorScale;
int m_iGPInterpolation;
bool m_bContourLines;
int m_iPlotPixel;
double m_fEps;
CxObArray m_oaCircles;
void AddToBin_IntX_fast(int x, double y)
{
double ry;
int iy;
if (y > m_fMaxVal[1])
return;
m_fBinEntries++;
ry = (y-m_fMinVal[1])*m_fFac[1] - 0.5;
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
m_pBin[ iy * m_iRes[0] + x] += (1.0-ry);
m_pBin[(iy+1) * m_iRes[0] + x] += ry ;
}
};
/*inline void C2DF::AddToBin(double x, int y)
{
BXIN;
double rx;
int ix;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = ((x-m_fMinVal[0])/(m_fMaxVal[0]-m_fMinVal[0]))*((double)m_iRes[0]-1);
ix = (int)floor(rx);
rx -= ix;
m_pBin[y*m_iRes[0] + ix] += 1-rx;
m_pBin[y*m_iRes[0] + ix +1] += rx;
m_fCountX[ix] += 1.0-rx;
m_fCountX[ix+1] += rx;
m_fCountY[y]++;
BXOUT;
}*/
#endif
travis-src-190101/src/3df.h 0100777 0000000 0000000 00000142375 13412725663 012303 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef _3DF_H
#define _3DF_H
// This must always be the first include directive
#include "config.h"
#include "xobject.h"
#include "df.h"
#include "2df.h"
#include "xmemfile.h"
#include "xstring.h"
#include "bqb.h"
#include "fastatof.h"
extern int g_iCubeXStride;
extern int g_iCubeYStride;
extern int g_iCubeZStride;
extern int g_iCubeXMismatch;
extern int g_iCubeYMismatch;
extern int g_iCubeZMismatch;
extern double g_fBoxX;
extern double g_fBoxY;
extern double g_fBoxZ;
extern double g_fCubeXStep;
extern double g_fCubeYStep;
extern double g_fCubeZStep;
template
class C3DF : public CxObject
{
public:
void AddToBin(const CxDVector3 &vec)
{
AddToBin(vec[0],vec[1],vec[2]);
}
void AddToBin_Sphere(const CxDVector3 &vec, double r)
{
AddToBin_Sphere(vec[0],vec[1],vec[2],r);
}
void AddToBin_SphereWrap(const CxDVector3 &vec, double r)
{
AddToBin_SphereWrap(vec[0],vec[1],vec[2],r);
}
void AddToBin_Single(double x, double y, double z, T val)
{
int ix, iy, iz;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
return;
ix = (int)floor((x-m_fMinVal[0])*m_fFac[0]);
if (ix < 0)
ix = 0;
if (ix >= m_iRes[0])
ix = m_iRes[0] - 1;
iy = (int)floor((y-m_fMinVal[1])*m_fFac[1]);
if (iy < 0)
iy = 0;
if (iy >= m_iRes[1])
iy = m_iRes[1] - 1;
iz = (int)floor((z-m_fMinVal[2])*m_fFac[2]);
if (iz < 0)
iz = 0;
if (iz >= m_iRes[2])
iz = m_iRes[2] - 1;
m_pBin[ iz*m_iResXY + iy*m_iRes[0] + ix ] += val;
}
T GetBinValue_Single(double x, double y, double z) const
{
int ix, iy, iz;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
return -1;
ix = (int)floor((x-m_fMinVal[0])*m_fFac[0]);
if (ix < 0)
ix = 0;
if (ix >= m_iRes[0])
ix = m_iRes[0] - 1;
iy = (int)floor((y-m_fMinVal[1])*m_fFac[1]);
if (iy < 0)
iy = 0;
if (iy >= m_iRes[1])
iy = m_iRes[1] - 1;
iz = (int)floor((z-m_fMinVal[2])*m_fFac[2]);
if (iz < 0)
iz = 0;
if (iz >= m_iRes[2])
iz = m_iRes[2] - 1;
return m_pBin[ iz*m_iResXY + iy*m_iRes[0] + ix ];
}
void SetBinValue_Single(double x, double y, double z, T val)
{
int ix, iy, iz;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
return;
ix = (int)floor((x-m_fMinVal[0])*m_fFac[0]);
if (ix < 0)
ix = 0;
if (ix >= m_iRes[0])
ix = m_iRes[0] - 1;
iy = (int)floor((y-m_fMinVal[1])*m_fFac[1]);
if (iy < 0)
iy = 0;
if (iy >= m_iRes[1])
iy = m_iRes[1] - 1;
iz = (int)floor((z-m_fMinVal[2])*m_fFac[2]);
if (iz < 0)
iz = 0;
if (iz >= m_iRes[2])
iz = m_iRes[2] - 1;
m_pBin[ iz*m_iResXY + iy*m_iRes[0] + ix ] = val;
}
double m_fMinVal[3];
double m_fMaxVal[3];
CDF *m_pChannels[3];
C2DF *m_p2DF[3];
T m_fMinEntry;
T m_fMaxEntry;
char *m_sLabelX;
char *m_sLabelY;
char *m_sLabelZ;
double *m_fCountX;
double *m_fCountY;
double *m_fCountZ;
int m_iRes[3];
int m_iHistogramRes;
long m_iResXY;
double m_fBinEntries;
double m_fSkipEntries;
T *m_pBin;
double *m_pHistogram;
double m_fFac[3];
double m_fEps;
/******************************************************************************************/
C3DF()
{
m_sLabelX = NULL;
m_sLabelY = NULL;
m_sLabelZ = NULL;
m_pBin = NULL;
m_fCountX = NULL;
m_fCountY = NULL;
m_fCountZ = NULL;
m_iHistogramRes = 0;
m_pHistogram = NULL;
}
~C3DF()
{
if (m_sLabelX != NULL)
{
delete[] m_sLabelX;
m_sLabelX = NULL;
}
if (m_sLabelY != NULL)
{
delete[] m_sLabelY;
m_sLabelY = NULL;
}
if (m_sLabelZ != NULL)
{
delete[] m_sLabelZ;
m_sLabelZ = NULL;
}
if (m_pBin != NULL)
{
delete[] m_pBin;
m_pBin = NULL;
}
if (m_fCountX != NULL)
{
delete[] m_fCountX;
m_fCountX = NULL;
}
if (m_fCountY != NULL)
{
delete[] m_fCountY;
m_fCountY = NULL;
}
if (m_fCountZ != NULL)
{
delete[] m_fCountZ;
m_fCountZ = NULL;
}
}
void Create()
{
BTIN;
int z;
m_fBinEntries = 0;
m_fSkipEntries = 0;
if (m_fCountX != NULL) delete[] m_fCountX;
try { m_fCountX = new double[m_iRes[0]]; } catch(...) { m_fCountX = NULL; }
if (m_fCountX == NULL) NewException((double)m_iRes[0]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
if (m_fCountY != NULL) delete[] m_fCountY;
try { m_fCountY = new double[m_iRes[1]]; } catch(...) { m_fCountY = NULL; }
if (m_fCountY == NULL) NewException((double)m_iRes[1]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
if (m_fCountZ != NULL) delete[] m_fCountZ;
try { m_fCountZ = new double[m_iRes[2]]; } catch(...) { m_fCountZ = NULL; }
if (m_fCountZ == NULL) NewException((double)m_iRes[2]*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (z=0;z m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = (T)((x-m_fMinVal[0])*m_fFac[0] - 0.5);
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
ry = (T)((y-m_fMinVal[1])*m_fFac[1] - 0.5);
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
rz = (T)((z-m_fMinVal[2])*m_fFac[2] - 0.5);
iz = (int)floor(rz);
if (iz < 0)
{
iz = 0;
rz = 0;
} else if (iz > m_iRes[2]-2)
{
iz = m_iRes[2]-2;
rz = 1.0;
} else
rz -= iz;
m_pBin[ iz * m_iResXY + iy * m_iRes[0] + ix ] += ((T)(1.0)-rx) * ((T)(1.0)-ry) * ((T)(1.0)-rz);
m_pBin[ iz * m_iResXY + iy * m_iRes[0] + ix + 1] += rx * ((T)(1.0)-ry) * ((T)(1.0)-rz);
m_pBin[ iz * m_iResXY + (iy+1) * m_iRes[0] + ix ] += ((T)(1.0)-rx) * ry * ((T)(1.0)-rz);
m_pBin[ iz * m_iResXY + (iy+1) * m_iRes[0] + ix + 1] += rx * ry * ((T)(1.0)-rz);
m_pBin[(iz+1) * m_iResXY + iy * m_iRes[0] + ix ] += ((T)(1.0)-rx) * ((T)(1.0)-ry) * rz;
m_pBin[(iz+1) * m_iResXY + iy * m_iRes[0] + ix + 1] += rx * ((T)(1.0)-ry) * rz;
m_pBin[(iz+1) * m_iResXY + (iy+1) * m_iRes[0] + ix ] += ((T)(1.0)-rx) * ry * rz;
m_pBin[(iz+1) * m_iResXY + (iy+1) * m_iRes[0] + ix + 1] += rx * ry * rz;
BXOUT;
}
void AddToBin_Sphere(double x, double y, double z, double r)
{
BXIN;
int ix, iy, iz, k, kq, zx, zy, zz, zzq, zyq, tz, ty;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
ix = (int)floor((x-m_fMinVal[0])*m_fFac[0]);
iy = (int)floor((y-m_fMinVal[1])*m_fFac[1]);
iz = (int)floor((z-m_fMinVal[2])*m_fFac[2]);
k = (int)ceil(r * m_fFac[0] - 1.0);
kq = k * k;
for (zz=-k;zz<=k;zz++)
{
if (zz+iz < 0)
continue;
if (zz+iz >= m_iRes[2])
continue;
tz = (zz+iz) * m_iResXY;
zzq = zz * zz;
for (zy=-k;zy<=k;zy++)
{
if (zy+iy < 0)
continue;
if (zy+iy >= m_iRes[1])
continue;
ty = ix + tz + (zy+iy) * m_iRes[0];
zyq = zzq + zy*zy;
for (zx=-k;zx<=k;zx++)
{
if (zx+ix < 0)
continue;
if (zx+ix >= m_iRes[0])
continue;
if (zyq + zx*zx <= kq)
m_pBin[ty+zx]++;
}
}
}
BXOUT;
}
void AddToBin_SphereWrap(double x, double y, double z, double r)
{
BXIN;
int ix, iy, iz, k, kq, zx, zy, zz, zzq, zyq, tz, ty;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
ix = (int)floor((x-m_fMinVal[0])*m_fFac[0]);
iy = (int)floor((y-m_fMinVal[1])*m_fFac[1]);
iz = (int)floor((z-m_fMinVal[2])*m_fFac[2]);
k = (int)ceil(r * m_fFac[0] - 1.0);
kq = k * k;
for (zz=-k;zz<=k;zz++)
{
if (zz+iz < 0)
tz = (zz+iz+m_iRes[2]) * m_iResXY;
else if (zz+iz >= m_iRes[2])
tz = (zz+iz-m_iRes[2]) * m_iResXY;
else tz = (zz+iz) * m_iResXY;
zzq = zz * zz;
for (zy=-k;zy<=k;zy++)
{
if (zy+iy < 0)
ty = tz + (zy+iy+m_iRes[1]) * m_iRes[0];
else if (zy+iy >= m_iRes[1])
ty = tz + (zy+iy-m_iRes[1]) * m_iRes[0];
else ty = tz + (zy+iy) * m_iRes[0];
zyq = zzq + zy*zy;
for (zx=-k;zx<=k;zx++)
{
if (zyq + zx*zx > kq)
continue;
if (zx+ix < 0)
m_pBin[ty+ix+zx+m_iRes[0]]++;
else if (zx+ix >= m_iRes[0])
m_pBin[ty+ix+zx-m_iRes[0]]++;
else m_pBin[ty+ix+zx]++;
}
}
}
BXOUT;
}
void AddToBin_IntZ(double x, double y, int z)
{
BXIN;
double rx, ry;
int ix, iy;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]))
{
m_fSkipEntries++;
BXOUT;
return;
}
m_fBinEntries++;
rx = (x-m_fMinVal[0])*m_fFac[0] - 0.5;
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
ry = (y-m_fMinVal[1])*m_fFac[1] - 0.5;
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
m_pBin[z * m_iResXY + iy * m_iRes[0] + ix ] += (1.0-rx) * (1.0-ry);
m_pBin[z * m_iResXY + iy * m_iRes[0] + ix + 1] += rx * (1.0-ry);
m_pBin[z * m_iResXY + (iy+1) * m_iRes[0] + ix ] += (1.0-rx) * ry ;
m_pBin[z * m_iResXY + (iy+1) * m_iRes[0] + ix + 1] += rx * ry ;
BXOUT;
}
T GetValue(double x, double y, double z)
{
BXIN;
T rx, ry, rz, r;
int ix, iy, iz;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
{
BXOUT;
return 0;
}
rx = (T)((x-m_fMinVal[0])*m_fFac[0] - 0.5);
ix = (int)floor(rx);
if (ix < 0)
{
ix = 0;
rx = 0;
} else if (ix > m_iRes[0]-2)
{
ix = m_iRes[0]-2;
rx = 1.0;
} else
rx -= ix;
ry = (T)((y-m_fMinVal[1])*m_fFac[1] - 0.5);
iy = (int)floor(ry);
if (iy < 0)
{
iy = 0;
ry = 0;
} else if (iy > m_iRes[1]-2)
{
iy = m_iRes[1]-2;
ry = 1.0;
} else
ry -= iy;
rz = (T)((z-m_fMinVal[2])*m_fFac[2] - 0.5);
iz = (int)floor(rz);
if (iz < 0)
{
iz = 0;
rz = 0;
} else if (iz > m_iRes[2]-2)
{
iz = m_iRes[2]-2;
rz = 1.0;
} else
rz -= iz;
r = m_pBin[ iz * m_iResXY + iy * m_iRes[0] + ix ] * ((T)(1.0)-rx) * ((T)(1.0)-ry) * ((T)(1.0)-rz);
r += m_pBin[ iz * m_iResXY + iy * m_iRes[0] + ix + 1] * rx * ((T)(1.0)-ry) * ((T)(1.0)-rz);
r += m_pBin[ iz * m_iResXY + (iy+1) * m_iRes[0] + ix ] * ((T)(1.0)-rx) * ry * ((T)(1.0)-rz);
r += m_pBin[ iz * m_iResXY + (iy+1) * m_iRes[0] + ix + 1] * rx * ry * ((T)(1.0)-rz);
r += m_pBin[(iz+1) * m_iResXY + iy * m_iRes[0] + ix ] * ((T)(1.0)-rx) * ((T)(1.0)-ry) * rz;
r += m_pBin[(iz+1) * m_iResXY + iy * m_iRes[0] + ix + 1] * rx * ((T)(1.0)-ry) * rz;
r += m_pBin[(iz+1) * m_iResXY + (iy+1) * m_iRes[0] + ix ] * ((T)(1.0)-rx) * ry * rz;
r += m_pBin[(iz+1) * m_iResXY + (iy+1) * m_iRes[0] + ix + 1] * rx * ry * rz;
BXOUT;
return r;
}
bool IsZero(double x, double y, double z)
{
double rx, ry, rz;
int ix, iy, iz;
if ((x < m_fMinVal[0]) || (x > m_fMaxVal[0]) || (y < m_fMinVal[1]) || (y > m_fMaxVal[1]) || (z < m_fMinVal[2]) || (z > m_fMaxVal[2]))
return false;
rx = (x-m_fMinVal[0])*m_fFac[0] - 0.5;
ix = (int)floor(rx);
if (ix < 0)
ix = 0;
else if (ix > m_iRes[0]-2)
ix = m_iRes[0]-2;
ry = (y-m_fMinVal[1])*m_fFac[1] - 0.5;
iy = (int)floor(ry);
if (iy < 0)
iy = 0;
else if (iy > m_iRes[1]-2)
iy = m_iRes[1]-2;
rz = (z-m_fMinVal[2])*m_fFac[2] - 0.5;
iz = (int)floor(rz);
if (iz < 0)
iz = 0;
else if (iz > m_iRes[2]-2)
iz = m_iRes[2]-2;
if (m_pBin[ iz * m_iResXY + iy * m_iRes[0] + ix ] != 0) return false;
if (m_pBin[ iz * m_iResXY + iy * m_iRes[0] + ix + 1] != 0) return false;
if (m_pBin[ iz * m_iResXY + (iy+1) * m_iRes[0] + ix ] != 0) return false;
if (m_pBin[ iz * m_iResXY + (iy+1) * m_iRes[0] + ix + 1] != 0) return false;
if (m_pBin[(iz+1) * m_iResXY + iy * m_iRes[0] + ix ] != 0) return false;
if (m_pBin[(iz+1) * m_iResXY + iy * m_iRes[0] + ix + 1] != 0) return false;
if (m_pBin[(iz+1) * m_iResXY + (iy+1) * m_iRes[0] + ix ] != 0) return false;
if (m_pBin[(iz+1) * m_iResXY + (iy+1) * m_iRes[0] + ix + 1] != 0) return false;
return true;
}
T GetValue(const CxDVector3 &vec)
{
return GetValue(vec[0],vec[1],vec[2]);
}
void SetLabelX(const char *s)
{
if (m_sLabelX != NULL)
delete[] m_sLabelX;
try { m_sLabelX = new char[strlen(s)+1]; } catch(...) { m_sLabelX = NULL; }
if (m_sLabelX == NULL) NewException((double)(strlen(s)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelX,s);
}
void SetLabelY(const char *s)
{
if (m_sLabelY != NULL)
delete[] m_sLabelY;
try { m_sLabelY = new char[strlen(s)+1]; } catch(...) { m_sLabelY = NULL; }
if (m_sLabelY == NULL) NewException((double)(strlen(s)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelY,s);
}
void SetLabelZ(const char *s)
{
if (m_sLabelZ != NULL)
delete[] m_sLabelZ;
try { m_sLabelZ = new char[strlen(s)+1]; } catch(...) { m_sLabelZ = NULL; }
if (m_sLabelZ == NULL) NewException((double)(strlen(s)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelZ,s);
}
void WritePLT(const char *s1, const char *s2, const char *s3, bool sdf)
{
BTIN;
FILE *a;
unsigned int i;
int x, y, z;
float ff;
// char buf[256];
CxString buf;
// strcpy(buf,s1);
// strcat(buf,s2);
// strcat(buf,s3);
buf.strcpy(s1);
buf.strcat(s2);
buf.strcat(s3);
a = OpenFileWrite(buf,false);
i = 3;
fwrite(&i,4,1,a);
i = 50;
fwrite(&i,4,1,a);
if (sdf)
{
i = m_iRes[0];
fwrite(&i,4,1,a);
i = m_iRes[1];
fwrite(&i,4,1,a);
i = m_iRes[2];
fwrite(&i,4,1,a);
ff = (float)(m_fMinVal[0]/100.0);
fwrite(&ff,4,1,a);
ff = (float)(m_fMaxVal[0]/100.0);
fwrite(&ff,4,1,a);
ff = (float)(m_fMinVal[1]/100.0);
fwrite(&ff,4,1,a);
ff = (float)(m_fMaxVal[1]/100.0);
fwrite(&ff,4,1,a);
ff = (float)(m_fMinVal[2]/100.0);
fwrite(&ff,4,1,a);
ff = (float)(m_fMaxVal[2]/100.0);
fwrite(&ff,4,1,a);
} else
{
i = m_iRes[0]+2;
fwrite(&i,4,1,a);
i = m_iRes[1]+2;
fwrite(&i,4,1,a);
i = m_iRes[2]+2;
fwrite(&i,4,1,a);
ff = (float)0;
fwrite(&ff,4,1,a);
ff = (float)100;
fwrite(&ff,4,1,a);
ff = (float)0;
fwrite(&ff,4,1,a);
ff = (float)100;
fwrite(&ff,4,1,a);
ff = (float)0;
fwrite(&ff,4,1,a);
ff = (float)100;
fwrite(&ff,4,1,a);
}
if (sdf)
{
for (z=0;z m_fMaxEntry)
m_fMaxEntry = m_pBin[z*m_iResXY+z2*m_iRes[0]+z3];
if (m_pBin[z*m_iResXY+z2*m_iRes[0]+z3] < m_fMinEntry)
m_fMinEntry = m_pBin[z*m_iResXY+z2*m_iRes[0]+z3];
}
}
}
if (fabs(m_fMinEntry) > m_fMaxEntry)
a = fabs(m_fMinEntry);
else
a = m_fMaxEntry;
m_fEps = nextafter(a,2.0*a) - a;
BTOUT;
}
void NormalizeBin(T mi, T ma)
{
BTIN;
int z;
T tmi, tma, d, td;
tmi = (T)99999999.0;
tma = (T)0.0;
for (z=0;z tma)
tma = m_pBin[z];
}
if (tma-tmi < (T)1E-20)
tma += (T)0.00001;
d = ma - mi;
td = tma - tmi;
for (z=0;z= m_iRes[2]))
continue;
tz = (z-pz)*(z-pz);
iz = pz*m_iResXY;
for (py=y-n;py<=y+n;py++)
{
if ((py < 0) || (py >= m_iRes[1]))
continue;
ty = (y-py)*(y-py);
iy = py*m_iRes[0];
for (px=x-n;px<=x+n;px++)
{
if ((px < 0) || (px >= m_iRes[0]))
continue;
r = 1.0/((x-px)*(x-px)+ty+tz+1.0);
a += m_pBin[iz+iy+px]*r;
b += r;
}
}
}
tbuf[z*m_iResXY+y*m_iRes[0]+x] = a / b;
}
}
}
delete[] m_pBin;
m_pBin = tbuf;
mprintf("Done.\n");
BTOUT;
}
void CopyFrom(C3DF *p)
{
BTIN;
int z;
m_fBinEntries = p->m_fBinEntries;
m_fSkipEntries = p->m_fSkipEntries;
m_iRes[0] = p->m_iRes[0];
m_iRes[1] = p->m_iRes[1];
m_iRes[2] = p->m_iRes[2];
m_iResXY = p->m_iResXY;
m_iHistogramRes = p->m_iHistogramRes;
m_fMinVal[0] = p->m_fMinVal[0];
m_fMaxVal[0] = p->m_fMaxVal[0];
m_fMinVal[1] = p->m_fMinVal[1];
m_fMaxVal[1] = p->m_fMaxVal[1];
m_fMinVal[2] = p->m_fMinVal[2];
m_fMaxVal[2] = p->m_fMaxVal[2];
m_fFac[0] = p->m_fFac[0];
m_fFac[1] = p->m_fFac[1];
m_fFac[2] = p->m_fFac[2];
m_fMinEntry = p->m_fMinEntry;
m_fMaxEntry = p->m_fMaxEntry;
if (m_pBin != NULL)
delete[] m_pBin;
try { m_pBin = new T[m_iRes[0]*m_iRes[1]*m_iRes[2]]; } catch(...) { m_pBin = NULL; }
if (m_pBin == NULL) NewException((double)m_iRes[0]*m_iRes[1]*m_iRes[2]*sizeof(T),__FILE__,__LINE__,__PRETTY_FUNCTION__);
// for (z=0;zm_pBin[z];
memcpy(m_pBin,p->m_pBin,sizeof(T)*m_iRes[0]*m_iRes[1]*m_iRes[2]);
if (m_iHistogramRes != 0)
{
try { m_pHistogram = new double[m_iHistogramRes]; } catch(...) { m_pHistogram = NULL; }
if (m_pHistogram == NULL) NewException((double)m_iHistogramRes*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (z=0;zm_pHistogram[z];
}
if (p->m_sLabelX != NULL)
{
try { m_sLabelX = new char[strlen(p->m_sLabelX)+1]; } catch(...) { m_sLabelX = NULL; }
if (m_sLabelX == NULL) NewException((double)(strlen(p->m_sLabelX)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelX,p->m_sLabelX);
}
if (p->m_sLabelY != NULL)
{
try { m_sLabelY = new char[strlen(p->m_sLabelY)+1]; } catch(...) { m_sLabelY = NULL; }
if (m_sLabelY == NULL) NewException((double)(strlen(p->m_sLabelY)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelY,p->m_sLabelY);
}
if (p->m_sLabelZ != NULL)
{
try { m_sLabelZ = new char[strlen(p->m_sLabelZ)+1]; } catch(...) { m_sLabelZ = NULL; }
if (m_sLabelZ == NULL) NewException((double)(strlen(p->m_sLabelZ)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sLabelZ,p->m_sLabelZ);
}
BTOUT;
}
void WriteCube(const char *prefix, const char *name, const char *suffix, bool sdf)
{
BTIN;
FILE *a;
int x, y, z;
// char buf[256];
CxString buf;
// strcpy(buf,prefix);
// strcat(buf,name);
// strcat(buf,suffix);
buf.strcpy(prefix);
buf.strcat(name);
buf.strcat(suffix);
a = OpenFileWrite(buf,true);
mfprintf(a,"GAUSSIAN CUBE FILE; written by TRAVIS\n");
mfprintf(a,"OUTER LOOP: X, MIDDLE LOOP: Y, INNER LOOP: Z\n");
if (sdf)
{
mfprintf(a,"1 %f %f %f\n",(m_fMinVal[0]+0.5*(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0])/100.0/0.529177249,(m_fMinVal[1]+0.5*(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1])/100.0/0.529177,(m_fMinVal[2]+0.5*(m_fMaxVal[2]-m_fMinVal[2])/m_iRes[2])/100.0/0.529177);
mfprintf(a,"%d %f 0.000 0.000\n",m_iRes[0],(m_fMaxVal[0]-m_fMinVal[0])/m_iRes[0]/100.0/0.529177249);
mfprintf(a,"%d 0.000 %f 0.000\n",m_iRes[1],(m_fMaxVal[1]-m_fMinVal[1])/m_iRes[1]/100.0/0.529177249);
mfprintf(a,"%d 0.000 0.000 %f\n",m_iRes[2],(m_fMaxVal[2]-m_fMinVal[2])/m_iRes[2]/100.0/0.529177249);
} else
{
mfprintf(a,"1 0.0 0.0 0.0\n");
mfprintf(a,"%d %f 0.000 0.000\n",m_iRes[0]+2,100.0/m_iRes[0]/0.529177249);
mfprintf(a,"%d 0.000 %f 0.000\n",m_iRes[1]+2,100.0/m_iRes[1]/0.529177249);
mfprintf(a,"%d 0.000 0.000 %f\n",m_iRes[2]+2,100.0/m_iRes[2]/0.529177249);
}
mfprintf(a,"0 0 0 0 0\n");
if (sdf)
{
for (x=0;x= rz)
{
iz = 0;
iy++;
if (iy >= ry)
{
iy = 0;
ix++;
if (verbose)
if (fmod(ix,rx/60.0) < 1.0)
mprintf(WHITE,"#");
}
}
if (ix == rx)
break;
p++;
goto _next;
}
if (feof(a))
{
eprintf("C3DF::ReadCube(): Error: Unexpected end of cube file stream.\n");
abort();
}
if (verbose)
{
mprintf(WHITE,"]");
mprintf(" done.\n");
mprintf(" Sum is %f, equals %f electrons.\n",su,su*(g_fBoxX/100.0/0.529177249/rx)*(g_fBoxY/100.0/0.529177249/ry)*(g_fBoxZ/100.0/0.529177249/rz));
}
BTOUT;
}
void ReadCubeData(FILE *a, bool verbose)
{
BTIN;
int ix, iy, iz;
char buf[256], *p, *q;
T su, tf;
if (verbose)
{
mprintf(" Reading cube file (resolution %d x %d x %d)...\n",m_iRes[0],m_iRes[1],m_iRes[2]);
mprintf(WHITE," [");
}
ix = 0;
iy = 0;
iz = 0;
su = 0;
while (!feof(a))
{
_read:
(void)fgets(buf,256,a);
if (feof(a))
break;
p = buf;
_next:
while (*p == ' ')
p++;
q = p;
while ((*p != ' ') && (*p != '\n') && (*p != 0))
p++;
if ((p-q) < 8)
goto _read;
*p = 0;
#ifdef FAST_ATOF
tf = (T)fast_atof(q);
#else
tf = (T)atof(q);
#endif
m_pBin[iz*m_iResXY+iy*m_iRes[0]+ix] = tf;
if (verbose)
su += tf;
iz += g_iCubeZStride;
if (iz >= m_iRes[2] + g_iCubeZMismatch) {
iz = 0;
iy += g_iCubeYStride;
if (iy >= m_iRes[1] + g_iCubeYMismatch) {
iy = 0;
ix += g_iCubeXStride;
if (verbose)
if (fmod(ix,m_iRes[0]/60.0) < 1.0)
mprintf(WHITE,"#");
}
}
if (ix == m_iRes[0] + g_iCubeXMismatch)
break;
// iz++;
// if (iz >= m_iRes[2])
// {
// iz = 0;
// iy++;
// if (iy >= m_iRes[1])
// {
// iy = 0;
// ix++;
// if (verbose)
// if (fmod(ix,m_iRes[0]/60.0) < 1.0)
// mprintf(WHITE,"#");
// }
// }
//
// if (ix == m_iRes[0])
// break;
p++;
goto _next;
}
if (g_iCubeXStride > 1) {
int i;
for (i = 0; i < m_iRes[2]; i += g_iCubeZStride) {
int j;
for (j = 0; j < m_iRes[1]; j += g_iCubeYStride) {
int k;
for (k = 0; k < m_iRes[0] - g_iCubeXStride; k += g_iCubeXStride) {
int l;
for (l = 1; l < g_iCubeXStride; l++) {
m_pBin[i*m_iResXY + j*m_iRes[0] + k + l] = m_pBin[i*m_iResXY + j*m_iRes[0] + k] * (g_iCubeXStride - l) / g_iCubeXStride + m_pBin[i*m_iResXY + j*m_iRes[0] + k + g_iCubeXStride] * l / g_iCubeXStride;
}
}
for (k = 1; k < g_iCubeXStride - g_iCubeXMismatch; k++) {
m_pBin[i*m_iResXY + j*m_iRes[0] + m_iRes[0] - g_iCubeXStride + g_iCubeXMismatch + k] = m_pBin[i*m_iResXY + j*m_iRes[0] + m_iRes[0] - g_iCubeXStride + g_iCubeXMismatch] * (g_iCubeXStride - g_iCubeXMismatch - k) / (g_iCubeXStride - g_iCubeXMismatch) + m_pBin[i*m_iResXY + j*m_iRes[0]] * k / (g_iCubeXStride - g_iCubeXMismatch);
}
}
}
}
if (g_iCubeYStride > 1) {
int i;
for (i = 0; i < m_iRes[2]; i += g_iCubeZStride) {
int j;
for (j = 0; j < m_iRes[0]; j++) {
int k;
for (k = 0; k < m_iRes[1] - g_iCubeYStride; k += g_iCubeYStride) {
int l;
for (l = 1; l < g_iCubeYStride; l++) {
m_pBin[i*m_iResXY + (k + l)*m_iRes[0] + j] = m_pBin[i*m_iResXY + k*m_iRes[0] + j] * (g_iCubeYStride - l) / g_iCubeYStride + m_pBin[i*m_iResXY + (k + g_iCubeYStride)*m_iRes[0] + j] * l / g_iCubeYStride;
}
}
for (k = 1; k < g_iCubeYStride - g_iCubeYMismatch; k++) {
m_pBin[i*m_iResXY + (m_iRes[1] - g_iCubeYStride + g_iCubeYMismatch + k)*m_iRes[0] + j] = m_pBin[i*m_iResXY + (m_iRes[1] - g_iCubeYStride + g_iCubeYMismatch)*m_iRes[0] + j] * (g_iCubeYStride - g_iCubeYMismatch - k) / (g_iCubeYStride - g_iCubeYMismatch) + m_pBin[i*m_iResXY + j] * k / (g_iCubeYStride - g_iCubeYMismatch);
}
}
}
}
if (g_iCubeZStride > 1) {
int i;
for (i = 0; i < m_iRes[1]; i++) {
int j;
for (j = 0; j < m_iRes[0]; j++) {
int k;
for (k = 0; k < m_iRes[2] - g_iCubeZStride; k += g_iCubeZStride) {
int l;
for (l = 1; l < g_iCubeZStride; l++) {
m_pBin[(k + l)*m_iResXY + i*m_iRes[0] + j] = m_pBin[k*m_iResXY + i*m_iRes[0] + j] * (g_iCubeZStride - l) / g_iCubeZStride + m_pBin[(k + g_iCubeZStride)*m_iResXY + i*m_iRes[0] + j] * l / g_iCubeZStride;
}
}
for (k = 1; k < g_iCubeZStride - g_iCubeZMismatch; k++) {
m_pBin[(m_iRes[2] - g_iCubeZStride + g_iCubeZMismatch + k)*m_iResXY + i*m_iRes[0] + j] = m_pBin[(m_iRes[2] - g_iCubeZStride + g_iCubeZMismatch)*m_iResXY + i*m_iRes[0] + j] * (g_iCubeZStride - g_iCubeZMismatch - k) / (g_iCubeZStride - g_iCubeZMismatch) + m_pBin[i*m_iRes[0] + j] * k / (g_iCubeZStride - g_iCubeZMismatch);
}
}
}
}
if (feof(a))
{
eprintf("C3DF::ReadCubeData(): Error: Unexpected end of cube file stream.\n");
abort();
}
if (verbose)
{
mprintf(WHITE,"]");
mprintf(" done.\n");
// mprintf(" Sum is %f, equals %f electrons.\n",su,su*(g_fBoxX/100.0/0.529177249/m_iRes[0])*(g_fBoxY/100.0/0.529177249/m_iRes[1])*(g_fBoxZ/100.0/0.529177249/m_iRes[2]));
mprintf(" Sum is %f, equals %f electrons.\n",su,su*g_fCubeXStep*g_fCubeYStep*g_fCubeZStep);
}
BTOUT;
}
void ReadCubeData(CBQBCubeFrame *cfr, bool verbose)
{
BTIN;
int ix, iy, iz;
T su;
if (verbose)
mprintf(">>> ReadCubeData(CBQBCubeFrame*) >>>\n");
if (verbose)
{
mprintf(" Reading cube file (resolution %d x %d x %d)...\n",m_iRes[0],m_iRes[1],m_iRes[2]);
mprintf(WHITE," [");
}
ix = 0;
iy = 0;
iz = 0;
su = 0;
while (true)
{
_next:
m_pBin[iz*m_iResXY+iy*m_iRes[0]+ix] = cfr->m_faBin[iz+iy*m_iRes[2]+ix*m_iRes[1]*m_iRes[2]];
if (verbose)
su += cfr->m_faBin[iz*m_iResXY+iy*m_iRes[0]+ix];
iz += g_iCubeZStride;
if (iz >= m_iRes[2] + g_iCubeZMismatch) {
iz = 0;
iy += g_iCubeYStride;
if (iy >= m_iRes[1] + g_iCubeYMismatch) {
iy = 0;
ix += g_iCubeXStride;
if (verbose)
if (fmod(ix,m_iRes[0]/60.0) < 1.0)
mprintf(WHITE,"#");
}
}
if (ix == m_iRes[0] + g_iCubeXMismatch)
break;
goto _next;
}
if (g_iCubeXStride > 1) {
int i;
for (i = 0; i < m_iRes[2]; i += g_iCubeZStride) {
int j;
for (j = 0; j < m_iRes[1]; j += g_iCubeYStride) {
int k;
for (k = 0; k < m_iRes[0] - g_iCubeXStride; k += g_iCubeXStride) {
int l;
for (l = 1; l < g_iCubeXStride; l++) {
m_pBin[i*m_iResXY + j*m_iRes[0] + k + l] = m_pBin[i*m_iResXY + j*m_iRes[0] + k] * (g_iCubeXStride - l) / g_iCubeXStride + m_pBin[i*m_iResXY + j*m_iRes[0] + k + g_iCubeXStride] * l / g_iCubeXStride;
}
}
for (k = 1; k < g_iCubeXStride - g_iCubeXMismatch; k++) {
m_pBin[i*m_iResXY + j*m_iRes[0] + m_iRes[0] - g_iCubeXStride + g_iCubeXMismatch + k] = m_pBin[i*m_iResXY + j*m_iRes[0] + m_iRes[0] - g_iCubeXStride + g_iCubeXMismatch] * (g_iCubeXStride - g_iCubeXMismatch - k) / (g_iCubeXStride - g_iCubeXMismatch) + m_pBin[i*m_iResXY + j*m_iRes[0]] * k / (g_iCubeXStride - g_iCubeXMismatch);
}
}
}
}
if (g_iCubeYStride > 1) {
int i;
for (i = 0; i < m_iRes[2]; i += g_iCubeZStride) {
int j;
for (j = 0; j < m_iRes[0]; j++) {
int k;
for (k = 0; k < m_iRes[1] - g_iCubeYStride; k += g_iCubeYStride) {
int l;
for (l = 1; l < g_iCubeYStride; l++) {
m_pBin[i*m_iResXY + (k + l)*m_iRes[0] + j] = m_pBin[i*m_iResXY + k*m_iRes[0] + j] * (g_iCubeYStride - l) / g_iCubeYStride + m_pBin[i*m_iResXY + (k + g_iCubeYStride)*m_iRes[0] + j] * l / g_iCubeYStride;
}
}
for (k = 1; k < g_iCubeYStride - g_iCubeYMismatch; k++) {
m_pBin[i*m_iResXY + (m_iRes[1] - g_iCubeYStride + g_iCubeYMismatch + k)*m_iRes[0] + j] = m_pBin[i*m_iResXY + (m_iRes[1] - g_iCubeYStride + g_iCubeYMismatch)*m_iRes[0] + j] * (g_iCubeYStride - g_iCubeYMismatch - k) / (g_iCubeYStride - g_iCubeYMismatch) + m_pBin[i*m_iResXY + j] * k / (g_iCubeYStride - g_iCubeYMismatch);
}
}
}
}
if (g_iCubeZStride > 1) {
int i;
for (i = 0; i < m_iRes[1]; i++) {
int j;
for (j = 0; j < m_iRes[0]; j++) {
int k;
for (k = 0; k < m_iRes[2] - g_iCubeZStride; k += g_iCubeZStride) {
int l;
for (l = 1; l < g_iCubeZStride; l++) {
m_pBin[(k + l)*m_iResXY + i*m_iRes[0] + j] = m_pBin[k*m_iResXY + i*m_iRes[0] + j] * (g_iCubeZStride - l) / g_iCubeZStride + m_pBin[(k + g_iCubeZStride)*m_iResXY + i*m_iRes[0] + j] * l / g_iCubeZStride;
}
}
for (k = 1; k < g_iCubeZStride - g_iCubeZMismatch; k++) {
m_pBin[(m_iRes[2] - g_iCubeZStride + g_iCubeZMismatch + k)*m_iResXY + i*m_iRes[0] + j] = m_pBin[(m_iRes[2] - g_iCubeZStride + g_iCubeZMismatch)*m_iResXY + i*m_iRes[0] + j] * (g_iCubeZStride - g_iCubeZMismatch - k) / (g_iCubeZStride - g_iCubeZMismatch) + m_pBin[i*m_iRes[0] + j] * k / (g_iCubeZStride - g_iCubeZMismatch);
}
}
}
}
if (verbose)
{
mprintf(WHITE,"]");
mprintf(" done.\n");
// mprintf(" Sum is %f, equals %f electrons.\n",su,su*(g_fBoxX/100.0/0.529177249/m_iRes[0])*(g_fBoxY/100.0/0.529177249/m_iRes[1])*(g_fBoxZ/100.0/0.529177249/m_iRes[2]));
mprintf(" Sum is %f, equals %f electrons.\n",su,su*g_fCubeXStep*g_fCubeYStep*g_fCubeZStep);
}
if (verbose)
mprintf("<<< ReadCubeData(CBQBCubeFrame*) <<<\n");
BTOUT;
}
void ReadCube(CxMemFile *mf, bool verbose, bool create)
{
BTIN;
int ac, rx, ry, rz, z, ix, iy, iz;
char buf[256], *p, *q;
T su, tf;
mf->Seek(0);
(void)mf->fgets(buf,256);
(void)mf->fgets(buf,256);
(void)mf->fgets(buf,256);
p = buf;
while (*p == ' ')
p++;
while (*p != ' ')
p++;
*p = 0;
ac = atoi(buf);
(void)mf->fgets(buf,256);
p = buf;
while (*p == ' ')
p++;
while (*p != ' ')
p++;
*p = 0;
rx = atoi(buf);
(void)mf->fgets(buf,256);
p = buf;
while (*p == ' ')
p++;
while (*p != ' ')
p++;
*p = 0;
ry = atoi(buf);
(void)mf->fgets(buf,256);
p = buf;
while (*p == ' ')
p++;
while (*p != ' ')
p++;
*p = 0;
rz = atoi(buf);
for (z=0;zfgets(buf,256);
if (mf->Eof())
{
eprintf("C3DF::ReadCube(): Error: Unexpected end of cube file stream.\n");
abort();
}
if (create)
{
m_iRes[0] = rx;
m_iRes[1] = ry;
m_iRes[2] = rz;
m_fMinVal[0] = 0;
m_fMaxVal[0] = g_fBoxX;
m_fMinVal[1] = 0;
m_fMaxVal[1] = g_fBoxY;
m_fMinVal[2] = 0;
m_fMaxVal[2] = g_fBoxZ;
Create();
mprintf("\n");
} else
{
if ((rx != m_iRes[0]) || (ry != m_iRes[1]) || (rz != m_iRes[2]))
{
eprintf("C3DF::ReadCube(): Error: Cube file dimension mismatch (%d-%d, %d-%d, %d-%d).\n",rx,m_iRes[0],ry,m_iRes[1],rz,m_iRes[2]);
abort();
}
for (z=0;zEof())
{
_read:
(void)mf->fgets(buf,256);
if (mf->Eof())
break;
p = buf;
_next:
while (*p == ' ')
p++;
q = p;
while ((*p != ' ') && (*p != '\n') && (*p != 0))
p++;
if ((p-q) < 8)
goto _read;
*p = 0;
#ifdef FAST_ATOF
tf = (T)fast_atof(q);
#else
tf = (T)atof(q);
#endif
m_pBin[iz*m_iResXY+iy*m_iRes[0]+ix] = tf;
if (verbose)
su += tf;
iz++;
if (iz >= rz)
{
iz = 0;
iy++;
if (iy >= ry)
{
iy = 0;
ix++;
if (verbose)
if (fmod(ix,rx/60.0) < 1.0)
mprintf(WHITE,"#");
}
}
if (ix == rx)
break;
p++;
goto _next;
}
if (mf->Eof())
{
eprintf("C3DF::ReadCube(): Error: Unexpected end of cube file stream.\n");
abort();
}
if (verbose)
{
mprintf(WHITE,"]");
mprintf(" done.\n");
mprintf(" Sum is %f, equals %f electrons.\n",su,su*(g_fBoxX/100.0/0.529177249/rx)*(g_fBoxY/100.0/0.529177249/ry)*(g_fBoxZ/100.0/0.529177249/rz));
}
BTOUT;
}
void ReadCubeData(CxMemFile *mf, bool verbose)
{
BTIN;
int ix, iy, iz;
char buf[256], *p, *q;
T su, tf;
if (verbose)
{
mprintf(" Reading cube file (resolution %d x %d x %d)...\n",m_iRes[0],m_iRes[1],m_iRes[2]);
mprintf(WHITE," [");
}
ix = 0;
iy = 0;
iz = 0;
su = 0;
while (!mf->Eof())
{
_read:
(void)mf->fgets(buf,256);
if (mf->Eof())
break;
p = buf;
_next:
while (*p == ' ')
p++;
q = p;
while ((*p != ' ') && (*p != '\n') && (*p != 0))
p++;
if ((p-q) < 8)
goto _read;
*p = 0;
#ifdef FAST_ATOF
tf = (T)fast_atof(q);
#else
tf = (T)atof(q);
#endif
m_pBin[iz*m_iResXY+iy*m_iRes[0]+ix] = tf;
if (verbose)
su += tf;
iz += g_iCubeZStride;
if (iz >= m_iRes[2] + g_iCubeZMismatch) {
iz = 0;
iy += g_iCubeYStride;
if (iy >= m_iRes[1] + g_iCubeYMismatch) {
iy = 0;
ix += g_iCubeXStride;
if (verbose)
if (fmod(ix,m_iRes[0]/60.0) < 1.0)
mprintf(WHITE,"#");
}
}
if (ix == m_iRes[0] + g_iCubeXMismatch)
break;
// iz++;
// if (iz >= m_iRes[2])
// {
// iz = 0;
// iy++;
// if (iy >= m_iRes[1])
// {
// iy = 0;
// ix++;
// if (verbose)
// if (fmod(ix,m_iRes[0]/60.0) < 1.0)
// mprintf(WHITE,"#");
// }
// }
//
// if (ix == m_iRes[0])
// break;
p++;
goto _next;
}
if (g_iCubeXStride > 1) {
int i;
for (i = 0; i < m_iRes[2]; i += g_iCubeZStride) {
int j;
for (j = 0; j < m_iRes[1]; j += g_iCubeYStride) {
int k;
for (k = 0; k < m_iRes[0] - g_iCubeXStride; k += g_iCubeXStride) {
int l;
for (l = 1; l < g_iCubeXStride; l++) {
m_pBin[i*m_iResXY + j*m_iRes[0] + k + l] = m_pBin[i*m_iResXY + j*m_iRes[0] + k] * (g_iCubeXStride - l) / g_iCubeXStride + m_pBin[i*m_iResXY + j*m_iRes[0] + k + g_iCubeXStride] * l / g_iCubeXStride;
}
}
for (k = 1; k < g_iCubeXStride - g_iCubeXMismatch; k++) {
m_pBin[i*m_iResXY + j*m_iRes[0] + m_iRes[0] - g_iCubeXStride + g_iCubeXMismatch + k] = m_pBin[i*m_iResXY + j*m_iRes[0] + m_iRes[0] - g_iCubeXStride + g_iCubeXMismatch] * (g_iCubeXStride - g_iCubeXMismatch - k) / (g_iCubeXStride - g_iCubeXMismatch) + m_pBin[i*m_iResXY + j*m_iRes[0]] * k / (g_iCubeXStride - g_iCubeXMismatch);
}
}
}
}
if (g_iCubeYStride > 1) {
int i;
for (i = 0; i < m_iRes[2]; i += g_iCubeZStride) {
int j;
for (j = 0; j < m_iRes[0]; j++) {
int k;
for (k = 0; k < m_iRes[1] - g_iCubeYStride; k += g_iCubeYStride) {
int l;
for (l = 1; l < g_iCubeYStride; l++) {
m_pBin[i*m_iResXY + (k + l)*m_iRes[0] + j] = m_pBin[i*m_iResXY + k*m_iRes[0] + j] * (g_iCubeYStride - l) / g_iCubeYStride + m_pBin[i*m_iResXY + (k + g_iCubeYStride)*m_iRes[0] + j] * l / g_iCubeYStride;
}
}
for (k = 1; k < g_iCubeYStride - g_iCubeYMismatch; k++) {
m_pBin[i*m_iResXY + (m_iRes[1] - g_iCubeYStride + g_iCubeYMismatch + k)*m_iRes[0] + j] = m_pBin[i*m_iResXY + (m_iRes[1] - g_iCubeYStride + g_iCubeYMismatch)*m_iRes[0] + j] * (g_iCubeYStride - g_iCubeYMismatch - k) / (g_iCubeYStride - g_iCubeYMismatch) + m_pBin[i*m_iResXY + j] * k / (g_iCubeYStride - g_iCubeYMismatch);
}
}
}
}
if (g_iCubeZStride > 1) {
int i;
for (i = 0; i < m_iRes[1]; i++) {
int j;
for (j = 0; j < m_iRes[0]; j++) {
int k;
for (k = 0; k < m_iRes[2] - g_iCubeZStride; k += g_iCubeZStride) {
int l;
for (l = 1; l < g_iCubeZStride; l++) {
m_pBin[(k + l)*m_iResXY + i*m_iRes[0] + j] = m_pBin[k*m_iResXY + i*m_iRes[0] + j] * (g_iCubeZStride - l) / g_iCubeZStride + m_pBin[(k + g_iCubeZStride)*m_iResXY + i*m_iRes[0] + j] * l / g_iCubeZStride;
}
}
for (k = 1; k < g_iCubeZStride - g_iCubeZMismatch; k++) {
m_pBin[(m_iRes[2] - g_iCubeZStride + g_iCubeZMismatch + k)*m_iResXY + i*m_iRes[0] + j] = m_pBin[(m_iRes[2] - g_iCubeZStride + g_iCubeZMismatch)*m_iResXY + i*m_iRes[0] + j] * (g_iCubeZStride - g_iCubeZMismatch - k) / (g_iCubeZStride - g_iCubeZMismatch) + m_pBin[i*m_iRes[0] + j] * k / (g_iCubeZStride - g_iCubeZMismatch);
}
}
}
}
if (mf->Eof())
{
eprintf("C3DF::ReadCubeData(): Error: Unexpected end of cube file stream.\n");
abort();
}
if (verbose)
{
mprintf(WHITE,"]");
mprintf(" done.\n");
// mprintf(" Sum is %f, equals %f electrons.\n",su,su*(g_fBoxX/100.0/0.529177249/m_iRes[0])*(g_fBoxY/100.0/0.529177249/m_iRes[1])*(g_fBoxZ/100.0/0.529177249/m_iRes[2]));
mprintf(" Sum is %f, equals %f electrons.\n",su,su*g_fCubeXStep*g_fCubeYStep*g_fCubeZStep);
}
BTOUT;
}
void MultiplyBin(T d)
{
int z;
for (z=0;zm_iRes[0] = m_iRes[1];
cdf->m_fMinVal[0] = m_fMinVal[1];
cdf->m_fMaxVal[0] = m_fMaxVal[1];
cdf->SetLabelX(m_sLabelY);
cdf->m_iRes[1] = m_iRes[2];
cdf->m_fMinVal[1] = m_fMinVal[2];
cdf->m_fMaxVal[1] = m_fMaxVal[2];
cdf->SetLabelY(m_sLabelZ);
cdf->SetLabelZ("Occurence");
cdf->Create();
cdf->m_iSmoothGrade = 0;
for (i3=0;i3m_pBin[i3*m_iRes[1]+i2] += m_pBin[i3*m_iResXY+i2*m_iRes[0]+i1];
}
}
}
cdf->CalcMaxEntry();
} else if (axis == 1)
{
cdf->m_iRes[0] = m_iRes[0];
cdf->m_fMinVal[0] = m_fMinVal[0];
cdf->m_fMaxVal[0] = m_fMaxVal[0];
cdf->SetLabelX(m_sLabelX);
cdf->m_iRes[1] = m_iRes[2];
cdf->m_fMinVal[1] = m_fMinVal[2];
cdf->m_fMaxVal[1] = m_fMaxVal[2];
cdf->SetLabelY(m_sLabelZ);
cdf->SetLabelZ("Occurence");
cdf->Create();
cdf->m_iSmoothGrade = 0;
for (i3=0;i3m_pBin[i3*m_iRes[0]+i1] += m_pBin[i3*m_iResXY+i2*m_iRes[0]+i1];
}
}
}
cdf->CalcMaxEntry();
} else if (axis == 2)
{
cdf->m_iRes[0] = m_iRes[0];
cdf->m_fMinVal[0] = m_fMinVal[0];
cdf->m_fMaxVal[0] = m_fMaxVal[0];
cdf->SetLabelX(m_sLabelX);
cdf->m_iRes[1] = m_iRes[1];
cdf->m_fMinVal[1] = m_fMinVal[1];
cdf->m_fMaxVal[1] = m_fMaxVal[1];
cdf->SetLabelY(m_sLabelY);
cdf->SetLabelZ("Occurence");
cdf->Create();
cdf->m_iSmoothGrade = 0;
for (i1=0;i1m_pBin[i2*m_iRes[0]+i1] += m_pBin[i3*m_iResXY+i2*m_iRes[0]+i1];
}
}
}
cdf->CalcMaxEntry();
}
}
void Clear()
{
int z;
for (z=0;z.
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "acf.h"
#include "travis.h"
#include "maintools.h"
const char *GetRevisionInfo_acf(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_acf() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CACF::CACF()
{
BTIN;
m_pData = NULL;
m_pCounter = NULL;
m_iShowMol = -1;
// m_bSplitCart = false;
// m_b2ndDerivative = false;
m_oaCache.SetName("CACF::m_oaCache");
m_oaCCRMatrix.SetName("CACF::m_oaCCRMatrix");
BTOUT;
}
CACF::~CACF()
{
BTIN;
if (m_pData != NULL)
delete[] m_pData;
if (m_pCounter != NULL)
delete[] m_pCounter;
BTOUT;
}
void CACF::Create()
{
BTIN;
int z;
if (m_pData != NULL)
{
delete[] m_pData;
delete[] m_pCounter;
}
mprintf(" ACF: Trying to reserve %s of memory...\n",FormatBytes((double)m_iSize*sizeof(double)+(double)m_iSize*sizeof(long)));
try { m_pData = new double[m_iSize]; } catch(...) { m_pData = NULL; }
if (m_pData == NULL) NewException((double)m_iSize*sizeof(double),__FILE__,__LINE__,__PRETTY_FUNCTION__);
try { m_pCounter = new unsigned long[m_iSize]; } catch(...) { m_pCounter = NULL; }
if (m_pCounter == NULL) NewException((double)m_iSize*sizeof(unsigned long),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (z=0;zm_iSize = m_iSize;
m_pSpectrum->m_fWaveNumber = m_fSpecWaveNumber;
}
BTOUT;
}
void CACF::Normalize()
{
BTIN;
double d;
int z;
if (m_pData[0] < 1E-20)
return;
d = m_pCounter[0] / m_pData[0];
for (z=0;zm_pInput,m_pData,sizeof(double)*(m_iSize/m_iStride));
/* if (m_bMirror)
{
for (z=0;z<(m_iSize+m_iZeroPadding)*2;z++)
{
fft->m_pInput[z*2] = 0;
fft->m_pInput[z*2+1] = 0;
}
for (z=0;zm_pInput[(m_iSize+m_iZeroPadding+z)*2] = (double)m_pData[z];
fft->m_pInput[(m_iSize+m_iZeroPadding+z)*2+1] = 0;
fft->m_pInput[(m_iSize+m_iZeroPadding-z)*2] = (double)m_pData[z];
fft->m_pInput[(m_iSize+m_iZeroPadding-z)*2+1] = 0;
}
} else
{
for (z=0;zm_pInput[z*2] = 0;
fft->m_pInput[z*2+1] = 0;
}*/
/******** MT Neu ************/
/* for(z = 0; z < m_iZeroPadding / 2; z++)
{
fft->m_pInput[z * 2] = 0.0;
fft->m_pInput[z * 2 + 1] = 0.0;
}
for(z = 0; z < m_iSize; z++)
{
fft->m_pInput[(m_iZeroPadding / 2 + z) * 2] = (double)m_pData[z];
fft->m_pInput[(m_iZeroPadding / 2 + z) * 2 + 1] = 0.0;
}
for(z = 0; z < m_iZeroPadding / 2; z++)
{
fft->m_pInput[(m_iZeroPadding / 2 + m_iSize + z) * 2] = 0.0;
fft->m_pInput[(m_iZeroPadding / 2 + m_iSize + z) * 2 + 1] = 0.0;
}*/
/******** MT Neu ************/
for(z = 0; z < m_iSize/2; z++)
{
fft->m_pInput[z * 2] = (double)m_pData[z];
fft->m_pInput[z * 2 + 1] = 0.0;
}
for(z = 0; z < m_iZeroPadding; z++)
{
fft->m_pInput[(m_iSize/2 + z) * 2] = 0.0;
fft->m_pInput[(m_iSize/2 + z) * 2 + 1] = 0.0;
}
for(z = 0; z < m_iSize/2; z++)
{
fft->m_pInput[(m_iSize/2 + m_iZeroPadding + z) * 2] = (double)m_pData[m_iSize/2 + z];
fft->m_pInput[(m_iSize/2 + m_iZeroPadding + z) * 2 + 1] = 0.0;
}
/******** MB Alt ************/
/* for (z=0;zm_pInput[z*2] = (double)m_pData[z];
fft->m_pInput[z*2+1] = 0;
}
for (z=m_iSize;zm_pInput[z*2] = 0;
fft->m_pInput[z*2+1] = 0;
}*/
// }
fft->DoFFT();
// m_pSpectrum = new CSpectrum();
// if (m_bMirror)
// m_pSpectrum->Create((m_iSize+m_iZeroPadding)*2);
/* else */ m_pSpectrum->Create(m_iSize+m_iZeroPadding);
m_pSpectrum->FromComplex((double*)fft->m_pOutput);
BTOUT;
}
void CACF::Parse()
{
BTIN;
// char buf[256];
CxString buf;
int ti, z;
double tf;
CFFT tfft;
eprintf("CACF::Parse(): Internal Error: This code is no longer in use.\n");
abort();
if (m_iShowMol != -1)
{
_atoms:
mprintf(" Which atoms to observe in %s (e.g. \"C1,C3-5,H\")? [all] ",((CMolecule*)g_oaMolecules[m_iShowMol])->m_sName);
inpprintf("! Which atoms to observe (e.g. \"C1,C3-5,H\")? [all]\n");
myget(&buf);
if (buf.GetLength() == 0)
{
m_oAtoms.AddAllAtoms((CMolecule*)g_oaMolecules[m_iShowMol],false);
} else
{
if (!m_oAtoms.ParseAtoms((CMolecule*)g_oaMolecules[m_iShowMol],buf))
{
eprintf("Invalid input.\n");
inpprintf("! Invalid input.\n");
goto _atoms;
}
}
m_iShowAtomGes = m_oAtoms.m_iAtomGes;
} else
{
m_iShowAtomGes = 0;
for (z=0;zm_pElement->m_fRadius == 0)
{
m_bExcludeR0 = AskYesNo(" Neglect atoms excluded from system (e.g. wannier centers) from VACF (y/n)? [yes] ",true);
mprintf("\n");
goto _r0done;
}
}
m_bExcludeR0 = false;
mprintf(" Observing all atoms in the system.\n\n");
_r0done:;
}
//_acfdepth:
mprintf(WHITE," Hint: ");
mprintf("The resolution of the ACF may never be higher than the number of processed steps.\n");
mprintf(" Suggested is 75 percent of the processed steps, but not more than approx. 16384.\n\n");
if (g_iTrajSteps != -1)
ti = (int(g_iTrajSteps*0.75)<5120)?int(g_iTrajSteps*0.75):4096;
else ti = 4096;
m_iSize = AskUnsignedInteger(" Enter the resolution (=depth) of the velocity ACF (in time steps): [%d] ",ti,ti);
if (g_bPowerSpec)
mprintf("\n This corresponds to a spectral resolution of %.4f cm^-1.\n",33356.41/g_fTimestepLength/2.0/m_iSize);
// if (m_iSize*g_iGesVirtAtomCount*12.0f*sizeof(double)/1024.0f/1024.0f >= 10.0f)
// if (!AskYesNo("\nThis needs about %.0f MB Memory. Is this OK (y/n)? [yes] ",true,m_iSize*g_iGesVirtAtomCount*4.0f*sizeof(double)/1024.0f/1024.0f))
// goto _acfdepth;
if (g_bACFFFT)
{
ti = CalcFFTSize(m_iSize,false);
if (m_iSize != ti)
{
mprintf(WHITE," The next \"fast\" size for FFT is %d. Using this instead of %d as size.\n\n",ti,m_iSize);
m_iSize = ti;
}
}
// m_iStride = AskUnsignedInteger(" Take every n-th time step for the Velocity ACF? [1] ",1);
m_bDerivative = AskYesNo(" Derive the velocity before autocorrelating (y/n)? [no] ",false);
m_bMassWeight = AskYesNo(" Weight the autocorrelation functions by atomic mass (y/n)? [yes] ",true);
m_bWindowFunction = AskYesNo(" Apply window function (Cos^2) to Autocorrelation function (y/n)? [yes] ",true);
// mprintf("\n");
// if (g_bPowerSpec)
// m_bSplitCart = AskYesNo(" Split this power spectrum into cartesian contributions x, y, z, xy, xz, yz (y/n)? [no] ",false);
// else
// m_bSplitCart = AskYesNo(" Split this autocorrelation into cartesian contributions x, y, z, xy, xz, yz (y/n)? [no] ",false);
// m_bSpectrum = AskYesNo(" Also calculate power spectrum (= Fourier Transform of velocity ACF) (y/n)? [yes] ",true);
m_bSpectrum = g_bPowerSpec;
if (m_bSpectrum)
{
tf = 33356.41 / g_fTimestepLength / 2.0;
mprintf("\n A time step length of %.1f fs allows a spectral range up to %.1f cm^-1.\n\n",g_fTimestepLength,tf);
m_fSpecWaveNumber = AskRangeFloat(" Calculate spectrum up to which wave number (cm^-1)? [%.1f cm^-1] ",0,tf,(tf<5000.0)?tf:5000.0,(tf<5000.0)?tf:5000.0);
m_iMirror = AskUnsignedInteger(" No mirroring (0), short-time enhancing (1) or long-time enhancing (2)? [1] ",1);
m_iZeroPadding = AskUnsignedInteger(" Zero Padding: How many zeros to insert? [%d] ",m_iSize*3,m_iSize*3);
ti = CalcFFTSize(m_iSize+m_iZeroPadding,false);
if (m_iSize+m_iZeroPadding != ti)
{
mprintf(WHITE," The next \"fast\" size for FFT is %d. Using %d zeros for zero padding.\n\n",ti,ti-m_iSize);
m_iZeroPadding = ti-m_iSize;
}
m_iZeroPadding0 = m_iZeroPadding;
mprintf(" Zero padding increases the spectral resolution to %.4f cm^-1.\n\n",33356.41/g_fTimestepLength/2.0/(m_iSize+m_iZeroPadding));
m_bACF_DB = AskYesNo(" Convert intensity axis of spectrum to decibel (y/n)? [no] ",false);
if (g_bAdvanced2)
m_bDecomposeModes = AskYesNo(" Decompose power spectrum into normal modes (y/n)? [no] ",false);
else m_bDecomposeModes = false;
}
BuildName();
BTOUT;
}
void CACF::BuildName()
{
BTIN;
// char tmp[32768];
CxString tmp;
if (m_iShowMol == -1)
tmp.sprintf("global");
else tmp.sprintf("%s_%s",((CMolecule*)g_oaMolecules[m_iShowMol])->m_sName,m_oAtoms.m_sName);
try { m_sName = new char[strlen(tmp)+1]; } catch(...) { m_sName = NULL; }
if (m_sName == NULL) NewException((double)(strlen(tmp)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sName,tmp);
BTOUT;
}
void CACF::BuildAtomList(CSingleMolecule *obs, CxIntArray *vec)
{
BXIN;
int z1t, z1a;
CxIntArray *a1;
vec->RemoveAll_KeepSize();
for (z1t=0;z1tGetSize();z1a++)
vec->Add(((CxIntArray*)obs->m_oaAtomOffset[m_oAtoms.m_baAtomType[z1t]])->GetAt(a1->GetAt(z1a)));
}
BXOUT;
}
void CACF::NormalizeCached()
{
BTIN;
int z;
for (z=1;z.
*****************************************************************************/
#ifndef ACF_H
#define ACF_H
// This must always be the first include directive
#include "config.h"
#include "xobject.h"
#include "backtrace.h"
#include "spectrum.h"
#include "fft.h"
#include "atomgroup.h"
#include "xintarray.h"
class CSingleMolecule;
class CACF : public CxObject
{
public:
bool m_bExcludeR0;
// bool m_b2ndDerivative;
int m_iDerivative;
bool m_bDerivative;
void Mirror(int i);
int m_iShowAtomGes;
void BuildAtomList(CSingleMolecule *obs, CxIntArray *vec);
CAtomGroup m_oAtoms;
int m_iShowMol;
void BuildName();
CACF();
~CACF();
void Window();
void WriteACF(const char *pre, const char *s, const char *post);
void Normalize();
void NormalizeCached();
void Multiply(double f);
void MultiplyCached(double f);
void Create();
void Transform(CFFT *fft);
void Parse();
char* m_sName;
double *m_pData;
unsigned long *m_pCounter;
int m_iSize;
CSpectrum *m_pSpectrum;
// int m_iStride;
bool m_bWindowFunction;
bool m_bSpectrum;
bool m_bMassWeight;
double m_fSpecWaveNumber;
int m_iZeroPadding;
int m_iZeroPadding0;
int m_iMirror;
bool m_bACF_DB;
CxObArray m_oaCache;
bool m_bDecomposeModes;
int m_iParticles;
CxObArray m_oaCCRMatrix;
//bool m_bSplitCart;
};
#endif
travis-src-190101/src/aggregate.h 0100777 0000000 0000000 00000003222 13412725654 013540 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef AGGREGATE_H
#define AGGREGATE_H
// This must always be the first include directive
#include "config.h"
#include "xobject.h"
#include "xdvector3.h"
#include "xintarray.h"
class CAggregate : public CxObject
{
public:
CxIntArray m_laLifeIntervals;
CAggregate() { }
~CAggregate() { }
int m_iSingleMol2;
CxDVector3 m_vStart;
CxDVector3 m_vFirstStart;
CxDoubleArray m_faTempTrace;
unsigned long m_iStart;
unsigned long m_iFirstStart;
CxDVector3 m_vEnd;
signed long m_iEnd;
bool m_bStillAlive;
};
#endif
travis-src-190101/src/analysis.h 0100777 0000000 0000000 00000003134 13412725656 013441 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef ANALYSIS_H
#define ANALYSIS_H
// This must always be the first include directive
#include "config.h"
#include "backtrace.h"
#include "xobject.h"
class CAnalysis : public CxObject
{
public:
CAnalysis()
{
m_sAbbrev = NULL;
m_sName = NULL;
}
~CAnalysis()
{
if (m_sAbbrev != NULL)
{
delete[] m_sAbbrev;
m_sAbbrev = NULL;
}
if (m_sName != NULL)
{
delete[] m_sName;
m_sName = NULL;
}
}
char* m_sAbbrev;
char* m_sName;
};
#endif
travis-src-190101/src/analysisgroup.cpp 0100777 0000000 0000000 00000003307 13412725620 015042 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "analysisgroup.h"
const char *GetRevisionInfo_analysisgroup(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_analysisgroup() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CAnalysisGroup::CAnalysisGroup()
{
m_sGroupName = NULL;
m_oaAnalyses.SetName("CAnalysisGroup::m_oaAnalyses");
}
CAnalysisGroup::~CAnalysisGroup()
{
if (m_sGroupName != NULL)
{
delete[] m_sGroupName;
m_sGroupName = NULL;
}
}
travis-src-190101/src/analysisgroup.h 0100777 0000000 0000000 00000002747 13412725662 014524 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef ANALYSISGROUP_H
#define ANALYSISGROUP_H
// This must always be the first include directive
#include "config.h"
#include "backtrace.h"
#include "xobject.h"
#include "xobarray.h"
#include "analysis.h"
class CAnalysisGroup : public CxObject
{
public:
CAnalysisGroup();
~CAnalysisGroup();
char* m_sGroupName;
CxObArray m_oaAnalyses;
};
#endif
travis-src-190101/src/asciiart.cpp 0100777 0000000 0000000 00000023416 13412725625 013751 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "asciiart.h"
const char *GetRevisionInfo_asciiart(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_asciiart() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CAsciiArt::CAsciiArt()
{
BTIN;
m_iPosX = -1;
m_iPosY = -1;
m_iSelectedPiece = -1;
m_oaAsciiPieces.SetName("CAsciiArt::m_oaAsciiPieces");
AddPiece(" , \n\
,::.::::. / `. \n\
;:: `. ( ,--. \n\
,; : _,--'\"\\/\"\"-.\\_ \n\
,: `./ ,---./( O )) `; \n\
; `. _,' ( `-' ) /_. \n\
; : ,' \\ , (o\\\\ \n\
; : \\ \\-. -.__--' \\' ) \n\
; ; /\\ ( `-._`-._ \\/ \n\
';, ; : | -.`._'\\ `. \n\
; ; : `-.,-.. ) \\'\\ ^. \n\
; ; `.__ )))\\ ) (`.\\ \\ \n\
; ; `-`///(, \\ \\ \\) ,ooo. \n\
;,; ; `` ))))_;'( 88888p \n\
; ; ((-='--',-,Y8888' \n\
; : ; ,:'-' `\"' \n\
; ` ; | \n\
; (_ __ _,-' \n\
`---. ;\"(,-' / ____ \n\
-hrr- \\ (__/\\\\_`-.-. _____/ \n\
,(( '/\\/\\/\\`-;;)) ______// \n\
((\\''/\\/\\/\\/\\/\\/`/\\ _____/ ____/ \n\
/'/\\/\\/\\/\\/\\/\\/\\/\\/) __/ _____/ \n\
(\\/\\/\\/\\/\\/\\/\\/\\/\\_/ _/ ___/ \n\
`-|\"\"--\"-.___,--'|-'__/ \n\
| | / \n\
| __,--' \n\
_\\,----\"\"'");
AddPiece(" ,--\"`-.-._ \n\
,' ,.:::::. `. \n\
| ;' `:: | \n\
,--,-, .::::..;',' \n\
,' ,' \"\" ,'_ \n\
'-)\",'o \"_\\ \n\
_,' \"\"' .::. .:o; \n\
; :::' ; \n\
; `::; ; \n\
: (_;_ ;:: ;\\ \n\
; / ;::. ; \\ \n\
/ / ,:' ;:: \\ \n\
__|__/_ /:: ; \\ ` \n\
_,-' `-<::'___ ;| \\ \\ \n\
,-' _,-\"\"\";-._`.(__ `. ;| \\ | ____ \n\
( ,--'__,--' |`-`(@) \\( `. `. ,-' `-. \n\
\\___.-' \\ |::. \\ : `. `./,-'\"\"`. \\ \n\
\\ |::. ) : .-. `-._ ' `--.--' ) \n\
\\ .-`.:' / : / `-.__ __,-' \n\
-hrr- ) `.' ; / `\"' \n\
( `' ,\\ , ---.( \n\
,' --- `:`--' : : \\ \n\
( : : ; `--`--`-' \n\
`-`--`--' ");
AddPiece(" ,--.\"\"\n\
__,----( o )) \n\
,'--. , ( \n\
-\"\",:-( o ),-'/ ; \n\
( o) `o _,'\\ / ;( \n\
`-;_-<'\\_|-'/ ' ) \n\
`.`-.__/ ' | \n\
\\`. `. .__, ; \n\
)_;--. \\` | \n\
/'(__,-: ) ; \n\
;' (_,-: _,:: .| \n\
; ( , ) _,':::' ,; \n\
; )-,;' `:' .:: \n\
| `' ; `:::\\ \n\
: ,' ' `:\\ \n\
;: ' _,-': .' `-. \n\
';::..,' ' , ` ,__ `. \n\
`;'' / ; _;_,-' `. \n\
/ _;--. \\ \n\
,' / ,' `. \\ \n\
/: (_( ,' \\ ) \n\
/:. \\_( /-. .:::,;/ \n\
(::.. `-'\\ \"`\"\"' \n\
;::::. \\ __ \n\
,::::::. .:' ) ,-' ) \n\
/ `;:::::::'`__,:.:::' /`---' ,' \n\
; `\"\"\"\"' ( \\:::' / _,-'\n\
; \\ \\:' ,';:.,-' \n\
( : )\\ ( \n\
`. \\ \\ ; \n\
-hrr- `-.___ : ,\\ \\ ( \n\
,','._::::| \\ \\ \\ \\ \n\
(,(,---;;;;; \\ \\|;;;) \n\
`._\\_\\");
AddPiece(" ,::::.._\n\
,':::::::::.\n\
_,-'`:::,::(o)::`-,.._\n\
_.', ', `:::::::::;'-..__`.\n\
_.-'' ' ,' ,' ,\\:::,'::-`'''\n\
_.-'' , ' , ,' ' ,' `:::/\n\
_..-'' , ' , ' ,' , ,' ',' '/::\n\
_...:::'`-..'_, ' , ,' , ' ,'' , ,'::|\n\
_`.:::::,':::::,'::`-:..'_',_'_,'..-'::,'|\n\
_..-:::'::,':::::::,':::,':,'::,':::,'::::::,':::;\n\
`':,'::::::,:,':::::::::::::::::':::,'::_:::,'/\n\
__..:'::,':::::::--''' `-:,':,':::'::-' ,':::/\n\
_.::::::,:::.-''-`-`..'_,'. ,', , ' , ,' ', `','\n\
,::SSt:''''` \\:. . ,' ' ,',' '_,'\n\
``::._,'_'_,',.-'\n\
\\\\ \\\\\n\
\\\\_\\\\\n\
\\\\`-`.-'_\n\
.`-.\\\\__`. ``\n\
``-.-._\n\
`");
SelectOne();
BTOUT;
}
CAsciiArt::~CAsciiArt()
{
}
void CAsciiArt::AddPiece(const char *s)
{
BTIN;
CAsciiPiece *p;
const char *q;
int tw, th, z;
try { p = new CAsciiPiece(); } catch(...) { p = NULL; }
if (p == NULL) NewException((double)sizeof(CAsciiPiece),__FILE__,__LINE__,__PRETTY_FUNCTION__);
m_oaAsciiPieces.Add(p);
p->m_iWidth = 0;
tw = 0;
p->m_iHeight = 0;
q = s;
while (*q != 0)
{
q++;
tw++;
if ((*q == '\n') || (*q == 0))
{
if (tw-1 > p->m_iWidth)
p->m_iWidth = (unsigned short)tw-1;
tw = 0;
p->m_iHeight++;
if (*q == 0)
break;
}
}
try { p->m_pBuf = new char[p->m_iWidth*p->m_iHeight]; } catch(...) { p->m_pBuf = NULL; }
if (p->m_pBuf == NULL) NewException((double)p->m_iWidth*p->m_iHeight*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
tw = 0;
th = 0;
q = s;
while (*q != 0)
{
p->m_pBuf[tw+th*p->m_iWidth] = *q;
q++;
tw++;
if ((*q == '\n') || (*q == 0))
{
for (z=tw;zm_iWidth;z++)
p->m_pBuf[z+th*p->m_iWidth] = ' ';
tw = 0;
th++;
if (*q == 0)
break;
q++;
}
}
/* printf("### Anfang ###\n");
for (th=0;thm_iHeight;th++)
{
printf("\"");
for (tw=0;twm_iWidth;tw++)
printf("%c",p->m_pBuf[tw+th*p->m_iWidth]);
printf("\"\n");
}
printf("### Ende ###\n");*/
BTOUT;
}
void CAsciiArt::SelectOne()
{
BTIN;
m_iSelectedPiece = rand()%m_oaAsciiPieces.GetSize();
BTOUT;
}
int CAsciiArt::GetHeight()
{
BTIN;
if (m_iSelectedPiece == -1)
SelectOne();
BTOUT;
return ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iHeight;
}
int CAsciiArt::GetWidth()
{
BTIN;
if (m_iSelectedPiece == -1)
SelectOne();
BTOUT;
return ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iWidth;
}
char CAsciiArt::GetChar()
{
BTIN;
char c;
if (m_iSelectedPiece == -1)
SelectOne();
if (m_iPosY == -1)
{
if (m_iPosX == -1)
c = '/';
else if (m_iPosX == ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iWidth)
c = '\\';
else if (m_iPosX > ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iWidth)
c = 0;
else
c = '=';
} else if (m_iPosY == ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iHeight+1)
{
if (m_iPosX > 0)
c = 0;
else c = ' ';
} else if (m_iPosY == ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iHeight)
{
if (m_iPosX == -1)
c = '\\';
else if (m_iPosX == ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iWidth)
c = '/';
else if (m_iPosX > ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iWidth)
c = 0;
else
c = '=';
} else if (m_iPosX == ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iWidth)
c = '|';
else if (m_iPosX == -1)
c = '|';
else if (m_iPosX > ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iWidth)
c = 0;
else c = ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->GetAt(m_iPosX,m_iPosY);
m_iPosX++;
BTOUT;
return c;
}
char CAsciiPiece::GetAt(int x, int y)
{
return m_pBuf[x+y*m_iWidth];
}
void CAsciiArt::NewLine()
{
BTIN;
if (m_iSelectedPiece == -1)
SelectOne();
m_iPosX = -1;
m_iPosY++;
if (m_iPosY > ((CAsciiPiece*)m_oaAsciiPieces[m_iSelectedPiece])->m_iHeight+1)
{
SelectOne();
m_iPosY = -1;
}
BTOUT;
}
travis-src-190101/src/asciiart.h 0100777 0000000 0000000 00000003405 13412725655 013415 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef ASCIIART_H
#define ASCIIART_H
// This must always be the first include directive
#include "config.h"
#include "xobject.h"
#include "xobarray.h"
#include "backtrace.h"
class CAsciiPiece : public CxObject
{
public:
char GetAt(int x, int y);
CAsciiPiece() { }
~CAsciiPiece() { }
unsigned short m_iWidth;
unsigned short m_iHeight;
char *m_pBuf;
};
class CAsciiArt : public CxObject
{
public:
void NewLine();
char GetChar();
int GetWidth();
int GetHeight();
int m_iPosX;
int m_iPosY;
void SelectOne();
CAsciiArt();
~CAsciiArt();
void AddPiece(const char *s);
int m_iSelectedPiece;
CxObArray m_oaAsciiPieces;
};
#endif
travis-src-190101/src/atomgroup.cpp 0100777 0000000 0000000 00000023205 13412725626 014164 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "atomgroup.h"
#include "moltools.h"
#include "travis.h"
const char *GetRevisionInfo_atomgroup(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_atomgroup() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CAtomGroup::CAtomGroup()
{
m_iAtomGes = 0;
m_pMolecule = NULL;
m_sName = NULL;
m_bAllAtoms = false;
m_baAtomType.SetName("CAtomGroup::m_baAtomType");
m_baRealAtomType.SetName("CAtomGroup::m_baRealAtomType");
m_baAllAtoms.SetName("CAtomGroup::m_baAllAtoms");
m_oaAtoms.SetName("CAtomGroup::m_oaAtoms");
}
CAtomGroup::~CAtomGroup()
{
if (m_sName != NULL)
{
delete[] m_sName;
m_sName = NULL;
}
}
void CAtomGroup::AddAtom(int atom, int num, bool all)
{
BTIN;
int z, z2;
CxIntArray *atoms;
for (z=0;zGetSize();z2++)
{
if (atoms->GetAt(z2) == num)
{
eprintf("CAtomGroup::AddAtom(): Atom %s%d already included, ignoring this.\n",(const char*)((CAtom*)g_oaAtoms[atom])->m_sName,num+1);
BTOUT;
return;
}
}
atoms->Add(num);
m_iAtomGes++;
if (all && (m_baAllAtoms[z]==0))
m_baAllAtoms[z] = 1;
BTOUT;
return;
}
}
m_baAtomType.Add((unsigned char)atom);
m_baRealAtomType.Add(m_pMolecule->m_baAtomIndex[atom]);
try { atoms = new CxIntArray("CAtomGroup::AddAtom():atoms"); } catch(...) { atoms = NULL; }
if (atoms == NULL) NewException((double)sizeof(CxIntArray),__FILE__,__LINE__,__PRETTY_FUNCTION__);
atoms->Add(num);
m_oaAtoms.Add(atoms);
m_baAllAtoms.Add(all?1:0);
m_iAtomGes++;
BTOUT;
}
void CAtomGroup::AddAllAtoms(CMolecule *m, bool virt)
{
BTIN;
int z, z2;
CxIntArray *atoms;
m_pMolecule = m;
for (z=0;zm_baAtomIndex.GetSize()-(virt?0:1);z++) // Virtuellen Atome mitnehmen?
{
try { atoms = new CxIntArray("CAtomGroup::AddAllAtoms():atoms"); } catch(...) { atoms = NULL; }
if (atoms == NULL) NewException((double)sizeof(CxIntArray),__FILE__,__LINE__,__PRETTY_FUNCTION__);
for (z2=0;z2m_waAtomCount[z];z2++)
atoms->Add(z2);
m_iAtomGes += m->m_waAtomCount[z];
m_oaAtoms.Add(atoms);
m_baAtomType.Add((unsigned char)z);
m_baRealAtomType.Add(m_pMolecule->m_baAtomIndex[z]);
m_baAllAtoms.Add(1);
}
m_bAllAtoms = true;
BuildName();
BTOUT;
}
bool CAtomGroup::ParseAtoms(CMolecule *mol, const char *s)
{
BTIN;
const char *p, *q;
char buf[32];
// CxString buf;
int atom, la, i, i2, z;
bool m, all;
const char *allowed = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz1234567890,-#_ ";
if ((s[0] == '*') && (s[1] == 0))
{
AddAllAtoms(mol,false);
return true;
}
Reset();
m_pMolecule = mol;
p = s;
atom = -1;
la = -1;
i = -1;
i2 = -1;
m = false;
all = false;
while (*p != 0)
{
while (*p == ' ')
p++;
if (strchr(allowed,*p) == NULL)
{
eprintf("Error: Character \"%c\" not allowed.\n",*p);
BTOUT;
return false;
}
q = p;
if (isalpha(*q) || (*q == '_') || (*q == '#'))
{
if (m)
{
eprintf("Error: Only digit allowed after \"-\".\n");
BTOUT;
return false;
}
while (isalpha(*q) || (*q == '_') || (*q == '#'))
q++;
if (q-p >= 32)
{
eprintf("ParseAtoms(): Internal Error A (%ld >= 32).\n",q-p);
return false;
}
memcpy(buf,p,q-p);
buf[q-p] = 0;
atom = mol->FindAtomInMol(buf);
if (atom == -1)
{
eprintf("Error: Atom \"%s\" not in the molecule.\n",buf);
BTOUT;
return false;
}
} else if (isdigit(*q))
{
if (atom == -1)
atom = la;
if (atom == -1)
{
eprintf("Error: Number in the beginning not possible.\n");
BTOUT;
return false;
}
while (isdigit(*q)) q++;
if ((*q != '-') && (*q != ',') && (*q != ' ') && (*q != 0))
{
eprintf("Error: Only \",\" or \"-\" may follow after a number.\n");
BTOUT;
return false;
}
if (q-p >= 32)
{
eprintf("ParseAtoms(): Internal Error B (%ld >= 32).\n",q-p);
return false;
}
memcpy(buf,p,q-p);
buf[q-p] = 0;
if (atoi(buf)-1 >= mol->m_waAtomCount[atom])
{
eprintf("Error: Only %d %s atoms in the molecule (requested: %d)\n",mol->m_waAtomCount[atom],(const char*)((CAtom*)g_oaAtoms[mol->m_baAtomIndex[atom]])->m_sName,atoi(buf));
BTOUT;
return false;
}
if (m)
{
i2 = atoi(buf)-1;
if (i2 < i)
{
eprintf("Error: Invalid atom range, %d < %d.\n",i2+1,i+1);
BTOUT;
return false;
}
} else i = atoi(buf)-1;
} else if (*q == '-')
{
if (i == -1)
{
eprintf("Error: \"-\" without preceding number.\n");
BTOUT;
return false;
}
m = true;
q++;
} else if (*q == ',')
{
if (atom == -1)
{
eprintf("Error: Comma without atom.\n");
BTOUT;
return false;
}
if (i == -1)
{
i = 0;
i2 = mol->m_waAtomCount[atom]-1;
all = true;
} else all = false;
if (all)
{
for (z=i;z<=i2;z++)
AddAtom(atom,z,true);
} else if (m)
{
for (z=i;z<=i2;z++)
AddAtom(atom,z,false);
} else AddAtom(atom,i,false);
la = atom;
m = false;
i = -1;
i2 = -1;
atom = -1;
q++;
}
// _end:
p = q;
}
if (atom != -1)
{
if (i == -1)
{
i = 0;
i2 = mol->m_waAtomCount[atom]-1;
all = true;
} else all = false;
if (all)
{
for (z=i;z<=i2;z++)
AddAtom(atom,z,true);
} else if (m)
{
for (z=i;z<=i2;z++)
AddAtom(atom,z,false);
} else AddAtom(atom,i,false);
}
if (m_iAtomGes == 0)
return false;
SortAtoms();
BuildName();
BTOUT;
return true;
}
void CAtomGroup::BuildName()
{
// char tmp[4096], buf2[32];
CxString tmp, buf2;
CxIntArray *atoms;
int z, z2, z3;
tmp = "";
for (z=0;zm_sName);
tmp.strcat(((CAtom*)g_oaAtoms[m_baRealAtomType[z]])->m_sName);
} else
{
atoms = (CxIntArray*)m_oaAtoms[z];
for (z2=0;z2GetSize();z2++)
{
z3 = z2;
if (z2 < atoms->GetSize()-1)
{
while (atoms->GetAt(z3)+1 == atoms->GetAt(z3+1))
{
z3++;
if (z3 >= atoms->GetSize()-1)
break;
}
// if (z3 > z2)
// z3--;
}
if (z3 > z2)
{
// sprintf(buf2,"%s%d-%d",((CAtom*)g_oaAtoms[m_baRealAtomType[z]])->m_sName,atoms->GetAt(z2)+1,atoms->GetAt(z3)+1);
buf2.sprintf("%s%d-%d",(const char*)((CAtom*)g_oaAtoms[m_baRealAtomType[z]])->m_sName,atoms->GetAt(z2)+1,atoms->GetAt(z3)+1);
z2 = z3;
} else
buf2.sprintf("%s%d",(const char*)((CAtom*)g_oaAtoms[m_baRealAtomType[z]])->m_sName,atoms->GetAt(z2)+1);
// sprintf(buf2,"%s%d",((CAtom*)g_oaAtoms[m_baRealAtomType[z]])->m_sName,atoms->GetAt(z2)+1);
// strcat(tmp,buf2);
tmp.strcat(buf2);
}
}
}
try { m_sName = new char[strlen(tmp)+1]; } catch(...) { m_sName = NULL; }
if (m_sName == NULL) NewException((double)(strlen(tmp)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sName,tmp);
}
void CAtomGroup::SortAtoms()
{
CxIntArray *atoms;
int z, z2, z3, i, j;
for (z=0;zGetSize();z2++)
{
j = 999999;
i = -1;
for (z3=z2;z3GetSize();z3++)
{
if (atoms->GetAt(z3) < j)
{
j = atoms->GetAt(z3);
i = z3;
}
}
j = atoms->GetAt(i);
atoms->SetAt(i,atoms->GetAt(z2));
atoms->SetAt(z2,j);
}
}
}
}
void CAtomGroup::Reset()
{
int z;
m_iAtomGes = 0;
m_baAllAtoms.RemoveAll();
m_baAtomType.RemoveAll();
m_baRealAtomType.RemoveAll();
for (z=0;zm_baAllAtoms);
m_baAtomType.CopyFrom(&p->m_baAtomType);
m_baRealAtomType.CopyFrom(&p->m_baRealAtomType);
m_iAtomGes = p->m_iAtomGes;
m_pMolecule = p->m_pMolecule;
m_bAllAtoms = p->m_bAllAtoms;
if (p->m_sName != NULL)
{
try { m_sName = new char[strlen(p->m_sName)+1]; } catch(...) { m_sName = NULL; }
if (m_sName == NULL) NewException((double)(strlen(p->m_sName)+1)*sizeof(char),__FILE__,__LINE__,__PRETTY_FUNCTION__);
strcpy(m_sName,p->m_sName);
}
for (z=0;zCopyFrom((CxIntArray*)p->m_oaAtoms[z]);
m_oaAtoms.Add(wa);
}
}
travis-src-190101/src/atomgroup.h 0100777 0000000 0000000 00000003523 13412725650 013627 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef ATOMGROUP_H
#define ATOMGROUP_H
// This must always be the first include directive
#include "config.h"
#include "xobject.h"
#include "xbytearray.h"
#include "tools.h"
class CMolecule;
class CAtomGroup : public CxObject
{
public:
void CopyFrom(CAtomGroup *p);
void Reset();
void SortAtoms();
CAtomGroup();
~CAtomGroup();
CMolecule* m_pMolecule;
CxByteArray m_baAtomType;
CxByteArray m_baRealAtomType;
CxByteArray m_baAllAtoms;
CxObArray m_oaAtoms; // Enthaelt CxWordArrays
int m_iAtomGes;
bool m_bAllAtoms;
bool ParseAtoms(CMolecule *m, const char *s);
void AddAtom(int atom, int num, bool all);
void AddAllAtoms(CMolecule *m, bool virt);
void BuildName();
char *m_sName;
};
#endif
travis-src-190101/src/backtrace.cpp 0100777 0000000 0000000 00000026374 13412725620 014072 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "backtrace.h"
#include "travis.h"
#include "maintools.h"
#ifdef TARGET_LINUX
#include
#endif
const char *GetRevisionInfo_backtrace(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_backtrace() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CxObArray g_oaBackTrace;
char *g_sExeName;
void DumpBacktrace()
{
int z;
CxTracePoint *p;
mprintf(YELLOW,">>> Backtrace\n");
for (z=0;zm_sMessage[0] == 0)
mprintf(" %d.) %s in %s after line %lu.\n",z+1,p->m_sFunction,p->m_sFile,p->m_iLine);
else mprintf(" %d.) %s in %s after line %lu: \"%s\"\n",z+1,p->m_sFunction,p->m_sFile,p->m_iLine,p->m_sMessage);
}
mprintf(YELLOW,"<<< Backtrace\n");
}
#ifdef TARGET_LINUX
void DumpLinuxBacktrace()
{
void *buffer[4096];
char **strings, buf[256], *p;
int n, z, i, j;
bool showall;
FILE *a;
// mprintf(YELLOW,"*** Linux Backtrace ***\n");
n = backtrace(buffer,4096);
if (n <= 0)
{
eprintf("Could not retrieve stack trace.\n");
return;
}
// mprintf("Stack contains %d Frames.\n",n);
strings = backtrace_symbols(buffer,n);
if (strings == NULL)
eprintf("Could not retrieve debug symbol strings.\n");
/* for (z=0;z -f -i -C -e %s\")\n",g_sExeName);
a = fopen(g_sExeName,"rb");
if (a == NULL)
{
eprintf("Could not locate \"%s\" :-(\n",g_sExeName);
} else
{
fclose(a);
j = 0;
for (z=0;z (void*)0x400000))
j++;
if (j < 3)
showall = true;
else showall = false;
for (z=0;z (void*)0x400000)))
{
mprintf(GREEN," # %2d ",n-z);
sprintf(buf,"addr2line %p -f -i -C -e %s > tmp.txt",buffer[z],g_sExeName);
(void)system(buf);
a = fopen("tmp.txt","rt");
if (a == NULL)
{
eprintf("Error. Make sure you have the addr2line tool installed (it is part of \"binutils\")\nand writing permission to this directory.\n");
continue;
}
mprintf("- [%10p] ",buffer[z]);
i = 0;
while (true)
{
(void)fgets(buf,256,a);
if (feof(a))
break;
if (strlen(buf) > 2)
{
if (i == 2)
{
i = 0;
mprintf("\n ");
}
buf[strlen(buf)-1] = 0;
p = strrchr(buf,'/');
if (p == NULL)
p = buf;
else p++;
mprintf("- %s ",p);
i++;
}
}
fclose(a);
mprintf("\n");
}
}
(void)system("rm tmp.txt");
}
}
#endif
void Crash()
{
bool b;
g_bCheckWrite = false;
UninstallSignalHandler();
b = g_bGlobalPsycho;
g_bGlobalPsycho = false;
mprintf(WHITE,"TRAVIS apparently has crashed :-( Sorry.\n");
mprintf(WHITE,"Please send the log file (travis.log) to the developers,\n");
mprintf(WHITE,"making them able to analyze and fix this error.\n");
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
if (g_bSMode)
{
mprintf("\n");
g_bGlobalPsycho = b;
PrintSMode();
g_bGlobalPsycho = false;
mprintf("\n");
}
eprintf("Delivering control to operating system.\n");
/*#ifdef TARGET_WINDOWS
char buf[2];
gets(buf);
#endif*/
abort();
}
void CrashAbort()
{
bool b;
g_bCheckWrite = false;
UninstallSignalHandler();
b = g_bGlobalPsycho;
g_bGlobalPsycho = false;
mprintf(WHITE,"TRAVIS had to abort execution.\n");
mprintf(WHITE,"Hopefully, the reason was printed above this message.\n");
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
if (g_bSMode)
{
mprintf("\n");
g_bGlobalPsycho = b;
PrintSMode();
g_bGlobalPsycho = false;
mprintf("\n");
}
eprintf("Delivering control to operating system.\n");
/*#ifdef TARGET_WINDOWS
char buf[2];
gets(buf);
#endif*/
abort();
}
void CrashTerm()
{
bool b;
g_bCheckWrite = false;
UninstallSignalHandler();
b = g_bGlobalPsycho;
g_bGlobalPsycho = false;
mprintf(WHITE,"TRAVIS received a termination request (SIGTERM) from the operating system\n");
mprintf(WHITE,"and therefore has to stop execution.\n");
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
if (g_bSMode)
{
mprintf("\n");
g_bGlobalPsycho = b;
PrintSMode();
g_bGlobalPsycho = false;
mprintf("\n");
}
eprintf("Delivering control to operating system.\n");
/*#ifdef TARGET_WINDOWS
char buf[2];
gets(buf);
#endif*/
abort();
}
void CrashInt()
{
bool b;
UninstallSignalHandler();
b = g_bGlobalPsycho;
g_bGlobalPsycho = false;
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
if (g_bSMode)
{
mprintf("\n");
g_bGlobalPsycho = b;
PrintSMode();
g_bGlobalPsycho = false;
mprintf("\n");
}
eprintf("Delivering control to operating system.\n");
/*#ifdef TARGET_WINDOWS
char buf[2];
gets(buf);
#endif*/
abort();
}
void SIGNAL_SEGV(int param)
{
UNUSED(param); // Suppress "unused parameter" warning
eprintf("\n\n*** SIGSEGV caught: Segmentation fault ***\n");
Crash();
}
void SIGNAL_FPE(int param)
{
UNUSED(param); // Suppress "unused parameter" warning
eprintf("\n\n*** SIGFPE caught: Floating point exception ***\n");
Crash();
}
void SIGNAL_ILL(int param)
{
UNUSED(param); // Suppress "unused parameter" warning
eprintf("\n\n*** SIGILL caught: Illegal instruction ***\n");
Crash();
}
void SIGNAL_INT(int param)
{
bool b;
UNUSED(param); // Suppress "unused parameter" warning
b = g_bGlobalPsycho;
if (!g_bAbortAnalysis)
{
mprintf("\n\n*** SIGINT: Analysis softly interrupted by user ***\n");
mprintf(" Press CTRL+C again to immediately stop execution.\n");
g_bAbortAnalysis = true;
signal(SIGINT,SIGNAL_INT);
return;
} else
{
g_bGlobalPsycho = false;
eprintf("\n\n*** SIGINT caught: Hard interrupt by user ***\n");
eprintf("Stopping execution.\n");
g_bGlobalPsycho = b;
CrashInt();
exit(0);
}
}
void SIGNAL_ABRT(int param)
{
UNUSED(param); // Suppress "unused parameter" warning
eprintf("\n\n*** SIGABRT caught: Abnormal program termination ***\n");
CrashAbort();
}
void SIGNAL_TERM(int param)
{
UNUSED(param); // Suppress "unused parameter" warning
eprintf("\n\n*** SIGTERM caught: Terminating ***\n");
CrashTerm();
}
#ifdef TARGET_LINUX
void SIGNAL_HANGUP(int param)
{
UNUSED(param); // Suppress "unused parameter" warning
eprintf("\n\n*** SIGHUP caught: Trying to ignore hangup ^^ ***\n");
signal(SIGHUP,SIGNAL_HANGUP);
}
#endif
void InstallSignalHandler()
{
BTIN;
signal(SIGSEGV,SIGNAL_SEGV);
signal(SIGFPE,SIGNAL_FPE);
signal(SIGILL,SIGNAL_ILL);
signal(SIGINT,SIGNAL_INT);
signal(SIGABRT,SIGNAL_ABRT);
signal(SIGTERM,SIGNAL_TERM);
#ifdef TARGET_LINUX
signal(SIGHUP,SIGNAL_HANGUP);
#endif
BTOUT;
}
void UninstallSignalHandler()
{
BTIN;
signal(SIGSEGV,SIG_DFL);
signal(SIGFPE,SIG_DFL);
signal(SIGILL,SIG_DFL);
signal(SIGINT,SIG_DFL);
signal(SIGABRT,SIG_DFL);
signal(SIGTERM,SIG_DFL);
#ifdef TARGET_LINUX
signal(SIGHUP,SIG_DFL);
#endif
BTOUT;
}
void BoundsException(int i, int j, const char *filename, int line, const char *function)
{
UninstallSignalHandler();
g_bGlobalPsycho = false;
eprintf("\n*** Array Boundary Violation ***\n\n");
eprintf("Caught an exception while accessing array element %d/%d (valid range 0-%d).\n",i,j,j-1);
mprintf("The exception was raised in %s:%d",filename,line);
if (function[0] != 0)
mprintf(" - %s",function);
mprintf(".\n\n");
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
eprintf("Delivering control to operating system.\n");
abort();
}
void BoundsException(int i, int j, const char *filename, int line, const char *function, const char *info)
{
UninstallSignalHandler();
g_bGlobalPsycho = false;
eprintf("\n*** Array Boundary Violation ***\n\n");
eprintf("Caught an exception while accessing array element %d/%d (valid range 0-%d).\n",i,j,j-1);
mprintf("The exception was raised in %s:%d",filename,line);
if (function[0] != 0)
mprintf(" - %s",function);
if (info != NULL)
mprintf(", concerning %s",info);
mprintf(".\n\n");
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
eprintf("Delivering control to operating system.\n");
abort();
}
void NewException(double d, const char *filename, int line, const char *function)
{
UninstallSignalHandler();
g_bGlobalPsycho = false;
eprintf("\n*** Out of Memory ***\n\n");
eprintf("Caught an exception while allocating %s of memory.\n",FormatBytes(d));
mprintf("The exception was raised in %s:%d",filename,line);
if (function[0] != 0)
mprintf(" - %s",function);
mprintf(".\n");
if (d <= 0) {
mprintf("TRAVIS tried to allocate a negative amount of memory, which is clearly\n");
mprintf("due to a bug.\n");
} else {
mprintf("It is likely that TRAVIS requested more RAM than available on this machine.\n");
if (d >= 4000000000.0)
mprintf("Apart from that, more than 4 GB cannot be allocated in one single call.\n");
mprintf("Adjust your input parameters.\n\n");
}
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
eprintf("Delivering control to operating system.\n");
abort();
}
void NewException(double d, const char *filename, int line, const char *function, const char *info)
{
UninstallSignalHandler();
g_bGlobalPsycho = false;
eprintf("\n*** Out of Memory ***\n\n");
eprintf("Caught an exception while allocating %s of memory.\n",FormatBytes(d));
mprintf("The exception was raised in %s:%d",filename,line);
if (function[0] != 0)
mprintf(" - %s",function);
if (info != NULL)
mprintf(", concerning %s",info);
mprintf(".\n");
if (d <= 0) {
mprintf("TRAVIS tried to allocate a negative amount of memory, which is clearly\n");
mprintf("due to a bug.\n");
} else {
mprintf("It is likely that TRAVIS requested more RAM than available on this machine.\n");
if (d >= 4000000000.0)
mprintf("Apart from that, more than 4 GB cannot be allocated in one single call.\n");
mprintf("Adjust your input parameters.\n\n");
}
BTDUMP;
#ifdef TARGET_LINUX
DumpLinuxBacktrace();
#endif
eprintf("Delivering control to operating system.\n");
abort();
}
travis-src-190101/src/backtrace.h 0100777 0000000 0000000 00000012763 13412725657 013546 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef BACKTRACE_H
#define BACKTRACE_H
// This must always be the first include directive
#include "config.h"
#include
#include
#include "tools.h"
#include "xobject.h"
#include "xobarray.h"
class CxTracePoint : public CxObject
{
public:
CxTracePoint() { }
~CxTracePoint() { }
char m_sFunction[256];
char m_sFile[64];
unsigned long m_iLine;
char m_sMessage[256];
};
class CxObArray;
extern CxObArray g_oaBackTrace;
extern char *g_sExeName;
#ifdef DEBUG_BACKTRACE
#define BTDUMP DumpBacktrace()
#ifdef TARGET_WINDOWS
#define BTIN { if (g_oaBackTrace.GetSize() > 500) { eprintf("*** Trace to deep ***\n"); DumpBacktrace(); abort(); } CxTracePoint *ctp = new CxTracePoint(); strcpy(ctp->m_sFile,__FILE__); ctp->m_sFunction[0] = 0; ctp->m_iLine = __LINE__; ctp->m_sMessage[0] = 0; g_oaBackTrace.Add(ctp); }
#define BTOUT { if (g_oaBackTrace.GetSize() == 0) { eprintf("*** BTOUT Error ***\n"); abort(); } delete (CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1]; g_oaBackTrace.RemoveAt(g_oaBackTrace.GetSize()-1,1); }
#define BTL ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__;
#define BTMSG(msg) { ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__; strcpy(((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_sMessage,msg); }
#else
#define BTIN { if (g_oaBackTrace.GetSize() > 500) { eprintf("*** Trace to deep ***\n"); DumpBacktrace(); abort(); } CxTracePoint *ctp = new CxTracePoint(); strcpy(ctp->m_sFile,__FILE__); strcpy(ctp->m_sFunction,__PRETTY_FUNCTION__); ctp->m_iLine = __LINE__; ctp->m_sMessage[0] = 0; g_oaBackTrace.Add(ctp); }
#define BTOUT { if (g_oaBackTrace.GetSize() == 0) { eprintf("*** BTOUT Error ***\n"); abort(); } delete (CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1]; g_oaBackTrace.RemoveAt(g_oaBackTrace.GetSize()-1,1); }
#define BTL ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__;
#define BTMSG(msg) { ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__; strcpy(((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_sMessage,msg); }
#endif
#else
#define BTDUMP
#define BTIN
#define BTOUT
#define BTL
#define BTMSG(msg)
#endif
#ifdef DEBUG_EXTENDED_BACKTRACE
#ifdef TARGET_WINDOWS
#define BXIN { if (g_oaBackTrace.GetSize() > 500) { eprintf("*** Trace to deep ***\n"); DumpBacktrace(); abort(); } CxTracePoint *ctp = new CxTracePoint(); strcpy(ctp->m_sFile,__FILE__); ctp->m_sFunction[0] = 0; ctp->m_iLine = __LINE__; ctp->m_sMessage[0] = 0; g_oaBackTrace.Add(ctp); }
#define BXOUT { if (g_oaBackTrace.GetSize() == 0) { eprintf("*** BXOUT Error ***\n"); abort(); } delete (CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1]; g_oaBackTrace.RemoveAt(g_oaBackTrace.GetSize()-1,1); }
#define BXL ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__;
#define BXMSG(msg) { ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__; strcpy(((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_sMessage,msg); }
#else
#define BXIN { if (g_oaBackTrace.GetSize() > 500) { eprintf("*** Trace to deep ***\n"); DumpBacktrace(); abort(); } CxTracePoint *ctp = new CxTracePoint(); strcpy(ctp->m_sFile,__FILE__); strcpy(ctp->m_sFunction,__PRETTY_FUNCTION__); ctp->m_iLine = __LINE__; ctp->m_sMessage[0] = 0; g_oaBackTrace.Add(ctp); }
#define BXOUT { if (g_oaBackTrace.GetSize() == 0) { eprintf("*** BXOUT Error ***\n"); abort(); } delete (CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1]; g_oaBackTrace.RemoveAt(g_oaBackTrace.GetSize()-1,1); }
#define BXL ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__;
#define BXMSG(msg) { ((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_iLine = __LINE__; strcpy(((CxTracePoint*)g_oaBackTrace[g_oaBackTrace.GetSize()-1])->m_sMessage,msg); }
#endif
#else
#define BXIN
#define BXOUT
#define BXL
#define BXMSG(msg)
#endif
void SIGNAL_SEGV(int param);
void InstallSignalHandler();
void UninstallSignalHandler();
void DumpBacktrace();
void NewException(double d, const char *filename, int line, const char *function);
void NewException(double d, const char *filename, int line, const char *function, const char *info);
void BoundsException(int i, int j, const char *filename, int line, const char *function);
void BoundsException(int i, int j, const char *filename, int line, const char *function, const char *info);
#endif
travis-src-190101/src/base64.cpp 0100777 0000000 0000000 00000005174 13412725635 013240 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "base64.h"
#include "string.h"
const char *GetRevisionInfo_base64(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_base64() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
static const char BASE64_table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
//static const int BASE64_INPUT_SIZE = 57;
bool isbase64(char c)
{
return c && strchr(BASE64_table, c) != NULL;
}
inline char BASE64_value(char c)
{
const char *p = strchr(BASE64_table, c);
if(p) {
return (char)(p-BASE64_table);
} else {
return 0;
}
}
int UnBase64(unsigned char *dest, const unsigned char *src, int srclen)
{
*dest = 0;
if(*src == 0)
{
return 0;
}
unsigned char *p = dest;
do
{
char a = BASE64_value(src[0]);
char b = BASE64_value(src[1]);
char c = BASE64_value(src[2]);
char d = BASE64_value(src[3]);
*p++ = (a << 2) | (b >> 4);
*p++ = (b << 4) | (c >> 2);
*p++ = (c << 6) | d;
if(!isbase64(src[1]))
{
p -= 2;
break;
}
else if(!isbase64(src[2]))
{
p -= 2;
break;
}
else if(!isbase64(src[3]))
{
p--;
break;
}
src += 4;
while(*src && (*src == 13 || *src == 10)) src++;
}
while(srclen-= 4);
*p = 0;
return (int)(p-dest);
}
travis-src-190101/src/base64.h 0100777 0000000 0000000 00000002474 13412725666 012711 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef BASE64_H
#define BASE64_H
// This must always be the first include directive
#include "config.h"
int UnBase64(unsigned char *dest, const unsigned char *src, int srclen);
#endif
travis-src-190101/src/bicgstab.cpp 0100777 0000000 0000000 00000065313 13412725634 013732 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Thomas.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "bicgstab.h"
#include "3df.h"
#include "globalvar.h"
const char *GetRevisionInfo_bicgstab(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bicgstab() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CSparseMatrix::CSparseMatrix() {
m_size = 0;
m_val = NULL;
m_colInd = NULL;
m_rowPtr = NULL;
}
CSparseMatrix::CSparseMatrix(const CSparseMatrix &matrix) {
m_size = matrix.m_size;
try { m_val = new double[matrix.m_rowPtr[matrix.m_size]]; } catch(...) { m_val = NULL; }
if (m_val == NULL) NewException((double)matrix.m_rowPtr[matrix.m_size] * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
memcpy(m_val, matrix.m_val, matrix.m_rowPtr[matrix.m_size] * sizeof(double));
try { m_colInd = new int[matrix.m_rowPtr[matrix.m_size]]; } catch(...) { m_colInd = NULL; }
if (m_colInd == NULL) NewException((double)matrix.m_rowPtr[matrix.m_size] * sizeof(int), __FILE__, __LINE__, __PRETTY_FUNCTION__);
memcpy(m_colInd, matrix.m_colInd, matrix.m_rowPtr[matrix.m_size] * sizeof(int));
try { m_rowPtr = new int[matrix.m_size + 1]; } catch(...) { m_rowPtr = NULL; }
if (m_rowPtr == NULL) NewException((double)(matrix.m_size + 1) * sizeof(int), __FILE__, __LINE__, __PRETTY_FUNCTION__);
memcpy(m_rowPtr, matrix.m_rowPtr, (matrix.m_size + 1) * sizeof(int));
}
CSparseMatrix::~CSparseMatrix() {
if (m_val != NULL)
delete[] m_val;
if (m_colInd != NULL)
delete[] m_colInd;
if (m_rowPtr != NULL)
delete[] m_rowPtr;
}
void CSparseMatrix::setTest() {
m_size = 9;
m_val = new double[45];
m_colInd = new int[45];
m_rowPtr = new int[10];
m_val[0] = 8.0;
m_val[1] = -0.5;
m_val[2] = -1.5;
m_val[3] = -0.5;
m_val[4] = -1.5;
m_val[5] = -1.5;
m_val[6] = 3.0;
m_val[7] = -0.5;
m_val[8] = -0.5;
m_val[9] = -1.5;
m_val[10] = -0.5;
m_val[11] = -1.5;
m_val[12] = 4.0;
m_val[13] = -0.5;
m_val[14] = -1.5;
m_val[15] = -1.5;
m_val[16] = 2.0;
m_val[17] = -0.5;
m_val[18] = -1.5;
m_val[19] = -0.5;
m_val[20] = -1.5;
m_val[21] = -1.5;
m_val[22] = 1.0;
m_val[23] = -0.5;
m_val[24] = -0.5;
m_val[25] = -1.5;
m_val[26] = -0.5;
m_val[27] = -1.5;
m_val[28] = 3.0;
m_val[29] = -0.5;
m_val[30] = -0.5;
m_val[31] = -1.5;
m_val[32] = 5.0;
m_val[33] = -0.5;
m_val[34] = -1.5;
m_val[35] = -0.5;
m_val[36] = -1.5;
m_val[37] = -1.5;
m_val[38] = 6.0;
m_val[39] = -0.5;
m_val[40] = -0.5;
m_val[41] = -1.5;
m_val[42] = -0.5;
m_val[43] = -1.5;
m_val[44] = 2.0;
m_colInd[0] = 0;
m_colInd[1] = 1;
m_colInd[2] = 2;
m_colInd[3] = 3;
m_colInd[4] = 6;
m_colInd[5] = 0;
m_colInd[6] = 1;
m_colInd[7] = 2;
m_colInd[8] = 4;
m_colInd[9] = 7;
m_colInd[10] = 0;
m_colInd[11] = 1;
m_colInd[12] = 2;
m_colInd[13] = 5;
m_colInd[14] = 8;
m_colInd[15] = 0;
m_colInd[16] = 3;
m_colInd[17] = 4;
m_colInd[18] = 5;
m_colInd[19] = 6;
m_colInd[20] = 1;
m_colInd[21] = 3;
m_colInd[22] = 4;
m_colInd[23] = 5;
m_colInd[24] = 7;
m_colInd[25] = 2;
m_colInd[26] = 3;
m_colInd[27] = 4;
m_colInd[28] = 5;
m_colInd[29] = 8;
m_colInd[30] = 0;
m_colInd[31] = 3;
m_colInd[32] = 6;
m_colInd[33] = 7;
m_colInd[34] = 8;
m_colInd[35] = 1;
m_colInd[36] = 4;
m_colInd[37] = 6;
m_colInd[38] = 7;
m_colInd[39] = 8;
m_colInd[40] = 2;
m_colInd[41] = 5;
m_colInd[42] = 6;
m_colInd[43] = 7;
m_colInd[44] = 8;
m_rowPtr[0] = 0;
m_rowPtr[1] = 5;
m_rowPtr[2] = 10;
m_rowPtr[3] = 15;
m_rowPtr[4] = 20;
m_rowPtr[5] = 25;
m_rowPtr[6] = 30;
m_rowPtr[7] = 35;
m_rowPtr[8] = 40;
m_rowPtr[9] = 45;
}
void CSparseMatrix::matrixVectorProduct(const double *vect, double *result) const {
int i;
for (i = 0; i < m_size; i++) {
result[i] = 0.0;
int j;
for (j = m_rowPtr[i]; j < m_rowPtr[i + 1]; j++) {
result[i] += m_val[j] * vect[m_colInd[j]];
}
}
}
void CCurrentPDEDiscretizer::discretize(CSparseMatrix *pdeMatrix, const C3DF &electronDensity, const C3DF &electronDensityGradientX, const C3DF &electronDensityGradientY, const C3DF &electronDensityGradientZ) {
if (pdeMatrix->m_val != NULL)
delete[] pdeMatrix->m_val;
if (pdeMatrix->m_colInd != NULL)
delete[] pdeMatrix->m_colInd;
if (pdeMatrix->m_rowPtr != NULL)
delete[] pdeMatrix->m_rowPtr;
pdeMatrix->m_size = electronDensity.m_iRes[0] * electronDensity.m_iRes[1] * electronDensity.m_iRes[2];
int numEntries = 7 * pdeMatrix->m_size;
try { pdeMatrix->m_val = new double[numEntries]; } catch(...) { pdeMatrix->m_val = NULL; }
if (pdeMatrix->m_val == NULL) NewException((double)numEntries * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
try { pdeMatrix->m_colInd = new int[numEntries]; } catch(...) { pdeMatrix->m_colInd = NULL; }
if (pdeMatrix->m_colInd == NULL) NewException((double)numEntries * sizeof(int), __FILE__, __LINE__, __PRETTY_FUNCTION__);
try { pdeMatrix->m_rowPtr = new int[pdeMatrix->m_size + 1]; } catch(...) { pdeMatrix->m_rowPtr = NULL; }
if (pdeMatrix->m_rowPtr == NULL) NewException((double)(pdeMatrix->m_size + 1) * sizeof(int), __FILE__, __LINE__, __PRETTY_FUNCTION__);
// mprintf(GREEN, "%#.10g %#.10g %#.10g %#.10g %#.10g\n", electronDensity.m_pBin[0], electronDensityGradientX.m_pBin[0], electronDensityGradientY.m_pBin[0], electronDensityGradientZ.m_pBin[0], g_fCubeXStep);
int j = 0;
int i;
for (i = 0; i < pdeMatrix->m_size; i++) {
pdeMatrix->m_rowPtr[i] = j;
if (i >= electronDensity.m_iRes[0] * electronDensity.m_iRes[1] * (electronDensity.m_iRes[2] - 1)) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeZStep * g_fCubeZStep) + 0.5 * electronDensityGradientZ.m_pBin[i] / g_fCubeZStep;
pdeMatrix->m_colInd[j] = i - electronDensity.m_iRes[0] * electronDensity.m_iRes[1] * (electronDensity.m_iRes[2] - 1);
j++;
}
if (i >= electronDensity.m_iRes[0] * electronDensity.m_iRes[1]) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeZStep * g_fCubeZStep) - 0.5 * electronDensityGradientZ.m_pBin[i] / g_fCubeZStep;
pdeMatrix->m_colInd[j] = i - electronDensity.m_iRes[0] * electronDensity.m_iRes[1];
// if (j == 13600000) {
// mprintf(GREEN, "%#.10g %#.10g\n", electronDensity.m_pBin[i], electronDensityGradientZ.m_pBin[i]);
// }
j++;
}
if (i % (electronDensity.m_iRes[0] * electronDensity.m_iRes[1]) >= electronDensity.m_iRes[0] * (electronDensity.m_iRes[1] - 1)) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeYStep * g_fCubeYStep) + 0.5 * electronDensityGradientY.m_pBin[i] / g_fCubeYStep;
pdeMatrix->m_colInd[j] = i - electronDensity.m_iRes[0] * (electronDensity.m_iRes[1] - 1);
j++;
}
if (i % (electronDensity.m_iRes[0] * electronDensity.m_iRes[1]) >= electronDensity.m_iRes[0]) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeYStep * g_fCubeYStep) - 0.5 * electronDensityGradientY.m_pBin[i] / g_fCubeYStep;
pdeMatrix->m_colInd[j] = i - electronDensity.m_iRes[0];
j++;
}
if (i % electronDensity.m_iRes[0] == electronDensity.m_iRes[0] - 1) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeXStep * g_fCubeXStep) + 0.5 * electronDensityGradientX.m_pBin[i] / g_fCubeXStep;
pdeMatrix->m_colInd[j] = i - electronDensity.m_iRes[0] + 1;
j++;
}
if (i % electronDensity.m_iRes[0] != 0) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeXStep * g_fCubeXStep) - 0.5 * electronDensityGradientX.m_pBin[i] / g_fCubeXStep;
pdeMatrix->m_colInd[j] = i - 1;
j++;
}
pdeMatrix->m_val[j] = -2.0 * electronDensity.m_pBin[i] / (g_fCubeXStep * g_fCubeXStep) - 2.0 * electronDensity.m_pBin[i] / (g_fCubeYStep * g_fCubeYStep) - 2.0 * electronDensity.m_pBin[i] / (g_fCubeZStep * g_fCubeZStep);
pdeMatrix->m_colInd[j] = i;
j++;
if (i % electronDensity.m_iRes[0] != electronDensity.m_iRes[0] - 1) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeXStep * g_fCubeXStep) + 0.5 * electronDensityGradientX.m_pBin[i] / g_fCubeXStep;
pdeMatrix->m_colInd[j] = i + 1;
j++;
}
if (i % electronDensity.m_iRes[0] == 0) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeXStep * g_fCubeXStep) - 0.5 * electronDensityGradientX.m_pBin[i] / g_fCubeXStep;
pdeMatrix->m_colInd[j] = i + electronDensity.m_iRes[0] - 1;
j++;
}
if (i % (electronDensity.m_iRes[0] * electronDensity.m_iRes[1]) < electronDensity.m_iRes[0] * (electronDensity.m_iRes[1] - 1)) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeYStep * g_fCubeYStep) + 0.5 * electronDensityGradientY.m_pBin[i] / g_fCubeYStep;
pdeMatrix->m_colInd[j] = i + electronDensity.m_iRes[0];
j++;
}
if (i % (electronDensity.m_iRes[0] * electronDensity.m_iRes[1]) < electronDensity.m_iRes[0]) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeYStep * g_fCubeYStep) - 0.5 * electronDensityGradientY.m_pBin[i] / g_fCubeYStep;
pdeMatrix->m_colInd[j] = i + electronDensity.m_iRes[0] * (electronDensity.m_iRes[1] - 1);
j++;
}
if (i < electronDensity.m_iRes[0] * electronDensity.m_iRes[1] * (electronDensity.m_iRes[2] - 1)) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeZStep * g_fCubeZStep) + 0.5 * electronDensityGradientZ.m_pBin[i] / g_fCubeZStep;
pdeMatrix->m_colInd[j] = i + electronDensity.m_iRes[0] * electronDensity.m_iRes[1];
j++;
}
if (i < electronDensity.m_iRes[0] * electronDensity.m_iRes[1]) {
pdeMatrix->m_val[j] = 1.0 * electronDensity.m_pBin[i] / (g_fCubeZStep * g_fCubeZStep) - 0.5 * electronDensityGradientZ.m_pBin[i] / g_fCubeZStep;
pdeMatrix->m_colInd[j] = i + electronDensity.m_iRes[0] * electronDensity.m_iRes[1] * (electronDensity.m_iRes[2] - 1);
j++;
}
}
if (j != numEntries) {
eprintf("CCurrentPDEDiscretizer::discretize(): Error in PDE discretizer.\n");
abort();
}
pdeMatrix->m_rowPtr[pdeMatrix->m_size] = numEntries;
// mprintf(GREEN, "%#.10g\n", pdeMatrix->m_val[13600000]);
}
// For this implementation, the Fortran code provided at http://www.staff.science.uu.nl/~vorst102/software.html (November 07, 2014) was adopted
/***********************************************************
* This code is based on: *
* *
* subroutine bicgstab2 *
* Copyright (c) 1998 by M.A.Botchev *
* Permission to copy all or part of this work is granted, *
* provided that the copies are not made or distributed *
* for resale, and that the copyright notice and this *
* notice are retained. *
* *
* subroutine bistbl *
* Copyright (c) 1995 by D.R. Fokkema. *
* Permission to copy all or part of this work is granted, *
* provided that the copies are not made or distributed *
* for resale, and that the copyright notice and this *
* notice are retained. *
***********************************************************/
bool CCurrentPDESolver::bicgstabl(const int l, const CSparseMatrix *pdeMatrix, double *solution, const double *rightHandSide, const int maxIter, double *thresh, FILE *infoFile, bool fastmode) {
double **r;
try { r = new double *[l + 1]; } catch(...) { r = NULL; }
if (r == NULL) NewException((double)(l + 1) * sizeof(double *), __FILE__, __LINE__, __PRETTY_FUNCTION__);
double **u;
try { u = new double *[l + 1]; } catch(...) { u = NULL; }
if (u == NULL) NewException((double)(l + 1) * sizeof(double *), __FILE__, __LINE__, __PRETTY_FUNCTION__);
int i, j, k;
for (i = 0; i < l + 1; i++) {
try { r[i] = new double[pdeMatrix->m_size]; } catch(...) { r[i] = NULL; }
if (r[i] == NULL) NewException((double)pdeMatrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
try { u[i] = new double[pdeMatrix->m_size]; } catch(...) { u[i] = NULL; }
if (u[i] == NULL) NewException((double)pdeMatrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
}
double *r0;
try { r0 = new double[pdeMatrix->m_size]; } catch(...) { r0 = NULL; }
if (r0 == NULL) NewException((double)pdeMatrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
double *b;
try { b = new double[pdeMatrix->m_size]; } catch(...) { b = NULL; }
if (b == NULL) NewException((double)pdeMatrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
double *x;
try { x = new double[pdeMatrix->m_size]; } catch(...) { x = NULL; }
if (x == NULL) NewException((double)pdeMatrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
double alpha, beta, omega, sigma, rho0, rho1;
double *rwork;
try { rwork = new double[(l + 1) * (3 + l + 1)]; } catch(...) { rwork = NULL; }
if (rwork == NULL) NewException((double)(l + 1) * (3 + l + 1) * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
double *rtemp;
try { rtemp = new double[(l - 1) * (l - 1)]; } catch(...) { rtemp = NULL; }
if (rtemp == NULL) NewException((double)(l - 1) * (l - 1) * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
int *rperm;
try { rperm = new int[l - 1]; } catch(...) { rperm = NULL; }
if (rperm == NULL) NewException((double)(l - 1) * sizeof(int), __FILE__, __LINE__, __PRETTY_FUNCTION__);
int z = 0;
int y0 = z + (l + 1);
int y1 = y0 + 1;
int y = y1 + 1;
double kappa0, kappal, varrho, hatgamma;
double resNorm0, maxNormX, maxNormR;
double retVal;
double *bestsol, bestresi;
if (fastmode) {
try { bestsol = new double[pdeMatrix->m_size]; } catch(...) { bestsol = NULL; }
if (bestsol == NULL) NewException((double)pdeMatrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
bestresi = 1.0e30;
} else
bestsol = NULL;
if (infoFile != NULL)
fprintf(infoFile, " Starting BICGSTABL(%d) with %d maximum iterations and %g threshold\n", l, maxIter, *thresh);
for (i=0;im_size;k++)
u[i][k] = 0;
CSparseMatrix precondMatrix(*pdeMatrix);
CILUPreconditioner::precondition(&precondMatrix);
pdeMatrix->matrixVectorProduct(solution, r[0]);
for (i = 0; i < pdeMatrix->m_size; i++)
r[0][i] = rightHandSide[i] - r[0][i];
CILUPreconditioner::solve(&precondMatrix, r[0]);
// mprintf(GREEN, "%#.10g\n", r[0][10]);
double resNorm = 0.0;
for (i = 0; i < pdeMatrix->m_size; i++) {
resNorm += r[0][i] * r[0][i];
r0[i] = r[0][i];
b[i] = r[0][i];
x[i] = solution[i];
solution[i] = 0.0;
}
resNorm = sqrt(resNorm);
if (infoFile != NULL) {
fprintf(infoFile, " %5d %20.14g\n", 0, resNorm);
fflush(infoFile);
}
if (g_bROA
)
mprintf("#");
resNorm0 = resNorm;
maxNormX = resNorm0;
maxNormR = resNorm0;
retVal = resNorm0;
alpha = 0.0;
omega = 1.0;
sigma = 1.0;
rho0 = 1.0;
int numIter = 0;
while (numIter < maxIter && resNorm > *thresh) {
numIter++;
rho0 *= -omega;
for (i = 0; i < l; i++) {
rho1 = 0.0;
for (j = 0; j < pdeMatrix->m_size; j++)
rho1 += r0[j] * r[i][j];
if (rho0 == 0.0) {
eprintf("CCurrentPDESolver::BiCGSTABl(): Error: Rho0 is zero!\n");
abort();
}
beta = alpha * (rho1 / rho0);
rho0 = rho1;
for (j = 0; j <= i; j++)
for (k = 0; k < pdeMatrix->m_size; k++)
u[j][k] = r[j][k] - beta * u[j][k];
pdeMatrix->matrixVectorProduct(u[i], u[i + 1]);
CILUPreconditioner::solve(&precondMatrix, u[i + 1]);
sigma = 0.0;
for (j = 0; j < pdeMatrix->m_size; j++)
sigma += r0[j] * u[i + 1][j];
if (sigma == 0.0) {
eprintf("CCurrentPDESolver::BiCGSTABl(): Error: Sigma is zero!\n");
abort();
}
alpha = rho1 / sigma;
for (j = 0; j < pdeMatrix->m_size; j++)
solution[j] += alpha * u[0][j];
for (j = 0; j <= i; j++)
for (k = 0; k < pdeMatrix->m_size; k++)
r[j][k] -= alpha * u[j + 1][k];
pdeMatrix->matrixVectorProduct(r[i], r[i + 1]);
CILUPreconditioner::solve(&precondMatrix, r[i + 1]);
resNorm = 0.0;
for (j = 0; j < pdeMatrix->m_size; j++)
resNorm += r[0][j] * r[0][j];
resNorm = sqrt(resNorm);
// mprintf(GREEN, "%#.14g %#.10g\n", resNorm, r[0][1942857]);
if (resNorm > maxNormX)
maxNormX = resNorm;
if (resNorm > maxNormR)
maxNormR = resNorm;
}
for (i = 0; i < l + 1; i++) {
for (j = 0; j < l + 1 - i; j++) {
rwork[(z + i) * (l + 1) + i + j] = 0.0;
for (k = 0; k < pdeMatrix->m_size; k++)
rwork[(z + i) * (l + 1) + i + j] += r[i + j][k] * r[i][k];
}
for (j = 0; j < l - i; j++)
rwork[(z + i + 1 + j) * (l + 1) + i] = rwork[(z + i) * (l + 1) + i + 1 + j];
}
for (i = 0; i < (l - 1); i++)
for (j = 0; j < (l - 1); j++)
rtemp[i * (l - 1) + j] = rwork[(z + i + 1) * (l + 1) + j + 1];
luFactorization(rtemp, rperm, l - 1);
rwork[y0 * (l + 1)] = -1.0;
for (i = 0; i < l - 1; i++)
rwork[y0 * (l + 1) + i + 1] = rwork[z * (l + 1) + i + 1];
forwardBackward(rtemp, rperm, l - 1, &rwork[y0 * (l + 1) + 1]);
rwork[y0 * (l + 1) + l] = 0.0;
rwork[y1 * (l + 1)] = 0.0;
for (i = 0; i < l - 1; i++)
rwork[y1 * (l + 1) + i + 1] = rwork[(z + l) * (l + 1) + i + 1];
forwardBackward(rtemp, rperm, l - 1, &rwork[y1 * (l + 1) + 1]);
rwork[y1 * (l + 1) + l] = -1.0;
for (i = 0; i < l + 1; i++) {
rwork[y * (l + 1) + i] = 0.0;
for (j = 0; j < l + 1; j++)
rwork[y * (l + 1) + i] += rwork[(z + i) * (l + 1) + j] * rwork[y0 * (l + 1) + j];
}
kappa0 = 0.0;
for (i = 0; i < l + 1; i++)
kappa0 += rwork[y0 * (l + 1) + i] * rwork[y * (l + 1) + i];
kappa0 = sqrt(kappa0);
for (i = 0; i < l + 1; i++) {
rwork[y * (l + 1) + i] = 0.0;
for (j = 0; j < l + 1; j++)
rwork[y * (l + 1) + i] += rwork[(z + i) * (l + 1) + j] * rwork[y1 * (l + 1) + j];
}
kappal = 0.0;
for (i = 0; i < l + 1; i++)
kappal += rwork[y1 * (l + 1) + i] * rwork[y * (l + 1) + i];
kappal = sqrt(kappal);
for (i = 0; i < l + 1; i++) {
rwork[y * (l + 1) + i] = 0.0;
for (j = 0; j < l + 1; j++)
rwork[y * (l + 1) + i] += rwork[(z + i) * (l + 1) + j] * rwork[y0 * (l + 1) + j];
}
varrho = 0.0;
for (i = 0; i < l + 1; i++)
varrho += rwork[y1 * (l + 1) + i] * rwork[y * (l + 1) + i];
varrho /= (kappa0 * kappal);
if (fabs(varrho) < 0.7)
#ifdef TARGET_WINDOWS
hatgamma = _copysign(1.0, varrho) * 0.7 * (kappa0 / kappal);
#else
hatgamma = copysign(1.0, varrho) * 0.7 * (kappa0 / kappal);
#endif
else
#ifdef TARGET_WINDOWS
hatgamma = _copysign(1.0, varrho) * fabs(varrho) * (kappa0 / kappal);
#else
hatgamma = copysign(1.0, varrho) * fabs(varrho) * (kappa0 / kappal);
#endif
for (i = 0; i < l + 1; i++)
rwork[y0 * (l + 1) + i] -= hatgamma * rwork[y1 * (l + 1) + i];
omega = rwork[y0 * (l + 1) + l];
for (i = 0; i < pdeMatrix->m_size; i++)
for (j = 0; j < l; j++)
u[0][i] -= u[j + 1][i] * rwork[y0 * (l + 1) + j + 1];
for (i = 0; i < pdeMatrix->m_size; i++)
for (j = 0; j < l; j++)
solution[i] += r[j][i] * rwork[y0 * (l + 1) + j + 1];
for (i = 0; i < pdeMatrix->m_size; i++)
for (j = 0; j < l; j++)
r[0][i] -= r[j + 1][i] * rwork[y0 * (l + 1) + j + 1];
for (i = 0; i < l + 1; i++) {
rwork[y * (l + 1) + i] = 0.0;
for (j = 0; j < l + 1; j++)
rwork[y * (l + 1) + i] += rwork[(z + i) * (l + 1) + j] * rwork[y0 * (l + 1) + j];
}
resNorm = 0.0;
for (i = 0; i < l + 1; i++)
resNorm += rwork[y0 * (l + 1) + i] * rwork[y * (l + 1) + i];
resNorm = sqrt(resNorm);
if (resNorm < retVal)
retVal = resNorm;
if (infoFile != NULL) {
fprintf(infoFile, " %5d %20.14g\n", numIter, resNorm);
fflush(infoFile);
}
if (g_bROA
)
mprintf("#");
if (resNorm > maxNormX)
maxNormX = resNorm;
if (resNorm > maxNormR)
maxNormR = resNorm;
if ((resNorm < 0.01 * maxNormR && resNorm0 < maxNormR) || (resNorm < 0.01 * resNorm0 && resNorm0 < maxNormX)) {
if (infoFile != NULL)
fprintf(infoFile, " Updating residuals\n");
if (g_bROA
)
mprintf("*");
pdeMatrix->matrixVectorProduct(solution, r[0]);
CILUPreconditioner::solve(&precondMatrix, r[0]);
for (i = 0; i < pdeMatrix->m_size; i++)
r[0][i] = b[i] - r[0][i];
maxNormR = resNorm;
if (resNorm < 0.01 * resNorm0 && resNorm0 < maxNormX) {
if (infoFile != NULL)
fprintf(infoFile, " On-the-fly restart\n");
if (g_bROA
)
mprintf("+");
for (i = 0; i < pdeMatrix->m_size; i++) {
x[i] += solution[i];
solution[i] = 0.0;
b[i] = r[0][i];
}
maxNormX = resNorm;
}
}
if (fastmode && (resNorm < bestresi)) {
bestresi = resNorm;
for (i = 0; i < pdeMatrix->m_size; i++)
bestsol[i] = solution[i] + x[i];
}
}
if ((resNorm <= *thresh) && (numIter == maxIter)) // Detect convergence in last step
numIter--;
if (fastmode) {
for (i = 0; i < pdeMatrix->m_size; i++)
solution[i] = bestsol[i];
} else {
for (i = 0; i < pdeMatrix->m_size; i++)
solution[i] += x[i];
}
pdeMatrix->matrixVectorProduct(solution, r[0]);
for (i = 0; i < pdeMatrix->m_size; i++)
r[0][i] = rightHandSide[i] - r[0][i];
CILUPreconditioner::solve(&precondMatrix, r[0]);
resNorm = 0.0;
for (i = 0; i < pdeMatrix->m_size; i++)
resNorm += r[0][i] * r[0][i];
resNorm = sqrt(resNorm);
if (infoFile != NULL) {
fprintf(infoFile, " Final %20.14g\n", resNorm);
if (numIter == maxIter)
fprintf(infoFile, " Not converged\n");
}
if (g_bROA
) {
if (numIter == maxIter)
mprintf("N");
else
mprintf("C");
}
for (i = 0; i < l + 1; i++) {
delete[] r[i];
delete[] u[i];
}
delete[] r;
delete[] u;
delete[] r0;
delete[] b;
delete[] x;
delete[] rwork;
delete[] rtemp;
delete[] rperm;
if (fastmode)
delete[] bestsol;
*thresh = retVal;
return !(numIter == maxIter);
}
double CCurrentPDESolver::calcResidual(const CSparseMatrix *pdeMatrix, const double *solution, const double *rightHandSide) {
double *temp;
try { temp = new double[pdeMatrix->m_size]; } catch(...) { temp = NULL; }
if (temp == NULL) NewException((double)pdeMatrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
CSparseMatrix precondMatrix(*pdeMatrix);
CILUPreconditioner::precondition(&precondMatrix);
pdeMatrix->matrixVectorProduct(solution, temp);
int i;
for (i = 0; i < pdeMatrix->m_size; i++) {
temp[i] = rightHandSide[i] - temp[i];
}
CILUPreconditioner::solve(&precondMatrix, temp);
double resNorm = 0.0;
for (i = 0; i < pdeMatrix->m_size; i++) {
resNorm += temp[i] * temp[i];
}
resNorm = sqrt(resNorm);
delete[] temp;
return resNorm;
}
void CCurrentPDESolver::luFactorization(double *matrix, int *perm, int size) {
int i;
for (i = 0; i < size; i++) {
double max = fabs(matrix[i * size + i]);
int maxRow = i;
int j;
for (j = i; j < size; j++) {
if (fabs(matrix[j * size + i]) > max) {
max = fabs(matrix[j * size + i]);
maxRow = j;
}
}
if (maxRow != i) {
for (j = 0; j < size; j++) {
double temp = matrix[i * size + j];
matrix[i * size + j] = matrix[maxRow * size + j];
matrix[maxRow * size + j] = temp;
}
}
perm[i] = maxRow;
int k;
for (k = 0; k < i; k++) {
matrix[i * size + k] /= matrix[k * size + k];
for (j = k + 1; j < size; j++) {
matrix[i * size + j] -= matrix[i * size + k] * matrix[k * size + j];
}
}
}
}
void CCurrentPDESolver::forwardBackward(double *luMatrix, int *perm, int size, double *sol) {
int i;
for (i = 0; i < size; i++) {
if (perm[i] != i) {
double temp = sol[i];
sol[i] = sol[perm[i]];
sol[perm[i]] = temp;
}
}
for (i = 0; i < size; i++) {
int j;
for (j = 0; j < i; j++) {
sol[i] -= luMatrix[i * size + j] * sol[j];
}
}
for (i = size - 1; i >= 0; i--) {
int j;
for (j = size - 1; j > i; j--) {
sol[i] -= luMatrix[i * size + j] * sol[j];
}
sol[i] /= luMatrix[i * size + i];
}
}
void CILUPreconditioner::precondition(CSparseMatrix *matrix) {
// mprintf(GREEN, "%#.10g\n", matrix->m_val[13600000]);
int *diagInd;
try { diagInd = new int[matrix->m_size]; } catch(...) { diagInd = NULL; }
if (diagInd == NULL) NewException((double)matrix->m_size * sizeof(double), __FILE__, __LINE__, __PRETTY_FUNCTION__);
int i;
for (i = 0; i < matrix->m_size; i++) {
diagInd[i] = -1;
int j;
for (j = matrix->m_rowPtr[i]; j < matrix->m_rowPtr[i + 1]; j++) {
if (i == matrix->m_colInd[j]) {
diagInd[i] = j;
break;
}
}
if (diagInd[i] == -1) {
eprintf("CILUPreconditioner::precondition(): Error: Missing diagonal element in row %d!\n", i + 1);
abort();
}
}
for (i = 1; i < matrix->m_size; i++) {
int k;
for (k = matrix->m_rowPtr[i]; matrix->m_colInd[k] < i && k < matrix->m_rowPtr[i + 1]; k++) {
matrix->m_val[k] /= matrix->m_val[diagInd[matrix->m_colInd[k]]];
int j;
for (j = k + 1; j < matrix->m_rowPtr[i + 1]; j++) {
int l;
for (l = matrix->m_rowPtr[matrix->m_colInd[k]]; l < matrix->m_rowPtr[matrix->m_colInd[k] + 1]; l++) {
if (matrix->m_colInd[l] == matrix->m_colInd[j]) {
matrix->m_val[j] -= matrix->m_val[k] * matrix->m_val[l];
break;
}
}
}
}
}
delete[] diagInd;
}
void CILUPreconditioner::solve(CSparseMatrix *matrix, double *vect) {
int i;
// mprintf(GREEN, "%#.10g\n", vector[1953124]);
for (i = 0; i < matrix->m_size; i++) {
int j;
for (j = matrix->m_rowPtr[i]; matrix->m_colInd[j] < i && j < matrix->m_rowPtr[i + 1]; j++) {
vect[i] -= matrix->m_val[j] * vect[matrix->m_colInd[j]];
// if (i == 1953124) {
// mprintf(GREEN, "%d %#.10g %#.10g\n", j, matrix->m_val[j], vector[matrix->m_colInd[j]]);
// }
}
}
// mprintf(GREEN, "%#.10g\n", vector[1953124]);
for (i = matrix->m_size - 1; i >= 0; i--) {
int j;
for (j = matrix->m_rowPtr[i + 1] - 1; matrix->m_colInd[j] > i && j >= matrix->m_rowPtr[i]; j--) {
vect[i] -= matrix->m_val[j] * vect[matrix->m_colInd[j]];
// if (i == 1953124) {
// mprintf(GREEN, "%d %#.10g %#.10g\n", j, matrix->m_val[j], vector[matrix->m_colInd[j]]);
// }
}
for (j = matrix->m_rowPtr[i]; j < matrix->m_rowPtr[i + 1]; j++) {
if (matrix->m_colInd[j] == i) {
vect[i] /= matrix->m_val[j];
break;
}
}
}
// mprintf(GREEN, "%#.10g\n", vector[1953124]);
}
travis-src-190101/src/bicgstab.h 0100777 0000000 0000000 00000005137 13412725656 013401 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Thomas.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
#ifndef BICGSTAB_H
#define BICGSTAB_H
// This must always be the first include directive
#include "config.h"
#include "3df.h"
#include
class CxDoubleArray;
class CSparseMatrix {
public:
friend class CCurrentPDEDiscretizer;
friend class CCurrentPDESolver;
friend class CILUPreconditioner;
CSparseMatrix();
CSparseMatrix(const CSparseMatrix &matrix);
~CSparseMatrix();
void setTest();
void matrixVectorProduct(const double *vect, double *result) const;
private:
int m_size;
double *m_val;
int *m_colInd;
int *m_rowPtr;
};
class CCurrentPDEDiscretizer {
public:
static void discretize(CSparseMatrix *pdeMatrix, const C3DF &electronDensity, const C3DF &electronDensityGradientX, const C3DF &electronDensityGradientY, const C3DF &electronDensityGradientZ);
};
class CCurrentPDESolver {
public:
static bool bicgstabl(const int l, const CSparseMatrix *pdeMatrix, double *solution, const double *rightHandSide, const int maxIter, double *thresh, FILE *infoFile, bool fastmode=false);
static double calcResidual(const CSparseMatrix *pdeMatrix, const double *solution, const double *rightHandSide);
private:
static void luFactorization(double *matrix, int *perm, int size);
static void forwardBackward(double *luMatrix, int *perm, int size, double *sol);
};
class CILUPreconditioner {
public:
static void precondition(CSparseMatrix *matrix);
static void solve(CSparseMatrix *matrix, double *vect);
};
#endif
travis-src-190101/src/bintools.cpp 0100777 0000000 0000000 00000044253 13412725630 014001 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "bintools.h"
#include "travis.h"
const char *GetRevisionInfo_bintools(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bintools() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
/*void CMSDF::CalcHistogram()
{
BTIN;
int z, z2, t;
m_fMaxAvg = 0;
for (z=0;z z*m_fMaxAvg/(g_iHistogramRes-1)) && (m_pBin[z2] <= (z+1)*m_fMaxAvg/(g_iHistogramRes-1)))
t++;
}
m_pHistogram[z] = (double)t;
}
BTOUT;
}
void CMSDF::NormHistogramIntegral()
{
BTIN;
int z;
double f;
f = 0;
for (z=0;z z*m_fMaxP[z0]/(g_iHistogramRes-1)) && (m_pBin[z0][z2] <= (z+1)*m_fMaxP[z0]/(g_iHistogramRes-1)))
t++;
m_pHistogram[z0][z] = (double)t;
}
}
BTOUT;
}*/
/*void CS6DF::WriteHistogram(const char *prefix, const char *name, const char *suffix)
{
BTIN;
FILE *a;
int z, z0;
char buf[256], buf2[32];
for (z0=0;z0 m_fRadius)
{
BXOUT;
return;
}
if (m_bCutSDF)
{
switch(m_iCutPlane)
{
case 0:
if (vec[0] > g_fCutValue)
{
BXOUT;
return;
}
break;
case 1:
if (vec[1] > g_fCutValue)
{
BXOUT;
return;
}
break;
case 2:
if (vec[2] > g_fCutValue)
{
BXOUT;
return;
}
break;
}
}
d = val.GetLength();
// printf("AddToBin x=%f y=%f z=%f d=%f Level=%d\n",vec[0],vec[1],vec[2],d,m_iLevelCount);
m_fGesBinEntries++;
x = ((vec[0]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
y = ((vec[1]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
z = ((vec[2]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
ix = (int)floor(x);
iy = (int)floor(y);
iz = (int)floor(z);
j = 0;
while (d > m_fLevelThres[j])
{
j++;
if (j >= m_iLevelCount)
break;
}
if (j >= m_iLevelCount)
j = m_iLevelCount-1;
// printf(" Ok. x=%f y=%f z=%f d=%f j=%d Level=%d\n",vec[0],vec[1],vec[2],d,j,g_iLevelCount);
m_fBinEntries[j]++;
// switch(g_iBinning)
// {
// case 1: // Einfach einsortieren
// m_pBin[j][iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] += 1.0f;
// break;
// case 2: // Auf 8 Bins aufspalten
x -= ix;
y -= iy;
z -= iz;
tx = 1-x;
ty = 1-y;
tz = 1-z;
m_pBin[j][iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] += tx*ty*tz;
m_pBin[j][iz*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] += x*ty*tz;
m_pBin[j][iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] += tx* y*tz;
m_pBin[j][iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] += x* y*tz;
m_pBin[j][(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix] += tx*ty* z;
m_pBin[j][(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] += x*ty* z;
m_pBin[j][(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] += tx* y* z;
m_pBin[j][(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] += x* y* z;
// break;
// default:
// printf("CS6DF::AddToBin(): Error!\n");
// break;
// }
// printf(" Fertig.\n");
BXOUT;
}*/
/*void CMSDF::AddToBinMean(const CxVector3 &vec, const CxVector3 &val)
{
BXIN;
double x, y, z, tx, ty, tz, v;
int ix, iy, iz;
if (vec.GetLength() > g_fSDFRadius)
{
BXOUT;
return;
}
if (g_bCutSDF)
{
switch(g_iCutPlane)
{
case 0:
if (vec[0] > g_fCutValue)
{
BXOUT;
return;
}
break;
case 1:
if (vec[1] > g_fCutValue)
{
BXOUT;
return;
}
break;
case 2:
if (vec[2] > g_fCutValue)
{
BXOUT;
return;
}
break;
}
}
v = val.GetLength();
m_fBinEntries++;
x = ((vec[0]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
y = ((vec[1]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
z = ((vec[2]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
ix = (int)floor(x);
iy = (int)floor(y);
iz = (int)floor(z);
// printf("AddToBin x=%f y=%f z=%f d=%f\n",vec[0],vec[1],vec[2],v);
// switch(g_iBinning)
// {
// case 1: // Einfach einsortieren
// m_pBin [iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] += v;
// m_pRefBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] += 1.0;
// break;
// case 2: // Auf 8 Bins aufspalten
x -= ix;
y -= iy;
z -= iz;
tx = 1-x;
ty = 1-y;
tz = 1-z;
m_pBin [iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] += tx*ty*tz*v;
m_pBin [iz*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] += x*ty*tz*v;
m_pBin [iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] += tx* y*tz*v;
m_pBin [iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] += x* y*tz*v;
m_pBin [(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix] += tx*ty* z*v;
m_pBin [(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] += x*ty* z*v;
m_pBin [(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] += tx* y* z*v;
m_pBin [(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] += x* y* z*v;
m_pRefBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] += tx*ty*tz;
m_pRefBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] += x*ty*tz;
m_pRefBin[iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] += tx* y*tz;
m_pRefBin[iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] += x* y*tz;
m_pRefBin[(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix] += tx*ty* z;
m_pRefBin[(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] += x*ty* z;
m_pRefBin[(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] += tx* y* z;
m_pRefBin[(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] += x* y* z;
// break;
// default:
// printf("CMSDF::AddToBin(): Error!\n");
// break;
// }
BXOUT;
}*/
/*void CMSDF::AddToBinMax(const CxVector3 &vec, const CxVector3 &val)
{
BXIN;
double x, y, z, tx, ty, tz, v;
int ix, iy, iz;
if (vec.GetLength() > g_fSDFRadius)
{
BXOUT;
return;
}
if (g_bCutSDF)
{
switch(g_iCutPlane)
{
case 0:
if (vec[0] > g_fCutValue)
{
BXOUT;
return;
}
break;
case 1:
if (vec[1] > g_fCutValue)
{
BXOUT;
return;
}
break;
case 2:
if (vec[2] > g_fCutValue)
{
BXOUT;
return;
}
break;
}
}
v = val.GetLength();
m_fBinEntries++;
x = ((vec[0]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
y = ((vec[1]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
z = ((vec[2]+g_fSDFRadius)/(2*g_fSDFRadius))*((double)g_iSDFResolution-1);
ix = (int)floor(x);
iy = (int)floor(y);
iz = (int)floor(z);
// printf("AddToBin x=%f y=%f z=%f d=%f\n",vec[0],vec[1],vec[2],v);
// switch(g_iBinning)
// {
// case 1: // Einfach einsortieren
// if (m_pBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] < v)
// m_pBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] = v;
// break;
// case 2: // Auf 8 Bins aufspalten
x -= ix;
y -= iy;
z -= iz;
tx = 1-x;
ty = 1-y;
tz = 1-z;
if (m_pBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] < tx*ty*tz*v)
m_pBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix] = tx*ty*tz*v;
if (m_pBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] < x*ty*tz*v)
m_pBin[iz*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] = x*ty*tz*v;
if (m_pBin[iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] < tx* y*tz*v)
m_pBin[iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] = tx* y*tz*v;
if (m_pBin[iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] < x* y*tz*v)
m_pBin[iz*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] = x* y*tz*v;
if (m_pBin[(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix] < tx*ty* z*v)
m_pBin[(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix] = tx*ty* z*v;
if (m_pBin[(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] < x*ty* z*v)
m_pBin[(iz+1)*g_iSDFResSqr + iy*g_iSDFResolution + ix +1] = x*ty* z*v;
if (m_pBin[(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] < tx* y* z*v)
m_pBin[(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix] = tx* y* z*v;
if (m_pBin[(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] < x* y* z*v)
m_pBin[(iz+1)*g_iSDFResSqr + (iy+1)*g_iSDFResolution + ix +1] = x* y* z*v;
// break;
// default:
// printf("CMSDF::AddToBin(): Error!\n");
// break;
// }
BXOUT;
}*/
/*
void CMRDF::AddToBin(double d, double val[3])
{
double p, v;
int ip;
if (d > g_fRDFRadius)
return;
v = length(val);
m_fBinEntries++;
p = (d/g_fRDFRadius)*(g_iRDFResolution-1.0);
ip = floor(p);
switch(g_iBinning)
{
case 1: // Einfach einsortieren
m_pBin [ip] += v;
m_pRefBin[ip] += 1.0;
break;
case 2: // Auf 2 Bins aufspalten
p -= ip;
m_pBin [ip] += v*(1-p);
m_pBin [ip+1] += v* p;
m_pRefBin[ip] += (1-p);
m_pRefBin[ip+1] += p;
break;
default:
printf("CMRDF::AddToBin(): Error!\n");
break;
}
}
*/
CAF::CAF()
{
m_pBin = NULL;
m_pDBin = NULL;
m_faEntries.SetName("CAF::m_faEntries");
}
CAF::~CAF()
{
}
void CAF::AddToBin(double x, double y)
{
BXIN;
double p;
int ip;
if ((x < m_fMinVal) || (x > m_fMaxVal))
{
BXOUT;
return;
}
m_fBinEntries++;
p = ((x-m_fMinVal)/(m_fMaxVal-m_fMinVal))*(m_iResolution-1.0);
ip = (int)floor(p);
// switch(g_iBinning)
// {
// case 1: // Einfach einsortieren
// m_pBin[ip] += y;
// m_faEntries[ip]++;
// break;
// case 2: // Auf 2 Bins aufspalten
p -= ip;
m_pBin[ip] += (1-p)*y;
m_pBin[ip+1] += p *y;
m_faEntries[ip] += (1-p);
m_faEntries[ip+1] += p;
// break;
// default:
// printf("CDF::AddToBin(): Error!\n");
// break;
// }
BXOUT;
}
void CAF::AddToBin_Index(int i, double y)
{
BXIN;
if ((i < 0) || (i >= m_iResolution))
{
BXOUT;
return;
}
m_fBinEntries++;
// switch(g_iBinning)
// {
// case 1: // Einfach einsortieren
// m_pBin[ip] += y;
// m_faEntries[ip]++;
// break;
// case 2: // Auf 2 Bins aufspalten
m_pBin[i] += y;
m_faEntries[i]++;
// break;
// default:
// printf("CDF::AddToBin(): Error!\n");
// break;
// }
BXOUT;
}
void CAF::BuildAverage()
{
BTIN;
int z;
for (z=0;zm_waSingleMolIndex.GetSize();
if (f < m_pBin[z2][z])
f = m_pBin[z2][z];
}
}
BTOUT;
return f;
}*/
/*void CMSDF::Create()
{
BTIN;
int z;
m_fBinEntries = 0;
m_pBin = new double[g_iSDFResTri];
m_pRefBin = new double[g_iSDFResTri];
// m_pDBin[0] = new double[g_iSDFResTri];
// m_pDBin[1] = new double[g_iSDFResTri];
// m_pDBin[2] = new double[g_iSDFResTri];
for (z=0;z.
*****************************************************************************/
#ifndef BINTOOLS_H
#define BINTOOLS_H
// This must always be the first include directive
#include "config.h"
#include
#include
#include "xdvector3.h"
#include "xdoublearray.h"
#include "backtrace.h"
/*class CS6DF : public CxObject
{
public:
CS6DF();
~CS6DF();
void AddToBin(const CxVector3 &vec, const CxVector3 &val);
double NormalizeBin(double mi, double ma);
double PPMBin();
void Write(const char *prefix, const char *name, const char *suffix);
void Create();
void WriteHistogram(const char *prefix, const char *name, const char *suffix);
void CalcHistogram();
// double m_fRadius;
// int m_iResolution, m_iResSqr, m_iResTri;
int m_iLevelCount;
double m_fLevelThres[32];
double *m_pHistogram[32];
// double *m_pDHistogram[32];
double *m_pBin[32];
// double *m_pDBin[3][32];
double m_fMaxP[32];
// double m_fMaxDP[32];
double m_fBinEntries[32];
double m_fGesBinEntries;
};
class CMSDF : public CxObject
{
public:
CMSDF() { };
~CMSDF() { };
void AddToBinMean(const CxVector3 &vec, const CxVector3 &val);
void AddToBinMax(const CxVector3 &vec, const CxVector3 &val);
double NormalizeBin(double mi, double ma);
void Write(const char *prefix, const char *name, const char *suffix);
void Create();
void CalcAvg();
void WriteHistogram(const char *prefix, const char *name, const char *suffix);
void CalcHistogram();
void NormHistogramIntegral();
// double *m_pDBin[3];
double m_fMaxAvg;
double *m_pHistogram;
// double m_fRadius;
// int m_iResolution, m_iResSqr, m_iResTri;
double *m_pBin;
double *m_pRefBin;
double m_fBinEntries;
};
class CMRDF
{
public:
CMRDF() { };
~CMRDF() { };
void AddToBin(double d, double vec[3]);
double NormalizeBin(double mi, double ma);
void Write(char *s);
void Create();
int m_iLevelCount;
double m_fLevelMin, m_fLevelMax;
double *m_pDBin[3];
// double m_fRadius;
// int m_iResolution;
double *m_pBin;
double *m_pRefBin;
double m_fBinEntries;
};
*/
class CAF : public CxObject
{
public:
void LinReg(int i1, int i2, double *a0, double *a1, double *r);
void CalcDeriv(double f);
CAF();
~CAF();
void AddToBin(double x, double y);
void AddToBin_Index(int i, double y);
void Write(const char *prefix, const char *name, const char *suffix);
void Create();
void BuildAverage();
double m_fMinVal, m_fMaxVal;
int m_iResolution;
double *m_pBin;
double *m_pDBin;
double m_fBinEntries;
CxDoubleArray m_faEntries;
};
class CNDF : public CxObject
{
public:
CNDF() { };
~CNDF() { };
// void MultiplyBin(double m);
// void AddToBin(double x, const CxVector3 &vec);
/* void AddToBin(double x, int y);
void AddToBin(double x, double y, double val);
double NormalizeBin(double mi, double ma);
double PPMBin();
void Write(const char *prefix, const char *name, const char *suffix);
void WriteCSV(const char *prefix, const char *name, const char *suffix);
void WriteXProjection(const char *prefix, const char *name, const char *suffix);
void WriteYProjection(const char *prefix, const char *name, const char *suffix);
void WriteMathematica(const char *prefix, const char *name, const char *suffix);
void WriteLogMathematica(const char *prefix, const char *name, const char *suffix);
void WriteVHDFLogMathematica(const char *prefix, const char *name, const char *suffix);
void Create();
void AngleCorrect();
void AngleCorrectX();
void CorrectRadialDistX();*/
void AddToBin(double *d);
int m_iDimensions;
double *m_fMinVal;
double *m_fMaxVal;
double *m_fFac;
int *m_iRes;
double *m_pBin;
double m_fBinEntries;
};
#endif
travis-src-190101/src/bintree.cpp 0100777 0000000 0000000 00000003000 13412725616 013565 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "bintree.h"
const char *GetRevisionInfo_bintree(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bintree() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CBinTree::CBinTree()
{
}
CBinTree::~CBinTree()
{
}
travis-src-190101/src/bintree.h 0100777 0000000 0000000 00000002554 13412725667 013255 0 ustar 00 /*****************************************************************************
TRAVIS - Trajectory Analyzer and Visualizer
http://www.travis-analyzer.de/
Copyright (c) 2009-2019 Martin Brehm
2012-2019 Martin Thomas
2016-2019 Sascha Gehrke
This file was written by Martin Brehm.
---------------------------------------------------------------------------
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 .
*****************************************************************************/
// This must always be the first include directive
#include "config.h"
#include "xobject.h"
class CBinTree : public CxObject
{
public:
CBinTree();
~CBinTree();
CBinTree *m_pParent;
CBinTree *m_pChildren[2];
void *m_pValue;
};
travis-src-190101/src/bqb.h 0100777 0000000 0000000 00000003247 13412725666 012370 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
#ifndef BQB_H
#define BQB_H
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_format.h"
#include "bqb_driver.h"
#include "bqb_engine.h"
#endif
travis-src-190101/src/bqbtool.cpp 0100777 0000000 0000000 00000416613 13412725631 013616 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
// This must always be the first include directive
#include "bqb_config.h"
#include
#include
#include
#include
#include "bqb.h"
const char *GetRevisionInfo_bqbtool(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bqbtool() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
// Headers required for Linux stack trace
#ifndef BQB_INSIDE_TRAVIS
#if !defined(_WIN32) && (defined(__unix__) || defined(__unix) || (defined(__APPLE__) && defined(__MACH__)))
#include
#include
#endif
#endif
// Headers required for obtaining host name and working directory
#if !defined(_WIN32) && (defined(__unix__) || defined(__unix) || (defined(__APPLE__) && defined(__MACH__)))
#include
#elif defined(_WIN32)
#include
#include
#endif
char *gc_sExeName = NULL;
char *gc_sWorkingDir = NULL;
char *gc_sHostName = NULL;
FILE *gc_fLogFile = NULL;
CBQBInterface *gc_pBQBInterface = NULL;
bool gc_bCompress;
bool gc_bDecompress;
bool gc_bCheck;
bool gc_bCompare;
bool gc_bMerge;
bool gc_bSplit;
bool gc_bFile;
bool gc_bCube;
bool gc_bXYZ;
const char *gc_sInFile;
const char *gc_sOutFile;
const char *gc_sRefFile;
std::vector gc_sInFileList;
CBQBParameterSet_Compressor *gc_pParmFile = NULL;
int gc_iFileVerbose;
CBQBParameterSet_PosAndVol *gc_pParmVol = NULL;
int gc_iCubeStart;
int gc_iCubeSteps;
int gc_iCubeStride;
bool gc_bCubeKeepComment;
bool gc_bCubeCompare;
const char *gc_sCubeRefOut;
int gc_iCubeVerbose;
bool gc_bCubeDummyRead;
int gc_iCubeKey;
int gc_iCubeOptimize;
int gc_iCubeOptSteps;
bool gc_bCubeOnlyOpt;
int gc_iCubeOptIncludeFirst;
CBQBParameterSet_Position *gc_pParmPos = NULL;
int gc_iAtomStart;
int gc_iAtomSteps;
int gc_iAtomStride;
bool gc_bAtomKeepComment;
bool gc_bAtomCompare;
const char *gc_sAtomRefOut;
int gc_iAtomVerbose;
int gc_iAtomKey;
int gc_iAtomOptimize;
int gc_iAtomOptSteps;
bool gc_bAtomOnlyOpt;
int gc_iAtomOptIncludeFirst;
int gc_iCheckVerbose;
int gc_iCompareVerbose;
int gc_iMergeVerbose;
int gc_iSplitVerbose;
int gc_iSplitLength;
int gc_iSplitSteps;
bool gc_bOptTouched;
bool gc_bDryRun;
void CBQBStatistics::ResetStatistics() {
m_oaStatStack.clear();
m_oStat.reset();
}
void BQBWriteRevisionInfo() {
std::vector sa;
unsigned int z, len;
gc_pBQBInterface->printf("Revision information of the source code files:\n\n");
len = 0;
_begin:
sa.push_back( GetRevisionInfo_bqb_alphabet( len ) );
sa.push_back( GetRevisionInfo_bqb_bitset( len ) );
sa.push_back( GetRevisionInfo_bqb_crc( len ) );
sa.push_back( GetRevisionInfo_bqb_cubeframe( len ) );
sa.push_back( GetRevisionInfo_bqb_driver( len ) );
sa.push_back( GetRevisionInfo_bqb_engine( len ) );
sa.push_back( GetRevisionInfo_bqb_extrapolator( len ) );
sa.push_back( GetRevisionInfo_bqb_format( len ) );
sa.push_back( GetRevisionInfo_bqb_hilbert( len ) );
sa.push_back( GetRevisionInfo_bqb_hufftree( len ) );
sa.push_back( GetRevisionInfo_bqb_integerengine( len ) );
sa.push_back( GetRevisionInfo_bqb_interface( len ) );
sa.push_back( GetRevisionInfo_bqb_largeinteger( len ) );
sa.push_back( GetRevisionInfo_bqb_linalg( len ) );
sa.push_back( GetRevisionInfo_bqb_math( len ) );
sa.push_back( GetRevisionInfo_bqb_parmset( len ) );
sa.push_back( GetRevisionInfo_bqb_tools( len ) );
sa.push_back( GetRevisionInfo_bqbtool( len ) );
if (len == 0) {
for (z=0;z len)
len = strlen(sa[z]);
sa.clear();
goto _begin;
}
for (z=0;zprintf( " %s\n", sa[z] );
gc_pBQBInterface->printf( "\n");
}
void BQBCheckSourceVersion() {
const char *p;
bool b;
b = false;
p = GetSourceVersion_bqb_alphabet();
if (strcmp( p, GetSourceVersion_bqb_bitset() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_crc() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_cubeframe() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_driver() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_engine() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_extrapolator() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_format() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_hilbert() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_hufftree() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_integerengine() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_interface() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_largeinteger() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_linalg() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_math() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_parmset() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqb_tools() ) != 0) b = true;
if (strcmp( p, GetSourceVersion_bqbtool() ) != 0) b = true;
if (b) {
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->eprintf("!!!! Warning !!!!\n");
gc_pBQBInterface->printf("The object files do not belong to the same source code version.\n");
gc_pBQBInterface->printf("Something went wrong with compiling. Expect problems and crashes.\n");
gc_pBQBInterface->printf("\n");
BQBWriteRevisionInfo();
}
}
void CC_InitGlobalVars() {
gc_bOptTouched = false;
gc_sInFile = NULL;
gc_sOutFile = NULL;
gc_sRefFile = NULL;
gc_bCompress = false;
gc_bDecompress = false;
gc_bCheck = false;
gc_bCompare = false;
gc_bMerge = false;
gc_bSplit = false;
gc_bFile = false;
gc_bCube = false;
gc_bXYZ = false;
gc_pParmFile = new CBQBParameterSet_Compressor(*gc_pBQBInterface);
gc_pParmFile->SetTableCount( 6 );
gc_pParmFile->SetOptTables( false );
gc_pParmFile->SetBlockLength( 50 );
gc_pParmFile->SetBW( true );
gc_pParmFile->SetMTF( true );
gc_pParmFile->SetRLE( true );
gc_pParmFile->SetMaxIter( 10 );
gc_pParmFile->SetMaxChunk( 4194304 );
gc_iFileVerbose = 0;
gc_iCubeStart = 0;
gc_iCubeSteps = -1;
gc_iCubeStride = 1;
gc_bCubeKeepComment = true;
gc_bCubeCompare = true;
gc_sCubeRefOut = NULL;
gc_bCubeDummyRead = false;
gc_iCubeVerbose = 0;
gc_iCubeKey = 0;
gc_pParmVol = new CBQBParameterSet_PosAndVol(*gc_pBQBInterface);
gc_pParmVol->SetVolSigni(5);
gc_pParmVol->SetVolEps(12);
gc_pParmVol->SetVolOrder(8);
gc_pParmVol->SetVolOptOrder(true);
gc_pParmVol->SetVolHilbert(true);
gc_pParmVol->SetVolNbhFac(1.075);
gc_pParmVol->SetVolSplit(10);
gc_pParmVol->SetVolTableCount(6);
gc_pParmVol->SetVolOptTables(false);
gc_pParmVol->SetVolBlockLength(20);
gc_pParmVol->SetVolBW(false);
gc_pParmVol->SetVolMTF(false);
gc_pParmVol->SetVolMaxIter(10);
gc_pParmVol->SetVolRLE(true);
gc_pParmVol->SetVolMaxChunk(0);
gc_pParmVol->SetPosPrecision(6);
gc_pParmVol->SetPosOrder(8);
gc_pParmVol->SetPosOptOrder(true);
gc_pParmVol->SetPosSplit(14);
gc_pParmVol->SetPosTableCount(1);
gc_pParmVol->SetPosOptTables(false);
gc_pParmVol->SetPosBlockLength(40);
gc_pParmVol->SetPosBW(false);
gc_pParmVol->SetPosMTF(false);
gc_pParmVol->SetPosRLE(true);
gc_pParmVol->SetPosMaxIter(10);
gc_pParmVol->SetPosSortAtom(true);
gc_pParmVol->SetPosMaxChunk(0);
gc_pParmVol->SetVolUseExtra(true);
gc_pParmVol->SetVolExtraSRange(7);
gc_pParmVol->SetVolExtraTRange(6);
gc_pParmVol->SetVolExtraSOrder(3);
gc_pParmVol->SetVolExtraTOrder(2);
gc_pParmVol->SetVolExtraOffset(3);
gc_pParmVol->SetVolExtraCrossS(true);
gc_pParmVol->SetVolExtraCrossT(false);
gc_pParmVol->SetVolExtraWrap(true);
gc_pParmVol->SetVolExtraCrossRangeS(true);
gc_pParmVol->SetVolExtraCrossRangeT(false);
gc_pParmVol->SetVolExtraDistExpo(3.0);
gc_pParmVol->SetVolExtraTimeExpo(1.0);
gc_pParmVol->SetVolExtraPredCorr(true);
gc_pParmVol->SetPosUseExtra(true);
gc_pParmVol->SetPosExtraTRange(9);
gc_pParmVol->SetPosExtraTOrder(6);
gc_pParmVol->SetPosExtraTimeExpo(4.0);
gc_iCubeOptimize = 1;
gc_iCubeOptSteps = -1;
gc_bCubeOnlyOpt = false;
gc_iCubeOptIncludeFirst = -1;
gc_iAtomStart = 0;
gc_iAtomSteps = -1;
gc_iAtomStride = 1;
gc_bAtomKeepComment = true;
gc_bAtomCompare = true;
gc_sAtomRefOut = NULL;
gc_iAtomVerbose = 0;
gc_iAtomKey = 0;
gc_bDryRun = false;
gc_pParmPos = new CBQBParameterSet_Position(*gc_pBQBInterface);
gc_pParmPos->SetPrecision(5);
gc_pParmPos->SetOrder(8);
gc_pParmPos->SetOptOrder(true);
gc_pParmPos->SetSplit(14);
gc_pParmPos->SetTableCount(1);
gc_pParmPos->SetOptTables(false);
gc_pParmPos->SetBlockLength(40);
gc_pParmPos->SetBW(false);
gc_pParmPos->SetMTF(false);
gc_pParmPos->SetRLE(true);
gc_pParmPos->SetMaxIter(10);
gc_pParmPos->SetSortAtom(true);
gc_pParmPos->SetMaxChunk(0);
gc_pParmPos->SetUseExtra(true);
gc_pParmPos->SetExtraTRange(9);
gc_pParmPos->SetExtraTOrder(6);
gc_pParmPos->SetExtraTimeExpo(4.0);
gc_iAtomOptimize = 2;
gc_iAtomOptSteps = -1;
gc_bAtomOnlyOpt = false;
gc_iAtomOptIncludeFirst = -1;
gc_iCheckVerbose = 0;
gc_iCompareVerbose = 0;
gc_iMergeVerbose = 0;
gc_iSplitVerbose = 0;
gc_iSplitLength = -1;
gc_iSplitSteps = -1;
}
void CC_CommandLineHelp() {
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf("Command line usage:\n\n");
gc_pBQBInterface->printf(" compress {file|voltraj|postraj} [options] \n");
gc_pBQBInterface->printf(" decompress {file|voltraj|postraj} [options] \n");
/* gc_pBQBInterface->printf(" check [options] \n");
gc_pBQBInterface->printf(" compare [options] \n");
gc_pBQBInterface->printf(" merge [options] [infile2.bqb ...]\n");
gc_pBQBInterface->printf(" split [options] \n\n");*/
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("More operating modes (check, compare, split, merge) will be added soon.\n");
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("For volumetric trajectories, currently only the Gaussian Cube file format\n");
gc_pBQBInterface->printf("is supported.\n");
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("For position trajectories, currently only the XMol XYZ file format\n");
gc_pBQBInterface->printf("is supported. More formats will be added soon.\n");
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("In case of \"compress\" or \"decompress\", may be left out,\n");
gc_pBQBInterface->printf("then no output is written (e.g. to check compression ratio or timings).\n\n");
gc_pBQBInterface->printf("To see a list of possible options and their default values,\n");
gc_pBQBInterface->printf("enter the corresponding command without input and output file names.\n");
gc_pBQBInterface->printf("\n");
}
bool CC_ParseArguments(int argc, const char *argv[]) {
int z, i, ti;
double tf;
bool b;
gc_pBQBInterface->printf("Parsing command line arguments...\n");
if (argc < 3) {
gc_pBQBInterface->eprintf("Error: Not enough command line arguments.\n");
return false;
}
if (strcmp(argv[1],"compress") == 0)
gc_bCompress = true;
else if (strcmp(argv[1],"decompress") == 0)
gc_bDecompress = true;
/* else if (strcmp(argv[1],"check") == 0)
gc_bCheck = true;
else if (strcmp(argv[1],"compare") == 0)
gc_bCompare = true;
else if (strcmp(argv[1],"merge") == 0)
gc_bMerge = true;
else if (strcmp(argv[1],"split") == 0)
gc_bSplit = true;*/
else {
gc_pBQBInterface->eprintf("Error: Unknown first argument \"%s\".\n",argv[1]);
return false;
}
if (gc_bCheck) {
b = true;
i = 0;
for (z=2;zeprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iCheckVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iCheckVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iCheckVerbose = 0;
z++;
} else
gc_iCheckVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iCheckVerbose);
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
}
} else if (gc_bSplit) {
b = true;
i = 0;
for (z=2;zeprintf("Error: Missing value after \"-steps\".\n");
return false;
}
z++;
gc_iSplitSteps = atoi(argv[z]);
if ((gc_iSplitSteps < -1) || (gc_iSplitSteps == 0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-steps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are -1 (=all) or > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -steps %d\n",gc_iSplitSteps);
continue;
}
if (strcmp(argv[z],"-verbose") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iSplitVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iSplitVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iSplitVerbose = 0;
z++;
} else
gc_iSplitVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iSplitVerbose);
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outbasename %s\n",gc_sOutFile);
} else if (i == 2) {
gc_iSplitLength = atoi(argv[z]);
gc_pBQBInterface->printf(" splitlength %d\n",gc_iSplitLength);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
}
} else if (gc_bCompare) {
b = true;
i = 0;
for (z=2;zeprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iCompareVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iCompareVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iCompareVerbose = 0;
z++;
} else
gc_iCompareVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iCompareVerbose);
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sRefFile = argv[z];
gc_pBQBInterface->printf(" reffile %s\n",gc_sRefFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
}
} else if (gc_bMerge) {
b = true;
i = 0;
for (z=2;zeprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iMergeVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iMergeVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iMergeVerbose = 0;
z++;
} else
gc_iMergeVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iMergeVerbose);
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outfile %s\n",gc_sInFile);
} else {
gc_sInFileList.push_back(argv[z]);
gc_pBQBInterface->printf(" infile %s\n",argv[z]);
}
i++;
}
}
} else {
if (strcmp(argv[2],"file") == 0)
gc_bFile = true;
else if (strcmp(argv[2],"voltraj") == 0)
gc_bCube = true;
else if (strcmp(argv[2],"postraj") == 0)
gc_bXYZ = true;
else {
gc_pBQBInterface->eprintf("Error: Unknown second argument \"%s\".\n",argv[2]);
return false;
}
b = true;
i = 0;
for (z=3;zprintf(" -dryrun %s\n",gc_bDryRun?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pkey") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pkey\".\n");
return false;
}
z++;
if (!gc_pParmFile->FromKey(argv[z])) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pkey\": \"%s\".\n",argv[z]);
return false;
}
gc_pBQBInterface->printf(" -pkey %s\n",argv[z]);
continue;
}
if (strcmp(argv[z],"-tables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-tables\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 31)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-tables\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 31.\n");
return false;
}
gc_pParmFile->SetTableCount(ti);
gc_pBQBInterface->printf(" -tables %d\n",gc_pParmFile->GetTableCount());
continue;
}
if (strcmp(argv[z],"-opttables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-opttables\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmFile->SetOptTables(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmFile->SetOptTables(false);
z++;
} else
gc_pParmFile->SetOptTables(true);
gc_pBQBInterface->printf(" -opttables %s\n",gc_pParmFile->GetOptTables()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-block") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-block\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 31)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-block\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 255.\n");
return false;
}
gc_pParmFile->SetBlockLength(ti);
gc_pBQBInterface->printf(" -block %d\n",gc_pParmFile->GetBlockLength());
continue;
}
if (strcmp(argv[z],"-bw") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-bw\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmFile->SetBW(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmFile->SetBW(false);
z++;
} else
gc_pParmFile->SetBW(true);
gc_pBQBInterface->printf(" -bw %s\n",gc_pParmFile->GetBW()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-mtf") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-mtf\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmFile->SetMTF(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmFile->SetMTF(false);
z++;
} else
gc_pParmFile->SetMTF(true);
gc_pBQBInterface->printf(" -mtf %s\n",gc_pParmFile->GetMTF()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-rle") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-rle\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmFile->SetRLE(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmFile->SetRLE(false);
z++;
} else
gc_pParmFile->SetRLE(true);
gc_pBQBInterface->printf(" -rle %s\n",gc_pParmFile->GetRLE()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-verbose") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iFileVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iFileVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iFileVerbose = 0;
z++;
} else
gc_iFileVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iFileVerbose);
continue;
}
if (strcmp(argv[z],"-iter") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-iter\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 126)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-iter\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 126.\n");
return false;
}
gc_pParmFile->SetMaxIter(ti);
gc_pBQBInterface->printf(" -iter %d\n",gc_pParmFile->GetMaxIter());
continue;
}
if (strcmp(argv[z],"-maxchunk") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-maxchunk\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 16777216)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-maxchunk\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 16777216.\n");
return false;
}
gc_pParmFile->SetMaxChunk(ti);
gc_pBQBInterface->printf(" -maxchunk %d\n",gc_pParmFile->GetMaxChunk());
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outfile %s\n",gc_sOutFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
} // END IF FILE
if (gc_bCube) {
if ((argv[z][0] == '-') && b) {
if (strcmp(argv[z],"-dryrun") == 0) {
if (z+1 != argc) {
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bDryRun = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bDryRun = false;
z++;
} else
gc_bDryRun = true;
} else
gc_bDryRun = true;
gc_pBQBInterface->printf(" -dryrun %s\n",gc_bDryRun?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pkey") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pkey\".\n");
return false;
}
z++;
if (!gc_pParmVol->FromKey(argv[z])) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pkey\": \"%s\".\n",argv[z]);
return false;
}
gc_pBQBInterface->printf(" -pkey %s\n",argv[z]);
gc_iCubeOptimize = 0;
continue;
}
if (strcmp(argv[z],"-start") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-start\".\n");
return false;
}
z++;
gc_iCubeStart = atoi(argv[z]);
if (gc_iCubeStart < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-start\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are >= 1.\n");
return false;
}
gc_iCubeStart -= 1;
gc_pBQBInterface->printf(" -start %d\n",gc_iCubeStart+1);
continue;
}
if (strcmp(argv[z],"-steps") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-steps\".\n");
return false;
}
z++;
gc_iCubeSteps = atoi(argv[z]);
if ((gc_iCubeSteps < -1) || (gc_iCubeSteps == 0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-steps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are -1 (=all) or > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -steps %d\n",gc_iCubeSteps);
continue;
}
if (strcmp(argv[z],"-stride") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-stride\".\n");
return false;
}
z++;
gc_iCubeStride = atoi(argv[z]);
if (gc_iCubeStride < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-stride\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -stride %d\n",gc_iCubeStride);
continue;
}
if (strcmp(argv[z],"-keyframe") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-keyframe\".\n");
return false;
}
z++;
gc_iCubeKey = atoi(argv[z]);
if (gc_iCubeKey < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-keyframe\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are >= 1.\n");
return false;
}
gc_pBQBInterface->printf(" -keyframe %d\n",gc_iCubeKey);
continue;
}
if (strcmp(argv[z],"-comment") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-comment\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bCubeKeepComment = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bCubeKeepComment = false;
z++;
} else
gc_bCubeKeepComment = true;
gc_pBQBInterface->printf(" -comment %s\n",gc_bCubeKeepComment?"yes":"no");
continue;
}
if (strcmp(argv[z],"-check") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-check\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bCubeCompare = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bCubeCompare = false;
z++;
} else
gc_bCubeCompare = true;
gc_pBQBInterface->printf(" -check %s\n",gc_bCubeCompare?"yes":"no");
continue;
}
if (strcmp(argv[z],"-dummyread") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-dummyread\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bCubeDummyRead = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bCubeDummyRead = false;
z++;
} else
gc_bCubeDummyRead = true;
gc_pBQBInterface->printf(" -dummyread %s\n",gc_bCubeDummyRead?"yes":"no");
continue;
}
if (strcmp(argv[z],"-verbose") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iCubeVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iCubeVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iCubeVerbose = 0;
z++;
} else
gc_iCubeVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iCubeVerbose);
continue;
}
if (strcmp(argv[z],"-refout") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
z++;
gc_sCubeRefOut = argv[z];
gc_pBQBInterface->printf(" -refout %s\n",gc_sCubeRefOut);
continue;
}
if (strcmp(argv[z],"-vsigni") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vsigni\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 9)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vsigni\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 9.\n");
return false;
}
gc_pParmVol->SetVolSigni(ti);
gc_pBQBInterface->printf(" -vsigni %d\n",gc_pParmVol->GetVolSigni());
continue;
}
if (strcmp(argv[z],"-veps") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-veps\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 63)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-veps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 63.\n");
return false;
}
gc_pParmVol->SetVolEps(ti);
gc_pBQBInterface->printf(" -veps %d\n",gc_pParmVol->GetVolEps());
continue;
}
if (strcmp(argv[z],"-vorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vorder\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vorder\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetVolOrder(ti);
gc_pBQBInterface->printf(" -vorder %d\n",gc_pParmVol->GetVolOrder());
continue;
}
if (strcmp(argv[z],"-voptorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-voptorder\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolOptOrder(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolOptOrder(false);
z++;
} else
gc_pParmVol->SetVolOptOrder(true);
gc_pBQBInterface->printf(" -voptorder %s\n",gc_pParmVol->GetVolOptOrder()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vhilbert") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vhilbert\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolHilbert(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolHilbert(false);
z++;
} else
gc_pParmVol->SetVolHilbert(true);
gc_pBQBInterface->printf(" -vhilbert %s\n",gc_pParmVol->GetVolHilbert()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vnbhfac") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vnbhfac\".\n");
return false;
}
z++;
tf = atof(argv[z]);
if ((tf < 0.0) || (tf > 4.0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vnbhfac\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0.0 .. 4.0\n");
return false;
}
gc_pParmVol->SetVolNbhFac(tf);
gc_pBQBInterface->printf(" -vnbhfac %.3f\n",gc_pParmVol->GetVolNbhFac());
continue;
}
if (strcmp(argv[z],"-vsplit") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vsplit\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 31)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vsplit\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 31.\n");
return false;
}
gc_pParmVol->SetVolSplit(ti);
gc_pBQBInterface->printf(" -vsplit %d\n",gc_pParmVol->GetVolSplit());
continue;
}
if (strcmp(argv[z],"-vtables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vtables\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 64)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vtables\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 64.\n");
return false;
}
gc_pParmVol->SetVolTableCount(ti);
gc_pBQBInterface->printf(" -vtables %d\n",gc_pParmVol->GetVolTableCount());
continue;
}
if (strcmp(argv[z],"-vopttables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vopttables\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolOptTables(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolOptTables(false);
z++;
} else
gc_pParmVol->SetVolOptTables(true);
gc_pBQBInterface->printf(" -vopttables %s\n",gc_pParmVol->GetVolOptTables()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vblock") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vblock\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 128)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vblock\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 128.\n");
return false;
}
gc_pParmVol->SetVolBlockLength(ti);
gc_pBQBInterface->printf(" -vblock %d\n",gc_pParmVol->GetVolBlockLength());
continue;
}
if (strcmp(argv[z],"-vbw") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vbw\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolBW(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolBW(false);
z++;
} else
gc_pParmVol->SetVolBW(true);
gc_pBQBInterface->printf(" -vbw %s\n",gc_pParmVol->GetVolBW()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vmtf") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vmtf\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolMTF(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolMTF(false);
z++;
} else
gc_pParmVol->SetVolMTF(true);
gc_pBQBInterface->printf(" -vmtf %s\n",gc_pParmVol->GetVolMTF()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vrle") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vrle\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolRLE(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolRLE(false);
z++;
} else
gc_pParmVol->SetVolRLE(true);
gc_pBQBInterface->printf(" -vrle %s\n",gc_pParmVol->GetVolRLE()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-viter") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-viter\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 126)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-viter\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 126.\n");
return false;
}
gc_pParmVol->SetVolMaxIter(ti);
gc_pBQBInterface->printf(" -viter %d\n",gc_pParmVol->GetVolMaxIter());
continue;
}
if (strcmp(argv[z],"-vmaxchunk") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vmaxchunk\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 16777216)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vmaxchunk\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 16777216.\n");
return false;
}
gc_pParmVol->SetVolMaxChunk(ti);
gc_pBQBInterface->printf(" -vmaxchunk %d\n",gc_pParmVol->GetVolMaxChunk());
continue;
}
if (strcmp(argv[z],"-optimize") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-optimize\".\n");
return false;
}
if ((strcmp(argv[z+1],"0") == 0) || (strcmp(argv[z+1],"1") == 0) || (strcmp(argv[z+1],"2") == 0) ||
(strcmp(argv[z+1],"3") == 0) || (strcmp(argv[z+1],"4") == 0)) {
gc_iCubeOptimize = atoi(argv[z+1]);
z++;
} else if (bqbisinteger(argv[z+1])) {
gc_pBQBInterface->eprintf("Error: Invalid value \"%s\" after \"-optimize\". Allowed range is 0 to 4.\n",
argv[z+1]);
return false;
} else
gc_iCubeOptimize = 2;
if ((gc_iCubeOptimize < 0) || (gc_iCubeOptimize > 4)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-optimize\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 4.\n");
return false;
}
gc_pBQBInterface->printf(" -optimize %d\n",gc_iCubeOptimize);
gc_bOptTouched = true;
continue;
}
if (strcmp(argv[z],"-optsteps") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-optsteps\".\n");
return false;
}
z++;
gc_iCubeOptSteps = atoi(argv[z]);
if (gc_iCubeOptSteps < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-optsteps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -optsteps %d\n",gc_iCubeOptSteps);
continue;
}
if (strcmp(argv[z],"-onlyopt") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-onlyopt\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bCubeOnlyOpt = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bCubeOnlyOpt = false;
z++;
} else
gc_bCubeOnlyOpt = true;
gc_pBQBInterface->printf(" -onlyopt %s\n",gc_bCubeOnlyOpt?"yes":"no");
continue;
}
if (strcmp(argv[z],"-optstart") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-optstart\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_iCubeOptIncludeFirst = 1;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_iCubeOptIncludeFirst = 0;
z++;
} else
gc_iCubeOptIncludeFirst = 1;
gc_pBQBInterface->printf(" -optstart %s\n",(gc_iCubeOptIncludeFirst>0)?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vextra") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vextra\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolUseExtra(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolUseExtra(false);
z++;
} else
gc_pParmVol->SetVolUseExtra(true);
gc_pBQBInterface->printf(" -vextra %s\n",gc_pParmVol->GetVolUseExtra()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vexsrange") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexsrange\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexsrange\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraSRange(ti);
gc_pBQBInterface->printf(" -vexsrange %d\n",gc_pParmVol->GetVolExtraSRangeX());
continue;
}
if (strcmp(argv[z],"-vexsrangex") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexsrangex\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexsrangex\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraSRangeX(ti);
gc_pBQBInterface->printf(" -vexsrangex %d\n",gc_pParmVol->GetVolExtraSRangeX());
continue;
}
if (strcmp(argv[z],"-vexsrangey") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexsrangey\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexsrangey\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraSRangeY(ti);
gc_pBQBInterface->printf(" -vexsrangey %d\n",gc_pParmVol->GetVolExtraSRangeY());
continue;
}
if (strcmp(argv[z],"-vexsrangez") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexsrangez\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexsrangez\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraSRangeZ(ti);
gc_pBQBInterface->printf(" -vexsrangez %d\n",gc_pParmVol->GetVolExtraSRangeZ());
continue;
}
if (strcmp(argv[z],"-vextrange") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vextrange\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vextrange\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraTRange(ti);
gc_pBQBInterface->printf(" -vextrange %d\n",gc_pParmVol->GetVolExtraTRange());
continue;
}
if (strcmp(argv[z],"-vexsorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexsorder\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexsorder\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraSOrder(ti);
gc_pBQBInterface->printf(" -vexsorder %d\n",gc_pParmVol->GetVolExtraSOrder());
continue;
}
if (strcmp(argv[z],"-vextorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vextorder\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vextorder\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraTOrder(ti);
gc_pBQBInterface->printf(" -vextorder %d\n",gc_pParmVol->GetVolExtraTOrder());
continue;
}
if (strcmp(argv[z],"-vexoffset") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexoffset\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexoffset\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraOffset(ti);
gc_pBQBInterface->printf(" -vexoffset %d\n",gc_pParmVol->GetVolExtraOffsetX());
continue;
}
if (strcmp(argv[z],"-vexoffsetx") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexoffsetx\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexoffsetx\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15?.\n");
return false;
}
gc_pParmVol->SetVolExtraOffsetX(ti);
gc_pBQBInterface->printf(" -vexoffsetx %d\n",gc_pParmVol->GetVolExtraOffsetX());
continue;
}
if (strcmp(argv[z],"-vexoffsety") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexoffsety\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexoffsety\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraOffsetY(ti);
gc_pBQBInterface->printf(" -vexoffsety %d\n",gc_pParmVol->GetVolExtraOffsetY());
continue;
}
if (strcmp(argv[z],"-vexoffsetz") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexoffsetz\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexoffsetz\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetVolExtraOffsetZ(ti);
gc_pBQBInterface->printf(" -vexoffsetz %d\n",gc_pParmVol->GetVolExtraOffsetZ());
continue;
}
if (strcmp(argv[z],"-vexscross") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexscross\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolExtraCrossS(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolExtraCrossS(false);
z++;
} else
gc_pParmVol->SetVolExtraCrossS(true);
gc_pBQBInterface->printf(" -vexscross %s\n",gc_pParmVol->GetVolExtraCrossS()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vextcross") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vextcross\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolExtraCrossT(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolExtraCrossT(false);
z++;
} else
gc_pParmVol->SetVolExtraCrossT(true);
gc_pBQBInterface->printf(" -vextcross %s\n",gc_pParmVol->GetVolExtraCrossT()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vexwrap") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexwrap\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolExtraWrap(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolExtraWrap(false);
z++;
} else
gc_pParmVol->SetVolExtraWrap(true);
gc_pBQBInterface->printf(" -vexwrap %s\n",gc_pParmVol->GetVolExtraWrap()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vexscrossrange") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexscrossrange\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolExtraCrossRangeS(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolExtraCrossRangeS(false);
z++;
} else
gc_pParmVol->SetVolExtraCrossRangeS(true);
gc_pBQBInterface->printf(" -vexscrossrange %s\n",gc_pParmVol->GetVolExtraCrossRangeS()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vextcrossrange") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vextcrossrange\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolExtraCrossRangeT(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolExtraCrossRangeT(false);
z++;
} else
gc_pParmVol->SetVolExtraCrossRangeT(true);
gc_pBQBInterface->printf(" -vextcrossrange %s\n",gc_pParmVol->GetVolExtraCrossRangeT()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-vexdistexpo") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexdistexpo\".\n");
return false;
}
z++;
tf = atof(argv[z]);
if ((tf < 0.0) || (tf > 16.0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vexdistexpo\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0.0 .. 16.0\n");
return false;
}
gc_pParmVol->SetVolExtraDistExpo(tf);
gc_pBQBInterface->printf(" -vexdistexpo %.3f\n",gc_pParmVol->GetVolExtraDistExpo());
continue;
}
if (strcmp(argv[z],"-vextimeexpo") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vextimeexpo\".\n");
return false;
}
z++;
tf = atof(argv[z]);
if ((tf < 0.0) || (tf > 16.0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-vextimeexpo\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0.0 .. 16.0\n");
return false;
}
gc_pParmVol->SetVolExtraTimeExpo(tf);
gc_pBQBInterface->printf(" -vextimeexpo %.3f\n",gc_pParmVol->GetVolExtraTimeExpo());
continue;
}
if (strcmp(argv[z],"-vexpredcorr") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-vexpredcorr\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetVolExtraPredCorr(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetVolExtraPredCorr(false);
z++;
} else
gc_pParmVol->SetVolExtraPredCorr(true);
gc_pBQBInterface->printf(" -vexpredcorr %s\n",gc_pParmVol->GetVolExtraPredCorr()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pextra") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pextra\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetPosUseExtra(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetPosUseExtra(false);
z++;
} else
gc_pParmVol->SetPosUseExtra(true);
gc_pBQBInterface->printf(" -pextra %s\n",gc_pParmVol->GetPosUseExtra()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pextrange") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pextrange\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pextrange\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 15.\n");
return false;
}
gc_pParmVol->SetPosExtraTRange(ti);
gc_pBQBInterface->printf(" -pextrange %d\n",gc_pParmVol->GetPosExtraTRange());
continue;
}
if (strcmp(argv[z],"-pextorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pextorder\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pextorder\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetPosExtraTOrder(ti);
gc_pBQBInterface->printf(" -pextorder %d\n",gc_pParmVol->GetPosExtraTOrder());
continue;
}
if (strcmp(argv[z],"-pextimeexpo") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pextimeexpo\".\n");
return false;
}
z++;
tf = atof(argv[z]);
if ((tf < 0.0) || (tf > 16.0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pextimeexpo\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0.0 .. 16.0\n");
return false;
}
gc_pParmVol->SetPosExtraTimeExpo(tf);
gc_pBQBInterface->printf(" -pextimeexpo %.3f\n",gc_pParmVol->GetPosExtraTimeExpo());
continue;
}
if (strcmp(argv[z],"-pprec") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pprec\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 7)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pprec\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 7.\n");
return false;
}
gc_pParmVol->SetPosPrecision(ti);
gc_pBQBInterface->printf(" -pprec %d\n",gc_pParmVol->GetPosPrecision());
continue;
}
if (strcmp(argv[z],"-porder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-porder\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-porder\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmVol->SetPosOrder(ti);
gc_pBQBInterface->printf(" -porder %d\n",gc_pParmVol->GetPosOrder());
continue;
}
if (strcmp(argv[z],"-poptorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-poptorder\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetPosOptOrder(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetPosOptOrder(false);
z++;
} else
gc_pParmVol->SetPosOptOrder(true);
gc_pBQBInterface->printf(" -poptorder %s\n",gc_pParmVol->GetPosOptOrder()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-psplit") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-psplit\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 31)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-psplit\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 31.\n");
return false;
}
gc_pParmVol->SetPosSplit(ti);
gc_pBQBInterface->printf(" -psplit %d\n",gc_pParmVol->GetPosSplit());
continue;
}
if (strcmp(argv[z],"-ptables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-ptables\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 64)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-ptables\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 64.\n");
return false;
}
gc_pParmVol->SetPosTableCount(ti);
gc_pBQBInterface->printf(" -ptables %d\n",gc_pParmVol->GetPosTableCount());
continue;
}
if (strcmp(argv[z],"-popttables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-popttables\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetPosOptTables(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetPosOptTables(false);
z++;
} else
gc_pParmVol->SetPosOptTables(true);
gc_pBQBInterface->printf(" -popttables %s\n",gc_pParmVol->GetPosOptTables()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pblock") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pblock\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 128)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pblock\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 128.\n");
return false;
}
gc_pParmVol->SetPosBlockLength(ti);
gc_pBQBInterface->printf(" -pblock %d\n",gc_pParmVol->GetPosBlockLength());
continue;
}
if (strcmp(argv[z],"-pbw") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pbw\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetPosBW(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetPosBW(false);
z++;
} else
gc_pParmVol->SetPosBW(true);
gc_pBQBInterface->printf(" -pbw %s\n",gc_pParmVol->GetPosBW()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pmtf") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pmtf\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetPosMTF(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetPosMTF(false);
z++;
} else
gc_pParmVol->SetPosMTF(true);
gc_pBQBInterface->printf(" -pmtf %s\n",gc_pParmVol->GetPosMTF()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-prle") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-prle\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetPosRLE(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetPosRLE(false);
z++;
} else
gc_pParmVol->SetPosRLE(true);
gc_pBQBInterface->printf(" -prle %s\n",gc_pParmVol->GetPosRLE()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-piter") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-piter\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 126)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-piter\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 126.\n");
return false;
}
gc_pParmVol->SetPosMaxIter(ti);
gc_pBQBInterface->printf(" -piter %d\n",gc_pParmVol->GetPosMaxIter());
continue;
}
if (strcmp(argv[z],"-psortatom") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-psortatom\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmVol->SetPosSortAtom(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmVol->SetPosSortAtom(false);
z++;
} else
gc_pParmVol->SetPosSortAtom(true);
gc_pBQBInterface->printf(" -psortatom %s\n",gc_pParmVol->GetPosSortAtom()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pmaxchunk") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pmaxchunk\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 16777216)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pmaxchunk\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 16777216.\n");
return false;
}
gc_pParmVol->SetPosMaxChunk(ti);
gc_pBQBInterface->printf(" -pmaxchunk %d\n",gc_pParmVol->GetPosMaxChunk());
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outfile %s\n",gc_sOutFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
} // END IF CUBE
if (gc_bXYZ) {
if ((argv[z][0] == '-') && b) {
if (strcmp(argv[z],"-dryrun") == 0) {
if (z+1 != argc) {
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bDryRun = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bDryRun = false;
z++;
} else
gc_bDryRun = true;
} else
gc_bDryRun = true;
gc_pBQBInterface->printf(" -dryrun %s\n",gc_bDryRun?"yes":"no");
continue;
}
if (strcmp(argv[z],"-pkey") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-pkey\".\n");
return false;
}
z++;
if (!gc_pParmPos->FromKey(argv[z])) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-pkey\": \"%s\".\n",argv[z]);
return false;
}
gc_pBQBInterface->printf(" -pkey %s\n",argv[z]);
gc_iAtomOptimize = 0;
continue;
}
if (strcmp(argv[z],"-start") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-start\".\n");
return false;
}
z++;
gc_iAtomStart = atoi(argv[z]);
if (gc_iAtomStart < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-start\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are > 1.\n");
return false;
}
gc_iAtomStart -= 1;
gc_pBQBInterface->printf(" -start %d\n",gc_iAtomStart+1);
continue;
}
if (strcmp(argv[z],"-steps") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-steps\".\n");
return false;
}
z++;
gc_iAtomSteps = atoi(argv[z]);
if ((gc_iAtomSteps < -1) || (gc_iAtomSteps == 0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-steps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are -1 (=all) or > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -steps %d\n",gc_iAtomSteps);
continue;
}
if (strcmp(argv[z],"-stride") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-stride\".\n");
return false;
}
z++;
gc_iAtomStride = atoi(argv[z]);
if (gc_iAtomStride < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-stride\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -stride %d\n",gc_iAtomStride);
continue;
}
if (strcmp(argv[z],"-keyframe") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-keyframe\".\n");
return false;
}
z++;
gc_iAtomKey = atoi(argv[z]);
if (gc_iAtomKey < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-keyframe\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are >= 1.\n");
return false;
}
gc_pBQBInterface->printf(" -keyframe %d\n",gc_iAtomKey);
continue;
}
if (strcmp(argv[z],"-comment") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-comment\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bAtomKeepComment = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bAtomKeepComment = false;
z++;
} else
gc_bAtomKeepComment = true;
gc_pBQBInterface->printf(" -comment %s\n",gc_bAtomKeepComment?"yes":"no");
continue;
}
if (strcmp(argv[z],"-check") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-check\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bAtomCompare = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bAtomCompare = false;
z++;
} else
gc_bAtomCompare = true;
gc_pBQBInterface->printf(" -check %s\n",gc_bAtomCompare?"yes":"no");
continue;
}
if (strcmp(argv[z],"-verbose") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iAtomVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iAtomVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iAtomVerbose = 0;
z++;
} else
gc_iAtomVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iAtomVerbose);
continue;
}
if (strcmp(argv[z],"-refout") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
z++;
gc_sAtomRefOut = argv[z];
gc_pBQBInterface->printf(" -refout %s\n",gc_sAtomRefOut);
continue;
}
if (strcmp(argv[z],"-prec") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-prec\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 7)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-prec\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 7.\n");
return false;
}
gc_pParmPos->SetPrecision(ti);
gc_pBQBInterface->printf(" -prec %d\n",gc_pParmPos->GetPrecision());
continue;
}
if (strcmp(argv[z],"-order") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-order\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-order\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmPos->SetOrder(ti);
gc_pBQBInterface->printf(" -order %d\n",gc_pParmPos->GetOrder());
continue;
}
if (strcmp(argv[z],"-optorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-optorder\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmPos->SetOptOrder(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmPos->SetOptOrder(false);
z++;
} else
gc_pParmPos->SetOptOrder(true);
gc_pBQBInterface->printf(" -optorder %s\n",gc_pParmPos->GetOptOrder()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-split") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-split\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 31)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-split\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 31.\n");
return false;
}
gc_pParmPos->SetSplit(ti);
gc_pBQBInterface->printf(" -split %d\n",gc_pParmPos->GetSplit());
continue;
}
if (strcmp(argv[z],"-tables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-tables\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 64)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-tables\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 64.\n");
return false;
}
gc_pParmPos->SetTableCount(ti);
gc_pBQBInterface->printf(" -tables %d\n",gc_pParmPos->GetTableCount());
continue;
}
if (strcmp(argv[z],"-opttables") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-opttables\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmPos->SetOptTables(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmPos->SetOptTables(false);
z++;
} else
gc_pParmPos->SetOptTables(true);
gc_pBQBInterface->printf(" -opttables %s\n",gc_pParmPos->GetOptTables()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-block") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-block\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 128)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-block\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 128.\n");
return false;
}
gc_pParmPos->SetBlockLength(ti);
gc_pBQBInterface->printf(" -block %d\n",gc_pParmPos->GetBlockLength());
continue;
}
if (strcmp(argv[z],"-bw") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-bw\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmPos->SetBW(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmPos->SetBW(false);
z++;
} else
gc_pParmPos->SetBW(true);
gc_pBQBInterface->printf(" -bw %s\n",gc_pParmPos->GetBW()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-mtf") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-mtf\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmPos->SetMTF(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmPos->SetMTF(false);
z++;
} else
gc_pParmPos->SetMTF(true);
gc_pBQBInterface->printf(" -mtf %s\n",gc_pParmPos->GetMTF()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-rle") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-rle\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmPos->SetRLE(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmPos->SetRLE(false);
z++;
} else
gc_pParmPos->SetRLE(true);
gc_pBQBInterface->printf(" -rle %s\n",gc_pParmPos->GetRLE()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-iter") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-iter\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 126)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-iter\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 126.\n");
return false;
}
gc_pParmPos->SetMaxIter(ti);
gc_pBQBInterface->printf(" -iter %d\n",gc_pParmPos->GetMaxIter());
continue;
}
if (strcmp(argv[z],"-sortatom") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-sortatom\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmPos->SetSortAtom(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmPos->SetSortAtom(false);
z++;
} else
gc_pParmPos->SetSortAtom(true);
gc_pBQBInterface->printf(" -sortatom %s\n",gc_pParmPos->GetSortAtom()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-maxchunk") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-maxchunk\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 16777216)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-maxchunk\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 16777216.\n");
return false;
}
gc_pParmPos->SetMaxChunk(ti);
gc_pBQBInterface->printf(" -maxchunk %d\n",gc_pParmPos->GetMaxChunk());
continue;
}
if (strcmp(argv[z],"-extra") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-extra\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_pParmPos->SetUseExtra(true);
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_pParmPos->SetUseExtra(false);
z++;
} else
gc_pParmPos->SetUseExtra(true);
gc_pBQBInterface->printf(" -extra %s\n",gc_pParmPos->GetUseExtra()?"yes":"no");
continue;
}
if (strcmp(argv[z],"-extrange") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-extrange\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 1) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-extrange\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 1 .. 15.\n");
return false;
}
gc_pParmPos->SetExtraTRange(ti);
gc_pBQBInterface->printf(" -extrange %d\n",gc_pParmPos->GetExtraTRange());
continue;
}
if (strcmp(argv[z],"-extorder") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-extorder\".\n");
return false;
}
z++;
ti = atoi(argv[z]);
if ((ti < 0) || (ti > 15)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-extorder\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 15.\n");
return false;
}
gc_pParmPos->SetExtraTOrder(ti);
gc_pBQBInterface->printf(" -extorder %d\n",gc_pParmPos->GetExtraTOrder());
continue;
}
if (strcmp(argv[z],"-extimeexpo") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-extimeexpo\".\n");
return false;
}
z++;
tf = atof(argv[z]);
if ((tf < 0) || (tf > 16.0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-extimeexpo\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0.0 .. 16.0\n");
return false;
}
gc_pParmPos->SetExtraTimeExpo(tf);
gc_pBQBInterface->printf(" -extimeexpo %.3f\n",gc_pParmPos->GetExtraTimeExpo());
continue;
}
if (strcmp(argv[z],"-optimize") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-optimize\".\n");
return false;
}
if ((strcmp(argv[z+1],"0") == 0) || (strcmp(argv[z+1],"1") == 0) || (strcmp(argv[z+1],"2") == 0) ||
(strcmp(argv[z+1],"3") == 0) || (strcmp(argv[z+1],"4") == 0)) {
gc_iAtomOptimize = atoi(argv[z+1]);
z++;
} else if (bqbisinteger(argv[z+1])) {
gc_pBQBInterface->eprintf("Error: Invalid value \"%s\" after \"-optimize\". Allowed range is 0 to 3.\n",
argv[z+1]);
return false;
} else
gc_iAtomOptimize = 3;
if ((gc_iAtomOptimize < 0) || (gc_iAtomOptimize > 4)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-optimize\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are 0 .. 4.\n");
return false;
}
gc_pBQBInterface->printf(" -optimize %d\n",gc_iAtomOptimize);
gc_bOptTouched = true;
continue;
}
if (strcmp(argv[z],"-optsteps") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-optsteps\".\n");
return false;
}
z++;
gc_iAtomOptSteps = atoi(argv[z]);
if (gc_iAtomOptSteps < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-optsteps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -optsteps %d\n",gc_iAtomOptSteps);
continue;
}
if (strcmp(argv[z],"-onlyopt") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-onlyopt\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_bAtomOnlyOpt = true;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_bAtomOnlyOpt = false;
z++;
} else
gc_bAtomOnlyOpt = true;
gc_pBQBInterface->printf(" -onlyopt %s\n",gc_bAtomOnlyOpt?"yes":"no");
continue;
}
if (strcmp(argv[z],"-optstart") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-optstart\".\n");
return false;
}
if ((strcmp(argv[z+1],"yes") == 0) || (strcmp(argv[z+1],"y") == 0)) {
gc_iAtomOptIncludeFirst = 1;
z++;
} else if ((strcmp(argv[z+1],"no") == 0) || (strcmp(argv[z+1],"n") == 0)) {
gc_iAtomOptIncludeFirst = 0;
z++;
} else
gc_iAtomOptIncludeFirst = 1;
gc_pBQBInterface->printf(" -optstart %s\n",(gc_iAtomOptIncludeFirst>0)?"yes":"no");
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outfile %s\n",gc_sOutFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
} // END IF XYZ
} // END IF COMPRESS
if (gc_bDecompress) {
if (gc_bFile) {
if ((argv[z][0] == '-') && b) {
if (strcmp(argv[z],"-verbose") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iFileVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iFileVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iFileVerbose = 0;
z++;
} else
gc_iFileVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iFileVerbose);
continue;
}
if (strcmp(argv[z],"-refcompare") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-refcompare\".\n");
return false;
}
z++;
gc_sRefFile = argv[z];
gc_pBQBInterface->printf(" -refcompare %s\n",gc_sRefFile);
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outfile %s\n",gc_sOutFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
} // END IF FILE
if (gc_bCube) {
if ((argv[z][0] == '-') && b) {
if (strcmp(argv[z],"-steps") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-steps\".\n");
return false;
}
z++;
gc_iCubeSteps = atoi(argv[z]);
if ((gc_iCubeSteps < -1) || (gc_iCubeSteps == 0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-steps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are -1 (=all) or > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -steps %d\n",gc_iCubeSteps);
continue;
}
if (strcmp(argv[z],"-stride") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-stride\".\n");
return false;
}
z++;
gc_iCubeStride = atoi(argv[z]);
if (gc_iCubeStride < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-stride\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -stride %d\n",gc_iCubeStride);
continue;
}
if (strcmp(argv[z],"-verbose") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iCubeVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iCubeVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iCubeVerbose = 0;
z++;
} else
gc_iCubeVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iCubeVerbose);
continue;
}
if (strcmp(argv[z],"-refcompare") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-refcompare\".\n");
return false;
}
z++;
gc_sRefFile = argv[z];
gc_pBQBInterface->printf(" -refcompare %s\n",gc_sRefFile);
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outfile %s\n",gc_sOutFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
} // END IF CUBE
if (gc_bXYZ) {
if ((argv[z][0] == '-') && b) {
if (strcmp(argv[z],"-steps") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-steps\".\n");
return false;
}
z++;
gc_iAtomSteps = atoi(argv[z]);
if ((gc_iAtomSteps < -1) || (gc_iAtomSteps == 0)) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-steps\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are -1 (=all) or > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -steps %d\n",gc_iAtomSteps);
continue;
}
if (strcmp(argv[z],"-stride") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-stride\".\n");
return false;
}
z++;
gc_iAtomStride = atoi(argv[z]);
if (gc_iAtomStride < 1) {
gc_pBQBInterface->eprintf("Error: Invalid value for \"-stride\": \"%s\".\n",argv[z]);
gc_pBQBInterface->printf(" Allowed values are > 0.\n");
return false;
}
gc_pBQBInterface->printf(" -stride %d\n",gc_iAtomStride);
continue;
}
if (strcmp(argv[z],"-verbose") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-verbose\".\n");
return false;
}
if (strcmp(argv[z+1],"2") == 0) {
gc_iAtomVerbose = 2;
z++;
} else if (strcmp(argv[z+1],"1") == 0) {
gc_iAtomVerbose = 1;
z++;
} else if (strcmp(argv[z+1],"0") == 0) {
gc_iAtomVerbose = 0;
z++;
} else
gc_iAtomVerbose = 1;
gc_pBQBInterface->printf(" -verbose %d\n",gc_iAtomVerbose);
continue;
}
if (strcmp(argv[z],"-refcompare") == 0) {
if (z+1 == argc) {
gc_pBQBInterface->eprintf("Error: Missing value after \"-refcompare\".\n");
return false;
}
z++;
gc_sRefFile = argv[z];
gc_pBQBInterface->printf(" -refcompare %s\n",gc_sRefFile);
continue;
}
gc_pBQBInterface->eprintf("Error: Unknown command line argument \"%s\".\n",argv[z]);
return false;
} else {
b = false;
if (i == 0) {
gc_sInFile = argv[z];
gc_pBQBInterface->printf(" infile %s\n",gc_sInFile);
} else if (i == 1) {
gc_sOutFile = argv[z];
gc_pBQBInterface->printf(" outfile %s\n",gc_sOutFile);
} else {
gc_pBQBInterface->eprintf("Error: Unrecognized trailing argument: \"%s\".\n",argv[z]);
return false;
}
i++;
}
} // END IF XYZ
} // END IF DECOMPRESS
}
}
gc_pBQBInterface->printf("Finished.\n\n");
return true;
}
static const char BQB_BASE64_table[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
bool bqb_isbase64(char c) {
return c && strchr(BQB_BASE64_table, c) != NULL;
}
inline char BQB_BASE64_value(char c) {
const char *p = strchr(BQB_BASE64_table, c);
if(p) {
return (char)(p-BQB_BASE64_table);
} else {
return 0;
}
}
int BQB_UnBase64(unsigned char *dest, const unsigned char *src, int srclen) {
*dest = 0;
if(*src == 0)
{
return 0;
}
unsigned char *p = dest;
do
{
char a = BQB_BASE64_value(src[0]);
char b = BQB_BASE64_value(src[1]);
char c = BQB_BASE64_value(src[2]);
char d = BQB_BASE64_value(src[3]);
*p++ = (a << 2) | (b >> 4);
*p++ = (b << 4) | (c >> 2);
*p++ = (c << 6) | d;
if(!bqb_isbase64(src[1]))
{
p -= 2;
break;
}
else if(!bqb_isbase64(src[2]))
{
p -= 2;
break;
}
else if(!bqb_isbase64(src[3]))
{
p--;
break;
}
src += 4;
while(*src && (*src == 13 || *src == 10)) src++;
}
while(srclen-= 4);
*p = 0;
return (int)(p-dest);
}
void BQB_PrintBMode() {
const char *stext[15];
char buf[256];
int z;
stext[0] = "ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIF8sIC4u";
stext[1] = "ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICdfKF8wbylvKCku";
stext[2] = "ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAsbyhfXyksXyksKF9fKW8=";
stext[3] = "ICAgICAgICAgXy4oLSkuXyAgICAgICAgICAgICAgICAgICAgbyhfLC1vKF8gKSgoXylvTylf";
stext[4] = "ICAgICAgLicgICAgICAgICAnLiAgICAgICAgICAgICAgICAgLk8oX18pbyxfXylvKF8pT29fKQ==";
stext[5] = "ICAgICAvICAgICAgICAgICAgIFwgICAgICAgICAgICAuLS0tLXwgICB8ICAgfCAgIHxfKTA=";
stext[6] = "ICAgICB8Jy0uLi5fX18uLi4tJ3wgICAgICAgICAgIC8gIC4tLXwgICB8ICAgfCAgIHwsXyk=";
stext[7] = "ICAgICAgXCAgICAnPScgICAgLyAgICAgICAgICAgfCAgLyAgIHwgICB8ICAgfCAgIHxvKF8p";
stext[8] = "ICAgICAgIGAnLl9fX19fLidgICAgICAgICAgICAgfCAgfCAgIHwgICB8ICAgfCAgIHxfL2Ap";
stext[9] = "ICAgICAgICAvICAgfCAgIFwgICAgICAgICAgICAgfCAgfCAgIHwgICB8ICAgfCAgIHxPXyk=";
stext[10] = "ICAgICAgIC8uLS0nfCctLS5cICAgICAgICAgICAgfCAgXCAgIHwgICB8ICAgfCAgIHw=";
stext[11] = "ICAgIFtdLyctLl9ffF9fLi0nXFtdICAgICAgICAgIFwgICctLXwgICB8ICAgfCAgIHw=";
stext[12] = "ICAgICAgICAgICAgfCAgICAgICAgICAgICAgICAgICAnLS0tLXwgICB8ICAgfCAgIHw=";
stext[13] = "ICAgICAgICAgICBbXSAgICAgICAgICAgICAgICAgICAgICAgIFwgICBcICAgLyAgIC8=";
stext[14] = "ICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICBgIiIiIiIiIiIiYA==";
//gc_pBQBInterface->printf("\n");
for (z=0;z<15;z++) {
BQB_UnBase64((unsigned char*)buf,(const unsigned char*)stext[z],(int)strlen(stext[z]));
gc_pBQBInterface->bprintf(" %s\n",buf);
}
gc_pBQBInterface->printf("\n");
}
// Functions for Linux signal handling / stack trace
#ifndef BQB_INSIDE_TRAVIS
void bqb_printf(const char *s, ...) {
va_list args;
va_start(args,s);
vprintf(s,args);
va_end(args);
if (gc_fLogFile != NULL) {
va_start(args,s);
vfprintf(gc_fLogFile,s,args);
va_end(args);
fflush(gc_fLogFile);
}
}
#if !defined(_WIN32) && (defined(__unix__) || defined(__unix) || (defined(__APPLE__) && defined(__MACH__)))
void UninstallSignalHandler() {
signal(SIGSEGV,SIG_DFL);
signal(SIGFPE,SIG_DFL);
signal(SIGILL,SIG_DFL);
signal(SIGINT,SIG_DFL);
signal(SIGABRT,SIG_DFL);
signal(SIGTERM,SIG_DFL);
signal(SIGHUP,SIG_DFL);
}
void DumpLinuxBacktrace() {
void *buffer[4096];
char **strings, buf[256], *p;
int n, z, i, j;
bool showall;
FILE *a;
n = backtrace(buffer,4096);
if (n <= 0) {
bqb_printf("DumpLinuxBacktrace(): Error: Could not retrieve stack trace.\n");
return;
}
strings = backtrace_symbols(buffer,n);
if (strings == NULL)
bqb_printf("Could not retrieve debug symbol strings.\n");
bqb_printf("Decoding line numbers... ");
bqb_printf("(\"addr2line -f -i -C -e %s\")\n",gc_sExeName);
a = fopen(gc_sExeName,"rb");
if (a == NULL) {
bqb_printf("Could not locate \"%s\" :-(\n",gc_sExeName);
} else {
fclose(a);
j = 0;
for (z=0;z (void*)0x400000))
j++;
if (j < 3)
showall = true;
else
showall = false;
for (z=0;z (void*)0x400000))) {
bqb_printf(" # %2d ",n-z);
sprintf(buf,"addr2line %p -f -i -C -e %s > tmp.txt",buffer[z],gc_sExeName);
(void)system(buf);
a = fopen("tmp.txt","rt");
if (a == NULL) {
bqb_printf("Error. Make sure you have the addr2line tool installed (it is part of \"binutils\")\nand writing permission to this directory.\n");
continue;
}
bqb_printf("- [%10p] ",buffer[z]);
i = 0;
while (true) {
(void)fgets(buf,256,a);
if (feof(a))
break;
if (strlen(buf) > 2) {
if (i == 2) {
i = 0;
bqb_printf("\n ");
}
buf[strlen(buf)-1] = 0;
p = strrchr(buf,'/');
if (p == NULL)
p = buf;
else p++;
bqb_printf("- %s ",p);
i++;
}
}
fclose(a);
bqb_printf("\n");
}
}
(void)system("rm tmp.txt");
}
}
void Crash() {
UninstallSignalHandler();
bqb_printf("bqbtool apparently has crashed :-( Sorry.\n");
bqb_printf("Please send the screen output to the developers,\n");
bqb_printf("making them able to analyze and fix this error.\n");
DumpLinuxBacktrace();
bqb_printf("Delivering control to operating system.\n");
abort();
}
void CrashAbort() {
UninstallSignalHandler();
bqb_printf("bqbtool had to abort execution.\n");
bqb_printf("Hopefully, the reason was printed above this message.\n");
DumpLinuxBacktrace();
bqb_printf("Delivering control to operating system.\n");
abort();
}
void CrashTerm() {
UninstallSignalHandler();
bqb_printf("bqbtool received a termination request (SIGTERM) from the operating system\n");
bqb_printf("and therefore has to stop execution.\n");
DumpLinuxBacktrace();
bqb_printf("Delivering control to operating system.\n");
abort();
}
void CrashInt() {
UninstallSignalHandler();
DumpLinuxBacktrace();
bqb_printf("Delivering control to operating system.\n");
abort();
}
void SIGNAL_SEGV(int param) {
UNUSED(param); // Suppress "unused parameter" warning
bqb_printf("\n\n*** SIGSEGV caught: Segmentation fault ***\n");
Crash();
}
void SIGNAL_FPE(int param) {
UNUSED(param); // Suppress "unused parameter" warning
bqb_printf("\n\n*** SIGFPE caught: Floating point exception ***\n");
Crash();
}
void SIGNAL_ILL(int param) {
UNUSED(param); // Suppress "unused parameter" warning
bqb_printf("\n\n*** SIGILL caught: Illegal instruction ***\n");
Crash();
}
void SIGNAL_INT(int param) {
UNUSED(param); // Suppress "unused parameter" warning
bqb_printf("\n\n*** SIGINT caught: Hard interrupt by user ***\n");
bqb_printf("Stopping execution.\n");
CrashInt();
exit(0);
}
void SIGNAL_ABRT(int param) {
UNUSED(param); // Suppress "unused parameter" warning
bqb_printf("\n\n*** SIGABRT caught: Abnormal program termination ***\n");
CrashAbort();
}
void SIGNAL_TERM(int param) {
UNUSED(param); // Suppress "unused parameter" warning
bqb_printf("\n\n*** SIGTERM caught: Terminating ***\n");
CrashTerm();
}
void SIGNAL_HANGUP(int param) {
UNUSED(param); // Suppress "unused parameter" warning
bqb_printf("\n\n*** SIGHUP caught: Trying to ignore hangup ^^ ***\n");
signal(SIGHUP,SIGNAL_HANGUP);
}
void InstallSignalHandler() {
signal(SIGSEGV,SIGNAL_SEGV);
signal(SIGFPE,SIGNAL_FPE);
signal(SIGILL,SIGNAL_ILL);
signal(SIGINT,SIGNAL_INT);
signal(SIGABRT,SIGNAL_ABRT);
signal(SIGTERM,SIGNAL_TERM);
signal(SIGHUP,SIGNAL_HANGUP);
}
#endif
#endif
#ifdef BQB_INSIDE_TRAVIS
int bqbtool_main(int argc, const char *argv[]) {
#else
int main(int argc, const char *argv[]) {
#endif
CBQBDriver *driver = NULL;
int z;
bool err, b;
struct tm *today;
time_t ltime;
char buf[256];
gc_sExeName = new char[strlen(argv[0])+1];
strcpy(gc_sExeName,argv[0]);
// Install Linux signal handlers
#ifndef BQB_INSIDE_TRAVIS
#if !defined(_WIN32) && (defined(__unix__) || defined(__unix) || (defined(__APPLE__) && defined(__MACH__)))
InstallSignalHandler();
#endif
#endif
// Before this command, no printing should occur
gc_pBQBInterface = BQBCreateInterface( 0 );
if (gc_pBQBInterface == NULL) {
printf("Error: Could not create BQB interface.\n");
printf("Aborting execution.\n\n");
return 1;
}
// Use TRAVIS functions for screen output
#ifdef BQB_INSIDE_TRAVIS
gc_pBQBInterface->SetPrintCallback( &mprintf );
gc_pBQBInterface->SetBPrintCallback( &bprintf );
gc_pBQBInterface->SetEPrintCallback( &eprintf );
#else
gc_fLogFile = fopen("bqbtool.log","wt");
if (gc_fLogFile == NULL) {
printf("Error: Could not open \"bqbtool.log\" for writing.\n");
printf("Aborting execution.\n\n");
return 1;
}
gc_pBQBInterface->SetPrintCallback( &bqb_printf );
gc_pBQBInterface->SetBPrintCallback( &bqb_printf );
gc_pBQBInterface->SetEPrintCallback( &bqb_printf );
#endif
// Get host name and working directory
#if !defined(_WIN32) && (defined(__unix__) || defined(__unix) || (defined(__APPLE__) && defined(__MACH__)))
if (gethostname(buf,256)==0) {
gc_sHostName = new char[strlen(buf)+1];
strcpy(gc_sHostName,buf);
} else
gc_sHostName = NULL;
gc_sWorkingDir = getcwd(NULL,1024);
#elif defined(_WIN32)
unsigned long l;
l = 256;
if (GetComputerNameA(buf,&l)) {
gc_sHostName = new char[strlen(buf)+1];
strcpy(gc_sHostName,buf);
} else
gc_sHostName = NULL;
gc_sWorkingDir = _getcwd(NULL,1024);
#else
gc_sHostName = NULL;
gc_sWorkingDir = NULL;
#endif
gc_pBQBInterface->bprintf("\n");
gc_pBQBInterface->bprintf(" __ __ __ __\n");
gc_pBQBInterface->bprintf(" / | / | / | / |\n");
gc_pBQBInterface->bprintf(" ## |____ ______ ## |____ _## |_ ______ ______ ## |\n");
gc_pBQBInterface->bprintf(" ## \\ / \\ ## \\ / ## | / \\ / \\ ## |\n");
gc_pBQBInterface->bprintf(" ####### | /###### | ####### | ######/ /###### | /###### | ## |\n");
gc_pBQBInterface->bprintf(" ## | ## | ## | ## | ## | ## | ## | __ ## | ## | ## | ## | ## |\n");
gc_pBQBInterface->bprintf(" ## |__## | ## \\__## | ## |__## | ## |/ | ## \\__## | ## \\__## | ## |\n");
gc_pBQBInterface->bprintf(" ## ##/ ## ## | ## ##/ ## ##/ ## ##/ ## ##/ ## \\\n");
gc_pBQBInterface->bprintf(" #######/ ####### | #######/ ####/ ######/ ######/ ##/\n");
gc_pBQBInterface->bprintf(" ## |\n");
gc_pBQBInterface->bprintf(" ## |\n");
gc_pBQBInterface->bprintf(" ##/\n");
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf(" LibBQB - File Format and Compression Algorithms for Trajectories of\n");
gc_pBQBInterface->printf(" Volumetric Data and Atom Positions\n");
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf(" https://brehm-research.de/bqb\n");
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf(" Free software, licensed under GNU LGPL v3\n");
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf(" Copyright (c) Martin Brehm and Martin Thomas,\n");
gc_pBQBInterface->printf(" Martin Luther University Halle-Wittenberg (Germany), 2016 - 2019.\n");
gc_pBQBInterface->printf("\n");
time(<ime);
today = localtime(<ime);
strcpy(buf,asctime(today));
buf[strlen(buf)-1] = 0;
if (gc_sHostName != NULL)
gc_pBQBInterface->printf(" # Running on %s at %s",gc_sHostName,buf);
else
gc_pBQBInterface->printf(" # Running at %s",buf);
#if !defined(_WIN32) && (defined(__unix__) || defined(__unix) || (defined(__APPLE__) && defined(__MACH__)))
gc_pBQBInterface->printf(" (PID %d)\n",getpid());
#elif defined(_WIN32)
gc_pBQBInterface->printf(" (PID %d)\n",GetCurrentProcessId());
#else
gc_pBQBInterface->printf("\n");
#endif
if (gc_sWorkingDir != NULL)
gc_pBQBInterface->printf(" # Running in %s\n",gc_sWorkingDir);
gc_pBQBInterface->printf(" # Source code version: ");
gc_pBQBInterface->printf("%s\n",BQB_SOURCE_VERSION);
gc_pBQBInterface->printf(" # Compiled at ");
gc_pBQBInterface->printf("%s, %s\n",__DATE__,__TIME__);
#if defined(__VERSION) || defined(__GNUC__) || defined(_MSC_VER) || defined(__clang__) || defined(__llvm__)
gc_pBQBInterface->printf(" # Compiler");
b = false;
#ifdef __VERSION__
gc_pBQBInterface->printf(" \"%s\"",__VERSION__);
b = true;
#endif
#ifdef __llvm__
if (b)
gc_pBQBInterface->printf(",");
gc_pBQBInterface->printf(" LLVM");
b = true;
#endif
#ifdef __clang__
if (b)
gc_pBQBInterface->printf(",");
#if defined(__clang_major__) && defined(__clang_minor__) && defined(__clang_patchlevel__)
gc_pBQBInterface->printf(" CLANG %d.%d.%d",__clang_major__,__clang_minor__,__clang_patchlevel__);
#elif defined(__clang_version__)
gc_pBQBInterface->printf(" CLANG \"%s\"",__clang_version__);
#else
gc_pBQBInterface->printf(" CLANG");
#endif
b = true;
#endif
#ifdef __GNUC__
if (b)
gc_pBQBInterface->printf(",");
#ifdef __MINGW32__
gc_pBQBInterface->printf(" MinGW GCC %d.%d.%d",__GNUC__,__GNUC_MINOR__,__GNUC_PATCHLEVEL__);
#else
gc_pBQBInterface->printf(" GCC %d.%d.%d",__GNUC__,__GNUC_MINOR__,__GNUC_PATCHLEVEL__);
#endif
b = true;
#endif
#ifdef _MSC_VER
if (b)
gc_pBQBInterface->printf(",");
gc_pBQBInterface->printf(" MSVC++ ");
switch(_MSC_VER) {
case 1916: gc_pBQBInterface->printf("15.9, VS 2017"); break;
case 1915: gc_pBQBInterface->printf("15.8, VS 2017"); break;
case 1914: gc_pBQBInterface->printf("15.7, VS 2017"); break;
case 1913: gc_pBQBInterface->printf("15.6, VS 2017"); break;
case 1912: gc_pBQBInterface->printf("15.5, VS 2017"); break;
case 1911: gc_pBQBInterface->printf("15.3, VS 2017"); break;
case 1910: gc_pBQBInterface->printf("15.1, VS 2017"); break;
case 1900: gc_pBQBInterface->printf("14.0, VS 2015"); break;
case 1800: gc_pBQBInterface->printf("12.0, VS 2013"); break;
case 1700: gc_pBQBInterface->printf("11.0, VS 2012"); break;
case 1600: gc_pBQBInterface->printf("10.0, VS 2010"); break;
case 1500: gc_pBQBInterface->printf("9.0, VS 2008"); break;
case 1400: gc_pBQBInterface->printf("8.0, VS 2005"); break;
case 1310: gc_pBQBInterface->printf("7.1, VS 2003"); break;
case 1300: gc_pBQBInterface->printf("7.0"); break;
case 1200: gc_pBQBInterface->printf("6.0"); break;
case 1100: gc_pBQBInterface->printf("5.0"); break;
default: gc_pBQBInterface->printf("%d",_MSC_VER); break;
}
b = true;
#endif
gc_pBQBInterface->printf("\n");
#endif
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf(" Please cite:");
gc_pBQBInterface->printf(" M. Brehm, M. Thomas: \"An Efficient Lossless Compression Algorithm\n");
gc_pBQBInterface->printf(" for Trajectories of Atom Positions and Volumetric Data\",\n");
gc_pBQBInterface->printf(" J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.\n");
gc_pBQBInterface->printf("\n");
err = false;
gc_pBQBInterface->printf("Command line:\n");
gc_pBQBInterface->printf(" \"");
for (z=1;zprintf("%s",argv[z]);
if (z+1 < argc)
gc_pBQBInterface->printf(" ");
}
gc_pBQBInterface->printf("\"\n\n");
CC_InitGlobalVars();
BQBCheckSourceVersion();
if (argc == 2) {
if (strcmp(argv[1],"-revision") == 0) {
BQBWriteRevisionInfo();
goto _end;
}
}
if (!CC_ParseArguments(argc,argv)) {
CC_CommandLineHelp();
return 1;
}
driver = gc_pBQBInterface->CreateDriver( 0 );
if (gc_bCompress) {
if (gc_bFile) {
gc_pBQBInterface->printf("Will compress file.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Input file: %s\n",
(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Output file: %s\n",
(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",
gc_iFileVerbose);
gc_pBQBInterface->printf(" Dry run: -dryrun %s\n",
gc_bDryRun?"yes":"no");
gc_pBQBInterface->printf("%s",gc_pParmFile->ToString(4).c_str());
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf("Parameter Key:");
gc_pBQBInterface->printf(" %s\n\n",gc_pParmFile->ToKey().c_str());
if (gc_bDryRun) {
gc_pBQBInterface->printf("This is a dry run. Not processing file. Leaving now.\n\n");
goto _end;
}
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (gc_sOutFile != NULL) {
if (strlen(gc_sOutFile) > 4) {
if (bqb_strcmp_nocase(&gc_sOutFile[strlen(gc_sOutFile)-4],".bqb") == 0)
goto _okcfile;
if (bqb_strcmp_nocase(&gc_sOutFile[strlen(gc_sOutFile)-4],".bbq") == 0) {
BQB_PrintBMode();
goto _okcfile;
}
}
gc_pBQBInterface->eprintf("Error: Output file extension needs to be \".bqb\".\n");
err = true;
goto _end;
_okcfile:;
}
if (gc_iFileVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iFileVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
if (!driver->CompressFile(
gc_sInFile, // Input File
gc_sOutFile, // Output File
gc_pParmFile
)) {
gc_pBQBInterface->eprintf("CompressFile returned an error.\n");
err = true;
goto _end;
} else
gc_pBQBInterface->printf("CompressFile successfully returned.\n");
}
if (gc_bCube) {
gc_pBQBInterface->printf("Will compress cube file.\n\n");
b = false;
if (gc_iCubeOptimize != 0) {
if (gc_iCubeOptSteps == -1) {
gc_pBQBInterface->printf(" -optsteps not specified, defaulting to 20.\n");
gc_iCubeOptSteps = 20;
b = true;
}
if ((gc_iCubeOptSteps > gc_iCubeSteps) && (gc_iCubeSteps != -1)) {
gc_pBQBInterface->printf(" -optsteps larger than -steps, reducing to %d.\n",gc_iCubeSteps);
gc_iCubeOptSteps = gc_iCubeSteps;
b = true;
}
}
if (b)
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" General:\n");
gc_pBQBInterface->printf(" Infile: %s\n",
(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Outfile: %s\n",
(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
gc_pBQBInterface->printf(" Output Ref. Traj.: -refout %s\n",
(gc_sCubeRefOut!=NULL)?gc_sCubeRefOut:"(NULL)");
gc_pBQBInterface->printf(" Start: -start %d\n",
gc_iCubeStart+1);
gc_pBQBInterface->printf(" Steps: -steps %d\n",
gc_iCubeSteps);
gc_pBQBInterface->printf(" Stride: -stride %d\n",
gc_iCubeStride);
gc_pBQBInterface->printf(" Keyframe frequency: -keyframe %d\n",
gc_iCubeKey);
gc_pBQBInterface->printf(" Keep Comment Line: -comment %s\n",
gc_bCubeKeepComment?"yes":"no");
gc_pBQBInterface->printf(" Check Compressed Data: -check %s\n",
gc_bCubeCompare?"yes":"no");
gc_pBQBInterface->printf(" Dummy Read (no comp.): -dummyread %s\n",
gc_bCubeDummyRead?"yes":"no");
gc_pBQBInterface->printf(" Optimize Parameters: -optimize %d (0=off, 1=quick, 2=patient, 3=precise, 4=exhaustive)\n",
gc_iCubeOptimize);
gc_pBQBInterface->printf(" Optimization Frames: -optsteps %d\n",
gc_iCubeOptSteps);
gc_pBQBInterface->printf(" Quit after Optim.: -onlyopt %s\n",
gc_bCubeOnlyOpt?"yes":"no");
gc_pBQBInterface->printf(" Opt. from Start on: -optstart %s\n",
(gc_iCubeOptIncludeFirst==1)?"yes":((gc_iCubeOptIncludeFirst==0)?"no":"(undef)"));
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",
gc_iCubeVerbose);
gc_pBQBInterface->printf(" Dry run: -dryrun %s\n",
gc_bDryRun?"yes":"no");
gc_pBQBInterface->printf("%s",gc_pParmVol->ToString(2).c_str());
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf("Parameter Key:");
gc_pBQBInterface->printf(" %s\n\n",gc_pParmVol->ToKey().c_str());
if (gc_bDryRun) {
gc_pBQBInterface->printf("This is a dry run. Not processing file. Leaving now.\n\n");
goto _end;
}
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (strlen(gc_sInFile) < 6) {
gc_pBQBInterface->eprintf("Error: Input file name is too short (needs to be *.cube).\n");
err = true;
goto _end;
}
if (bqb_strcmp_nocase( &gc_sInFile[strlen(gc_sInFile)-5], ".cube" ) != 0) {
gc_pBQBInterface->eprintf("Error: Only Gaussian Cube trajectories are currently supported as input.\n");
err = true;
goto _end;
}
if (!gc_bOptTouched)
gc_pBQBInterface->printf("To disable the automatic parameter optimization, add \"-optimize 0\" to the command line.\n\n");
if (gc_iCubeOptimize == 3)
gc_pBQBInterface->printf("To achieve highest compression ratio (at the cost of compression time), add \"-csplit 14 -citer 40\".\n\n");
if (gc_sOutFile != NULL) {
if (strlen(gc_sOutFile) > 4) {
if (bqb_strcmp_nocase(&gc_sOutFile[strlen(gc_sOutFile)-4],".bqb") == 0)
goto _okcvol;
if (bqb_strcmp_nocase(&gc_sOutFile[strlen(gc_sOutFile)-4],".bbq") == 0) {
BQB_PrintBMode();
goto _okcvol;
}
}
gc_pBQBInterface->eprintf("Error: Output file extension needs to be \".bqb\".\n");
err = true;
goto _end;
_okcvol:;
}
driver->m_iOptIncludeFirst = gc_iCubeOptIncludeFirst;
if (gc_iCubeVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iCubeVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
if (!driver->CompressCube(
gc_sInFile, // Cube Trajectory
gc_sOutFile,
gc_sCubeRefOut, // Output reference file
gc_iCubeStart, // Start
gc_iCubeSteps, // Steps
gc_iCubeStride, // Stride
gc_iCubeKey,
gc_pParmVol,
gc_iCubeOptimize,
gc_iCubeOptSteps,
gc_bCubeOnlyOpt,
gc_bCubeKeepComment, // Keep Comment Line
gc_bCubeCompare, // Compare decompressed results
gc_bCubeDummyRead // Dummy Read (no compression or output)
)) {
gc_pBQBInterface->eprintf("CompressCube returned an error.\n");
err = true;
goto _end;
} else
gc_pBQBInterface->printf("CompressCube successfully returned.\n");
}
if (gc_bXYZ) {
gc_pBQBInterface->printf("Will compress XYZ file.\n\n");
b = false;
if (gc_iAtomOptimize != 0) {
if (gc_iAtomOptSteps == -1) {
gc_pBQBInterface->printf(" -optsteps not specified, defaulting to 50.\n");
gc_iAtomOptSteps = 50;
b = true;
}
if ((gc_iAtomOptSteps > gc_iAtomSteps) && (gc_iAtomSteps != -1)) {
gc_pBQBInterface->printf(" -optsteps larger than -steps, reducing to %d.\n",gc_iAtomSteps);
gc_iAtomOptSteps = gc_iAtomSteps;
b = true;
}
}
if (b)
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" General:\n");
gc_pBQBInterface->printf(" Infile: %s\n",
(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Outfile: %s\n",
(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
gc_pBQBInterface->printf(" Output Ref. Traj.: -refout %s\n",
(gc_sAtomRefOut!=NULL)?gc_sAtomRefOut:"(NULL)");
gc_pBQBInterface->printf(" Start: -start %d\n",
gc_iAtomStart);
gc_pBQBInterface->printf(" Steps: -steps %d\n",
gc_iAtomSteps);
gc_pBQBInterface->printf(" Stride: -stride %d\n",
gc_iAtomStride);
gc_pBQBInterface->printf(" Keyframe frequency: -keyframe %d\n",
gc_iAtomKey);
gc_pBQBInterface->printf(" Keep Comment Line: -comment %s\n",
gc_bAtomKeepComment?"yes":"no");
gc_pBQBInterface->printf(" Check Compressed Data: -check %s\n",
gc_bAtomCompare?"yes":"no");
gc_pBQBInterface->printf(" Optimize Parameters: -optimize %d (0=off, 1=quick, 2=patient, 3=precise, 4=exhaustive)\n",
gc_iAtomOptimize);
gc_pBQBInterface->printf(" Optimization Frames: -optsteps %d\n",
gc_iAtomOptSteps);
gc_pBQBInterface->printf(" Quit after Optim.: -onlyopt %s\n",
gc_bAtomOnlyOpt?"yes":"no");
gc_pBQBInterface->printf(" Opt. from Start on: -optstart %s\n",
(gc_iAtomOptIncludeFirst==1)?"yes":((gc_iAtomOptIncludeFirst==0)?"no":"(undef)"));
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",
gc_iAtomVerbose);
gc_pBQBInterface->printf(" Dry run: -dryrun %s\n",
gc_bDryRun?"yes":"no");
gc_pBQBInterface->printf("%s",gc_pParmPos->ToString(2).c_str());
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf("Parameter Key:");
gc_pBQBInterface->printf(" %s\n\n",gc_pParmPos->ToKey().c_str());
if (gc_bDryRun) {
gc_pBQBInterface->printf("This is a dry run. Not processing file. Leaving now.\n\n");
goto _end;
}
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (strlen(gc_sInFile) < 5) {
gc_pBQBInterface->eprintf("Error: Input file name is too short (needs to be *.xyz).\n");
gc_pBQBInterface->printf(" More formats will be added in future releases.\n");
err = true;
goto _end;
}
if (bqb_strcmp_nocase( &gc_sInFile[strlen(gc_sInFile)-4], ".xyz" ) != 0) {
gc_pBQBInterface->eprintf("Error: Only XMol XYZ trajectories are currently supported as input.\n");
gc_pBQBInterface->printf(" More formats will be added in future releases.\n");
err = true;
goto _end;
}
if (!gc_bOptTouched)
gc_pBQBInterface->printf("To disable the automatic parameter optimization, add \"-optimize 0\" to the command line.\n\n");
if (gc_sOutFile != NULL) {
if (strlen(gc_sOutFile) > 4) {
if (bqb_strcmp_nocase(&gc_sOutFile[strlen(gc_sOutFile)-4],".bqb") == 0)
goto _okcpos;
if (bqb_strcmp_nocase(&gc_sOutFile[strlen(gc_sOutFile)-4],".btr") == 0)
goto _okcpos;
if (bqb_strcmp_nocase(&gc_sOutFile[strlen(gc_sOutFile)-4],".bbq") == 0) {
BQB_PrintBMode();
goto _okcpos;
}
}
gc_pBQBInterface->eprintf("Error: Output file extension needs to be \".bqb\" or \".btr\".\n");
err = true;
goto _end;
_okcpos:;
}
driver->m_iOptIncludeFirst = gc_iAtomOptIncludeFirst;
if (gc_iAtomVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iAtomVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
if (!driver->CompressXYZ(
gc_sInFile, // XYZ file name
gc_sOutFile, //
gc_sAtomRefOut, // Output reference trajectory
gc_iAtomStart, // Start
gc_iAtomSteps, // Steps
gc_iAtomStride, // Stride
gc_iAtomKey,
gc_pParmPos,
gc_bAtomKeepComment, // Keep Comment Line
gc_bAtomCompare, // Compare decompressed results
gc_iAtomOptimize,
gc_iAtomOptSteps,
gc_bAtomOnlyOpt
)) {
gc_pBQBInterface->eprintf("CompressXYZ returned an error.\n");
err = true;
goto _end;
} else
gc_pBQBInterface->printf("CompressXYZ successfully returned.\n");
}
}
if (gc_bDecompress) {
if (gc_bFile) {
gc_pBQBInterface->printf("Will decompress file.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Infile: %s\n",
(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Outfile: %s\n",
(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
gc_pBQBInterface->printf(" Reference File: -refcompare %s\n",
(gc_sRefFile!=NULL)?gc_sRefFile:"(NULL)");
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",
gc_iFileVerbose);
gc_pBQBInterface->printf("\n");
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (strlen(gc_sInFile) > 4) {
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-4],".bqb") == 0)
goto _okdfile;
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-4],".bbq") == 0) {
BQB_PrintBMode();
goto _okdfile;
}
}
gc_pBQBInterface->eprintf("Error: Input file extension needs to be \".bqb\".\n");
err = true;
goto _end;
_okdfile:
if (gc_iFileVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iFileVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
if (!driver->DecompressFile(
gc_sInFile, // Input File
gc_sOutFile, // Output File
gc_sRefFile // Ref File
)) {
gc_pBQBInterface->eprintf("DecompressFile returned an error.\n");
err = true;
goto _end;
} else
gc_pBQBInterface->printf("DecompressFile successfully returned.\n");
}
if (gc_bCube) {
gc_pBQBInterface->printf("Will decompress Cube file.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Infile: %s\n",
(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Outfile: %s\n",
(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
gc_pBQBInterface->printf(" Reference File: -refcompare %s\n",
(gc_sRefFile!=NULL)?gc_sRefFile:"(NULL)");
gc_pBQBInterface->printf(" Steps: -steps %d\n",
gc_iCubeSteps);
gc_pBQBInterface->printf(" Stride: -stride %d\n",
gc_iCubeStride);
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",
gc_iCubeVerbose);
gc_pBQBInterface->printf("\n");
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (gc_sOutFile != NULL) {
if (strlen(gc_sOutFile) < 6) {
gc_pBQBInterface->eprintf("Error: Output file name is too short (needs to be *.cube).\n");
err = true;
goto _end;
}
if (bqb_strcmp_nocase( &gc_sOutFile[strlen(gc_sOutFile)-5], ".cube" ) != 0) {
gc_pBQBInterface->eprintf("Error: Only Gaussian Cube trajectories are currently supported as output.\n");
err = true;
goto _end;
}
}
if (strlen(gc_sInFile) > 4) {
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-4],".bqb") == 0)
goto _okdcube;
if (strlen(gc_sInFile) > 6)
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-6],".blist") == 0)
goto _okdcube;
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-4],".bbq") == 0) {
BQB_PrintBMode();
goto _okdcube;
}
}
gc_pBQBInterface->eprintf("Error: Input file extension needs to be \".bqb\" or \".blist\".\n");
err = true;
goto _end;
_okdcube:
if (gc_iCubeVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iCubeVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
if (!driver->DecompressCube(
gc_sInFile,
gc_sOutFile,
gc_sRefFile, // Input reference file
gc_iCubeSteps, // Steps
gc_iCubeStride, // Stride
NULL
)) {
gc_pBQBInterface->eprintf("DecompressCube returned an error.\n");
err = true;
goto _end;
} else
gc_pBQBInterface->printf("DecompressCube successfully returned.\n");
}
if (gc_bXYZ) {
gc_pBQBInterface->printf("Will decompress XYZ file.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Infile: %s\n",
(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Outfile: %s\n",
(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
gc_pBQBInterface->printf(" Reference File: -refcompare %s\n",
(gc_sRefFile!=NULL)?gc_sRefFile:"(NULL)");
gc_pBQBInterface->printf(" Steps: -steps %d\n",
gc_iAtomSteps);
gc_pBQBInterface->printf(" Stride: -stride %d\n",
gc_iAtomStride);
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",
gc_iAtomVerbose);
gc_pBQBInterface->printf("\n");
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (gc_sOutFile != NULL) {
if (strlen(gc_sOutFile) < 5) {
gc_pBQBInterface->eprintf("Error: Output file name is too short (needs to be *.xyz).\n");
gc_pBQBInterface->printf(" More formats will be added in future releases.\n");
err = true;
goto _end;
}
if (bqb_strcmp_nocase( &gc_sOutFile[strlen(gc_sOutFile)-4], ".xyz" ) != 0) {
gc_pBQBInterface->eprintf("Error: Only XMol XYZ trajectories are currently supported as output.\n");
gc_pBQBInterface->printf(" More formats will be added in future releases.\n");
err = true;
goto _end;
}
}
if (strlen(gc_sInFile) > 4) {
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-4],".bqb") == 0)
goto _okdpos;
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-4],".btr") == 0)
goto _okdpos;
if (strlen(gc_sInFile) > 6)
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-6],".blist") == 0)
goto _okdpos;
if (bqb_strcmp_nocase(&gc_sInFile[strlen(gc_sInFile)-4],".bbq") == 0) {
BQB_PrintBMode();
goto _okdpos;
}
}
gc_pBQBInterface->eprintf("Error: Input file extension needs to be \".bqb\", \".btr\", or \".blist\".\n");
err = true;
goto _end;
_okdpos:
if (gc_iAtomVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iAtomVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
if (!driver->DecompressXYZ(
gc_sInFile, //
gc_sOutFile, // XYZ file name
gc_sRefFile, //
gc_iAtomSteps, // Steps
gc_iAtomStride, // Stride
NULL
)) {
gc_pBQBInterface->eprintf("DecompressXYZ returned an error.\n");
err = true;
goto _end;
} else
gc_pBQBInterface->printf("DecompressXYZ successfully returned.\n");
}
}
if (gc_bCheck) {
gc_pBQBInterface->eprintf("\"check\": Not yet implemented.\n");
err = true;
goto _end;
/* gc_pBQBInterface->printf("\n###### Seek Test ######\n\n");
FILE *a;
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("##########################\n");
gc_pBQBInterface->printf("### 1.) Seek to 17 ###\n");
gc_pBQBInterface->printf("##########################\n");
bf.OpenRead(gc_sInFile);
SetBQBVerbose(true);
bf.SeekFrame(17);
bf.ReadFrame();
SetBQBVerbose(false);
a = OpenFileWrite("seek_17.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("##########################\n");
gc_pBQBInterface->printf("### 2.) Skip to 17 ###\n");
gc_pBQBInterface->printf("##########################\n");
bf.OpenRead(gc_sInFile);
bf.SkipFrames(17);
bf.ReadFrame();
a = OpenFileWrite("skip_17.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("#############################\n");
gc_pBQBInterface->printf("### 3.) Seek to 19999 ###\n");
gc_pBQBInterface->printf("#############################\n");
bf.OpenRead(gc_sInFile);
SetBQBVerbose(true);
bf.SeekFrame(19999);
bf.ReadFrame();
SetBQBVerbose(false);
a = OpenFileWrite("seek_19999.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("#############################\n");
gc_pBQBInterface->printf("### 4.) Skip to 19999 ###\n");
gc_pBQBInterface->printf("#############################\n");
bf.OpenRead(gc_sInFile);
bf.SkipFrames(19999);
bf.ReadFrame();
a = OpenFileWrite("skip_19999.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("#############################\n");
gc_pBQBInterface->printf("### 5.) Seek to 20000 ###\n");
gc_pBQBInterface->printf("#############################\n");
bf.OpenRead(gc_sInFile);
SetBQBVerbose(true);
bf.SeekFrame(20000);
bf.ReadFrame();
SetBQBVerbose(false);
a = OpenFileWrite("seek_20000.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("#############################\n");
gc_pBQBInterface->printf("### 6.) Skip to 20000 ###\n");
gc_pBQBInterface->printf("#############################\n");
bf.OpenRead(gc_sInFile);
bf.SkipFrames(20000);
bf.ReadFrame();
a = OpenFileWrite("skip_20000.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("#############################\n");
gc_pBQBInterface->printf("### 7.) Seek to 20017 ###\n");
gc_pBQBInterface->printf("#############################\n");
bf.OpenRead(gc_sInFile);
SetBQBVerbose(true);
bf.SeekFrame(20017);
bf.ReadFrame();
SetBQBVerbose(false);
a = OpenFileWrite("seek_20017.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->printf("#############################\n");
gc_pBQBInterface->printf("### 8.) Skip to 20017 ###\n");
gc_pBQBInterface->printf("#############################\n");
bf.OpenRead(gc_sInFile);
bf.SkipFrames(20017);
bf.ReadFrame();
a = OpenFileWrite("skip_20017.bqb",false);
WriteArrayToFile(a,*bf.GetFramePayload());
fclose(a);
bf.Close();
gc_pBQBInterface->printf("\n###### Seek Test done ######\n\n");
return 0;*/
gc_pBQBInterface->printf("Will check BQB file.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Infile: %s\n",(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",gc_iCheckVerbose);
gc_pBQBInterface->printf("\n");
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
gc_pBQBInterface->printf("Checking integrity of compressed file \"%s\".\n\n",gc_sInFile);
if (gc_iCheckVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iCheckVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
/* if (!bf.CheckIntegrity(gc_sInFile,gc_bCheckVerbose)) {
gc_pBQBInterface->eprintf("Integrity check failed.\n");
err = true;
}*/
}
if (gc_bCompare) {
gc_pBQBInterface->eprintf("\"compare\": Not yet implemented.\n");
goto _end;
gc_pBQBInterface->printf("Will compare BQB coordinates to XYZ file.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Infile: %s\n",(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Reffile: %s\n",(gc_sRefFile!=NULL)?gc_sRefFile:"(NULL)");
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",gc_iCompareVerbose);
gc_pBQBInterface->printf("\n");
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (gc_sRefFile == NULL) {
gc_pBQBInterface->eprintf("Error: Reference file name is required.\n");
err = true;
goto _end;
}
gc_pBQBInterface->printf("Comparing atom coordinates between %s and %s.\n\n",gc_sInFile,gc_sRefFile);
if (gc_iCompareVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iCompareVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
/* if (!bf.CompareCoords(gc_sInFile,gc_sRefFile,gc_bCompareVerbose)) {
gc_pBQBInterface->eprintf("Comparison failed.\n");
err = true;
}*/
}
if (gc_bMerge) {
gc_pBQBInterface->eprintf("\"merge\": Not yet implemented.\n");
goto _end;
gc_pBQBInterface->printf("Will merge BQB files.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Outfile: %s\n",(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
if (gc_sInFileList.size() != 0) {
gc_pBQBInterface->printf(" Infile: %s\n",(gc_sInFileList[0]!=NULL)?gc_sInFileList[0]:"(NULL)");
for (z=1;z<(int)gc_sInFileList.size();z++)
gc_pBQBInterface->printf(" %s\n",(gc_sInFileList[z]!=NULL)?gc_sInFileList[z]:"(NULL)");
} else
gc_pBQBInterface->printf(" Infile: (NULL)\n");
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",gc_iMergeVerbose);
gc_pBQBInterface->printf("\n");
if (gc_sOutFile == NULL) {
gc_pBQBInterface->eprintf("Error: Output file name is required.\n");
err = true;
goto _end;
}
if (gc_sInFileList.size() == 0) {
gc_pBQBInterface->eprintf("Error: At least one input file name is required.\n");
err = true;
goto _end;
}
gc_pBQBInterface->printf("Merging %lu BQB files into \"%s\".\n\n",gc_sInFileList.size(),gc_sOutFile);
if (gc_iMergeVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iMergeVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
if (!driver->MergeBQB(
gc_sOutFile,
gc_sInFileList
//gc_bMergeVerbose
)) {
gc_pBQBInterface->eprintf("Merging failed.\n");
err = true;
goto _end;
}
}
if (gc_bSplit) {
gc_pBQBInterface->eprintf("\"split\": Not yet implemented.\n");
goto _end;
gc_pBQBInterface->printf("Will split BQB file.\n\n");
gc_pBQBInterface->bprintf("*** Parameters ***\n");
gc_pBQBInterface->printf(" Infile: %s\n",(gc_sInFile!=NULL)?gc_sInFile:"(NULL)");
gc_pBQBInterface->printf(" Outfile: %s\n",(gc_sOutFile!=NULL)?gc_sOutFile:"(NULL)");
gc_pBQBInterface->printf(" Split length: %d\n",gc_iSplitLength);
gc_pBQBInterface->printf(" Steps: -steps %d\n",gc_iSplitSteps);
gc_pBQBInterface->printf(" Verbose: -verbose %d\n",gc_iSplitVerbose);
gc_pBQBInterface->printf("\n");
if (gc_sInFile == NULL) {
gc_pBQBInterface->eprintf("Error: Input file name is required.\n");
err = true;
goto _end;
}
if (gc_sOutFile == NULL) {
gc_pBQBInterface->eprintf("Error: Output base name is required.\n");
err = true;
goto _end;
}
if (gc_iSplitLength == -1) {
gc_pBQBInterface->eprintf("Error: Split length is required.\n");
err = true;
goto _end;
}
gc_pBQBInterface->printf("Splitting BQB file \"%s\" into pieces of %d frames with base name \"%s\".\n\n",gc_sInFile,gc_iSplitLength,gc_sOutFile);
if (gc_iSplitVerbose == 2)
gc_pBQBInterface->SetPrintLevel(BQB_PL_DEBUG);
else if (gc_iSplitVerbose == 1)
gc_pBQBInterface->SetPrintLevel(BQB_PL_VERBOSE);
else
gc_pBQBInterface->SetPrintLevel(BQB_PL_STANDARD);
/* if (!engine->SplitBQB(gc_sInFile,gc_sOutFile,gc_iSplitLength,gc_iSplitSteps,gc_bSplitVerbose)) {
gc_pBQBInterface->eprintf("Splitting failed.\n");
err = true;
}*/
}
_end:
gc_pBQBInterface->DestroyDriver( driver );
gc_pBQBInterface->printf("\n");
gc_pBQBInterface->bprintf(" Please cite:");
gc_pBQBInterface->printf(" M. Brehm, M. Thomas: \"An Efficient Lossless Compression Algorithm\n");
gc_pBQBInterface->printf(" for Trajectories of Atom Positions and Volumetric Data\",\n");
gc_pBQBInterface->printf(" J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.\n");
gc_pBQBInterface->bprintf("\n *** bqbtool leaving ***\n\n");
// After this command, no more printing should occur
BQBDestroyInterface( gc_pBQBInterface );
#ifndef BQB_INSIDE_TRAVIS
if (gc_fLogFile != NULL)
fclose(gc_fLogFile);
#endif
if (err)
return 1;
else
return 0;
}
travis-src-190101/src/bqb_alphabet.cpp 0100777 0000000 0000000 00000036176 13412725621 014561 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_tools.h"
#include
#include
#include
#include "bqb_alphabet.h"
#include "bqb_hufftree.h"
#include "bqb_interface.h"
const char *GetRevisionInfo_bqb_alphabet(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bqb_alphabet() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
bool SORT_Alphabet_Freq(const CBQBAlphabetEntry *e1, const CBQBAlphabetEntry *e2) {
return (e1->m_iFrequency > e2->m_iFrequency);
}
bool SORT_Alphabet_Symbol(const CBQBAlphabetEntry *e1, const CBQBAlphabetEntry *e2) {
return (e1->m_iSymbol < e2->m_iSymbol);
}
void CBQBAlphabet::BuildAlphabet(const std::vector &inp) {
int z, z2;
CBQBAlphabetEntry *ae;
std::vector > ta;
int ti2;
const unsigned int hash_size = 1024;
if (m_IF.IsPL(BQB_PL_DEBUG)) {
m_IF.printf("Building alphabet (%lu symbols)...\n",inp.size());
m_IF.printf(" [");
}
for (z=0;z<(int)m_oaAlphabet.size();z++)
delete m_oaAlphabet[z];
m_oaAlphabet.clear();
m_oaAlphabetSortFreq.clear();
ta.resize(hash_size);
for (z=C_MIN_RESERVED;true;z++) {
ti2 = positive_modulo(z, hash_size);
ae = new CBQBAlphabetEntry();
ae->m_iSymbol = z;
ae->m_iFrequency = 0;
m_oaAlphabet.push_back(ae);
ta[ti2].push_back(ae);
if (z == C_MAX_RESERVED)
break;
}
for (z=0;z<(int)inp.size();z++) {
if (m_IF.IsPL(BQB_PL_DEBUG)) {
if (fmod(z,inp.size()/60.0) < 1.0) {
m_IF.printf("#");
m_IF.FlushLog();
}
}
ti2 = positive_modulo(inp[z], hash_size);
for (z2=0;z2<(int)ta[ti2].size();z2++)
if (ta[ti2][z2]->m_iSymbol == inp[z])
goto _found2;
z2 = (int)ta[ti2].size();
ae = new CBQBAlphabetEntry();
ae->m_iSymbol = inp[z];
ae->m_iFrequency = 0;
m_oaAlphabet.push_back(ae);
ta[ti2].push_back(ae);
_found2:
ta[ti2][z2]->m_iFrequency++;
}
if (m_IF.IsPL(BQB_PL_DEBUG)) {
m_IF.printf("]\n");
m_IF.printf("Found %lu symbol types.\n",m_oaAlphabet.size());
m_IF.printf("Sorting alphabet by symbols...\n");
}
m_oaAlphabetSortFreq.assign(m_oaAlphabet.begin(),m_oaAlphabet.end());
std::sort(m_oaAlphabet.begin(),m_oaAlphabet.end(),SORT_Alphabet_Symbol);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Sorting alphabet by frequencies...\n");
std::sort(m_oaAlphabetSortFreq.begin(),m_oaAlphabetSortFreq.end(),SORT_Alphabet_Freq);
for (z=0;z<(int)m_oaAlphabet.size();z++)
m_oaAlphabet[z]->m_iIndex = z;
if (m_IF.IsPL(BQB_PL_DEBUG)) {
m_IF.printf("Creating alphabet indices...\n");
m_IF.printf(" [");
}
// m_IF.printf("Assigning output alphabet...\n");
m_iaIndices.resize(inp.size());
for (z=0;z<(int)inp.size();z++) {
if (m_IF.IsPL(BQB_PL_DEBUG)) {
if (fmod(z,inp.size()/60.0) < 1.0) {
m_IF.printf("#");
m_IF.FlushLog();
}
}
//ti2 = inp[z] % hash_size;
ti2 = positive_modulo(inp[z], hash_size);
for (z2=0;z2<(int)ta[ti2].size();z2++)
if (ta[ti2][z2]->m_iSymbol == inp[z])
break;
m_iaIndices[z] = ta[ti2][z2]->m_iIndex;
}
if (m_IF.IsPL(BQB_PL_DEBUG)) {
m_IF.printf("]\n");
m_IF.printf("Finished building alphabet.\n");
}
}
void CBQBAlphabet::Export(CBQBBitSet *bs, bool huffman, bool chr) const {
int z, bits, ti, border, bborder, bsize, bold;
long mis, mas, s, m, cht;
std::vector ia, ia2;
CBQBHuffmanTree *ht, *ht2;
if (m_IF.IsPL(BQB_PL_DEBUG)) {
if (chr)
m_IF.printf("Exporting alphabet (char flag)...\n");
else
m_IF.printf("Exporting alphabet (no char flag)...\n");
}
mis = 0x7FFFFFF0;
mas = -0x7FFFFFF0;
for (z=0;z<(int)m_oaAlphabet.size();z++) {
if (m_oaAlphabet[z]->m_iSymbol >= C_MIN_RESERVED)
break;
if (m_oaAlphabet[z]->m_iSymbol > mas)
mas = m_oaAlphabet[z]->m_iSymbol;
if (m_oaAlphabet[z]->m_iSymbol < mis)
mis = m_oaAlphabet[z]->m_iSymbol;
}
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Will write %d symbol types.\n",z);
if (!chr) {
bits = (int)ceil(mylog2(z+1));
if (bits <= 8) {
bs->WriteBit(0);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Using short format (8 bits) for symbol type count.\n");
bs->WriteBits(z,8);
} else {
bs->WriteBit(1);
bs->WriteBits(bits,6);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Using %d bits for symbol type count.\n",bits);
bs->WriteBits(z,bits);
}
} else
bs->WriteBits(z,8);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Symbols range from %ld to %ld.\n",mis,mas);
if (huffman) {
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf(">>> Huffman coding of alphabet >>>\n");
bs->WriteBit(1);
if (!chr) {
bits = (int)ceil(mylog2(abs(m_oaAlphabet[0]->m_iSymbol)+1));
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("First alphabet entry is %d, using %d bits.\n",m_oaAlphabet[0]->m_iSymbol,bits);
bs->WriteBits(bits,6);
if (m_oaAlphabet[0]->m_iSymbol < 0)
bs->WriteBit(1);
else
bs->WriteBit(0);
bs->WriteBits(abs(m_oaAlphabet[0]->m_iSymbol),bits);
} else
bs->WriteBits(m_oaAlphabet[0]->m_iSymbol,8);
m = 0;
for (z=0;z<(int)m_oaAlphabet.size()-1;z++) {
if (m_oaAlphabet[z+1]->m_iSymbol >= C_MIN_RESERVED)
break;
if (m_oaAlphabet[z+1]->m_iSymbol-m_oaAlphabet[z]->m_iSymbol > m)
m = m_oaAlphabet[z+1]->m_iSymbol-m_oaAlphabet[z]->m_iSymbol;
ia.push_back(m_oaAlphabet[z+1]->m_iSymbol-m_oaAlphabet[z]->m_iSymbol);
}
bits = (int)ceil(mylog2(m+1));
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Largest difference is %ld, using %d bits.\n",m,bits);
ia2.resize(bits+1);
for (z=0;z<(int)ia2.size();z++)
ia2[z] = 0;
for (z=0;z<(int)ia.size();z++)
ia2[(int)ceil(mylog2(ia[z]+1))]++;
if (m_IF.IsPL(BQB_PL_DEBUG))
for (z=0;z<(int)ia2.size();z++)
m_IF.printf(" %2d bits: %6d\n",z,ia2[z]);
bborder = -1;
bsize = 1000000000;
for (border=0;borderInit(m+1);
for (z=0;z<(int)ia.size();z++)
ht->m_iaFrequencies[ia[z]]++;
ht->BuildTree(false);
ti = ht->ExportTree(NULL,chr);
for (z=0;z<(int)ia.size();z++)
ti += ht->m_oaBitStrings[ia[z]]->GetLength();
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Creating Canonical Huffman tree...\n");
ht2 = new CBQBHuffmanTree(m_IF);
ht2->Init(m+1);
for (z=0;z<(int)ia.size();z++)
ht2->m_iaFrequencies[ia[z]]++;
ht2->BuildTree(true);
cht = ht2->ExportTree(NULL,chr);
for (z=0;z<(int)ia.size();z++)
cht += ht2->m_oaBitStrings[ia[z]]->GetLength();
if (m_IF.IsPL(BQB_PL_DEBUG)) {
m_IF.printf("Best border storage would require %8.2f bytes.\n",bsize/8.0);
m_IF.printf("Huffman alphabet storage requires %8.2f Bytes.\n",ti/8.0);
m_IF.printf("Canonical Huffman would require %8.2f Bytes.\n",cht/8.0);
}
if ((bsize <= ti) && (bsize <= cht)) {
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Falling back to more efficient border algorithm.\n");
bs->WriteBit(0);
if (chr) {
bs->WriteBits(bits,4);
bs->WriteBits(bborder,3);
} else {
bs->WriteBits(bits,6);
bs->WriteBits(bborder,5);
}
for (z=0;z<(int)ia.size();z++) {
if ((int)ceil(mylog2(ia[z]+1)) <= bborder) {
bs->WriteBit(0);
bs->WriteBits(ia[z],bborder);
} else {
bs->WriteBit(1);
bs->WriteBits(ia[z],bits);
}
}
} else if (ti <= cht) {
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Exporting Normal Huffman tree...\n");
bs->WriteBit(1);
bold = bs->GetLength();
ht->ExportTree(bs,chr);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("%d bits written to Huffman tree.\n",bs->GetLength()-bold);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Exporting Normal Huffman data (count %lu)...\n",ia.size());
bold = bs->GetLength();
for (z=0;z<(int)ia.size();z++)
bs->WriteBits(ht->m_oaBitStrings[ia[z]]);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("%d bits written to Huffman data.\n",bs->GetLength()-bold);
} else {
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Exporting Canonical Huffman tree...\n");
bs->WriteBit(1);
ht2->ExportTree(bs,chr);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Exporting Canonical Huffman data...\n");
for (z=0;z<(int)ia.size();z++)
bs->WriteBits(ht2->m_oaBitStrings[ia[z]]);
}
delete ht;
delete ht2;
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Done.\n");
} else { // Not Huffman
bs->WriteBit(0);
mis = bqbabs(mis);
mas = bqbabs(mas);
if (mis > mas)
mas = mis;
bits = (int)ceil(mylog2(mas+1))+1;
s = ((unsigned long)1)<<(bits-1);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Requires %d bits per symbol, s=%ld.\n",bits,s);
bs->WriteBits(bits,6);
for (z=0;z<(int)m_oaAlphabet.size();z++) {
if (m_oaAlphabet[z]->m_iSymbol >= C_MIN_RESERVED)
break;
bs->WriteBits(m_oaAlphabet[z]->m_iSymbol+s,bits);
}
}
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Exporting alphabet done.\n");
}
void CBQBAlphabet::Import(CBQBBitSet *bs, bool chr) {
int z, ti, bits, border, bold;
unsigned long i;
long l;
long s;
CBQBAlphabetEntry *ae;
CBQBHuffmanTree *ht;
if (m_IF.IsPL(BQB_PL_DEBUG)) {
if (chr)
m_IF.printf("Importing alphabet (char flag)...\n");
else
m_IF.printf("Importing alphabet (no char flag)...\n");
}
if (!chr) {
if (bs->ReadBit()) {
bits = bs->ReadBitsInteger(6);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Symbol type count is stored with %d bits.\n",bits);
i = bs->ReadBitsInteger(bits);
} else {
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Symbol type count short format (8 bits).\n");
i = bs->ReadBitsInteger(8);
}
} else
i = bs->ReadBitsInteger(8);
if (chr && (i == 0)) {
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Warning: Symbol type count was 0, assuming 256.\n");
i = 256;
}
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Will read %lu symbol types.\n",i);
m_oaAlphabet.reserve(i);
if (bs->ReadBit()) { // Huffman
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Reading Huffman-coded alphabet.\n");
if (!chr) {
bits = bs->ReadBitsInteger(6);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("First alphabet symbol has %d bits.\n",bits);
if (bs->ReadBit())
l = -((long)bs->ReadBitsInteger(bits));
else
l = bs->ReadBitsInteger(bits);
} else
l = bs->ReadBitsInteger(8);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("First alphabet symbol is %ld.\n",l);
ae = new CBQBAlphabetEntry();
ae->m_iFrequency = 0;
ae->m_iIndex = 0;
ae->m_iSymbol = l;
m_oaAlphabet.push_back(ae);
if (bs->ReadBit()) { // Huffman
ht = new CBQBHuffmanTree(m_IF);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Reading Huffman table...\n");
bold = bs->GetReadPos();
ht->ImportTree(bs,chr);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Read %d bits from Huffman table.\n",bs->GetReadPos()-bold);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Tree root element has %lu children.\n",ht->m_pTree->m_oaChildren.size());
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Reading Huffman data (%ld symbols)...\n",((long)i)-1);
bold = bs->GetReadPos();
for (z=0;z<((long)i)-1;z++) {
ae = new CBQBAlphabetEntry();
ae->m_iFrequency = 0;
ae->m_iIndex = (int)m_oaAlphabet.size();
ae->m_iSymbol = m_oaAlphabet[m_oaAlphabet.size()-1]->m_iSymbol + ht->DecodeSymbol(bs);
m_oaAlphabet.push_back(ae);
}
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Read %d bits from Huffman data.\n",bs->GetReadPos()-bold);
delete ht;
} else { // Fallback Border Storage
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Fallback border storage.\n");
if (chr) {
bits = bs->ReadBitsInteger(4);
border = bs->ReadBitsInteger(3);
} else {
bits = bs->ReadBitsInteger(6);
border = bs->ReadBitsInteger(5);
}
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("%d bits maximum, %d bits border.\n",bits,border);
for (z=0;z<((long)i)-1;z++) {
if (bs->ReadBit())
ti = bs->ReadBitsInteger(bits);
else
ti = bs->ReadBitsInteger(border);
ae = new CBQBAlphabetEntry();
ae->m_iFrequency = 0;
ae->m_iIndex = (int)m_oaAlphabet.size();
ae->m_iSymbol = m_oaAlphabet[m_oaAlphabet.size()-1]->m_iSymbol + ti;
m_oaAlphabet.push_back(ae);
}
}
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Done.\n");
} else { // Not Huffman
bits = bs->ReadBitsInteger(6);
s = ((unsigned long)1)<<(bits-1);
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("%lu symbol types, %d bits per symbol type, s=%ld.\n",i,bits,s);
for (z=0;z<(long)i;z++) {
ae = new CBQBAlphabetEntry();
ae->m_iIndex = z;
m_oaAlphabet.push_back(ae);
ae->m_iSymbol = bs->ReadBitsInteger(bits) - s;
}
}
for (z=C_MIN_RESERVED;true;z++) {
ae = new CBQBAlphabetEntry();
ae->m_iSymbol = z;
ae->m_iFrequency = 0;
m_oaAlphabet.push_back(ae);
if (z == C_MAX_RESERVED)
break;
}
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("Importing alphabet done.\n");
}
int CBQBAlphabet::FindIndex(int symbol) const {
int z;
for (z=0;z<(int)m_oaAlphabet.size();z++)
if (m_oaAlphabet[z]->m_iSymbol == symbol)
return z;
return -1;
}
void CBQBAlphabet::RecalcFrequencies(const std::vector &ia) {
int z;
for (z=0;z<(int)m_oaAlphabet.size();z++)
m_oaAlphabet[z]->m_iFrequency = 0;
for (z=0;z<(int)ia.size();z++)
m_oaAlphabet[ia[z]]->m_iFrequency++;
std::sort(m_oaAlphabetSortFreq.begin(),m_oaAlphabetSortFreq.end(),SORT_Alphabet_Freq);
}
travis-src-190101/src/bqb_alphabet.h 0100777 0000000 0000000 00000004667 13412725651 014231 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
#ifndef BQB_ALPHABET_H
#define BQB_ALPHABET_H
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_tools.h"
#include
#include "bqb_bitset.h"
class CBQBInterface;
class CBQBAlphabetEntry {
public:
CBQBAlphabetEntry()
: m_iSymbol(0), m_iFrequency(0), m_iIndex(0) { }
int m_iSymbol;
int m_iFrequency;
int m_iIndex;
};
class CBQBAlphabet {
public:
CBQBAlphabet(CBQBInterface &i) : m_IF(i) {
}
~CBQBAlphabet() {
for (int z=0;z<(int)m_oaAlphabet.size();z++)
delete m_oaAlphabet[z];
}
void BuildAlphabet(const std::vector &inp);
void Export(CBQBBitSet *bs, bool huffman, bool chr) const;
void Import(CBQBBitSet *bs, bool chr);
int FindIndex(int symbol) const;
void RecalcFrequencies(const std::vector &ia);
std::vector m_oaAlphabet;
std::vector m_oaAlphabetSortFreq;
std::vector m_iaIndices;
private:
CBQBInterface &m_IF;
};
#endif
travis-src-190101/src/bqb_bitset.cpp 0100777 0000000 0000000 00000016375 13412725623 014274 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_bitset.h"
#include "bqb_crc.h"
#include "bqb_interface.h"
const char *GetRevisionInfo_bqb_bitset(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bqb_bitset() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
const char *g_sBQBKeyAlpha = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz+-";
std::string CBQBBitSet::ExportKey() {
std::string key;
CBQBCRC8 crc;
unsigned char c1, c2, c3;
int z, len;
len = GetLength();
//printf("Export: len=%d\n",len);
if (len > 1023) {
m_IF.eprintf("CBQBBitSet::ExportKey(): Error: Maximum key length is 1023 bits (Bitset is %d bits).\n",len);
abort();
}
c1 = len%64;
c2 = (len/64)%16;
for (z=0;z tia;
Clear();
if (s.length() < 4) {
m_IF.eprintf("CBQBBitSet::ImportKey(): Error: Key requires at least four characters (has only %lu).\n",s.length());
return false;
}
if (s[0] != '@') {
m_IF.eprintf("CBQBBitSet::ImportKey(): Error: Key required to start with \"@\" (found \"%c\").\n",s[0]);
return false;
}
tia.resize(s.length()-1);
for (z=1;z<(int)s.length();z++) {
p = strchr(g_sBQBKeyAlpha,s[z]);
if (p == NULL) {
m_IF.eprintf("CBQBBitSet::ImportKey(): Error: Found invalid character \"%c\" in key.\n",s[z]);
return false;
}
tia[z-1] = (unsigned char)(p - g_sBQBKeyAlpha);
}
len = tia[0] + (tia[1]%16)*64;
//printf("Import: len=%d\n",len);
if ((len+5)/6 < (int)s.length()-4)
m_IF.printf("CBQBBitSet::ImportKey(): Warning: Key contains %d extra characters at the end.\n",(int)s.length()-4-(len+5)/6);
if ((len+5)/6 > (int)s.length()-4) {
m_IF.eprintf("CBQBBitSet::ImportKey(): Error: Key is too short by %d characters.\n",(len+5)/6-(int)s.length()+4);
return false;
}
c = (tia[1]/16) + tia[2]*4;
for (z=0;z= pow2i(len%6)) {
m_IF.eprintf("CBQBBitSet::ImportKey(): Error: Last byte too large (%d, %d bits).\n",tia.back(),len%6);
return false;
}
WriteBits(tia.back(),len % 6);
}
for (z=0;z bits) {
m_IF.eprintf("CBitSet::WriteBits(): Error: %lu does not fit into %d bits.\n",i,bits);
abort();
}
for (int z=0;z bits-1) {
m_IF.eprintf("CBitSet::WriteSignedBits(): Error: %ld does not fit into %d bits.\n",i,bits);
abort();
}
for (int z=0;z= 0)
WriteBit(0);
else
WriteBit(1);
}
bool CBQBBitSet::ReadBit() {
bool b;
if (m_iReadPosBytes >= (int)m_iaData.size()) {
m_IF.eprintf("CBQBBitSet::ReadBit(): Error: End of BitSet reached.\n");
abort();
}
b = (m_iaData[m_iReadPosBytes] & (1<=0;z2--)
m_IF.printf("%d",(m_iaData[z]&(1<<(7-z2)))!=0?1:0);
for (z2=m_iExcessBits-1;z2>=0;z2--)
m_IF.printf("%d",(m_iaData[z]&(1<<(m_iExcessBits-z2-1)))!=0?1:0);
}
void CBQBBitSet::ExportToFile(FILE *a) const {
int z;
// unsigned char c;
for (z=0;z<(int)m_iaData.size()/4096;z++)
fwrite(&m_iaData[z*4096],4096,1,a);
if ((m_iaData.size()%4096) != 0)
fwrite(&m_iaData[z*4096],m_iaData.size()%4096,1,a);
/* for (z=0;z<(int)m_iaData.size();z++) {
c = m_iaData[z];
fwrite(&c,1,1,a);
}*/
}
bool CBQBBitSet::ImportFromFile(FILE *a, int bytes) {
int z;
// unsigned char c;
m_iaData.resize(bytes);
// m_iaData.clear();
m_iExcessBits = 0;
m_iReadPosBytes = 0;
m_iReadPosExcess = 0;
for (z=0;z.
***********************************************************************************/
#ifndef BQB_BITSET_H
#define BQB_BITSET_H
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_tools.h"
#include
class CBQBInterface;
class CBQBBitSet {
public:
CBQBBitSet(CBQBInterface &i)
: m_iExcessBits(0), m_iReadPosBytes(0), m_iReadPosExcess(0), m_IF(i) {
}
CBQBBitSet(const CBQBBitSet &set)
: m_iExcessBits(set.m_iExcessBits), m_iReadPosBytes(set.m_iReadPosBytes),
m_iReadPosExcess(set.m_iReadPosExcess), m_IF(set.m_IF) {
m_iaData.assign(set.m_iaData.begin(),set.m_iaData.end());
}
explicit CBQBBitSet(CBQBBitSet *set)
: m_iExcessBits(set->m_iExcessBits), m_IF(set->m_IF) {
m_iaData.assign(set->m_iaData.begin(),set->m_iaData.end());
}
CBQBBitSet& operator=(const CBQBBitSet &rhs) {
m_iExcessBits = rhs.m_iExcessBits;
m_iReadPosBytes = rhs.m_iReadPosBytes;
m_iReadPosExcess = rhs.m_iReadPosExcess;
m_iaData.assign(rhs.m_iaData.begin(),rhs.m_iaData.end());
return *this;
}
int GetLength() const {
if (m_iExcessBits == 0)
return (int)(8*m_iaData.size());
else
return (int)(8*(m_iaData.size()-1) + m_iExcessBits);
}
int GetByteLength() const {
return (int)m_iaData.size();
}
void ResetReadPos() {
m_iReadPosBytes = 0;
m_iReadPosExcess = 0;
}
void Dump() const;
void DumpPlain() const;
void ExportToFile(FILE *a) const;
bool ImportFromFile(FILE *a, int bytes);
std::string ExportKey();
bool ImportKey(std::string s);
void Clear() {
m_iExcessBits = 0;
m_iReadPosBytes = 0;
m_iReadPosExcess = 0;
m_iaData.clear();
}
void WriteBit(unsigned char i) {
if (m_iExcessBits == 0)
m_iaData.push_back(i);
else
m_iaData[m_iaData.size()-1] |= i<(&f);
for (z=0;z<4;z++)
WriteBits(uc[z],8);
}
void WriteBitsDouble(double f) {
unsigned char *uc;
int z;
uc = reinterpret_cast(&f);
for (z=0;z<8;z++)
WriteBits(uc[z],8);
}
float ReadBitsFloat() {
unsigned char uc[4];
char *p;
int z;
for (z=0;z<4;z++)
uc[z] = (unsigned char)ReadBitsInteger(8);
p = (char*)uc; // This is to comply with strict-aliasing rules (char* may alias to anything)
return *reinterpret_cast(p);
}
double ReadBitsDouble() {
unsigned char uc[8];
int z;
char *p;
for (z=0;z<8;z++)
uc[z] = (unsigned char)ReadBitsInteger(8);
p = (char*)uc; // This is to comply with strict-aliasing rules (char* may alias to anything)
return *reinterpret_cast(p);
}
void WriteBits(CBQBBitSet *set) {
int z, z2;
if (set->m_iExcessBits == 0) {
for (z=0;z<(int)set->m_iaData.size();z++)
for (z2=0;z2<8;z2++)
WriteBit((set->m_iaData[z]&(((unsigned long)1)<m_iaData.size()-1;z++)
for (z2=0;z2<8;z2++)
WriteBit((set->m_iaData[z]&(((unsigned long)1)<m_iExcessBits;z2++)
WriteBit((set->m_iaData[set->m_iaData.size()-1]&(((unsigned long)1)< m_iaData;
int m_iExcessBits;
int m_iReadPosBytes;
int m_iReadPosExcess;
private:
CBQBInterface &m_IF;
};
#endif
travis-src-190101/src/bqb_config.h 0100777 0000000 0000000 00000011314 13412725654 013704 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
// This file is always included before any other include file.
#ifndef BQB_CONFIG_H
#define BQB_CONFIG_H
// Build this library together with TRAVIS?
#define BQB_INSIDE_TRAVIS
// Options for stand-alone build
#ifndef BQB_INSIDE_TRAVIS
// Last change to this version of the source code
#define BQB_SOURCE_VERSION "Jan 01 2019"
// Use faster hard-coded string to floating point conversion (atof).
// This speeds up reading CUBE files by a factor of > 2, and also other file formats.
// Seems to give identical results to system atof(), but comment out if problems occur.
#define BQB_FAST_ATOF
#define _FILE_OFFSET_BITS 64
#ifdef _MSC_VER
#pragma warning(disable:4786) // Warning "Debug Info truncated to 255 characters"
#pragma warning(disable:4702) // Warning "Unreachable Code"
#define _CRT_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_DEPRECATE
#endif
// Revision Information
#include
#define GET_REVISION_INFO(X,LEN) { if (LEN == 0) sprintf( X, "%s", "\"" __FILE__ "\"" ); else sprintf( X, "File %-*s compiled at %s %s, source version %s.", LEN, "\"" __FILE__ "\"", __DATE__, __TIME__, BQB_SOURCE_VERSION ); }
#define GET_SOURCE_VERSION(X) sprintf( X, "%s", BQB_SOURCE_VERSION )
#else // BQB_INSIDE_TRAVIS
// Include the TRAVIS main config file
#include "config.h"
#define BQB_SOURCE_VERSION SOURCE_VERSION
#ifdef FAST_ATOF
#define BQB_FAST_ATOF
#endif
#endif
const char *GetRevisionInfo_bqb_alphabet(unsigned int len);
const char *GetSourceVersion_bqb_alphabet();
const char *GetRevisionInfo_bqb_bitset(unsigned int len);
const char *GetSourceVersion_bqb_bitset();
const char *GetRevisionInfo_bqb_crc(unsigned int len);
const char *GetSourceVersion_bqb_crc();
const char *GetRevisionInfo_bqb_cubeframe(unsigned int len);
const char *GetSourceVersion_bqb_cubeframe();
const char *GetRevisionInfo_bqb_driver(unsigned int len);
const char *GetSourceVersion_bqb_driver();
const char *GetRevisionInfo_bqb_engine(unsigned int len);
const char *GetSourceVersion_bqb_engine();
const char *GetRevisionInfo_bqb_extrapolator(unsigned int len);
const char *GetSourceVersion_bqb_extrapolator();
const char *GetRevisionInfo_bqb_format(unsigned int len);
const char *GetSourceVersion_bqb_format();
const char *GetRevisionInfo_bqb_hilbert(unsigned int len);
const char *GetSourceVersion_bqb_hilbert();
const char *GetRevisionInfo_bqb_hufftree(unsigned int len);
const char *GetSourceVersion_bqb_hufftree();
const char *GetRevisionInfo_bqb_integerengine(unsigned int len);
const char *GetSourceVersion_bqb_integerengine();
const char *GetRevisionInfo_bqb_interface(unsigned int len);
const char *GetSourceVersion_bqb_interface();
const char *GetRevisionInfo_bqb_largeinteger(unsigned int len);
const char *GetSourceVersion_bqb_largeinteger();
const char *GetRevisionInfo_bqb_linalg(unsigned int len);
const char *GetSourceVersion_bqb_linalg();
const char *GetRevisionInfo_bqb_math(unsigned int len);
const char *GetSourceVersion_bqb_math();
const char *GetRevisionInfo_bqb_parmset(unsigned int len);
const char *GetSourceVersion_bqb_parmset();
const char *GetRevisionInfo_bqb_tools(unsigned int len);
const char *GetSourceVersion_bqb_tools();
const char *GetRevisionInfo_bqbtool(unsigned int len);
const char *GetSourceVersion_bqbtool();
#endif
travis-src-190101/src/bqb_crc.cpp 0100777 0000000 0000000 00000010551 13412725621 013535 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_crc.h"
const char *GetRevisionInfo_bqb_crc(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bqb_crc() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
/* This code is adapted from http://www.rajivchakravorty.com/source-code/uncertainty/multimedia-sim/html/crc8_8c-source.html */
CBQBCRC8::CBQBCRC8() {
#define CRC8_DI 0x2F /* x^8 + x^5 + x^3 + x^2 + x + 1 */
int i, j;
unsigned char crc;
for (i=0; i<256; i++) {
crc = (unsigned char)i;
for (j=0; j<8; j++)
crc = (crc << 1) ^ ((crc & 0x80) ? CRC8_DI : 0);
m_iTable[i] = crc & 0xFF;
/* printf("table[%d] = %d (0x%X)\n", i, crc, crc); */
}
Reset();
}
/* This code is adapted from http://www.networkdls.com/Software/View/CRC32 */
CBQBCRC32::CBQBCRC32() {
//0x04C11DB7 is the official polynomial used by PKZip, WinZip and Ethernet.
unsigned int iPolynomial = 0x04C11DB7;
memset(&this->iTable, 0, sizeof(this->iTable));
// 256 values representing ASCII character codes.
for(int iCodes = 0; iCodes <= 0xFF; iCodes++) {
this->iTable[iCodes] = this->Reflect(iCodes, 8) << 24;
for(int iPos = 0; iPos < 8; iPos++) {
this->iTable[iCodes] = (this->iTable[iCodes] << 1)
^ ((this->iTable[iCodes] & (1 << 31)) ? iPolynomial : 0);
}
this->iTable[iCodes] = this->Reflect(this->iTable[iCodes], 32);
}
}
unsigned int CBQBCRC32::Reflect(unsigned int iReflect, const char cChar) const {
unsigned int iValue = 0;
// Swap bit 0 for bit 7, bit 1 for bit 6, etc....
for (int iPos = 1; iPos < (cChar + 1); iPos++) {
if (iReflect & 1)
iValue |= (1 << (cChar - iPos));
iReflect >>= 1;
}
return iValue;
}
unsigned int CBQBCRC32::ComputeCRC32(const std::vector &data, int from, int to) const {
unsigned int crc;
int z;
crc = 0xffffffff; // Initialize the CRC.
if (to == -1)
to = (int)data.size()-1;
for (z=from;z<=to;z++)
crc = (crc >> 8) ^ this->iTable[(crc & 0xFF) ^ data[z]];
crc ^= 0xffffffff; // Finalize the CRC.
return crc;
}
unsigned int CBQBCRC32::ComputeCRC32_Begin(const std::vector &data, int from, int to) const {
unsigned int crc;
int z;
crc = 0xffffffff; // Initialize the CRC.
if (to == -1)
to = (int)data.size()-1;
for (z=from;z<=to;z++)
crc = (crc >> 8) ^ this->iTable[(crc & 0xFF) ^ data[z]];
return crc;
}
unsigned int CBQBCRC32::ComputeCRC32_Continue(const std::vector &data, unsigned int last, int from, int to) const {
unsigned int crc;
int z;
crc = last; // Initialize the CRC.
if (to == -1)
to = (int)data.size()-1;
for (z=from;z<=to;z++)
crc = (crc >> 8) ^ this->iTable[(crc & 0xFF) ^ data[z]];
return crc;
}
unsigned int CBQBCRC32::ComputeCRC32_Finish(unsigned int last) const {
return last ^ 0xffffffff; // Finalize the CRC.
}
travis-src-190101/src/bqb_crc.h 0100777 0000000 0000000 00000005523 13412725660 013210 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
#ifndef BQB_CRC32_H
#define BQB_CRC32_H
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_tools.h"
#include
#include
/* This code is adapted from http://www.rajivchakravorty.com/source-code/uncertainty/multimedia-sim/html/crc8_8c-source.html */
class CBQBCRC8 {
public:
CBQBCRC8();
void Reset() {
m_iCRC8 = 0xFF;
}
void Finalize() {
m_iCRC8 ^= 0xFF;
}
void PushByte(unsigned char m) {
// For a byte array whose accumulated crc value is stored in *crc, computes
// resultant crc obtained by appending m to the byte array
m_iCRC8 = m_iTable[m_iCRC8 ^ m];
m_iCRC8 &= 0xFF;
}
unsigned char m_iCRC8;
unsigned char m_iTable[256];
};
/* This code is adapted from http://www.networkdls.com/Software/View/CRC32 */
class CBQBCRC32 {
public:
CBQBCRC32();
unsigned int ComputeCRC32(const std::vector &data, int from=0, int to=-1) const;
unsigned int ComputeCRC32_Begin(const std::vector &data, int from=0, int to=-1) const;
unsigned int ComputeCRC32_Continue(const std::vector &data, unsigned int last, int from=0, int to=-1) const;
unsigned int ComputeCRC32_Finish(unsigned int last) const;
private:
unsigned int Reflect(unsigned int iReflect, const char cChar) const;
unsigned int iTable[256]; // CRC lookup table array.
};
#endif
travis-src-190101/src/bqb_cubeframe.cpp 0100777 0000000 0000000 00000042566 13412725633 014735 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_tools.h"
#include
#include "bqb_cubeframe.h"
#include "bqb_fastatof.h"
#include "bqb_interface.h"
const char *GetRevisionInfo_bqb_cubeframe(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bqb_cubeframe() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
bool CBQBCubeFrame::ReadFrame(FILE *a, int eps, int csigni, int asigni, bool verbose) {
int ac, z, z2, i, trunc;
char buf[256], buf2[256], *p, *q;
double tf, mi, ma;
CBQBAtom *ta;
m_iEps = eps;
m_iSigni = csigni;
if (m_pAtoms != NULL)
delete m_pAtoms;
m_pAtoms = new CBQBAtomSet();
m_pAtoms->m_iSigni = asigni;
m_pAtoms->m_bOrd = true;
if (feof(a))
return false;
(void)fgets(buf,256,a);
if (feof(a))
return false;
buf[strlen(buf)-1] = 0;
(void)fgets(buf2,256,a);
if (feof(a))
return false;
buf2[strlen(buf2)-1] = 0;
m_pAtoms->m_sComment = new char[strlen(buf)+strlen(buf2)+2];
strcpy(m_pAtoms->m_sComment,buf);
strcat(m_pAtoms->m_sComment,"\n");
strcat(m_pAtoms->m_sComment,buf2);
(void)fgets(buf,256,a);
if (feof(a))
return false;
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
ac = atoi(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fCenter[0] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fCenter[1] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while ((*q != ' ') && (*q != 0))
q++;
*q = 0;
m_fCenter[2] = atof(p);
(void)fgets(buf,256,a);
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_iRes[0] = atoi(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStrideA[0] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStrideA[1] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while ((*q != ' ') && (*q != 0))
q++;
*q = 0;
m_fStrideA[2] = atof(p);
(void)fgets(buf,256,a);
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_iRes[1] = atoi(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStrideB[0] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStrideB[1] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while ((*q != ' ') && (*q != 0))
q++;
*q = 0;
m_fStrideB[2] = atof(p);
(void)fgets(buf,256,a);
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_iRes[2] = atoi(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStrideC[0] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStrideC[1] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while ((*q != ' ') && (*q != 0))
q++;
*q = 0;
m_fStrideC[2] = atof(p);
for (z=0;z<3;z++) {
if (fabs(m_fStrideA[z]) > 2000.0) {
m_IF.printf("CBQBCubeFrame::ReadFrame(): Error: m_fStrideA[%d] > 2000 a.u. (is %f a.u.).\n",z,m_fStrideA[z]);
return false;
}
if (fabs(m_fStrideB[z]) > 2000.0) {
m_IF.printf("CBQBCubeFrame::ReadFrame(): Error: m_fStrideB[%d] > 2000 a.u. (is %f a.u.).\n",z,m_fStrideB[z]);
return false;
}
if (fabs(m_fStrideC[z]) > 2000.0) {
m_IF.printf("CBQBCubeFrame::ReadFrame(): Error: m_fStrideC[%d] > 2000 a.u. (is %f a.u.).\n",z,m_fStrideC[z]);
return false;
}
if (fabs(m_fCenter[z]) > 2000.0) {
m_IF.printf("CBQBCubeFrame::ReadFrame(): Error: m_fCenter[%d] > 2000 a.u. (is %f a.u.).\n",z,m_fCenter[z]);
return false;
}
m_iStrideA[z] = FloatToFixed(m_fStrideA[z],6);
m_iStrideB[z] = FloatToFixed(m_fStrideB[z],6);
m_iStrideC[z] = FloatToFixed(m_fStrideC[z],6);
m_iCenter[z] = FloatToFixed(m_fCenter[z],6);
}
for (z=0;zm_oaAtoms.push_back(ta);
(void)fgets(buf,256,a);
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
ta->m_iOrd = atoi(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
ta->m_fCoord[0] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
ta->m_fCoord[1] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while ((*q != ' ') && (*q != 0))
q++;
*q = 0;
ta->m_fCoord[2] = atof(p);
for (z2=0;z2<3;z2++) {
if (fabs(ta->m_fCoord[z2]) > 2000.0) {
m_IF.printf("CBQBCubeFrame::ReadFrame(): Error: m_oaAtoms[%d][%d] > 2000 a.u. (is %f a.u.).\n",z,z2,ta->m_fCoord[z2]);
return false;
}
m_pAtoms->m_faCOM[z2] += ta->m_fCoord[z2];
ta->m_iCoord[z2] = FloatToFixed(ta->m_fCoord[z2],asigni);
// ta->m_fCoord[z2] = FixedToFloat(ta->m_iCoord[z2],asigni);
// ta->m_fCoord[z2] *= 0.52917721;
}
// m_IF.printf("%d %f %f %f\n",ta->m_iOrd,ta->m_fCoord[0],ta->m_fCoord[1],ta->m_fCoord[2]);
}
for (z2=0;z2<3;z2++) {
m_pAtoms->m_faCOM[z2] /= m_pAtoms->m_oaAtoms.size();
m_pAtoms->m_iaCOM[z2] = FloatToFixed(m_pAtoms->m_faCOM[z2],asigni);
m_pAtoms->m_faCOM[z2] = FixedToFloat(m_pAtoms->m_iaCOM[z2],asigni);
}
for (z=0;z<(int)m_pAtoms->m_oaAtoms.size();z++) {
for (z2=0;z2<3;z2++) {
//m_pAtoms->m_oaAtoms[z]->m_fRelCoord[z2] = m_pAtoms->m_oaAtoms[z]->m_fCoord[z2] - m_pAtoms->m_faCOM[z2];
//m_pAtoms->m_oaAtoms[z]->m_iRelCoord[z2] = FloatToFixed(m_pAtoms->m_oaAtoms[z]->m_fRelCoord[z2],asigni);
m_pAtoms->m_oaAtoms[z]->m_iRelCoord[z2] = m_pAtoms->m_oaAtoms[z]->m_iCoord[z2] - m_pAtoms->m_iaCOM[z2];
m_pAtoms->m_oaAtoms[z]->m_fRelCoord[z2] = FixedToFloat(m_pAtoms->m_oaAtoms[z]->m_iRelCoord[z2],asigni);
}
}
if (feof(a)) {
m_IF.printf("Error: Unexpected end of cube file.\n");
return false;
}
/* for (z=0;z<3;z++) {
m_fCenter[z] *= 0.52917721;
m_fStride[z] *= 0.52917721;
}*/
m_iResXY = m_iRes[0] * m_iRes[1];
m_iResYZ = m_iRes[1] * m_iRes[2];
m_iResXYZ = m_iRes[0] * m_iRes[1] * m_iRes[2];
m_fMinVal[0] = m_fCenter[0];
m_fMaxVal[0] = m_fCenter[0] + m_fStrideA[0] * m_iRes[0];
m_fMinVal[1] = m_fCenter[1];
m_fMaxVal[1] = m_fCenter[1] + m_fStrideB[1] * m_iRes[1];
m_fMinVal[2] = m_fCenter[2];
m_fMaxVal[2] = m_fCenter[2] + m_fStrideC[2] * m_iRes[2];
if (verbose) {
m_IF.printf("Res: %d %d %d\n",m_iRes[0],m_iRes[1],m_iRes[2]);
m_IF.printf("Center: %f %f %f a.u.\n",m_fCenter[0],m_fCenter[1],m_fCenter[2]);
m_IF.printf("Stride A: %f %f %f a.u.\n",m_fStrideA[0],m_fStrideA[1],m_fStrideA[2]);
m_IF.printf("Stride B: %f %f %f a.u.\n",m_fStrideB[0],m_fStrideB[1],m_fStrideB[2]);
m_IF.printf("Stride C: %f %f %f a.u.\n",m_fStrideC[0],m_fStrideC[1],m_fStrideC[2]);
m_IF.printf("Range: X %f - %f, Y %f - %f, Z %f - %f a.u.\n",m_fMinVal[0],m_fMaxVal[0],m_fMinVal[1],m_fMaxVal[1],m_fMinVal[2],m_fMaxVal[2]);
m_IF.printf("\n");
m_IF.printf(" Reading cube file (resolution %d x %d x %d, %d atoms)...\n",m_iRes[0],m_iRes[1],m_iRes[2],ac);
m_IF.printf(" [");
}
m_faBin.resize(m_iResXYZ);
m_iaExpo.resize(m_iResXYZ);
m_iaMantis.resize(m_iResXYZ);
i = 0;
mi = 1.0e30f;
ma = -1.0e30f;
trunc = 0;
while (!feof(a))
{
_read:
(void)fgets(buf,256,a);
if (feof(a))
break;
p = buf;
_next:
while (*p == ' ')
p++;
q = p;
while ((*p != ' ') && (*p != '\n') && (*p != 0))
p++;
if ((p-q) < 8)
goto _read;
*p = 0;
#ifdef BQB_FAST_ATOF
tf = bqb_fast_atof(q);
#else
tf = atof(q);
#endif
if (tf < mi)
mi = tf;
if (tf > ma)
ma = tf;
m_faBin[i] = tf;
m_iaExpo[i] = (char)((int)floor(log10(fabs(tf)))-csigni+1);
if (m_iaExpo[i] < -eps) {
m_iaExpo[i] = (char)-eps;
trunc++;
// m_IF.printf("%s --> %15.10G --> %6d E %2d\n",q,tf,(int)(tf*pow(10,-m_pExpo[i])+0.5),m_pExpo[i]);
}
m_iaMantis[i] = (int)floor(tf*pow10(-m_iaExpo[i])+0.5);
// MB Hack 26.01.2018
m_faBin[i] = (double)m_iaMantis[i] * pow10(m_iaExpo[i]);
i++;
if (verbose) {
if (fmod(i,m_iResXYZ/60.0) < 1.0) {
m_IF.printf("#");
fflush(stdout);
}
}
if (i == m_iResXYZ)
break;
p++;
goto _next;
}
if (feof(a)) {
m_IF.printf("Error: Unexpected end of cube file stream.\n");
return false;
}
if (verbose) {
m_IF.printf("]\n");
m_IF.printf(" %d values truncated due to EPS.\n",trunc);
m_IF.printf(" Value range: %10.6G ... %10.6G\n\n",mi,ma);
}
return true;
}
bool CBQBCubeFrame::SkipFrame(FILE *a, bool verbose) const {
UNUSED(verbose);
int ac, z, i, resx, resy, resz;
char buf[256], *p, *q;
if (feof(a))
return false;
(void)fgets(buf,256,a);
if (feof(a))
return false;
(void)fgets(buf,256,a);
if (feof(a))
return false;
(void)fgets(buf,256,a);
if (feof(a))
return false;
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
ac = atoi(p);
/* p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fCenter[0] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fCenter[1] = atof(p);
p = q+1;
while (*p == ' ')
p++;
q = p;
while ((*q != ' ') && (*q != 0))
q++;
*q = 0;
m_fCenter[2] = atof(p);*/
(void)fgets(buf,256,a);
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
resx = atoi(p);
/* p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStride[0] = atof(p);*/
(void)fgets(buf,256,a);
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
resy = atoi(p);
/* p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
m_fStride[1] = atof(p);*/
(void)fgets(buf,256,a);
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
resz = atoi(p);
/* p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
p = q+1;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
p = q+1;
while (*p == ' ')
p++;
q = p;
while ((*q != ' ') && (*q != 0))
q++;
*q = 0;
m_fStride[2] = atof(p);*/
/* fgets(buf,256,a);
if (feof(a))
return false;
p = buf;
while (*p == ' ')
p++;
q = p;
while (*q != ' ')
q++;
*q = 0;
ac = atoi(p);
fgets(buf,256,a);
fgets(buf,256,a);
fgets(buf,256,a);*/
for (z=0;zm_sComment != NULL)
fprintf(a,"%s\n",m_pAtoms->m_sComment);
else
fprintf(a,"(Comment 1)\n(Comment 2)\n");
fprintf(a,"%5lu %11.6f %11.6f %11.6f\n",(unsigned long)m_pAtoms->m_oaAtoms.size(),m_fCenter[0],m_fCenter[1],m_fCenter[2]);
fprintf(a,"%5d %11.6f %11.6f %11.6f\n",m_iRes[0],m_fStrideA[0],m_fStrideA[1],m_fStrideA[2]);
fprintf(a,"%5d %11.6f %11.6f %11.6f\n",m_iRes[1],m_fStrideB[0],m_fStrideB[1],m_fStrideB[2]);
fprintf(a,"%5d %11.6f %11.6f %11.6f\n",m_iRes[2],m_fStrideC[0],m_fStrideC[1],m_fStrideC[2]);
for (z=0;z<(int)m_pAtoms->m_oaAtoms.size();z++)
fprintf(a,"%5d %11.6f %11.6f %11.6f %11.6f\n",m_pAtoms->m_oaAtoms[z]->m_iOrd,0.0,m_pAtoms->m_oaAtoms[z]->m_fCoord[0],m_pAtoms->m_oaAtoms[z]->m_fCoord[1],m_pAtoms->m_oaAtoms[z]->m_fCoord[2]);
i = 0;
for (ix=0;ixm_sComment != NULL)
fprintf(a,"%s\n",m_pAtoms->m_sComment);
else
fprintf(a,"(Comment 1)\n(Comment 2)\n");
fprintf(a,"%5lu %11.6f %11.6f %11.6f\n",(unsigned long)m_pAtoms->m_oaAtoms.size(),m_fCenter[0],m_fCenter[1],m_fCenter[2]);
fprintf(a,"%5d %11.6f %11.6f %11.6f\n",m_iRes[0],m_fStrideA[0],m_fStrideA[1],m_fStrideA[2]);
fprintf(a,"%5d %11.6f %11.6f %11.6f\n",m_iRes[1],m_fStrideB[0],m_fStrideB[1],m_fStrideB[2]);
fprintf(a,"%5d %11.6f %11.6f %11.6f\n",m_iRes[2],m_fStrideC[0],m_fStrideC[1],m_fStrideC[2]);
for (z=0;z<(int)m_pAtoms->m_oaAtoms.size();z++)
fprintf(a,"%5d %11.6f %11.6f %11.6f %11.6f\n",m_pAtoms->m_oaAtoms[z]->m_iOrd,0.0,m_pAtoms->m_oaAtoms[z]->m_fCoord[0],m_pAtoms->m_oaAtoms[z]->m_fCoord[1],m_pAtoms->m_oaAtoms[z]->m_fCoord[2]);
i = 0;
for (ix=0;ixm_sLabel.c_str(),l,signi,m_oaAtoms[z]->m_fCoord[0],l,signi,m_oaAtoms[z]->m_fCoord[1],l,signi,m_oaAtoms[z]->m_fCoord[2]);
}
bool CBQBAtomSet::ReadXYZ(FILE *a, int signi, FILE *ref) {
char buf[256], *p, *q;
int i, z, z2;
CBQBAtom *at;
m_iSigni = signi;
m_bLabels = true;
for (z=0;z<(int)m_oaAtoms.size();z++)
delete m_oaAtoms[z];
m_oaAtoms.clear();
(void)fgets(buf,256,a);
buf[strlen(buf)-1] = 0;
i = atoi(buf);
if (feof(a))
return false;
(void)fgets(buf,256,a);
buf[strlen(buf)-1] = 0;
m_sComment = new char[strlen(buf)+1];
strcpy(m_sComment,buf);
for (z=0;z<3;z++)
m_faCOM[z] = 0;
for (z=0;zm_sLabel = p;
at->m_iOrd = GetAtomOrd(p);
p = q+1;
while (*p == ' ')
p++;
q = strchr(p,' ');
*q = 0;
//at->m_fCoord[0] = atof(p);
#ifdef BQB_FAST_ATOF
at->m_fCoord[0] = bqb_fast_atof(p);
#else
at->m_fCoord[0] = atof(p);
#endif
p = q+1;
while (*p == ' ')
p++;
q = strchr(p,' ');
*q = 0;
//at->m_fCoord[1] = atof(p);
#ifdef BQB_FAST_ATOF
at->m_fCoord[1] = bqb_fast_atof(p);
#else
at->m_fCoord[1] = atof(p);
#endif
p = q+1;
while (*p == ' ')
p++;
//at->m_fCoord[2] = atof(p);
#ifdef BQB_FAST_ATOF
at->m_fCoord[2] = bqb_fast_atof(p);
#else
at->m_fCoord[2] = atof(p);
#endif
for (z2=0;z2<3;z2++) {
at->m_iCoord[z2] = FloatToFixed(at->m_fCoord[z2],signi);
at->m_fCoord[z2] = FixedToFloat(at->m_iCoord[z2],signi);
m_faCOM[z2] += at->m_fCoord[z2];
}
}
for (z=0;z<3;z++) {
m_faCOM[z] /= m_oaAtoms.size();
m_iaCOM[z] = FloatToFixed(m_faCOM[z],signi);
m_faCOM[z] = FixedToFloat(m_iaCOM[z],signi);
}
for (z=0;z<(int)m_oaAtoms.size();z++) {
for (z2=0;z2<3;z2++) {
//m_oaAtoms[z]->m_fRelCoord[z2] = m_oaAtoms[z]->m_fCoord[z2] - m_faCOM[z2];
//m_oaAtoms[z]->m_iRelCoord[z2] = FloatToFixed(m_oaAtoms[z]->m_fRelCoord[z2],signi);
m_oaAtoms[z]->m_iRelCoord[z2] = m_oaAtoms[z]->m_iCoord[z2] - m_iaCOM[z2];
m_oaAtoms[z]->m_fRelCoord[z2] = FixedToFloat(m_oaAtoms[z]->m_iRelCoord[z2],signi);
}
}
if (ref != NULL)
WriteXYZ(ref,signi);
return true;
}
bool CBQBAtomSet::SkipXYZ(FILE *a) {
char buf[256];
int i, z;
(void)fgets(buf,256,a);
buf[strlen(buf)-1] = 0;
i = atoi(buf);
(void)fgets(buf,256,a);
if (feof(a))
return false;
for (z=0;z.
***********************************************************************************/
#ifndef BQB_CUBEFRAME_H
#define BQB_CUBEFRAME_H
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_tools.h"
#include
#include
#include
class CBQBInterface;
class CBQBAtom {
public:
CBQBAtom()
: m_iOrd(0) { }
int m_iOrd;
std::string m_sLabel;
double m_fCoord[3];
double m_fRelCoord[3];
long m_iCoord[3];
long m_iRelCoord[3];
};
class CBQBAtomSet {
public:
CBQBAtomSet()
: m_bOrd(false), m_bLabels(false), m_sComment(NULL) {
for (int z=0;z<3;z++) {
m_faCOM[z] = 0;
m_iaCOM[z] = 0;
}
}
~CBQBAtomSet() {
for (int z=0;z<(int)m_oaAtoms.size();z++)
delete m_oaAtoms[z];
if (m_sComment != NULL)
delete[] m_sComment;
}
bool ReadXYZ(FILE *a, int signi, FILE *ref);
void WriteXYZ(FILE *a, int signi);
bool SkipXYZ(FILE *a);
bool m_bOrd;
bool m_bLabels;
int m_iSigni;
double m_faCOM[3];
int m_iaCOM[3];
std::vector m_oaAtoms;
char *m_sComment;
};
class CBQBCubeFrame {
public:
CBQBCubeFrame(CBQBInterface &i)
: m_iResXY(0), m_iResYZ(0), m_iResXYZ(0), m_pAtoms(NULL), m_IF(i) {
for (int z=0;z<3;z++) {
m_iRes[z] = 0;
m_fMinVal[z] = 0;
m_fMaxVal[z] = 0;
m_fCenter[z] = 0;
m_fStrideA[z] = 0;
m_fStrideB[z] = 0;
m_fStrideC[z] = 0;
m_iCenter[z] = 0;
m_iStrideA[z] = 0;
m_iStrideB[z] = 0;
m_iStrideC[z] = 0;
}
}
~CBQBCubeFrame() {
// if (m_pAtoms != NULL)
// delete m_pAtoms;
}
void CopyHeader(const CBQBCubeFrame *p) {
m_iRes[0] = p->m_iRes[0];
m_iRes[1] = p->m_iRes[1];
m_iRes[2] = p->m_iRes[2];
m_fStrideA[0] = p->m_fStrideA[0];
m_fStrideA[1] = p->m_fStrideA[1];
m_fStrideA[2] = p->m_fStrideA[2];
m_iStrideA[0] = p->m_iStrideA[0];
m_iStrideA[1] = p->m_iStrideA[1];
m_iStrideA[2] = p->m_iStrideA[2];
m_fStrideB[0] = p->m_fStrideB[0];
m_fStrideB[1] = p->m_fStrideB[1];
m_fStrideB[2] = p->m_fStrideB[2];
m_iStrideB[0] = p->m_iStrideB[0];
m_iStrideB[1] = p->m_iStrideB[1];
m_iStrideB[2] = p->m_iStrideB[2];
m_fStrideC[0] = p->m_fStrideC[0];
m_fStrideC[1] = p->m_fStrideC[1];
m_fStrideC[2] = p->m_fStrideC[2];
m_iStrideC[0] = p->m_iStrideC[0];
m_iStrideC[1] = p->m_iStrideC[1];
m_iStrideC[2] = p->m_iStrideC[2];
m_fCenter[0] = p->m_fCenter[0];
m_fCenter[1] = p->m_fCenter[1];
m_fCenter[2] = p->m_fCenter[2];
m_iCenter[0] = p->m_iCenter[0];
m_iCenter[1] = p->m_iCenter[1];
m_iCenter[2] = p->m_iCenter[2];
m_iResXY = m_iRes[0] * m_iRes[1];
m_iResYZ = m_iRes[1] * m_iRes[2];
m_iResXYZ = m_iRes[0] * m_iRes[1] * m_iRes[2];
m_faBin.resize(m_iResXYZ);
m_iaExpo.resize(m_iResXYZ);
m_iaMantis.resize(m_iResXYZ);
}
bool ReadFrame(FILE *a, int eps, int csigni, int asigni, bool verbose=false);
bool SkipFrame(FILE *a, bool verbose=false) const;
void WriteFrame(FILE *a, bool verbose=false);
void WriteFrame_Double(FILE *a, bool verbose=false);
int m_iEps;
int m_iSigni;
std::vector m_faBin;
std::vector m_iaMantis;
std::vector m_iaExpo;
int m_iRes[3];
int m_iResXY;
int m_iResYZ;
int m_iResXYZ;
double m_fMinVal[3];
double m_fMaxVal[3];
double m_fCenter[3];
double m_fStrideA[3];
double m_fStrideB[3];
double m_fStrideC[3];
long m_iCenter[3];
long m_iStrideA[3];
long m_iStrideB[3];
long m_iStrideC[3];
CBQBAtomSet *m_pAtoms;
private:
CBQBInterface &m_IF;
};
#endif
travis-src-190101/src/bqb_driver.cpp 0100777 0000000 0000000 00000333116 13412725627 014274 0 ustar 00 /***********************************************************************************
LibBQB - File Format and Compression Algorithms for Trajectories of
Volumetric Data and Atom Positions
https://brehm-research.de/bqb
Free software, licensed under GNU LGPL v3
Copyright (c) Martin Brehm and Martin Thomas,
Martin Luther University Halle-Wittenberg, Germany,
2016 - 2019.
Please cite: M. Brehm, M. Thomas: "An Efficient Lossless Compression Algorithm
for Trajectories of Atom Positions and Volumetric Data",
J. Chem. Inf. Model. 2018, 58 (10), pp 2092-2107.
--------------------------------------------------------------------------------
LibBQB is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see .
***********************************************************************************/
// This must always be the first include directive
#include "bqb_config.h"
#include "bqb_driver.h"
#include "bqb_format.h"
#include "bqb_integerengine.h"
#include "bqb_bitset.h"
#include
#include
const char *GetRevisionInfo_bqb_driver(unsigned int len) {
static char buf[256];
GET_REVISION_INFO( buf, len );
return buf;
}
const char *GetSourceVersion_bqb_driver() {
static char buf[256];
GET_SOURCE_VERSION( buf );
return buf;
}
CBQBDriver::CBQBDriver(CBQBInterface &i) :
m_ParmPosAndVol(i),
m_ParmPos(i),
m_iHistogramCounter(0),
m_iOptIncludeFirst(-1),
m_IF(i)
{
m_pEngine = new CBQBEngine(m_IF);
}
CBQBDriver::~CBQBDriver() {
if (m_pEngine != NULL) {
delete m_pEngine;
m_pEngine = NULL;
}
}
bool CBQBDriver::CompressCube(
const char *inp,
const char *outp,
const char *ref,
int start,
int steps,
int stride,
int keyfreq,
CBQBParameterSet_PosAndVol *parm,
int optimize,
int optsteps,
bool onlyopt,
bool comment,
bool compare,
bool dummyread
) {
const CBQBCubeFrame *cfr;
CBQBCubeFrame *cfr2;
int z, z2, i, k, co, ao, ft, lcsize, lasize, morder, histused, thu, vmo, pmo;
double tb, tb2, tf, tf2;
long insize;
std::vector ia, ia2;
CBQBBitSet bsat(m_IF), bscu(m_IF), bshe(m_IF), bstemp(m_IF);
bool err, to;
unsigned long t0, rxyz=1;
CBQBFile bf(m_IF);
CBQBStatistics stat(m_IF);
if (parm == NULL) {
m_IF.eprintf("CBQBDriver::CompressCube(): Error: parm == NULL.\n");
return false;
}
if (parm->GetVolUseExtra())
if (parm->GetVolExtraTRange() > parm->GetVolOrder())
parm->SetVolOrder(parm->GetVolExtraTRange());
if (parm->GetPosUseExtra())
if (parm->GetPosExtraTRange() > parm->GetPosOrder())
parm->SetPosOrder(parm->GetPosExtraTRange());
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("Opening cube file \"%s\" ...\n",inp);
m_pEngine->m_pReadCacheCube = new CBQBReadCubeCache(m_IF);
m_pEngine->m_pReadCacheCube->SetReadParameters(parm->GetVolEps(),parm->GetVolSigni(),parm->GetPosPrecision());
if (!m_pEngine->m_pReadCacheCube->FileOpenRead(inp,ref)) {
m_IF.eprintf("Error: Could not open file for reading.\n");
return false;
}
if (optimize != 0) {
if (MAX(parm->GetPosOrder(),parm->GetVolOrder())+1 > optsteps)
m_pEngine->m_pReadCacheCube->SetHistoryDepth(MAX(parm->GetPosOrder(),parm->GetVolOrder())+1);
else
m_pEngine->m_pReadCacheCube->SetHistoryDepth(optsteps);
m_IF.printf("\n");
m_pEngine->m_pReadCacheCube->CacheSteps(optsteps,true);
m_IF.printf("\n");
if (m_iOptIncludeFirst == -1) {
if ((m_pEngine->m_pReadCacheCube->GetCachedSteps() < optsteps) || (optsteps < 10)) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Low step count, switching on -optstart.\n\n");
m_iOptIncludeFirst = 1;
} else {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Large step count, switching off -optstart.\n\n");
m_iOptIncludeFirst = 0;
}
}
m_pEngine->m_pReadCacheCube->SetStartLock();
if (!OptimizeXYZParameters(
optimize, // int level,
parm->GetPositionParameterSet(),
comment, // bool comment,
true // bool cubepart
)) {
m_IF.eprintf("Error: Position data parameter optimization failed.\n");
delete m_pEngine->m_pReadCacheCube;
m_pEngine->m_pReadCacheCube = NULL;
return false;
}
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("\n");
if (!OptimizeCubeParameters(
optimize, // int level,
parm->GetVolumetricParameterSet()
)) {
m_IF.eprintf("Error: Volumetric data parameter optimization failed.\n");
delete m_pEngine->m_pReadCacheCube;
m_pEngine->m_pReadCacheCube = NULL;
return false;
}
if (m_IF.IsPL(BQB_PL_STANDARD)) {
m_IF.bprintf("\n The optimal parameters for this trajectory are:\n\n");
m_IF.printf("%s",parm->ToString(4).c_str());
m_IF.printf("\n");
m_IF.bprintf(" Parameter key:");
m_IF.printf(" %s\n\n",parm->ToKey().c_str());
}
if (onlyopt) {
m_pEngine->m_pReadCacheCube->CloseFile();
delete m_pEngine->m_pReadCacheCube;
m_pEngine->m_pReadCacheCube = NULL;
return true;
}
m_pEngine->m_pReadCacheCube->RewindReadPos();
m_pEngine->m_pReadCacheCube->LiftStartLock();
if (parm->GetVolUseExtra())
if (parm->GetVolExtraTRange() > parm->GetVolOrder())
parm->SetVolOrder(parm->GetVolExtraTRange());
if (parm->GetPosUseExtra())
if (parm->GetPosExtraTRange() > parm->GetPosOrder())
parm->SetPosOrder(parm->GetPosExtraTRange());
} else {
m_pEngine->m_pReadCacheCube->SetHistoryDepth(MAX(parm->GetPosOrder(),parm->GetVolOrder())+1);
}
t0 = (unsigned long)time(NULL);
stat.m_oStat.reset();
if (!dummyread) {
if (outp != NULL) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("Opening compressed file \"%s\" ...\n",outp);
if (!bf.OpenWriteAppend(outp)) {
m_IF.eprintf("Error: Could not open file for writing.\n");
m_pEngine->m_pReadCacheCube->CloseFile();
delete m_pEngine->m_pReadCacheCube;
m_pEngine->m_pReadCacheCube = NULL;
return false;
}
}
} else {
ref = NULL;
outp = NULL;
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("Dummy Read Mode (no compression / output is performed).\n");
}
m_pEngine->m_oaOutputCubeBuf.resize(parm->GetVolOrder()+1);
for (z=0;zGetVolOrder()+1;z++)
m_pEngine->m_oaOutputCubeBuf[z] = NULL;
m_pEngine->m_iOutputCubeBufPos = 0;
m_pEngine->m_oaOutputAtomBuf.resize(parm->GetPosOrder()+1);
for (z=0;zGetPosOrder()+1;z++)
m_pEngine->m_oaOutputAtomBuf[z] = NULL;
m_pEngine->m_iOutputAtomBufPos = 0;
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("Starting process...\n");
if (start != 0) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("Fast-forwarding to step %d: ",start+1);
for (z=0;zm_pReadCacheCube->SkipOneStep()) {
m_pEngine->m_pReadCacheCube->CloseFile();
delete m_pEngine->m_pReadCacheCube;
m_pEngine->m_pReadCacheCube = NULL;
return false;
}
if (m_IF.IsPL(BQB_PL_STANDARD)) {
m_IF.printf(".");
m_IF.FlushLog();
}
}
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Done.\n");
}
if (parm->GetVolUseExtra())
vmo = parm->GetVolExtraTRange();
else
vmo = parm->GetVolOptOrder();
if (parm->GetPosUseExtra())
pmo = parm->GetPosExtraTRange();
else
pmo = parm->GetPosOptOrder();
morder = vmo;
if (pmo > morder)
morder = pmo;
stat.ResetStatistics();
err = false;
i = 0;
k = 0;
tb = 0;
tb2 = 0;
tf = 0;
tf2 = 0;
to = false;
if (parm->GetVolOptOrder() && !parm->GetVolUseExtra())
lcsize = 1000000000;
else
lcsize = -1;
if (parm->GetPosOptOrder() && !parm->GetPosUseExtra())
lasize = 1000000000;
else
lasize = -1;
while (true) {
if (m_IF.IsPL(BQB_PL_VERBOSE))
m_IF.printf("\n\n");
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (i != 0)
m_IF.printf(" Step %6d ... (avg %5.1f s/step)\n",i+1,((double)(time(NULL)-t0))/i);
else
m_IF.printf(" Step %6d ...\n",i+1);
}
cfr = m_pEngine->m_pReadCacheCube->GetNextFrame();
if (cfr == NULL) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Reached end of input trajectory.\n");
break;
}
if (i == 0) {
rxyz = cfr->m_iResXYZ;
if (parm->GetVolUseExtra()) {
if (parm->GetVolExtraPredCorr()) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Initializing Volumetric Predictor Extrapolator (%d/%d)...\n",
parm->GetVolExtraTRange(),parm->GetVolExtraTOrder());
m_pEngine->m_pExtrapolator = new CBQBExtrapolator(m_IF);
m_pEngine->m_pExtrapolator->Initialize(
cfr->m_iRes[0], // resx,
cfr->m_iRes[1], // resy,
cfr->m_iRes[2], // resz,
1, // srangex,
1, // srangey,
1, // srangez,
parm->GetVolExtraTRange(), // trange,
0, // sorder,
parm->GetVolExtraTOrder(), // torder,
0, // offsetx,
0, // offsety,
0, // offsetz,
false, // crosss,
false, // crosst,
false, // wrap,
false, // crossranges,
false, // crossranget
0, // distexpo
parm->GetVolExtraTimeExpo(), // timeexpo
false
);
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (parm->IsVolExtraSRangeXYZEqual())
m_IF.printf(" Initializing Volumetric Corrector Extrapolator (%d/%d)...\n",
parm->GetVolExtraSRangeX(),parm->GetVolExtraSOrder());
else
m_IF.printf(" Initializing Volumetric Corrector Extrapolator (%d|%d|%d/%d)...\n",
parm->GetVolExtraSRangeX(),parm->GetVolExtraSRangeY(),parm->GetVolExtraSRangeZ(),parm->GetVolExtraSOrder());
}
m_pEngine->m_pExtrapolatorCorr = new CBQBExtrapolator(m_IF);
m_pEngine->m_pExtrapolatorCorr->Initialize(
cfr->m_iRes[0], // resx,
cfr->m_iRes[1], // resy,
cfr->m_iRes[2], // resz,
parm->GetVolExtraSRangeX(), // srangex,
parm->GetVolExtraSRangeY(), // srangey,
parm->GetVolExtraSRangeZ(), // srangez,
1, // trange,
parm->GetVolExtraSOrder(), // sorder,
0, // torder,
parm->GetVolExtraOffsetX(), // offsetx,
parm->GetVolExtraOffsetY(), // offsety,
parm->GetVolExtraOffsetZ(), // offsetz,
parm->GetVolExtraCrossS(), // crosss,
false, // crosst,
parm->GetVolExtraWrap(), // wrap,
parm->GetVolExtraCrossRangeS(), // crossranges,
false, // crossranget
parm->GetVolExtraDistExpo(), // distexpo
0, // timeexpo
false
);
} else {
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (parm->IsVolExtraSRangeXYZEqual())
m_IF.printf(" Initializing Volumetric Extrapolator (%d/%d;%d/%d)...\n",
parm->GetVolExtraSRangeX(),
parm->GetVolExtraSOrder(),
parm->GetVolExtraTRange(),
parm->GetVolExtraTOrder()
);
else
m_IF.printf(" Initializing Volumetric Extrapolator (%d|%d|%d/%d;%d|%d)...\n",
parm->GetVolExtraSRangeX(),
parm->GetVolExtraSRangeY(),
parm->GetVolExtraSRangeZ(),
parm->GetVolExtraSOrder(),
parm->GetVolExtraTRange(),
parm->GetVolExtraTOrder()
);
}
m_pEngine->m_pExtrapolator = new CBQBExtrapolator(m_IF);
m_pEngine->m_pExtrapolator->Initialize(
cfr->m_iRes[0], // resx,
cfr->m_iRes[1], // resy,
cfr->m_iRes[2], // resz,
parm->GetVolExtraSRangeX(), // srangex,
parm->GetVolExtraSRangeY(), // srangey,
parm->GetVolExtraSRangeZ(), // srangez,
parm->GetVolExtraTRange(), // trange,
parm->GetVolExtraSOrder(), // sorder,
parm->GetVolExtraTOrder(), // torder,
parm->GetVolExtraOffsetX(), // offsetx,
parm->GetVolExtraOffsetY(), // offsety,
parm->GetVolExtraOffsetZ(), // offsetz,
parm->GetVolExtraCrossS(), // crosss,
parm->GetVolExtraCrossT(), // crosst,
parm->GetVolExtraWrap(), // wrap,
parm->GetVolExtraCrossRangeS(), // crossranges,
parm->GetVolExtraCrossRangeT(), // crossranget
parm->GetVolExtraDistExpo(), // distexpo
parm->GetVolExtraTimeExpo(), // timeexpo
false
);
}
}
if (parm->GetPosUseExtra()) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Initializing Position Extrapolator (%d/%d)...\n",
parm->GetPosExtraTRange(),parm->GetPosExtraTOrder());
m_pEngine->m_pExtrapolatorXYZ = new CBQBExtrapolator(m_IF);
m_pEngine->m_pExtrapolatorXYZ->InitializeXYZ(
parm->GetPosExtraTRange(),
parm->GetPosExtraTOrder(),
parm->GetPosExtraTimeExpo(),
false
);
}
}
for (z=0;zm_pReadCacheCube->SkipOneStep()) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Reached end of input trajectory.\n");
break;
}
}
if (dummyread) // Just benchmark the CUBE reading speed
goto _dummy;
if (m_pEngine->m_pExtrapolator != NULL)
m_pEngine->m_pExtrapolator->PushCubeFrame(cfr);
if (m_pEngine->m_pExtrapolatorXYZ != NULL)
m_pEngine->m_pExtrapolatorXYZ->PushAtomFrame(cfr->m_pAtoms);
if ((i != 0) && (keyfreq != 0) && ((i % keyfreq) == 0)) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Enforcing key frame.\n");
k = 0; // Enforce this frame to be a keyframe
}
_again:
if (i < vmo)
co = i;
else if (k < vmo)
co = k;
else
co = vmo;
if (i < pmo)
ao = i;
else if (k < pmo)
ao = k;
else
ao = pmo;
_aagain:
bsat.Clear();
stat.PushStatistics();
histused = 0;
m_pEngine->CompressAtomFrame(
&bsat,
ao,
parm->GetPositionParameterSet(),
histused,
(i==0), // Store static trajectory information?
comment,
&stat
);
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (m_pEngine->m_pExtrapolatorXYZ == NULL)
m_IF.printf(" Atoms: Order %d, output size %9.3f KiB.\n",ao,bsat.GetByteLength()/1024.0);
else
m_IF.printf(" Atoms: History %2d, output size %9.3f KiB.\n",histused,bsat.GetByteLength()/1024.0);
}
if (lasize >= 0) {
if (to) {
to = false;
if (bsat.GetByteLength() <= bstemp.GetByteLength()) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Size is indeed smaller with lower order. Limiting atom order to %d.\n",ao);
stat.PopDiffStatistics();
parm->SetPosOrder(ao);
pmo = ao;
lasize = -1;
} else {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Size was smaller with higher order. Not limiting.\n");
stat.PopStatistics();
bsat = bstemp;
lasize = bsat.GetByteLength();
}
} else {
if ((ao != 0) && ((double)bsat.GetByteLength() >= (double)lasize*0.97)) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Size did not decrease any further with order %d. Trying order %d...\n",ao,ao-1);
bstemp = CBQBBitSet(bsat);
to = true;
ao--;
goto _aagain;
} else if (ao == pmo)
lasize = -1;
else
lasize = bsat.GetByteLength();
}
}
stat.PopIgnoreStatistics();
_cagain:
bscu.Clear();
stat.PushStatistics();
m_pEngine->CompressCubeFrame(
&bscu,
co,
parm->GetVolumetricParameterSet(),
thu,
(i==0), // Store static info?
&stat
);
if (thu > histused)
histused = thu;
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (m_pEngine->m_pExtrapolator == NULL)
m_IF.printf(" Cube: Order %d, output size %9.3f KiB.\n",co,bscu.GetByteLength()/1024.0);
else
m_IF.printf(" Cube: History %2d, output size %9.3f KiB.\n",thu,bscu.GetByteLength()/1024.0);
}
if (lcsize >= 0) {
if (to) {
to = false;
if (bscu.GetByteLength() <= bstemp.GetByteLength()) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Size is indeed smaller with lower order. Limiting cube order to %d.\n",co);
stat.PopDiffStatistics();
parm->SetVolOrder(co);
vmo = co;
lcsize = -1;
} else {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Size was smaller with higher order. Not limiting.\n");
stat.PopStatistics();
bscu = CBQBBitSet(bstemp);
lcsize = bscu.GetByteLength();
}
} else {
if ((co != 0) && ((double)bscu.GetByteLength() >= (double)lcsize*0.97)) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" Size did not decrease any further with order %d. Trying order %d...\n",co,co-1);
bstemp = CBQBBitSet(bscu);
to = true;
co--;
goto _cagain;
} else if (co == vmo)
lcsize = -1;
else
lcsize = bscu.GetByteLength();
}
}
stat.PopIgnoreStatistics();
if (MAX(pmo,vmo) < morder)
morder = MAX(pmo,vmo);
if (compare) {
cfr2 = new CBQBCubeFrame(m_IF);
m_pEngine->PushOutputCubeFrame(cfr2);
cfr2->m_pAtoms = new CBQBAtomSet();
m_pEngine->PushOutputAtomFrame(cfr2->m_pAtoms);
m_pEngine->DecompressAtomFrame(
&bsat,
BQB_FRAMETYPE_COMPTRAJ_VERSION,
parm->GetPositionParameterSet(),
NULL, // histused
false,
true
);
m_pEngine->DecompressCubeFrame(
&bscu,
BQB_FRAMETYPE_COMPCUBE_VERSION,
parm->GetVolumetricParameterSet(),
NULL, // histused
false,
true
);
if (m_IF.IsPL(BQB_PL_VERBOSE))
m_IF.printf("Comparing input and output...\n");
for (z=0;z<(int)cfr2->m_pAtoms->m_oaAtoms.size();z++)
for (z2=0;z2<3;z2++)
if (cfr->m_pAtoms->m_oaAtoms[z]->m_iCoord[z2] != cfr2->m_pAtoms->m_oaAtoms[z]->m_iCoord[z2]) {
m_IF.eprintf(" Error in atom coordinate %d[%d]: %.6f (%ld) != %.6f (%ld)\n",
z,z2,cfr->m_pAtoms->m_oaAtoms[z]->m_fCoord[z2],cfr->m_pAtoms->m_oaAtoms[z]->m_iCoord[z2],
cfr2->m_pAtoms->m_oaAtoms[z]->m_fCoord[z2],cfr2->m_pAtoms->m_oaAtoms[z]->m_iCoord[z2]);
err = true;
goto _skerr;
}
for (z=0;zm_iResXYZ;z++)
if (!ExpMantisEqual(cfr->m_iaExpo[z],cfr->m_iaMantis[z],cfr2->m_iaExpo[z],cfr2->m_iaMantis[z])) {
m_IF.eprintf(" Error in volumetric data element %7d: %.10G vs %.10G\n",
z,cfr->m_faBin[z],cfr2->m_faBin[z]);
err = true;
goto _skerr;
}
_skerr:
if (err) {
if (k != 0) {
m_IF.eprintf("Errors occured. Compressing frame again with history zero.\n");
err = false;
k = 0;
goto _again;
} else {
m_IF.eprintf("Errors occured despite of zero history. Aborting.\n");
goto _end;
}
}
if (m_IF.IsPL(BQB_PL_VERBOSE))
m_IF.printf("Done.\n");
}
bshe.Clear();
bshe.WriteBits(bsat.GetByteLength(),32);
bshe.WriteBits(bscu.GetByteLength(),32);
tb += bshe.GetByteLength();
tb += bsat.GetByteLength();
tb += bscu.GetByteLength();
tf++;
stat.m_oStat.m_lOverhead += bshe.GetLength();
if ((bsat.GetLength()%8) != 0)
stat.m_oStat.m_lOverhead += 8 - (bsat.GetLength()%8);
if ((bscu.GetLength()%8) != 0)
stat.m_oStat.m_lOverhead += 8 - (bscu.GetLength()%8);
if (i >= morder) {
tb2 += bshe.GetByteLength();
tb2 += bsat.GetByteLength();
tb2 += bscu.GetByteLength();
tf2++;
}
if (outp != NULL) {
if (i == 0)
ft = BQB_FRAMETYPE_COMPCUBESTART;
else if (k == 0)
ft = BQB_FRAMETYPE_COMPCUBEKEY;
else
ft = BQB_FRAMETYPE_COMPCUBE;
bf.CreateShortFrame(
ft,
BQB_FRAMETYPE_COMPCUBE_VERSION,
i+1
);
bf.PushPayload(bshe.m_iaData);
bf.PushPayload(bsat.m_iaData);
bf.PushPayload(bscu.m_iaData);
bf.FinalizeFrame(&stat);
}
_dummy:
i++;
k++;
if (i == steps)
break;
}
if (outp != NULL)
bf.WriteIndexFrame(true,&stat);
_end:
if (outp != NULL)
bf.Close();
insize = m_pEngine->m_pReadCacheCube->ftell();
m_pEngine->m_pReadCacheCube->CloseFile();
delete m_pEngine->m_pReadCacheCube;
m_pEngine->m_pReadCacheCube = NULL;
if (m_pEngine->m_pExtrapolator != NULL) {
delete m_pEngine->m_pExtrapolator;
m_pEngine->m_pExtrapolator = NULL;
}
if (m_pEngine->m_pExtrapolatorCorr != NULL) {
delete m_pEngine->m_pExtrapolatorCorr;
m_pEngine->m_pExtrapolatorCorr = NULL;
}
if (m_pEngine->m_pExtrapolatorXYZ != NULL) {
delete m_pEngine->m_pExtrapolatorXYZ;
m_pEngine->m_pExtrapolatorXYZ = NULL;
}
if (err) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.eprintf("Errors occurred while compressing the cube file.\n");
return false;
} else if (m_IF.IsPL(BQB_PL_STANDARD)) {
m_IF.printf("Finished compressing the cube file.\n\n");
m_IF.printf("%10.3f MiB (%12s Bytes) overhead.\n",
double(stat.m_oStat.m_lOverhead)/1024.0/1024.0/8.0,
(stat.m_oStat.m_lOverhead>>3).string());
m_IF.printf("%10.3f MiB (%12s Bytes) alphabet data.\n",
double(stat.m_oStat.m_lAlphabet)/1024.0/1024.0/8.0,
(stat.m_oStat.m_lAlphabet>>3).string());
m_IF.printf("%10.3f MiB (%12s Bytes) Huffman tables.\n",
double(stat.m_oStat.m_lHuffmanTables)/1024.0/1024.0/8.0,
(stat.m_oStat.m_lHuffmanTables>>3).string());
m_IF.printf("%10.3f MiB (%12s Bytes) table switching.\n",
double(stat.m_oStat.m_lTableSwitch)/1024.0/1024.0/8.0,
(stat.m_oStat.m_lTableSwitch>>3).string());
m_IF.printf("%10.3f MiB (%12s Bytes) payload data.\n",
double(stat.m_oStat.m_lHuffmanData)/1024.0/1024.0/8.0,
(stat.m_oStat.m_lHuffmanData>>3).string());
m_IF.printf("%10.3f MiB (%12s Bytes) in total.\n\n",
double(stat.m_oStat.m_lOverhead+stat.m_oStat.m_lAlphabet+stat.m_oStat.m_lHuffmanTables+stat.m_oStat.m_lTableSwitch+stat.m_oStat.m_lHuffmanData)/1024.0/1024.0/8.0,
((stat.m_oStat.m_lOverhead+stat.m_oStat.m_lAlphabet+stat.m_oStat.m_lHuffmanTables+stat.m_oStat.m_lTableSwitch+stat.m_oStat.m_lHuffmanData)>>3).string());
if (tf > 0) {
m_IF.bprintf("\n * Totals:\n");
m_IF.printf(" %9.3f KiB per frame on average.\n",tb/1024.0/tf);
m_IF.printf(" %9.3f bits per bin entry on average.\n",tb/tf/rxyz*8.0);
m_IF.printf(" Compression ratio of %.3f : 1\n",(double)insize/tb);
}
if (tf2 > 0) {
m_IF.bprintf("\n * Starting from step %d:\n",morder+1);
m_IF.printf(" %9.3f KiB per frame on average.\n",tb2/1024.0/tf2);
m_IF.printf(" %9.3f bits per bin entry on average.\n",(tb2/tf2)/rxyz*8.0);
m_IF.printf(" Compression ratio of %.3f : 1\n",((double)insize/tf*tf2)/tb2);
}
m_IF.printf("\n");
}
return true;
}
double CBQBDriver::CompressCubeBenchmark(
CBQBParameterSet_Volumetric *parm,
bool realsize,
double *presi,
std::vector > *tciaa
) {
const CBQBCubeFrame *cfr;
int i, co, histused;
double tb, tf, resi, tresi;
CBQBBitSet bscu(m_IF);
unsigned long t0, rxyz=1;
if (parm == NULL) {
m_IF.eprintf("CBQBDriver::CompressCube(): Error: parm == NULL.\n");
return false;
}
resi = 0;
t0 = (unsigned long)time(NULL);
if (parm->GetUseExtra())
if (parm->GetExtraTRange() > parm->GetOrder())
parm->SetOrder(parm->GetExtraTRange());
if (m_IF.IsPL(BQB_PL_VERBOSE))
m_IF.printf("Starting process...\n");
m_pEngine->m_pReadCacheCube->RewindReadPos();
i = 0;
tb = 0;
tf = 0;
while (true) {
if (m_IF.IsPL(BQB_PL_DEBUG))
m_IF.printf("\n\n");
if (m_IF.IsPL(BQB_PL_VERBOSE)) {
if (i != 0)
m_IF.printf(" Step %6d ... (avg %5.1f s/step)\n",
i+1,((double)(time(NULL)-t0))/i);
else
m_IF.printf(" Step %6d ...\n",i+1);
}
cfr = m_pEngine->m_pReadCacheCube->GetNextFrame();
if (cfr == NULL)
break;
if (i == 0) {
rxyz = cfr->m_iResXYZ;
if (parm->GetUseExtra()) {
if (parm->GetExtraPredCorr()) {
if (m_IF.IsPL(BQB_PL_VERBOSE))
m_IF.printf(" Initializing Predictor Extrapolator...\n");
m_pEngine->m_pExtrapolator = new CBQBExtrapolator(m_IF);
m_pEngine->m_pExtrapolator->Initialize(
cfr->m_iRes[0], // resx,
cfr->m_iRes[1], // resy,
cfr->m_iRes[2], // resz,
1, // srangex,
1, // srangey,
1, // srangez,
parm->GetExtraTRange(), // trange,
0, // sorder,
parm->GetExtraTOrder(), // torder,
0, // offsetx,
0, // offsety,
0, // offsetz,
false, // crosss,
false, // crosst,
false, // wrap,
false, // crossranges,
false, // crossranget
0, // distexpo
parm->GetExtraTimeExpo(), // timeexpo
!m_IF.IsPL(BQB_PL_VERBOSE)
);
if (m_IF.IsPL(BQB_PL_VERBOSE))
m_IF.printf(" Initializing Corrector Extrapolator...\n");
m_pEngine->m_pExtrapolatorCorr = new CBQBExtrapolator(m_IF);
m_pEngine->m_pExtrapolatorCorr->Initialize(
cfr->m_iRes[0], // resx,
cfr->m_iRes[1], // resy,
cfr->m_iRes[2], // resz,
parm->GetExtraSRangeX(), // srangex,
parm->GetExtraSRangeY(), // srangey,
parm->GetExtraSRangeZ(), // srangez,
1, // trange,
parm->GetExtraSOrder(), // sorder,
0, // torder,
parm->GetExtraOffsetX(), // offsetx,
parm->GetExtraOffsetY(), // offsety,
parm->GetExtraOffsetZ(), // offsetz,
parm->GetExtraCrossS(), // crosss,
false, // crosst,
parm->GetExtraWrap(), // wrap,
parm->GetExtraCrossRangeS(), // crossranges,
false, // crossranget
parm->GetExtraDistExpo(), // distexpo
0, // timeexpo
!m_IF.IsPL(BQB_PL_VERBOSE)
);
} else {
if (m_IF.IsPL(BQB_PL_VERBOSE))
m_IF.printf(" Initializing Extrapolator...\n");
m_pEngine->m_pExtrapolator = new CBQBExtrapolator(m_IF);
m_pEngine->m_pExtrapolator->Initialize(
cfr->m_iRes[0], // resx,
cfr->m_iRes[1], // resy,
cfr->m_iRes[2], // resz,
parm->GetExtraSRangeX(), // srangex,
parm->GetExtraSRangeY(), // srangey,
parm->GetExtraSRangeZ(), // srangez,
parm->GetExtraTRange(), // trange,
parm->GetExtraSOrder(), // sorder,
parm->GetExtraTOrder(), // torder,
parm->GetExtraOffsetX(), // offsetx,
parm->GetExtraOffsetY(), // offsety,
parm->GetExtraOffsetZ(), // offsetz,
parm->GetExtraCrossS(), // crosss,
parm->GetExtraCrossT(), // crosst,
parm->GetExtraWrap(), // wrap,
parm->GetExtraCrossRangeS(), // crossranges,
parm->GetExtraCrossRangeT(), // crossranget
parm->GetExtraDistExpo(), // distexpo
parm->GetExtraTimeExpo(), // timeexpo
!m_IF.IsPL(BQB_PL_VERBOSE)
);
}
}
}
if (m_pEngine->m_pExtrapolator != NULL)
m_pEngine->m_pExtrapolator->PushCubeFrame(cfr);
if (i < parm->GetOrder())
co = i;
else
co = parm->GetOrder();
if ((i+1 > parm->GetExtraTRange()) || (m_iOptIncludeFirst > 0)) {
bscu.Clear();
m_pEngine->CompressCubeFrame(
&bscu,
co,
parm,
histused,
(i==0), // Store static info
NULL,
!realsize,
&tresi,
tciaa
);
resi += tresi;
tf++;
if (realsize) {
tb += bscu.GetByteLength();
/* if (m_fResiCorrFrame != NULL) {
mfprintf(m_fResiCorrFrame,"%.3f; %.3f; %d\n", bscu.GetByteLength()/1024.0, mypow( tresi / rxyz, 1.0/m_fEntropyExpoCube ), m_iHistogramCounter-1 );
fflush(m_fResiCorrFrame);
}*/
}
}
i++;
if (m_pEngine->m_pReadCacheCube->GetCachedSteps() == 0)
break;
}
if (m_pEngine->m_pExtrapolator != NULL) {
delete m_pEngine->m_pExtrapolator;
m_pEngine->m_pExtrapolator = NULL;
}
if (m_pEngine->m_pExtrapolatorCorr != NULL) {
delete m_pEngine->m_pExtrapolatorCorr;
m_pEngine->m_pExtrapolatorCorr = NULL;
}
if (m_pEngine->m_pExtrapolatorXYZ != NULL) {
delete m_pEngine->m_pExtrapolatorXYZ;
m_pEngine->m_pExtrapolatorXYZ = NULL;
}
resi = bqbpow2( resi / (tf * rxyz) );
if (presi != NULL)
*presi = resi;
if (realsize) {
/* if (m_fResiCorrTraj != NULL) {
mfprintf(m_fResiCorrTraj,"%.4f; %.4f\n", tb / tf / 1024.0, resi );
fflush(m_fResiCorrTraj);
}*/
return tb / tf / 1024.0;
} else
return resi;
}
double CBQBDriver::OptimizeCube_ObjectiveTExpo(double texpo) {
double entropy, resi;
m_pVolParm->SetExtraTimeExpo(texpo);
entropy = CompressCubeBenchmark(
m_pVolParm,
m_bOptCubeRealSize, // bool realsize
&resi, // double *presi
NULL // std::vector > *tciaa
);
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (m_bOptCubeRealSize)
m_IF.printf(" %2d %2d %2d %2d %6.3f %6.3f %14.4f (%10.3f kiB)\n",
m_pVolParm->GetExtraSRangeX(),
m_pVolParm->GetExtraSOrder(),
m_pVolParm->GetExtraTRange(),
m_pVolParm->GetExtraTOrder(),
m_pVolParm->GetExtraDistExpo(),
texpo,
resi,
entropy
);
else
m_IF.printf(" %2d %2d %2d %2d %6.3f %6.3f %14.4f\n",
m_pVolParm->GetExtraSRangeX(),
m_pVolParm->GetExtraSOrder(),
m_pVolParm->GetExtraTRange(),
m_pVolParm->GetExtraTOrder(),
m_pVolParm->GetExtraDistExpo(),
texpo,
entropy
);
}
return entropy;
}
double CBQBDriver::OptimizeCube_ObjectiveSExpo(double sexpo) {
double entropy, resi;
m_pVolParm->SetExtraDistExpo(sexpo);
entropy = CompressCubeBenchmark(
m_pVolParm,
m_bOptCubeRealSize, // bool realsize
&resi, // double *presi
NULL // std::vector > *tciaa
);
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (m_bOptCubeRealSize)
m_IF.printf(" %2d %2d %2d %2d %6.3f %6.3f %14.4f (%10.3f kiB)\n",
m_pVolParm->GetExtraSRangeX(),
m_pVolParm->GetExtraSOrder(),
m_pVolParm->GetExtraTRange(),
m_pVolParm->GetExtraTOrder(),
sexpo,
m_pVolParm->GetExtraTimeExpo(),
resi,
entropy
);
else
m_IF.printf(" %2d %2d %2d %2d %6.3f %6.3f %14.4f\n",
m_pVolParm->GetExtraSRangeX(),
m_pVolParm->GetExtraSOrder(),
m_pVolParm->GetExtraTRange(),
m_pVolParm->GetExtraTOrder(),
sexpo,
m_pVolParm->GetExtraTimeExpo(),
entropy
);
}
return entropy;
}
class VARPARAMS{
public:
VARPARAMS(int srx, int sry, int srz, int so, int ofx, int ofy, int ofz, int tr, int to, double de, double te)
: srangex(srx), srangey(sry), srangez(srz), sorder(so), offsetx(ofx), offsety(ofy), offsetz(ofz),
trange(tr), torder(to), distexp(de), timeexp(te) { }
bool operator < (const VARPARAMS& v) const { UNUSED(v); return true; }
int srangex;
int srangey;
int srangez;
int sorder;
int offsetx;
int offsety;
int offsetz;
int trange;
int torder;
double distexp;
double timeexp;
};
bool CBQBDriver::OptimizeCubeParameters(
int level,
CBQBParameterSet_Volumetric *parm
) {
int steps, z, z2, z3, ti, zsr,zso, btr, bto, bsrx, bsry, bsrz, bsofx, bsofy, bsofz, bso, ca, bi;
int zsrx, zsry, zsrz, zsofx, zsofy, zsofz;
int tia[12];
double tf, tflast, btv, resi, tfa[12], tfa2[12], fac;
bool realsize;
unsigned long t0;
const CBQBCubeFrame *cfr;
char buf[256];
std::vector > rlist;
std::vector > rlist2, rlist3;
std::vector > tciaa;
std::vector iatc, iabl;
CBQBBitSet bs(m_IF);
CBQBIntegerEngine *tie;
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.bprintf(" >>> Volumetric Trajectory Parameter Optimization >>>\n");
/* if (level == 3) {
m_fResiCorrFrame = OpenFileWrite("corrframecube.csv",true);
m_fResiCorrTraj = OpenFileWrite("corrtrajcube.csv",true);
}*/
if (level >= 3)
realsize = true;
else
realsize = false;
t0 = (unsigned long)time(NULL);
m_pEngine->m_pReadCacheCube->RewindReadPos();
cfr = m_pEngine->m_pReadCacheCube->GetNextFrame();
if (parm->GetHilbert())
m_pEngine->BuildHilbertIdx(cfr->m_iRes[0],cfr->m_iRes[1],cfr->m_iRes[2]/*,verbose*/);
m_pEngine->m_pReadCacheCube->RewindReadPos();
steps = m_pEngine->m_pReadCacheCube->GetCachedSteps();
if (m_IF.IsPL(BQB_PL_STANDARD)) {
m_IF.printf(" Optimization level %d\n",level);
m_IF.printf(" Have %d cached steps.\n",steps);
m_IF.printf(" SR SO TR TO DistExp TimeExp Residuum\n");
}
tflast = 0;
btv = 1.0e30;
tf = 0;
btr = -1;
bto = -1;
bsrx = -1;
bsry = -1;
bsrz = -1;
bsofx = -1;
bsofy = -1;
bsofz = -1;
bso = -1;
parm->SetUseExtra(true);
//cextratimeexpo = 1.0;
//cextradistexpo = 3.0;
parm->SetExtraSOrder(0);
parm->SetExtraSRange(1);
parm->SetExtraOffset(0);
if (level == 2)
parm->SetTableCount(1);
/********************* Separate Code Block for Level 1 *************************************************/
if (level == 1) {
rlist2.clear();
switch(steps) {
case 1: // RX RY RZ SO OX OY OZ TR TO SE TE
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 6, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 5, 7, 7, 3, 2, 2, 2, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 5, 5, 5, 2, 2, 2, 2, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 3, 3, 3, 2, 1, 1, 1, 1, 0, 3.5, 1.5 ) ) );
break;
case 2: // RX RY RZ SO OX OY OZ TR TO SE TE
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 5, 5, 5, 3, 2, 2, 2, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 3, 3, 3, 2, 1, 1, 1, 2, 0, 3.5, 1.5 ) ) );
break;
case 3: // RX RY RZ SO OX OY OZ TR TO SE TE
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 3, 1, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 5, 5, 5, 3, 2, 2, 2, 3, 1, 3.5, 1.5 ) ) );
break;
case 4: // RX RY RZ SO OX OY OZ TR TO SE TE
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 4, 1, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 5, 5, 5, 3, 2, 2, 2, 4, 1, 3.5, 1.5 ) ) );
break;
default: // RX RY RZ SO OX OY OZ TR TO SE TE
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 5, 1, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 4, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 1, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 7, 7, 7, 5, 3, 3, 3, 2, 0, 3.5, 1.5 ) ) );
rlist2.push_back( std::pair( 0, VARPARAMS( 5, 5, 5, 3, 2, 2, 2, 4, 1, 3.5, 1.5 ) ) );
break;
}
for (z=0;z<(int)rlist2.size();z++) {
parm->SetExtraSRangeX(rlist2[z].second.srangex);
parm->SetExtraSRangeY(rlist2[z].second.srangey);
parm->SetExtraSRangeZ(rlist2[z].second.srangez);
parm->SetExtraTRange(rlist2[z].second.trange);
parm->SetExtraSOrder(rlist2[z].second.sorder);
parm->SetExtraTOrder(rlist2[z].second.torder);
parm->SetExtraOffsetX(rlist2[z].second.offsetx);
parm->SetExtraOffsetY(rlist2[z].second.offsety);
parm->SetExtraOffsetZ(rlist2[z].second.offsetz);
parm->SetExtraDistExpo(rlist2[z].second.distexp);
parm->SetExtraTimeExpo(rlist2[z].second.timeexp);
tf = CompressCubeBenchmark(
parm,
false, // bool realsize
&resi, // double *presi
NULL // std::vector > *tciaa
);
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" %2d %2d %2d %2d %6.3f %6.3f %14.4f",
rlist2[z].second.srangex,rlist2[z].second.sorder,rlist2[z].second.trange,
rlist2[z].second.torder,rlist2[z].second.distexp,rlist2[z].second.timeexp,tf);
if (tf < btv) {
btv = tf;
btr = z;
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" <---");
}
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("\n");
}
parm->SetExtraSRangeX(rlist2[btr].second.srangex);
parm->SetExtraSRangeY(rlist2[btr].second.srangey);
parm->SetExtraSRangeZ(rlist2[btr].second.srangez);
parm->SetExtraTRange(rlist2[btr].second.trange);
parm->SetExtraSOrder(rlist2[btr].second.sorder);
parm->SetExtraTOrder(rlist2[btr].second.torder);
parm->SetExtraOffsetX(rlist2[btr].second.offsetx);
parm->SetExtraOffsetY(rlist2[btr].second.offsety);
parm->SetExtraOffsetZ(rlist2[btr].second.offsetz);
parm->SetExtraDistExpo(rlist2[btr].second.distexp);
parm->SetExtraTimeExpo(rlist2[btr].second.timeexp);
tflast = parm->GetExtraTimeExpo();
if (parm->GetExtraTRange() != parm->GetExtraTOrder()+2) {
tfa[0] = 0.5;
tfa[1] = 1.0;
for (z=0;z<2;z++) {
parm->SetExtraTimeExpo(tfa[z]);
tfa2[z] = CompressCubeBenchmark(
parm,
false, // bool realsize
&resi, // double *presi
NULL // std::vector > *tciaa
);
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" %2d %2d %2d %2d %6.3f %6.3f %14.4f\n",
parm->GetExtraSRangeX(),
parm->GetExtraSOrder(),
parm->GetExtraTRange(),
parm->GetExtraTOrder(),
parm->GetExtraDistExpo(),
tfa[z],
tfa2[z]
);
}
if ((tfa2[0] < tfa2[1]) && (tfa2[0] < btv))
tflast = tfa[0];
else if ((tfa2[1] < tfa2[0]) && (tfa2[1] < btv))
tflast = tfa[1];
}
tfa[0] = 4.5;
tfa[1] = 6.0;
for (z=0;z<2;z++) {
parm->SetExtraDistExpo(tfa[z]);
tfa2[z] = CompressCubeBenchmark(
parm,
false, // bool realsize
&resi, // double *presi
NULL // std::vector > *tciaa
);
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" %2d %2d %2d %2d %6.3f %6.3f %14.4f\n",
parm->GetExtraSRangeX(),
parm->GetExtraSOrder(),
parm->GetExtraTRange(),
parm->GetExtraTOrder(),
tfa[z],
parm->GetExtraTimeExpo(),
tfa2[z]
);
}
if ((tfa2[0] < tfa2[1]) && (tfa2[0] < btv))
parm->SetExtraDistExpo(tfa[0]);
else if ((tfa2[1] < tfa2[0]) && (tfa2[1] < btv))
parm->SetExtraDistExpo(tfa[1]);
parm->SetExtraTimeExpo(tflast);
goto _end;
}
/********************* End of Separate Code Block for Level 1 ******************************************/
for (z=0;z<3;z++)
tfa[z] = 1.0e30;
for (z=0;z<3;z++) {
if (z+1 > steps)
break;
parm->SetExtraSRange(1);
parm->SetExtraTRange(z+1);
parm->SetExtraSOrder(0);
parm->SetExtraTOrder(MAX(z-1,0));
parm->SetExtraOffset(0);
tfa[z] = CompressCubeBenchmark(
parm,
realsize, // bool realsize
&resi, // double *presi
NULL // std::vector > *tciaa
);
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (realsize)
sprintf(buf," %2d %2d %2d %2d %6.3f %6.3f %14.4f (%10.3f kiB)",
1,
0,
z+1,
MAX(z-1,0),
parm->GetExtraDistExpo(),
parm->GetExtraTimeExpo(),
resi,
tfa[z]
);
else
sprintf(buf," %2d %2d %2d %2d %6.3f %6.3f %14.4f",
1,
0,
z+1,
MAX(z-1,0),
parm->GetExtraDistExpo(),
parm->GetExtraTimeExpo(),
tfa[z]
);
m_IF.printf("%s",(const char*)buf);
} else
buf[0] = 0;
if (tfa[z] < btv) {
btv = tfa[z];
bto = MAX(z-1,0);
btr = z+1;
bsrx = 1;
bsry = 1;
bsrz = 1;
bso = 0;
bsofx = 0;
bsofy = 0;
bsofz = 0;
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" <---");
}
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("\n");
rlist.push_back(std::pair(tfa[z],(const char*)buf));
rlist2.push_back(std::pair(tfa[z],VARPARAMS(
1,
1,
1,
0,
0,
0,
0,
z+1,
MAX(z-1,0),
parm->GetExtraDistExpo(),
parm->GetExtraTimeExpo()
)));
}
if ((tfa[2]+0.001 < tfa[0]) && (tfa[2]+0.001 < tfa[1])) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" ---> Time-continuous case.\n");
ca = 0;
} else if ((tfa[1]+0.001 < tfa[0]) && (tfa[1]+0.001 < tfa[2])) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" ---> Semi-time-continuous case.\n");
ca = 1;
} else {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" ---> Time-discontinuous case.\n");
ca = 2;
}
if (level == 4) {
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" SRX SRY SRZ OFX OFY OFZ SO TR TO DistExp TimeExp Residuum\n");
bi = 0;
for (zsrx=1;zsrx<10;zsrx++) {
for (zsry=1;zsry<10;zsry++) {
for (zsrz=1;zsrz<10;zsrz++) {
if (MAX3(zsrx,zsry,zsrz) - MIN3(zsrx,zsry,zsrz) > 2)
continue;
for (zsofx=0;zsofx 0)
continue;
} else if (MAX3(zsrx,zsry,zsrz) <= 5) {
if (MAX3(abs(zsofx-(zsrx/2)),abs(zsofy-(zsry/2)),abs(zsofz-(zsrz/2))) > 1)
continue;
} else {
if (MAX3(abs(zsofx-(zsrx/2)),abs(zsofy-(zsry/2)),abs(zsofz-(zsrz/2))) > 2)
continue;
}
for (zso=0;zso 1)
m_IF.printf("\n");
bi = 0;
if (((zsrx >= 5) || (zsry >= 5) || (zsrz >= 5)) && (zso == 0))
continue;
if (((zsrx >= 7) || (zsry >= 7) || (zsrz >= 7)) && (zso < 2))
continue;
if (((zsrx == 9) || (zsry == 9) || (zsrz == 9)) && (zso < 3))
continue;
for (z=1;z=-1;z2--) { // torder
if ((z > 1) && (z2 == -1))
continue;
if ((z > 3) && (z2 == 0))
continue;
// The three cases from above
if ((zsrx == 1) && (zsry == 1) && (zsrz == 1) && (z == 1) && (z2 == -1))
continue;
if ((zsrx == 1) && (zsry == 1) && (zsrz == 1) && (z == 2) && (z2 == 0))
continue;
if ((zsrx == 1) && (zsry == 1) && (zsrz == 1) && (z == 3) && (z2 == 1))
continue;
if (ca == 0) {
if ((z2 < 0) || ((z2 < 1) && (z > 3)))
continue;
} else if (ca == 1) {
if ((z2 < 0) || (z2 > 1))
continue;
} else {
if (z2 > -1)
continue;
}
tflast = tf;
parm->SetExtraSRangeX(zsrx);
parm->SetExtraSRangeY(zsry);
parm->SetExtraSRangeZ(zsrz);
parm->SetExtraTRange(z);
parm->SetExtraSOrder(zso);
parm->SetExtraTOrder(z2);
parm->SetExtraOffsetX(zsofx);
parm->SetExtraOffsetY(zsofy);
parm->SetExtraOffsetZ(zsofz);
tf = CompressCubeBenchmark(
parm,
realsize, // bool realsize
&resi, // double *presi
NULL // std::vector > *tciaa
);
if (m_IF.IsPL(BQB_PL_STANDARD)) {
if (realsize)
sprintf(buf," %3d %3d %3d %3d %3d %3d %2d %2d %2d %6.3f %6.3f %14.4f (%10.3f kiB)",
zsrx,
zsry,
zsrz,
zsofx,
zsofy,
zsofz,
zso,
z,
z2,
parm->GetExtraDistExpo(),
parm->GetExtraTimeExpo(),
resi,
tf
);
else
sprintf(buf," %3d %3d %3d %3d %3d %3d %2d %2d %2d %6.3f %6.3f %14.4f",
zsrx,
zsry,
zsrz,
zsofx,
zsofy,
zsofz,
zso,
z,
z2,
parm->GetExtraDistExpo(),
parm->GetExtraTimeExpo(),
tf
);
m_IF.printf("%s",(const char*)buf);
} else
buf[0] = 0;
bi++;
rlist.push_back(std::pair(tf,(const char*)buf));
rlist2.push_back(std::pair(tf,VARPARAMS(
zsrx,
zsry,
zsrz,
zso,
zsofx,
zsofy,
zsofz,
z,
z2,
parm->GetExtraDistExpo(),
parm->GetExtraTimeExpo()
)));
if (tf < btv) {
btv = tf;
bto = z2;
btr = z;
bsrx = zsrx;
bsry = zsry;
bsrz = zsrz;
bsofx = zsofx;
bsofy = zsofy;
bsofz = zsofz;
bso = zso;
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf(" <---");
}
if (m_IF.IsPL(BQB_PL_STANDARD))
m_IF.printf("\n");
if ((z2 < z-2) && (tflast < tf))
break;
}
}
}
}
}
}
}
}
}
} else {
bi = 0;
for (zsr=1;zsr<10;zsr+=2) {
if ((zsr == 9) && (level < 3))
break;
for (zso=0;zso 1)
m_IF.printf("\n");
bi = 0;
if ((zsr >= 5) && (zso == 0))
continue;
if ((zsr >= 7) && (zso < 2))
continue;
if ((zsr == 9) && (zso < 3))
continue;
for (z=1;z 2)) {
if (zso > 4)
continue;
if ((zsr == 5) && (zso == 4))
continue;
}
for (z2=z-2;z2>=-1;z2--) { // torder
if ((z > 1) && (z2 == -1))
continue;
if ((z > 3) && (z2 == 0))
continue;
// The three cases from above
if ((zsr == 1) && (z == 1) && (z2 == -1))
continue;
if ((zsr == 1) && (z == 2) && (z2 == 0))
continue;
if ((zsr == 1) && (z == 3) && (z2 == 1))
continue;
if (ca == 0) {
if ((z2 < 0) || ((z2 < 1) && (z > 3)))
continue;
} else if (ca == 1) {
if ((z2 < 0) || (z2 > 1))
continue;
} else {
if (z2 > -1)
continue;
}
tflast = tf;
parm->SetExtraSRangeX(zsr);
parm->SetExtraTRange(z);
parm->SetExtraSOrder(zso);
parm->SetExtraTOrder(z2);
parm->SetExtraOffset(zsr/2);
tf = CompressCubeBenchmark(
parm,
realsize, // bool realsize
&resi, // double *presi
NULL // std::vector