add new app

ReadMe.md

@@ -242,6 +242,7 @@ The Flipper and its community wouldn't be as rich as it is without your contribu
 | QR Code | ![Tools Badge] | [by bmatcuk](https://github.com/bmatcuk/flipperzero-qrcode) |  | ![None Badge] |
 | Resistance calculator | ![Tools Badge] | [by instantiator](https://github.com/instantiator/flipper-zero-experimental-apps) |  | [![UFW Badge]](https://lab.flipper.net/apps/resistors) |
 | Simple calendar app | ![Tools Badge] | [by Adiras](https://github.com/Adiras/flipperzero-calendar) |  | ![None Badge] |
+| Programmer Calculator | ![Tools Badge] | [by armixz](https://github.com/armixz/Flipper-Zero-Programmer-Calculator) |  | ![None Badge] |
 | USB HID Autofire | ![USB Badge] | [by pbek](https://github.com/pbek/usb_hid_autofire) |  | ![None Badge] |
 | USB Consumer Control | ![USB Badge] | [by WithSecureLabs](https://github.com/WithSecureLabs/usb-consumer-control/tree/main) |  | ![None Badge] |
 

non_catalog_apps/prog_calculator/.gitattributes

@@ -0,0 +1,2 @@
+# Auto detect text files and perform LF normalization
+* text=auto

non_catalog_apps/prog_calculator/.gitignore

@@ -0,0 +1,52 @@
+# Prerequisites
+*.d
+
+# Object files
+*.o
+*.ko
+*.obj
+*.elf
+
+# Linker output
+*.ilk
+*.map
+*.exp
+
+# Precompiled Headers
+*.gch
+*.pch
+
+# Libraries
+*.lib
+*.a
+*.la
+*.lo
+
+# Shared objects (inc. Windows DLLs)
+*.dll
+*.so
+*.so.*
+*.dylib
+
+# Executables
+*.exe
+*.out
+*.app
+*.i*86
+*.x86_64
+*.hex
+
+# Debug files
+*.dSYM/
+*.su
+*.idb
+*.pdb
+
+# Kernel Module Compile Results
+*.mod*
+*.cmd
+.tmp_versions/
+modules.order
+Module.symvers
+Mkfile.old
+dkms.conf

non_catalog_apps/prog_calculator/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>.

non_catalog_apps/prog_calculator/application.fam

@@ -0,0 +1,16 @@
+App(
+    appid="programmercalc",
+    name="Programmer Calculator",
+    apptype=FlipperAppType.EXTERNAL,
+    entry_point="calculator_app",
+    cdefines=["APP_CALCULATOR"],
+    requires=["gui"],
+    stack_size=1 * 1024,
+    order=45,
+    fap_icon="calcIcon.png",
+    fap_category="Tools",
+    fap_author="@armixz",
+    fap_weburl="https://github.com/armixz/Flipper-Zero-Programmer-Calculator",
+    fap_version="0.8",
+    fap_description="Calculator, for Programmers!",
+)

non_catalog_apps/prog_calculator/calculation_logic.c

@@ -0,0 +1,330 @@
+#include "calculation_logic.h"
+#include <stdlib.h>
+#include <string.h>
+#include <stdbool.h>
+#include "calculator.h"
+
+// global constant lookup table
+static const char* HEX_TO_BINARY_TABLE[16] = {
+    "0000", "0001", "0010", "0011",
+    "0100", "0101", "0110", "0111",
+    "1000", "1001", "1010", "1011",
+    "1100", "1101", "1110", "1111"
+};
+
+bool decToBin(const char* decString, char* binaryResult, size_t resultSize) {
+    if (decString == NULL || binaryResult == NULL || resultSize < 2) {
+        return false; // Invalid pointers or insufficient result size
+    }
+
+    char* end;
+    unsigned long num = strtoul(decString, &end, 10);
+
+    if (*end != '\0' || *decString == '\0') {
+        return false; // Invalid decimal
+    }
+
+    // Calculate the number of bits
+    size_t bitsNeeded = 0;
+    unsigned long tempNum = num;
+    while (tempNum > 0) {
+        bitsNeeded++;
+        tempNum >>= 1;
+    }
+
+    // If the number is zero
+    if (num == 0) {
+        if (resultSize < 2) {
+            return false; // buffer
+        }
+        strcpy(binaryResult, "0");
+        return true;
+    }
+
+    // check buffer
+    if (bitsNeeded >= resultSize) {
+        return false;
+    }
+
+    binaryResult[bitsNeeded] = '\0'; // Null-terminate the result
+
+    // fill the binary string from the end
+    for (int i = bitsNeeded - 1; i >= 0; i--) {
+        binaryResult[i] = (num & 1) + '0'; // the least significant bit
+        num >>= 1;
+    }
+
+    return true;
+}
+
+bool decToHex(const char* decString, char* hexResult, size_t resultSize) {
+    if (decString == NULL || hexResult == NULL || resultSize == 0) {
+        return false;
+    }
+
+    char* end;
+    unsigned long num = strtoul(decString, &end, 10);
+
+    if (*end != '\0' || *decString == '\0') {
+        return false;
+    }
+
+    // buffer size
+    size_t requiredSize = 1;
+    unsigned long tempNum = num;
+
+    while (tempNum >= 16) {
+        requiredSize++;
+        tempNum /= 16;
+    }
+
+    if (requiredSize + 1 > resultSize) {
+        return false;
+    }
+
+    hexResult[requiredSize] = '\0';
+
+    // convert to hexadecimal in reverse order
+    do {
+        int remainder = num % 16;
+        hexResult[--requiredSize] = (remainder < 10) ? ('0' + remainder) : ('A' + (remainder - 10));
+        num /= 16;
+    } while (num > 0);
+
+    return true;
+}
+
+bool decToChar(const char* decString, char* outChar) {
+    if (decString == NULL || outChar == NULL || *decString == '\0') {
+        return false;
+    }
+
+    char* end;
+    unsigned long num = strtoul(decString, &end, 10);
+
+    if (*end != '\0' || num > 255) {
+        return false;
+    }
+
+    *outChar = (char)num;
+    return true;
+}
+
+bool hexDigitToBinary(char hexDigit, char* binary) {
+    const char* hexToBinary = NULL;
+
+    if (hexDigit >= '0' && hexDigit <= '9') {
+        hexToBinary = HEX_TO_BINARY_TABLE[hexDigit - '0'];
+    } else if (hexDigit >= 'A' && hexDigit <= 'F') {
+        hexToBinary = HEX_TO_BINARY_TABLE[10 + hexDigit - 'A'];
+    } else if (hexDigit >= 'a' && hexDigit <= 'f') {
+        hexToBinary = HEX_TO_BINARY_TABLE[10 + hexDigit - 'a'];
+    }
+
+    if (hexToBinary) {
+        memcpy(binary, hexToBinary, 5);
+        return true;
+    } else {
+        return false;
+    }
+}
+
+bool hexToBin(const char* hexString, char* binaryResult, size_t resultSize) {
+    if (hexString == NULL || binaryResult == NULL || resultSize == 0) {
+        return false;
+    }
+
+    size_t requiredSize = strlen(hexString) * 4 + 1;
+    if (requiredSize > resultSize) {
+        return false;
+    }
+
+    while (*hexString) {
+        const char* hexToBinary;
+        if (*hexString >= '0' && *hexString <= '9') {
+            hexToBinary = HEX_TO_BINARY_TABLE[*hexString - '0'];
+        } else if (*hexString >= 'A' && *hexString <= 'F') {
+            hexToBinary = HEX_TO_BINARY_TABLE[10 + *hexString - 'A'];
+        } else if (*hexString >= 'a' && *hexString <= 'f') {
+            hexToBinary = HEX_TO_BINARY_TABLE[10 + *hexString - 'a'];
+        } else {
+            return false;
+        }
+
+        if (resultSize < 4) {
+            return false;
+        }
+        memcpy(binaryResult, hexToBinary, 4);
+        binaryResult += 4;
+        hexString++;
+        resultSize -= 4;
+    }
+
+    *binaryResult = '\0';
+    return true;
+}
+
+bool hexToDec(const char* hexString, int* outNum) {
+    if (hexString == NULL || outNum == NULL) {
+        return false;
+    }
+
+    *outNum = 0;
+    while (*hexString) {
+        char digit = *hexString;
+        int value;
+
+        if (digit >= '0' && digit <= '9') {
+            value = digit - '0';
+        } else if (digit >= 'A' && digit <= 'F') {
+            value = digit - 'A' + 10;
+        } else if (digit >= 'a' && digit <= 'f') {
+            value = digit - 'a' + 10;
+        } else {
+            return false;
+        }
+
+        if (*outNum > INT_MAX / 16 || (*outNum == INT_MAX / 16 && value > INT_MAX % 16)) {
+            return false; // check overflow
+        }
+
+        *outNum = *outNum * 16 + value;
+        hexString++;
+    }
+
+    return true;
+}
+
+bool binToDec(const char* binaryString, int* decResult) {
+    if (binaryString == NULL || decResult == NULL) {
+        return false;
+    }
+
+    *decResult = 0;
+    for (const char* p = binaryString; *p; ++p) {
+        if (*p != '0' && *p != '1') {
+            return false;
+        }
+        if (*decResult > INT_MAX / 2) {
+            return false; // check overflow
+        }
+        *decResult = (*decResult << 1) | (*p - '0');
+    }
+
+    return true;
+}
+
+char binaryToHexDigit(const char* bin) {
+    int value = 0;
+    for (int i = 0; i < 4; ++i) {
+        value = (value << 1) | (bin[i] - '0');
+    }
+
+    return (value < 10) ? ('0' + value) : ('A' + (value - 10));
+}
+
+bool binToHex(const char* binaryString, char* hexResult, size_t resultSize) {
+    if (binaryString == NULL || hexResult == NULL || resultSize == 0) {
+        return false;
+    }
+
+    size_t binLength = strlen(binaryString);
+
+    for (size_t i = 0; i < binLength; ++i) {
+        if (binaryString[i] != '0' && binaryString[i] != '1') {
+            snprintf(hexResult, resultSize, "Invalid Binary");
+            return false;
+        }
+    }
+
+    // padding zeros - len multiple of 4
+    size_t paddingZeros = (4 - (binLength % 4)) % 4;
+    size_t totalChunks = (binLength + paddingZeros) / 4;
+
+    if (totalChunks > resultSize - 1) {
+        return false;
+    }
+
+    size_t hexIndex = 0;
+    char tempBin[5] = "0000";
+    size_t tempIndex = 0;
+
+    for (size_t i = 0; i < binLength + paddingZeros; ++i) {
+        if (i < paddingZeros) {
+            tempBin[tempIndex++] = '0';
+        } else {
+            tempBin[tempIndex++] = binaryString[i - paddingZeros];
+        }
+
+        if (tempIndex == 4) {
+            hexResult[hexIndex++] = binaryToHexDigit(tempBin);
+            tempIndex = 0;
+        }
+    }
+
+    hexResult[hexIndex] = '\0';
+    return true;
+}
+
+void calculate(Calculator* calculator_state) {
+    if (calculator_state == NULL) {
+        return;
+    }
+
+    int num = 0;
+    char result = '\0';
+
+    switch (calculator_state->mode) {
+        case ModeDecToBin:
+            if (!decToBin(calculator_state->text, calculator_state->binaryResult, sizeof(calculator_state->binaryResult))) {
+                snprintf(calculator_state->binaryResult, sizeof(calculator_state->binaryResult), "Invalid Dec");
+            }
+            break;
+
+        case ModeDecToHex:
+            if (!decToHex(calculator_state->text, calculator_state->hexResult, sizeof(calculator_state->hexResult))) {
+                snprintf(calculator_state->hexResult, sizeof(calculator_state->hexResult), "Invalid Dec");
+            }
+            break;
+
+        case ModeDecToChar:
+            if (decToChar(calculator_state->text, &result)) {
+                calculator_state->charResult[0] = result;
+                calculator_state->charResult[1] = '\0';
+            } else {
+                snprintf(calculator_state->charResult, sizeof(calculator_state->charResult), "Invalid Dec");
+            }
+            break;
+
+        case ModeHexToBin:
+            if (!hexToBin(calculator_state->text, calculator_state->binaryResult, sizeof(calculator_state->binaryResult))) {
+                snprintf(calculator_state->binaryResult, sizeof(calculator_state->binaryResult), "Invalid Hex");
+            }
+            break;
+
+        case ModeHexToDec:
+            if (hexToDec(calculator_state->text, &num)) {
+                snprintf(calculator_state->decResult, sizeof(calculator_state->decResult), "%d", num);
+            } else {
+                snprintf(calculator_state->decResult, sizeof(calculator_state->decResult), "Invalid Hex");
+            }
+            break;
+
+        case ModeBinToDec:
+            if (binToDec(calculator_state->text, &num)) {
+                snprintf(calculator_state->decResult, sizeof(calculator_state->decResult), "%d", num);
+            } else {
+                snprintf(calculator_state->decResult, sizeof(calculator_state->decResult), "Invalid Binary");
+            }
+            break;
+
+        case ModeBinToHex:
+            if (!binToHex(calculator_state->text, calculator_state->hexResult, sizeof(calculator_state->hexResult))) {
+                snprintf(calculator_state->hexResult, sizeof(calculator_state->hexResult), "Invalid Binary");
+            }
+            break;
+
+        default:
+            break;
+    }
+}

non_catalog_apps/prog_calculator/calculation_logic.h

@@ -0,0 +1,15 @@
+#ifndef CALCULATION_LOGIC_H
+#define CALCULATION_LOGIC_H
+
+#include "calculator_state.h"
+
+bool decToBin(const char* decString, char* binaryResult, size_t resultSize);
+bool decToHex(const char* decString, char* hexResult, size_t resultSize);
+bool decToChar(const char* decString, char* outChar);
+bool hexToBin(const char* hexString, char* binaryResult, size_t resultSize);
+bool hexToDec(const char* hexString, int* outNum);
+bool binToDec(const char* binaryString, int* decResult);
+bool binToHex(const char* binaryString, char* hexResult, size_t resultSize);
+void calculate(Calculator* calculator_state);
+
+#endif // CALCULATION_LOGIC_H

non_catalog_apps/prog_calculator/calculator.c

@@ -0,0 +1,23 @@
+#include "calculator.h"
+
+int32_t calculator_app(void* p) {
+    UNUSED(p);
+    FuriMessageQueue* event_queue = initialize_event_queue();
+    Calculator* calculator_state = initialize_calculator_state();
+    if(!calculator_state) return -1;
+
+    ViewPort* view_port = initialize_view_port(calculator_state, event_queue);
+    Gui* gui = initialize_gui(view_port);
+
+    InputEvent event;
+    while(furi_message_queue_get(event_queue, &event, FuriWaitForever) == FuriStatusOk) {
+        if(event.type == InputTypeShort && event.key == InputKeyBack) {
+            break;
+        }
+        handle_event(calculator_state, view_port, &event);
+    }
+
+    cleanup_resources(calculator_state, view_port, gui, event_queue);
+    return 0;
+}
+

non_catalog_apps/prog_calculator/calculator.h

@@ -0,0 +1,11 @@
+#ifndef CALCULATOR_H
+#define CALCULATOR_H
+
+#include "calculator_state.h"
+#include "input_handling.h"
+#include "calculation_logic.h"
+#include "ui_drawing.h"
+#include "utilities.h"
+#include "init_cleanup.h"
+
+#endif // CALCULATOR_H

non_catalog_apps/prog_calculator/calculator_state.c

@@ -0,0 +1,30 @@
+#include "calculator_state.h"
+#include "calculator.h"
+
+void toggle_mode(Calculator* calculator_state) {
+    switch (calculator_state->mode) {
+        case ModeDecToBin:
+            calculator_state->mode = ModeDecToHex;
+            break;
+        case ModeDecToHex:
+            calculator_state->mode = ModeDecToChar;
+            break;
+        case ModeDecToChar:
+            calculator_state->mode = ModeHexToBin;
+            break;
+        case ModeHexToBin:
+            calculator_state->mode = ModeHexToDec;
+            break;
+        case ModeHexToDec:
+            calculator_state->mode = ModeBinToDec;
+            break;
+        case ModeBinToDec:
+            calculator_state->mode = ModeBinToHex;
+            break;
+        case ModeBinToHex:
+            calculator_state->mode = ModeDecToBin;
+            break;
+        default:
+            calculator_state->mode = ModeDecToBin;
+    }
+}

non_catalog_apps/prog_calculator/calculator_state.h

@@ -0,0 +1,42 @@
+#ifndef CALCULATOR_STATE_H
+#define CALCULATOR_STATE_H
+
+#include <furi.h>
+#include <stdbool.h>
+
+#define MAX_TEXT_LENGTH 30
+
+typedef enum {
+    ModeNone,
+    ModeDecToBin,
+    ModeDecToHex,
+    ModeDecToChar,
+    ModeHexToBin,
+    ModeHexToDec,
+    ModeBinToDec,
+    ModeBinToHex
+} CalculatorMode;
+
+typedef struct {
+    short x;
+    short y;
+} selectedPosition;
+
+typedef struct {
+    FuriMutex* mutex;
+    selectedPosition position;
+    char text[MAX_TEXT_LENGTH];
+    char originalInput[MAX_TEXT_LENGTH];
+    char binaryResult[MAX_TEXT_LENGTH];
+    char hexResult[MAX_TEXT_LENGTH];
+    char decResult[MAX_TEXT_LENGTH];
+    char charResult[MAX_TEXT_LENGTH];
+    short textLength;
+    char log[MAX_TEXT_LENGTH];
+    bool newInputStarted;
+    CalculatorMode mode;
+} Calculator;
+
+void toggle_mode(Calculator* calculator_state);
+
+#endif // CALCULATOR_STATE_H

non_catalog_apps/prog_calculator/init_cleanup.c

@@ -0,0 +1,47 @@
+#include "init_cleanup.h"
+#include "ui_drawing.h"
+#include "input_handling.h"
+#include <notification/notification.h>
+#include <notification/notification_messages.h>
+#include "calculator.h"
+
+FuriMessageQueue* initialize_event_queue() {
+    return furi_message_queue_alloc(8, sizeof(InputEvent));
+}
+
+Calculator* initialize_calculator_state() {
+    Calculator* state = malloc(sizeof(Calculator));
+    state->mutex = furi_mutex_alloc(FuriMutexTypeNormal);
+    if(!state->mutex) {
+        free(state);
+        return NULL;
+    }
+    return state;
+}
+
+
+ViewPort* initialize_view_port(Calculator* calculator_state, FuriMessageQueue* event_queue) {
+    ViewPort* view_port = view_port_alloc();
+    view_port_draw_callback_set(view_port, calculator_draw_callback, calculator_state);
+    view_port_input_callback_set(view_port, calculator_input_callback, event_queue);
+    view_port_set_orientation(view_port, ViewPortOrientationVertical);
+    return view_port;
+}
+
+
+Gui* initialize_gui(ViewPort* view_port) {
+    Gui* gui = furi_record_open(RECORD_GUI);
+    gui_add_view_port(gui, view_port, GuiLayerFullscreen);
+    return gui;
+}
+
+
+void cleanup_resources(Calculator* calculator_state, ViewPort* view_port, Gui* gui, FuriMessageQueue* event_queue) {
+    gui_remove_view_port(gui, view_port);
+    view_port_free(view_port);
+    furi_mutex_free(calculator_state->mutex);
+    furi_message_queue_free(event_queue);
+    furi_record_close(RECORD_NOTIFICATION);
+    furi_record_close(RECORD_GUI);
+    free(calculator_state);
+}

non_catalog_apps/prog_calculator/init_cleanup.h

@@ -0,0 +1,14 @@
+#ifndef INIT_CLEANUP_H
+#define INIT_CLEANUP_H
+
+#include "calculator_state.h"
+#include <furi.h>
+#include <gui/gui.h>
+
+FuriMessageQueue* initialize_event_queue();
+Calculator* initialize_calculator_state();
+ViewPort* initialize_view_port(Calculator* calculator_state, FuriMessageQueue* event_queue);
+Gui* initialize_gui(ViewPort* view_port);
+void cleanup_resources(Calculator* calculator_state, ViewPort* view_port, Gui* gui, FuriMessageQueue* event_queue);
+
+#endif // INIT_CLEANUP_H

non_catalog_apps/prog_calculator/input_handling.c

@@ -0,0 +1,150 @@
+#include "input_handling.h"
+#include "calculator_state.h"
+#include "calculator.h"
+#include <furi.h>
+#include <furi_hal.h>
+#include <gui/gui.h>
+#include <input/input.h>
+#include <notification/notification.h>
+#include <notification/notification_messages.h>
+#include <stdbool.h>
+#include <string.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+void calculator_input_callback(InputEvent* input_event, void* ctx) {
+    furi_assert(ctx);
+    FuriMessageQueue* event_queue = ctx;
+    furi_message_queue_put(event_queue, input_event, FuriWaitForever);
+}
+
+
+void handle_short_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event) {
+    switch(event->key) {
+        case InputKeyUp:
+            if(calculator_state->position.y > 0) {
+                if(calculator_state->position.y == 2) {
+                    calculator_state->position.x = 0;
+                }
+                calculator_state->position.y--;
+                if(calculator_state->position.y == 1) { // If cursor moves to row 2, skip it
+                    calculator_state->position.y--;
+                }
+            }   
+            break;
+        case InputKeyDown:
+            if(calculator_state->position.y < 6 - 1) {
+                if(calculator_state->position.y == 6 - 2 && 
+                   (calculator_state->position.x == 3 || calculator_state->position.x == 4)) {
+                    calculator_state->position.y = 6 - 1;
+                    calculator_state->position.x = 3;
+                } else {
+                    calculator_state->position.y++;
+                }
+                if(calculator_state->position.y == 1) { // If cursor moves to row 2, skip it
+                    calculator_state->position.y++;
+                }
+            }
+            break;
+        case InputKeyLeft:
+            if(calculator_state->position.y > 1 && calculator_state->position.x > 0) {
+                calculator_state->position.x--;
+            }
+            break;
+        case InputKeyRight:
+            if(calculator_state->position.y < 2) {
+                // Cursor stays in the same column
+            } else if(calculator_state->position.y == 6 - 1) {
+                if(calculator_state->position.x < 3) {
+                    calculator_state->position.x++;
+                }
+            } else {
+                if(calculator_state->position.x < 6 - 1) {
+                    calculator_state->position.x++;
+                }
+            }
+            break;
+        case InputKeyOk:
+            if(calculator_state->position.y == 0) {
+                toggle_mode(calculator_state);
+            } else {
+                char key = getKeyAtPosition(calculator_state->position.x, calculator_state->position.y);
+                handle_key_press(calculator_state, key);
+            }
+            break;
+
+        default:
+            break;
+    }
+
+    view_port_update(view_port);
+}
+
+void handle_long_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event) {
+    switch(event->key) {
+        case InputKeyOk:
+            if(calculator_state->position.x == 0 && calculator_state->position.y == 4) {
+                if(calculator_state->textLength < MAX_TEXT_LENGTH) {
+                    calculator_state->text[calculator_state->textLength++] = ')';
+                    calculator_state->text[calculator_state->textLength] = '\0';
+                }
+            }
+            break;
+        default:
+            break;
+    }
+
+    view_port_update(view_port);
+}
+
+void handle_key_press(Calculator* calculator_state, char key) {
+    switch(key) {
+        case '=':
+            // Logic for '=' key
+            strncpy(calculator_state->originalInput, calculator_state->text, MAX_TEXT_LENGTH);
+            calculate(calculator_state);
+            // calculator_state->text[0] = '\0';
+            calculator_state->textLength = 0;
+            break;
+        case 'R':
+            // Logic for 'R' key, typically 'Clear'
+            calculator_state->text[0] = '\0';
+            calculator_state->textLength = 0;
+            calculator_state->binaryResult[0] = '\0';  // Clear binary result
+            calculator_state->decResult[0] = '\0';     // Clear binary result
+            calculator_state->charResult[0] = '\0';    // Clear binary result
+            calculator_state->hexResult[0] = '\0';     // Clear hex result
+            calculator_state->newInputStarted = false;
+            break;
+        case '<':
+            // Logic for '<' key, typically 'Backspace'
+            if(calculator_state->textLength > 0) {
+                calculator_state->text[--calculator_state->textLength] = '\0';
+            }
+            calculator_state->newInputStarted = false;
+            break;
+        default:
+            // Default logic for number and operator keys
+            if(calculator_state->newInputStarted) {
+                // Reset the text for a fresh input if new input has started
+                calculator_state->text[0] = '\0';
+                calculator_state->textLength = 0;
+                calculator_state->newInputStarted = false;
+            }
+            // Add the new character to the text, respecting the maximum text length
+            if(calculator_state->textLength < MAX_TEXT_LENGTH - 1) {
+                calculator_state->text[calculator_state->textLength++] = key;
+                calculator_state->text[calculator_state->textLength] = '\0';
+            }
+            break;
+    }
+}
+
+void handle_event(Calculator* calculator_state, ViewPort* view_port, InputEvent* event) {
+    if(event->type == InputTypeShort) {
+        handle_short_press(calculator_state, view_port, event);
+    } else if(event->type == InputTypeLong) {
+        handle_long_press(calculator_state, view_port, event);
+    }
+    view_port_update(view_port);
+}

non_catalog_apps/prog_calculator/input_handling.h

@@ -0,0 +1,15 @@
+#ifndef INPUT_HANDLING_H
+#define INPUT_HANDLING_H
+
+#include "calculator_state.h"
+#include <input/input.h>
+#include <gui/gui.h>
+#include <furi_hal.h>
+
+void calculator_input_callback(InputEvent* input_event, void* ctx);
+void handle_short_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event);
+void handle_long_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event);
+void handle_key_press(Calculator* calculator_state, char key);
+void handle_event(Calculator* calculator_state, ViewPort* view_port, InputEvent* event);
+
+#endif // INPUT_HANDLING_H

non_catalog_apps/prog_calculator/ui_drawing.c

@@ -0,0 +1,220 @@
+#include "ui_drawing.h"
+#include <string.h>
+#include "utilities.h"
+#include "calculator.h"
+
+void drawElement(Canvas* canvas, const char* str, int x, int y, int width, int height, Font font) {
+    if (str) {
+        canvas_set_font(canvas, font);
+        canvas_draw_str(canvas, x, y, str);
+    } else {
+        canvas_draw_box(canvas, x, y, width, height);
+    }
+}
+
+void generate_calculator_layout(Canvas* canvas) {
+
+
+    // display
+    canvas_draw_frame(canvas, 0, 0, 64, 49);  // display frame 
+    canvas_draw_frame(canvas, 2, 2, 60, 31);  // output  frame
+    canvas_draw_frame(canvas, 2, 34, 60, 13); // input   frame
+
+    // Horizonal and Vertical lines
+    drawElement(canvas, NULL, 0, 48, 64, 2, 0);  // H line 1
+    drawElement(canvas, NULL, 0, 61, 64, 1, 0);  // H line 2
+    drawElement(canvas, NULL, 0, 73, 64, 2, 0);  // H line 3
+    drawElement(canvas, NULL, 0, 87, 64, 1, 0);  // H line 4
+    drawElement(canvas, NULL, 0, 100, 64, 1, 0); // H line 5
+    drawElement(canvas, NULL, 0, 113, 64, 1, 0); // H line 6
+    drawElement(canvas, NULL, 0, 126, 64, 2, 0); // H line 7
+    
+    drawElement(canvas, NULL, 0, 50, 2, 80, 0);  // V line 1
+    drawElement(canvas, NULL, 13, 73, 1, 55, 0); // V line 2
+    drawElement(canvas, NULL, 25, 73, 1, 55, 0); // V line 3
+    drawElement(canvas, NULL, 37, 73, 2, 55, 0); // V line 4
+    drawElement(canvas, NULL, 50, 73, 1, 41, 0); // V line 5
+    drawElement(canvas, NULL, 62, 48, 2, 81, 0); // V line 6
+
+    // MODE key and display
+    // row 1 and 2
+    drawElement(canvas, "MODE", 19, 59, 0, 0, FontSecondary);
+    drawElement(canvas, "", 5, 38, 0, 0, FontSecondary);
+
+    // Keys
+    // row 3
+    drawElement(canvas, "7", 5, 85, 0, 0, FontSecondary);
+    drawElement(canvas, "8", 17, 85, 0, 0, FontSecondary);
+    drawElement(canvas, "9", 29, 85, 0, 0, FontSecondary);
+    drawElement(canvas, "A", 42, 85, 0, 0, FontSecondary);
+    drawElement(canvas, "B", 54, 85, 0, 0, FontSecondary);
+    // row 4
+    drawElement(canvas, "4", 5, 98, 0, 0, FontSecondary);
+    drawElement(canvas, "5", 17, 98, 0, 0, FontSecondary);
+    drawElement(canvas, "6", 29, 98, 0, 0, FontSecondary);
+    drawElement(canvas, "C", 42, 98, 0, 0, FontSecondary);
+    drawElement(canvas, "D", 54, 98, 0, 0, FontSecondary);
+    // row 5
+    drawElement(canvas, "1", 6, 111, 0, 0, FontSecondary);
+    drawElement(canvas, "2", 17, 111, 0, 0, FontSecondary);
+    drawElement(canvas, "3", 29, 111, 0, 0, FontSecondary);
+    drawElement(canvas, "E", 42, 111, 0, 0, FontSecondary);
+    drawElement(canvas, "F", 54, 111, 0, 0, FontSecondary);
+    // row 6
+    drawElement(canvas, "<", 6, 124, 0, 0, FontSecondary);
+    drawElement(canvas, "0", 17, 124, 0, 0, FontSecondary);
+    drawElement(canvas, "=", 29, 124, 0, 0, FontSecondary);
+    drawElement(canvas, "CLR", 42, 124, 0, 0, FontSecondary);
+
+}
+
+// highlighting when cursor moves
+void draw_highlighted_cell(Canvas* canvas, short x, short y, short width, short height) {
+    canvas_set_color(canvas, ColorBlack);  
+    canvas_draw_box(canvas, x, y, width, height);
+}
+
+void displayResult(Canvas* canvas, char* result, int x, int y) {
+    int length = strlen(result);
+    int lineSpacing = 9; // Reduced line spacing
+
+    if (length > 22) {
+        char line1[12];
+        strncpy(line1, result, 11);
+        line1[11] = '\0';
+
+        char line2[12];
+        strncpy(line2, result + 11, 11);
+        line2[11] = '\0';
+
+        const char* line3 = result + 22;
+
+        canvas_draw_str(canvas, x, y, line1);
+        canvas_draw_str(canvas, x, y + lineSpacing, line2);
+        canvas_draw_str(canvas, x, y + 2 * lineSpacing, line3);
+    } else if (length > 11) {
+        char line1[12];
+        strncpy(line1, result, 11);
+        line1[11] = '\0';
+
+        const char* line2 = result + 11;
+
+        canvas_draw_str(canvas, x, y, line1);
+        canvas_draw_str(canvas, x, y + lineSpacing, line2);
+    } else {
+        canvas_draw_str(canvas, x, y, result); // Single line if 11 characters or less
+    }
+}
+
+
+void calculator_draw_callback(Canvas* canvas, void* ctx) {
+    furi_assert(ctx);
+    const Calculator* calculator_state = ctx;
+    furi_mutex_acquire(calculator_state->mutex, FuriWaitForever);
+
+    // Clear the canvas for fresh drawing
+    canvas_clear(canvas);
+
+    // Draw the static UI layout
+    generate_calculator_layout(canvas);
+
+    char resultLabel[2 * MAX_TEXT_LENGTH]; // Buffer to hold the result label
+
+    // Check which mode is selected and prepare the label accordingly
+    if(calculator_state->mode == ModeHexToDec) {
+        snprintf(resultLabel, sizeof(resultLabel), "Dec: %s", calculator_state->decResult);
+    } else if(calculator_state->mode == ModeDecToBin) {
+        snprintf(resultLabel, sizeof(resultLabel), "Bin: %s", calculator_state->binaryResult);
+    } else if(calculator_state->mode == ModeDecToChar) {
+        snprintf(resultLabel, sizeof(resultLabel), "Charachter %s", calculator_state->charResult);
+    } else if(calculator_state->mode == ModeHexToBin) {
+        snprintf(resultLabel, sizeof(resultLabel), "Bin: %s", calculator_state->binaryResult);
+    } else if(calculator_state->mode == ModeDecToHex) {
+        snprintf(resultLabel, sizeof(resultLabel), "Hex: %s", calculator_state->hexResult);
+    } else if(calculator_state->mode == ModeBinToDec) {
+        snprintf(resultLabel, sizeof(resultLabel), "Dec: %s", calculator_state->decResult);
+    } else if(calculator_state->mode == ModeBinToHex) {
+        snprintf(resultLabel, sizeof(resultLabel), "Hex: %s", calculator_state->hexResult);
+    } else {
+        // If no mode is selected, you can display a default message or leave it empty
+        strncpy(resultLabel, "Click MODE Programmer Calc v0.8", sizeof(resultLabel));
+    }
+
+    // Display the result, splitting into two lines if necessary
+    displayResult(canvas, resultLabel, 5, 12);
+
+    // Draw new input with ">" label or mode selection prompt
+    char inputLabel[MAX_TEXT_LENGTH + 3]; // Adjusted size for "> "
+    
+    snprintf(inputLabel, sizeof(inputLabel), "$> %s", calculator_state->text);
+    canvas_draw_str(canvas, 5, 44, inputLabel);
+    // Define the cell dimensions for each row and column
+    const short cellDimensions[6][5][2] = {
+        // {Width, Height} for each cell
+        {{12, 13}, {0, 0}, {0, 0}, {0, 0}, {0, 0}}, // Row 1 (One column)
+        {{9, 13}, {0, 0}, {0, 0}, {0, 0}, {0, 0}}, // Row 2 (One column)
+        {{12, 13}, {12, 13}, {12, 13}, {12, 13}, {12, 13}}, // Row 3
+        {{12, 13}, {12, 13}, {12, 13}, {12, 13}, {12, 13}}, // Row 4
+        {{12, 13}, {12, 13}, {12, 13}, {12, 13}, {12, 13}}, // Row 5
+        {{12, 13}, {12, 13}, {12, 13}, {24, 13}, {0, 0}}, // Row 6, with different width for column 4
+    };
+
+    const char* modeStr = "";
+    switch(calculator_state->mode) {
+        case ModeDecToBin:
+            modeStr = " 1: Dec >> Bin";
+            break;
+        case ModeDecToHex:
+            modeStr = "2: Dec >> Hex";
+            break;
+        case ModeDecToChar:
+            modeStr = "3: Dec >> Char";
+            break;
+        case ModeHexToBin:
+            modeStr = "4: Hex >> Bin";
+            break;
+        case ModeHexToDec:
+            modeStr = "5: Hex >> Dec";
+            break;
+        case ModeBinToDec:
+            modeStr = "6: Bin >> Dec";
+            break;
+        case ModeBinToHex:
+            modeStr = "7: Bin >> Hex";
+            break;
+        default:
+            modeStr = "      waiting ...";
+            break;
+    }
+    canvas_draw_str(canvas, 4, 71, modeStr);
+    short cursorX = 2;
+    short cursorY = 48; // Starting Y position
+
+    for (int i = 0; i < calculator_state->position.y; i++) {
+        cursorY += cellDimensions[i][0][1]; // Add the height of each previous row
+    }
+
+    for (int i = 0; i < calculator_state->position.x; i++) {
+        cursorX += cellDimensions[calculator_state->position.y][i][0]; // Add the width of each previous column
+    }
+
+    short cellWidth = cellDimensions[calculator_state->position.y][calculator_state->position.x][0];
+    short cellHeight = cellDimensions[calculator_state->position.y][calculator_state->position.x][1];
+
+    // Draw the highlighted cell
+    draw_highlighted_cell(canvas, cursorX, cursorY, cellWidth, cellHeight);
+
+    // Determine the content to display in the cell
+    char cellContent[2]; // Buffer to hold the cell content
+    snprintf(cellContent, sizeof(cellContent), "%c", getKeyAtPosition(calculator_state->position.x, calculator_state->position.y));
+
+    // Calculate center position for the text
+    short textX = cursorX + (cellWidth - calculateStringWidth(cellContent, 2)) / 1;
+    short textY = cursorY + (cellHeight - 2) / 1;
+
+    // Set the color for the text and draw it
+    canvas_set_color(canvas, ColorWhite);
+    canvas_draw_str(canvas, textX, textY, cellContent);
+
+    furi_mutex_release(calculator_state->mutex);
+}

non_catalog_apps/prog_calculator/ui_drawing.h

@@ -0,0 +1,13 @@
+#ifndef UI_DRAWING_H
+#define UI_DRAWING_H
+
+#include "calculator_state.h"
+#include <gui/canvas.h>
+
+void drawElement(Canvas* canvas, const char* str, int x, int y, int width, int height, Font font);
+void generate_calculator_layout(Canvas* canvas);
+void draw_highlighted_cell(Canvas* canvas, short x, short y, short width, short height);
+void displayResult(Canvas* canvas, char* result, int x, int y);
+void calculator_draw_callback(Canvas* canvas, void* ctx);
+
+#endif // UI_DRAWING_H

non_catalog_apps/prog_calculator/utilities.c

@@ -0,0 +1,48 @@
+#include "utilities.h"
+#include "calculator.h"
+
+char getKeyAtPosition(short x, short y) {
+    const char keys[6][5] = {
+        {'*', ' ', ' ', ' ', ' '}, // Row 1 (MODE key)
+        {' ', ' ', ' ', ' ', ' '}, // Row 2 (display row)
+        {'7', '8', '9', 'A', 'B'}, // Row 3
+        {'4', '5', '6', 'C', 'D'}, // Row 4
+        {'1', '2', '3', 'E', 'F'}, // Row 5
+        {'<', '0', '=', 'R', ' '}  // Row 6
+    };
+
+    return (y < 6 && x < 5) ? keys[y][x] : ' ';
+}
+
+short calculateStringWidth(const char* str, short length) {
+    short width = 0;
+    for (short i = 0; i < length; i++) {
+        switch (str[i]) {
+            case '*':width += 4;break;
+            case '0':width += 4;break;
+            case '1':width += 3;break;
+            case '2':
+            case '3':
+            case '4':width += 4;break;
+            case '5':width += 4;break;
+            case '6':width += 4;break;
+            case '7':width += 4;break;
+            case '8':width += 4;break;
+            case '9':width += 4;break;
+            case 'A':
+            case 'B':
+            case 'C':
+            case 'D':
+            case 'E':
+            case 'F':
+            case '<':width += 3;break;
+            case '=':width += 4;break;
+            case 'R':width += 9;break;
+            default:
+                width += 3;
+                break;
+        }
+        width += 1;
+    }
+    return width;
+}

non_catalog_apps/prog_calculator/utilities.h

@@ -0,0 +1,7 @@
+#ifndef UTILITIES_H
+#define UTILITIES_H
+
+char getKeyAtPosition(short x, short y);
+short calculateStringWidth(const char* str, short length);
+
+#endif // UTILITIES_H