chore: Started implementing

Idk who tf is duplicating the sheets

COPYING

@@ -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>.

cron-runner.js

@@ -1,3 +1,16 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
 import cron from 'node-cron';
 import { exec } from 'child_process';
 import { scheduleRules, toMinutes } from './scheduleRules.js';

package.json

@@ -2,23 +2,31 @@
   "name": "jecnarozvrh",
   "version": "1.0.0",
   "description": "",
-  "license": "ISC",
+  "license": "GPL-3.0-only",
   "author": "Jakub Žitník",
   "type": "module",
   "main": "server.js",
   "scripts": {
+    "test": "node tests/test.js",
     "start": "concurrently \"node server.js\" \"node cron-runner.js\"",
     "build": "cd web && hugo --gc --minify",
-    "dev-web": "cd web && hugo serve"
+    "dev-web": "cd web && hugo serve",
+    "setup-static": "node scripts/loadstaticschedule.js"
   },
   "dependencies": {
+    "@google/genai": "^1.38.0",
+    "axios": "^1.13.4",
+    "axios-cookiejar-support": "^6.0.5",
     "body-parser": "^2.2.0",
     "cheerio": "^1.1.2",
     "concurrently": "^9.2.0",
+    "cors": "^2.8.6",
     "dotenv": "^17.2.3",
     "exceljs": "^4.4.0",
     "express": "^5.1.0",
     "node-cron": "^4.2.1",
-    "puppeteer": "^24.10.0"
+    "node-fetch": "^3.3.2",
+    "puppeteer": "^24.10.0",
+    "tough-cookie": "^6.0.0"
   }
 }

scheduleRules.js

@@ -1,5 +1,18 @@
-// Rules: start and end in 24h format, interval in minutes
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
 
