├── .flipcorg ├── banner.png └── gallery │ ├── BinToDec.png │ ├── BinToHex.png │ ├── HexToBin.png │ ├── HexToDec.png │ ├── decToBin.png │ ├── decToChar.png │ └── decToHex.png ├── .gitattributes ├── .github └── workflows │ └── build.yml ├── .gitignore ├── LICENSE ├── README.md ├── application.fam ├── calcIcon.png ├── calculation_logic.c ├── calculation_logic.h ├── calculator.c ├── calculator.h ├── calculator_state.c ├── calculator_state.h ├── docs ├── README_catalog.md └── changelog.md ├── img ├── 1.png ├── 2.png ├── 3.png ├── 4.png ├── 5.png ├── 6.png ├── 7.png └── 8.png ├── init_cleanup.c ├── init_cleanup.h ├── input_handling.c ├── input_handling.h ├── ui_drawing.c ├── ui_drawing.h ├── utilities.c └── utilities.h /.flipcorg/banner.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/banner.png -------------------------------------------------------------------------------- /.flipcorg/gallery/BinToDec.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/gallery/BinToDec.png -------------------------------------------------------------------------------- /.flipcorg/gallery/BinToHex.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/gallery/BinToHex.png -------------------------------------------------------------------------------- /.flipcorg/gallery/HexToBin.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/gallery/HexToBin.png -------------------------------------------------------------------------------- /.flipcorg/gallery/HexToDec.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/gallery/HexToDec.png -------------------------------------------------------------------------------- /.flipcorg/gallery/decToBin.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/gallery/decToBin.png -------------------------------------------------------------------------------- /.flipcorg/gallery/decToChar.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/gallery/decToChar.png -------------------------------------------------------------------------------- /.flipcorg/gallery/decToHex.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/.flipcorg/gallery/decToHex.png -------------------------------------------------------------------------------- /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | -------------------------------------------------------------------------------- /.github/workflows/build.yml: -------------------------------------------------------------------------------- 1 | name: "FAP: Programmer Calculator" 2 | on: [push, pull_request] 3 | jobs: 4 | ufbt-build-action: 5 | runs-on: ubuntu-latest 6 | name: 'ufbt: Build for Dev branch' 7 | steps: 8 | - name: Checkout 9 | uses: actions/checkout@v4 10 | - name: Build with ufbt 11 | uses: flipperdevices/flipperzero-ufbt-action@v0.1 12 | id: build-app 13 | with: 14 | # Set to 'release' to build for latest published release version 15 | sdk-channel: dev 16 | - name: Upload app artifacts 17 | uses: actions/upload-artifact@v4 18 | with: 19 | name: ${{ github.event.repository.name }}-${{ steps.build-app.outputs.suffix }} 20 | path: ${{ steps.build-app.outputs.fap-artifacts }} 21 | # You can remove this step if you don't want to check source code formatting 22 | - name: Lint sources 23 | uses: flipperdevices/flipperzero-ufbt-action@v0.1 24 | with: 25 | # skip SDK setup, we already did it in previous step 26 | skip-setup: true 27 | task: lint -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Object files 5 | *.o 6 | *.ko 7 | *.obj 8 | *.elf 9 | 10 | # Linker output 11 | *.ilk 12 | *.map 13 | *.exp 14 | 15 | # Precompiled Headers 16 | *.gch 17 | *.pch 18 | 19 | # Libraries 20 | *.lib 21 | *.a 22 | *.la 23 | *.lo 24 | 25 | # Shared objects (inc. Windows DLLs) 26 | *.dll 27 | *.so 28 | *.so.* 29 | *.dylib 30 | 31 | # Executables 32 | *.exe 33 | *.out 34 | *.app 35 | *.i*86 36 | *.x86_64 37 | *.hex 38 | 39 | # Debug files 40 | *.dSYM/ 41 | *.su 42 | *.idb 43 | *.pdb 44 | 45 | # Kernel Module Compile Results 46 | *.mod* 47 | *.cmd 48 | .tmp_versions/ 49 | modules.order 50 | Module.symvers 51 | Mkfile.old 52 | dkms.conf 53 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Programmer Calculator 2 | 3 | This repository contains a calculator application designed to run on Flipper Zero. 4 | 5 | 6 | 7 | 8 |

9 | 10 |

11 | 12 | ## Features ✨ 13 | 14 | - `Decimal to Binary` 15 | - `Decimal to Hexadecimal` 16 | - `Decimal to Charachter` 17 | - `Hexadecimal to Binary` 18 | - `Hexadecimal to Decimal` 19 | - `Binary to Decimal` 20 | - `Binary to Hexadecimal` 21 | 22 | ## Getting Started 🚀 23 | 24 | To get started with this calculator program, clone the repository and compile the source files. 25 | 26 | ```bash 27 | # clone `RogueMaster Firmware` or `Xtreme-Firmware` or `flipperzero-firmware` repository: 28 | git clone --recursive https://github.com/RogueMaster/flipperzero-firmware-wPlugins.git 29 | cd flipperzero-firmware-wPlugins/ 30 | --or-- 31 | git clone --recursive --jobs 8 https://github.com/Flipper-XFW/Xtreme-Firmware.git 32 | cd Xtreme-Firmware/ 33 | --or-- 34 | git clone https://github.com/flipperdevices/flipperzero-firmware.git 35 | cd flipperzero-firmware/ 36 | 37 | # flash firmware directly to the Flipper 38 | # (Needs to be connected via USB, qFlipper closed) 39 | ./fbt flash_usb_full 40 | 41 | # clone this repository (Calculator) 42 | # move all files to `applications_user` directory 43 | cd applications_user/ 44 | git clone https://github.com/armixz/Flipper-Zero-Programmer-Calculator.git 45 | 46 | # build and launch the app 47 | cd ~/path/to/root-directory eg. ~/Xtreme-Firmware 48 | ./fbt launch APPSRC=programmercalc 49 | ``` 50 | 51 | ## Usage 💡 52 | 53 | - The FAP application is available in [flipc.org](https://flipc.org/armixz/Flipper-Zero-Programmer-Calculator). 54 | - Use the keypad to input numbers. 55 | - Toggle between different modes using MODE key. 56 | - View results on the display. 57 | 58 | ## Contributing 🤝 59 | 60 | Contributions to improve the calculator program are welcome. Please feel free to fork the repository and submit a pull request. 61 | 62 | 1. Fork the Project 63 | 2. Create your Feature Branch (`git checkout -b feature/AmazingFeature`) 64 | 3. Commit your Changes (`git commit -m 'Add some AmazingFeature'`) 65 | 4. Push to the Branch (`git push origin feature/AmazingFeature`) 66 | 5. Open a Pull Request 67 | 68 | ## Issues 🐛 69 | 70 | If you find any bugs or issues, please create a new issue in the [issues section]() of the repository. Be sure to include detailed information and steps to reproduce the issue. 71 | 72 | ## License 📄 73 | 74 | Distributed under the GPL-3.0 License. See `LICENSE` for more information. 75 | 76 | ## Acknowledgements 🎉 77 | 78 | - Huge thanks to [Flipper-XFW](https://github.com/Flipper-XFW/Xtreme-Apps/tree/dev/calculator) - [@n-o-T-I-n-s-a-n-e](https://github.com/n-o-T-I-n-s-a-n-e) for being the inspiration and idea behind starting this project. 79 | - This project uses libraries and tools from the Flipper Universal Registry Implementation (FURI), including Furi, Furi HAL, and GUI. 80 | -------------------------------------------------------------------------------- /application.fam: -------------------------------------------------------------------------------- 1 | App( 2 | appid="programmercalc", 3 | name="Programmer Calculator", 4 | apptype=FlipperAppType.EXTERNAL, 5 | entry_point="calculator_app", 6 | cdefines=["APP_CALCULATOR"], 7 | requires=["gui"], 8 | stack_size=1 * 1024, 9 | order=45, 10 | fap_icon="calcIcon.png", 11 | fap_category="Tools", 12 | fap_author="@armixz", 13 | fap_weburl="https://github.com/armixz/Flipper-Zero-Programmer-Calculator", 14 | fap_version="0.9.2", 15 | fap_description="Calculator, for Programmers!", 16 | ) 17 | -------------------------------------------------------------------------------- /calcIcon.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/calcIcon.png -------------------------------------------------------------------------------- /calculation_logic.c: -------------------------------------------------------------------------------- 1 | #include "calculation_logic.h" 2 | #include 3 | #include 4 | #include 5 | #include "calculator.h" 6 | 7 | // global constant lookup table 8 | static const char* HEX_TO_BINARY_TABLE[16] = { 9 | "0000", 10 | "0001", 11 | "0010", 12 | "0011", 13 | "0100", 14 | "0101", 15 | "0110", 16 | "0111", 17 | "1000", 18 | "1001", 19 | "1010", 20 | "1011", 21 | "1100", 22 | "1101", 23 | "1110", 24 | "1111"}; 25 | 26 | bool decToBin(const char* decString, char* decToBinResult, size_t resultSize) { 27 | if(decString == NULL || decToBinResult == NULL || resultSize < 2) { 28 | return false; // INVALID pointers or insufficient result size 29 | } 30 | 31 | char* end; 32 | unsigned long long num = strtoull(decString, &end, 10); 33 | 34 | if(*end != '\0' || *decString == '\0') { 35 | return false; // INVALID decimal 36 | } 37 | 38 | // Calculate the number of bits 39 | size_t bitsNeeded = 0; 40 | unsigned long long tempNum = num; 41 | while(tempNum > 0) { 42 | bitsNeeded++; 43 | tempNum >>= 1; 44 | } 45 | 46 | // If the number is zero 47 | if(num == 0) { 48 | if(resultSize < 2) { 49 | return false; // buffer 50 | } 51 | strcpy(decToBinResult, "0"); 52 | return true; 53 | } 54 | 55 | // check buffer 56 | if(bitsNeeded >= resultSize) { 57 | return false; 58 | } 59 | 60 | decToBinResult[bitsNeeded] = '\0'; // Null-terminate the result 61 | 62 | // fill the binary string from the end 63 | for(int i = bitsNeeded - 1; i >= 0; i--) { 64 | decToBinResult[i] = (num & 1) + '0'; // the least significant bit 65 | num >>= 1; 66 | } 67 | 68 | return true; 69 | } 70 | 71 | bool decToHex(const char* decString, char* decToHexResult, size_t resultSize) { 72 | if(decString == NULL || decToHexResult == NULL || resultSize == 0) { 73 | return false; 74 | } 75 | 76 | char* end; 77 | unsigned long long num = strtoull(decString, &end, 10); 78 | 79 | if(*end != '\0' || *decString == '\0') { 80 | return false; 81 | } 82 | 83 | // buffer size 84 | size_t requiredSize = 1; 85 | unsigned long long tempNum = num; 86 | 87 | while(tempNum >= 16) { 88 | requiredSize++; 89 | tempNum /= 16; 90 | } 91 | 92 | if(requiredSize + 1 > resultSize) { 93 | return false; 94 | } 95 | 96 | decToHexResult[requiredSize] = '\0'; 97 | 98 | // convert to hexadecimal in reverse order 99 | do { 100 | int remainder = num % 16; 101 | decToHexResult[--requiredSize] = (remainder < 10) ? ('0' + remainder) : 102 | ('A' + (remainder - 10)); 103 | num /= 16; 104 | } while(num > 0); 105 | 106 | return true; 107 | } 108 | 109 | bool decToChar(const char* decString, char* decToCharResult) { 110 | if(decString == NULL || decToCharResult == NULL || *decString == '\0') { 111 | return false; 112 | } 113 | 114 | char* end; 115 | unsigned long long num = strtoull(decString, &end, 10); 116 | 117 | if(*end != '\0' || num > 255) { 118 | return false; 119 | } 120 | 121 | *decToCharResult = (char)num; 122 | return true; 123 | } 124 | 125 | bool hexDigitToBinary(char hexDigit, char* binary) { 126 | const char* hexToBinary = NULL; 127 | 128 | if(hexDigit >= '0' && hexDigit <= '9') { 129 | hexToBinary = HEX_TO_BINARY_TABLE[hexDigit - '0']; 130 | } else if(hexDigit >= 'A' && hexDigit <= 'F') { 131 | hexToBinary = HEX_TO_BINARY_TABLE[10 + hexDigit - 'A']; 132 | } else if(hexDigit >= 'a' && hexDigit <= 'f') { 133 | hexToBinary = HEX_TO_BINARY_TABLE[10 + hexDigit - 'a']; 134 | } 135 | 136 | if(hexToBinary) { 137 | memcpy(binary, hexToBinary, 5); 138 | return true; 139 | } else { 140 | return false; 141 | } 142 | } 143 | 144 | bool hexToBin(const char* hexString, char* hexToBinResult, size_t resultSize) { 145 | if(hexString == NULL || hexToBinResult == NULL || resultSize == 0) { 146 | return false; 147 | } 148 | 149 | size_t requiredSize = strlen(hexString) * 4 + 1; 150 | if(requiredSize > resultSize) { 151 | return false; 152 | } 153 | 154 | while(*hexString) { 155 | const char* hexToBinary; 156 | if(*hexString >= '0' && *hexString <= '9') { 157 | hexToBinary = HEX_TO_BINARY_TABLE[*hexString - '0']; 158 | } else if(*hexString >= 'A' && *hexString <= 'F') { 159 | hexToBinary = HEX_TO_BINARY_TABLE[10 + *hexString - 'A']; 160 | } else if(*hexString >= 'a' && *hexString <= 'f') { 161 | hexToBinary = HEX_TO_BINARY_TABLE[10 + *hexString - 'a']; 162 | } else { 163 | return false; 164 | } 165 | 166 | if(resultSize < 4) { 167 | return false; 168 | } 169 | memcpy(hexToBinResult, hexToBinary, 4); 170 | hexToBinResult += 4; 171 | hexString++; 172 | resultSize -= 4; 173 | } 174 | 175 | *hexToBinResult = '\0'; 176 | return true; 177 | } 178 | 179 | bool hexToDec(const char* hexString, unsigned long long* hexToDecResult) { 180 | if(hexString == NULL || hexToDecResult == NULL) { 181 | return false; 182 | } 183 | 184 | *hexToDecResult = 0; 185 | while(*hexString) { 186 | char digit = *hexString; 187 | unsigned int value; 188 | 189 | if(digit >= '0' && digit <= '9') { 190 | value = digit - '0'; 191 | } else if(digit >= 'A' && digit <= 'F') { 192 | value = digit - 'A' + 10; 193 | } else if(digit >= 'a' && digit <= 'f') { 194 | value = digit - 'a' + 10; 195 | } else { 196 | return false; 197 | } 198 | 199 | if(*hexToDecResult > ULLONG_MAX / 16) { 200 | return false; // check overflow 201 | } 202 | 203 | *hexToDecResult = *hexToDecResult * 16 + value; 204 | hexString++; 205 | } 206 | 207 | return true; 208 | } 209 | 210 | bool binToDec(const char* binaryString, unsigned long long* binToDecResult) { 211 | if(binaryString == NULL || binToDecResult == NULL) { 212 | return false; 213 | } 214 | 215 | *binToDecResult = 0; 216 | for(const char* p = binaryString; *p; ++p) { 217 | if(*p != '0' && *p != '1') { 218 | return false; 219 | } 220 | if(*binToDecResult > ULLONG_MAX / 2) { 221 | return false; // check overflow 222 | } 223 | *binToDecResult = (*binToDecResult << 1) | (*p - '0'); 224 | } 225 | 226 | return true; 227 | } 228 | 229 | char binaryToHexDigit(const char* bin) { 230 | int value = 0; 231 | for(int i = 0; i < 4; ++i) { 232 | value = (value << 1) | (bin[i] - '0'); 233 | } 234 | 235 | return (value < 10) ? ('0' + value) : ('A' + (value - 10)); 236 | } 237 | 238 | bool binToHex(const char* binaryString, char* binToHexResult, size_t resultSize) { 239 | if(binaryString == NULL || binToHexResult == NULL || resultSize == 0) { 240 | return false; 241 | } 242 | 243 | size_t binLength = strlen(binaryString); 244 | 245 | for(size_t i = 0; i < binLength; ++i) { 246 | if(binaryString[i] != '0' && binaryString[i] != '1') { 247 | snprintf(binToHexResult, resultSize, "INVALID Binary"); 248 | return false; 249 | } 250 | } 251 | 252 | // padding zeros - len multiple of 4 253 | size_t paddingZeros = (4 - (binLength % 4)) % 4; 254 | size_t totalChunks = (binLength + paddingZeros) / 4; 255 | 256 | if(totalChunks > resultSize - 1) { 257 | return false; 258 | } 259 | 260 | size_t hexIndex = 0; 261 | char tempBin[5] = "0000"; 262 | size_t tempIndex = 0; 263 | 264 | for(size_t i = 0; i < binLength + paddingZeros; ++i) { 265 | if(i < paddingZeros) { 266 | tempBin[tempIndex++] = '0'; 267 | } else { 268 | tempBin[tempIndex++] = binaryString[i - paddingZeros]; 269 | } 270 | 271 | if(tempIndex == 4) { 272 | binToHexResult[hexIndex++] = binaryToHexDigit(tempBin); 273 | tempIndex = 0; 274 | } 275 | } 276 | 277 | binToHexResult[hexIndex] = '\0'; 278 | return true; 279 | } 280 | 281 | void calculate(Calculator* calculator_state) { 282 | if(calculator_state == NULL) { 283 | return; 284 | } 285 | 286 | unsigned long long num = 0; 287 | char result = '\0'; 288 | unsigned long long hexToDecResult = 0; 289 | 290 | switch(calculator_state->mode) { 291 | case ModeDecToBin: 292 | if(!decToBin( 293 | calculator_state->text, 294 | calculator_state->decToBinResult, 295 | sizeof(calculator_state->decToBinResult))) { 296 | snprintf( 297 | calculator_state->decToBinResult, 298 | sizeof(calculator_state->decToBinResult), 299 | "Error ---------Input: 2^35 - 1"); 300 | } 301 | break; 302 | 303 | case ModeDecToHex: 304 | if(!decToHex( 305 | calculator_state->text, 306 | calculator_state->decToHexResult, 307 | sizeof(calculator_state->decToHexResult))) { 308 | snprintf( 309 | calculator_state->decToHexResult, 310 | sizeof(calculator_state->decToHexResult), 311 | "Error ---------Input: 2^64 - 1"); 312 | } 313 | break; 314 | 315 | case ModeDecToChar: 316 | if(decToChar(calculator_state->text, &result)) { 317 | calculator_state->decToCharResult[0] = result; 318 | calculator_state->decToCharResult[1] = '\0'; 319 | } else { 320 | snprintf( 321 | calculator_state->decToCharResult, 322 | sizeof(calculator_state->decToCharResult), 323 | "Error ---------Input: 0 - 255"); 324 | } 325 | break; 326 | 327 | case ModeHexToBin: 328 | if(!hexToBin( 329 | calculator_state->text, 330 | calculator_state->hexToBinResult, 331 | sizeof(calculator_state->hexToBinResult))) { 332 | snprintf( 333 | calculator_state->hexToBinResult, 334 | sizeof(calculator_state->hexToBinResult), 335 | "Error ---------Input: 64-bit"); 336 | } 337 | break; 338 | 339 | case ModeHexToDec: 340 | if(hexToDec(calculator_state->text, &hexToDecResult)) { 341 | snprintf( 342 | calculator_state->hexToDecResult, 343 | sizeof(calculator_state->hexToDecResult), 344 | "%llu", 345 | hexToDecResult); 346 | } else { 347 | snprintf( 348 | calculator_state->hexToDecResult, 349 | sizeof(calculator_state->hexToDecResult), 350 | "Error ---------Input: 2^64 - 1"); 351 | } 352 | break; 353 | 354 | case ModeBinToDec: 355 | if(binToDec(calculator_state->text, &num)) { 356 | snprintf( 357 | calculator_state->binToDecResult, 358 | sizeof(calculator_state->binToDecResult), 359 | "%llu", 360 | num); 361 | } else { 362 | snprintf( 363 | calculator_state->binToDecResult, 364 | sizeof(calculator_state->binToDecResult), 365 | "Error ---------Input: 2^64 - 1"); 366 | } 367 | break; 368 | 369 | case ModeBinToHex: 370 | if(!binToHex( 371 | calculator_state->text, 372 | calculator_state->binToHexResult, 373 | sizeof(calculator_state->binToHexResult))) { 374 | snprintf( 375 | calculator_state->binToHexResult, 376 | sizeof(calculator_state->binToHexResult), 377 | "Error ---------Input: 64-bit"); 378 | } 379 | break; 380 | 381 | default: 382 | break; 383 | } 384 | } 385 | -------------------------------------------------------------------------------- /calculation_logic.h: -------------------------------------------------------------------------------- 1 | #ifndef CALCULATION_LOGIC_H 2 | #define CALCULATION_LOGIC_H 3 | 4 | #include "calculator_state.h" 5 | 6 | bool decToBin(const char* decString, char* decToBinResult, size_t resultSize); 7 | bool decToHex(const char* decString, char* decToHexResult, size_t resultSize); 8 | bool decToChar(const char* decString, char* outChar); 9 | bool hexToBin(const char* hexString, char* binaryResult, size_t resultSize); 10 | bool hexToDec(const char* hexString, unsigned long long* outNum); 11 | bool binToDec(const char* binaryString, unsigned long long* decResult); 12 | bool binToHex(const char* binaryString, char* hexResult, size_t resultSize); 13 | void calculate(Calculator* calculator_state); 14 | 15 | #endif // CALCULATION_LOGIC_H 16 | -------------------------------------------------------------------------------- /calculator.c: -------------------------------------------------------------------------------- 1 | #include "calculator.h" 2 | 3 | int32_t calculator_app(void* p) { 4 | UNUSED(p); 5 | FuriMessageQueue* event_queue = initialize_event_queue(); 6 | Calculator* calculator_state = initialize_calculator_state(); 7 | if(!calculator_state) return -1; 8 | 9 | ViewPort* view_port = initialize_view_port(calculator_state, event_queue); 10 | Gui* gui = initialize_gui(view_port); 11 | 12 | InputEvent event; 13 | while(furi_message_queue_get(event_queue, &event, FuriWaitForever) == FuriStatusOk) { 14 | if(event.type == InputTypeShort && event.key == InputKeyBack) { 15 | break; 16 | } 17 | handle_event(calculator_state, view_port, &event); 18 | } 19 | 20 | cleanup_resources(calculator_state, view_port, gui, event_queue); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /calculator.h: -------------------------------------------------------------------------------- 1 | #ifndef CALCULATOR_H 2 | #define CALCULATOR_H 3 | 4 | #include "calculator_state.h" 5 | #include "input_handling.h" 6 | #include "calculation_logic.h" 7 | #include "ui_drawing.h" 8 | #include "utilities.h" 9 | #include "init_cleanup.h" 10 | 11 | #endif // CALCULATOR_H 12 | -------------------------------------------------------------------------------- /calculator_state.c: -------------------------------------------------------------------------------- 1 | #include "calculator_state.h" 2 | #include "calculator.h" 3 | 4 | void toggle_mode(Calculator* calculator_state) { 5 | switch(calculator_state->mode) { 6 | case ModeDecToBin: 7 | calculator_state->mode = ModeDecToHex; 8 | break; 9 | case ModeDecToHex: 10 | calculator_state->mode = ModeDecToChar; 11 | break; 12 | case ModeDecToChar: 13 | calculator_state->mode = ModeHexToBin; 14 | break; 15 | case ModeHexToBin: 16 | calculator_state->mode = ModeHexToDec; 17 | break; 18 | case ModeHexToDec: 19 | calculator_state->mode = ModeBinToDec; 20 | break; 21 | case ModeBinToDec: 22 | calculator_state->mode = ModeBinToHex; 23 | break; 24 | case ModeBinToHex: 25 | calculator_state->mode = ModeDecToBin; 26 | break; 27 | default: 28 | calculator_state->mode = ModeDecToBin; 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /calculator_state.h: -------------------------------------------------------------------------------- 1 | #ifndef CALCULATOR_STATE_H 2 | #define CALCULATOR_STATE_H 3 | 4 | #include 5 | #include 6 | 7 | #define MAX_TEXT_LENGTH_INPUT 17 8 | #define MAX_TEXT_LENGTH_RESULT 36 9 | 10 | typedef enum { 11 | ModeNone, 12 | ModeDecToBin, 13 | ModeDecToHex, 14 | ModeDecToChar, 15 | ModeHexToBin, 16 | ModeHexToDec, 17 | ModeBinToDec, 18 | ModeBinToHex 19 | } CalculatorMode; 20 | 21 | typedef struct { 22 | short x; 23 | short y; 24 | } selectedPosition; 25 | 26 | typedef struct { 27 | FuriMutex* mutex; 28 | selectedPosition position; 29 | char text[MAX_TEXT_LENGTH_INPUT]; 30 | char originalInput[MAX_TEXT_LENGTH_INPUT]; 31 | char decToBinResult[MAX_TEXT_LENGTH_RESULT]; 32 | char decToHexResult[MAX_TEXT_LENGTH_RESULT]; 33 | char decToCharResult[MAX_TEXT_LENGTH_RESULT]; 34 | char hexToBinResult[MAX_TEXT_LENGTH_RESULT]; 35 | char hexToDecResult[MAX_TEXT_LENGTH_RESULT]; 36 | char binToDecResult[MAX_TEXT_LENGTH_RESULT]; 37 | char binToHexResult[MAX_TEXT_LENGTH_RESULT]; 38 | short textLength; 39 | char log[MAX_TEXT_LENGTH_RESULT]; 40 | bool newInputStarted; 41 | CalculatorMode mode; 42 | } Calculator; 43 | 44 | void toggle_mode(Calculator* calculator_state); 45 | 46 | #endif // CALCULATOR_STATE_H 47 | -------------------------------------------------------------------------------- /docs/README_catalog.md: -------------------------------------------------------------------------------- 1 | # Programmer Calculator 2 | 3 | ## Introduction 4 | A Calculator for Programmers! 5 | 6 | 7 | ## Basic Controls 8 | 9 | - "**<**" (Backspace) : Press the < button to delete the last digit from the input field. This can be used to correct mistakes or modify your input before conversion. 10 | - "**=**" (Convert): Press the = button to convert the input digits according to the selected mode. Ensure your input is within the mode's threshold for a successful conversion. 11 | - "**CLR**" (Clear): Use the CLR button to clear both the input and output fields, resetting them for a new conversion. 12 | 13 | ## Selecting Modes 14 | 15 | Press "**M**" to cycle through and select the conversion mode you need. 16 | - Each mode has its specific use and threshold limits: 17 | 18 | 19 | | Conversion Mode | Description | Threshold | 20 | |-----------------------|--------------------------|-----------------------| 21 | | **dec >> bin** | Decimal to Binary | up to \(2^35 - 1\) | 22 | | **dec >> hex** | Decimal to Hexadecimal | up to \(2^64 - 1\) | 23 | | **dec >> char** | Decimal to Character | 0 – 255 | 24 | | **hex >> bin** | Hexadecimal to Binary | up to 64-bit inputs | 25 | | **hex >> dec** | Hexadecimal to Decimal | up to \(2^64 - 1\) | 26 | | **bin >> dec** | Binary to Decimal | up to \(2^64 - 1\) | 27 | | **bin >> hex** | Binary to Hexadecimal | up to 64-bit inputs | 28 | 29 | 30 | ## Confirming Selections 31 | "**OK**": After choosing your desired mode with "**M**", press the OK button to confirm your selection and proceed with the conversion. 32 | 33 | ## TODO 34 | - Refactor Code 35 | - Memory Management 36 | - Optimize Conversions 37 | - Add more Conversions 38 | - Documentation -------------------------------------------------------------------------------- /docs/changelog.md: -------------------------------------------------------------------------------- 1 | # Changelog - Patch Notes 2 | 3 | ## Version 0.9.2 4 | - Enhanced the Hexadecimal to Decimal conversion function for increased accuracy and efficiency. 5 | - Addressed and resolved various bugs to improve stability and functionality. 6 | - Add a secret! 7 | 8 | ## Version 0.9.1 9 | - Improved output format for better readability and user experience. 10 | - Increased buffer size to enhance performance and accommodate larger data sets. 11 | 12 | ## Version 0.9 13 | Initial release -------------------------------------------------------------------------------- /img/1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/1.png -------------------------------------------------------------------------------- /img/2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/2.png -------------------------------------------------------------------------------- /img/3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/3.png -------------------------------------------------------------------------------- /img/4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/4.png -------------------------------------------------------------------------------- /img/5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/5.png -------------------------------------------------------------------------------- /img/6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/6.png -------------------------------------------------------------------------------- /img/7.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/7.png -------------------------------------------------------------------------------- /img/8.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/armixz/Flipper-Zero-Programmer-Calculator/335120bb77377812e92161903624e37097c8bdaf/img/8.png -------------------------------------------------------------------------------- /init_cleanup.c: -------------------------------------------------------------------------------- 1 | #include "init_cleanup.h" 2 | #include "ui_drawing.h" 3 | #include "input_handling.h" 4 | #include 5 | #include 6 | #include "calculator.h" 7 | 8 | FuriMessageQueue* initialize_event_queue() { 9 | return furi_message_queue_alloc(8, sizeof(InputEvent)); 10 | } 11 | 12 | Calculator* initialize_calculator_state() { 13 | Calculator* state = malloc(sizeof(Calculator)); 14 | state->mutex = furi_mutex_alloc(FuriMutexTypeNormal); 15 | if(!state->mutex) { 16 | free(state); 17 | return NULL; 18 | } 19 | return state; 20 | } 21 | 22 | ViewPort* initialize_view_port(Calculator* calculator_state, FuriMessageQueue* event_queue) { 23 | ViewPort* view_port = view_port_alloc(); 24 | view_port_draw_callback_set(view_port, calculator_draw_callback, calculator_state); 25 | view_port_input_callback_set(view_port, calculator_input_callback, event_queue); 26 | view_port_set_orientation(view_port, ViewPortOrientationVertical); 27 | return view_port; 28 | } 29 | 30 | Gui* initialize_gui(ViewPort* view_port) { 31 | Gui* gui = furi_record_open(RECORD_GUI); 32 | gui_add_view_port(gui, view_port, GuiLayerFullscreen); 33 | return gui; 34 | } 35 | 36 | void cleanup_resources( 37 | Calculator* calculator_state, 38 | ViewPort* view_port, 39 | Gui* gui, 40 | FuriMessageQueue* event_queue) { 41 | gui_remove_view_port(gui, view_port); 42 | view_port_free(view_port); 43 | furi_mutex_free(calculator_state->mutex); 44 | furi_message_queue_free(event_queue); 45 | furi_record_close(RECORD_NOTIFICATION); 46 | furi_record_close(RECORD_GUI); 47 | free(calculator_state); 48 | } 49 | -------------------------------------------------------------------------------- /init_cleanup.h: -------------------------------------------------------------------------------- 1 | #ifndef INIT_CLEANUP_H 2 | #define INIT_CLEANUP_H 3 | 4 | #include "calculator_state.h" 5 | #include 6 | #include 7 | 8 | FuriMessageQueue* initialize_event_queue(); 9 | Calculator* initialize_calculator_state(); 10 | ViewPort* initialize_view_port(Calculator* calculator_state, FuriMessageQueue* event_queue); 11 | Gui* initialize_gui(ViewPort* view_port); 12 | void cleanup_resources( 13 | Calculator* calculator_state, 14 | ViewPort* view_port, 15 | Gui* gui, 16 | FuriMessageQueue* event_queue); 17 | 18 | #endif // INIT_CLEANUP_H 19 | -------------------------------------------------------------------------------- /input_handling.c: -------------------------------------------------------------------------------- 1 | #include "input_handling.h" 2 | #include "calculator_state.h" 3 | #include "calculator.h" 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | 15 | void calculator_input_callback(InputEvent* input_event, void* ctx) { 16 | furi_assert(ctx); 17 | FuriMessageQueue* event_queue = ctx; 18 | furi_message_queue_put(event_queue, input_event, FuriWaitForever); 19 | } 20 | 21 | void handle_short_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event) { 22 | switch(event->key) { 23 | case InputKeyUp: 24 | if(calculator_state->position.y > 0) { 25 | if(calculator_state->position.y == 1) { 26 | calculator_state->position.x = 0; 27 | } 28 | calculator_state->position.y--; 29 | // if(calculator_state->position.y == 1) { // If cursor moves to row 2, skip it 30 | // calculator_state->position.y--; 31 | // } 32 | } 33 | break; 34 | case InputKeyDown: 35 | if(calculator_state->position.y < 5 - 1) { 36 | if(calculator_state->position.y == 5 - 2 && 37 | (calculator_state->position.x == 3 || calculator_state->position.x == 4)) { 38 | calculator_state->position.y = 5 - 1; 39 | calculator_state->position.x = 3; 40 | } else { 41 | calculator_state->position.y++; 42 | } 43 | // if(calculator_state->position.y == 1) { // If cursor moves to row 2, skip it 44 | // calculator_state->position.y++; 45 | // } 46 | } 47 | break; 48 | case InputKeyLeft: 49 | if(calculator_state->position.y > 0 && calculator_state->position.x > 0) { 50 | calculator_state->position.x--; 51 | } 52 | break; 53 | case InputKeyRight: 54 | if(calculator_state->position.y < 1) { 55 | // Cursor stays in the same column 56 | } else if(calculator_state->position.y == 5 - 1) { 57 | if(calculator_state->position.x < 3) { 58 | calculator_state->position.x++; 59 | } 60 | } else { 61 | if(calculator_state->position.x < 5 - 1) { 62 | calculator_state->position.x++; 63 | } 64 | } 65 | break; 66 | case InputKeyOk: 67 | if(calculator_state->position.y == 0) { 68 | toggle_mode(calculator_state); 69 | } else { 70 | char key = 71 | getKeyAtPosition(calculator_state->position.x, calculator_state->position.y); 72 | handle_key_press(calculator_state, key); 73 | } 74 | break; 75 | 76 | default: 77 | break; 78 | } 79 | 80 | view_port_update(view_port); 81 | } 82 | 83 | void handle_long_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event) { 84 | // Handling a long press event 85 | switch(event->key) { 86 | case InputKeyOk: { 87 | const char* inputMessage = " github armixz"; 88 | strncpy(calculator_state->text, inputMessage, MAX_TEXT_LENGTH_INPUT - 1); 89 | calculator_state->text[MAX_TEXT_LENGTH_INPUT - 1] = '\0'; 90 | calculator_state->textLength = strlen(calculator_state->text); 91 | calculator_state->newInputStarted = true; 92 | view_port_update(view_port); 93 | } break; 94 | 95 | default: 96 | break; 97 | } 98 | } 99 | 100 | void handle_key_press(Calculator* calculator_state, char key) { 101 | switch(key) { 102 | case '=': 103 | // Logic for '=' key 104 | strncpy(calculator_state->originalInput, calculator_state->text, MAX_TEXT_LENGTH_INPUT); 105 | calculate(calculator_state); 106 | // calculator_state->text[0] = '\0'; 107 | calculator_state->textLength = 0; 108 | break; 109 | case 'R': 110 | // Logic for 'R' key, typically 'Clear' 111 | calculator_state->text[0] = '\0'; 112 | calculator_state->textLength = 0; 113 | calculator_state->decToBinResult[0] = '\0'; 114 | calculator_state->decToHexResult[0] = '\0'; 115 | calculator_state->decToCharResult[0] = '\0'; 116 | calculator_state->hexToBinResult[0] = '\0'; 117 | calculator_state->hexToDecResult[0] = '\0'; 118 | calculator_state->binToDecResult[0] = '\0'; 119 | calculator_state->binToHexResult[0] = '\0'; 120 | calculator_state->newInputStarted = false; 121 | break; 122 | case '<': 123 | // Logic for '<' key, typically 'Backspace' 124 | if(calculator_state->textLength > 0) { 125 | calculator_state->text[--calculator_state->textLength] = '\0'; 126 | } 127 | calculator_state->newInputStarted = false; 128 | break; 129 | default: 130 | // Default logic for number and operator keys 131 | if(calculator_state->newInputStarted) { 132 | // Reset the text for a fresh input if new input has started 133 | calculator_state->text[0] = '\0'; 134 | calculator_state->textLength = 0; 135 | calculator_state->newInputStarted = false; 136 | } 137 | // Add the new character to the text, respecting the maximum text length 138 | if(calculator_state->textLength < MAX_TEXT_LENGTH_INPUT - 1) { 139 | calculator_state->text[calculator_state->textLength++] = key; 140 | calculator_state->text[calculator_state->textLength] = '\0'; 141 | } 142 | break; 143 | } 144 | } 145 | 146 | void handle_event(Calculator* calculator_state, ViewPort* view_port, InputEvent* event) { 147 | if(event->type == InputTypeShort) { 148 | handle_short_press(calculator_state, view_port, event); 149 | } else if(event->type == InputTypeLong) { 150 | handle_long_press(calculator_state, view_port, event); 151 | } 152 | view_port_update(view_port); 153 | } 154 | -------------------------------------------------------------------------------- /input_handling.h: -------------------------------------------------------------------------------- 1 | #ifndef INPUT_HANDLING_H 2 | #define INPUT_HANDLING_H 3 | 4 | #include "calculator_state.h" 5 | #include 6 | #include 7 | #include 8 | 9 | void calculator_input_callback(InputEvent* input_event, void* ctx); 10 | void handle_short_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event); 11 | void handle_long_press(Calculator* calculator_state, ViewPort* view_port, InputEvent* event); 12 | void handle_key_press(Calculator* calculator_state, char key); 13 | void handle_event(Calculator* calculator_state, ViewPort* view_port, InputEvent* event); 14 | 15 | #endif // INPUT_HANDLING_H 16 | -------------------------------------------------------------------------------- /ui_drawing.c: -------------------------------------------------------------------------------- 1 | #include "ui_drawing.h" 2 | #include 3 | #include "utilities.h" 4 | #include "calculator.h" 5 | 6 | void drawElement(Canvas* canvas, const char* str, int x, int y, int width, int height, Font font) { 7 | if(str) { 8 | canvas_set_font(canvas, font); 9 | canvas_draw_str(canvas, x, y, str); 10 | } else { 11 | canvas_draw_box(canvas, x, y, width, height); 12 | } 13 | } 14 | 15 | void generate_calculator_layout(Canvas* canvas) { 16 | // display 17 | canvas_draw_frame(canvas, 0, 0, 64, 62); // display frame 18 | canvas_draw_frame(canvas, 2, 2, 60, 38); // output frame 19 | canvas_draw_frame(canvas, 2, 41, 60, 19); // input frame 20 | 21 | // Horizonal and Vertical lines 22 | // drawElement(canvas, NULL, 0, 48, 64, 2, 0); // H line 1 23 | drawElement(canvas, NULL, 0, 61, 64, 2, 0); // H line 2 24 | drawElement(canvas, NULL, 0, 73, 64, 2, 0); // H line 3 25 | drawElement(canvas, NULL, 0, 87, 64, 1, 0); // H line 4 26 | drawElement(canvas, NULL, 0, 100, 64, 1, 0); // H line 5 27 | drawElement(canvas, NULL, 0, 113, 64, 1, 0); // H line 6 28 | drawElement(canvas, NULL, 0, 126, 64, 2, 0); // H line 7 29 | 30 | drawElement(canvas, NULL, 0, 61, 2, 65, 0); // V line 1 31 | drawElement(canvas, NULL, 13, 61, 1, 65, 0); // V line 2 32 | drawElement(canvas, NULL, 25, 73, 1, 55, 0); // V line 3 33 | drawElement(canvas, NULL, 37, 73, 2, 55, 0); // V line 4 34 | drawElement(canvas, NULL, 50, 73, 1, 41, 0); // V line 5 35 | drawElement(canvas, NULL, 62, 61, 2, 65, 0); // V line 6 36 | 37 | // MODE key and display 38 | // row 1 39 | drawElement(canvas, "M", 4, 72, 0, 0, FontSecondary); 40 | 41 | // Keys 42 | // row 2 43 | drawElement(canvas, "7", 5, 85, 0, 0, FontSecondary); 44 | drawElement(canvas, "8", 17, 85, 0, 0, FontSecondary); 45 | drawElement(canvas, "9", 29, 85, 0, 0, FontSecondary); 46 | drawElement(canvas, "A", 42, 85, 0, 0, FontSecondary); 47 | drawElement(canvas, "B", 54, 85, 0, 0, FontSecondary); 48 | // row 3 49 | drawElement(canvas, "4", 5, 98, 0, 0, FontSecondary); 50 | drawElement(canvas, "5", 17, 98, 0, 0, FontSecondary); 51 | drawElement(canvas, "6", 29, 98, 0, 0, FontSecondary); 52 | drawElement(canvas, "C", 42, 98, 0, 0, FontSecondary); 53 | drawElement(canvas, "D", 54, 98, 0, 0, FontSecondary); 54 | // row 4 55 | drawElement(canvas, "1", 6, 111, 0, 0, FontSecondary); 56 | drawElement(canvas, "2", 17, 111, 0, 0, FontSecondary); 57 | drawElement(canvas, "3", 29, 111, 0, 0, FontSecondary); 58 | drawElement(canvas, "E", 42, 111, 0, 0, FontSecondary); 59 | drawElement(canvas, "F", 54, 111, 0, 0, FontSecondary); 60 | // row 5 61 | drawElement(canvas, "<", 6, 124, 0, 0, FontSecondary); 62 | drawElement(canvas, "0", 17, 124, 0, 0, FontSecondary); 63 | drawElement(canvas, "=", 29, 124, 0, 0, FontSecondary); 64 | drawElement(canvas, "CLR", 42, 124, 0, 0, FontSecondary); 65 | } 66 | 67 | // highlighting when cursor moves 68 | void draw_highlighted_cell(Canvas* canvas, short x, short y, short width, short height) { 69 | canvas_set_color(canvas, ColorBlack); 70 | canvas_draw_box(canvas, x, y, width, height); 71 | } 72 | 73 | void displayInput(Canvas* canvas, const char* input, int x, int startY) { 74 | const int maxWidth = 56; // Maximum width for each line 75 | const int lineSpacing = 8; // Vertical spacing between lines 76 | const int symbolWidth = 3; // ">" symbol takes 3px 77 | int currentWidth = symbolWidth; // Start with ">" symbol 78 | int initialX = x; // Save the initial x position 79 | 80 | // Buffer to store a line of input, including extra space for ">" and null terminator 81 | char lineBuffer[MAX_TEXT_LENGTH_INPUT + 2]; 82 | int bufferIndex = 0; 83 | 84 | // Add ">" at the beginning of the first line 85 | lineBuffer[bufferIndex++] = '>'; 86 | lineBuffer[bufferIndex] = '\0'; 87 | 88 | int y = startY; // Current y position, starting from startY 89 | 90 | for(int i = 0; input[i] != '\0'; ++i) { 91 | // Calculate width of the current character ('1' takes 3 px, others take 6 px) 92 | int charWidth = (input[i] == '1') ? 3 : 6; 93 | 94 | if(currentWidth + charWidth > maxWidth) { 95 | // If adding this character exceeds the maxWidth, draw the current line 96 | canvas_draw_str(canvas, x, y, lineBuffer); 97 | 98 | // Reset for the next line 99 | y += lineSpacing; 100 | currentWidth = symbolWidth; // Reset current width to include ">" width for alignment 101 | bufferIndex = 0; // Reset buffer index for the new line 102 | x = initialX + 4; 103 | 104 | // lineBuffer[bufferIndex++] = '>'; // Add ">" at the beginning of the new line 105 | // lineBuffer[bufferIndex] = '\0'; // Ensure the buffer is null-terminated 106 | } 107 | 108 | // Add current character to the buffer and update the current width 109 | lineBuffer[bufferIndex++] = input[i]; 110 | lineBuffer[bufferIndex] = '\0'; // Ensure the buffer is null-terminated 111 | currentWidth += charWidth; 112 | } 113 | 114 | canvas_draw_str(canvas, x, y, lineBuffer); 115 | } 116 | 117 | void displayResult(Canvas* canvas, const char* result, int x, int y) { 118 | const int maxWidth = 56; // Maximum width for each line 119 | const int lineSpacing = 9; // Vertical spacing between lines 120 | char lines[4][MAX_TEXT_LENGTH_RESULT + 1] = { 121 | {0}}; // Ensure enough space for the result + NULL terminator 122 | int lineIndex = 0; 123 | int lineWidth = 0; 124 | 125 | for(int i = 0; result[i] != '\0' && lineIndex < 4; ++i) { // max 4 lines 126 | int charWidth = (result[i] == '1') ? 3 : 6; // '1' has width 3, others have width 6 127 | 128 | // Check if adding another character exceeds maxWidth 129 | if(lineWidth + charWidth > maxWidth) { 130 | if(lineIndex < 3) { // Move to the next line if not yet at the 4th line 131 | lineWidth = 0; // Reset line width for the new line 132 | lineIndex++; // Move to the next line 133 | } else { 134 | break; 135 | } 136 | } 137 | 138 | // Add current character to the current line 139 | int len = strlen(lines[lineIndex]); 140 | lines[lineIndex][len] = result[i]; 141 | lines[lineIndex][len + 1] = '\0'; 142 | 143 | // Update current line width 144 | lineWidth += charWidth; 145 | } 146 | 147 | // Display the lines 148 | for(int i = 0; i <= lineIndex && i < 4; i++) { 149 | canvas_draw_str(canvas, x, y + (i * lineSpacing), lines[i]); 150 | } 151 | } 152 | 153 | void calculator_draw_callback(Canvas* canvas, void* ctx) { 154 | furi_assert(ctx); 155 | const Calculator* calculator_state = ctx; 156 | furi_mutex_acquire(calculator_state->mutex, FuriWaitForever); 157 | 158 | // Clear the canvas for fresh drawing 159 | canvas_clear(canvas); 160 | 161 | // Draw the static UI layout 162 | generate_calculator_layout(canvas); 163 | 164 | char resultLabel[2 * MAX_TEXT_LENGTH_RESULT]; // Buffer to hold the result label 165 | 166 | switch(calculator_state->mode) { 167 | case ModeDecToBin: 168 | snprintf(resultLabel, sizeof(resultLabel), "%s", calculator_state->decToBinResult); 169 | break; 170 | case ModeDecToHex: 171 | snprintf(resultLabel, sizeof(resultLabel), "%s", calculator_state->decToHexResult); 172 | break; 173 | case ModeDecToChar: 174 | snprintf(resultLabel, sizeof(resultLabel), "%s", calculator_state->decToCharResult); 175 | break; 176 | case ModeHexToBin: 177 | snprintf(resultLabel, sizeof(resultLabel), "%s", calculator_state->hexToBinResult); 178 | break; 179 | case ModeHexToDec: 180 | snprintf(resultLabel, sizeof(resultLabel), "%s", calculator_state->hexToDecResult); 181 | break; 182 | case ModeBinToDec: 183 | snprintf(resultLabel, sizeof(resultLabel), "%s", calculator_state->binToDecResult); 184 | break; 185 | case ModeBinToHex: 186 | snprintf(resultLabel, sizeof(resultLabel), "%s", calculator_state->binToHexResult); 187 | break; 188 | default: 189 | strncpy(resultLabel, " -> [M]ODE -------- v0.9.2", sizeof(resultLabel)); 190 | break; 191 | } 192 | 193 | // Display the result, splitting into two lines if necessary 194 | displayResult(canvas, resultLabel, 4, 11); 195 | 196 | // Draw new input with ">" label or mode selection prompt 197 | char inputLabel[MAX_TEXT_LENGTH_INPUT + 2]; // Adjusted size for "> " 198 | snprintf(inputLabel, sizeof(inputLabel), "%s", calculator_state->text); 199 | displayInput(canvas, inputLabel, 4, 50); 200 | 201 | // Define the cell dimensions for each row and column 202 | const short cellDimensions[5][5][2] = { 203 | // {Width, Height} for each cell 204 | {{12, 13}, {0, 0}, {0, 0}, {0, 0}, {0, 0}}, // Row 1 (One column) 205 | {{12, 13}, {12, 13}, {12, 13}, {12, 13}, {12, 13}}, // Row 2 206 | {{12, 13}, {12, 13}, {12, 13}, {12, 13}, {12, 13}}, // Row 3 207 | {{12, 13}, {12, 13}, {12, 13}, {12, 13}, {12, 13}}, // Row 4 208 | {{12, 13}, {12, 13}, {12, 13}, {24, 13}, {0, 0}}, // Row 5, with different width for column 4 209 | }; 210 | 211 | const char* modeStr = ""; 212 | switch(calculator_state->mode) { 213 | case ModeDecToBin: 214 | modeStr = "dec >> bin"; 215 | break; 216 | case ModeDecToHex: 217 | modeStr = "dec >> hex"; 218 | break; 219 | case ModeDecToChar: 220 | modeStr = "dec >> char"; 221 | break; 222 | case ModeHexToBin: 223 | modeStr = "hex >> bin"; 224 | break; 225 | case ModeHexToDec: 226 | modeStr = "hex >> dec"; 227 | break; 228 | case ModeBinToDec: 229 | modeStr = "bin >> dec"; 230 | break; 231 | case ModeBinToHex: 232 | modeStr = "bin >> hex"; 233 | break; 234 | default: 235 | modeStr = " waiting ..."; 236 | break; 237 | } 238 | 239 | canvas_draw_str(canvas, 16, 71, modeStr); 240 | short cursorX = 2; 241 | short cursorY = 61; // Starting Y position 242 | 243 | for(int i = 0; i < calculator_state->position.y; i++) { 244 | cursorY += cellDimensions[i][0][1]; // Add the height of each previous row 245 | } 246 | 247 | for(int i = 0; i < calculator_state->position.x; i++) { 248 | cursorX += cellDimensions[calculator_state->position.y][i][0]; 249 | } 250 | 251 | short cellWidth = 252 | cellDimensions[calculator_state->position.y][calculator_state->position.x][0]; 253 | short cellHeight = 254 | cellDimensions[calculator_state->position.y][calculator_state->position.x][1]; 255 | 256 | // Draw the highlighted cell 257 | draw_highlighted_cell(canvas, cursorX, cursorY, cellWidth, cellHeight); 258 | 259 | // Determine the content to display in the cell 260 | char cellContent[2]; // Buffer to hold the cell content 261 | snprintf( 262 | cellContent, 263 | sizeof(cellContent), 264 | "%c", 265 | getKeyAtPosition(calculator_state->position.x, calculator_state->position.y)); 266 | 267 | // Calculate center position for the text 268 | short textX = cursorX + (cellWidth - calculateStringWidth(cellContent, 2)) / 1; 269 | short textY = cursorY + (cellHeight - 2) / 1; 270 | 271 | // Set the color for the text and draw it 272 | canvas_set_color(canvas, ColorWhite); 273 | canvas_draw_str(canvas, textX, textY, cellContent); 274 | 275 | furi_mutex_release(calculator_state->mutex); 276 | } -------------------------------------------------------------------------------- /ui_drawing.h: -------------------------------------------------------------------------------- 1 | #ifndef UI_DRAWING_H 2 | #define UI_DRAWING_H 3 | 4 | #include "calculator_state.h" 5 | #include 6 | 7 | void drawElement(Canvas* canvas, const char* str, int x, int y, int width, int height, Font font); 8 | void generate_calculator_layout(Canvas* canvas); 9 | void draw_highlighted_cell(Canvas* canvas, short x, short y, short width, short height); 10 | void displayInput(Canvas* canvas, const char* input, int x, int y); 11 | void displayResult(Canvas* canvas, const char* result, int x, int y); 12 | void calculator_draw_callback(Canvas* canvas, void* ctx); 13 | 14 | #endif // UI_DRAWING_H 15 | -------------------------------------------------------------------------------- /utilities.c: -------------------------------------------------------------------------------- 1 | #include "utilities.h" 2 | #include "calculator.h" 3 | 4 | char getKeyAtPosition(short x, short y) { 5 | const char keys[6][5] = { 6 | {'M', ' ', ' ', ' ', ' '}, // Row 1 (MODE key) 7 | {'7', '8', '9', 'A', 'B'}, // Row 2 8 | {'4', '5', '6', 'C', 'D'}, // Row 3 9 | {'1', '2', '3', 'E', 'F'}, // Row 4 10 | {'<', '0', '=', 'R', ' '} // Row 5 11 | }; 12 | 13 | return (y < 6 && x < 5) ? keys[y][x] : ' '; 14 | } 15 | 16 | short calculateStringWidth(const char* str, short length) { 17 | short width = 0; 18 | for(short i = 0; i < length; i++) { 19 | switch(str[i]) { 20 | case 'M': 21 | width += 5; 22 | break; 23 | case '0': 24 | width += 4; 25 | break; 26 | case '1': 27 | width += 3; 28 | break; 29 | case '2': 30 | case '3': 31 | case '4': 32 | width += 4; 33 | break; 34 | case '5': 35 | width += 4; 36 | break; 37 | case '6': 38 | width += 4; 39 | break; 40 | case '7': 41 | width += 4; 42 | break; 43 | case '8': 44 | width += 4; 45 | break; 46 | case '9': 47 | width += 4; 48 | break; 49 | case 'A': 50 | case 'B': 51 | case 'C': 52 | case 'D': 53 | case 'E': 54 | case 'F': 55 | case '<': 56 | width += 3; 57 | break; 58 | case '=': 59 | width += 4; 60 | break; 61 | case 'R': 62 | width += 9; 63 | break; 64 | default: 65 | width += 3; 66 | break; 67 | } 68 | width += 1; 69 | } 70 | return width; 71 | } -------------------------------------------------------------------------------- /utilities.h: -------------------------------------------------------------------------------- 1 | #ifndef UTILITIES_H 2 | #define UTILITIES_H 3 | 4 | char getKeyAtPosition(short x, short y); 5 | short calculateStringWidth(const char* str, short length); 6 | 7 | #endif // UTILITIES_H 8 | --------------------------------------------------------------------------------