version 0.7

.github/workflows/sync-to-origin.yml

@@ -0,0 +1,14 @@
+on: [push]
+jobs:
+  sync-to-origin:
+    runs-on: ubuntu-latest
+    steps:
+        - uses: actions/checkout@v3
+          with:
+            fetch-depth: 0
+        - uses: yesolutions/mirror-action@master
+          with:
+            REMOTE: 'https://git.pupes.org/PoliEcho/bakatui.git'
+            GIT_USERNAME: api-user
+            GIT_PASSWORD: ${{ secrets.APIUSERKEY }}
+            GIT_PUSH_ARGS: --tags --prune

.gitignore

@@ -2,4 +2,6 @@
 .vscode
 compile_commands.json
 core*
-build
+build
+test-data
+log

LICENSE

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://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 <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<https://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
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

Makefile

@@ -1,23 +1,39 @@
-CC = g++
-CC_FLAGS = -std=c++23 -s -O3 -lncurses -lcurl -Wall -Wextra 
-#debug flags:
-#CC_FLAGS = -ggdb -std=c++23 -lncurses -lcurl -Wall -Wextra
+# Compiler and flags
+CPPC = g++
+CPPC_FLAGS = -std=c++23 -s -O3 -lncursesw -lcurl -lmenu -lpanel -Wall -Wextra -Wno-write-strings
+DEBUG_FLAGS = -ggdb -std=c++23 -lncursesw -lcurl -lmenu -lpanel -Wall -Wextra -Wno-write-strings
 
-all: build/bin/bakatui
 
-build/bin/bakatui: build/obj/main.o build/obj/net.o build/obj/helper_funcs.o
-	$(CC) $(CC_FLAGS) build/obj/main.o build/obj/net.o build/obj/helper_funcs.o -o build/bin/bakatui
+SRC_PATH := src
+OBJ_PATH := build/obj
+BIN_PATH := build/bin
 
-build/obj/main.o: src/main.cpp
-	mkdir -p build/obj
-	mkdir -p build/bin
-	$(CC) $(CC_FLAGS) -c src/main.cpp -o build/obj/main.o
 
-build/obj/net.o: src/net.cpp
-	$(CC) $(CC_FLAGS) -c src/net.cpp -o build/obj/net.o
+SRC_FILES := $(shell find $(SRC_PATH) -name '*.cpp')
+OBJ_FILES := $(patsubst $(SRC_PATH)/%.cpp,$(OBJ_PATH)/%.o,$(SRC_FILES))
+
+
+all: make-build-dir $(BIN_PATH)/bakatui
+
+
+debug: CPPC_FLAGS = $(DEBUG_FLAGS)
+debug: make-build-dir $(BIN_PATH)/bakatui
+
+
+make-build-dir:
+	mkdir -p $(OBJ_PATH)
+	mkdir -p $(BIN_PATH)
+
+
+$(BIN_PATH)/bakatui: $(OBJ_FILES)
+	$(CPPC) $(CPPC_FLAGS) $^ -o $@
+
+
+$(OBJ_PATH)/%.o: $(SRC_PATH)/%.cpp
+	$(CPPC) $(CPPC_FLAGS) -c $< -o $@
 
-build/obj/helper_funcs.o: src/helper_funcs.cpp
-	$(CC) $(CC_FLAGS) -c src/helper_funcs.cpp -o build/obj/helper_funcs.o 
 
 clean:
-	rm -fr build      
+	rm -fr build
+
+.PHONY: all clean install debug

README.md

@@ -3,3 +3,12 @@
 
 > ### Dependencies:
 > [nlohmann-json](https://github.com/nlohmann/json)  
+> ncurses  
+
+> [!IMPORTANT]  
+> Only folowing works:
+> - [x] Login  
+> - [x] Marks  
+> - [x] Timetable  
+> - [ ] Komens  
+> - [ ] Absence

src/color.h

@@ -1,3 +1,7 @@
+
+// Header guard
+#ifndef RESET
+
 #define RESET   "\033[0m"
 #define BLACK   "\033[30m"      /* Black */
 #define RED     "\033[31m"      /* Red */
@@ -14,4 +18,6 @@
 #define BOLDBLUE    "\033[1m\033[34m"      /* Bold Blue */
 #define BOLDMAGENTA "\033[1m\033[35m"      /* Bold Magenta */
 #define BOLDCYAN    "\033[1m\033[36m"      /* Bold Cyan */
-#define BOLDWHITE   "\033[1m\033[37m"      /* Bold White */
+#define BOLDWHITE   "\033[1m\033[37m"      /* Bold White */
+
+#endif

src/const.h

@@ -0,0 +1,19 @@
+#include <string_view>
+#ifndef VERSION
+
+#define VERSION "0.7"
+#define NAME "bakatui"
+
+inline constexpr auto hash_djb2a(const std::string_view sv) {
+  unsigned long hash{5381};
+  for (unsigned char c : sv) {
+    hash = ((hash << 5) + hash) ^ c;
+  }
+  return hash;
+}
+
+inline constexpr auto operator"" _sh(const char *str, size_t len) {
+  return hash_djb2a(std::string_view{str, len});
+}
+
+#endif

src/flags.cpp

@@ -0,0 +1,24 @@
+#include "const.h"
+#include <iostream>
+#include "helper_funcs.h"
+#include <cstdio>
+
+void PrintHelp() {
+    std::cout << "Usage: " << NAME << " [OPTIONS]" << "\n"
+    << "-h        Show this help menu\n"
+    << "-V        Show version\n"
+    << "-v        verbose mode\n"
+    << "-L        Force new login\n"
+    << "-S        Ignore SSL cert validity\n";
+    safe_exit(0);
+  }
+  
+void PrintVersion() {
+    std::cout << NAME" " << VERSION"\n" << "License GPLv3: GNU GPL version 3 <https://gnu.org/licenses/gpl.html>.\n";
+    safe_exit(0);
+  }
+
+void DeleteLogin(std::string savedir_path) {
+    std::remove((savedir_path + "/authfile").c_str());
+    std::remove((savedir_path + "/urlfile").c_str());
+}

src/flags.h

@@ -0,0 +1,10 @@
+#include <string>
+// header guard
+#ifndef _ba_fl_hg_
+#define _ba_fl_hg_
+
+void PrintHelp();
+void PrintVersion();
+void DeleteLogin(std::string savedir_path);
+
+#endif

src/helper_funcs.cpp

@@ -1,10 +1,19 @@
+#include "helper_funcs.h"
+#include "color.h"
+#include "net.h"
+#include <codecvt>
 #include <csignal>
 #include <curses.h>
+#include <dirent.h>
+#include <filesystem>
+#include <fstream>
 #include <iostream>
-#include <stdio.h>
+#include <locale>
+#include <panel.h>
 #include <string>
 #include <termios.h>
 #include <unistd.h>
+#include "main.h"
 
 void safe_exit(int code) {
   switch (code) {
@@ -23,12 +32,206 @@ void safe_exit(int code) {
 
   case SIGSEGV:
     std::cerr << "\nreceived SIGSEGV(segmentaiton fault) exiting...\nIf this "
-                 "repeats please report it as bug\n";
+                 "repeats please report it as a bug\n";
     break;
 
   default:
     break;
   }
 
+  curl_easy_cleanup(curl);
+  endwin();
+
   exit(code);
-}
+}
+
+std::string bool_to_string(bool bool_in) { return bool_in ? "true" : "false"; }
+
+std::string SoRAuthFile(bool save, std::string data) {
+
+  std::string home = std::getenv("HOME");
+  if (home.empty()) {
+    std::cerr << RED "[ERROR] " RESET << "HOME environment variable not set.\n";
+    safe_exit(EXIT_FAILURE);
+  }
+
+  std::string savedir_path = home;
+  savedir_path.append("/.local/share/bakatui");
+
+  if (!std::filesystem::exists(savedir_path)) {
+    if (!std::filesystem::create_directories(savedir_path)) {
+      std::cerr << RED "[ERROR] " RESET
+                << "Failed to create directory: " << savedir_path << "\n";
+      safe_exit(EXIT_FAILURE);
+    }
+  }
+
+  std::string authfile_path = savedir_path + "/auth";
+
+  if (save) {
+    std::ofstream authfile(authfile_path);
+    if (!authfile.is_open()) {
+      std::cerr << RED "[ERROR] " RESET
+                << "Failed to open auth file for writing.\n";
+      safe_exit(EXIT_FAILURE);
+    }
+    authfile << data;
+    authfile.close();
+    return "";
+  } else {
+    std::ifstream authfile(authfile_path);
+    if (!authfile.is_open()) {
+      std::cerr << RED "[ERROR] " RESET
+                << "Failed to open auth file for reading.\n";
+      safe_exit(EXIT_FAILURE);
+    }
+    data.assign((std::istreambuf_iterator<char>(authfile)),
+                std::istreambuf_iterator<char>());
+    authfile.close();
+    return data;
+  }
+}
+
+void get_input_and_login() {
+  std::string username;
+  std::cout << "enter username: ";
+  std::cin >> username;
+  std::string password;
+
+  password = getpass("enter password: ");
+  // DEBUG
+  // std::cout << "\nenter password: ";
+  // std::cin >> password;
+
+  bakaapi::login(username, password);
+}
+
+// Original function
+void print_in_middle(WINDOW *win, int starty, int startx, int width,
+                     const char *string, chtype color) {
+  int length, x, y;
+  float temp;
+
+  if (win == NULL)
+    win = stdscr;
+  getyx(win, y, x);
+  if (startx != 0)
+    x = startx;
+  if (starty != 0)
+    y = starty;
+  if (width == 0)
+    width = 80;
+
+  length = strlen(string);
+  temp = (width - length) / 2;
+  x = startx + (int)temp;
+  wattron(win, color);
+  mvwprintw(win, y, x, "%s", string);
+  wattroff(win, color);
+  refresh();
+}
+
+// Wide character version
+void wprint_in_middle(WINDOW *win, int starty, int startx, int width,
+                      const wchar_t *string, chtype color) {
+  int length, x, y;
+  float temp;
+
+  if (win == NULL)
+    win = stdscr;
+  getyx(win, y, x);
+  if (startx != 0)
+    x = startx;
+  if (starty != 0)
+    y = starty;
+  if (width == 0)
+    width = 80;
+
+  length = wcslen(string);
+  temp = (width - length) / 2;
+  x = startx + (int)temp;
+  wattron(win, color);
+  if (mvwaddwstr(win, y, x, string) == ERR) {
+    if(config.verbose){
+    std::wcerr << RED"[ERROR]"<< RESET" wprint_in_middle failed to print " << string << "\n";
+  }}
+  wattroff(win, color);
+  refresh();
+}
+
+const std::string WHITESPACE = " \n\r\t\f\v";
+const std::wstring WWHITESPACE = L" \n\r\t\f\v";
+
+std::string ltrim(const std::string &s) {
+  size_t start = s.find_first_not_of(WHITESPACE);
+  return (start == std::string::npos) ? "" : s.substr(start);
+}
+
+std::string rtrim(const std::string &s) {
+  size_t end = s.find_last_not_of(WHITESPACE);
+  return (end == std::string::npos) ? "" : s.substr(0, end + 1);
+}
+
+std::string rm_tr_le_whitespace(const std::string &s) {
+  return rtrim(ltrim(s));
+}
+
+// Wide character versions
+std::wstring wltrim(const std::wstring &s) {
+  size_t start = s.find_first_not_of(WWHITESPACE);
+  return (start == std::wstring::npos) ? L"" : s.substr(start);
+}
+
+std::wstring wrtrim(const std::wstring &s) {
+  size_t end = s.find_last_not_of(WWHITESPACE);
+  return (end == std::wstring::npos) ? L"" : s.substr(0, end + 1);
+}
+
+std::wstring wrm_tr_le_whitespace(const std::wstring &s) {
+  return wrtrim(wltrim(s));
+}
+
+// Conversion utilities
+char *wchar_to_char(wchar_t *src) {
+  if (!src)
+    return nullptr;
+
+  size_t len = wcslen(src) + 1; // +1 for null terminator
+  char *dest = new char[len * MB_CUR_MAX];
+
+  std::wcstombs(dest, src, len * MB_CUR_MAX);
+  return dest;
+}
+
+wchar_t *char_to_wchar(char *src) {
+  if (!src)
+    return nullptr;
+
+  size_t len = strlen(src) + 1; // +1 for null terminator
+  wchar_t *dest = new wchar_t[len];
+
+  std::mbstowcs(dest, src, len);
+  return dest;
+}
+
+std::wstring string_to_wstring(const std::string &str) {
+  std::wstring_convert<std::codecvt_utf8<wchar_t>> converter;
+  return converter.from_bytes(str);
+}
+
+std::string wstring_to_string(const std::wstring &wstr) {
+  std::wstring_convert<std::codecvt_utf8<wchar_t>> converter;
+  return converter.to_bytes(wstr);
+}
+
+void move_panel_relative(PANEL *panel, int dy, int dx) {
+  WINDOW *win = panel_window(panel);
+  int y, x;
+
+  getbegyx(win, y, x);
+
+  int new_y = y + dy;
+  int new_x = x + dx;
+
+  move_panel(panel, new_y, new_x);
+}

src/helper_funcs.h

@@ -1,2 +1,32 @@
+#include <curses.h>
 #include <string>
-void safe_exit(int code);
+
+// header guard
+#ifndef _ba_hf_hg_
+#define _ba_hf_hg_
+
+#define ARRAY_SIZE(a) (sizeof(a) / sizeof(a[0]))
+
+void safe_exit(int code);
+std::string bool_to_string(bool bool_in);
+std::string SoRAuthFile(bool save, std::string data);
+void get_input_and_login();
+
+// Original functions
+void print_in_middle(WINDOW *win, int starty, int startx, int width,
+                     const char *string, chtype color);
+std::string rm_tr_le_whitespace(const std::string &s);
+
+// Wide character support functions
+void wprint_in_middle(WINDOW *win, int starty, int startx, int width,
+                      const wchar_t *string, chtype color);
+std::wstring wrm_tr_le_whitespace(const std::wstring &s);
+
+// Conversion utilities
+char *wchar_to_char(wchar_t *src);
+wchar_t *char_to_wchar(char *src);
+
+std::wstring string_to_wstring(const std::string &str);
+std::string wstring_to_string(const std::wstring &wstr);
+
+#endif

src/main.cpp

@@ -1,17 +1,24 @@
 #include "main.h"
 #include "color.h"
 #include "helper_funcs.h"
+#include "main_menu.h"
 #include "net.h"
 #include <csignal>
+#include <cstdlib>
 #include <curl/curl.h>
 #include <curses.h>
+#include <fstream>
 #include <iostream>
 #include <regex>
 #include <string>
 #include <unistd.h>
+#include "flags.h"
+#include "types.h"
 
 std::string baka_api_url;
 
+Config config;
+
 int main(int argc, char **argv) {
   // signal handlers
   signal(SIGTERM, safe_exit);
@@ -22,59 +29,56 @@ int main(int argc, char **argv) {
   // error signal handlers
   signal(SIGSEGV, safe_exit);
 
-  /*initscr();
-
-  // creating a window;
-  // with height = 15 and width = 10
-  // also with start x axis 10 and start y axis = 20
-  WINDOW *win = newwin(15, 17, 2, 10);
-  refresh();
-
-  // making box border with default border styles
-  box(win, 0, 0);
-
-  // move and print in window
-  mvwprintw(win, 0, 1, "Greeter");
-  mvwprintw(win, 1, 1, "Hello");
-
-  // refreshing the window
-  wrefresh(win);
-
-  getch();
-  endwin(); */
-  std::cout << "enter school bakalari url:\n";
-  while (true) {
-    std::cout << "(or q to quit )";
-    std::cin >> baka_api_url;
-
-    const std::regex url_regex_pattern(
-        R"((http|https)://(www\.)?[a-zA-Z0-9@:%._\+~#?&//=]{2,256}\.[a-z]{2,6}(/\S*)?)");
-
-    if (std::regex_match(baka_api_url, url_regex_pattern)) {
-      break;
-    } else if (baka_api_url == "q") {
-      std::cerr << GREEN "[NOTICE] " << RESET "user quit\n";
-      return 255;
-    }
-    std::cerr << "enter valid url using following pattern "
-                 "[(http|https)://school.bakalari.url]\n";
-  }
-  if (baka_api_url.back() != '/') {
-    baka_api_url.append("/");
-  }
-
   {
-    std::string username;
-    std::cout << "enter username: ";
-    std::cin >> username;
-    std::string password;
 
-    password = getpass("enter password: ");
-    // DEBUG
-    // std::cout << "\nenter password: ";
-    // std::cin >> password;
+    std::string savedir_path = std::getenv("HOME");
+    savedir_path.append("/.local/share/bakatui");
 
-    bakaapi::login(username, password);
+    int opt;
+    while ((opt = getopt(argc, argv, "hVvLS:")) != -1) {
+        switch (opt) {
+            case 'h': PrintHelp(); break;
+            case 'V': PrintVersion(); break;
+            case 'v': config.verbose = true; break;
+            case 'L': DeleteLogin(savedir_path); break;
+            case 'S': config.ignoressl = true; break;
+            default: std::cerr << RED"[ERROR]" << RESET" invalid option: " << (char)optopt << "\ntry: -h\n"; safe_exit(EINVAL);
+        }
+    }
+
+    std::string urlfile_path = std::string(savedir_path) + "/url";
+    std::ifstream urlfile;
+    urlfile.open(urlfile_path);
+    urlfile >> baka_api_url;
+    urlfile.close();
   }
+
+  if (baka_api_url.empty()) {
+
+    std::cout << "enter school bakalari url:\n";
+    while (true) {
+      std::cout << "(or q to quit )";
+      std::cin >> baka_api_url;
+
+      const std::regex url_regex_pattern(
+          R"((http|https)://(www\.)?[a-zA-Z0-9@:%._\+~#?&//=]{2,256}\.[a-z]{2,6}(/\S*)?)");
+
+      if (std::regex_match(baka_api_url, url_regex_pattern)) {
+        break;
+      } else if (baka_api_url == "q") {
+        std::cerr << GREEN "[NOTICE] " << RESET "user quit\n";
+        return 255;
+      }
+      std::cerr << "enter valid url using following pattern "
+                   "[(http|https)://school.bakalari.url]\n";
+    }
+    if (baka_api_url.back() != '/') {
+      baka_api_url.append("/");
+    }
+
+    get_input_and_login();
+  }
+  main_menu();
+  
   return 0;
 }

src/main.h

@@ -1,4 +1,11 @@
 #include <curl/curl.h>
 #include <string>
+#include "types.h"
+// header guard
+#ifndef _ba_ma_hg_
+#define _ba_ma_hg_
 
 extern std::string baka_api_url;
+extern Config config;
+
+#endif

src/main_menu.cpp

@@ -0,0 +1,110 @@
+#include "helper_funcs.h"
+#include "net.h"
+#include "timetable.h"
+#include <cstddef>
+#include <cstdlib>
+#include <cstring>
+#include <curses.h>
+#include <menu.h>
+
+#include "marks.h"
+
+#define CTRLD 4
+
+wchar_t *choices[] = {
+    L"login",    L"Marks",   L"timetable", L"Komens",
+    L"Homework", L"Absence", L"Exit",      (wchar_t *)NULL,
+};
+void (*choicesFuncs[])() = {nullptr, marks_page, timetable_page, nullptr,
+                            nullptr, nullptr,    nullptr,        nullptr};
+
+void main_menu() {
+  ITEM **my_items;
+  int c;
+  MENU *my_menu;
+  WINDOW *my_menu_win;
+  int n_choices, i;
+
+  /* Initialize curses */
+  setlocale(LC_ALL, "");
+  initscr();
+  start_color();
+  cbreak();
+  noecho();
+  keypad(stdscr, TRUE);
+  init_pair(1, COLOR_RED, COLOR_BLACK);
+  init_pair(2, COLOR_CYAN, COLOR_BLACK);
+
+  /* Create items */
+  n_choices = ARRAY_SIZE(choices);
+  my_items = (ITEM **)calloc(n_choices, sizeof(ITEM *));
+  for (i = 0; i < n_choices; ++i)
+    my_items[i] =
+        new_item(wchar_to_char(choices[i]), wchar_to_char(choices[i]));
+
+  /* Crate menu */
+  my_menu = new_menu((ITEM **)my_items);
+
+  /* Create the window to be associated with the menu */
+  my_menu_win = newwin(12, 40, 4, 4);
+  keypad(my_menu_win, TRUE);
+
+  /* Set main window and sub window */
+  set_menu_win(my_menu, my_menu_win);
+  set_menu_sub(my_menu, derwin(my_menu_win, 8, 38, 3, 1));
+  set_menu_format(my_menu, 7, 1);
+
+  /* Set menu mark to the string " * " */
+  set_menu_mark(my_menu, " * ");
+
+  /* Print a border around the main window and print a title */
+  box(my_menu_win, 0, 0);
+
+  wprint_in_middle(my_menu_win, 1, 0, 40, L"Main Menu", COLOR_PAIR(1));
+  mvwaddch(my_menu_win, 2, 0, ACS_LTEE);
+  mvwhline(my_menu_win, 2, 1, ACS_HLINE, 38);
+  mvwaddch(my_menu_win, 2, 39, ACS_RTEE);
+
+  /* Post the menu */
+  post_menu(my_menu);
+  wrefresh(my_menu_win);
+
+  attron(COLOR_PAIR(2));
+  mvprintw(LINES - 2, 0,
+           "Use PageUp and PageDown to scoll down or up a page of items");
+  mvprintw(LINES - 1, 0, "Arrow Keys to navigate (F1 to Exit)");
+  attroff(COLOR_PAIR(2));
+  refresh();
+
+  while ((c = getch()) != KEY_F(1)) {
+    switch (c) {
+    case KEY_DOWN:
+      menu_driver(my_menu, REQ_DOWN_ITEM);
+      break;
+    case KEY_UP:
+      menu_driver(my_menu, REQ_UP_ITEM);
+      break;
+    case KEY_NPAGE:
+      menu_driver(my_menu, REQ_DOWN_ITEM);
+      break;
+    case KEY_PPAGE:
+      menu_driver(my_menu, REQ_UP_ITEM);
+      break;
+    case 10: // ENTER
+      clear();
+      choicesFuncs[item_index(current_item(my_menu))]();
+      pos_menu_cursor(my_menu);
+      refresh();
+      wrefresh(my_menu_win);
+      break;
+    }
+    wrefresh(my_menu_win);
+  }
+
+  /* Unpost and free all the memory taken up */
+  unpost_menu(my_menu);
+  free_menu(my_menu);
+  for (i = 0; i < n_choices; ++i)
+    free_item(my_items[i]);
+  endwin();
+}

src/main_menu.h

@@ -0,0 +1,7 @@
+// header guard
+#ifndef _ba_mm_hg_
+#define _ba_mm_hg_
+
+void main_menu();
+
+#endif

src/marks.cpp

@@ -0,0 +1,258 @@
+#include "marks.h"
+#include "helper_funcs.h"
+#include "net.h"
+#include <algorithm>
+#include <cstddef>
+#include <cstdint>
+#include <cstdio>
+#include <cstring>
+#include <curses.h>
+#include <format>
+#include <menu.h>
+#include <nlohmann/json.hpp>
+#include <panel.h>
+#include <string>
+
+using nlohmann::json;
+
+// This code is based on
+// https://github.com/tony/NCURSES-Programming-HOWTO-examples/blob/master/16-panels
+// MIT License (see original file)
+
+#define NLINES 10
+#define NCOLS 40
+
+#define DEFAULT_X_OFFSET 10
+#define DEFAULT_Y_OFFSET 2
+
+#define DEFAULT_PADDING 4
+
+void init_wins(WINDOW **wins, int n, json marks_json);
+void win_show(WINDOW *win, wchar_t *label, int label_color, int width,
+              int height, json marks_json, int SubjectIndex);
+
+void marks_page() {
+  // DONT FORGET TO UNCOMMENT
+  json resp_from_api = bakaapi::get_data_from_endpoint("api/3/marks");
+  // std::ifstream f("test-data/marks3.json");
+  // json resp_from_api = json::parse(f);
+
+  WINDOW **my_wins;
+  size_t size_my_wins = resp_from_api["Subjects"].size();
+  my_wins = new (std::nothrow) WINDOW *[size_my_wins];
+
+  PANEL **my_panels;
+  size_t size_my_panels = resp_from_api["Subjects"].size();
+  my_panels = new (std::nothrow) PANEL *[size_my_panels];
+
+  // trows compiler warning for some reason but cannot be removed
+  PANEL *top;
+  int ch;
+
+  setlocale(LC_ALL, "");
+  /* Initialize curses */
+  initscr();
+  start_color();
+  cbreak();
+  noecho();
+  keypad(stdscr, TRUE);
+
+  /* Initialize all the colors */
+  for (uint8_t i = 0; i < 8; i++) {
+    init_pair(i, i, COLOR_BLACK);
+  }
+
+  init_wins(my_wins, resp_from_api["Subjects"].size(), resp_from_api);
+
+  // store all original window position
+  int *original_y = new int[size_my_wins];
+  int *original_x = new int[size_my_wins];
+  for (size_t i = 0; i < size_my_wins; ++i) {
+    getbegyx(my_wins[i], original_y[i], original_x[i]);
+  }
+
+  // Attach panels
+  for (size_t i = 0; i < size_my_panels; i++) {
+    my_panels[i] = new_panel(my_wins[i]);
+    set_panel_userptr(my_panels[i], (i + 1 < size_my_panels) ? my_panels[i + 1]
+                                                             : my_panels[0]);
+  }
+
+  update_panels();
+  attron(COLOR_PAIR(4));
+  mvprintw(LINES - 2, 0, "Arrows/j/k to scroll | F1 to exit | {mark} [weight]");
+  attroff(COLOR_PAIR(4));
+  doupdate();
+
+  top = my_panels[size_my_panels - 1];
+  long y_offset = 0;
+
+  // Main loop
+  while ((ch = getch()) != KEY_F(1)) {
+    bool needs_update = false;
+
+    switch (ch) {
+    case KEY_UP:
+    case 'k': // Vim-style up
+      y_offset--;
+      needs_update = true;
+      break;
+
+    case KEY_DOWN:
+    case 'j': // Vim-style down
+      y_offset++;
+      needs_update = true;
+      break;
+    }
+
+    // Update window positions if scrolled
+    if (needs_update) {
+      for (size_t i = 0; i < size_my_panels; ++i) {
+        int new_y = original_y[i] - y_offset;
+        int new_x = original_x[i];
+        move_panel(my_panels[i], new_y, new_x);
+      }
+
+      update_panels();
+      doupdate();
+    }
+  }
+
+  // Cleanup
+  endwin();
+  clear();
+  delete[] my_wins;
+  delete[] my_panels;
+  delete[] original_y;
+  delete[] original_x;
+}
+
+/* Put all the windows */
+void init_wins(WINDOW **wins, int n, json marks_json) {
+  int x, y, i;
+  wchar_t label[1500];
+
+  y = DEFAULT_Y_OFFSET;
+  x = DEFAULT_X_OFFSET;
+  uint8_t curent_color = 0;
+
+  unsigned int MaxHight = 0;
+  // this loop through subjects
+  for (i = 0; i < n; ++i) {
+
+    // Calculate label and max_text_length to determine window width
+    std::string sub_name = marks_json["Subjects"][i]["Subject"]["Name"];
+    std::string sub_avg_s = marks_json["Subjects"][i]["AverageText"];
+
+    // Convert to wchar_t
+    std::wstring wsub_name = string_to_wstring(sub_name);
+    std::wstring wsub_avg_s = string_to_wstring(sub_avg_s);
+
+    // Using swprintf for wide character formatting
+    swprintf(label, sizeof(label) / sizeof(label[0]), L"%ls - avg: %ls",
+             wsub_name.c_str(), wsub_avg_s.c_str());
+
+    size_t max_text_length = wcslen(label);
+    for (unsigned int j = 0; j < static_cast<unsigned int>(marks_json["Subjects"][i]["Marks"].size()); j++) {
+      std::string caption =
+          rm_tr_le_whitespace(marks_json["Subjects"][i]["Marks"][j]["Caption"]);
+      std::string theme =
+          rm_tr_le_whitespace(marks_json["Subjects"][i]["Marks"][j]["Theme"]);
+
+      std::wstring wcaption = string_to_wstring(caption);
+      std::wstring wtheme = string_to_wstring(theme);
+
+      // Some code that does something and fixes some edge cases
+      std::string testCaption = caption + std::format(" {{{}}} [{}]", "X", 0);
+      std::wstring wTestCaption = string_to_wstring(testCaption);
+      max_text_length =
+          std::max({max_text_length, wTestCaption.length(), wtheme.length()});
+    }
+
+    int width = max_text_length + DEFAULT_PADDING;
+
+    // handle windows overflowing off screen
+    if (x + width > COLS) {
+      x = DEFAULT_X_OFFSET;
+      y += MaxHight + 2;
+      MaxHight = 0;
+    }
+
+    if (static_cast<unsigned int>(marks_json["Subjects"][i]["Marks"].size()) * 2 + DEFAULT_PADDING > MaxHight) {
+      MaxHight =
+          marks_json["Subjects"][i]["Marks"].size() * 2 + DEFAULT_PADDING;
+    }
+
+    wins[i] = newwin(NLINES, NCOLS, y, x);
+    win_show(wins[i], label, curent_color + 1, width,
+             marks_json["Subjects"][i]["Marks"].size() * 2 + DEFAULT_PADDING,
+             marks_json, i);
+
+    curent_color = (curent_color + 1) % 7;
+    x += width + 5;
+  }
+}
+
+/* Show the window with a border and a label */
+void win_show(WINDOW *win, wchar_t *label, int label_color, int width,
+              int height, json marks_json, int SubjectIndex) {
+  
+  // is the compiler smoking weed or something, why is it thinking starty is not used ??
+  int startx, starty;
+
+  wresize(win, height, width);
+
+  getbegyx(win, starty, startx);
+  getmaxyx(win, height, width);
+
+  box(win, 0, 0);
+  mvwaddch(win, 2, 0, ACS_LTEE);
+  mvwhline(win, 2, 1, ACS_HLINE, width - 2);
+  mvwaddch(win, 2, width - 1, ACS_RTEE);
+
+  wprint_in_middle(win, 1, 0, width, label, COLOR_PAIR(label_color));
+
+  wchar_t CaptionBuf[1500];
+  wchar_t ThemeBuf[1500];
+  std::wstring wCaption;
+  int AdditionalOffset = 0;
+
+  for (size_t i = 0; i < marks_json["Subjects"][SubjectIndex]["Marks"].size();
+       i++) {
+    std::string Caption =
+        marks_json["Subjects"][SubjectIndex]["Marks"][i]["Caption"];
+    Caption = rm_tr_le_whitespace(Caption);
+
+    std::string MarkText =
+        marks_json["Subjects"][SubjectIndex]["Marks"][i]["MarkText"];
+    int Weight = marks_json["Subjects"][SubjectIndex]["Marks"][i]["Weight"];
+
+    // Create formatted string with mark and weight
+    std::string formattedCaption =
+        Caption + std::format(" - {{{}}} [{}]", MarkText, Weight);
+
+    // Convert to wide string
+    wCaption = string_to_wstring(formattedCaption);
+
+    wcsncpy(CaptionBuf, wCaption.c_str(),
+            sizeof(CaptionBuf) / sizeof(CaptionBuf[0]) - 1);
+    CaptionBuf[sizeof(CaptionBuf) / sizeof(CaptionBuf[0]) - 1] =
+        L'\0'; // Ensure null termination
+
+    wprint_in_middle(win, 3 + i + AdditionalOffset, 0, width, CaptionBuf,
+                     COLOR_PAIR(label_color));
+
+    std::string Theme =
+        marks_json["Subjects"][SubjectIndex]["Marks"][i]["Theme"];
+    std::wstring wTheme = string_to_wstring(rm_tr_le_whitespace(Theme));
+
+    wcsncpy(ThemeBuf, wTheme.c_str(),
+            sizeof(ThemeBuf) / sizeof(ThemeBuf[0]) - 1);
+    ThemeBuf[sizeof(ThemeBuf) / sizeof(ThemeBuf[0]) - 1] =
+        L'\0'; // Ensure null termination
+
+    wprint_in_middle(win, 3 + i + 1 + AdditionalOffset, 0, width, ThemeBuf,
+                     COLOR_PAIR(label_color));
+    AdditionalOffset++;
+  }
+}

src/marks.h

@@ -0,0 +1,5 @@
+// header guard
+#ifndef _ba_mp_hg_
+#define _ba_mp_hg_
+void marks_page();
+#endif

src/net.cpp

@@ -1,23 +1,33 @@
 #include "net.h"
 #include "color.h"
+#include "const.h"
 #include "helper_funcs.h"
 #include "main.h"
+#include <cerrno>
 #include <cmath>
 #include <cstddef>
 #include <cstdlib>
 #include <cstring>
 #include <curl/curl.h>
+#include <curses.h>
 #include <dirent.h>
-#include <errno.h>
-#include <filesystem>
 #include <format>
 #include <fstream>
 #include <iostream>
 #include <nlohmann/json.hpp>
+#include <nlohmann/json_fwd.hpp>
 #include <string>
 
 using nlohmann::json;
 
+// metods
+enum {
+  GET,
+  POST,
+};
+
+std::string access_token;
+
 CURL *curl = curl_easy_init();
 
 // Callback function to write data into a std::string
@@ -28,32 +38,47 @@ size_t WriteCallback(void *contents, size_t size, size_t nmemb,
   return totalSize;
 }
 
-std::string send_curl_request(std::string endpoint, std::string type,
-                              std::string req_data) {
+std::tuple<std::string, int>
+send_curl_request(std::string endpoint, uint8_t type, std::string req_data) {
   std::string response;
   std::string url = baka_api_url + endpoint;
+  if (type == GET) {
+    url.append("?" + req_data);
+  }
 
   if (curl) {
+    // DEBUG
+    // std::clog << BLUE"[LOG]" << RESET" sending to endpoint: " << url << "\n";
     curl_easy_setopt(curl, CURLOPT_URL, url.c_str());
     curl_easy_setopt(curl, CURLOPT_WRITEFUNCTION, WriteCallback);
     curl_easy_setopt(curl, CURLOPT_WRITEDATA, &response);
 
-    curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, 0L);
-    curl_easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, 0L);
-    curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
+    if (config.ignoressl) {
+      curl_easy_setopt(curl, CURLOPT_SSL_VERIFYPEER, 0L);
+      curl_easy_setopt(curl, CURLOPT_SSL_VERIFYHOST, 0L);
+    }
 
-    curl_easy_setopt(curl, CURLOPT_POSTFIELDS, req_data.c_str());
+    curl_easy_setopt(curl, CURLOPT_FOLLOWLOCATION, 1L);
 
     struct curl_slist *headers = NULL;
     headers = curl_slist_append(
         headers, "Content-Type: application/x-www-form-urlencoded");
+    headers = curl_slist_append(
+        headers, std::format("User-Agent: bakatui/{}", VERSION).c_str());
+
     curl_easy_setopt(curl, CURLOPT_HTTPHEADER, headers);
 
-    if (type == "POST") {
+    switch (type) {
+    case GET:
+      curl_easy_setopt(curl, CURLOPT_HTTPGET, 1L);
+      break;
+    case POST:
+      curl_easy_setopt(curl, CURLOPT_POSTFIELDS, req_data.c_str());
       curl_easy_setopt(curl, CURLOPT_POST, 1L);
-    } else {
-      std::cerr << RED "[ERROR] " << RESET "invalid method\n";
-      safe_exit(-5);
+      break;
+    default:
+      std::cerr << RED "[ERROR] " << RESET "invalid metod\n";
+      safe_exit(EINVAL);
     }
 
   } else {
@@ -62,49 +87,103 @@ std::string send_curl_request(std::string endpoint, std::string type,
   }
   curl_easy_perform(curl); // Perform the request
 
-  curl_easy_cleanup(curl); // Cleanup
+  int http_code = 0;
+  curl_easy_getinfo(curl, CURLINFO_RESPONSE_CODE, &http_code);
 
-  return response;
+  return {response, http_code};
 }
 namespace bakaapi {
 
-std::string access_token;
-
 void login(std::string username, std::string password) {
 
   std::string req_data =
       std::format("client_id=ANDR&grant_type=password&username={}&password={}",
                   username, password);
 
-  std::string response = send_curl_request("api/login", "POST", req_data);
-
-  std::string savedir_path = std::getenv("HOME");
-  savedir_path.append("/.local/share/bakatui");
-
-  DIR *savedir = opendir(savedir_path.c_str());
-  if (savedir) {
-    /* Directory exists. */
-    closedir(savedir);
-  } else if (ENOENT == errno) {
-    /* Directory does not exist. */
-    std::filesystem::create_directories(savedir_path);
-  } else {
-    /* opendir() failed for some other reason. */
-    std::cerr << "cannot access ~/.local/share/bakatui\n";
-    safe_exit(100);
+  auto [response, http_code] = send_curl_request("api/login", POST, req_data);
+  if (http_code != 200) {
+    std::cerr << RED "[ERROR] " << RESET << "login failed " << http_code
+              << " is non 200 response\n";
+    safe_exit(55);
   }
-  std::string authfile_path = std::string(savedir_path) + "/auth";
+
+  SoRAuthFile(true, response);
+
   {
+    std::string savedir_path = std::getenv("HOME");
+    savedir_path.append("/.local/share/bakatui");
 
-    std::ofstream authfile;
-    authfile.open(authfile_path);
-    authfile << response;
-    authfile.close();
+    std::string urlfile_path = std::string(savedir_path) + "/url";
+    std::ofstream urlfile;
+    urlfile.open(urlfile_path);
+    urlfile << baka_api_url;
+    urlfile.close();
   }
+
   json resp_parsed = json::parse(response);
 
   access_token = resp_parsed["access_token"];
 
+  // DEBUG
   std::cout << "access token: " << access_token << std::endl;
 }
+
+void refresh_access_token() {
+  if(config.verbose) {
+  std::clog << "refreshing access token please wait...\n";
+  }
+
+  json authfile_parsed = json::parse(SoRAuthFile(false, ""));
+
+  std::string refresh_token = authfile_parsed["refresh_token"];
+
+  std::string req_data =
+      std::format("Authorization=Bearer&client_id=ANDR&grant_type=refresh_"
+                  "token&refresh_token={}",
+                  refresh_token);
+
+  // DEBUG
+  std::clog << "calling send_curl_request() with folowing req_data\n"
+            << req_data << std::endl;
+  auto [response, http_code] = send_curl_request("api/login", POST, req_data);
+  if (http_code != 200) {
+    std::cerr << RED "[ERROR] " << RESET << http_code
+              << "is non 200 response\n";
+    get_input_and_login();
+  }
+
+  SoRAuthFile(true, response);
+
+  json resp_parsed = json::parse(response);
+
+  access_token = resp_parsed["access_token"];
+}
+
+void is_access_token_empty() {
+  if (access_token.empty()) {
+    json authfile_parsed = json::parse(SoRAuthFile(false, ""));
+    access_token = authfile_parsed["access_token"];
+  }
+}
+
+// supports all endpoints that only require access_token
+json get_data_from_endpoint(std::string endpoint) {
+  is_access_token_empty();
+  access_token_refreshed:
+  std::string req_data =
+      std::format("Authorization=Bearer&access_token={}", access_token);
+
+  auto [response, http_code] = send_curl_request(endpoint, GET, req_data);
+
+  if (http_code != 200) {
+    // DEBUG
+    std::clog << "Failed geting data from endpoint: " << endpoint
+              << " code: " << http_code << "\nrequest: " << req_data
+              << "\nresponse: " << response << std::endl;
+    refresh_access_token();
+    goto access_token_refreshed;
+  }
+
+  return json::parse(response);
+}
 } // namespace bakaapi

src/net.h

@@ -1,5 +1,16 @@
 #include <curl/curl.h>
+#include <nlohmann/json.hpp>
 #include <string>
+// header guard
+#ifndef _ba_ne_hg_
+#define _ba_ne_hg_
+
+using nlohmann::json;
+
+extern CURL *curl;
 namespace bakaapi {
 void login(std::string username, std::string password);
-}
+void refresh_access_token();
+json get_data_from_endpoint(std::string endpoint);
+} // namespace bakaapi
+#endif

src/timetable.cpp

@@ -0,0 +1,592 @@
+#include "timetable.h"
+#include "color.h"
+#include "const.h"
+#include "helper_funcs.h"
+#include "net.h"
+#include "types.h"
+#include <cstdint>
+#include <curses.h>
+#include <cwchar>
+#include <iostream>
+#include <ncurses.h>
+#include <nlohmann/json.hpp>
+#include <panel.h>
+#include <string>
+#include <sys/types.h>
+#include <vector>
+
+using nlohmann::json;
+#define BOTTOM_PADDING 3
+
+#define DEFAULT_OFFSET 3
+
+const wchar_t *day_abriviations[] = {nullptr, L"Mo", L"Tu", L"We",
+                                     L"Th",   L"Fr", L"Sa", L"Su"};
+
+void draw_days(WINDOW **&day_windows, uint16_t cell_height, uint8_t num_of_days,
+               json &resp_from_api);
+
+void draw_lessons(WINDOW **&lesson_windows, uint8_t num_of_columns,
+                  uint16_t cell_width, std::vector<uint8_t> &HourIdLookupTable,
+                  json &resp_from_api);
+
+void draw_cells(uint8_t num_of_columns, uint8_t num_of_days,
+                uint16_t cell_width, uint16_t cell_height,
+                std::vector<std::vector<WINDOW *>> &cells,
+                std::vector<uint8_t> &HourIdLookupTable, json &resp_from_api);
+
+uint8_t hour_id_to_index(const std::vector<uint8_t> &HourIdLookupTable,
+                         uint8_t id) {
+  for (uint8_t i = 0; i < HourIdLookupTable.size(); i++) {
+    if (HourIdLookupTable[i] == id) {
+      return i;
+    }
+  }
+  return 0;
+}
+
+json *partial_json_by_id(json &resp_from_api, const std::string &what,
+                         const std::string &id) {
+  for (uint8_t i = 0; i < resp_from_api[what].size(); i++) {
+    if (resp_from_api[what][i]["Id"].get<std::string>() == id) {
+      return &resp_from_api[what][i];
+    }
+  }
+  return nullptr;
+}
+
+std::wstring get_data_for_atom(json &resp_from_api, json *atom,
+                               const std::string &from_where,
+                               const std::string &id_key,
+                               const std::string &what) {
+  return string_to_wstring(
+      partial_json_by_id(resp_from_api, from_where,
+                         atom->at(id_key).get<std::string>())
+          ->at(what)
+          .get<std::string>());
+}
+
+json *find_atom_by_indexes(json &resp_from_api, uint8_t day_index,
+                           uint8_t hour_index,
+                           const std::vector<uint8_t> &HourIdLookupTable) {
+  for (uint8_t k = 0; k < resp_from_api["Days"][day_index]["Atoms"].size();
+       k++) {
+    if (resp_from_api["Days"][day_index]["Atoms"][k]["HourId"].get<uint8_t>() ==
+        HourIdLookupTable[hour_index]) {
+      return &resp_from_api["Days"][day_index]["Atoms"][k];
+    }
+  }
+  return nullptr; // No matching atom found
+}
+
+void timetable_page() {
+  // DONT FORGET TO UNCOMMENT
+  json resp_from_api =
+      bakaapi::get_data_from_endpoint("api/3/timetable/actual");
+  /*std::ifstream f("test-data/timetable.json");
+  json resp_from_api = json::parse(f);*/
+
+  // this may be unnecessary but i dont have enaugh data to test it
+  // it sorts the hours by start time
+  std::vector<uint8_t> HourIdLookupTable(resp_from_api["Hours"].size());
+  {
+    using Id_and_Start_time = std::tuple<uint8_t, std::string>;
+    //                                   ID,      start_time
+
+    Id_and_Start_time *temp_hour_sorting_array =
+        new Id_and_Start_time[resp_from_api["Hours"].size()];
+
+    for (uint8_t i = 0; i < resp_from_api["Hours"].size(); i++) {
+      temp_hour_sorting_array[i] = std::make_tuple(
+          resp_from_api["Hours"][i]["Id"].get<uint8_t>(),
+          resp_from_api["Hours"][i]["BeginTime"].get<std::string>());
+    };
+
+    std::sort(temp_hour_sorting_array,
+              temp_hour_sorting_array + resp_from_api["Hours"].size(),
+              [](const Id_and_Start_time &a, const Id_and_Start_time &b) {
+                const std::string &str_a = std::get<1>(a);
+                const std::string &str_b = std::get<1>(b);
+
+                const size_t colon_pos_a = str_a.find(':');
+                const size_t colon_pos_b = str_b.find(':');
+
+                if (colon_pos_a == std::string::npos ||
+                    colon_pos_b == std::string::npos) {
+                  std::cerr << RED "[ERROR]" << RESET
+                            << " Colon not found in time string\n";
+                  safe_exit(EXIT_FAILURE);
+                }
+
+                const std::string hour_a_S = str_a.substr(0, colon_pos_a);
+                const std::string hour_b_S = str_b.substr(0, colon_pos_b);
+
+                const std::string minute_a_S = str_a.substr(colon_pos_a + 1);
+                const std::string minute_b_S = str_b.substr(colon_pos_b + 1);
+
+                const uint8_t hour_a = std::stoi(hour_a_S);
+                const uint8_t hour_b = std::stoi(hour_b_S);
+
+                const uint8_t minute_a = std::stoi(minute_a_S);
+                const uint8_t minute_b = std::stoi(minute_b_S);
+
+                return (hour_a < hour_b) ||
+                       ((hour_a == hour_b) && (minute_a < minute_b));
+              });
+
+    for (uint8_t i = 0; i < resp_from_api["Hours"].size(); i++) {
+      HourIdLookupTable[i] = std::get<0>(temp_hour_sorting_array[i]);
+    }
+
+    delete[] temp_hour_sorting_array;
+  }
+
+  // some lambda dark magic
+  const uint8_t num_of_columns = [&]() -> uint8_t {
+    uint8_t result = 0;
+    for (uint8_t i = 0; i < resp_from_api["Days"].size(); i++) {
+      for (uint8_t j = 0; j < resp_from_api["Days"][i]["Atoms"].size(); j++) {
+        if (hour_id_to_index(
+                HourIdLookupTable,
+                resp_from_api["Days"][i]["Atoms"][j]["HourId"].get<uint8_t>()) >
+            result) {
+          result = hour_id_to_index(
+              HourIdLookupTable,
+              resp_from_api["Days"][i]["Atoms"][j]["HourId"].get<uint8_t>());
+        }
+      }
+    }
+    return result + 1;
+  }();
+
+  const uint8_t num_of_days = resp_from_api["Days"].size();
+
+  setlocale(LC_ALL, "");
+  /* Initialize curses */
+  initscr();
+  start_color();
+  cbreak();
+  noecho();
+  keypad(stdscr, TRUE);
+  curs_set(0);
+  /* Initialize all the colors */
+  for (uint8_t i = 0; i < 8; i++) {
+    init_pair(i, i, COLOR_BLACK);
+  }
+
+  const uint16_t cell_width = (COLS - BOTTOM_PADDING) / num_of_columns;
+  const uint16_t cell_height = (LINES - BOTTOM_PADDING) / num_of_days;
+
+  WINDOW **day_windows = new WINDOW *[num_of_days];
+  WINDOW **lesson_windows = new WINDOW *[num_of_columns];
+  std::vector<std::vector<WINDOW *>> cells(
+      num_of_days, std::vector<WINDOW *>(num_of_columns));
+
+  // init day windows
+  for (uint8_t i = 0; i < num_of_days; i++) {
+    day_windows[i] = newwin(cell_height, DEFAULT_OFFSET,
+                            i * cell_height + DEFAULT_OFFSET, 0);
+  }
+
+  // init cell windows
+  for (uint8_t i = 0; i < num_of_columns; i++) {
+    lesson_windows[i] =
+        newwin(DEFAULT_OFFSET, cell_width, 0, i * cell_width + DEFAULT_OFFSET);
+  }
+  draw_lessons(lesson_windows, num_of_columns, cell_width, HourIdLookupTable,
+               resp_from_api);
+  // days have to be drawn after lessons for some reason i actualy have no idea
+  // why
+  draw_days(day_windows, cell_height, num_of_days, resp_from_api);
+
+  // init the cell windows
+  for (uint8_t i = 0; i < num_of_days; i++) {
+    for (uint8_t j = 0; j < num_of_columns; j++) {
+      cells[i][j] =
+          newwin(cell_height, cell_width, i * cell_height + DEFAULT_OFFSET,
+                 j * cell_width + DEFAULT_OFFSET);
+    }
+  }
+  draw_cells(num_of_columns, num_of_days, cell_width, cell_height, cells,
+             HourIdLookupTable, resp_from_api);
+
+  refresh();
+
+  SelectorType selected_cell(0, 0, 0, num_of_columns - 1, 0, num_of_days - 1);
+  std::array<WINDOW *, 4> selector_windows;
+  std::array<PANEL *, 4> selector_panels;
+
+  {
+    const chtype corners[] = {
+        ACS_ULCORNER, /* Upper left corner */
+        ACS_URCORNER, /* Upper right corner */
+        ACS_LLCORNER, /* Lower left corner */
+        ACS_LRCORNER  /* Lower right corner */
+    };
+
+    unsigned short x_offset, y_offset;
+    for (uint8_t i = 0; i < selector_windows.size(); i++) {
+
+      if (!(i % 2 == 0)) {
+        x_offset = cell_width - 1;
+      } else {
+        x_offset = 0;
+      }
+      if (!(i < 2)) {
+        y_offset = cell_height - 1;
+      } else {
+        y_offset = 0;
+      }
+
+      selector_windows[i] =
+          newwin(1, 1, DEFAULT_OFFSET + y_offset, DEFAULT_OFFSET + x_offset);
+      selector_panels[i] = new_panel(selector_windows[i]);
+      wattron(selector_windows[i], COLOR_PAIR(COLOR_RED));
+      mvwaddch(selector_windows[i], 0, 0, corners[i]);
+      wattroff(selector_windows[i], COLOR_PAIR(COLOR_RED));
+    }
+  }
+
+  update_panels();
+  doupdate();
+
+  WINDOW *infobox_window;
+  PANEL *infobox_panel;
+
+  bool is_info_box_open = false;
+  int ch;
+  while ((ch = getch()) != KEY_F(1)) {
+    if (is_info_box_open) {
+
+      hide_panel(infobox_panel);
+      del_panel(infobox_panel);
+
+      delwin(infobox_window);
+
+      touchwin(stdscr);
+      refresh();
+
+      // Redraw everithing
+      draw_days(day_windows, cell_height, num_of_days, resp_from_api);
+      draw_lessons(lesson_windows, num_of_columns, cell_width,
+                   HourIdLookupTable, resp_from_api);
+      draw_cells(num_of_columns, num_of_days, cell_width, cell_height, cells,
+                 HourIdLookupTable, resp_from_api);
+
+      for (uint8_t i = 0; i < selector_panels.size(); i++) {
+        top_panel(selector_panels[i]);
+      }
+      update_panels();
+      doupdate();
+
+      is_info_box_open = false;
+      continue;
+    }
+  run_loop_again:
+    switch (ch) {
+    case KEY_UP:
+    case 'k':
+      selected_cell.y--;
+      break;
+    case KEY_DOWN:
+    case 'j':
+      selected_cell.y++;
+      break;
+    case KEY_LEFT:
+    case 'h':
+      selected_cell.x--;
+      break;
+    case KEY_RIGHT:
+    case 'l':
+      selected_cell.x++;
+      break;
+    case 10: // ENTER
+      json *atom = find_atom_by_indexes(resp_from_api, selected_cell.y,
+                                        selected_cell.x, HourIdLookupTable);
+      if (atom == nullptr) {
+        std::cerr << RED "[ERROR]" << RESET " Selector at invalid position\n";
+        safe_exit(129);
+      }
+
+      infobox_window = newwin(LINES * 0.6, COLS * 0.6, LINES * 0.2, COLS * 0.2);
+      infobox_panel = new_panel(infobox_window);
+      is_info_box_open = true;
+
+      wattron(infobox_window, COLOR_PAIR(COLOR_MAGENTA));
+      box(infobox_window, 0, 0);
+      mvwaddch(infobox_window, 2, 0, ACS_LTEE);
+      mvwhline(infobox_window, 2, 1, ACS_HLINE, COLS * 0.6 - 2);
+      mvwaddch(infobox_window, 2, COLS * 0.6 - 1, ACS_RTEE);
+      wattroff(infobox_window, COLOR_PAIR(COLOR_MAGENTA));
+
+      std::wstring Caption;
+      if (atom->contains("Change") && !atom->at("Change").is_null()) {
+        if (!atom->at("Change")["TypeName"].is_null()) {
+          Caption = string_to_wstring(
+              atom->at("Change")["TypeName"].get<std::string>());
+        }
+      }
+
+      if (Caption.empty()) {
+        try {
+          Caption = get_data_for_atom(resp_from_api, atom, "Subjects",
+                                      "SubjectId", "Name");
+        } catch (...) {
+          __asm__("nop");
+        }
+      }
+
+      std::wstring Teacher = L"";
+      try {
+        Teacher = get_data_for_atom(resp_from_api, atom, "Teachers",
+                                    "TeacherId", "Name");
+      } catch (...) {
+        __asm__("nop");
+      }
+      Teacher.insert(0, L"Teacher: ");
+
+      std::wstring Groups = L"";
+      try {
+        for (uint8_t i = 0; i < atom->at("GroupIds").size(); i++) {
+          for (uint8_t j = 0; j < resp_from_api["Groups"].size(); j++) {
+            if (resp_from_api["Groups"][j]["Id"].get<std::string>() ==
+                atom->at("GroupIds")[i].get<std::string>()) {
+              Groups.append(string_to_wstring(
+                  resp_from_api["Groups"][j]["Name"].get<std::string>()));
+              if (static_cast<size_t>(i + 1) < atom->at("GroupIds").size()) {
+                Groups.append(L", ");
+              }
+            }
+          }
+        }
+      } catch (const std::exception &e) {
+        std::cerr << RED "[ERROR]" << RESET " " << e.what() << "\n";
+      }
+      Groups = wrm_tr_le_whitespace(Groups);
+      Groups.insert(0, L"Groups: ");
+
+      std::wstring Room = L"";
+      try {
+        Room =
+            get_data_for_atom(resp_from_api, atom, "Rooms", "RoomId", "Name");
+        if (Room.empty()) {
+          Room = get_data_for_atom(resp_from_api, atom, "Rooms", "RoomId",
+                                   "Abbrev");
+          ;
+        }
+      } catch (...) {
+        __asm__("nop");
+      }
+      Room.insert(0, L"Room: ");
+
+      std::wstring Theme = L"";
+      try {
+        Theme = wrm_tr_le_whitespace(
+            string_to_wstring(atom->at("Theme").get<std::string>()));
+      } catch (...) {
+        __asm__("nop");
+      }
+      Theme.insert(0, L"Theme: ");
+
+      wprint_in_middle(infobox_window, 1, 0, getmaxx(infobox_window),
+                       Caption.c_str(), COLOR_PAIR(COLOR_CYAN));
+
+      // printing out of order to reduce wattro* directives
+      wattron(infobox_window, COLOR_PAIR(COLOR_YELLOW));
+      mvwaddwstr(infobox_window, 3, 1, Teacher.c_str());
+      mvwaddwstr(infobox_window, 5, 1, Room.c_str());
+      wattroff(infobox_window, COLOR_PAIR(COLOR_YELLOW));
+
+      wattron(infobox_window, COLOR_PAIR(COLOR_CYAN));
+      mvwaddwstr(infobox_window, 4, 1, Groups.c_str());
+      mvwaddwstr(infobox_window, 6, 1, Theme.c_str());
+      wattroff(infobox_window, COLOR_PAIR(COLOR_CYAN));
+
+      top_panel(infobox_panel);
+      update_panels();
+      doupdate();
+      continue;
+      break;
+    }
+    { // print selected indicator
+      chtype top_left_corner =
+          mvwinch(cells[selected_cell.y][selected_cell.x], 0, 0);
+
+      if (!((top_left_corner & A_CHARTEXT) == 32)) {
+        for (uint8_t i = 0; i < selector_panels.size(); i++) {
+          unsigned short x_offset, y_offset;
+          if (!(i % 2 == 0)) {
+            x_offset = cell_width - 1;
+          } else {
+            x_offset = 0;
+          }
+          if (!(i < 2)) {
+            y_offset = cell_height - 1;
+          } else {
+            y_offset = 0;
+          }
+
+          move_panel(selector_panels[i],
+                     DEFAULT_OFFSET + y_offset + selected_cell.y * cell_height,
+                     DEFAULT_OFFSET + x_offset + selected_cell.x * cell_width);
+        }
+        draw_cells(num_of_columns, num_of_days, cell_width, cell_height, cells,
+                   HourIdLookupTable, resp_from_api);
+        update_panels();
+        doupdate();
+
+      } else {
+        // skip if the cell is empty
+        goto run_loop_again;
+      }
+    }
+  }
+  delete[] day_windows;
+  delete[] lesson_windows;
+  endwin();
+}
+
+void draw_days(WINDOW **&day_windows, uint16_t cell_height, uint8_t num_of_days,
+               json &resp_from_api) {
+  for (uint8_t i = 0; i < num_of_days; i++) {
+    // this wont draw left boarder window making it so it looks partially
+    // offscreen
+    wborder(day_windows[i], ' ', 0, 0, 0, ACS_HLINE, 0, ACS_HLINE, 0);
+
+    mvwaddwstr(
+        day_windows[i], cell_height / 2, 0,
+        day_abriviations[resp_from_api["Days"][i]["DayOfWeek"].get<uint8_t>()]);
+    wrefresh(day_windows[i]);
+  }
+}
+
+void draw_lessons(WINDOW **&lesson_windows, uint8_t num_of_columns,
+                  uint16_t cell_width, std::vector<uint8_t> &HourIdLookupTable,
+                  json &resp_from_api) {
+  for (uint8_t i = 0; i < num_of_columns; i++) {
+    wborder(lesson_windows[i], 0, 0, ' ', 0, ACS_VLINE, ACS_VLINE, 0, 0);
+    std::wstring caption;
+    std::wstring start_time;
+    std::wstring end_time;
+
+    for (uint8_t j = 0; j < resp_from_api["Hours"].size(); j++) {
+      if (resp_from_api["Hours"][j]["Id"].get<uint8_t>() ==
+          HourIdLookupTable[i]) {
+
+        std::string caption_ascii =
+            resp_from_api["Hours"][j]["Caption"].get<std::string>();
+        std::string start_time_ascii =
+            resp_from_api["Hours"][j]["BeginTime"].get<std::string>();
+        std::string end_time_ascii =
+            resp_from_api["Hours"][j]["EndTime"].get<std::string>();
+
+        caption = string_to_wstring(caption_ascii);
+        start_time = string_to_wstring(start_time_ascii);
+        end_time = string_to_wstring(end_time_ascii);
+
+        goto hour_id_found;
+      }
+    }
+    std::cerr << RED "[ERROR]" << RESET " Hour with id " << HourIdLookupTable[i]
+              << " not found\n";
+    safe_exit(128);
+
+  hour_id_found:
+
+    wprint_in_middle(lesson_windows[i], 0, 0, cell_width, caption.c_str(),
+                     COLOR_PAIR(0));
+    mvwaddwstr(lesson_windows[i], 1, 1, start_time.c_str());
+    print_in_middle(lesson_windows[i], 1, 0, cell_width, "-", COLOR_PAIR(0));
+    mvwaddwstr(lesson_windows[i], 1, cell_width - end_time.length() - 1,
+               end_time.c_str());
+    wrefresh(lesson_windows[i]);
+  }
+}
+
+void draw_cells(uint8_t num_of_columns, uint8_t num_of_days,
+                uint16_t cell_width, uint16_t cell_height,
+                std::vector<std::vector<WINDOW *>> &cells,
+                std::vector<uint8_t> &HourIdLookupTable, json &resp_from_api) {
+  for (uint8_t i = 0; i < num_of_days; i++) {
+    for (uint8_t j = 0; j < num_of_columns; j++) {
+
+      json *atom = find_atom_by_indexes(resp_from_api, i, j, HourIdLookupTable);
+      if (atom == nullptr) {
+        continue;
+      }
+      std::wstring Subject_Abbrev;
+      std::wstring Room_Abbrev;
+      std::wstring Teacher_Abbrev;
+      try {
+        if (atom->contains("Change") && !atom->at("Change").is_null()) {
+
+          switch (
+              hash_djb2a(atom->at("Change")["ChangeType"].get<std::string>())) {
+          case "Canceled"_sh:
+          case "Removed"_sh:
+            wattron(cells[i][j], COLOR_PAIR(COLOR_GREEN));
+            box(cells[i][j], 0, 0);
+            wattroff(cells[i][j], COLOR_PAIR(COLOR_GREEN));
+            break;
+          case "RoomChanged"_sh:
+          case "Substitution"_sh:
+            wattron(cells[i][j], COLOR_PAIR(COLOR_YELLOW));
+            box(cells[i][j], 0, 0);
+            wattroff(cells[i][j], COLOR_PAIR(COLOR_YELLOW));
+            break;
+          case "Added"_sh:
+            wattron(cells[i][j], COLOR_PAIR(COLOR_BLUE));
+            box(cells[i][j], 0, 0);
+            wattroff(cells[i][j], COLOR_PAIR(COLOR_BLUE));
+            break;
+          default:
+            // TODO add error handling
+            __asm__("nop");
+          }
+          if (!atom->at("Change")["TypeAbbrev"].is_null()) {
+            Subject_Abbrev = string_to_wstring(
+                atom->at("Change")["TypeAbbrev"].get<std::string>());
+          }
+        } else {
+          box(cells[i][j], 0, 0);
+        }
+
+        if (Subject_Abbrev.empty()) {
+          try {
+            Subject_Abbrev = get_data_for_atom(resp_from_api, atom, "Subjects",
+                                               "SubjectId", "Abbrev");
+          } catch (...) {
+            __asm__("nop");
+          }
+        }
+
+        try {
+          Room_Abbrev = get_data_for_atom(resp_from_api, atom, "Rooms",
+                                          "RoomId", "Abbrev");
+        } catch (...) {
+          __asm__("nop");
+        }
+
+        try {
+          Teacher_Abbrev = get_data_for_atom(resp_from_api, atom, "Teachers",
+                                             "TeacherId", "Abbrev");
+        } catch (...) {
+          __asm__("nop");
+        }
+
+        wprint_in_middle(cells[i][j], cell_height / 2, 0, cell_width,
+                         Subject_Abbrev.c_str(), COLOR_PAIR(0));
+        mvwaddwstr(cells[i][j], cell_height - 2,
+                   cell_width - wcslen(Room_Abbrev.c_str()) - 1,
+                   Room_Abbrev.c_str());
+
+        mvwaddwstr(cells[i][j], cell_height - 2, 1, Teacher_Abbrev.c_str());
+        wrefresh(cells[i][j]);
+      } catch (const std::exception &e) {
+        std::cerr << RED "[ERROR]" << RESET " " << e.what() << "\n";
+        // world's best error handling
+        __asm__("nop");
+      }
+    }
+  }
+}

src/timetable.h

@@ -0,0 +1,6 @@
+// header guard
+#ifndef _ba_ti_hg_
+#define _ba_ti_hg_
+
+void timetable_page();
+#endif

src/types.h

@@ -0,0 +1,147 @@
+// header guard
+#ifndef _ba_ty_hg_
+#define _ba_ty_hg_
+
+#include <istream>
+struct Config {
+  bool verbose = false;
+  bool ignoressl = false;
+};
+
+class LimitedInt {
+private:
+  int value;
+  const int min_value;
+  const int max_value;
+
+  void setValue(int new_value) {
+    int range = max_value - min_value + 1;
+    if (new_value < min_value || new_value > max_value) {
+      new_value = ((new_value - min_value) % range + range) % range + min_value;
+    }
+    value = new_value;
+  }
+
+public:
+  // Constructors
+  LimitedInt(int initial_value = 0, int min = std::numeric_limits<int>::min(),
+             int max = std::numeric_limits<int>::max())
+      : min_value(min), max_value(max) {
+    if (min >= max)
+      throw std::invalid_argument("Min must be less than max");
+    setValue(initial_value);
+  }
+
+  // Conversion operators
+  operator int() const { return value; } // Implicit conversion to int
+
+  // Assignment operators
+  LimitedInt &operator=(int rhs) {
+    setValue(rhs);
+    return *this;
+  }
+
+  // Compound assignment with BoundedInt
+  LimitedInt &operator+=(const LimitedInt &rhs) {
+    setValue(value + rhs.value);
+    return *this;
+  }
+
+  // Compound assignment with int
+  LimitedInt &operator+=(int rhs) {
+    setValue(value + rhs);
+    return *this;
+  }
+
+  // Similarly define -=, *=, /=, %=, &=, |=, ^=, <<=, >>= for both types
+
+  // Increment/decrement
+  LimitedInt &operator++() { // Prefix ++
+    setValue(value + 1);
+    return *this;
+  }
+
+  LimitedInt operator++(int) { // Postfix ++
+    LimitedInt temp = *this;
+    setValue(value + 1);
+    return temp;
+  }
+
+  LimitedInt &operator--() { // Prefix --
+    setValue(value - 1);
+    return *this;
+  }
+
+  LimitedInt operator--(int) { // Postfix --
+    LimitedInt temp = *this;
+    setValue(value - 1);
+    return temp;
+  }
+
+  // Binary arithmetic operators
+  friend LimitedInt operator+(const LimitedInt &lhs, const LimitedInt &rhs) {
+    LimitedInt result = lhs;
+    result += rhs;
+    return result;
+  }
+
+  friend LimitedInt operator+(const LimitedInt &lhs, int rhs) {
+    LimitedInt result = lhs;
+    result += rhs;
+    return result;
+  }
+
+  friend LimitedInt operator+(int lhs, const LimitedInt &rhs) {
+    LimitedInt result(lhs, rhs.min_value, rhs.max_value);
+    result += rhs;
+    return result;
+  }
+
+  // Similarly define -, *, /, %, &, |, ^, <<, >> for all combinations
+
+  // Unary operators
+  LimitedInt operator-() const {
+    return LimitedInt(-value, min_value, max_value);
+  }
+
+  LimitedInt operator+() const { return *this; }
+
+  // Comparison operators
+  friend bool operator==(const LimitedInt &lhs, const LimitedInt &rhs) {
+    return lhs.value == rhs.value;
+  }
+
+  friend bool operator!=(const LimitedInt &lhs, const LimitedInt &rhs) {
+    return lhs.value != rhs.value;
+  }
+
+  friend bool operator<(const LimitedInt &lhs, const LimitedInt &rhs) {
+    return lhs.value < rhs.value;
+  }
+
+  // Similarly define >, <=, >= for both BoundedInt and int comparisons
+
+  // Stream operators
+  friend std::ostream &operator<<(std::ostream &os, const LimitedInt &bi) {
+    os << bi.value;
+    return os;
+  }
+
+  friend std::istream &operator>>(std::istream &is, LimitedInt &bi) {
+    int temp;
+    is >> temp;
+    bi.setValue(temp);
+    return is;
+  }
+};
+
+struct SelectorType {
+  LimitedInt x;
+  LimitedInt y;
+
+  SelectorType(int xArg, int yArg, int min_limit_x, int max_limit_x,
+               int min_limit_y, int max_limit_y)
+      : x(xArg, min_limit_x, max_limit_x), y(yArg, min_limit_y, max_limit_y) {}
+};
+
+#endif