+// Rules: start and end in 24h format, interval in minutes
 export const scheduleRules = [
   { start: "0:00",  end: "3:00",  interval: 180 },
   { start: "3:00",  end: "4:00",  interval: 60 },

scrape/parse.js

@@ -1,5 +1,21 @@
-import parseV1 from "./parse/v1.js";
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
+import parseV1V2 from "./parse/v1_v2.js";
+import parseV3 from "./parse/v3/v3.js";
 
 export default async function parseThisShit(downloadedFilePath) {
-  await parseV1(downloadedFilePath)
+  await parseV1V2(downloadedFilePath);
+  await parseV3("db/v2.json"); // NEEDS TO BE RAN AFTER V2 (uses its format)
 }

scrape/parse/v1_v2.js

@@ -1,15 +1,27 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
 import ExcelJS from "exceljs"
 import fs from "fs"
 import parseAbsence from "../utils/parseAbsence.js"
 import parseTeachers from "../utils/parseTeachers.js"
 
-export default async function parseV1(downloadedFilePath) {
+export default async function parseV1V2(downloadedFilePath) {
   const workbook = new ExcelJS.Workbook();
   await workbook.xlsx.readFile(downloadedFilePath);
   const teacherMap = await parseTeachers();
 
-  const sheetNames = workbook.worksheets.map((sheet) => sheet.name);
-
   const dateRegex = /^(pondělí|úterý|středa|čtvrtek|pátek|po|út|ut|st|čt|ct|pa|pá)\s+(\d{1,2})\.\s*(\d{1,2})\.\s*(20\d{2})/i;
 
   // Get today's date for comparison
@@ -20,18 +32,37 @@ export default async function parseV1(downloadedFilePath) {
 
   const today = getCurrentDateObject();
 
-  const upcomingSheets = sheetNames.filter((name) => {
+  const datedSheets = [];
-    const match = name.match(dateRegex);
-    if (!match) return false;
 
-    const day = Number.parseInt(match[2], 10);
+  for (const sheet of workbook.worksheets) {
-    const month = Number.parseInt(match[3], 10) - 1; // JavaScript months are 0-indexed
+    const match = sheet.name.match(dateRegex);
-    const year = Number.parseInt(match[4], 10);
+    if (!match) continue;
+
+    const day = parseInt(match[2], 10);
+    const month = parseInt(match[3], 10) - 1;
+    const year = parseInt(match[4], 10);
 
     const sheetDate = new Date(year, month, day);
+    if (sheetDate < today) continue;
 
-    return sheetDate >= today;
+    const dateKey = `${year}-${month + 1}-${day}`;
-  })
+
+    datedSheets.push({
+      sheet,
+      dateKey,
+    });
+  }
+
+  const sheetsByDate = {};
+  for (const item of datedSheets) {
+    sheetsByDate[item.dateKey] ??= [];
+    sheetsByDate[item.dateKey].push(item.sheet);
+  }
+
+  const upcomingSheets = Object.values(sheetsByDate).map((sheets) => {
+    if (sheets.length === 1) return sheets[0].name;
+    return (sheets.find((s) => s.state !== "hidden") ?? sheets[0]).name;
+  });
 
   const final = [];
 
@@ -202,7 +233,29 @@ export default async function parseV1(downloadedFilePath) {
     }
   }
 
-  fs.writeFileSync("db/v1.json", JSON.stringify(data, null, 2));
+  fs.writeFileSync("db/v2.json", JSON.stringify(data, null, 2));
+
+  // Modify the data for v1
+  const copy = JSON.parse(JSON.stringify(data));
+
+  copy.schedule.forEach(day => {
+    if (!Array.isArray(day.ABSENCE)) return;
+
+    day.ABSENCE = day.ABSENCE.map(old => {
+      if (old.type === "zastoupen") {
+        return {
+          type: "invalid",
+          teacher: null,
+          teacherCode: null,
+          hours: null,
+          original: `za ${old.teacherCode.toUpperCase()} zastupuje ${old.zastupuje.teacherCode.toUpperCase()}`
+        };
+      }
+      return old;
+    });
+  });
+
+  fs.writeFileSync("db/v1.json", JSON.stringify(copy, null, 2))
 }
 
-//parseThisShit("downloads/table.xlsx")
+//parseV1V2("db/current.xlsx")

scrape/parse/v3/call.js

@@ -0,0 +1,73 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
+import { GoogleGenAI } from "@google/genai";
+import fs from "fs/promises";
+
+const TIMETABLE_PATH = "db/persistent/timetables.json";
+
+export async function setup() {
+  const timetable = JSON.parse(
+    await fs.readFile(TIMETABLE_PATH, { encoding: "utf8" })
+  );
+
+  const ai = new GoogleGenAI({
+    apiKey: process.env.GEMINI_API_KEY
+  });
+
+  const systemPrompt = await fs.readFile("./prompt.txt", "utf-8");
+
+  /**
+   * @param {Object} changesByClass
+   *   {
+   *     "1A": [ ...changes... ],
+   *     "2B": [ ...changes... ]
+   *   }
+   * @param {number} dayIndex
+   */
+  return async (changesByClass, dayIndex) => {
+    const input = {};
+
+    for (const cls of Object.keys(changesByClass)) {
+      input[cls] = {
+        stableSchedule: timetable[cls][dayIndex],
+        changes: changesByClass[cls]
+      };
+    }
+
+    const response = await ai.models.generateContent({
+      model: "gemini-3-flash-preview",
+      config: {
+        systemInstruction: {
+          parts: [{ text: systemPrompt }]
+        },
+        temperature: 0
+      },
+      contents: [
+        {
+          role: "user",
+          parts: [{ text: JSON.stringify(input) }]
+        }
+      ]
+    });
+
+    const aiOutput = response.text ?? "";
+
+    try {
+      return JSON.parse(aiOutput);
+    } catch {
+      return { invalid: true, reason: "AI output could not be parsed" };
+    }
+  };
+}

scrape/parse/v3/v3.js

@@ -0,0 +1,130 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
+import fs from "fs/promises";
+import { setup } from "./call.js";
+
+const PREVIOUS = "db/v3/_previous.json";
+const FINAL = "db/v3/v3.json";
+const EXCLUDE_CLASSES = new Set(["ABSENCE"]);
+
+async function checkFileExists(filePath) {
+  try {
+    await fs.access(filePath);
+    return true;
+  } catch (err) {
+    return false;
+  }
+}
+
+function arraysAreEqual(arr1, arr2) {
+  if (arr1.length !== arr2.length) return false;
+  for (let i = 0; i < arr1.length; i++) {
+    if (arr1[i] !== arr2[i]) return false;
+  }
+  return true;
+}
+
+function getTime() {
+  const currentDate = new Date();
+  return currentDate.getHours().toString().padStart(2, "0") + ":" + currentDate.getMinutes().toString().padStart(2, "0");
+}
+
+function setupFinal() {
+  return {
+    schedule: [],
+    status: {
+      lastUpdated: getTime(),
+    }
+  }
+}
+
+export default async function parseV3(fileV2Path) {
+  const call = await setup();
+
+  let clearRun = false;
+  let previousStr = "{}";
+
+  if (await checkFileExists(PREVIOUS)) {
+    previousStr = await fs.readFile(PREVIOUS, "utf8");
+  } else {
+    clearRun = true;
+  }
+
+  const now = JSON.parse(await fs.readFile(fileV2Path, "utf8"));
+  const previous = JSON.parse(previousStr);
+  const previousDays = previous.props?.map(p => p.date) || [];
+
+  let final;
+  if (await checkFileExists(FINAL)) {
+    final = JSON.parse(await fs.readFile(FINAL, "utf8"));
+  } else {
+    final = setupFinal();
+    clearRun = true;
+  }
+
+  let i = 0;
+  for (const prop of now.props) {
+    const date = new Date(prop.date);
+    const dayIndex = (date.getDay() + 6) % 7;
+
+    if (!final.schedule[i]) {
+      final.schedule[i] = {};
+    }
+
+    const day = now.schedule[i];
+    const batch = {};
+
+    for (const cls of Object.keys(day)) {
+      if (EXCLUDE_CLASSES.has(cls)) continue;
+
+      const newClass = day[cls];
+
+      if (clearRun || !previousDays.includes(prop.date)) {
+        batch[cls] = newClass;
+        continue;
+      }
+
+      const oldPropIndex = previous.props.findIndex(
+        p => p.date === prop.date
+      );
+      const oldClass = previous.schedule[oldPropIndex]?.[cls] || [];
+
+      if (!arraysAreEqual(oldClass, newClass)) {
+        batch[cls] = newClass;
+      }
+    }
+
+    if (Object.keys(batch).length > 0) {
+      const results = await call(batch, dayIndex);
+
+      for (const cls of Object.keys(results)) {
+        final.schedule[i][cls] = results[cls];
+      }
+    }
+
+    i++;
+  }
+
+  if (!clearRun) {
+    final.status.lastUpdated = getTime();
+  }
+
+  final.props = now.props;
+
+  await fs.writeFile(FINAL, JSON.stringify(final), "utf8");
+  await fs.copyFile(fileV2Path, PREVIOUS);
+}
+
+parseV3("db/v2.json");

scrape/scraper.js

@@ -1,3 +1,17 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
 import puppeteer from 'puppeteer';
 import path from 'path';
 import fs from 'fs';

scrape/utils/parseAbsence.js

@@ -1,3 +1,17 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
 const LAST_HOUR = 10;
 
 // -------------------------------
@@ -84,8 +98,9 @@ export default function parseAbsence(input, teacherMap = {}) {
   const markConsumed = (start, end) => consumed.push([start, end]);
   const isConsumed = (i) => consumed.some(([a, b]) => i >= a && i < b);
 
+  // 1. Teachers with specific hours (e.g. "Ab 1-4")
   const teacherListThenSpecRe =
-    /([A-Za-z]+(?:[,;]\s?[A-Za-z]+)*)(?:\s*)(\d+(?:\+|-\d+|,\d+)?)(?![A-Za-z])/g;
+    /([A-Za-z]+(?:[,;]\s?[A-Za-z]+)*)(?:\s*)(\d+(?:\+|-\d+|,\d+)?)(?:\.\s*h)?(?![A-Za-z])/g;
 
   let m;
   while ((m = teacherListThenSpecRe.exec(s)) !== null) {
@@ -101,6 +116,7 @@ export default function parseAbsence(input, teacherMap = {}) {
     markConsumed(matchStart, matchEnd);
   }
 
+  // 2. Teachers with "-exk" suffix
   const teacherExkRe = /([A-Za-z]+)-exk/gi;
   while ((m = teacherExkRe.exec(s)) !== null) {
     const matchStart = m.index;
@@ -118,7 +134,34 @@ export default function parseAbsence(input, teacherMap = {}) {
     markConsumed(matchStart, matchEnd);
   }
 
-  // Standalone teachers → whole day
+  // ---------------------------------------------------------
+  // 3. Substitution Pattern: "za Vn zastupuje Jk"
+  // ---------------------------------------------------------
+  const substitutionRe = /za\s+([A-Za-z]+)\s+zastupuje\s+([A-Za-z]+)/gi;
+  while ((m = substitutionRe.exec(s)) !== null) {
+    const matchStart = m.index;
+    const matchEnd = substitutionRe.lastIndex;
+    if (isConsumed(matchStart)) continue;
+
+    const missingCode = m[1];
+    const substituteCode = m[2];
+    
+    const missingResolved = resolveTeacher(missingCode, teacherMap);
+    const subResolved = resolveTeacher(substituteCode, teacherMap);
+
+    results.push({
+      teacher: missingResolved.name,
+      teacherCode: missingResolved.code.toLowerCase(),
+      type: "zastoupen",
+      zastupuje: {
+        teacher: subResolved.name,
+        teacherCode: subResolved.code.toLowerCase()
+      }
+    });
+
+    markConsumed(matchStart, matchEnd);
+  }
+
   const teacherOnlyRe = /([A-Za-z]+(?:[,;]\s?[A-Za-z]+)*)/g;
   while ((m = teacherOnlyRe.exec(s)) !== null) {
     const matchStart = m.index;
@@ -127,6 +170,9 @@ export default function parseAbsence(input, teacherMap = {}) {
 
     const tList = m[1].split(/[,;]\s*/).filter(Boolean);
     tList.forEach((t) => {
+      const lowerT = t.toLowerCase();
+      if (lowerT === 'za' || lowerT === 'zastupuje') return;
+
       if (isTeacherToken(t)) results.push(makeResult(t, null, teacherMap));
       else
         results.push({
@@ -140,12 +186,12 @@ export default function parseAbsence(input, teacherMap = {}) {
     markConsumed(matchStart, matchEnd);
   }
 
-  // Bare specs without teacher → invalid
+  // 5. Bare specs without teacher → invalid
   const specOnlyRe = /\b(\d+(?:\+|-\d+|,\d+)?)\b/g;
   while ((m = specOnlyRe.exec(s)) !== null) {
     const matchStart = m.index;
     if (isConsumed(matchStart)) continue;
-    if (m[1].trim() == "exk") continue; // Exkurze, will be implemented later
+    if (m[1].trim() == "exk") continue; 
 
     results.push({
       type: "invalid",

scrape/utils/parseTeachers.js

@@ -1,3 +1,17 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
 import * as cheerio from "cheerio";
 
 globalThis.File = class File {};
@@ -5,7 +19,7 @@ globalThis.File = class File {};
 export default async function parseTeachers() {
   const url = "https://spsejecna.cz/ucitel";
   const response = await fetch(url);
-  const data = await response.text(); // fetch needs .text() to get HTML
+  const data = await response.text();
   const $ = cheerio.load(data);
 
   const map = {};

scripts/loadstaticschedule.js

@@ -0,0 +1,182 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
+import axios from "axios";
+import { CookieJar } from "tough-cookie";
+import { wrapper } from "axios-cookiejar-support";
+import * as cheerio from "cheerio";
+import { URLSearchParams } from "url";
+import fs from "fs";
+
+const BASE = "https://www.spsejecna.cz";
+const PATHS = {
+  SET_ROLE: "/user/role",
+  LOGIN: "/user/login",
+  TEACHERS: "/ucitel",
+  TEACHER: teacherCode => `/ucitel/${teacherCode}`
+};
+const DB_PATH = "db/persistent/timetables.json";
+
+const jar = new CookieJar();
+
+const client = wrapper(axios.create({
+  baseURL: BASE,
+  jar,
+  withCredentials: true,
+  headers: {
+    "User-Agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:120.0) Gecko/20100101 Firefox/120.0",
+    "Accept": "text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8"
+  }
+}));
+
+globalThis.File = class File {};
+
+async function login(username, password) {
+  await client.get("/");
+
+  await client.get(PATHS.SET_ROLE, {
+    params: { role: "student" }
+  });
+
+  const token3Res = await client.get("/");
+  const token3 = token3Res.data.match(/"token3"\s+value="(\d+)"/)[1];
+
+  const form = new URLSearchParams();
+  form.append('user', username);
+  form.append('pass', password);
+  form.append('token3', token3);
+  form.append('submit', 'Přihlásit+se');
+
+  try {
+    const response = await client.post(PATHS.LOGIN, form.toString(), {
+      headers: {
+        "Content-Type": "application/x-www-form-urlencoded"
+      },
+      maxRedirects: 0
+    });
+
+    if (response.status == 200) {
+      console.log("INVALID CREDENTIALS!");
+      process.exit(1);
+    }
+  } catch {}
+}
+
+async function getAllTeacherCodes() {
+  const list = new Set();
+  const response = await client.get(PATHS.TEACHERS);
+  const $ = cheerio.load(response.data);
+
+  $("main .contentLeftColumn li, main .contentRightColumn li").each((_, el) => {
+    const link = $(el).find("a");
+    const href = link.attr("href");
+
+    if (href) {
+      const key = href.split("/").pop().toLowerCase();
+      list.add(key);
+    }
+  });
+
+  return list;
+}
+
+async function constructSchedules(allTeachers) {
+  const classes = {};
+
+  function setupClass(className) {
+    function generateArray(width, height) {
+      return Array.from({ length: height }, () => Array.from({ length: width }, () => []));
+    }
+    classes[className] = generateArray(10, 5);
+  }
+
+  let idk = 0;
+  for (const key of allTeachers) {
+    idk++;
+    const response = await client.get(PATHS.TEACHER(key));
+    const $ = cheerio.load(response.data);
+
+    const tbody = $('table.timetable > tbody');
+    if (!tbody.length) {
+      console.log(`ERROR: ${key}`)
+      continue;
+    }
+
+    tbody.find('tr').slice(1).each((dayIndex, tr) => {
+      const $tr = $(tr);
+      
+      let currentHour = 0;
+
+      $tr.find('td').each((_, td) => {
+        const $td = $(td);
+        
+        const colspan = parseInt($td.attr('colspan') || '1', 10);
+
+        const $subject = $td.find('span.subject');
+        const $class = $td.find('span.class');
+        const $group = $td.find('span.group');
+        const $room = $td.find('a.room');
+        const $employee = $td.find('a.employee');
+
+        const hasData = $subject.length && $class.length && $room.length && $employee.length;
+        
+        let cellData = null;
+        let classText = '';
+
+        if (hasData) {
+           classText = $class.text().trim();
+           cellData = {
+            subject: $subject.text().trim(),
+            title: $subject.attr('title')?.trim() || '',
+            group: $group.length ? $group.text().trim() : null,
+            room: $room.text().trim(),
+            teacher: {
+              code: $employee.text().trim().toLowerCase(),
+              name: $employee.attr('title')?.trim() || ''
+            }
+          };
+        }
+
+        for (let i = 0; i < colspan; i++) {
+          if (currentHour >= 10) {
+            break; 
+          }
+
+          if (hasData && cellData) {
+            if (classes[classText] === undefined) {
+              setupClass(classText);
+            }
+            
+            classes[classText][dayIndex][currentHour].push(cellData);
+          }
+
+          currentHour++; 
+        }
+      });
+    });
+    
+    console.log(`DONE: ${idk}/${allTeachers.size}`)
+  }
+
+  return classes;
+}
+
+await login(process.env.USERNAME, process.env.PASSWORD);
+const allTeachers = await getAllTeacherCodes();
+const schedule = await constructSchedules(allTeachers)
+const str = JSON.stringify(schedule);
+
+fs.writeFileSync(DB_PATH, str, {
+  encoding: "utf8"
+});

scripts/setup.js

@@ -0,0 +1,28 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
+import fs from "fs";
+
+const DIRS = [
+  "db/persistent",
+  "db/v3",
+];
+
+for (const dir of DIRS) {
+  try {
+    fs.mkdirSync(dir);
+  } catch {}
+}
+
+// LEAVE ME ALONE I KNOW THIS CODE IS SHIT

server.js

@@ -1,16 +1,38 @@
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
 import express from "express";
 import path from "path";
 const app = express();
 import fs from "fs/promises";
 import { getCurrentInterval } from "./scheduleRules.js";
 import bodyParser from "body-parser";
+import cors from "cors";
 
+const VERSIONS = ["v1", "v2"];
 const PORT = process.env.PORT || 3000;
 
 globalThis.File = class File {};
 
 app.use(bodyParser.json());
 
+app.use(cors({
+  origin: "*",
+  methods: ["GET", "POST", "OPTIONS"],
+  allowedHeaders: ["Content-Type"],
+}));
+
 app.get('/', async (req, res) => {
   const userAgent = req.headers['user-agent'] || '';
   const isBrowser = /Mozilla|Chrome|Firefox|Safari|Edg/.test(userAgent);
@@ -27,13 +49,21 @@ app.get('/', async (req, res) => {
   }
 });
 
-app.get('/versioned/v1', async (_, res) => {
+VERSIONS.forEach((version) => {
-  const dataStr = await fs.readFile(path.join(process.cwd(), "db", "v1.json"), "utf8");
+  app.get(`/versioned/${version}`, async (_, res) => {
-  const data = JSON.parse(dataStr);
+    try {
+      const filePath = path.join(process.cwd(), "db", `${version}.json`);
+      const dataStr = await fs.readFile(filePath, "utf8");
+      const data = JSON.parse(dataStr);
 
-  data["status"]["currentUpdateSchedule"] = getCurrentInterval();
+      data.status.currentUpdateSchedule = getCurrentInterval();
 
-  res.json(data);
+      res.json(data);
+    } catch (err) {
+      console.error(err);
+      res.status(500).json({ error: "Failed to load version data" });
+    }
+  });
 });
 
 app.get("/status", async (_, res) => {
@@ -56,7 +86,7 @@ app.post("/report", async (req, res) => {
     return res.status(400).json({ error: "Invalid location value." });
   }
 
-  const url = `https://n8n.local.jzitnik.dev/webhook/${process.env.WEBHOOK_UUID}`;
+  const url = process.env.REPORT_WEBHOOK_URL;
 
   let resp;
   try {

tests/test.js

@@ -1,16 +1,29 @@
-import fs from "fs"
+/*
+ * Copyright (C) 2025 Jakub Žitník
+ *
+ * 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.
+ */
+
+import fs from "fs";
 import parseAbsence from "../scrape/utils/parseAbsence.js";
 
-const teachermap = JSON.parse(fs.readFileSync("./teachermap.json"))
+const teachermap = JSON.parse(fs.readFileSync("./teachermap.json"));
-
 
 test("Me", [
   {
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "wholeDay",
-    hours: null
+    hours: null,
-  }
+  },
 ]);
 
 test("ad", [
@@ -18,8 +31,8 @@ test("ad", [
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "wholeDay",
-    hours: null
+    hours: null,
-  }
+  },
 ]);
 
 test("me ad", [
@@ -27,14 +40,14 @@ test("me ad", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "wholeDay",
-    hours: null
+    hours: null,
   },
   {
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "wholeDay",
-    hours: null
+    hours: null,
-  }
+  },
 ]);
 
 test("me 3", [
@@ -42,8 +55,8 @@ test("me 3", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "single",
-    hours: 3
+    hours: 3,
-  }
+  },
 ]);
 
 test("ad 1", [
@@ -51,8 +64,8 @@ test("ad 1", [
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "single",
-    hours: 1
+    hours: 1,
-  }
+  },
 ]);
 
 test("me 2-4", [
@@ -60,8 +73,8 @@ test("me 2-4", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "range",
-    hours: { from: 2, to: 4 }
+    hours: { from: 2, to: 4 },
-  }
+  },
 ]);
 
 test("ad 5,6", [
@@ -69,8 +82,8 @@ test("ad 5,6", [
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "range",
-    hours: { from: 5, to: 6 }
+    hours: { from: 5, to: 6 },
-  }
+  },
 ]);
 
 test("me 7+", [
@@ -78,8 +91,8 @@ test("me 7+", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "range",
-    hours: { from: 7, to: 10 }
+    hours: { from: 7, to: 10 },
-  }
+  },
 ]);
 
 test("me,ad 3-5", [
@@ -87,14 +100,14 @@ test("me,ad 3-5", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "range",
-    hours: { from: 3, to: 5 }
+    hours: { from: 3, to: 5 },
   },
   {
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "range",
-    hours: { from: 3, to: 5 }
+    hours: { from: 3, to: 5 },
-  }
+  },
 ]);
 
 test("me;ad 4", [
@@ -102,14 +115,14 @@ test("me;ad 4", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "wholeDay",
-    hours: null
+    hours: null,
   },
   {
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "single",
-    hours: 4
+    hours: 4,
-  }
+  },
 ]);
 
 test("me;ad;bo 2-3", [
@@ -117,20 +130,20 @@ test("me;ad;bo 2-3", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "wholeDay",
-    hours: null
+    hours: null,
   },
   {
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "wholeDay",
-    hours: null
+    hours: null,
   },
   {
     teacher: "Ing. Anna Bodnárová",
     teacherCode: "bo",
     type: "range",
-    hours: { from: 2, to: 3 }
+    hours: { from: 2, to: 3 },
-  }
+  },
 ]);
 
 test("me 2 ad 4-5", [
@@ -138,14 +151,14 @@ test("me 2 ad 4-5", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "single",
-    hours: 2
+    hours: 2,
   },
   {
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "range",
-    hours: { from: 4, to: 5 }
+    hours: { from: 4, to: 5 },
-  }
+  },
 ]);
 
 test("3", [
@@ -154,8 +167,8 @@ test("3", [
     teacher: null,
     teacherCode: null,
     hours: null,
-    original: "3"
+    original: "3",
-  }
+  },
 ]);
 
 test("2-4", [
@@ -164,8 +177,8 @@ test("2-4", [
     teacher: null,
     teacherCode: null,
     hours: null,
-    original: "2-4"
+    original: "2-4",
-  }
+  },
 ]);
 
 test("me Xx 3", [
@@ -173,9 +186,9 @@ test("me Xx 3", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "wholeDay",
-    hours: null
+    hours: null,
   },
-  { teacher: null, teacherCode: 'xx', type: 'single', hours: 3 },
+  { teacher: null, teacherCode: "xx", type: "single", hours: 3 },
 ]);
 
 test("me,ad;bo 1-2 ad 5+", [
@@ -183,26 +196,26 @@ test("me,ad;bo 1-2 ad 5+", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "wholeDay",
-    hours: null
+    hours: null,
   },
   {
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "wholeDay",
-    hours: null
+    hours: null,
   },
   {
     teacher: "Ing. Anna Bodnárová",
     teacherCode: "bo",
     type: "range",
-    hours: { from: 1, to: 2 }
+    hours: { from: 1, to: 2 },
   },
   {
     teacher: "Bc. Daniel Adámek",
     teacherCode: "ad",
     type: "range",
-    hours: { from: 5, to: 10 }
+    hours: { from: 5, to: 10 },
-  }
+  },
 ]);
 
 test("Me-exk", [
@@ -210,9 +223,30 @@ test("Me-exk", [
     teacher: "Michaela Meitnerová",
     teacherCode: "me",
     type: "exkurze",
-    hours: null
+    hours: null,
-  }
+  },
-])
+]);
+
+test("za Vn zastupuje Jk", [
+  {
+    teacher: "Ing. Zdeněk Vondra",
+    teacherCode: "vn",
+    type: "zastoupen",
+    zastupuje: {
+      teacher: "David Janoušek",
+      teacherCode: "jk",
+    },
+  },
+]);
+
+test("Vc 1. h", [
+  {
+    teacher: "Ing. Antonín Vobecký",
+    teacherCode: "vc",
+    type: "single",
+    hours: 1,
+  },
+]);
 
 function test(input, expectedOutput) {
   const res = parseAbsence(input, teachermap);
@@ -228,7 +262,12 @@ function test(input, expectedOutput) {
 function deepEqual(a, b) {
   if (a === b) return true;
 
-  if (typeof a !== "object" || a === null || typeof b !== "object" || b === null) {
+  if (
+    typeof a !== "object" ||
+    a === null ||
+    typeof b !== "object" ||
+    b === null
+  ) {
     return false;
   }
 
@@ -238,15 +277,15 @@ function deepEqual(a, b) {
 
     const used = new Array(b.length).fill(false);
 
-    return a.every(itemA =>
+    return a.every((itemA) =>
       b.some((itemB, i) => {
-        if (used[i]) return false;          // don't reuse elements
+        if (used[i]) return false; // don't reuse elements
         if (deepEqual(itemA, itemB)) {
-          used[i] = true;                   // mark element as used
+          used[i] = true; // mark element as used
           return true;
         }
         return false;
-      })
+      }),
     );
   }
 
@@ -257,5 +296,5 @@ function deepEqual(a, b) {
 
   if (keysA.length !== keysB.length) return false;
 
-  return keysA.every(key => keysB.includes(key) && deepEqual(a[key], b[key]));
+  return keysA.every((key) => keysB.includes(key) && deepEqual(a[key], b[key]));
 }

web/content/posts/api-usage-v2/index.md

@@ -0,0 +1,249 @@
+---
+title: "API Dokumentace - Verze 2"
+date: 2026-01-28
+tags: ["api", "docs", "v2"]
+hiddenInHomelist: true
+---
+
+Tato stránka detailně popisuje **Verzi 2 (v2)** API Ječná Rozvrh.
+
+## Endpoint: `GET /versioned/v2`
+
+Toto je hlavní endpoint, který poskytuje veškerá data o rozvrhu pro v2.
+
+### Struktura Odpovědi
+
+Odpověď je JSON objekt, který obsahuje tři hlavní klíče: `schedule`, `props`, a `status`.
+
+<details>
+<summary>Zobrazit příklad struktury odpovědi</summary>
+
+```json
+{
+  "schedule": [ /* pole denních rozvrhů */ ],
+  "props": [ /* pole vlastností dnů */ ],
+  "status": { /* objekt stavu */ }
+}
+```
+</details>
+
+---
+
+### Datové Struktury
+
+#### Sekce: `schedule`
+
+Tato sekce je pole, kde každý prvek představuje jeden den. Každý den je objekt, jehož klíče jsou názvy jednotlivých tříd (např. `A1`, `C2a`, `E4`) a speciální klíč `ABSENCE`.
+
+##### Rozvrh Třídy
+- **Klíč:** Název třídy (např. `"A1"`)
+- **Hodnota:** Pole s 10 prvky, které reprezentují 10 vyučovacích hodin.
+  - `string`: Pokud je hodina normálně vyučována, obsahuje název předmětu nebo informaci o změně.
+  - `null`: Pokud hodina odpadá nebo pro ni není záznam.
+  - Text `(bude upřesněno)` může být připojen k předmětu, pokud je změna nejistá.
+
+<details>
+<summary>Zobrazit příklad rozvrhu pro třídu A1</summary>
+
+```json
+"A1": [
+  "M 5 Kp(Ng)",
+  null,
+  null,
+  "(Me) (bude upřesněno)",
+  null,
+  null,
+  null,
+  null,
+  null,
+  null
+]
+```
+</details>
+
+##### Absence Učitelů
+- **Klíč:** `"ABSENCE"`
+- **Hodnota:** Pole objektů, kde každý objekt specifikuje jednu absenci. Struktura objektu je následující:
+  - `teacher` (string | null): Celé jméno učitele, pokud je známé.
+  - `teacherCode` (string | null): Zkratka jména učitele (např. "me", "ad").
+  - `type` (string): Typ absence. Může nabývat následujících hodnot:
+    - `"wholeDay"`: Učitel chybí celý den.
+    - `"single"`: Učitel chybí jednu vyučovací hodinu.
+    - `"range"`: Učitel chybí v rozmezí několika hodin.
+    - `"exkurze"`: Učitel je na exkurzi.
+    - `"invalid"`: Záznam o absenci se nepodařilo zpracovat.
+  - `hours` (object | number | null): Specifikuje hodiny absence.
+    - `null`: Pro typy `wholeDay`, `exkurze`, a `invalid`.
+    - `number` (např. `3`): Pro typ `single`.
+    - `object` (např. `{ "from": 2, "to": 4 }`): Pro typ `range`.
+  - `original` (string | null): Pouze pro typ `invalid`, obsahuje původní nezpracovaný text.
+
+<details>
+<summary>Zobrazit příklady absencí</summary>
+
+**Celý den:**
+```json
+{
+  "teacher": "Jan Novák",
+  "teacherCode": "no",
+  "type": "wholeDay",
+  "hours": null
+}
+```
+
+**Jedna hodina:**
+```json
+{
+  "teacher": "Jan Novák",
+  "teacherCode": "no",
+  "type": "single",
+  "hours": 1
+}
+```
+
+**Rozsah hodin:**
+```json
+{
+  "teacher": "Jan Novák",
+  "teacherCode": "no",
+  "type": "range",
+  "hours": { "from": 2, "to": 4 }
+}
+```
+
+**Exkurze:**
+```json
+{
+  "teacher": "Jan Novák",
+  "teacherCode": "no",
+  "type": "exkurze",
+  "hours": null
+}
+```
+
+**Zastupuje:**
+```json
+{
+  "teacher": "Ing. Zdeněk Vondra",
+  "teacherCode": "vn",
+  "type": "zastoupen",
+  "hours": null,
+  "zastupuje": {
+    "teacher": "David Janoušek",
+    "teacherCode": "jk",
+  },
+},
+```
+
+**Neplatný záznam:**
+```json
+{
+  "type": "invalid",
+  "teacher": null,
+  "teacherCode": null,
+  "hours": null,
+  "original": "Nezpracovatelný text"
+}
+```
+</details>
+
+#### Sekce: `props` - Vlastnosti Dnů
+
+Pole objektů, které doplňují metadata ke každému dni v poli `schedule`. Pořadí prvků v `props` přesně odpovídá pořadí dnů v `schedule`.
+
+- `date` (string): Datum daného rozvrhu ve formátu `YYYY-MM-DD`.
+- `priprava` (boolean): Hodnota je `true`, pokud je den součástí "přípravného týdne", jinak `false`.
+
+<details>
+<summary>Zobrazit příklad props</summary>
+
+```json
+"props": [
+  {
+    "date": "2025-12-20",
+    "priprava": false
+  },
+  {
+    "date": "2025-12-21",
+    "priprava": true
+  }
+]
+```
+</details>
+
+#### Sekce: `status` - Stav a Metadata
+
+Objekt poskytující informace o aktuálnosti dat.
+
+- `lastUpdated` (string): Čas poslední úspěšné aktualizace dat ve formátu `HH:MM`.
+- `currentUpdateSchedule` (number): Interval v **minutách**, ve kterém scraper interně kontroluje a stahuje novou verzi rozvrhu. Tento interval se dynamicky mění v závislosti na denní době (kratší během vyučování, delší v noci).
+
+<details>
+<summary>Zobrazit příklad status</summary>
+
+```json
+"status": {
+  "lastUpdated": "08:30",
+  "currentUpdateSchedule": 5
+}
+```
+</details>
+
+---
+
+### Kompletní Příklad Odpovědi z `GET /versioned/v2`
+
+<details>
+<summary>Zobrazit kompletní příklad</summary>
+
+```json
+{
+  "schedule": [
+    {
+      "A1": [
+        "M 6 Kp(Ng)",
+        null,
+        null,
+        null,
+        "(Me) (bude upřesněno)",
+        null,
+        null,
+        null,
+        null,
+        null
+      ],
+      "C2": [
+        "M 6 Kp(Ng)",
+        null,
+        null,
+        null,
+        "(Me) (bude upřesněno)",
+        null,
+        null,
+        null,
+        null,
+        null
+      ],
+      "ABSENCE": [
+        {
+          "teacher": "Jan Novák",
+          "teacherCode": "no",
+          "type": "range",
+          "hours": {"from": 1, "to": 3}
+        }
+      ]
+    }
+  ],
+  "props": [
+    {
+      "date": "2025-12-20",
+      "priprava": false
+    }
+  ],
+  "status": {
+    "lastUpdated": "14:30",
+    "currentUpdateSchedule": 5
+  }
+}
+```
+</details>

web/content/posts/api-usage/index.md

@@ -16,7 +16,7 @@ Všechny cesty v této dokumentaci jsou relativní k následující základní U
 
 Kořenový endpoint (`/`) je **zastaralý (deprecated)**.
 
-Ačkoliv v současnosti vrací stejná data jako `/versioned/v1`, jeho podpora může být v budoucnu ukončena. **Prosím, nepoužívejte tento endpoint pro nové projekty a existující projekty aktualizujte na verzované endpoint.**
+Ačkoliv v současnosti vrací stejná data jako `/versioned/v1`, jeho podpora může být v budoucnu ukončena. **Prosím, nepoužívejte tento endpoint pro nové projekty a existující projekty aktualizujte na verzované endpointy.**
 
 ---
 
@@ -24,11 +24,15 @@ Ačkoliv v současnosti vrací stejná data jako `/versioned/v1`, jeho podpora m
 
 API je verzované, aby byla zajištěna zpětná kompatibilita. Zde je seznam dostupných verzí:
 
-- ### [Verze 1 (v1)](../api-usage-v1)
+- ### [Verze 2 (v2)](../api-usage-v2)
   **Status:** Stabilní
   **Endpoint:** `/versioned/v1`
   
-  Toto je aktuální a doporučená verze API. Klikněte na odkaz pro zobrazení kompletní dokumentace pro v1.
+  Toto je aktuální a doporučená verze API. Klikněte na odkaz pro zobrazení kompletní dokumentace pro v2.
+
+- ### [Verze 1 (v1)](../api-usage-v1)
+  **Status:** Stabilní
+  **Endpoint:** `/versioned/v1`
 
 ---
 

web/hugo.yaml

@@ -28,6 +28,9 @@ menu:
     - name: Autor
       url: https://jzitnik.dev
       weight: 20
+    - name: Zdrojový kód
+      url: https://gitea.jzitnik.dev/jzitnik/jecnarozvrh
+      weight: 30
 
 outputs:
   home: