Migrated from GitHub

data/.travis.yml

@@ -0,0 +1,17 @@
+language: python
+python: "3.6"
+
+install :
+  - pip install pylama==7.6.6
+  - pip install pytest==4.1.1
+  - pip install coverage
+  - pip install coveralls
+  - pip install PyQt5==5.11.3
+
+script :
+  - pylama
+  - coverage run --source ./ -m pytest -v
+  - coverage report
+
+after_success:
+  - coveralls

data/CONTRIBUTING.md

@@ -0,0 +1,71 @@
+This is a brief guide on using **visma(VISualMAth)** and for making any contributions to the repo. Since visma is in its early stage, there are many features which can be implemented and many places where it can be improved/optimized.
+
+**NOTE:** VISualMAth is supported for **python3** and above only.
+
+### Currently, visma supports the following features
+
+* **Simplify** - simplify the whole expression/equation or perform sub-simplifications i.e. addition, subtraction, multiplication and division
+* **Find roots** - find roots for a quadratic equation
+* **Factorize** - factorize a given polynomial
+* **Solve** - solve the equation wrt a variable from a given equation, e.g. x^2 + y = 1, solve for x or y gives x = (1 - y)^0.5 or y = 1 - x^2
+* **Integration** - integrate a polynomial expression wrt a chosen variable
+* **Differentiation** - differentiate a polynomial expression wrt a chosen variable
+* **Plot** - plots an interactive 2D or 3D graph
+
+![visma](https://raw.githubusercontent.com/wiki/aerospaceresearch/visma/assets/demo.gif)
+
+### If interested in making any contributions make sure to go through these steps
+
+- Clone/fork the **dev** branch of the repo.
+- Before [building from source](https://github.com/aerospaceresearch/visma/wiki/Beginner's-Guide#To-build-from-source) make sure to install all [dependencies](https://github.com/aerospaceresearch/visma/wiki/Beginner's-Guide#Dependencies)
+- Make necessary changes(follow the [syntax guide](https://github.com/aerospaceresearch/visma/wiki/Beginner's-Guide#Syntax-guide))
+- Before making a PR or commit, run [all modules test](https://github.com/aerospaceresearch/visma/wiki/Beginner's-Guide#Make-sure-all-tests-pass-before-making-a-PR)
+- If all tests pass, make a PR or merge to **dev** branch
+
+### How to contribute
+
+Go through the source code, use visma and checkout the io, simplify and solver modules to get an idea of its working.
+- Look for **TODOs**(simple tasks/features) and **FIXMEs**(mostly failing edge cases) throughout the code and try to strike them off
+- Fix already raised [issues](https://github.com/aerospaceresearch/visma/wiki/Install)
+- Add test cases to the relevant test modules for increasing code coverage through unit tests(coverage report can be viewed in htmlcov/index.html folder after running `./run test`)
+- Try adding support for new functions and extend the existing modules(calculus, matrix etc)
+- Add new modules(for ex, multivariable linear equation solver)
+
+### To build from source
+
+- [Download](https://github.com/aerospaceresearch/visma/archive/dev.zip) the source code zip
+- Extract files
+- From project folder, do `$ ./run install` or `$ pip install -r requirements.txt`(make sure to check if the pip exists in python3 library by checking the pip version, use `$ pip --version`)
+- For launching visma do
+    ```bash
+    $ python main.py
+    >>> gui
+    ```
+
+### Dependencies
+
+- The following packages are required for using visma:
+    - PyQt5
+    - matplotlib
+    - numpy
+- The following packages are required for testing visma:
+    - pytest
+    - pylama
+    - coverage
+
+### Syntax guide
+
+- Follow **_camelCase_** for naming variables, functions etc. For example:
+    - variables: _symTokens_, _axisRange_ etc
+    - functions: _tokenizer_, _getLevelVariables_ etc
+    - classes: _Function_, _SquareMatrix_ etc
+- Use 4 spaces for tabs
+- Add relevant code to the respective modules
+
+### Make sure all tests pass before making a PR
+
+- To run all tests do `./run test`
+- To run only linter/syntax test(pylama) do `./run test syntax`
+- To test all modules(pytest) do `./run test modules`
+
+PRs are welcomed. If there are any issues or ideas they can be addressed through the [issues](https://github.com/aerospaceresearch/visma/issues) or in [chat room](https://gitter.im/aerospaceresearch/visma).

data/LICENSE

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

data/bin/visma

@@ -0,0 +1,5 @@
+#!/usr/bin/env python
+
+if __name__ == "__main__":
+    from visma.main import initGUI
+    initGUI()

data/main.py

@@ -0,0 +1,73 @@
+import os
+from cmd import Cmd
+from visma.gui.cli import commandExec
+from visma.gui.window import initGUI
+from visma.gui import logger
+
+
+def init():
+    open(os.path.abspath("log.txt"), "w").close()
+    logger.setLevel(10)
+    logger.setLogName('main')
+    logger.info('Initialising VisMa...(currently in CLI mode)')
+
+    class VisMa_Prompt(Cmd):
+        '''This inititates the main VisMa Prompt from where user may move to CLI/GUI'''
+
+        userManual = "|_________________________________________________________________________________________________|\n"\
+                     "| gui  ->> opens Visma in GUI mode.                                                               |\n"\
+                     "| Ctrl + D ->> Closes the prompt.                                                                     |\n"\
+                     "| exit ->> Closes the prompt.                                                                     |\n"\
+                     "|-------------------------------------------------------------------------------------------------|\n"\
+                     "| simplify( equation or expression ) ->> Simplifies the given equation.                           |\n"\
+                     "| addition( equation or expression ) ->> Adds the elements used.                                  |\n"\
+                     "| subtraction( equation or expression ) ->> Subtracts the elements used.                          |\n"\
+                     "| multiplication( equation or expression )  ->> Multiplies the elements used.                     |\n"\
+                     "| division( equation or expression )  ->> Divides the elements used.                              |\n"\
+                     "|-------------------------------------------------------------------------------------------------|\n"\
+                     "| factorize( expression )  ->> Factorizes the expression.                                         |\n"\
+                     "| find-roots( equation )  ->> Solves the quadratic equation for the variable in the equation.     |\n"\
+                     "| solve( equation , variable )  ->> Solves the equation for the given variable.                   |\n"\
+                     "|-------------------------------------------------------------------------------------------------|\n"\
+                     "| integrate( expression , variable )  ->> Integrates the expression by the given variable.        |\n"\
+                     "| differentiate( expression , variable ) ->> Differentiates the expression by the given variable. |\n"\
+                     "|_________________________________________________________________________________________________|\n"\
+
+        prompt = '>>> '
+        intro = "Welcome! This is Visual Maths Interactive Shell...\n" + "type 'help' for a User Manual and Ctrl + D to Exit prompt\n"
+
+        def do_exit(self, inp):
+            '''Exits VisMa Prompt'''
+            print("Exiting VisMa...")
+            logger.info('Exiting VisMa...')
+            return True
+
+        def emptyline(self):
+            logger.error('Empty line received as input')
+            print('Empty line received as input\n')
+
+        def do_manual(self, inp):
+            '''Displays a list of commands that can be used'''
+            print(self.userManual)
+
+        def do_gui(self, inp):
+            '''Starts GUI of VisMa'''
+            initGUI()
+            print("Initiating GUI...")
+            logger.info("Initiating GUI...")
+
+        def default(self, inp):
+            '''Directs to CommandExec and performs operations thereafter'''
+            try:
+                commandExec(inp)
+            except Exception:
+                logger.error('Invalid Expression: ' + inp)
+                print('Invalid Expression: ' + inp + '\n')
+
+        do_EOF = do_exit
+
+    VisMa_Prompt().cmdloop()
+
+
+if __name__ == '__main__':
+    init()

data/requirements.txt

@@ -0,0 +1,10 @@
+# required
+matplotlib>=2.0.0
+numpy>=1.12
+PyQt5>=5
+PyQtWebEngine>=5.12
+
+# for testing
+pylama
+pytest>=3.5
+coverage>=4.0

data/run

@@ -0,0 +1,89 @@
+#!/usr/bin/env python
+
+from __future__ import print_function
+import sys
+import subprocess
+import threading
+import glob
+
+
+def Str(value):
+    if isinstance(value, list):
+        return " ".join(value)
+    if isinstance(value, basestring):
+        return value
+    return str(value)
+
+
+def Glob(value):
+    ret = glob.glob(value)
+    if(len(ret) < 1):
+        ret = [value]
+    return ret
+
+
+for i in range(4-len(sys.argv)):
+    sys.argv.append("")
+
+if(str(sys.argv[1]) == ""):
+    print("")
+    print("Enter command arguments with run")
+    print("    ./run install - Install all dependencies for visma")
+    print("    ./run visma - Open visma GUI")
+    print("    ./run test - Run all the tests and generates coverage report")
+    print("    ./run test path/to/test_file.py - Runs all tests and shows coverage for given file")
+    print("    ./run test syntax - Run syntax test using pylama")
+    print("    ./run test modules - Run tests using pytest for all modules")
+    print("    ./run test coverage - After running all the tests, open coverage report")
+    print("    ./run pack - Generate builds for visma package")
+    print("    ./run pack upload - Generate builds and then upload to test.pypi.org")
+    print("    ./run pack final - Generate builds and upload final build to pypi.org")
+    print("    ./run clean - Clean all cache, reports and builds")
+    print("")
+
+elif (str(sys.argv[1]) == "install"):
+    subprocess.call("python3 -m pip install -r requirements.txt", shell=True)
+
+elif (str(sys.argv[1]) == "visma"):
+    subprocess.call("python3 main.py", shell=True)
+
+elif str(sys.argv[1]) == "test":
+    if str(sys.argv[2]) == "syntax" or str(sys.argv[2]) == "":
+        print("Python Syntax Test ...")
+        subprocess.call("pylama", shell=True)
+    elif (str(sys.argv[2]) == "modules"):
+        print("Python Modules Test ...")
+        subprocess.call("pytest", shell=True)
+
+    if str(sys.argv[2]) != "" and str(sys.argv[2]) != "coverage" and str(sys.argv[2]) != "syntax" and str(sys.argv[2]) != "modules":
+        print("Python Test for " + str(sys.argv[2]) + " ...")
+        subprocess.call("coverage run --source ./ -m pytest " + str(sys.argv[2]) + " -v", shell=True)
+
+    elif str(sys.argv[2]) == "":
+        print("Python Modules Test with Coverage ...")
+        subprocess.call("coverage run --source ./ -m pytest -v", shell=True)
+
+    if str(sys.argv[2]) == "" or str(sys.argv[2]) == "coverage" or str(sys.argv[3]) == "coverage":
+        subprocess.call("coverage report", shell=True)
+        subprocess.call("coverage html", shell=True)
+
+    if str(sys.argv[2]) == "coverage" or str(sys.argv[3]) == "coverage":
+        def thread1():
+            subprocess.call("nohup xdg-open ./htmlcov/index.html", shell=True)
+            threading.Thread(target=thread1).start()
+
+elif str(sys.argv[1]) == "pack":
+    subprocess.call("mv main.py visma", shell=True)
+    subprocess.call("python3 setup.py sdist bdist_wheel", shell=True)
+    subprocess.call("mv ./visma/main.py ./", shell=True)
+
+    if str(sys.argv[2]) == "upload":
+        subprocess.call("twine upload --repository-url https://test.pypi.org/legacy/", Str(Glob("dist/*")), shell=True)
+    elif str(sys.argv[2]) == "final":
+        subprocess.call("twine upload", Str(Glob("dist/*")), shell=True)
+
+elif str(sys.argv[1]) == "clean":
+    subprocess.call("git clean -xdf", shell=True)
+
+else:
+    print("Invalid arguments")

data/setup.cfg

@@ -0,0 +1,14 @@
+[pylama]
+ignore = C901,E0602,E501,W605
+# C901: 'xyz' is too complex
+# E0602: undefined name 'xyz'
+# E501: E501 line too long (> 79 chars)
+# W605: Invalid escape sequence
+
+[tool:pytest]
+
+[coverage:run]
+omit = main.py, setup.py, */__init__.py, visma/gui/*, visma/testbed/*, run
+
+[coverage:report]
+omit = main.py, setup.py, */__init__.py, visma/gui/*, visma/testbed/*, run

data/setup.py

@@ -0,0 +1,45 @@
+import setuptools
+
+with open("README.md", "r") as fh:
+    long_description = fh.read()
+
+setuptools.setup(
+    name="VISualMAth",
+    description="visma - VISual MAth : A math equation solver and visualizer",
+    version="1.0.0.0",
+    author="Siddharth Kothiyal, Shantanu Mishra, Mayank Dhiman",
+    author_email="[email protected], [email protected], [email protected]",
+    long_description=long_description,
+    long_description_content_type="text/markdown",
+    url="https://github.com/aerospaceresearch/visma",
+    project_urls={
+        'Documentation': 'https://github.com/aerospaceresearch/visma/wiki',
+        'Source': 'https://github.com/aerospaceresearch/visma',
+        'Issues': 'https://github.com/aerospaceresearch/visma/issues',
+        'Chat': 'https://gitter.im/aerospaceresearch/visma'
+    },
+    packages=setuptools.find_packages(),
+    scripts=['bin/visma'],
+    classifiers=(
+        "Programming Language :: Python :: 3",
+        "Programming Language :: Python :: 3.4",
+        "Programming Language :: Python :: 3.5",
+        "Programming Language :: Python :: 3.6",
+        "Programming Language :: Python :: 3.7",
+        "Operating System :: OS Independent",
+        "Topic :: Scientific/Engineering",
+        "Topic :: Scientific/Engineering :: Mathematics",
+        "Topic :: Scientific/Engineering :: Visualization",
+        "License :: OSI Approved :: GNU General Public License v3 (GPLv3)"
+    ),
+    python_requires='>=3',
+    install_requires=[
+        "PyQt5",
+        "matplotlib",
+        "numpy"
+    ],
+    tests_require=[
+        "pytest",
+        "coverage"
+    ]
+)

data/tests/test_calculus.py

@@ -0,0 +1,79 @@
+from visma.calculus.differentiation import differentiate, differentiationProductRule
+from visma.calculus.integration import integrate
+from tests.tester import quickTest
+
+############################
+# calculus.differentiation #
+############################
+
+
+def test_differentiate():
+
+    assert quickTest("x^2 + x", differentiate, 'x') == "2.0x+1.0"
+
+    assert quickTest("x + 2y + 3z + 4", differentiate, 'x') == "1.0"
+    assert quickTest("x + 2y + 3z + 4", differentiate, 'y') == "2.0"
+    assert quickTest("x + 2y + 3z + 4", differentiate, 'z') == "3.0"
+
+    assert quickTest("xy + xy^2 + xyz", differentiate, 'x') == "y+y^(2.0)+yz"
+    assert quickTest("xy + xy^2 + xyz", differentiate, 'y') == "x+2.0xy+xz"
+    assert quickTest("xy + xy^2 + xyz", differentiate, 'z') == "xy"
+
+    assert quickTest("xy + z", differentiate, 'z') == "1.0"
+    assert quickTest("z + xy", differentiate, 'z') == "1.0"
+    assert quickTest("z - xy", differentiate, 'z') == "1.0"
+    assert quickTest("xy - z", differentiate, 'z') == "-1.0"
+
+    assert quickTest("sin(x)", differentiate, 'x') == "cos(x)*1.0"
+    assert quickTest("sin(x)", differentiate, 'y') == "0.0"
+    assert quickTest("sin(xxx)", differentiate, 'x') == "cos(x^(3.0))*3.0x^(2.0)"
+    assert quickTest("sin(log(xx))", differentiate, 'x') == "cos(log(x^(2.0)))*x^(-1.0)*2.0x"
+
+    assert quickTest("cos(x)", differentiate, 'x') == "-1.0*sin(x)*1.0"
+    assert quickTest("cos(x)", differentiate, 'y') == "0.0"
+    assert quickTest("cos(xxx)", differentiate, 'x') == "-1.0*sin(x^(3.0))*3.0x^(2.0)"
+    assert quickTest("cos(log(xx))", differentiate, 'x') == "-1.0*sin(log(x^(2.0)))*x^(-1.0)*2.0x"
+
+    assert quickTest("tan(x)", differentiate, 'x') == "sec(x)*1.0"
+    # FIXME: Simplify module simplifies sec^2(x) as sec(x) and cosec^2(x) as cosec(x), however differentiation modules give correct output
+    assert quickTest("tan(x)", differentiate, 'y') == "0.0"
+
+    assert quickTest("cot(x)", differentiate, 'x') == "-1.0*csc(x)*1.0"
+    # FIXME: Simplify module simplifies sec^2(x) as sec(x) and cosec^2(x) as cosec(x), however differentiation modules give correct output
+    assert quickTest("cot(x)", differentiate, 'y') == "0.0"
+
+    assert quickTest("csc(x)", differentiate, 'x') == "-1.0*csc(x)*cot(x)*1.0"
+    assert quickTest("csc(x)", differentiate, 'y') == "0.0"
+
+    assert quickTest("sec(x)", differentiate, 'x') == "sec(x)*tan(x)*1.0"
+    assert quickTest("sec(x)", differentiate, 'y') == "0.0"
+
+    assert quickTest("log(x)", differentiate, 'x') == "x^(-1.0)"
+    assert quickTest("log(xx)", differentiate, 'x') == "2.0"
+
+    # Tests for Product Rule of Differentiation.
+    assert quickTest("sin(x)*cos(x)", differentiationProductRule, 'x') == "(cos(x)*1.0)*cos(x)+sin(x)*(-1.0*sin(x)*1.0)"
+    assert quickTest("sin(x)*x", differentiationProductRule, 'x') == "(cos(x)*1.0)*x+sin(x)*(1.0)"
+    assert quickTest("sin(x)*y", differentiationProductRule, 'x') == "(cos(x)*1.0)*y+sin(x)*(0.0)"
+    assert quickTest("sin(x)*cos(x)*sec(x)", differentiationProductRule, 'x') == "(cos(x)*1.0)*cos(x)*sec(x)+sin(x)*(-1.0*sin(x)*1.0)*sec(x)+sin(x)*cos(x)*(sec(x)*tan(x)*1.0)"
+
+
+########################
+# calculus.integration #
+########################
+
+
+def test_integrate():
+
+    assert quickTest("x + 1", integrate, 'x') == "0.5x^(2.0)+x"
+
+    assert quickTest("xyz + xy/z + x + 1 + 1/x", integrate, 'x') == "0.5x^(2.0)yz+0.5x^(2.0)yz^(-1.0)+0.5x^(2.0)+x+1.0*log(x)"  # FIXME(integration.py): Ignore coeff if 1
+    assert quickTest("xyz + xy/z + x + 1 + 1/x", integrate, 'y') == "0.5xy^(2.0)z+0.5xy^(2.0)z^(-1.0)+xy+y+x^(-1.0)y"
+    assert quickTest("xyz + xy/z + x + 1 + 1/x", integrate, 'z') == "0.5xyz^(2.0)+xy*log(z)+xz+z+x^(-1.0)z"
+
+    assert quickTest("sin(x)", integrate, 'x') == "-1.0*cos(x)"
+    assert quickTest("cos(x)", integrate, 'x') == "sin(x)"
+    assert quickTest("tan(x)", integrate, 'x') == "-1.0*ln(cos(x))"
+    assert quickTest("csc(x)", integrate, 'x') == "-1.0*ln((csc(x)+cot(x)))"
+    assert quickTest("sec(x)", integrate, 'x') == "ln((sec(x)+tan(x)))"
+    assert quickTest("cot(x)", integrate, 'x') == "ln(sin(x))"

data/tests/test_discrete.py

@@ -0,0 +1,39 @@
+from tests.tester import quickTest
+from visma.discreteMaths.combinatorics import factorial, permutation, combination
+from visma.discreteMaths.statistics import ArithemeticMean, Mode, Median
+
+
+def test_factorial():
+
+    assert quickTest("5", factorial) == "120.0"
+    assert quickTest("0", factorial) == "1"
+    assert quickTest("11", factorial) == "39916800.0"
+    assert quickTest("11 - 11", factorial) == "1"
+
+
+def test_permutation():
+
+    assert quickTest("5;2", permutation) == "20.0"
+    assert quickTest("12;3", permutation) == "1320.0"
+    assert quickTest("10 + 2;5 - 2", permutation) == "1320.0"
+    assert quickTest("11;11", permutation) == "39916800.0"
+
+
+def test_combination():
+
+    assert quickTest("5;2", combination) == "10.0"
+    assert quickTest("2;2", permutation) == "2.0"
+    assert quickTest("11;0", permutation) == "1.0"
+    assert quickTest("11;11 - 11", permutation) == "1.0"
+
+
+def test_statistics():
+
+    assert quickTest([12, 1, -12, -1, 0], ArithemeticMean) == "0.0"
+    assert quickTest([11, 1, -2, -1, 0], ArithemeticMean) == "1.8"
+
+    assert quickTest([12, 12, 12, 12, 1, -12, -1, 0], Mode) == "Mode=12;ModeFrequency=4"
+    assert quickTest([-1, -1, 2, 3, 4, 5, 6], Mode) == "Mode=-1;ModeFrequency=2"
+
+    assert quickTest([1, 2, 3, 4, 5], Median) == "3"
+    assert quickTest([1, 2, 3, 4, 5, 12], Median) == "3.5"

data/tests/test_functions.py

@@ -0,0 +1,281 @@
+from visma.functions.constant import Constant
+from visma.functions.variable import Variable
+from visma.functions.structure import Expression
+from visma.functions.operator import Plus, Minus
+from visma.io.parser import tokensToString
+
+######################
+# functions.constant #
+######################
+
+
+def test_Constant():
+
+    # Tests for Calculus operations for Constant Class.
+
+    constant1 = Constant(10)
+    assert constant1.__str__() == "{10}"
+    constant1.differentiate()
+    assert constant1.value == 0
+
+    constant2 = Constant(5, 2)
+    constant2.integrate('x')
+    assert isinstance(constant2, Variable)
+    assert constant2.__str__() == "25{x}"
+
+    # Tests for Add/Sub operations (using Overloading) for Constant Class.
+
+    constant4 = Constant(2, 2)
+    constant5 = Constant(7)
+    constant3 = constant4 - constant5
+    assert constant3.__str__() == "{-3}"
+
+    constant4 = Constant(7, 2)
+    constant0 = Constant(5)
+    constant6 = constant4 - constant3 - constant5 + constant0
+    assert constant6.__str__() == "{50}"
+
+    constant0 = Constant(5, 2, 2)
+    constant2 = constant0
+    variable0 = Variable(5, 'X', 3)
+    summation0 = constant0 - variable0 + constant2
+    assert summation0.__str__() == "{({100}-5{X}^{3})}"
+
+    constant0 = Constant(5, 2, 2)
+    constant2 = constant0
+    variable0 = Variable(5, 'X', 3)
+    summation0 = constant0 + variable0 + constant2
+    assert summation0.__str__() == "{({100}+5{X}^{3})}"
+
+    var1 = Variable(3, 'x', 3)
+    const1 = Constant(5)
+    expr1 = Expression([var1, Minus(), const1])
+    constant2 = Constant(2, 2)
+    sub1 = constant2 - expr1
+    assert sub1.__str__() == "{({9}-3{x}^{3})}"
+
+    constant1 = Constant(2)
+    constant2 = Constant(7)
+    constant3 = constant1 + constant2
+    assert constant3.__str__() == "{9}"
+
+    constant1 = Constant(2)
+    constant2 = Constant(7)
+    constant3 = constant1 - constant2
+    assert constant3.__str__() == "{-5}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    summation = constant1 + variable1
+    assert summation.__str__() == "{({5}+5{x}^{3})}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    summation = constant1 - variable1
+    assert summation.__str__() == "{({5}-5{x}^{3})}"
+
+# Tests for Add/Sub operations (using Overloading) for Constant Class.
+
+    constant0 = Constant(0, 2)
+    constant1 = Constant(5)
+    mul1 = constant0 * constant1
+    assert mul1.calculate() == 0
+    mul1 = constant1 * constant0
+    assert mul1.calculate() == 0
+    mul1 = constant1 * constant1 + constant0 * constant1 + constant0 * constant1
+    assert mul1.calculate() == 25
+
+    constant1 = Constant(5, 2)
+    constant2 = Constant(4, 2)
+    variable0 = Variable(3, 'X', 3)
+    mul3 = constant1 * (constant2 + variable0)
+    assert mul3.__str__() == "{({400}+75{X}^{3})}"
+
+    constant1 = Constant(5, 2)
+    constant2 = Constant(4, 2)
+    variable0 = Variable(3, 'X', 3)
+    mul3 = constant1 / (constant2 + variable0)
+    assert mul3.__str__() == "{25}*{({16}+3{X}^{3})}^{-1}"
+
+    constant1 = Constant(5)
+    constant2 = Constant(4)
+    div1 = constant1 / constant2
+    assert div1.__str__() == "{1.25}"
+
+    constant1 = Constant(3, 2)
+    constant2 = Constant(4, 2)
+    variable0 = Variable(3, 'X', 3)
+    mul3 = constant1 - constant1/(constant2/variable0 + constant1)
+    assert mul3.__str__() == "{({9}-{9}*{(5.333333333333333{X}^{-3}+{9})}^{-1})}"
+
+    constant1 = Constant(2, 2)
+    constant2 = Constant(2, 2)
+    mul3 = constant1 ** constant2
+    assert mul3.__str__() == "{256}"
+
+    constant1 = Constant(5)
+    constant2 = Constant(5)
+    summation = constant1 * constant2
+    assert summation.__str__() == "{25}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    exp1 = Expression([constant1, Plus(), variable1])
+    constant2 = Constant(10)
+    summation = constant2 + exp1
+    assert summation.__str__() == "{({15}+5{x}^{3})}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    exp1 = Expression([constant1, Plus(), variable1])
+    constant2 = Constant(10)
+    summation = constant2 - exp1
+    assert summation.__str__() == "{({5}-5{x}^{3})}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    exp1 = Expression([constant1, Plus(), variable1])
+    constant2 = Constant(10)
+    summation = exp1 - constant2
+    assert summation.__str__() == "{({-5}+5{x}^{3})}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    summation = constant1 * variable1
+    assert summation.__str__() == "25{x}^{3}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    exp1 = Expression([constant1, Plus(), variable1])
+    constant2 = Constant(10)
+    summation = constant2 * exp1
+    assert summation.__str__() == "{({50}+50{x}^{3})}"
+
+    constant1 = Constant(5)
+    constant2 = Constant(5)
+    summation = constant1 / constant2
+    assert summation.__str__() == "{1.0}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    summation = constant1 / variable1
+    assert summation.__str__() == "{x}^{-3}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    exp1 = Expression([constant1, Plus(), variable1])
+    constant2 = Constant(10)
+    summation = constant2 / exp1
+    assert summation.__str__() == "{10}*{({5}+5{x}^{3})}^{-1}"
+
+    constant1 = Constant(5)
+    variable1 = Variable(5, 'x', 3)
+    exp1 = Expression([constant1, Plus(), variable1])
+    constant2 = Constant(10)
+    summation = exp1 / constant2
+    assert summation.__str__() == "{({0.5}+0.5{x}^{3})}"
+
+
+######################
+# functions.variable #
+######################
+
+
+def test_Variable():
+
+    variable1 = Variable(2, 'x', 3)
+    assert variable1.__str__() == "2{x}^{3}"
+    variable1, _ = variable1.integrate('x')
+    assert variable1.__str__() == "0.5{x}^{4}"
+
+    constant = Constant(3)
+    variable = Variable(2, 'x', 3)
+    add = variable + constant
+    assert add.__str__() == "{(2{x}^{3}+{3})}"
+
+    variable1 = Variable(2, 'x', 3)
+    variable2 = Variable(4, 'x', 3)
+    add1 = variable1 + variable2
+    assert add1.__str__() == "6{x}^{3}"
+
+    variable1 = Variable(2, 'x', 3)
+    constant = Constant(3)
+    exp1 = Expression([variable1, Plus(), constant])
+    variable2 = Variable(4, 'x', 3)
+    add2 = variable2 + exp1
+    assert add2.__str__() == "{(6{x}^{3}+{3})}"
+
+    variable1 = Variable(2, 'x', 3)
+    constant = Constant(3)
+    exp1 = variable1 + constant
+    variable2 = Variable(4, 'x', 3)
+    add2 = variable2 - exp1
+    assert add2.__str__() == "{(2{x}^{3}-{3})}"
+
+    variable1 = Variable(2, 'x', 3)
+    constant = Constant(3)
+    exp1 = Expression([variable1, Plus(), constant])
+    variable2 = Variable(4, 'x', 3)
+    add2 = exp1 - variable2
+    assert add2.__str__() == "{(-2{x}^{3}+{3})}"
+
+    constant = Constant(3)
+    variable = Variable(2, 'x', 3)
+    add = variable - constant
+    assert add.__str__() == "{(2{x}^{3}-{3})}"
+
+    variable1 = Variable(2, 'x', 3)
+    variable2 = Variable(4, 'x', 3)
+    variable3 = Variable(2, 'x', 4)
+    variable4 = Variable(2, 'x', 3)
+    add1 = variable1 - variable2
+    add2 = variable3 - variable4
+    assert add1.__str__() == "-2{x}^{3}"
+    assert add2.__str__() == "{(2{x}^{4}-2{x}^{3})}"
+
+    constant = Constant(3)
+    variable = Variable(2, 'x', 3)
+    add = variable * constant
+    assert add.__str__() == "6{x}^{3}"
+
+    variable1 = Variable(2, 'x', 3)
+    variable2 = Variable(4, 'x', 3)
+    add2 = variable1 * variable2
+    assert add2.__str__() == "8{x}^{6}"
+
+    variable1 = Variable(2, 'x', 3)
+    variable2 = Variable(4, 'y', 3)
+    add2 = variable1 * variable2
+    assert add2.__str__() == "8{x}^{3}{y}^{3}"
+
+    variable1 = Variable(2, 'x', 3)
+    variable2 = Variable(4, 'y', 4)
+    add1 = variable1 / variable2
+    assert add1.__str__() == "0.5{x}^{3}{y}^{-4}"
+
+    variable1 = Variable(2, 'x', 3)
+    constant = Constant(3)
+    exp1 = variable1 - constant
+    variable2 = Variable(4, 'x', 3)
+    add2 = variable2 / exp1
+    assert add2.__str__() == "{(4.0{x}^{3}*{(2{x}^{3}-{3})}^{-1})}"
+
+    variable1 = Variable(2, 'x', 3)
+    constant = Constant(3)
+    exp1 = variable1 - constant
+    variable2 = Variable(4, 'x', 3)
+    add2 = variable2 * exp1
+    assert add2.__str__() == "{(8{x}^{6}-12{x}^{3})}"
+
+    variable1 = Variable(2, 'x', 3)
+    constant1 = Constant(3)
+    exp1 = variable1 - constant1
+    variable2 = Variable(4, 'x', 3)
+    constant2 = Constant(4)
+    exp2 = variable2 - constant2
+    add2 = exp1 * exp2
+    assert add2.__str__() == "{({(8{x}^{6}-8{x}^{3})}-{(12{x}^{3}-{12})})}"
+
+    variable2 = Variable(3, 'x', -1)
+    variable2, _ = variable2.integrate('x')
+    assert tokensToString(variable2) == '3 * log(x)'

data/tests/test_io.py

@@ -0,0 +1,127 @@
+from visma.io.checks import getVariables, areTokensEqual, isTokenInToken
+from visma.io.parser import tokensToString, tokensToLatex
+from visma.io.tokenize import getTerms, normalize
+from visma.functions.operator import Operator, Plus
+from visma.functions.structure import Expression
+from tests.tester import getTokens
+
+#############
+# io.checks #
+#############
+
+
+def test_getVariables():
+
+    varA = getTokens("x")
+    assert getVariables([varA]) == ['x']
+
+    varB = getTokens("xy+ xy^2 +yz^3")
+    assert getVariables(varB) == ['x', 'y', 'z']
+
+    varC = getTokens("x + sin(x) + cos(y) + tan(2*z)*2 + tanh(z) + e^2")
+    # FIXME: getVariables() in visma.io.checks
+    # varC = getTokens("x + sin(x) + cos(y) + tan(2*z)*2 + tanh(z) + e^2")
+    # assert getVariables(varC) == ['x', 'y', 'z']
+    assert getVariables(varC) == ['x']
+
+
+def test_areTokensEqual():
+
+    varA = getTokens("3xy")
+    varB = getTokens("3yx")
+    varC = getTokens("3yz")
+    assert areTokensEqual(varA, varB)
+    assert not areTokensEqual(varA, varC)
+
+    opA = Operator()
+    opA.value = '+'
+    opB = Plus()
+    assert areTokensEqual(opA, opB)
+
+
+def test_isTokenInToken():
+
+    varA = getTokens("x^3")
+    varB = getTokens("xy^2")
+    varC = Expression(getTokens("1 + w + x"))
+    varD = Expression(getTokens("w + y"))
+    assert isTokenInToken(varA, varB)
+    assert isTokenInToken(varA, varC)
+    assert not isTokenInToken(varA, varD)
+
+    varA = getTokens("xy^2")
+    varB = getTokens("x^(2)y^(4)z")
+    varC = getTokens("yx^0.5")
+    varD = getTokens("xy^(3)z")
+    varE = getTokens("2")
+    assert isTokenInToken(varA, varB)
+    assert isTokenInToken(varA, varC)
+    assert not isTokenInToken(varA, varD)
+    assert not isTokenInToken(varA, varE)
+
+
+#############
+# io.parser #
+#############
+
+
+def test_tokensToString():
+
+    # Matrix token to string
+    mat = getTokens("[1+x, 2; \
+                      3  , 4]")
+    assert tokensToString([mat]) == "[1.0 + x,2.0;3.0,4.0]"
+
+    mat = getTokens("[1+x, 2] + [1, y + z^2]")
+    assert tokensToString(mat) == "[1.0 + x,2.0] + [1.0,y + z^(2.0)]"
+
+
+def test_tokensToLatex():
+
+    # Matrix token to latex
+    mat = getTokens("[1+x, 2; \
+                      3  , 4]")
+    assert tokensToLatex([mat]) == "\\begin{bmatrix}{1.0}+{x}&{2.0}\\\\{3.0}&{4.0}\\end{bmatrix}"
+
+    mat = getTokens("[1+x, 2] + [1, y + z^2]")
+    assert tokensToLatex(mat) == "\\begin{bmatrix}{1.0}+{x}&{2.0}\\end{bmatrix}+\\begin{bmatrix}{1.0}&{y}+{z}^{2.0}\\end{bmatrix}"
+
+
+###############
+# io.tokenize #
+###############
+
+
+def test_getTerms():
+
+    assert getTerms("1 + 2 * 3 - sqrt(2) / 5") == ['1', '+', '2', '*', '3', '-', 'sqrt', '(', '2', ')', '/', '5']
+    assert getTerms("x + x^2*y + y^2 + y/z = -z") == ['x', '+', 'x', '^', '2', '*', 'y', '+', 'y', '^', '2', '+', 'y', '/', 'z', '=', '-', 'z']
+
+    assert getTerms("sin^2(x) + cos^2(x) = 1") == ['sin', '^', '2', '(', 'x', ')', '+', 'cos', '^', '2', '(', 'x', ')', '=', '1']
+    assert getTerms("1 + tan^2(x) = sec^2(x)") == ['1', '+', 'tan', '^', '2', '(', 'x', ')', '=', 'sec', '^', '2', '(', 'x', ')']
+    assert getTerms("1 + cot^2(x) = csc^2(x)") == ['1', '+', 'cot', '^', '2', '(', 'x', ')', '=', 'csc', '^', '2', '(', 'x', ')']
+
+    assert getTerms("cosh^2(x)-sinh^2(x)=1") == ['cosh', '^', '2', '(', 'x', ')', '-', 'sinh', '^', '2', '(', 'x', ')', '=', '1']
+    assert getTerms("1 - tanh^2(x) = sech^2(x)") == ['1', '-', 'tanh', '^', '2', '(', 'x', ')', '=', 'sech', '^', '2', '(', 'x', ')']
+    assert getTerms("coth^2(x)-csch^2(x)=1") == ['coth', '^', '2', '(', 'x', ')', '-', 'csch', '^', '2', '(', 'x', ')', '=', '1']
+
+    assert getTerms("e = 2.71828") == ['exp', '=', '2.71828']
+    assert getTerms("log_10(100) = 2") == ['log_', '10', '(', '100', ')', '=', '2']
+    assert getTerms("ln(e) = 1") == ['ln', '(', 'exp', ')', '=', '1']
+    assert getTerms("e^(i*pi)=1") == ['exp', '^', '(', 'iota', '*', 'pi', ')', '=', '1']
+
+    assert getTerms("a = b") == ['a', '=', 'b']
+    assert getTerms("a < b") == ['a', '<', 'b']
+    assert getTerms("a > b") == ['a', '>', 'b']
+    assert getTerms("a <= b") == ['a', '<=', 'b']
+    assert getTerms("a >= b") == ['a', '>=', 'b']
+
+    assert getTerms("[1,0;0,1]") == ['[', '1', ',', '0', ';', '0', ',', '1', ']']
+    assert getTerms("2*[2,3;2,3]+[1,2;1,2]") == ['2', '*', '[', '2', ',', '3', ';', '2', ',', '3', ']', '+', '[', '1', ',', '2', ';', '1', ',', '2', ']']
+
+    assert getTerms(r"$\frac {3}{x}-\frac{x}{y}$") == ['$', 'frac', '{', '3', '}', '{', 'x', '}', '-', 'frac', '{', 'x', '}', '{', 'y', '}', '$']
+
+
+def test_normalize():
+
+    assert normalize(['$', 'frac', '{', '3', '}', '{', 'x', '}', '-', 'frac', '{', 'x', '}', '{', 'y', '}', '$']) == ['$', '3', '/', 'x', '-', 'x', '/', 'y', '$']

data/tests/test_matrix.py

@@ -0,0 +1,409 @@
+from visma.matrix.checks import isMatrix, dimCheck, multiplyCheck, isEqual
+from visma.matrix.operations import simplifyMatrix, addMatrix, subMatrix, scalarAdd, scalarSub, scalarMult, scalarDiv, gauss_elim, row_echelon
+from visma.matrix.structure import DiagMat, IdenMat
+from visma.functions.constant import Constant
+from tests.tester import getTokens
+from visma.io.parser import tokensToString
+
+
+####################
+# matrix.structure #
+####################
+
+
+def test_strMatrix():
+
+    mat = getTokens("[1+x, 2; \
+                      3  , 4]")
+    assert mat.__str__() == "[{1.0}+{x},{2.0};{3.0},{4.0}]"
+
+
+def test_traceMat():
+
+    mat = getTokens("[1, 2, 3; \
+                      3, 4, 7; \
+                      4, 6, 9]")
+    mat.isSquare()
+    trace = mat.traceMat()
+    assert tokensToString(trace) == "14.0"
+
+    mat = getTokens("[7, 5; \
+                      2, 0]")
+    mat.isSquare()
+    trace = mat.traceMat()
+    assert tokensToString(trace) == "7.0"
+
+
+def test_isSquare():
+
+    mat = getTokens("[1, 0, 3; \
+                      2, 1, 2]")
+    assert not mat.isSquare()
+
+    mat = getTokens("[1, 2; \
+                      x, z]")
+    assert mat.isSquare()
+
+    mat = getTokens("[1, 2; \
+                      1, 3; \
+                      1, 4]")
+    assert not mat.isSquare()
+
+
+def test_transposeMat():
+    mat = getTokens("[1, 3; \
+                      2, 6]")
+    matTranspose = mat.transposeMat()
+    assert matTranspose.__str__() == "[{1.0},{2.0};{3.0},{6.0}]"
+
+    mat = getTokens("[5,8,2;\
+                      12,30,9;\
+                      4,17,7]")
+    matTranspose = mat.transposeMat()
+    assert matTranspose.__str__() == "[{5.0},{12.0},{4.0};{8.0},{30.0},{17.0};{2.0},{9.0},{7.0}]"
+
+    mat = getTokens("[5,8,2;\
+                      2,3,4]")
+    matTranspose = mat.transposeMat()
+    assert matTranspose.__str__() == "[{5.0},{2.0};{8.0},{3.0};{2.0},{4.0}]"
+
+    mat = getTokens("[1, 2; \
+                    3,  4]")
+    matTranspose = mat.transposeMat()
+    assert matTranspose.__str__() == "[{1.0},{3.0};{2.0},{4.0}]"
+
+
+def test_isDiagonal():
+
+    mat = getTokens("[1, 0; \
+                      0, z]")
+    assert mat.isDiagonal()
+
+    mat = getTokens("[1+x, 0+y; \
+                      0, z]")
+    assert not mat.isDiagonal()
+
+    mat = getTokens("[1, 2; \
+                      1, 3; \
+                      1, 4]")
+    assert not mat.isDiagonal()
+
+    mat = DiagMat([3, 3], [[Constant(1)], [Constant(5)], [Constant(2)]])
+    assert mat.isDiagonal()
+
+    mat = IdenMat([2, 2])
+    assert mat.isDiagonal()
+
+
+def test_isIdentity():
+
+    mat = getTokens("[1, 0; \
+                      0, 1]")
+    assert mat.isIdentity()
+
+    mat = getTokens("[1+x, 0+y; \
+                      0, 1]")
+    assert not mat.isIdentity()
+
+    mat = getTokens("[1, 2; \
+                      1, 3; \
+                      1, 4]")
+    assert not mat.isIdentity()
+
+
+#################
+# matrix.checks #
+#################
+
+
+def test_isMatrix():
+
+    mat = getTokens("[1, 2, 3; \
+                      x, z, 3]")
+    assert isMatrix(mat)
+
+    mat = getTokens("[1, 2; \
+                      1, 3; \
+                      1]")
+    assert mat == []  # not a matrix; returns empty matrix
+
+
+def test_dimCheck():
+
+    matA = getTokens("[2, x; \
+                       3, y]")
+    matB = getTokens("[1, 2, x; \
+                       2, 3, y]")
+    assert not dimCheck(matA, matB)
+
+    matA = getTokens("[2, x; \
+                       3, y]")
+    matB = getTokens("[1, 2; \
+                       2, 3]")
+    assert dimCheck(matA, matB)
+
+
+def test_multiplyCheck():
+
+    matA = getTokens("[2, x; \
+                       3, y; \
+                       3, y]")
+    matB = getTokens("[2, x; \
+                       3, y]")
+    assert multiplyCheck(matA, matB)
+
+    matA = getTokens("[2, x, 1; \
+                       3, y, z]")
+    matB = getTokens("[1, 2; 2, 3]")
+    assert not multiplyCheck(matA, matB)
+
+
+def test_isEqual():
+
+    matA = getTokens("[1, 2; \
+                      x, z]")
+    matB = getTokens("[1, 2; \
+                      x, z]")
+
+    assert isEqual(matA, matB)
+
+    matA = getTokens("[2, x, 1; \
+                       3, y, z]")
+    matB = getTokens("[1, 2; 2, 3]")
+    assert not isEqual(matA, matB)
+
+
+#####################
+# matrix.operations #
+#####################
+
+
+def test_simplifyMatrix():
+
+    mat = getTokens("[x + y + x, x^2 + x^2; \
+                      1 + 4/2  , z^3/z^2  ]")
+    matRes = simplifyMatrix(mat)
+    assert matRes.__str__() == "[2{x}+{y},2{x}^{2.0};{3.0},{z}]"
+
+    mat = getTokens("[1 + x^2 + 2]")
+    matRes = simplifyMatrix(mat)
+    assert matRes.__str__() == "[{3.0}+{x}^{2.0}]"
+
+
+def test_addMatrix():
+
+    matA = getTokens("[2x + y, 2x]")
+    matB = getTokens("[-x, -x]")
+    matSum = addMatrix(matA, matB)
+    # assert matSum.__str__() == "[2{x}+{y}]"  # BUG: Strange simplification for matSum
+
+    matA = getTokens("[ x      , x^2; \
+                        3 + x^2, xy ]")
+    matB = getTokens("[ y + 1  , x^2; \
+                        2 - x^2, xy - 1 ]")
+    matSum = addMatrix(matA, matB)
+    assert matSum.__str__() == "[{x}+{y}+{1.0},2{x}^{2.0};{5.0},2{x}{y}-{1.0}]"
+
+
+def test_subMatrix():
+
+    matA = getTokens("[y, 2x]")
+    matB = getTokens("[-x, -x]")
+    matSub = subMatrix(matA, matB)
+    assert matSub.__str__() == "[{y}--1.0{x},3.0{x}]"
+
+
+def test_scalarAddMatrix():
+
+    mat = getTokens("[1, 2; \
+                    2,  1]")
+    const = 2
+    matSum = scalarAdd(const, mat)
+    assert matSum.__str__() == "[{3.0},{2.0};{2.0},{3.0}]"
+
+    mat = getTokens("[1, 2, 3;\
+                        4, 5, 6;\
+                        7, 8, 9]")
+    const = 3
+    matSum = scalarAdd(const, mat)
+    assert matSum.__str__() == "[{4.0},{2.0},{3.0};{4.0},{8.0},{6.0};{7.0},{8.0},{12.0}]"
+
+
+def test_scalarSubMatrix():
+
+    mat = getTokens("[8,6;\
+                      1,9]")
+    const = 2
+    matSub = scalarSub(const, mat)
+    assert matSub.__str__() == "[{6.0},{6.0};{1.0},{7.0}]"
+
+    mat = getTokens("[5,8,2;\
+                      12,30,9;\
+                      4,17,7]")
+    const = 10
+    matSub = scalarSub(const, mat)
+    assert matSub.__str__() == "[{-5.0},{8.0},{2.0};{12.0},{20.0},{9.0};{4.0},{17.0},{-3.0}]"
+
+
+def test_scalarMultMatrix():
+
+    mat = getTokens("[1, 2]")
+    const = 2
+    matSum = scalarMult(const, mat)
+    assert matSum.__str__() == "[{2.0},{4.0}]"
+
+    mat = getTokens("[2,4;\
+                      -5,7]")
+    const = 2
+    matSum = scalarMult(const, mat)
+    assert matSum.__str__() == "[{4.0},{8.0};{-10.0},{14.0}]"
+
+
+def test_scalarDivMatrix():
+
+    mat = getTokens("[4, 2]")
+    const = 2
+    matSum = scalarDiv(const, mat)
+    assert matSum.__str__() == "[{2.0},{1.0}]"
+
+    mat = getTokens("[48,36;\
+                      24,-3]")
+    const = 6
+    matSum = scalarDiv(const, mat)
+    assert matSum.__str__() == "[{8.0},{6.0};{4.0},{-0.5}]"
+
+
+def test_multiplyMatrix():
+    """
+    # FIXME: Fixing addition fixes multiplication
+    matA = getTokens("[1, 0; 0, 1]")
+    matB = getTokens("[2; 3]")
+    matPro = multiplyMatrix(matA, matB)
+    # assert matPro.__str__() == ""
+
+    matA = getTokens("[1, 2; x, 2; 3, y]")
+    matB = getTokens("[2, x; 3, y]")
+    matPro = multiplyMatrix(matA, matB)
+    # assert matPro.__str__() == ""
+
+    matA = getTokens("[2, x, 1; \
+                       3, y, z]")
+    matB = getTokens("[1, 2; 2, 3; 5, 6]")
+    matPro = multiplyMatrix(matA, matB)
+    # assert matPro.__str__() == ""
+    """
+    pass
+
+
+def test_determinant():
+    mat = getTokens('[1,2;3,4]')
+    if mat.isSquare():
+        a = ''
+        for i in mat.determinant():
+            a += i.__str__()
+        assert a == "{-2.0}"
+    mat = getTokens('[1,2,3;4,5,6;7,8,9]')
+    if mat.isSquare():
+        a = ''
+        for i in mat.determinant():
+            a += i.__str__()
+        assert a == "{0}"
+    mat = getTokens('[1]')
+    if mat.isSquare():
+        a = ''
+        for i in mat.determinant():
+            a += i.__str__()
+        assert a == "{1.0}"
+
+
+def test_inverse():
+    mat = getTokens("[5, 7, 9;\
+                    4, 3, 8;\
+                    7, 5, 6]")
+    if mat.isSquare():
+        assert mat.inverse().__str__() == "[{-0.20977011494252873},{0.028735632183908046},{0.27586206896551724};{0.3023255813953489},{-0.3139534883720931},{-0.03779069767441861};{-0.009111617312072894},{0.22779043280182235},{-0.12300683371298407}]"
+
+    mat = getTokens("[4, 5;\
+                    7, 3]")
+    if mat.isSquare():
+        assert mat.inverse().__str__() == "[{-0.1301859799713877},{0.21745350500715305};{0.303951367781155},{-0.17325227963525833}]"
+
+    mat = getTokens("[4, 5, 6, 8;\
+                    3, 25, 4, 6;\
+                    5, 1, 8, 4;\
+                    1, 3, 5, 8]")
+    if mat.isSquare():
+        assert mat.inverse().__str__() == "[{0.49400000000000005},{-0.044000000000000004},{-0.08600000000000001},{-0.42400000000000004};{-0.057142857142857134},{0.049999999999999996},{0.014285714285714284},{0.0047619047619047615};{-0.40131578947368424},{0.03947368421052632},{0.25},{0.2565789473684211};{0.21321177223288548},{-0.03854766474728087},{-0.15067178502879078},{0.01599488163787588}]"
+
+    mat = getTokens("[1,1;1,1]")
+    if mat.isSquare():
+        assert mat.inverse().__str__() == "-1"
+
+
+def test_cofactor():
+    mat = getTokens('[1,2;3,4]')
+    if mat.isSquare():
+        assert str(mat.cofactor()) == '[{4.0},{-3.0};{-2.0},{1.0}]'
+    mat = getTokens('[1,2,3;0,4,5;1,0,6]')
+    if mat.isSquare():
+        assert str(mat.cofactor()) == '[{24.0},{5.0},{-4.0};{-12.0},{3.0},{2.0};{-2.0},{-5.0},{4.0}]'
+    mat = getTokens('[1,2,3,4;5,6,7,8;9,10,11,12;13,14,15,16]')
+    if mat.isSquare():
+        assert str(mat.cofactor()) == '[{0},{0},{0},{0};{0},{0},{0},{0};{0},{0},{0},{0};{0},{0},{0},{0}]'
+
+
+def test_echelon():
+    mat = getTokens("[1, 4, 2;\
+                      5, 7, 6;\
+                      2, 4, 9]")
+    assert row_echelon(mat).__str__() == "[{1.0},{4.0},{2.0};{0.0},{-13.0},{-4.0};{0.0},{0.0},{6.24}]"
+
+    mat = getTokens("[1, 2, 3, 1;\
+                      4, 5, 6, 1;\
+                      7, 8, 9, 2]")
+    assert row_echelon(mat).__str__() == "[{1.0},{2.0},{3.0},{1.0};{0.0},{-3.0},{-6.0},{-3.0};{0.0},{0.0},{0.0},{1.0}]"
+
+    mat = getTokens("[1, 2, 3, 1;\
+                      4, 5, 6, 1;\
+                      7, 8, 9, 1;\
+                      2, 3 ,1 ,4]")
+    assert row_echelon(mat).__str__() == "[{1.0},{2.0},{3.0},{1.0};{0.0},{-3.0},{-6.0},{-3.0};{0.0},{0.0},{-3.02},{2.99};{0.0},{0.0},{0.0},{0.0}]"
+
+    mat = getTokens("[6,2,8,26;\
+                      3,5,2,8;\
+                      0,8,2,-7]")
+    assert row_echelon(mat).__str__() == "[{6.0},{2.0},{8.0},{26.0};{0.0},{4.0},{-2.0},{-5.0};{0.0},{0.0},{6.0},{3.0}]"
+
+
+def test_multi_variable_solve():
+    mat = getTokens("[1, 2, 3, 1;\
+                      4, 5, 6, 1;\
+                      7, 8, 2, 2]")
+    assert gauss_elim(mat).__str__() == "[{-1.14};{1.2799999999999998};{-0.14285714285714285}]"
+
+    mat = getTokens("[6,2,8,26;\
+                      3,5,2,8;\
+                      0,8,2,-7]")
+    assert gauss_elim(mat).__str__() == "[{4.0};{-1.0};{0.5}]"
+
+#######################
+# Operator Overloading
+#######################
+
+
+def test_addoverload():
+
+    matA = getTokens("[ x      , x^2; \
+                        3 + x^2, xy ]")
+    matB = getTokens("[ y + 1  , x^2; \
+                        2 - x^2, xy - 1 ]")
+    matSum = matA + matB
+    assert matSum.__str__() == "[{x}+{y}+{1.0},2{x}^{2.0};{5.0},2{x}{y}-{1.0}]"
+
+
+def test_suboverload():
+
+    matA = getTokens("[y, 2x]")
+    matB = getTokens("[-x, -x]")
+    matSub = matA - matB
+    assert matSub.__str__() == "[{y}--1.0{x},3.0{x}]"

data/tests/test_simplify.py

@@ -0,0 +1,110 @@
+from visma.simplify.simplify import simplify, simplifyEquation
+from visma.simplify.addsub import addition, additionEquation, subtraction, subtractionEquation
+from visma.simplify.muldiv import multiplication, division
+from tests.tester import quickTest
+
+#####################
+# simplify.simplify #
+#####################
+
+
+def test_simplify():
+
+    assert quickTest("1 + 2 - 3", simplify) == "0"
+    assert quickTest("1 + 2 - 4", simplify) == "-1.0"
+    assert quickTest("0 + 0 + 1", simplify) == "1.0"
+    assert quickTest("0 + 0 + xyz", simplify) == "xyz"
+
+    assert quickTest("(2 + 3) * (4 + 5) * (6 + 7)", simplify) == "585.0"
+    assert quickTest("3 * (3 * (3 * ( 3 * 3)))", simplify) == "243.0"
+    assert quickTest("3 + (3 + (3 * 1))", simplify) == "9.0"
+    assert quickTest("3 - (1 - 3 - (1 + 2))", simplify) == "8.0"
+
+    assert quickTest("3*2 + 4*2 - 3*4", simplify) == "2.0"
+    assert quickTest("3*x + 4*x - 2*y", simplify) == "7.0x-2.0y"
+    assert quickTest("x*y + x*x + x*x^2 + x^2*x + x*y^2 + x^2*y", simplify) == "xy+x^(2)+2x^(3.0)+xy^(2.0)+x^(2.0)y"
+
+    assert quickTest("3/2 + 4/2 - 2/4", simplify) == "3.0"
+    assert quickTest("x/5 + x/4 - 2/y", simplify) == "0.45x-2.0y^(-1)"
+    assert quickTest("x/y + x/x + x/x^2 + x^2/x + x/y^2 + x^2/y + x + 1", simplify) == "xy^(-1)+x^(-1.0)+xy^(-2.0)+x^(2.0)y^(-1)+2.0x+2.0"
+
+    assert quickTest("1 + 2 = 3", simplifyEquation) == "=0"  # FIXME: Vanishing zero
+    assert quickTest("1 + 2 = 4", simplifyEquation) == "-1.0=0"
+
+    assert quickTest("3*2 + 4*2 = 3*4", simplifyEquation) == "2.0=0"
+    assert quickTest("3*x = 4*x + 2*y", simplifyEquation) == "-x-2.0y=0"
+    assert quickTest("1 - 1 = 3*x + 4*x + 2*y", simplifyEquation) == "7.0x+2.0y=0"
+
+    assert quickTest("x = y --1 --x^2", simplifyEquation) == "x-y-1.0-x^(2.0)=0"  # FIXME: Valid but silly input case
+
+    assert quickTest("4 = 3x - 4x - 1 + 2", simplifyEquation) == "3.0+x=0"
+    assert quickTest("z = x^2 - x + 1 - 2", simplifyEquation) == "z-x^(2.0)+x+1.0=0"
+    assert quickTest("x = -1 + 2", simplifyEquation) == "x+1.0-2.0=0"  # FIXME: Further simplification required (simplification in RHS)
+    assert quickTest("x*y + x*x + x*x^2 = x^2*x + x*y^2 + x^2*y", simplifyEquation) == "xy+x^(2)-xy^(2.0)-x^(2.0)y=0"
+
+    assert quickTest("3/2 + 4/2 = 2/4", simplifyEquation) == "3.0=0"
+    assert quickTest("x/5 + x/4 = 2/y", simplifyEquation) == "0.45x-2.0y^(-1)=0"
+    assert quickTest("x/y + x/x + x/x^2 + x^2/x = x/y^2 + x^2/y + x - 1", simplifyEquation) == "xy^(-1)+2.0+x^(-1.0)-xy^(-2.0)-x^(2.0)y^(-1)=0"
+
+    # Tests regarding Expression used in equations
+    assert quickTest("(1 + 2) = ( 3 + 44)", simplifyEquation) == "-44.0=0"
+    assert quickTest("x = -1 * (z + 10)", simplifyEquation) == "x+z+10.0=0"
+    assert quickTest("x = 2*(z + q)", simplifyEquation) == "x-2.0z-2.0q=0"
+
+    # Tests regarding Expression Simplifications
+    assert quickTest("(x + 1) * (x + 1) * (x + 1)", simplify) == "x^(3.0)+3x^(2.0)+3x+1.0"
+    assert quickTest("(x + 1) * (x - 1) + (x + 2)", simplify) == "x^(2.0)+1.0+x"
+    assert quickTest("(x + 1) + (x - 1)", simplify) == "2x"
+    assert quickTest("(x + 1) * (x * (1 + x))", simplify) == "2x^(2.0)+x^(3.0)+x"
+    assert quickTest("(x + 1) * (x - 1) + (100 + 1)", simplify) == "x^(2.0)+100.0"
+    assert quickTest("((x + 1) * (x - 1) + (100 + 1))", simplify) == "x^(2.0)+100.0"
+    #  assert quickTest("-1 * (- x - 1)", simplify) == "x--1"   FIXME: case should have a probably fix with the overlaoding of Constant Function
+
+    # Tests regarding Exponents & Expressions
+    assert quickTest("(x + 1)^3", simplify) == "x^(3.0)+3x^(2.0)+3x+1.0"
+    assert quickTest("(x + 1)^2*x", simplify) == "x^(3.0)+2x^(2.0)+x"
+    assert quickTest("x*(x + 1)^2*x", simplify) == "x^(4.0)+2x^(3.0)+x^(2.0)"
+    assert quickTest("(x+1)^2*(x + 2)^3*x", simplify) == "x^(6.0)+8.0x^(5.0)+25.0x^(4.0)+38.0x^(3.0)+28.0x^(2.0)+8.0x"
+    assert quickTest("(x + 1)^(1 + 1)*x", simplify) == "x^(3.0)+2x^(2.0)+x"
+    assert quickTest("(x + 1)^(3 + 0 + 0)", simplify) == "x^(3.0)+3x^(2.0)+3x+1.0"
+
+    assert quickTest("3^(1 + 1)", simplify) == "9.0"
+    assert quickTest("2^(3/2) + 12", simplify) == "2.0^1.5+12.0"
+    assert quickTest("2^(4/2) + 12", simplify) == "16.0"
+    assert quickTest("(1 + 2)^(1 + 1)", simplify) == "9.0"
+    assert quickTest("(1 + 3)^(x) + (2 + 3)^(x)", simplify) == "4.0^x+5.0^x"
+    assert quickTest("(1 + 3)^(1/3) + (2 + 3)^(2/3)", simplify) == "4.0^0.33+5.0^0.67"
+
+
+def test_addsub():
+
+    assert quickTest("1 + 2", addition) == "3.0"
+    assert quickTest("x + 2x", addition) == "3.0x"
+    assert quickTest("xy^2 + 2xy^2", addition) == "3.0xy^(2.0)"
+    assert quickTest("-1 + 2", addition) == "1.0"
+    assert quickTest("-x + 2x", addition) == "x"
+    assert quickTest("-xy^2 + 3xy^2", addition) == "2.0xy^(2.0)"
+    assert quickTest("1 + 0", addition) == "1.0"
+    assert quickTest("1 + 2 + 3", addition) == "6.0"
+    assert quickTest("1 + 2 + x + 3x", addition) == "3.0+4.0x"
+
+    assert quickTest("1 + 2 = x + 3x", additionEquation) == "3.0=4.0x"
+    assert quickTest("y + 2 = -x + x", additionEquation) == "y+2.0=0"
+
+    assert quickTest("1 - 2", subtraction) == "-1.0"
+    assert quickTest("x - 2x", subtraction) == "-x"
+    assert quickTest("xy^2 - 3xy^2", subtraction) == "-2.0xy^(2.0)"
+
+    assert quickTest("1 - 2 = x - 3x", subtractionEquation) == "-1.0=-2.0x"
+    assert quickTest("y + 2 = -x - x", subtractionEquation) == "y+2.0=-2.0x"
+
+
+def test_muldiv():
+
+    assert quickTest("3*y + x*2", multiplication) == "3.0y+2.0x"
+    assert quickTest("x^3 * x^2", multiplication) == "x^(5.0)"
+    assert quickTest("x^(-1)y^2 * zx^2", multiplication) == "xy^(2.0)z"
+
+    assert quickTest("x^2 / x^2", division) == "1.0"
+    assert quickTest("x^2 / x^4", division) == "x^(-2.0)"
+    assert quickTest("x^(-1)y^2 / zx^2", division) == "x^(-3.0)y^(2.0)z^(-1)"

data/tests/test_solvers.py

@@ -0,0 +1,93 @@
+from visma.solvers.polynomial.roots import rootFinder
+from visma.solvers.simulEqn import simulSolver
+from visma.solvers.solve import solveFor
+from tests.tester import quickTest
+
+############################
+# solvers.polynomial.roots #
+############################
+
+
+def test_rootFinder():
+
+    #  Tests for Quadratic (2nd Degree) Equations
+    assert quickTest("x^2 + 2x + 1 = 0", rootFinder) == "(x+1.0)^(2)=0"
+    assert quickTest("x^2 + 2x = - 1", rootFinder) == "(x+1.0)^(2)=0"
+    assert quickTest("x^2 = - 2x - 1", rootFinder) == "(x+1.0)^(2)=0"
+    assert quickTest("0 = x^2 + 2x + 1", rootFinder) == "(x+1.0)^(2)=0"
+
+    assert quickTest("x^2 + 1 - 2x = 0", rootFinder) == "(x-1.0)^(2)=0"
+    assert quickTest("x^2 + 1 = 2x", rootFinder) == "(x-1.0)^(2)=0"
+    assert quickTest("x^2 = 2x - 1", rootFinder) == "(x-1.0)^(2)=0"
+    assert quickTest("-2x = - x^2 - 1", rootFinder) == "(x-1.0)^(2)=0"
+    # FIXME: assert quickTest("0 = 2x - x^2 - 1", rootFinder) == "(x-1.0)^(2)=0"
+    # assert quickTest("0 = 2x - x^2 - 1", rootFinder) == "(x-1.0)^(2)=0"
+
+    assert quickTest("2x^2 - 4x - 6 = 0", rootFinder) == "(x+1.0)*(x-3.0)=0"
+    assert quickTest("3x^2 + 7x + 1 = 0", rootFinder) == "(x+2.18)*(x+0.15)=0"
+    assert quickTest("3x^2 - 7x + 1 = 0", rootFinder) == "(x-0.15)*(x-2.18)=0"
+
+    assert quickTest("x^2 + x + 1 = 0", rootFinder) == "(x+0.5+0.87*sqrt[2](-1))*(x+0.5-0.87*sqrt[2](-1))=0"
+    assert quickTest("x^2 - x + 1 = 0", rootFinder) == "(x-0.5+0.87*sqrt[2](-1))*(x-0.5-0.87*sqrt[2](-1))=0"
+
+    # Tests for Cubic (3rd Degree) Equations
+    assert quickTest("2x^3 - 4x^2 - 22x + 24 = 0", rootFinder) == "(x-4.0)*(x+3.0)*(x-1.0)=0"
+    assert quickTest("x^3 + 6x^2 + 12x + 8 = 0", rootFinder) == "(x+2.0)^(3)=0"
+    assert quickTest("x^3 = 1", rootFinder) == "(x-1.0)*(x-(-0.5+0.87*sqrt[2](-1)))*(x-(-0.5-0.87*sqrt[2](-1)))=0"
+
+    # Tests for Quartic (4th Degree) Equations
+    assert quickTest("3x^4 + 6x^3 - 123x^2 - 126x + 1080 = 0", rootFinder) == "(x-5.0)*(x+4.0)*(x-3.0)*(x+6.0)=0"
+    assert quickTest("-20x^4 + 5x^3 + 17x^2 - 29x + 87 = 0", rootFinder) == "(x-1.49)*(x-(0.22+1.3*sqrt[2](-1)))*(x-(0.22-1.3*sqrt[2](-1)))*(x+1.69)=0"
+    assert quickTest("2x^4 + 4x^3 + 6x^2 + 8x + 10 = 0", rootFinder) == "(x-(0.28+1.42*sqrt[2](-1)))*(x-(-1.28+0.85*sqrt[2](-1)))*(x-(-1.28-0.85*sqrt[2](-1)))*(x-(0.28-1.42*sqrt[2](-1)))=0"
+
+###############################
+# solvers.simulEqn #
+###############################
+
+
+def test_simulSolvers():
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver, 'x') == "x=0.0"
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver, 'y') == "y=1.33"
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver, 'z') == "z=-0.0"
+
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'x') == "x=-0.0"
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'y') == "y=-1.0"
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'z') == "z=2.0"
+
+    assert quickTest("1x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'x') == "NoTrivialSolution"
+    assert quickTest("1x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'y') == "NoTrivialSolution"
+    assert quickTest("1x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver, 'z') == "NoTrivialSolution"
+
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver, 'a') == "a=0.0"
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver, 'y') == "y=1.33"
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver, 'w') == "w=-0.0"
+
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver, 'a') == "a=0.0"
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver, 'y') == "y=1.2"
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver, 'w') == "w=0.11"
+
+    # Tests for testing 'solve for all variable' option in case no variable is specified by user.
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 1100z = 12", simulSolver) == "z=-0.0;y=1.33;x=0.0"
+    assert quickTest("1000x + 2y + 3z = 4; 5x + 6y + 7z = 8; 9x + 10y + 11z = 12", simulSolver) == "z=2.0;y=-1.0;x=-0.0"
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 9a + 10y + 1100w = 12", simulSolver) == "y=1.33;w=-0.0;a=0.0"
+    assert quickTest("1000a + 2y + 3w = 4; 5a + 6y + 7w = 8; 10y = 12", simulSolver) == "y=1.2;w=0.11;a=0.0"
+
+#################
+# solvers.solve #
+#################
+
+
+def test_solveFor():
+
+    assert quickTest("x - 1 + 2 = 0", solveFor, 'x') == "x=(-1.0)"
+    assert quickTest("1 + y^2 = 0", solveFor, 'y') == "y=(-1.0)^(0.5)"
+    assert quickTest("x^2 - 1 = 0", solveFor, 'x') == "x=(1.0)^(0.5)"
+
+    assert quickTest("x - yz + 1= 0", solveFor, 'x') == "x=(-1.0+yz)"
+    assert quickTest("x - 2yz + 1= 0", solveFor, 'y') == "y=-0.5*((-1.0-x)/z)"
+    assert quickTest("x - 5yz + 1= 0", solveFor, 'z') == "z=-0.2*((-1.0-x)/y)"
+
+    assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'w') == "w=(-x^(2.0)-yz^(3.0)+1.0)"
+    assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'x') == "x=(-w-yz^(3.0)+1.0)^(0.5)"
+    assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'y') == "y=((-w-x^(2.0)+1.0)/z^(3.0))"
+    assert quickTest("w + x^2 + yz^3 = 1", solveFor, 'z') == "z=((-w-x^(2.0)+1.0)/y)^(0.3333333333333333)"

data/tests/test_transform.py

@@ -0,0 +1,51 @@
+from visma.transform.factorization import factorize
+from visma.transform.substitution import substitute
+from visma.io.parser import tokensToString
+from visma.functions.structure import Expression
+from tests.tester import quickTest, getTokens
+
+###########################
+# transform.factorization #
+###########################
+
+
+def test_factorize():
+    assert quickTest("x", factorize) == "x"
+    assert quickTest("x^2 + 2x + 1", factorize) == "(x+1.0)*(x+1.0)"
+    assert quickTest("2x^2 - 4x + 2", factorize) == "2.0*(x-1.0)*(x-1.0)"
+    assert quickTest("x^4 - 1", factorize) == "(x+1.0)*(x-1.0)*(x^(2)+1.0)"
+    assert quickTest("1 - x^3", factorize) == "(x-1.0)*(-x^(2)-x-1.0)"
+    assert quickTest("x^4 - 5x^2 + 4", factorize) == "(x+2.0)*(x+1.0)*(x-1.0)*(x-2.0)"
+
+
+##########################
+# transform.substitution #
+##########################
+
+
+def test_substitute():
+
+    init_tok = getTokens("x")
+    subs_tok = getTokens("2")
+    tok_list = getTokens("3zx^2 + x^3 + 5x")
+    assert tokensToString(substitute(init_tok, subs_tok, tok_list)) == "12.0z + 8.0 + 10.0"
+
+    init_tok = getTokens("2x")
+    subs_tok = getTokens("4yz^2")
+    tok_list = getTokens("3 + 2x + zx^4 + 3xyz")
+    assert tokensToString(substitute(init_tok, subs_tok, tok_list)) == "3.0 + 4.0yz^(2.0) + 16.0z^(9.0)y^(4.0) + 6.0y^(2.0)z^(3.0)"
+
+    init_tok = getTokens("4x^2")
+    subs_tok = getTokens("9yz")
+    tok_list = getTokens("2x + zx^3 + 3xyz")
+    assert tokensToString(substitute(init_tok, subs_tok, tok_list)) == "3.0y^(0.5)z^(0.5) + 3.375z^(2.5)y^(1.5) + 4.5y^(1.5)z^(1.5)"
+
+    init_tok = getTokens("2xy^3")
+    subs_tok = getTokens("4z")
+    tok_list = getTokens("3 + 2xy^3 + z + 3x^(2)y^(6)z")
+    assert tokensToString(substitute(init_tok, subs_tok, tok_list)) == "3.0 + 4.0z + z + 12.0z^(3.0)"
+
+    init_tok = getTokens("5x")
+    subs_tok = Expression(getTokens("y + 2"))
+    tok_list = getTokens("3 + 4x + 2xy^3 + 3x^(2)y^(3)z")
+    assert tokensToString(substitute(init_tok, subs_tok, tok_list)) == "3.0 + 0.8*(y + 2.0) + (0.4y^(3.0) * (y + 2.0)) + (0.12y^(3.0)z * (y + 2.0)^(2.0))"

data/tests/test_utils.py

@@ -0,0 +1,29 @@
+from visma.utils.integers import gcd, factors
+from visma.utils.polynomials import syntheticDivision
+
+##################
+# utils.integers #
+##################
+
+
+def test_gcd():
+    assert gcd([1]) == 1
+    assert gcd([3, 6, 12, 24]) == 3
+    assert gcd([-2, 4, 8]) == -2
+    assert gcd([2, -4, 8]) == 2
+
+
+def test_factors():
+    assert factors(24) == [1, 2, 3, 4, 6, 8, 12, 24]
+    assert factors(0.5) == []  # Invalid input
+
+
+#####################
+# utils.polynomials #
+#####################
+
+def test_syntheticDivision():
+    assert syntheticDivision([1, 2, 1], -1) == ([1.0, 1.0], 0.0)
+    # (x^2 + 2x + 1)/(x+1)
+    assert syntheticDivision([3, 2, 1, 3], 2) == ([3.0, 8.0, 17.0], 37.0)
+    # (3x^2 + 2x + x + 3)/(x-2)

data/tests/tester.py

@@ -0,0 +1,48 @@
+from visma.io.tokenize import tokenizer, getLHSandRHS, removeSpaces
+from visma.io.checks import checkTypes
+from visma.discreteMaths.statistics import sampleSpace
+
+
+# TODO: Categorize all test cases into COVERAGE and BASIS
+def quickTest(inp, operation, wrtVar=None):
+    if operation.__name__ not in ['ArithemeticMean', 'Mode', 'Median']:
+        if (inp.count(';') == 2):
+            afterSplit = inp.split(';')
+            eqStr1 = afterSplit[0]
+            eqStr2 = afterSplit[1]
+            eqStr3 = afterSplit[2]
+            tokens = [tokenizer(eqStr1), tokenizer(eqStr2), tokenizer(eqStr3)]
+            token_string, _, _ = operation(tokens[0], tokens[1], tokens[2], wrtVar)
+            return removeSpaces(token_string)
+        elif (inp.count(';') == 1):
+            afterSplit = inp.split(';')
+            eqStr1 = afterSplit[0]
+            eqStr2 = afterSplit[1]
+            tokens = [tokenizer(eqStr1), tokenizer(eqStr2)]
+            _, _, token_string, _, _ = operation(tokens[0], tokens[1])
+            return removeSpaces(token_string)
+        else:
+            lhs, rhs = getLHSandRHS(tokenizer(inp))
+            _, inpType = checkTypes(lhs, rhs)
+            if inpType == "equation":
+                if wrtVar is not None:
+                    _, _, _, token_string, _, _ = operation(lhs, rhs, wrtVar)
+                else:
+                    _, _, _, token_string, _, _ = operation(lhs, rhs)
+            elif inpType == "expression":
+                if wrtVar is not None:
+                    _, _, token_string, _, _ = operation(lhs, wrtVar)
+                else:
+                    _, _, token_string, _, _ = operation(lhs)
+    else:
+        sampleSpaceObject = sampleSpace(inp)
+        token_string, _, _ = operation(sampleSpaceObject)
+    output = removeSpaces(token_string)
+    return output
+
+
+def getTokens(eqString):
+    tokens = tokenizer(eqString)
+    if len(tokens) == 1:
+        tokens = tokens[0]
+    return tokens

data/visma/calculus/differentiation.py

@@ -0,0 +1,107 @@
+import copy
+
+from visma.functions.structure import Function, Expression
+from visma.functions.constant import Constant, Zero
+from visma.functions.operator import Operator, Multiply, Plus
+from visma.simplify.simplify import simplify
+from visma.functions.variable import Variable
+from visma.functions.exponential import Logarithm, Exponential
+from visma.functions.trigonometry import Trigonometric
+from visma.io.parser import tokensToString
+
+###################
+# Differentiation #
+###################
+
+
+def differentiate(tokens, wrtVar):
+    """Simplifies and then differentiates given tokens wrt given variable
+
+    Arguments:
+        tokens {list} -- list of function tokens
+        wrtVar {string} -- with respect to variable
+
+    Returns:
+        tokens {list} -- list of differentiated tokens
+        availableOperations {list} -- list of operations
+        token_string {string} -- output equation string
+        animation {list} -- equation tokens for step-by-step
+        comments {list} -- comments for step-by-step
+    """
+    animation = []
+    comments = []
+    tokens, availableOperations, token_string, animation, comments = simplify(tokens)
+    tokens, animNew, commentsNew = differentiateTokens(tokens, wrtVar)
+    animation.append(animNew)
+    comments.append(commentsNew)
+    tokens, availableOperations, token_string, animation2, comments2 = simplify(tokens)
+    animation2.pop(0)
+    comments2.pop(0)
+    animation.extend(animation2)
+    comments.extend(comments2)
+    return tokens, availableOperations, token_string, animation, comments
+
+
+def differentiateTokens(funclist, wrtVar):
+    """Differentiates given tokens wrt given variable
+
+    Arguments:
+        funclist {list} -- list of function tokens
+        wrtVar {string} -- with respect to variable
+
+    Returns:
+        diffFunc {list} -- list of differentiated tokens
+        animNew {list} -- equation tokens for step-by-step
+        commentsNew {list} -- comments for step-by-step
+    """
+    diffFunc = []
+    animNew = []
+    commentsNew = ["Differentiating with respect to " + r"$" + wrtVar + r"$" + "\n"]
+    for func in funclist:
+        if isinstance(func, Operator):
+            diffFunc.append(func)
+        else:
+            newExpression = Expression()
+            newfunc = []
+            while(isinstance(func, Function)):
+                commentsNew[0] += r"$" + "\\frac{d}{d" + wrtVar + "} ( " + func.__str__() + ")" + r"$"
+                funcCopy = copy.deepcopy(func)
+                if wrtVar in funcCopy.functionOf():
+                    if isinstance(funcCopy, Trigonometric) or isinstance(funcCopy, Logarithm) or isinstance(funcCopy, Variable) or isinstance(funcCopy, Exponential):
+                        funcCopy = funcCopy.differentiate(wrtVar)
+                        newfunc.append(funcCopy)
+                        commentsNew[0] += r"$" + r"= " + funcCopy.__str__() + r"\ ;\ " + r"$"
+                else:
+                    funcCopy = Zero()
+                    newfunc.append(funcCopy)
+                    commentsNew[0] += r"$" + r"= " + funcCopy.__str__() + r"\ ;\ " + r"$"
+                newfunc.append(Multiply())
+                if func.operand is None:
+                    break
+                else:
+                    func = func.operand
+                    if isinstance(func, Constant):
+                        diffFunc = Zero()
+                        break
+            newfunc.pop()
+            newExpression.tokens = newfunc
+            diffFunc.extend([newExpression])
+    animNew.extend(diffFunc)
+    return diffFunc, animNew, commentsNew
+
+
+def differentiationProductRule(tokens, wrtVar):
+    resultTokens = []
+    for i in range(0, len(tokens), 2):
+        currentDiff = Expression()
+        currentDiffTokens, _, _, _, _ = differentiate([tokens[i]], wrtVar)
+        currentDiff.tokens = currentDiffTokens
+        tempTokens = copy.deepcopy(tokens)
+        tempTokens[i] = currentDiff
+        resultTokens.extend(tempTokens)
+        resultTokens.append(Plus())
+    resultTokens.pop()
+    token_string = tokensToString(resultTokens)
+    # TODO: Make simplify module to simplify expressions involving Trigonometric Expressions (to some extent)
+    # resultTokens, _, token_string, _, _ = simplify(resultTokens)
+    return tokens, [], token_string, [], []

data/visma/calculus/integration.py

@@ -0,0 +1,105 @@
+import copy
+from visma.functions.constant import Constant
+from visma.functions.variable import Variable
+from visma.functions.operator import Operator, Binary
+from visma.simplify.simplify import simplify
+from visma.functions.trigonometry import Trigonometric
+from visma.calculus.differentiation import differentiate
+from visma.io.parser import tokensToString
+
+###############
+# Integration #
+###############
+
+
+def integrate(tokens, wrtVar):
+    """Simplifies and then integrates given tokens wrt given variable
+
+    Arguments:
+        tokens {list} -- list of function tokens
+        wrtVar {string} -- with respect to variable
+
+    Returns:
+        tokens {list} -- list of integrated tokens
+        availableOperations {list} -- list of operations
+        token_string {string} -- output equation string
+        animation {list} -- equation tokens for step-by-step
+        comments {list} -- comments for step-by-step
+    """
+
+    tokens, availableOperations, token_string, animation, comments = simplify(tokens)
+    tokens, animNew, commentsNew = (integrateTokens(tokens, wrtVar))
+    animation.append(animNew)
+    comments.append(commentsNew)
+    tokens, availableOperations, token_string, animation2, comments2 = simplify(tokens)
+    animation2.pop(0)
+    comments2.pop(0)
+    animation.extend(animation2)
+    comments.extend(comments2)
+    return tokens, availableOperations, token_string, animation, comments
+
+
+def integrateTokens(funclist, wrtVar):
+    """Integrates given tokens wrt given variable
+
+    Arguments:
+        funclist {list} -- list of function tokens
+        wrtVar {string} -- with respect to variable
+
+    Returns:
+        intFunc {list} -- list of integrated tokens
+        animNew {list} -- equation tokens for step-by-step
+        commentsNew {list} -- comments for step-by-step
+    """
+    intFunc = []
+    animNew = []
+    commentsNew = ["Integrating with respect to " + r"$" + wrtVar + r"$" + "\n"]
+    for func in funclist:
+        if isinstance(func, Operator):  # add isfunctionOf
+            intFunc.append(func)
+        else:
+            newfunc = []
+            commentsNew[0] += r"$" + r"\int \ " + r"( " + func.__str__() + ")" + r" d" + wrtVar + r"$"
+            funcCopy = copy.deepcopy(func)
+            if wrtVar in funcCopy.functionOf():
+                if isinstance(funcCopy, Variable):
+                    log = False
+                    funcCopy, log = funcCopy.integrate(wrtVar)
+                    if log:
+                        commentsNew[0] += r"$" + r"= " + funcCopy[0].__str__() + r"*" + funcCopy[2].__str__() + r"\ ;\ " + r"$"
+                        newfunc.extend(funcCopy)
+                    else:
+                        commentsNew[0] += r"$" + r"= " + funcCopy.__str__() + r"\ ;\ " + r"$"
+                        newfunc.append(funcCopy)
+                elif isinstance(funcCopy, Trigonometric):
+                    funcCopy = funcCopy.integrate(wrtVar)
+                    newfunc.append(funcCopy)
+                    commentsNew[0] += r"$" + r"= " + funcCopy.__str__() + r"\ ;\ " + r"$"
+            else:
+                if isinstance(funcCopy, Variable):
+                    funcCopy.value.append(wrtVar)
+                    funcCopy.power.append(1)
+                if isinstance(funcCopy, Constant):
+                    coeff = funcCopy.value
+                    funcCopy = Variable()
+                    funcCopy.coefficient = coeff
+                    funcCopy.value.append(wrtVar)
+                    funcCopy.power.append(1)
+                newfunc.append(funcCopy)
+                commentsNew[0] += r"$" + r"= " + funcCopy.__str__() + r"\ ;\ " + r"$"
+            intFunc.extend(newfunc)
+    animNew.extend(intFunc)
+    return intFunc, animNew, commentsNew
+
+
+def integrationByParts(tokens, wrtVar):
+    if (isinstance(tokens[1], Binary) and tokens[1].value == '*'):
+        u = tokens[0]
+        v = tokens[2]
+        vIntegral, _, _, _, _ = integrate(v, wrtVar)
+        uDerivative, _, _, _, _ = differentiate(u, wrtVar)
+        term1 = u * vIntegral
+        term2, _, _, _, _ = integrate(uDerivative * vIntegral, 'x')
+        resultToken = term1 - term2
+        token_string = tokensToString(resultToken)
+        return resultToken, [], token_string, [], []

data/visma/config/values.py

@@ -0,0 +1,11 @@
+import math
+
+# config
+ROUNDOFF = 2
+# FIXME: Make ROUNDOFF global
+INPUT_TYPE = "Greek"
+
+# constants
+PI = math.pi
+EXP = math.exp(1)
+IOTA = complex(0, 1)

data/visma/discreteMaths/boolean.py

@@ -0,0 +1,110 @@
+from visma.simplify.simplify import simplify
+from visma.functions.constant import Constant
+from visma.io.tokenize import tokenizer
+
+# TODO: Test cases.
+# TODO: Implement GUI/CLI.
+
+
+def logicalAND(token1, token2):
+    """Implements Bitwise AND
+    Arguments:
+        token1 -- {list} -- List of tokens of a constant number
+        token2 -- {list} -- List of tokens of a constant number
+
+    Returns:
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    """
+
+    comments = []
+    animations = []
+    token1, _, _, _, _ = simplify(token1)
+    token2, _, _, _, _ = simplify(token2)
+    if isinstance(token1, Constant) and isinstance(token2, Constant):
+        comments += [['Converting numbers to Binary Illustrations: ']]
+        animations += [[]]
+        binaryValue1 = token1.binary()
+        binaryValue2 = token2.binary()
+        comments += [[]]
+        animations += [[tokenizer('a = ' + str(binaryValue1))]]
+        comments += [[]]
+        animations += [[tokenizer('b = ' + str(binaryValue2))]]
+        comments += [['Doing AND operation for each of the consecutive bit']]
+        animations += [[]]
+        resultValue = token1.calculate() & token2.calculate()
+        comments += [['Final result is']]
+        animations += [[tokenizer('r = ' + str(resultValue))]]
+        token_string = 'r = ' + str(resultValue)
+        return token_string, animations, comments
+    else:
+        return '', [], []
+
+
+def logicalOR(token1, token2):
+    """Implements Bitwise OR
+    Arguments:
+        token1 -- {list} -- List of tokens of a constant number
+        token2 -- {list} -- List of tokens of a constant number
+
+    Returns:
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    """
+
+    comments = []
+    animations = []
+    token1, _, _, _, _ = simplify(token1)
+    token2, _, _, _, _ = simplify(token2)
+    if isinstance(token1, Constant) and isinstance(token2, Constant):
+        comments += [['Converting numbers to Binary Illustrations: ']]
+        animations += [[]]
+        binaryValue1 = token1.binary()
+        binaryValue2 = token2.binary()
+        comments += [[]]
+        animations += [[tokenizer('a = ' + str(binaryValue1))]]
+        comments += [[]]
+        animations += [[tokenizer('b = ' + str(binaryValue2))]]
+        comments += [['Doing OR operation for each of the consecutive bit']]
+        animations += [[]]
+        resultValue = token1.calculate() | token2.calculate()
+        comments += [['Final result is']]
+        animations += [[tokenizer('r = ' + str(resultValue))]]
+        token_string = 'r = ' + str(resultValue)
+        return token_string, animations, comments
+    else:
+        return '', [], []
+
+
+def logicalNOT(token1):
+    """Implements Bitwise NOT
+    Arguments:
+        token1 -- {list} -- List of tokens of a constant number
+
+    Returns:
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    """
+
+    comments = []
+    animations = []
+    token1, _, _, _, _ = simplify(token1)
+    if isinstance(token1, Constant):
+        comments += [['Converting numbers to Binary Illustrations: ']]
+        animations += [[]]
+        binaryValue1 = token1.binary()
+        comments += [[]]
+        animations += [[tokenizer('a = ' + str(binaryValue1))]]
+        resultValueBinary = bin((1 << 8) - 1 - int(binaryValue1, 2))
+        resultValue = int(resultValueBinary, 2)
+        comments += [['Final binary is']]
+        animations += [[tokenizer('r = ' + str(resultValueBinary))]]
+        comments += [['Final result is']]
+        animations += [[tokenizer('r = ' + str(resultValue))]]
+        token_string = 'r = ' + str(resultValue)
+        return token_string, animations, comments
+    else:
+        return '', [], []

data/visma/discreteMaths/combinatorics.py

@@ -0,0 +1,135 @@
+'''This module is supposed to contain all the combinatorics related stuff which can be performed by VisualMath (VisMa)
+
+Note: Please try to maintain proper documentation
+'''
+
+from visma.io.tokenize import tokenizer
+from visma.simplify.simplify import simplify
+from visma.io.parser import tokensToString
+from visma.functions.constant import Constant
+
+
+def factorial(tokens):
+    '''Used to get factorial of tokens provided
+
+    Argument:
+        tokens {list} -- list of tokens
+
+    Returns:
+        result {list} -- list of result tokens
+        {empty list}
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    '''
+    tokens, _, _, _, _ = simplify(tokens)
+    animation = []
+    comments = []
+    if (isinstance(tokens[0], Constant) & len(tokens) == 1):
+        value = int(tokens[0].calculate())
+        if value == 0:
+            result = [Constant(1)]
+            comments += [['Factorial of ZERO is defined to be 1']]
+            animation += [tokenizer('f = ' + str(1))]
+        else:
+            resultString = ''
+            for i in range(1, value + 1):
+                resultString += (str(i) + '*')
+            resultString = resultString[:-1]
+            resultTokens = tokenizer(resultString)
+            comments += [['Expanding the factorial as']]
+            animation += [resultTokens]
+            result, _, _, _, _ = simplify(resultTokens)
+        token_string = tokensToString(result)
+        comments += [['Hence result: ']]
+        animation += [tokenizer('f = ' + token_string)]
+    return result, [], token_string, animation, comments
+
+
+def permutation(nTokens, rTokens):
+    '''Used to get Permutation (nPr)
+
+    Argument:
+        nTokens {list} -- list of tokens of "n" in nPr
+        rTokens {list} -- list of tokens of "r" in nPr
+
+    Returns:
+        result {list} -- list of result tokens
+        {empty list}
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    '''
+    nTokens, _, _, _, _ = simplify(nTokens)
+    rTokens, _, _, _, _ = simplify(rTokens)
+    animation = []
+    comments = []
+    if (isinstance(nTokens[0], Constant) & len(nTokens) == 1) & (isinstance(rTokens[0], Constant) & len(rTokens) == 1):
+        comments += [['nCr is defined as (n!)/(r!)*(n-r)!']]
+        animation += [[]]
+        comments += [['Solving for n!']]
+        animation += [[]]
+        numerator, _, _, animNew1, commentNew1 = factorial(nTokens)
+        commentNew1[1] = ['(n)! is thus solved as: ']
+        animation.extend(animNew1)
+        comments.extend(commentNew1)
+        denominator = nTokens[0] - rTokens[0]
+        comments += [['Solving for (n - r)!']]
+        animation += [[]]
+        denominator, _, _, animNew2, commentNew2 = factorial([denominator])
+        commentNew2[1] = ['(n - r)! is thus solved as: ']
+        comments.extend(commentNew2)
+        animation.extend(animNew2)
+        result = [numerator[0] / denominator[0]]
+        comments += [['On placing values in (n!)/(n-r)!']]
+        animation += [tokenizer('r = ' + tokensToString(result))]
+    token_string = tokensToString(result)
+    return result, [], token_string, animation, comments
+
+
+def combination(nTokens, rTokens):
+    '''Used to get Combination (nCr)
+
+    Argument:
+        nTokens {list} -- list of tokens of "n" in nCr
+        rTokens {list} -- list of tokens of "r" in nCr
+
+    Returns:
+        result {list} -- list of result tokens
+        {empty list}
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    '''
+    nTokens, _, _, _, _ = simplify(nTokens)
+    rTokens, _, _, _, _ = simplify(rTokens)
+    animation = []
+    comments = []
+    if (isinstance(nTokens[0], Constant) & len(nTokens) == 1) & (isinstance(rTokens[0], Constant) & len(rTokens) == 1):
+        comments += [['nCr is defined as (n!)/(r!)*(n-r)!']]
+        animation += [[]]
+        comments += [['Solving for n!']]
+        animation += [[]]
+        numerator, _, _, animNew1, commentNew1 = factorial(nTokens)
+        commentNew1[1] = ['(n)! is thus solved as: ']
+        animation.extend(animNew1)
+        comments.extend(commentNew1)
+        denominator1 = nTokens[0] - rTokens[0]
+        comments += [['Solving for (n - r)!']]
+        animation += [[]]
+        denominator1, _, _, animNew2, commentNew2 = factorial([denominator1])
+        commentNew2[1] = ['(n - r)! is thus solved as: ']
+        comments.extend(commentNew2)
+        animation.extend(animNew2)
+        comments += [['Solving for r!']]
+        animation += [[]]
+        denominator2, _, _, animNew3, commentNew3 = factorial([rTokens[0]])
+        commentNew3[1] = ['r! is thus solved as: ']
+        comments.extend(commentNew3)
+        animation.extend(animNew3)
+        denominator = denominator1[0] * denominator2[0]
+        result = [numerator[0] / denominator]
+        comments += [['On placing values in (n!)/(r!)*(n-r)!']]
+        animation += [tokenizer('r = ' + tokensToString(result))]
+    token_string = tokensToString(result)
+    return result, [], token_string, animation, comments

data/visma/discreteMaths/probability.py

@@ -0,0 +1,35 @@
+from visma.io.tokenize import tokenizer
+
+
+def simpleProbability(sampleSpace, requiredEvent=None):
+    """Implements simple probability
+
+    Arguments:
+        sampleSpace -- {visma.discreteMaths.statistics.ArithemeticMean}
+        requiredEvent -- {Event whose probability is to be calculated}
+
+    Returns:
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    """
+
+    animations = []
+    comments = []
+    events = []
+    token_string = ''
+    if sampleSpace.values is not []:
+        events.extend(sampleSpace.values)
+        totalOccurances = len(events)
+        animations += [[]]
+        comments += [['The total occurances are ' + str(totalOccurances)]]
+        requiredOccurances = events.count(requiredEvent)
+        animations += [[]]
+        comments += [['The occurances of required event are ' + str(requiredOccurances)]]
+        probability = requiredOccurances/totalOccurances
+        comments += [['Hence, Required probability is: ']]
+        animations += [tokenizer('P = ' + str(probability))]
+        token_string = 'P = ' + str(probability)
+        return token_string, animations, comments
+    else:
+        return '', [], []

data/visma/discreteMaths/statistics.py

@@ -0,0 +1,111 @@
+from collections import Counter
+from visma.io.tokenize import tokenizer
+from visma.simplify.simplify import simplify
+from visma.io.parser import tokensToString
+from visma.functions.constant import Constant
+
+# TODO: Implement this module in GUI/CLI
+
+
+class sampleSpace(object):
+    """Class used to represent sample space of a data.
+    """
+    values = []
+    size = 0
+
+    def __init__(self, values):
+        if values is not None:
+            self.values = values
+            self.size = len(values)
+
+
+def ArithemeticMean(sampleSpace):
+    """Implements arithemetic mean
+
+    Arguments:
+        sampleSpace -- {visma.discreteMaths.statistics.ArithemeticMean}
+
+    Returns:
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    """
+    animations = []
+    comments = []
+    if sampleSpace.values is not []:
+        sm = sum(sampleSpace.values)
+        animations += [[]]
+        comments += [['Sum of all the values of the sample space provided by user: ' + str(sm)]]
+        summationString = ''
+        for val in sampleSpace.values:
+            summationString += str(val) + '+'
+        summationString = summationString[:-1]
+        summationTokens = tokenizer(summationString)
+        resultTokens, _, _, _, _ = simplify(summationTokens)
+        if len(resultTokens) == 1 and isinstance(resultTokens[0], Constant):
+            ArithemeticMean = resultTokens[0]/Constant(len(sampleSpace.values))
+        animations += [[]]
+        comments += [['Considering ' + str(len(sampleSpace.values)) + ' values.']]
+        animations += [[tokenizer('mean = ' + str(ArithemeticMean.calculate))]]
+        token_string = tokensToString([ArithemeticMean])
+        return token_string, animations, comments
+    else:
+        return '', [], []
+
+
+def Mode(sampleSpace):
+    """Implements Mode
+
+    Arguments:
+        sampleSpace -- {visma.discreteMaths.statistics.ArithemeticMean}
+
+    Returns:
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    """
+
+    animations = []
+    comments = []
+    token_string = ''
+    if sampleSpace.values is not []:
+        mode, frequency = Counter(sampleSpace.values).most_common(1)[0]
+        comments += [['The mode refers to the most occuring element']]
+        animations += [[]]
+        comments += [['Mode = ' + str(mode) + '; Mode Frequency = ' + str(frequency)]]
+        animations += [[]]
+        token_string = 'Mode = ' + str(mode) + '; Mode Frequency = ' + str(frequency)
+        return token_string, animations, comments
+    else:
+        return '', [], []
+
+
+def Median(sampleSpace):
+    """Implements Median
+
+    Arguments:
+        sampleSpace -- {visma.discreteMaths.statistics.ArithemeticMean}
+
+    Returns:
+        token_string {string} -- final result stored in a string
+        animation {list} -- list of equation solving process
+        comments {list} -- list of comments in equation solving process
+    """
+
+    animations = []
+    comments = []
+    token_string = ''
+    if sampleSpace.values is not []:
+        sizeSampleSpace = sampleSpace.size
+        if sizeSampleSpace % 2 == 1:
+            medianValue = sorted(sampleSpace.values)[sizeSampleSpace//2]
+        else:
+            medianValue = sum(sorted(sampleSpace.values)[sizeSampleSpace//2-1: sizeSampleSpace//2+1])/2.0
+        comments += [['The median refers to the middle element in sorted sample space']]
+        animations += [[]]
+        comments += [['Median = ' + str(medianValue)]]
+        animations += [[]]
+        token_string = str(medianValue)
+        return token_string, animations, comments
+    else:
+        return '', [], []

data/visma/functions/constant.py

@@ -0,0 +1,255 @@
+import math
+from visma.functions.structure import Function, Expression
+from visma.functions.variable import Variable
+from visma.functions.exponential import Exponential
+from visma.functions.operator import Plus, Minus
+
+#############
+# Constant  #
+#############
+
+
+class Constant(Function):
+    """Class for constant type tokens
+
+    Example:
+        1, -2, 3.14, 4i + 5 etc
+
+    Extends:
+        Function
+    """
+
+    def __init__(self, value=None, power=1, coefficient=1):
+        super().__init__()
+        self.coefficient = coefficient
+        self.power = power
+        if value is not None:
+            self.value = value
+        if self.value is not None:
+            self.value = self.calculate()
+            self.coefficient = 1
+            self.power = 1
+
+    def inverse(self, RHS):
+        pass
+
+    def differentiate(self):
+        super().differentiate()
+        self.value = 0
+
+    def integrate(self, intwrt):
+        self.coefficient = self.value ** self.power
+        self.__class__ = Variable
+        self.power = [1]
+        self.value = [intwrt]
+
+    def __radd__(self, other):
+        return self + other
+
+    def __add__(self, other):
+        if isinstance(other, Constant):
+            if self.before == '-':
+                result = Constant(self.calculate() - other.calculate(), self.power)
+            else:
+                result = Constant(self.calculate() + other.calculate(), self.power)
+            self.value = result.value
+            if result.value == 0 and result.power == 0:
+                result.value = 1
+                result.power = 1
+            result.scope = self.scope
+            result.value = result.calculate()
+            return result
+        elif self.isZero():
+            return other
+        elif other.isZero():
+            return self
+        elif isinstance(other, Expression):
+            if other.power == 1 and other.coefficient == 1:
+                constFound = False
+                for i, var in enumerate(other.tokens):
+                    if isinstance(var, Constant):
+                        if other.tokens[i-1].value == '+' or i == 0:
+                            other.tokens[i] = self + var
+                        elif other.tokens[i-1].value == '-':
+                            other.tokens[i-1] = self - var
+                        constFound = True
+                        break
+                if not constFound:
+                    other.tokens.extend([Plus(), self])
+                return other
+            else:
+                pass
+        self.value = self.calculate()
+        self.power = 1
+        self.coefficient = 1
+        exprAdd = Expression([self, Plus(), other])     # Make an Expression and assign the Tokens attribute with the Constant and the Other Variable, Trig. function,...etc.
+        return exprAdd
+
+    def __rsub__(self, other):
+        return Constant(0) - self + other
+
+    def __sub__(self, other):
+        if isinstance(other, Constant):
+            self = self + Constant(-1, 1, 1) * other
+            return self
+        elif isinstance(other, Variable):
+            if self.value == 0:
+                other.coefficient *= -1
+                return other
+            expression = Expression()
+            expression.tokens = [self]
+            expression.tokens.extend([Minus(), other])
+        elif isinstance(other, Expression):
+            expression = Expression()
+            expression.tokens = [self]
+            if other.power == 1:
+                coeff = other.coefficient
+                for i, token in enumerate(other.tokens):
+                    print(expression, " ", type(token), other.tokens[i-1])
+                    if isinstance(token, Constant):
+                        if other.tokens[i-1].value == '+' or i == 0:
+                            expression.tokens[0] = Constant(self.calculate() - token.calculate()*coeff)
+                        elif other.tokens[i-1].value == '-':
+                            expression.tokens[0] = Constant(self.calculate() + token.calculate()*coeff)
+                    elif isinstance(token, Variable):
+                        if other.tokens[i-1].value == '+' or i == 0:
+                            expression.tokens.extend([Minus(), Variable(token)])
+                        elif other.tokens[i-1].value == '-':
+                            expression.tokens.extend([Plus(), Variable(token)])
+            else:
+                expression.tokens.extend([Minus(), other])
+        self = expression
+        return expression
+
+    def __rmul__(self, other):
+        return self * other
+
+    def __mul__(self, other):
+        if other.isZero():
+            return other
+        elif self.isZero():
+            return self
+        elif isinstance(other, Constant):
+            const = Constant(self.calculate() * other.calculate())
+            return const
+        elif isinstance(other, Variable):
+            variable = Variable()
+            variable.coefficient = self.calculate() * other.coefficient
+            variable.value.extend(other.value)
+            variable.power.extend(other.power)
+            self = variable
+            return variable
+        elif isinstance(other, Expression):
+            if other.power == 1:
+                other.tokens[0] = self * other.tokens[0]
+                for i, var in enumerate(other.tokens):
+                    if other.tokens[i-1].value == '+' or other.tokens[i-1].value == '-':
+                        other.tokens[i] = self * var
+            else:
+                if isinstance(other.power, Constant) or isinstance(other.power, int) or isinstance(other.power, float):
+                    self = self ** (-1 * other.power)
+                    for i, var in enumerate(other.tokens):
+                        if other.tokens[i - 1].value == '+' or other.tokens[i - 1].value == '-':
+                            other.tokens[i] = self * var
+                else:
+                    other.coefficient = self * other.coefficient
+        else:
+            other.coefficient = self.calculate() * other.coefficient
+        return other
+
+    def __rtruediv__(self, other):
+        return Constant(1) / self * other
+
+    def __truediv__(self, other):
+        if other.value in ['+', '-', '*', '/']:
+            return other
+        elif self.isZero():
+            return self
+        elif isinstance(other, Constant):
+            result = Constant()
+            power = Constant(-1, 1, 1)
+            result = self * (other ** power)
+            return result
+
+        elif isinstance(other, Variable):
+            power = Constant(-1, 1, 1)
+            self = self * (other ** power)
+            return self
+        elif isinstance(other, Expression):
+            other.power = -1 * other.power
+            newCoeff = self * Constant(other.coefficient)
+            other.coefficient = newCoeff
+            return other
+        else:
+            if other.isZero():  # ToDo: Raise a Division by Zero Error
+                return other
+            other.coefficient = self.calculate() / other.coefficient
+            other.power = [-1 * eachPower for eachPower in other.power]
+        return other
+
+    def __pow__(self, val):
+        if isinstance(val, int) or isinstance(val, float):
+            if self.power == 0 and self.value == 0:
+                self.power = 1
+                self.value = 1
+            else:
+                self.value = (self.value ** self.power)
+                self.power = 1
+            return self
+        elif isinstance(val, Constant):
+            self.value = self.calculate() ** val.calculate()
+            self.coefficient = 1
+            self.power = 1
+            return self
+        else:
+            constExponent = Exponential()
+            constExponent.base = self.value
+            constExponent.coefficient = self.coefficient
+            constExponent.power = val
+            return constExponent
+
+    def calculate(self):
+        return self.coefficient * (self ** self.power).value
+
+    def functionOf(self):
+        return []
+
+    def binary(self):
+        '''Returns a binary string of the given constant
+        '''
+        return bin(self.calculate())[2:]
+
+
+class Zero(Constant):
+
+    def __init__(self):
+        super().__init__()
+        self.value = 0
+
+
+class One(Constant):
+
+    def __init__(self):
+        super().__init__()
+        self.value = 1
+
+
+class Pi(Constant):
+
+    def __init__(self):
+        super().__init__()
+        self.value = math.pi
+
+
+class Euler(Constant):
+
+    def __init__(self):
+        super().__init__()
+        self.value = math.e
+
+
+class Iota(Constant):
+
+    def __init__(self):
+        super().__init__()
+        self.value = 1j

data/visma/functions/exponential.py

@@ -0,0 +1,81 @@
+import math
+import copy
+from visma.functions.structure import FuncOp
+
+#########################
+# Exponential Functions #
+#########################
+
+
+class Logarithm(FuncOp):
+    """Class for log function -- log(...)
+
+    Input examples:
+        log(2) [without base, default base 10]
+        log_4(x+y) [with base]
+
+    Extends:
+        FuncOp
+    """
+
+    def __init__(self, operand=None):
+        super().__init__()
+        self.base = 10
+        self.value = 'log'
+
+    def inverse(self, rToken, wrtVar, inverseFunction=None):
+        inverseFunction = Exponential()
+        super().inverse(self, rToken, wrtVar, inverseFunction)
+
+    def calculate(self, val):
+        return self.coefficient * ((math.log(val, self.base)))
+
+    def differentiate(self, wrtVar=None):
+        from visma.functions.variable import Variable
+        result = copy.deepcopy(self)
+        result.__class__ = Variable
+        result.coefficient = 1
+        result.value = wrtVar
+        result.power = [-1]
+        result.operand = None
+        return result
+
+
+class NaturalLog(Logarithm):
+    """Class for ln function -- ln(...) or use log_e(...)
+
+    Extends:
+        Logarithm
+    """
+
+    def __init__(self, operand=None):
+        super().__init__()
+        self.base = math.exp(1)
+        self.value = 'ln'
+
+
+class Exponential(FuncOp):
+    """Class for all constant exponential functions -- as exp(...) or 5^(...)
+
+    Extends:
+        FuncOp
+    """
+
+    def __init__(self, val=None):
+        super().__init__()
+        self.value = 'exp'
+        if not val:
+            self.base = val
+        else:
+            self.base = math.e
+
+    def calculate(self):
+        from visma.functions.constant import Constant
+        if isinstance(self.power, int) or isinstance(self.power, float) or isinstance(self.power, Constant):
+            const = Constant()
+            if isinstance(self.power, Constant):
+                self.power = self.power.calculate()
+            const.value = self.coefficient * (self.base ** self.power)
+            return const
+        else:
+            return self

data/visma/functions/hyperbolic.py

@@ -0,0 +1,101 @@
+from visma.functions.structure import FuncOp
+from visma.functions.exponential import NaturalLog
+import math
+
+########################
+# Hyberbolic Functions #
+########################
+
+
+class Sinh(FuncOp):
+    """Class for sinh function -- sinh(...)
+
+    Extends:
+        FuncOp
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'sinh'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcSinh
+
+    def differentiate(self):
+        super().differentiate()
+        self.__class__ = Cosh
+
+    def integrate(self):
+        self.__class__ = Cosh
+
+    def calculate(self, val):
+        return self.coefficient * ((math.sinh(val))**self.power)
+
+
+class Cosh(FuncOp):
+    """Class for cosh function -- cosh(...)
+
+    Extends:
+        FuncOp
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'cosh'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcCosh
+
+    def differentiate(self):
+        super().differentiate()
+        self.__class__ = Sinh
+
+    def integrate(self):
+        self.__class__ = Sinh
+
+    def calculate(self, val):
+        return self.coefficient * ((math.cosh(val))**self.power)
+
+
+class Tanh(FuncOp):
+    """Class for tanh function -- tanh(...)
+
+        Extends:
+            FuncOp
+        """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'tanh'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcTanh
+
+    def differentiate(self):
+        super().differentiate()
+        self.__class__ = Cosh       # Derivative of Tanh(x) is equal to 1-Tanh^2(x) = Sech^2(x) = Cosh^-2(x), So Class is Cosh, and Power is to be set to (-2).
+
+    def integrate(self):
+        self.__class__ = NaturalLog     # Ln(Cosh(x)), value is to be set to Cosh(...).
+
+    def calculate(self, val):
+        return self.coefficient * ((math.tanh(val)) ** self.power)
+
+################################
+# Inverse Hyperbolic Functions #
+################################
+
+
+class ArcSinh(FuncOp):
+    pass
+
+
+class ArcCosh(FuncOp):
+    pass
+
+
+class ArcTanh(FuncOp):
+    pass

data/visma/functions/operator.py

@@ -0,0 +1,116 @@
+class Operator(object):
+    """The Operator class is for operators(+, -, *, / etc)
+
+    Example:
+        '+', '-', '*' etc
+
+    Note:
+        Not to be confused with 'operator' and 'operand' properties of 'Function' class
+    """
+
+    def __init__(self):
+        self.tid = None
+        self.scope = None
+        self.value = None
+
+    def __str__(self):
+        represent = ""
+        represent += str(self.value)
+        return represent
+
+    def differentiate(self):
+        return self
+
+
+class Binary(Operator):
+    """Binary operator takes two operands
+
+    Example:
+        '2 + 2', '5/6' etc
+
+    Extends:
+        Operator
+    """
+
+    def __init__(self, value=None):
+        super().__init__()
+        if value is not None:
+            self.value = value
+
+
+class Sqrt(Operator):
+
+    def __init__(self, power=None, operand=None):
+        super().__init__()
+        if power is not None:
+            self.power = power
+        if operand is not None:
+            self.operand = operand
+
+    def __str__(self):
+        represent = ""
+        if self.operand.value == -1:
+            represent += r"\iota "
+        else:
+            represent += r"\sqrt" + self.operand.__str__()
+        return represent
+
+
+class Plus(Binary):
+    """Class for '+'
+
+    Extends:
+        Binary
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = '+'
+
+
+class Minus(Binary):
+    """Class for '-'
+
+    Extends:
+        Binary
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = '-'
+
+
+class Multiply(Binary):
+    """Class for '*'
+
+    Extends:
+        Binary
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = '*'
+
+
+class Divide(Binary):
+    """Class for '/'
+
+    Extends:
+        Binary
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = '/'
+
+
+class EqualTo(Binary):
+    """Class for '='
+
+    Extends:
+        Binary
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = '='

data/visma/functions/structure.py

@@ -0,0 +1,301 @@
+import copy
+
+
+class Function(object):
+    """Basis function class for all functions
+
+    The Function class forms the basis for the functions tokens of all types.
+    """
+
+    def __init__(self):
+        self.tid = None
+        self.scope = None
+        self.value = None
+        self.coefficient = 1
+        self.power = 1
+        self.operand = None
+        self.operator = None
+        self.before = None
+        self.after = None
+        self.beforeScope = None
+        self.afterScope = None
+
+    def __str__(self, nv=None, np=None, nc=None):
+        """Equation token to string
+
+        Coverts equation tokens to string for text and LaTeX rendering
+
+        Keyword Arguments:
+            nv {int} -- number of values (default: {None})
+            np {int} -- number of powers (default: {None})
+            nc {int} -- number of coefficients (default: {None})
+
+        Returns:
+            represent {string} -- string/latex representation of equation
+        """
+        # OPTIMIZE: Works but a mess. Organize and add comments
+        represent = ""
+
+        if np is None and nv is None and nc is None:
+            if self.coefficient != 1:
+                represent += str(self.coefficient)
+        elif nc is not None:
+            if self.coefficient[nc] != 1:
+                represent += str(self.coefficient[nc])
+
+        if isinstance(self.value, list):
+            if nv is None and np is None:
+                for eachValue, eachPower in zip(self.value, self.power):
+                    represent += "{" + str(eachValue) + "}"
+                    if eachPower != 1:
+                        represent += "^" + "{" + str(eachPower) + "}"
+            elif nc is None:
+                represent += "{" + str(self.value[nv]) + "}"
+                if self.power[np] != 1:
+                    represent += "^" + "{" + str(self.power[np]) + "}"
+            elif nc is not None:
+                for i, val in enumerate(self.value):
+                    represent += "{" + str(val) + "}"
+                    if self.power[np][i] != 1:
+                        represent += "^" + "{" + str(self.power[np][i]) + "}"
+        elif self.operand is not None:
+            represent += "\\" + self.value
+            if self.power != 1:
+                represent += "^" + "{" + str(self.power) + "}"
+            represent += "({" + self.operand.__str__() + "})"
+        else:
+            represent += "{" + str(self.value) + "}"
+            if self.power != 1:
+                represent += "^" + "{" + str(self.power) + "}"
+
+        return represent
+
+    def prop(self, tid=None, scope=None, value=None, coeff=None, power=None, operand=None, operator=None):
+        """Set function token properties
+
+        Keyword Arguments:
+            tid {[type]} -- Token ID (default: {None})
+            scope {int} -- Scope (default: {None})
+            value {int or list} -- Value (default: {None})
+            coeff {int} -- Coefficient (default: {None})
+            power {int or list} -- Power (default: {None})
+            operand {visma.functions.structure.Function} -- Operand (default: {None})
+            operator {visma.functions.structure.Function} -- Operator (default: {None})
+        """
+        if tid is not None:
+            self.tid = tid
+        if scope is not None:
+            self.scope = scope
+        if value is not None:
+            self.value = value
+        if coeff is not None:
+            self.coefficient = coeff
+        if power is not None:
+            self.power = power
+        if operand is not None:
+            self.operand = operand
+        if operator is not None:
+            self.operator = operator
+
+    def differentiate(self):
+        """Differentiate function token
+        """
+        self.power = 1
+        self.coefficient = 1
+
+    def level(self):
+        """Level of function token
+        """
+        return (int((len(self.tid)) / 2)), 5
+
+    def functionOf(self):
+        inst = copy.deepcopy(self)
+        while inst.operand is not None:
+            inst = inst.operand
+        return inst.value
+
+    def isZero(self):
+        """
+        It checks if the Function is equal to Zero or not, to decide it should be Added, Subtracted,...etc. or not.
+        :returns: bool
+        """
+        if (self.value == 0 and self.power != 0) or self.coefficient == 0:
+            return True
+        return False
+
+
+##########
+# FuncOp #
+##########
+
+class FuncOp(Function):
+    """Defined for functions of form sin(...), log(...), exp(...) etc which take a function(operand) as argument
+    """
+    def __init__(self, operand=None):
+        super().__init__()
+        if operand is not None:
+            self.operand = operand
+
+    def __str__(self):
+        represent = ""
+        represent += "\\" + self.value
+        if self.power != 1:
+            represent += "^" + "{" + str(self.power) + "}"
+        if self.operand is not None:
+            represent += "{(" + str(self.operand) + ")}"
+        return represent
+
+    def inverse(self, rToken, wrtVar, inverseFunction):
+        """Returns inverse of function
+
+        Applies inverse of function to RHS and LHS.
+
+        Arguments:
+            rToken {visma.functions.structure.Function} -- RHS token
+            wrtVar {string} -- with respect to variable
+            inverseFunction {visma.functions.structure.Function} -- inverse of the function itself
+
+        Returns:
+            self {visma.functions.structure.Function} -- function itself(operand before inverse)
+            rToken {visma.functions.structure.Function} -- new RHS token
+            comment {string} -- steps comment
+        """
+        rToken.coefficient /= self.coefficient
+        rToken.power /= self.power
+        invFunc = copy.deepcopy(inverseFunction)
+        invFunc.operand = rToken
+        self = self.operand
+        comment = "Applying inverse function on LHS and RHS"
+        return self, rToken, comment
+
+
+###################
+# Mixed Functions #
+###################
+# For example: sec(x)*tan(x) or sin(x)*log(x) or e^(x)*cot(x)
+# Will be taken care by function Expression
+
+
+class Expression(Function):
+    """Class for expression type
+    """
+
+    def __init__(self, tokens=None, coefficient=None, power=None):
+        super().__init__()
+        if coefficient is not None:
+            self.coefficient = coefficient
+        else:
+            self.coefficient = 1
+        if power is not None:
+            self.power = power
+        else:
+            self.power = 1
+        self.tokens = []
+        if tokens is not None:
+            self.tokens.extend(tokens)
+
+    def __str__(self):
+        represent = ""
+        if self.coefficient != 1:
+            represent += str(self.coefficient) + "*"
+        represent += "{("
+        for token in self.tokens:
+            represent += token.__str__()
+        represent += ")}"
+        if self.power != 1:
+            represent += "^" + "{" + str(self.power) + "}"
+        if self.operand is not None:
+            represent += "{(" + str(self.operand) + ")}"
+        return represent
+
+    def __mul__(self, other):
+        from visma.functions.constant import Constant
+        from visma.functions.variable import Variable
+
+        if isinstance(other, Expression):
+            result = Expression()
+            for i, _ in enumerate(self.tokens):
+                c = copy.deepcopy(self)
+                d = copy.deepcopy(other)
+                if isinstance(c.tokens[i], Constant) or isinstance(c.tokens[i], Variable):
+                    result.tokens.extend([c.tokens[i] * d])
+                else:
+                    result.tokens.extend([c.tokens[i]])
+            return result
+
+    def __add__(self, other):
+        from visma.functions.constant import Constant
+        from visma.functions.variable import Variable
+        from visma.functions.operator import Plus
+        if isinstance(other, Expression):
+            result = Expression()
+            for tok1 in self.tokens:
+                result.tokens.append(tok1)
+            result.tokens.append(Plus())
+            if (other.tokens[0], Constant):
+                if (other.tokens[0].value < 0):
+                    result.tokens.pop()
+            elif (other.tokens[0], Variable):
+                if (other.tokens[0].coefficient < 0):
+                    result.tokens.pop()
+            for tok2 in other.tokens:
+                result.tokens.append(tok2)
+            return result
+        elif isinstance(other, Constant):
+            result = self
+            constFound = False
+            for i, _ in enumerate(self.tokens):
+                if isinstance(self.tokens[i], Constant):
+                    self.tokens[i] += other
+                    constFound = True
+            if constFound:
+                return result
+            else:
+                result.tokens += other
+                return result
+        elif isinstance(other, Variable):
+            result = Expression()
+            result = other + self
+            return result
+
+    def __sub__(self, other):
+        from visma.functions.constant import Constant
+        from visma.functions.variable import Variable
+        from visma.functions.operator import Plus, Minus
+        if isinstance(other, Expression):
+            result = Expression()
+            for tok1 in self.tokens:
+                result.tokens.append(tok1)
+            for _, x in enumerate(other.tokens):
+                if x.value == '+':
+                    x.value = '-'
+                elif x.value == '-':
+                    x.value = '+'
+            result.tokens.append(Minus())
+            if (isinstance(other.tokens[0], Constant)):
+                if (other.tokens[0].value < 0):
+                    result.tokens[-1] = Plus()
+                    other.tokens[0].value = abs(other.tokens[0].value)
+            elif (isinstance(other.tokens[0], Variable)):
+                if (other.tokens[0].coefficient < 0):
+                    result.tokens[-1] = Plus()
+                    other.tokens[0].coefficient = abs(other.tokens[0].coefficient)
+            return result
+        elif isinstance(other, Constant):
+            result = self
+            result += (Constant(0) - other)
+            return result
+        elif isinstance(other, Variable):
+            result = self
+            a = Constant(0) - other
+            result = a + result
+            return result
+
+
+class Equation(Expression):
+    """Class for equation type
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.tokens = None

data/visma/functions/trigonometry.py

@@ -0,0 +1,300 @@
+import math
+import copy
+from visma.functions.structure import FuncOp, Expression
+from visma.functions.operator import Multiply, Plus
+from visma.functions.constant import Constant
+from visma.functions. exponential import NaturalLog
+
+##########################
+# Trignometric Functions #
+##########################
+
+
+class Trigonometric(FuncOp):
+    """Parent Class for all the Trigonometric Classes like Sine, Cosine, Tangent etc.
+
+    """
+    pass
+
+
+class Sine(Trigonometric):
+    """Class for sin function -- sin(...)
+
+    Extends:
+        Trigonometric
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'sin'
+
+    def inverse(self, rToken, wrtVar, inverseFunction=None):
+        inverseFunction = ArcSin()
+        super().inverse(self, rToken, wrtVar, inverseFunction)
+
+    def calculate(self, val):
+        return self.coefficient * ((math.sin(val))**self.power)
+
+    def differentiate(self, wrtVar=None):
+        super().differentiate()
+        result = copy.deepcopy(self)
+        result.__class__ = Cosine
+        result.value = 'cos'
+        result.coefficient = 1
+        return result
+
+    def integrate(self, wrtVar=None):
+        term1 = Constant(-1, 1, 1)
+        term2 = copy.deepcopy(self)
+        term2.__class__ = Cosine
+        term2.value = 'cos'
+        term2.coefficient = 1
+        result = Expression()
+        result.tokens = [term1, Multiply(), term2]
+        return result
+
+
+class Cosine(Trigonometric):
+    """Class for cos function -- cos(...)
+
+    Extends:
+        Trigonometric
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'cos'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcCos
+
+    def differentiate(self, wrtVar):
+        term1 = Constant(-1, 1, 1)
+        term2 = copy.deepcopy(self)
+        term2.__class__ = Sine
+        term2.value = 'sin'
+        result = Expression()
+        result.tokens = [term1, Multiply(), term2]
+        return result
+
+    def integrate(self, wrtVar):
+        result = copy.deepcopy(self)
+        result.__class__ = Sine
+        result.value = 'sin'
+        result.coefficient = 1
+        return result
+
+    def calculate(self, val):
+        return self.coefficient * ((math.cos(val))**self.power)
+
+
+class Tangent(Trigonometric):
+    """Class for tan function -- tan(...)
+
+    Extends:
+        Trigonometric
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'tan'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcTan
+
+    def differentiate(self, wrtVar):
+        result = copy.deepcopy(self)
+        result.__class__ = Secant
+        result.value = 'sec'
+        result.coefficient = 1
+        result.power = 2
+        return result
+
+    def integrate(self, wrtVar):
+        term1 = Constant(-1, 1, 1)
+        term2 = NaturalLog()
+        term3 = Cosine()
+        term3.operand = self.operand
+        term2.operand = term3
+        term2.power = 1
+        term2.coefficient = 1
+        result = Expression()
+        result.tokens = [term1, Multiply(), term2]
+        return result
+
+    def calculate(self, val):
+        return self.coefficient * ((math.tan(val))**self.power)
+
+
+class Cotangent(Trigonometric):
+    """Class for cot function -- cot(...)
+
+    Extends:
+        Trigonometric
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'cot'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcCot
+
+    def differentiate(self, wrtVar):
+        term1 = Constant(-1, 1, 1)
+        term2 = copy.deepcopy(self)
+        term2.__class__ = Cosecant
+        term2.value = 'csc'
+        term2.coefficient = 1
+        term2.power = 2
+        result = Expression()
+        result.tokens = [term1, Multiply(), term2]
+        return result
+
+    def integrate(self, wrtVar):
+        result = NaturalLog()
+        term1 = Sine()
+        term1.operand = self.operand
+        term1.power = 1
+        term1.coefficient = 1
+        result.operand = term1
+        return result
+
+    def calculate(self, val):
+        return self.coefficient * ((math.cot(val))**self.power)
+
+
+class Cosecant(Trigonometric):
+    """Class for csc function -- csc(...)
+
+    Extends:
+        Trigonometric
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'csc'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcCosec
+
+    def differentiate(self, wrtVar):
+        term1 = Constant(-1, 1, 1)
+        term2 = Cosecant()
+        term2.operand = self.operand
+        term2.coefficient = 1
+        term3 = Cotangent()
+        term3.operand = self.operand
+        term3.coefficient = 1
+        result = Expression()
+        result.tokens = [term1, Multiply(), term2, Multiply(), term3]
+        return result
+
+    def integrate(self, wrtVar):
+        term1 = Constant(-1, 1, 1)
+        term2 = NaturalLog()
+        result = Expression()
+        term3 = Cosecant()
+        term3.operand = self.operand
+        term4 = Cotangent()
+        term4.operand = self.operand
+        inExpression = Expression()
+        inExpression.tokens = [term3, Plus(), term4]
+        term2.operand = inExpression
+        term2.power = 1
+        term2.coefficient = 1
+        result.tokens = [term1, Multiply(), term2]
+        return result
+
+    def __mul__(self, other):
+        if isinstance(other, Cotangent):
+            result = Expression()
+            result.coefficient = self.coefficient * other.coefficient
+            c = copy.deepcopy(self)
+            d = copy.deepcopy(other)
+            result.tokens.extend([c, Multiply(), d])
+            return result
+
+    def calculate(self, val):
+        return self.coefficient * ((math.cosec(val))**self.power)
+
+
+class Secant(Trigonometric):
+    """Class for sec function -- sec(...)
+
+    Extends:
+        Trigonometric
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.value = 'sec'
+
+    def inverse(self, RHS):
+        super().inverse(RHS)
+        self.__class__ = ArcSec
+
+    def differentiate(self, wrtVar):
+        term1 = Tangent()
+        term1.operand = self.operand
+        term2 = Secant()
+        term2.operand = self.operand
+        resultTerm = term2 * term1
+        return resultTerm
+
+    def integrate(self, wrtVar):
+        resultTerm = NaturalLog()
+        term3 = Secant()
+        term3.operand = self.operand
+        term4 = Tangent()
+        term4.operand = self.operand
+        inExpression = Expression()
+        inExpression.tokens = [term3, Plus(), term4]
+        resultTerm.operand = inExpression
+        resultTerm.power = 1
+        resultTerm.coefficient = 1
+        return resultTerm
+
+    def __mul__(self, other):
+        if isinstance(other, Tangent):
+            result = Expression()
+            Expression.coefficient = self.coefficient * other.coefficient
+            c = copy.deepcopy(self)
+            d = copy.deepcopy(other)
+            result.tokens.extend([c, Multiply(), d])
+            return result
+
+    def calculate(self, val):
+        return self.coefficient * ((math.sec(val))**self.power)
+
+##################################
+# Inverse Trignometric Functions #
+##################################
+
+
+class ArcSin(Trigonometric):
+    pass
+
+
+class ArcCos(Trigonometric):
+    pass
+
+
+class ArcTan(Trigonometric):
+    pass
+
+
+class ArcCot(Trigonometric):
+    pass
+
+
+class ArcSec(Trigonometric):
+    pass
+
+
+class ArcCsc(Trigonometric):
+    pass

data/visma/functions/variable.py

@@ -0,0 +1,280 @@
+import copy
+from visma.functions.structure import Function, Expression
+from visma.functions.exponential import Logarithm
+from visma.functions.operator import Plus, Minus, Multiply, Divide, Binary
+
+
+############
+# Variable #
+############
+
+
+class Variable(Function):
+    """Class for variable function type
+
+    Examples:
+        x
+        2x^2
+        3xyz^3
+
+    Extends:
+        Function
+    """
+
+    def __init__(self, coeff=None, value=None, power=None):
+        super().__init__()
+        # Report
+        self.coefficient = 1
+        if coeff is not None:
+            self.coefficient = coeff
+        self.value = []
+        if value is not None:
+            self.value.append(value)
+        self.power = []
+        if power is not None:
+            self.power.append(power)
+
+    def inverse(self, rToken, wrtVar):
+        l2rVar = Variable()
+        for i, var in enumerate(self.value):
+            if var != wrtVar:
+                l2rVar.value.append(self.value.pop(i))
+                l2rVar.power.append(self.power.pop(i))
+        if l2rVar.value != []:
+            rToken = Expression([rToken, Divide(), l2rVar])
+        rToken.coefficient /= (self.coefficient)**(1/self.power[0])
+        rToken.power /= self.power[0]
+        self.coefficient = 1
+        self.power[0] = 1
+        comment = "Therefore, " + r"$" + wrtVar + r"$" + " can be written as:"
+        return self, rToken, comment
+
+    def differentiate(self, wrtVar):
+        from visma.functions.constant import Constant, Zero
+        result = copy.deepcopy(self)
+        if wrtVar in result.functionOf():
+            for i, var in enumerate(result.value):
+                if var == wrtVar:
+                    result.coefficient *= result.power[i]
+                    result.power[i] -= 1
+                    if(result.power[i] == 0):
+                        del result.power[i]
+                        del result.value[i]
+                        if result.value == []:
+                            result.__class__ = Constant
+                            result.value = result.coefficient
+                            result.coefficient = 1
+                            result.power = 1
+        else:
+            result = Zero()
+        return result
+
+    def integrate(self, wrtVar=None):
+        from visma.functions.constant import Constant
+        result = copy.deepcopy(self)
+        log = False
+        for i, var in enumerate(result.value):
+            if var == wrtVar:
+                if(result.power[i] == -1):
+                    log = True
+                    funcLog = Logarithm()
+                    funcLog.operand = Variable()
+                    funcLog.operand.coefficient = 1
+                    funcLog.operand.value.append(result.value[i])
+                    funcLog.operand.power.append(1)
+                    del result.power[i]
+                    del result.value[i]
+                    if result.value == []:
+                        result.__class__ = Constant
+                        result.value = result.coefficient
+                        result.coefficient = 1
+                        result.power = 1
+                    result = [result]
+                    funcJoin = Binary()
+                    funcJoin.value = '*'
+                    result.append(funcJoin)
+                    result.append(funcLog)
+                else:
+                    result.power[i] += 1
+                    result.coefficient /= result.power[i]
+        print(result)
+        return result, log
+
+    def calculate(self, val):
+        return self.coefficient * ((val**(self.power)))
+
+    def __radd__(self, other):
+        return self + other
+
+    def __add__(self, other):
+        from visma.functions.constant import Constant
+        if isinstance(other, Variable):
+            sortedValuesSelf = sorted(self.value)
+            sortedValuesOther = sorted(other.value)
+            if self.coefficient == 0:
+                return Constant(0, 1, 1)
+            if (self.power == other.power) & (sortedValuesSelf == sortedValuesOther):
+                if self.before == '-':
+                    self.coefficient -= other.coefficient
+                else:
+                    self.coefficient += other.coefficient
+                return self
+        elif isinstance(other, Constant):
+            expression = Expression()
+            expression.tokens = [self]
+            expression.tokens.extend([Plus(), other])
+            self = expression
+            return expression
+        elif isinstance(other, Expression):
+            expression = Expression()
+            expression.tokens = [self]
+            for i, token in enumerate(other.tokens):
+                if isinstance(token, Variable):
+                    tokenValueSorted = sorted(token.value)
+                    selfValueSorted = sorted(self.value)
+                    if (token.power == self.power) & (tokenValueSorted == selfValueSorted):
+                        if other.tokens[i - 1].value == '+' or (i == 0):
+                            self.coefficient += other.tokens[i].coefficient
+                        elif other.tokens[i - 1].value == '-':
+                            self.coefficient -= other.tokens[i].coefficient
+                    else:
+                        if other.tokens[i-1].value == '+' or i == 0:
+                            expression.tokens.extend([Plus(), Variable(token)])
+                        elif other.tokens[i-1].value == '-':
+                            expression.tokens.extend([Minus(), Variable(token)])
+                elif not isinstance(token, Binary):
+                    if other.tokens[i - 1].value == '+' or (i == 0):
+                        expression.tokens.extend([Plus(), token])
+                    elif other.tokens[i - 1].value == '-':
+                        expression.tokens.extend([Minus(), token])
+            expression.tokens[0] = self
+            self = expression
+            return expression
+
+    def __rsub__(self, other):
+        from visma.functions.constant import Constant
+        return Constant(0, 1, 1) - self + other
+
+    def __sub__(self, other):
+        from visma.functions.constant import Constant
+        if isinstance(other, Variable):
+            otherValueSorted = sorted(other.value)
+            selfValueSorted = sorted(self.value)
+            if (other.power == self.power) & (selfValueSorted == otherValueSorted):
+                self = self + Constant(-1, 1, 1) * other
+                return self
+            else:
+                expression = Expression()
+                expression.tokens = [self]
+                expression.tokens.extend([Minus(), other])
+                self = expression
+                return expression
+        elif isinstance(other, Constant):
+            if other.isZero():
+                return self
+            expression = Expression()
+            expression.tokens = [self]
+            expression.tokens.extend([Minus(), other])
+            self = expression
+            return expression
+        elif isinstance(other, Expression):
+            expression = Expression()
+            expression.tokens = [self]
+            for i, token in enumerate(other.tokens):
+                if isinstance(token, Variable):
+                    tokenValueSorted = sorted(token.value)
+                    selfValueSorted = sorted(self.value)
+                    if (token.power == self.power) & (tokenValueSorted == selfValueSorted):
+                        if other.tokens[i - 1].value == '+' or (i == 0):
+                            self.coefficient -= other.tokens[i].coefficient
+                        elif other.tokens[i - 1].value == '-':
+                            self.coefficient += other.tokens[i].coefficient
+                    else:
+                        if other.tokens[i-1].value == '+' or i == 0:
+                            expression.tokens.extend([Plus(), Variable(token)])
+                        elif other.tokens[i-1].value == '-':
+                            expression.tokens.extend([Minus(), Variable(token)])
+                elif not isinstance(token, Binary):
+                    if other.tokens[i - 1].value == '+' or (i == 0):
+                        expression.tokens.extend([Minus(), token])
+                    elif other.tokens[i - 1].value == '-':
+                        expression.tokens.extend([Plus(), token])
+            expression.tokens[0] = self
+            self = expression
+            return expression
+
+    def __rmul__(self, other):
+        return self * other
+
+    def __mul__(self, other):
+        from visma.io.checks import isNumber
+        from visma.functions.constant import Constant
+
+        if isinstance(other, Variable):
+            for j, var in enumerate(other.value):
+                found = False
+                for k, var2 in enumerate(self.value):
+                    self.coefficient *= other.coefficient
+                    if var == var2:
+                        if isNumber(other.power[j]) and isNumber(self.power[k]):
+                            self.power[k] += other.power[j]
+                            if self.power[k] == 0:
+                                del self.power[k]
+                                del self.value[k]
+                            found = True
+                            break
+                if not found:
+                    self.value.append(other.value[j])
+                    self.power.append(other.power[j])
+
+                if len(self.value) == 0:
+                    result = Constant(self.coefficient)
+                    result.scope = self.scope
+                    result.power = 1
+                    result.value = self.coefficient
+                    self = result
+            return self
+        elif isinstance(other, Constant):
+            self.coefficient *= other.calculate()
+            return self
+        elif isinstance(other, Expression):
+            result = Expression()
+            for _, token in enumerate(other.tokens):
+                if isinstance(token, Variable) or isinstance(token, Constant):
+                    c = copy.deepcopy(self)
+                    result.tokens.extend([c * token])
+                else:
+                    result.tokens.extend([token])
+            return result
+
+    def __pow__(self, other):
+        from visma.functions.constant import Constant
+
+        if isinstance(other, Constant):
+            if other.value == -1:
+                one = Constant(1, 1, 1)
+                result = Variable()
+                result.value = self.value
+                result.coefficient = one.calculate() / self.coefficient
+                result.power = []
+                for pows in self.power:
+                    result.power.append(-pows)
+                return result
+
+    def __rtruediv__(self, other):
+        pass                                    # TODO : Add code for expression / variable
+
+    def __truediv__(self, other):
+        from visma.functions.constant import Constant
+        if isinstance(other, Variable) or isinstance(other, Constant):
+            self = self * (other ** Constant(-1, 1, 1))
+            return self
+
+        elif isinstance(other, Expression):
+            expression = Expression()
+            self.coefficient /= other.coefficient
+            other.power *= -1
+            expression.tokens = [self]
+            expression.tokens.extend([Multiply(), other])
+            self = expression
+            return expression

data/visma/gui/cli.py

@@ -0,0 +1,267 @@
+import copy
+import sys
+from PyQt5.QtWidgets import QMainWindow, QApplication, QWidget, QTabWidget, QVBoxLayout
+from visma.calculus.differentiation import differentiate
+from visma.calculus.integration import integrate
+from visma.discreteMaths.combinatorics import factorial, combination, permutation
+from visma.io.checks import checkTypes
+from visma.io.tokenize import tokenizer, getLHSandRHS
+from visma.io.parser import resultStringCLI, resultMatrixString
+from visma.simplify.simplify import simplify, simplifyEquation
+from visma.simplify.addsub import addition, additionEquation, subtraction, subtractionEquation
+from visma.simplify.muldiv import multiplication, multiplicationEquation, division, divisionEquation
+from visma.solvers.solve import solveFor
+from visma.solvers.polynomial.roots import rootFinder
+from visma.solvers.simulEqn import simulSolver
+from visma.transform.factorization import factorize
+from visma.matrix.structure import Matrix, SquareMat
+from visma.matrix.operations import simplifyMatrix, addMatrix, subMatrix, multiplyMatrix
+from visma.gui.plotter import plotFigure2D, plotFigure3D, plot
+
+
+class App(QMainWindow):
+    def __init__(self, tokens):
+        super().__init__()
+        self.setWindowTitle('Plots')
+        self.setGeometry(300, 300, 450, 450)
+        self.table_widget = PlotWindow(self, tokens)
+        self.setCentralWidget(self.table_widget)
+        self.show()
+
+
+class PlotWindow(QWidget):
+    def __init__(self, parent, tokens):
+        super(QWidget, self).__init__(parent)
+        self.layout = QVBoxLayout(self)
+        self.tabPlot = QTabWidget()
+        self.tabPlot.tab1 = QWidget()
+        self.tabPlot.tab2 = QWidget()
+        self.tabPlot.resize(300, 200)
+        self.tabPlot.addTab(self.tabPlot.tab1, "2D-Plot")
+        self.tabPlot.addTab(self.tabPlot.tab2, "3D-Plot")
+        self.tabPlot.tab1.setLayout(plotFigure2D(self))
+        self.tabPlot.tab2.setLayout(plotFigure3D(self))
+        self.layout.addWidget(self.tabPlot)
+        plot(self, tokens)
+
+
+def commandExec(command):
+    operation = command.split('(', 1)[0]
+    inputEquation = command.split('(', 1)[1][:-1]
+    matrix = False      # True when matrices operations are present in the code.
+    if operation[0:4] == 'mat_':
+        matrix = True
+
+    if not matrix:
+        """
+        This part handles the cases when VisMa is NOT dealing with matrices.
+
+        Boolean flags used in code below:
+        simul -- {True} when VisMa is dealing with simultaneous equations & {False} in all other cases
+        """
+        varName = None
+        if ',' in inputEquation:
+            varName = inputEquation.split(',')[1]
+            varName = "".join(varName.split())
+            inputEquation = inputEquation.split(',')[0]
+
+        simul = False   # True when simultaneous equation is present
+        if (inputEquation.count(';') == 2) and (operation == 'solve'):
+            simul = True
+            afterSplit = inputEquation.split(';')
+            eqStr1 = afterSplit[0]
+            eqStr2 = afterSplit[1]
+            eqStr3 = afterSplit[2]
+
+        lhs = []
+        rhs = []
+        solutionType = ''
+        lTokens = []
+        rTokens = []
+        equationTokens = []
+        comments = []
+        if simul:
+            tokens = [tokenizer(eqStr1), tokenizer(eqStr2), tokenizer(eqStr3)]
+        else:
+            tokens = tokenizer(inputEquation)
+            if '=' in inputEquation:
+                lhs, rhs = getLHSandRHS(tokens)
+                lTokens = lhs
+                rTokens = rhs
+                _, solutionType = checkTypes(lhs, rhs)
+            else:
+                solutionType = 'expression'
+                lhs, rhs = getLHSandRHS(tokens)
+                lTokens = lhs
+                rTokens = rhs
+
+        if operation == 'plot':
+            app = QApplication(sys.argv)
+            App(tokens)
+            sys.exit(app.exec_())
+        elif operation == 'simplify':
+            if solutionType == 'expression':
+                tokens, _, _, equationTokens, comments = simplify(tokens)
+            else:
+                lTokens, rTokens, _, _, equationTokens, comments = simplifyEquation(lTokens, rTokens)
+        elif operation == 'addition':
+            if solutionType == 'expression':
+                tokens, _, _, equationTokens, comments = addition(tokens, True)
+            else:
+                lTokens, rTokens, _, _, equationTokens, comments = additionEquation(lTokens, rTokens, True)
+        elif operation == 'subtraction':
+            if solutionType == 'expression':
+                tokens, _, _, equationTokens, comments = subtraction(tokens, True)
+            else:
+                lTokens, rTokens, _, _, equationTokens, comments = subtractionEquation(lTokens, rTokens, True)
+        elif operation == 'multiplication':
+            if solutionType == 'expression':
+                tokens, _, _, equationTokens, comments = multiplication(tokens, True)
+            else:
+                lTokens, rTokens, _, _, equationTokens, comments = multiplicationEquation(lTokens, rTokens, True)
+        elif operation == 'division':
+            if solutionType == 'expression':
+                tokens, _, _, equationTokens, comments = division(tokens, True)
+            else:
+                lTokens, rTokens, _, _, equationTokens, comments = divisionEquation(lTokens, rTokens, True)
+        elif operation == 'factorize':
+            tokens, _, _, equationTokens, comments = factorize(tokens)
+        elif operation == 'find-roots':
+            lTokens, rTokens, _, _, equationTokens, comments = rootFinder(lTokens, rTokens)
+        elif operation == 'solve':
+            if simul:
+                if varName is not None:
+                    _, equationTokens, comments = simulSolver(tokens[0], tokens[1], tokens[2], varName)
+                else:
+                    _, equationTokens, comments = simulSolver(tokens[0], tokens[1], tokens[2])
+                solutionType = equationTokens
+            else:
+                lhs, rhs = getLHSandRHS(tokens)
+                lTokens, rTokens, _, _, equationTokens, comments = solveFor(lTokens, rTokens, varName)
+        elif operation == 'factorial':
+            tokens, _, _, equationTokens, comments = factorial(tokens)
+        elif operation == 'combination':
+            n = tokenizer(inputEquation)
+            r = tokenizer(varName)
+            tokens, _, _, equationTokens, comments = combination(n, r)
+        elif operation == 'permutation':
+            n = tokenizer(inputEquation)
+            r = tokenizer(varName)
+            tokens, _, _, equationTokens, comments = permutation(n, r)
+        elif operation == 'integrate':
+            lhs, rhs = getLHSandRHS(tokens)
+            lTokens, _, _, equationTokens, comments = integrate(lTokens, varName)
+        elif operation == 'differentiate':
+            lhs, rhs = getLHSandRHS(tokens)
+            lTokens, _, _, equationTokens, comments = differentiate(lTokens, varName)
+        if operation != 'plot':
+            # FIXME: when either plotting window or GUI window is opened from CLI and after it is closed entire CLI exits, it would be better if it is avoided
+            final_string = resultStringCLI(equationTokens, operation, comments, solutionType, simul)
+            print(final_string)
+    else:
+        """
+        This part handles the cases when VisMa is dealing with matrices.
+
+        Boolean flags used in code below:
+        dualOperand -- {True} when the matrix operations require two operands (used in operations like addition, subtraction etc)
+        nonMatrixResult -- {True} when the result after performing operations on the Matrix is not a Matrix (in operations like Determinant, Trace etc.)
+        scalarOperations -- {True} when one of the operand in a scalar (used in operations like Scalar Addition, Scalar Subtraction etc.)
+        """
+        operation = operation[4:]
+        dualOperand = False
+        nonMatrixResult = False
+        scalarOperations = False
+        if ', ' in inputEquation:
+            dualOperand = True
+            [inputEquation1, inputEquation2] = inputEquation.split(', ')
+            if '[' in inputEquation1:
+                inputEquation1 = inputEquation1[1:][:-1]
+                inputEquation1 = inputEquation1.split('; ')
+                matrixOperand1 = []
+                for row in inputEquation1:
+                    row1 = row.split(' ')
+                    for i, _ in enumerate(row1):
+                        row1[i] = tokenizer(row1[i])
+                    matrixOperand1.append(row1)
+                Matrix1 = Matrix()
+                Matrix1.value = matrixOperand1
+                inputEquation2 = inputEquation2[1:][:-1]
+                inputEquation2 = inputEquation2.split('; ')
+                matrixOperand2 = []
+                for row in inputEquation2:
+                    row1 = row.split(' ')
+                    for i, _ in enumerate(row1):
+                        row1[i] = tokenizer(row1[i])
+                    matrixOperand2.append(row1)
+                Matrix2 = Matrix()
+                Matrix2.value = matrixOperand2
+                Matrix1_copy = copy.deepcopy(Matrix1)
+                Matrix2_copy = copy.deepcopy(Matrix2)
+            else:
+                scalarOperations = True
+                scalar = inputEquation1
+                scalarTokens = scalar
+                # scalarTokens = tokenizer(scalar)
+                inputEquation2 = inputEquation2[1:][:-1]
+                inputEquation2 = inputEquation2.split('; ')
+                matrixOperand2 = []
+                for row in inputEquation2:
+                    row1 = row.split(' ')
+                    for i, _ in enumerate(row1):
+                        row1[i] = tokenizer(row1[i])
+                    matrixOperand2.append(row1)
+                Matrix2 = Matrix()
+                Matrix2.value = matrixOperand2
+                scalarTokens_copy = copy.deepcopy(scalarTokens)
+                Matrix2_copy = copy.deepcopy(Matrix2)
+
+        else:
+            inputEquation = inputEquation[1:][:-1]
+            inputEquation = inputEquation.split('; ')
+
+            matrixOperand = []
+            for row in inputEquation:
+                row1 = row.split(' ')
+                for i, _ in enumerate(row1):
+                    row1[i] = tokenizer(row1[i])
+                matrixOperand.append(row1)
+
+            Matrix0 = Matrix()
+            Matrix0.value = matrixOperand
+            Matrix0_copy = copy.deepcopy(Matrix0)
+        if operation == 'simplify':
+            MatrixResult = simplifyMatrix(Matrix0)
+        elif operation == 'add':
+            MatrixResult = addMatrix(Matrix1, Matrix2)
+        elif operation == 'sub':
+            MatrixResult = subMatrix(Matrix1, Matrix2)
+        elif operation == 'mult':
+            MatrixResult = multiplyMatrix(Matrix1, Matrix2)
+        elif operation == 'determinant':
+            nonMatrixResult = True
+            sqMatrix = SquareMat()
+            sqMatrix.value = Matrix0.value
+            result = sqMatrix.determinant()
+        elif operation == 'trace':
+            nonMatrixResult = True
+            sqMatrix = SquareMat()
+            sqMatrix.value = Matrix0.value
+            result = sqMatrix.traceMat()
+        elif operation == 'inverse':
+            sqMatrix = SquareMat()
+            sqMatrix.value = Matrix0.value
+            MatrixResult = SquareMat()
+            MatrixResult = sqMatrix.inverse()
+
+        finalCLIstring = ''
+        if dualOperand:
+            if not scalarOperations:
+                finalCLIstring = resultMatrixString(operation=operation, operand1=Matrix1_copy, operand2=Matrix2_copy, result=MatrixResult)
+            else:
+                finalCLIstring = resultMatrixString(operation=operation, operand1=scalarTokens_copy, operand2=Matrix2_copy, result=MatrixResult)
+        else:
+            if nonMatrixResult:
+                finalCLIstring = resultMatrixString(operation=operation, operand1=Matrix0_copy, nonMatrixResult=True, result=result)
+            else:
+                finalCLIstring = resultMatrixString(operation=operation, operand1=Matrix0_copy, result=MatrixResult)
+        print(finalCLIstring)

data/visma/gui/logger.py

@@ -0,0 +1,59 @@
+import os
+import datetime
+from PyQt5.QtWidgets import QTextEdit, QVBoxLayout
+
+
+INFO = 20
+WARNING = 30
+ERROR = 40
+CRITICAL = 50
+THRES_LEV = 0
+NAME = ''
+logString = ''
+now = datetime.datetime.now()
+
+
+def logTextBox(workspace):
+    workspace.logBox = QTextEdit()
+    workspace.logBox.setReadOnly(True)
+    textLayout = QVBoxLayout()
+    textLayout.addWidget(workspace.logBox)
+    return textLayout
+
+
+def setLogName(name):
+    global NAME
+    NAME = name
+
+
+def setLevel(level):
+    global THRES_LEV
+    THRES_LEV = level
+
+
+def info(msg, *args):
+    if INFO >= THRES_LEV:
+        info = logWriter('INFO', msg, *args)
+        return info
+
+
+def warn(msg, *args):
+    if WARNING >= THRES_LEV:
+        warn = logWriter('WARNING', msg, *args)
+        return warn
+
+
+def error(msg, *args):
+    if ERROR >= THRES_LEV:
+        error = logWriter('ERROR', msg, *args)
+        return error
+
+
+def logWriter(levType, msg, *args):
+    try:
+        f = open(os.path.abspath("log.txt"), "a")
+    except IOError:
+        print('Can\'t open the log file')
+    logString = now.strftime("%Y-%m-%d %H:%M") + ' - ' + NAME + ' - ' + '%s: %s' % (levType, msg % args) + '\n'
+    f.write(logString)
+    return logString

data/visma/gui/plotter.py

@@ -0,0 +1,412 @@
+import numpy as np
+
+from matplotlib.figure import Figure
+from mpl_toolkits.mplot3d import Axes3D
+from matplotlib.backends.backend_qt5agg import FigureCanvasQTAgg as FigureCanvas
+from matplotlib.backends.backend_qt5agg import NavigationToolbar2QT as NavigationToolbar
+from PyQt5.QtCore import Qt
+from PyQt5.QtWidgets import QVBoxLayout, QLabel, QSlider, QSpinBox, QPushButton, QSplitter
+
+from visma.io.checks import getVariables, getTokensType
+from visma.io.tokenize import getLHSandRHS
+from visma.functions.constant import Constant
+from visma.functions.operator import Binary
+from visma.functions.structure import FuncOp
+from visma.functions.variable import Variable
+
+
+def graphPlot(workspace, again, tokens):
+    """Function for plotting graphs in 2D and 3D space
+
+    2D graphs are plotted for expression in one variable and equations in two variables. 3D graphs are plotted for expressions in two variables and equations in three variables.
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+
+    Returns:
+        graphVars {list} -- variables to be plotted on the graph
+        func {numpy.array(2D)/function(3D)} -- equation converted to compatible data type for plotting
+        variables {list} -- variables in given equation
+        again {bool} -- True when an equation can be plotted in 2D and 3D both else False
+
+    Note:
+        The func obtained from graphPlot() function is of different type for 2D and 3D plots. For 2D, func is a numpy array, and for 3D, func is a function.
+    """
+    if tokens is None:
+        axisRange = workspace.axisRange
+        tokens = workspace.eqToks[-1]
+    else:
+        axisRange = [10, 10, 10, 30]
+    eqType = getTokensType(tokens)
+    LHStok, RHStok = getLHSandRHS(tokens)
+    variables = sorted(getVariables(LHStok, RHStok))
+    dim = len(variables)
+    if (dim == 1) or ((dim == 2) and eqType == "equation"):
+        if again:
+            variables.append('f(' + variables[0] + ')')
+            graphVars, func = plotIn3D(LHStok, RHStok, variables, axisRange)
+        else:
+            graphVars, func = plotIn2D(LHStok, RHStok, variables, axisRange)
+        if dim == 1:
+            variables.append('f(' + variables[0] + ')')
+    elif (dim == 2 and eqType == "expression") or ((dim == 3) and eqType == "equation"):
+        graphVars, func = plotIn3D(LHStok, RHStok, variables, axisRange)
+        if dim == 2:
+            variables.append('f(' + variables[0] + ',' + variables[1] + ')')
+    else:
+        return [], None, None
+    return graphVars, func, variables
+
+
+def plotIn2D(LHStok, RHStok, variables, axisRange):
+    """Returns function array for 2D plots
+
+    Arguments:
+        LHStok {list} -- expression tokens
+        RHStok {list} -- expression tokens
+        variables {list} -- variables in equation
+        axisRange {list} -- axis limits
+
+    Returns:
+        graphVars {list} -- variables for plotting
+        func {numpy.array} -- equation to be plotted in 2D
+    """
+    xmin = -axisRange[0]
+    xmax = axisRange[0]
+    ymin = -axisRange[1]
+    ymax = axisRange[1]
+    xdelta = 0.01 * (xmax - xmin)
+    ydelta = 0.01 * (ymax - ymin)
+    xrange = np.arange(xmin, xmax, xdelta)
+    yrange = np.arange(ymin, ymax, ydelta)
+    graphVars = np.meshgrid(xrange, yrange)
+    function = getFunction(LHStok, RHStok, variables, graphVars, 2)
+    return graphVars, function
+
+
+def plotIn3D(LHStok, RHStok, variables, axisRange):
+    """Returns function for 3D plots
+
+    Arguments:
+        LHStok {list} -- expression tokens
+        RHStok {list} -- expression tokens
+        variables {list} -- variables in equation
+        axisRange {list} -- axis limits
+
+    Returns:
+        graphVars {list} -- variables for plotting
+        func {function} -- equation to be plotted in 3D
+    """
+
+    xmin = -axisRange[0]
+    xmax = axisRange[0]
+    ymin = -axisRange[1]
+    ymax = axisRange[1]
+    zmin = -axisRange[2]
+    zmax = axisRange[2]
+    meshLayers = axisRange[3]
+    xrange = np.linspace(xmin, xmax, meshLayers)
+    yrange = np.linspace(ymin, ymax, meshLayers)
+    zrange = np.linspace(zmin, zmax, meshLayers)
+    graphVars = [xrange, yrange, zrange]
+
+    def func(x, y, z):
+        graphVars = [x, y, z]
+        return getFunction(LHStok, RHStok, variables, graphVars, 3)
+
+    return graphVars, func
+
+
+def getFunction(LHStok, RHStok, eqnVars, graphVars, dim):
+    """Returns function for plotting
+
+    Arguments:
+        LHStok {list} -- expression tokens
+        RHStok {list} -- expression tokens
+        eqnVars {list} -- variables in equation
+        graphVars {list} -- variables for plotting
+        dim {int} -- dimenion of plot
+
+    Returns:
+        (LHS - RHS) {numpy.array(2D)/function(3D)} -- equation converted to compatible data type for plotting
+    """
+    LHS = getFuncExpr(LHStok, eqnVars, graphVars)
+    if len(eqnVars) == dim:
+        RHS = getFuncExpr(RHStok, eqnVars, graphVars)
+    elif len(eqnVars) == dim - 1:
+        RHS = graphVars[-1]
+    return LHS - RHS
+
+
+def getFuncExpr(exprTok, eqnVars, graphVars):
+    """Allocates variables in equation to graph variables to give final function compatible for plotting
+
+    Arguments:
+        exprTok {list} -- expression tokens
+        eqnVars {list} -- variables in equation
+        graphVars {list} -- variables for plotting
+
+    Returns:
+        expr {numpy.array(2D)/function(3D)} -- expression converted to compatible data type for plotting
+    """
+    expr = 0
+    coeff = 1
+    for token in exprTok:
+        if isinstance(token, Variable):
+            varProduct = 1
+            for value, power in zip(token.value, token.power):
+                varProduct *= graphVars[eqnVars.index(value)]**power
+            expr += coeff * token.coefficient * varProduct
+        elif isinstance(token, Constant):
+            expr += coeff * token.value
+        elif isinstance(token, FuncOp):
+            pass
+        elif isinstance(token, Binary) and token.value == '-':
+            coeff = -1
+        elif isinstance(token, Binary) and token.value == '+':
+            coeff = 1
+    return expr
+
+
+#######
+# GUI #
+#######
+
+
+def plotFigure2D(workspace):
+    """GUI layout for plot figure
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+
+    Returns:
+        layout {QtWidgets.QVBoxLayout} -- contains matplot figure
+    """
+    workspace.figure2D = Figure()
+    workspace.canvas2D = FigureCanvas(workspace.figure2D)
+    # workspace.figure2D.patch.set_facecolor('white')
+
+    class NavigationCustomToolbar(NavigationToolbar):
+        toolitems = [t for t in NavigationToolbar.toolitems if t[0] in ()]
+
+    workspace.toolbar2D = NavigationCustomToolbar(workspace.canvas2D, workspace)
+    layout = QVBoxLayout()
+    layout.addWidget(workspace.canvas2D)
+    layout.addWidget(workspace.toolbar2D)
+    return layout
+
+
+def plotFigure3D(workspace):
+    """GUI layout for plot figure
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+
+    Returns:
+        layout {QtWidgets.QVBoxLayout} -- contains matplot figure
+    """
+    workspace.figure3D = Figure()
+    workspace.canvas3D = FigureCanvas(workspace.figure3D)
+    # workspace.figure3D.patch.set_facecolor('white')
+
+    class NavigationCustomToolbar(NavigationToolbar):
+        toolitems = [t for t in NavigationToolbar.toolitems if t[0] in ()]
+
+    workspace.toolbar3D = NavigationCustomToolbar(workspace.canvas3D, workspace)
+    layout = QVBoxLayout()
+    layout.addWidget(workspace.canvas3D)
+    layout.addWidget(workspace.toolbar3D)
+    return layout
+
+
+def renderPlot(workspace, graphVars, func, variables, tokens=None):
+    """Renders plot for functions in 2D and 3D
+
+    Maps points from the numpy arrays for variables in given equation on the 2D/3D plot figure
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+        graphVars {list} -- variables for plotting
+        dim {int} -- dimenion of plot
+        variables {list} -- variables in equation
+    """
+    if len(graphVars) == 2:
+        X, Y = graphVars[0], graphVars[1]
+        ax = workspace.figure2D.add_subplot(111)
+        ax.clear()
+        ax.contour(X, Y, func, [0])
+        ax.grid()
+        ax.set_xlabel(r'$' + variables[0] + '$')
+        ax.set_ylabel(r'$' + variables[1] + '$')
+        workspace.figure2D.set_tight_layout({"pad": 1})  # removes extra padding
+        workspace.canvas2D.draw()
+        workspace.tabPlot.setCurrentIndex(0)
+    elif len(graphVars) == 3:
+        xrange = graphVars[0]
+        yrange = graphVars[1]
+        zrange = graphVars[2]
+        ax = Axes3D(workspace.figure3D)
+        for z in zrange:
+            X, Y = np.meshgrid(xrange, yrange)
+            Z = func(X, Y, z)
+            ax.contour(X, Y, Z + z, [z], zdir='z')
+        for y in yrange:
+            X, Z = np.meshgrid(xrange, zrange)
+            Y = func(X, y, Z)
+            ax.contour(X, Y + y, Z, [y], zdir='y')
+        for x in xrange:
+            Y, Z = np.meshgrid(yrange, zrange)
+            X = func(x, Y, Z)
+            ax.contour(X + x, Y, Z, [x], zdir='x')
+        if tokens is None:
+            axisRange = workspace.axisRange
+        else:
+            axisRange = [10, 10, 10, 30]
+        xmin = -axisRange[0]
+        xmax = axisRange[0]
+        ymin = -axisRange[1]
+        ymax = axisRange[1]
+        zmin = -axisRange[2]
+        zmax = axisRange[2]
+        ax.set_xlim3d(xmin, xmax)
+        ax.set_ylim3d(ymin, ymax)
+        ax.set_zlim3d(zmin, zmax)
+        ax.set_xlabel(r'$' + variables[0] + '$')
+        ax.set_ylabel(r'$' + variables[1] + '$')
+        ax.set_zlabel(r'$' + variables[2] + '$')
+        workspace.canvas3D.draw()
+        workspace.tabPlot.setCurrentIndex(1)
+
+
+def plot(workspace, tokens=None):
+    """When called from window.py it initiates rendering of equations.
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+    """
+    from visma.io.tokenize import tokenizer
+
+    workspace.figure2D.clear()
+    workspace.figure3D.clear()
+    if tokens is None:
+        tokens = workspace.eqToks[-1]
+    eqType = getTokensType(tokens)
+    LHStok, RHStok = getLHSandRHS(tokens)
+    variables = sorted(getVariables(LHStok, RHStok))
+    dim = len(variables)
+    graphVars, func, variables = graphPlot(workspace, False, tokens)
+    renderPlot(workspace, graphVars, func, variables, tokens)
+    if (dim == 1):
+        var2, var3 = selectAdditionalVariable(variables[0])
+        if tokens is None:
+            workspace.eqToks[-1] += tokenizer("0" + var2 + "+" + "0" + var3)
+        else:
+            tokens += tokenizer("0" + var2 + "+" + "0" + var3)
+    if (((dim == 2) or (dim == 1)) & (eqType == 'equation')):
+        graphVars, func, variables = graphPlot(workspace, True, tokens)
+        renderPlot(workspace, graphVars, func, variables, tokens)
+
+
+def selectAdditionalVariable(var1):
+    if var1 == 'z':
+        var2 = 'a'
+        var3 = 'b'
+        return var2, var3
+    if var1 == 'Z':
+        var2 = 'A'
+        var3 = 'B'
+        return var2, var3
+    var2 = chr(ord(var1) + 1)
+    var3 = chr(ord(var1) + 2)
+    return var2, var3
+
+
+def refreshPlot(workspace):
+    if workspace.resultOut is True and workspace.showPlotter is True:
+        plot(workspace)
+
+
+###############
+# preferences #
+###############
+# TODO: Add status tips, Fix docstrings
+
+def plotPref(workspace):
+
+    prefLayout = QSplitter(Qt.Horizontal)
+
+    workspace.xLimitValue = QLabel(
+        "X-axis range: (-" + str(workspace.axisRange[0]) + ", " + str(workspace.axisRange[0]) + ")")
+    workspace.yLimitValue = QLabel(
+        "Y-axis range: (-" + str(workspace.axisRange[1]) + ", " + str(workspace.axisRange[1]) + ")")
+    workspace.zLimitValue = QLabel(
+        "Z-axis range: (-" + str(workspace.axisRange[2]) + ", " + str(workspace.axisRange[2]) + ")")
+
+    def customSlider():
+        limitSlider = QSlider(Qt.Horizontal)
+        limitSlider.setMinimum(-3)
+        limitSlider.setMaximum(3)
+        limitSlider.setValue(1)
+        limitSlider.setTickPosition(QSlider.TicksBothSides)
+        limitSlider.setTickInterval(1)
+        limitSlider.valueChanged.connect(lambda: valueChange(workspace))
+        limitSlider.setStatusTip("Change axes limit")
+        return limitSlider
+
+    workspace.xLimitSlider = customSlider()
+    workspace.yLimitSlider = customSlider()
+    workspace.zLimitSlider = customSlider()
+
+    workspace.meshDensityValue = QLabel(
+        "Mesh Layers: " + str(workspace.axisRange[3]))
+    workspace.meshDensityValue.setStatusTip("Increment for a denser mesh in 3D plot")
+    workspace.meshDensity = QSpinBox()
+    workspace.meshDensity.setFixedSize(200, 30)
+    workspace.meshDensity.setRange(10, 75)
+    workspace.meshDensity.setValue(30)
+    workspace.meshDensity.valueChanged.connect(lambda: valueChange(workspace))
+    workspace.meshDensity.setStatusTip("Incrementing mesh density may affect performance")
+
+    refreshPlotterText = QLabel("Apply plotter settings")
+    refreshPlotter = QPushButton('Apply')
+    refreshPlotter.setFixedSize(200, 30)
+    refreshPlotter.clicked.connect(lambda: refreshPlot(workspace))
+    refreshPlotter.setStatusTip("Apply modified settings to plotter.")
+
+    axisPref = QSplitter(Qt.Vertical)
+    axisPref.addWidget(workspace.xLimitValue)
+    axisPref.addWidget(workspace.xLimitSlider)
+    axisPref.addWidget(workspace.yLimitValue)
+    axisPref.addWidget(workspace.yLimitSlider)
+    axisPref.addWidget(workspace.zLimitValue)
+    axisPref.addWidget(workspace.zLimitSlider)
+
+    plotSetPref = QSplitter(Qt.Vertical)
+    plotSetPref.addWidget(workspace.meshDensityValue)
+    plotSetPref.addWidget(workspace.meshDensity)
+    plotSetPref.addWidget(refreshPlotterText)
+    plotSetPref.addWidget(refreshPlotter)
+
+    prefLayout.addWidget(plotSetPref)
+    prefLayout.addWidget(axisPref)
+    prefLayout.setFixedWidth(400)
+
+    return prefLayout
+
+
+def valueChange(workspace):
+
+    xlimit = 10**workspace.xLimitSlider.value()
+    ylimit = 10**workspace.yLimitSlider.value()
+    zlimit = 10**workspace.zLimitSlider.value()
+    meshLayers = workspace.meshDensity.value()
+    workspace.axisRange = [xlimit, ylimit, zlimit, meshLayers]
+
+    workspace.xLimitValue.setText(
+        "X-axis range: (-" + str(workspace.axisRange[0]) + ", " + str(workspace.axisRange[0]) + ")")
+    workspace.yLimitValue.setText(
+        "Y-axis range: (-" + str(workspace.axisRange[1]) + ", " + str(workspace.axisRange[1]) + ")")
+    workspace.zLimitValue.setText(
+        "Z-axis range: (-" + str(workspace.axisRange[2]) + ", " + str(workspace.axisRange[2]) + ")")
+    workspace.meshDensityValue.setText(
+        "Mesh Layers: " + str(workspace.axisRange[3]))

data/visma/gui/qsolver.py

@@ -0,0 +1,108 @@
+from matplotlib.figure import Figure
+from matplotlib.backends.backend_qt5agg import FigureCanvasQTAgg as FigureCanvas
+from PyQt5 import QtWidgets
+
+from visma.io.tokenize import removeSpaces, getTerms, normalize, tokenizeSymbols, removeUnary, getToken, getLHSandRHS
+from visma.io.checks import checkEquation, checkTypes
+from visma.io.parser import tokensToLatex
+# from visma.gui.plotter import plot
+from visma.simplify.simplify import simplify, simplifyEquation
+from visma.gui import logger
+
+
+def quickSimplify(workspace):
+    """Dynamic simplifier for simplifying expression as it is being typed
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+
+    Returns:
+        qSolution/log {string} -- quick solution or error log
+        enableInteraction {bool} -- if False disables 'visma'(interaction) button
+    """
+    # FIXME: Crashes for some cases. Find and fix.
+    logger.setLogName('qsolver')
+    logger.setLevel(0)
+    qSolution = ""
+    strIn = workspace.textedit.toPlainText()
+    cleanInput = removeSpaces(strIn)
+    if ';' in cleanInput:
+        return "", True, True
+    terms = getTerms(cleanInput)
+    normalizedTerms = normalize(terms)
+    symTokens = tokenizeSymbols(normalizedTerms)
+    normalizedTerms, symTokens = removeUnary(normalizedTerms, symTokens)
+    if checkEquation(normalizedTerms, symTokens) is True and strIn != "":
+        if symTokens and symTokens[-1] is not False:
+            tokens = getToken(normalizedTerms, symTokens)
+            tokens = tokens.tokens
+            lhs, rhs = getLHSandRHS(tokens)
+            _, solutionType = checkTypes(lhs, rhs)
+            lhs, rhs = getLHSandRHS(tokens)
+            if solutionType == 'expression':
+                _, _, _, equationTokens, _ = simplify(tokens)
+                qSolution = r'$ ' + '= \ '
+            else:
+                _, _, _, _, equationTokens, _ = simplifyEquation(lhs, rhs)
+                qSolution = r'$ ' + '\Rightarrow \ '
+            qSolution += tokensToLatex(equationTokens[-1]) + ' $'
+            # workspace.eqToks = equationTokens
+            # plot(workspace)
+            return qSolution, True, False
+        elif symTokens:
+            log = "Invalid Expression"
+            workspace.logBox.append(logger.error(log))
+            return log, False, _
+        else:
+            log = ""
+            workspace.logBox.append(logger.error(log))
+            return log, False, _
+    else:
+        log = ""
+        if strIn != "":
+            _, log = checkEquation(normalizedTerms, symTokens)
+            workspace.logBox.append(logger.error(log))
+        return log, False, _
+
+
+#######
+# GUI #
+#######
+
+
+def qSolveFigure(workspace):
+    """GUI layout for quick simplifier
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+
+    Returns:
+        qSolLayout {QtWidgets.QVBoxLayout} -- quick simplifier layout
+    """
+
+    bg = workspace.palette().window().color()
+    bgcolor = (bg.redF(), bg.greenF(), bg.blueF())
+    workspace.qSolveFigure = Figure(edgecolor=bgcolor, facecolor=bgcolor)
+    workspace.solcanvas = FigureCanvas(workspace.qSolveFigure)
+    workspace.qSolveFigure.clear()
+    qSolLayout = QtWidgets.QVBoxLayout()
+    qSolLayout.addWidget(workspace.solcanvas)
+
+    return qSolLayout
+
+
+def renderQuickSol(workspace, log, showQSolver):
+    """Renders quick solution in matplotlib figure
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+    """
+    if showQSolver is True:
+        quickSolution = log
+    else:
+        quickSolution = ""
+    workspace.qSolveFigure.suptitle(quickSolution, x=0.01,
+                                    horizontalalignment='left',
+                                    verticalalignment='top')
+    #                               size=qApp.font().pointSize()*1.5)
+    workspace.solcanvas.draw()

data/visma/gui/settings.py

@@ -0,0 +1,92 @@
+from PyQt5.QtWidgets import QHBoxLayout, QCheckBox, QSplitter, QComboBox, QLabel
+from PyQt5.QtCore import Qt
+
+from visma.gui.steps import stepsPref
+from visma.gui.plotter import plotPref
+
+#######
+# GUI #
+#######
+
+
+def preferenceLayout(workspace):
+    """GUI layout for preferences
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+
+    Returns:
+        hbox {QtWidgets.QHBoxLayout} -- preferences layout
+    """
+
+    hbox = QHBoxLayout()
+
+    workspace.QSCheckBox = QCheckBox("Quick Simplifier")
+    workspace.QSCheckBox.setChecked(True)
+    workspace.QSCheckBox.toggled.connect(lambda: buttonState(workspace.QSCheckBox, workspace))
+
+    workspace.SSSCheckBox = QCheckBox("Step-by-step Solution")
+    workspace.SSSCheckBox.setFixedSize(200, 30)
+    workspace.SSSCheckBox.setChecked(True)
+    workspace.SSSCheckBox.toggled.connect(lambda: buttonState(workspace.SSSCheckBox, workspace))
+
+    workspace.GPCheckBox = QCheckBox("Graph Plotter")
+    workspace.GPCheckBox.setChecked(False)
+    workspace.GPCheckBox.toggled.connect(lambda: buttonState(workspace.GPCheckBox, workspace))
+
+    splitter1 = QSplitter(Qt.Vertical)
+    splitter1.addWidget(workspace.QSCheckBox)  # Quick Simplifier
+    splitter1.addWidget(workspace.SSSCheckBox)  # Step-by-step Solution
+    splitter1.addWidget(workspace.GPCheckBox)  # Graph Plotter
+
+    # Input Type Box
+    comboLabel = QLabel()
+    comboLabel.setText("Input Type:")
+    combo = QComboBox(workspace)
+    combo.setFixedSize(200, 30)
+    combo.addItem("Greek")
+    combo.addItem("LaTeX")
+    combo.activated[str].connect(workspace.onActivated)
+    stepspref1, stepspref2 = stepsPref(workspace)
+    inputTypeSplitter = QSplitter(Qt.Vertical)
+    inputTypeSplitter.addWidget(stepspref1)
+    inputTypeSplitter.addWidget(stepspref2)
+    inputTypeSplitter.addWidget(comboLabel)
+    inputTypeSplitter.addWidget(combo)
+
+    splitter = QSplitter(Qt.Horizontal)
+    splitter.addWidget(splitter1)
+    splitter.addWidget(inputTypeSplitter)
+    splitter.addWidget(plotPref(workspace))
+
+    hbox.addWidget(splitter)
+    return hbox
+
+
+def buttonState(button, workspace):
+    """Takes action according to button and its state change trigger
+
+    Arguments:
+        button {QtWidgets.QCheckBox} -- preference checkbox
+        workspace {QtWidgets.QWidget} -- main layout
+    """
+
+    workspace.clearAll()
+
+    if button.text() == "Quick Simplifier":
+        if button.isChecked() is True:
+            workspace.showQSolver = True
+        else:
+            workspace.showQSolver = False
+
+    elif button.text() == "Step-by-step Solution":
+        if button.isChecked() is True:
+            workspace.showStepByStep = True
+        else:
+            workspace.showStepByStep = False
+
+    elif button.text() == "Graph Plotter":
+        if button.isChecked() is True:
+            workspace.showPlotter = True
+        else:
+            workspace.showPlotter = False

data/visma/gui/steps.py

@@ -0,0 +1,65 @@
+from matplotlib.figure import Figure
+from matplotlib.backends.backend_qt5agg import FigureCanvasQTAgg as FigureCanvas
+from PyQt5.QtWidgets import QVBoxLayout, qApp, QLabel, QDoubleSpinBox, QScrollArea
+
+#######
+# GUI #
+#######
+
+
+def stepsFigure(workspace):
+    """GUI layout for step-by-step solution
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+
+    Returns:
+        stepslayout {QtWidgets.QVBoxLayout} -- step-by-step solution layout
+    """
+    workspace.stepsfigure = Figure()
+    workspace.stepscanvas = FigureCanvas(workspace.stepsfigure)
+    workspace.stepsfigure.clear()
+    workspace.scroll = QScrollArea()
+    workspace.scroll.setWidget(workspace.stepscanvas)
+    stepslayout = QVBoxLayout()
+    stepslayout.addWidget(workspace.scroll)
+    return stepslayout
+
+
+def showSteps(workspace):
+    """Renders step-by-step solution in matplotlib figure
+
+    Arguments:
+        workspace {QtWidgets.QWidget} -- main layout
+    """
+    workspace.stepsfigure.suptitle(workspace.output, y=0.98,
+                                   horizontalalignment='center',
+                                   verticalalignment='top', size=qApp.font().pointSize()*workspace.stepsFontSize)
+    workspace.stepscanvas.draw()
+    hbar = workspace.scroll.horizontalScrollBar()
+    hbar.setValue((hbar.minimum()+hbar.maximum())/2)
+
+
+###############
+# preferences #
+###############
+
+
+def stepsPref(workspace):
+
+    workspace.sizeChangeText = QLabel("Steps font size: " + str(round(workspace.stepsFontSize, 1)) + "x")
+    workspace.sizeChangeBox = QDoubleSpinBox()
+    workspace.sizeChangeBox.setFixedSize(200, 30)
+    workspace.sizeChangeBox.setRange(0.1, 10)
+    workspace.sizeChangeBox.setValue(1)
+    workspace.sizeChangeBox.setSingleStep(0.1)
+    workspace.sizeChangeBox.setSuffix('x')
+    workspace.sizeChangeBox.valueChanged.connect(lambda: sizeChange(workspace))
+    return workspace.sizeChangeText, workspace.sizeChangeBox
+
+
+def sizeChange(workspace):
+    workspace.stepsFontSize = workspace.sizeChangeBox.value()
+    workspace.sizeChangeText.setText("Steps font size: " + str(round(workspace.stepsFontSize, 1)) + "x")
+    if workspace.resultOut is True:
+        showSteps(workspace)