diff --git a/hindi/LICENSE b/hindi/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/hindi/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + 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. + + + Copyright (C) + + 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 . + +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: + + Copyright (C) + 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 +. + + 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 +. diff --git a/hindi/README.md b/hindi/README.md new file mode 100644 index 0000000..5cee341 --- /dev/null +++ b/hindi/README.md @@ -0,0 +1 @@ +# voice-acct-local \ No newline at end of file diff --git a/hindi/index.html b/hindi/index.html new file mode 100755 index 0000000..1e28ede --- /dev/null +++ b/hindi/index.html @@ -0,0 +1,243 @@ + + + + + + + + + + + + + + Voice Accounting + + + + + + + + + +
+
+

Voice Accounting

+
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ Accounting History +
+
+ + + +
+
+
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+ +

Hint: Just Type from the Numeric Keypad itself &
Also Adjust Speaker Volume to the desired level.

Can attach a USB Keyboard with Numeric Keypad as well.

Pressing esc key will now clear the input field fully.
Pressing Backspace key will clear input, one by one.

For typing Plus & Multiply Signs from Main Keyboard, use Shift+Plus (twice) & Shift+Multiply(twice), the second key is repeated twice here.

+ + +
+ + + + + + + + + + + + + + + + + + + + + + diff --git a/hindi/moment-with-locales.min.js b/hindi/moment-with-locales.min.js new file mode 100755 index 0000000..8a6c9b4 --- /dev/null +++ b/hindi/moment-with-locales.min.js @@ -0,0 +1,2 @@ +!function(e,a){"object"==typeof exports&&"undefined"!=typeof module?module.exports=a():"function"==typeof define&&define.amd?define(a):e.moment=a()}(this,function(){"use strict";var E;function c(){return E.apply(null,arguments)}function F(e){return e instanceof Array||"[object Array]"===Object.prototype.toString.call(e)}function z(e){return null!=e&&"[object Object]"===Object.prototype.toString.call(e)}function l(e,a){return Object.prototype.hasOwnProperty.call(e,a)}function N(e){if(Object.getOwnPropertyNames)return 0===Object.getOwnPropertyNames(e).length;for(var a in e)if(l(e,a))return;return 1}function L(e){return void 0===e}function J(e){return"number"==typeof e||"[object Number]"===Object.prototype.toString.call(e)}function R(e){return e instanceof Date||"[object Date]"===Object.prototype.toString.call(e)}function C(e,a){for(var t=[],s=e.length,n=0;n>>0,s=0;sFe(e)?(r=e+1,a-Fe(e)):(r=e,a);return{year:r,dayOfYear:t}}function aa(e,a,t){var s,n,r=Xe(e.year(),a,t),r=Math.floor((e.dayOfYear()-r-1)/7)+1;return r<1?s=r+ta(n=e.year()-1,a,t):r>ta(e.year(),a,t)?(s=r-ta(e.year(),a,t),n=e.year()+1):(n=e.year(),s=r),{week:s,year:n}}function ta(e,a,t){var s=Xe(e,a,t),a=Xe(e+1,a,t);return(Fe(e)-s+a)/7}s("w",["ww",2],"wo","week"),s("W",["WW",2],"Wo","isoWeek"),h("w",r,u),h("ww",r,a),h("W",r,u),h("WW",r,a),Se(["w","ww","W","WW"],function(e,a,t,s){a[s.substr(0,1)]=f(e)});function sa(e,a){return e.slice(a,7).concat(e.slice(0,a))}s("d",0,"do","day"),s("dd",0,0,function(e){return this.localeData().weekdaysMin(this,e)}),s("ddd",0,0,function(e){return this.localeData().weekdaysShort(this,e)}),s("dddd",0,0,function(e){return this.localeData().weekdays(this,e)}),s("e",0,0,"weekday"),s("E",0,0,"isoWeekday"),h("d",r),h("e",r),h("E",r),h("dd",function(e,a){return a.weekdaysMinRegex(e)}),h("ddd",function(e,a){return a.weekdaysShortRegex(e)}),h("dddd",function(e,a){return a.weekdaysRegex(e)}),Se(["dd","ddd","dddd"],function(e,a,t,s){s=t._locale.weekdaysParse(e,s,t._strict);null!=s?a.d=s:Y(t).invalidWeekday=e}),Se(["d","e","E"],function(e,a,t,s){a[s]=f(e)});var na="Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"),ra="Sun_Mon_Tue_Wed_Thu_Fri_Sat".split("_"),da="Su_Mo_Tu_We_Th_Fr_Sa".split("_"),_a=m,ia=m,oa=m;function ma(){function e(e,a){return a.length-e.length}for(var a,t,s,n=[],r=[],d=[],_=[],i=0;i<7;i++)s=U([2e3,1]).day(i),a=we(this.weekdaysMin(s,"")),t=we(this.weekdaysShort(s,"")),s=we(this.weekdays(s,"")),n.push(a),r.push(t),d.push(s),_.push(a),_.push(t),_.push(s);n.sort(e),r.sort(e),d.sort(e),_.sort(e),this._weekdaysRegex=new RegExp("^("+_.join("|")+")","i"),this._weekdaysShortRegex=this._weekdaysRegex,this._weekdaysMinRegex=this._weekdaysRegex,this._weekdaysStrictRegex=new RegExp("^("+d.join("|")+")","i"),this._weekdaysShortStrictRegex=new RegExp("^("+r.join("|")+")","i"),this._weekdaysMinStrictRegex=new RegExp("^("+n.join("|")+")","i")}function ua(){return this.hours()%12||12}function la(e,a){s(e,0,0,function(){return this.localeData().meridiem(this.hours(),this.minutes(),a)})}function Ma(e,a){return a._meridiemParse}s("H",["HH",2],0,"hour"),s("h",["hh",2],0,ua),s("k",["kk",2],0,function(){return this.hours()||24}),s("hmm",0,0,function(){return""+ua.apply(this)+de(this.minutes(),2)}),s("hmmss",0,0,function(){return""+ua.apply(this)+de(this.minutes(),2)+de(this.seconds(),2)}),s("Hmm",0,0,function(){return""+this.hours()+de(this.minutes(),2)}),s("Hmmss",0,0,function(){return""+this.hours()+de(this.minutes(),2)+de(this.seconds(),2)}),la("a",!0),la("A",!1),h("a",Ma),h("A",Ma),h("H",r,M),h("h",r,u),h("k",r,u),h("HH",r,a),h("hh",r,a),h("kk",r,a),h("hmm",ye),h("hmmss",_),h("Hmm",ye),h("Hmmss",_),k(["H","HH"],D),k(["k","kk"],function(e,a,t){e=f(e);a[D]=24===e?0:e}),k(["a","A"],function(e,a,t){t._isPm=t._locale.isPM(e),t._meridiem=e}),k(["h","hh"],function(e,a,t){a[D]=f(e),Y(t).bigHour=!0}),k("hmm",function(e,a,t){var s=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s)),Y(t).bigHour=!0}),k("hmmss",function(e,a,t){var s=e.length-4,n=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s,2)),a[Oe]=f(e.substr(n)),Y(t).bigHour=!0}),k("Hmm",function(e,a,t){var s=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s))}),k("Hmmss",function(e,a,t){var s=e.length-4,n=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s,2)),a[Oe]=f(e.substr(n))});m=Ne("Hours",!0);var ha,ca={calendar:{sameDay:"[Today at] LT",nextDay:"[Tomorrow at] LT",nextWeek:"dddd [at] LT",lastDay:"[Yesterday at] LT",lastWeek:"[Last] dddd [at] LT",sameElse:"L"},longDateFormat:{LTS:"h:mm:ss A",LT:"h:mm A",L:"MM/DD/YYYY",LL:"MMMM D, YYYY",LLL:"MMMM D, YYYY h:mm A",LLLL:"dddd, MMMM D, YYYY h:mm A"},invalidDate:"Invalid date",ordinal:"%d",dayOfMonthOrdinalParse:/\d{1,2}/,relativeTime:{future:"in %s",past:"%s ago",s:"a few seconds",ss:"%d seconds",m:"a minute",mm:"%d minutes",h:"an hour",hh:"%d hours",d:"a day",dd:"%d days",w:"a week",ww:"%d weeks",M:"a month",MM:"%d months",y:"a year",yy:"%d years"},months:Ie,monthsShort:Ue,week:{dow:0,doy:6},weekdays:na,weekdaysMin:da,weekdaysShort:ra,meridiemParse:/[ap]\.?m?\.?/i},g={},La={};function Ya(e){return e&&e.toLowerCase().replace("_","-")}function ya(e){for(var a,t,s,n,r=0;r=a&&function(e,a){for(var t=Math.min(e.length,a.length),s=0;s=a-1)break;a--}r++}return ha}function fa(a){var e,t;if(void 0===g[a]&&"undefined"!=typeof module&&module&&module.exports&&(t=a)&&t.match("^[^/\\\\]*$"))try{e=ha._abbr,require("./locale/"+a),ka(e)}catch(e){g[a]=null}return g[a]}function ka(e,a){return e&&((a=L(a)?Da(e):pa(e,a))?ha=a:"undefined"!=typeof console&&console.warn&&console.warn("Locale "+e+" not found. Did you forget to load it?")),ha._abbr}function pa(e,a){if(null===a)return delete g[e],null;var t,s=ca;if(a.abbr=e,null!=g[e])ae("defineLocaleOverride","use moment.updateLocale(localeName, config) to change an existing locale. moment.defineLocale(localeName, config) should only be used for creating a new locale See http://momentjs.com/guides/#/warnings/define-locale/ for more info."),s=g[e]._config;else if(null!=a.parentLocale)if(null!=g[a.parentLocale])s=g[a.parentLocale]._config;else{if(null==(t=fa(a.parentLocale)))return La[a.parentLocale]||(La[a.parentLocale]=[]),La[a.parentLocale].push({name:e,config:a}),null;s=t._config}return g[e]=new ne(se(s,a)),La[e]&&La[e].forEach(function(e){pa(e.name,e.config)}),ka(e),g[e]}function Da(e){var a;if(!(e=e&&e._locale&&e._locale._abbr?e._locale._abbr:e))return ha;if(!F(e)){if(a=fa(e))return a;e=[e]}return ya(e)}function Ta(e){var a=e._a;return a&&-2===Y(e).overflow&&(a=a[je]<0||11Ce(a[p],a[je])?xe:a[D]<0||24ta(r,i,o)?Y(s)._overflowWeeks=!0:null!=m?Y(s)._overflowWeekday=!0:(u=ea(r,d,_,i,o),s._a[p]=u.year,s._dayOfYear=u.dayOfYear)),null!=e._dayOfYear&&(n=Aa(e._a[p],t[p]),(e._dayOfYear>Fe(n)||0===e._dayOfYear)&&(Y(e)._overflowDayOfYear=!0),m=Qe(n,0,e._dayOfYear),e._a[je]=m.getUTCMonth(),e._a[xe]=m.getUTCDate()),a=0;a<3&&null==e._a[a];++a)e._a[a]=l[a]=t[a];for(;a<7;a++)e._a[a]=l[a]=null==e._a[a]?2===a?1:0:e._a[a];24===e._a[D]&&0===e._a[Pe]&&0===e._a[Oe]&&0===e._a[We]&&(e._nextDay=!0,e._a[D]=0),e._d=(e._useUTC?Qe:$e).apply(null,l),r=e._useUTC?e._d.getUTCDay():e._d.getDay(),null!=e._tzm&&e._d.setUTCMinutes(e._d.getUTCMinutes()-e._tzm),e._nextDay&&(e._a[D]=24),e._w&&void 0!==e._w.d&&e._w.d!==r&&(Y(e).weekdayMismatch=!0)}}function Fa(e){if(e._f===c.ISO_8601)Pa(e);else if(e._f===c.RFC_2822)Wa(e);else{e._a=[],Y(e).empty=!0;for(var a,t,s,n,r,d=""+e._i,_=d.length,i=0,o=le(e._f,e._locale).match(_e)||[],m=o.length,u=0;ue.valueOf():e.valueOf()"}),u.toJSON=function(){return this.isValid()?this.toISOString():null},u.toString=function(){return this.clone().locale("en").format("ddd MMM DD YYYY HH:mm:ss [GMT]ZZ")},u.unix=function(){return Math.floor(this.valueOf()/1e3)},u.valueOf=function(){return this._d.valueOf()-6e4*(this._offset||0)},u.creationData=function(){return{input:this._i,format:this._f,locale:this._locale,isUTC:this._isUTC,strict:this._strict}},u.eraName=function(){for(var e,a=this.localeData().eras(),t=0,s=a.length;tthis.clone().month(0).utcOffset()||this.utcOffset()>this.clone().month(5).utcOffset()},u.isLocal=function(){return!!this.isValid()&&!this._isUTC},u.isUtcOffset=function(){return!!this.isValid()&&this._isUTC},u.isUtc=Za,u.isUTC=Za,u.zoneAbbr=function(){return this._isUTC?"UTC":""},u.zoneName=function(){return this._isUTC?"Coordinated Universal Time":""},u.dates=e("dates accessor is deprecated. Use date instead.",i),u.months=e("months accessor is deprecated. Use month instead",Ke),u.years=e("years accessor is deprecated. Use year instead",ze),u.zone=e("moment().zone is deprecated, use moment().utcOffset instead. http://momentjs.com/guides/#/warnings/zone/",function(e,a){return null!=e?(this.utcOffset(e="string"!=typeof e?-e:e,a),this):-this.utcOffset()}),u.isDSTShifted=e("isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information",function(){var e,a;return L(this._isDSTShifted)&&(Z(e={},this),(e=za(e))._a?(a=(e._isUTC?U:w)(e._a),this._isDSTShifted=this.isValid()&&0 + + \ No newline at end of file diff --git a/hindi/playdigits.js b/hindi/playdigits.js new file mode 100644 index 0000000..8df0364 --- /dev/null +++ b/hindi/playdigits.js @@ -0,0 +1,29 @@ +function doFunction(){ + +// console.log(Array.from([1, 2, 3], (x) => x + '.mp3')); + + // Create an array of audio file URLs + // const audioFiles = ['audio1.mp3', 'audio2.mp3', 'audio3.mp3']; + + const audioFiles = Array.from(testi.toString().replaceAll('.', '_'), (x) => 'region/' + x + '.mp3') + + // Create an array to store audio elements + const audioElements = []; + + // Create audio elements for each audio file and store them in the array + audioFiles.forEach(file => { + const audio = new Audio(file); + audioElements.push(audio); + }); + + // Play the first audio file + audioElements[0].play(); + + // Use the onended event of each audio element to play the next one + for (let i = 0; i < audioElements.length - 1; i++) { + audioElements[i].onended = () => { + audioElements[i + 1].play(); + }; + } + +} diff --git a/hindi/region/1.mp3 b/hindi/region/1.mp3 new file mode 100644 index 0000000..3578e71 Binary files /dev/null and b/hindi/region/1.mp3 differ diff --git a/hindi/region/10.mp3 b/hindi/region/10.mp3 new file mode 100644 index 0000000..34bcc73 Binary files /dev/null and b/hindi/region/10.mp3 differ diff --git a/hindi/region/11.mp3 b/hindi/region/11.mp3 new file mode 100644 index 0000000..c662e4b Binary files /dev/null and b/hindi/region/11.mp3 differ diff --git a/hindi/region/12.mp3 b/hindi/region/12.mp3 new file mode 100644 index 0000000..7b112e3 Binary files /dev/null and b/hindi/region/12.mp3 differ diff --git a/hindi/region/13.mp3 b/hindi/region/13.mp3 new file mode 100644 index 0000000..0ccc17e Binary files /dev/null and b/hindi/region/13.mp3 differ diff --git a/hindi/region/14.mp3 b/hindi/region/14.mp3 new file mode 100644 index 0000000..c6507ea Binary files /dev/null and b/hindi/region/14.mp3 differ diff --git a/hindi/region/15.mp3 b/hindi/region/15.mp3 new file mode 100644 index 0000000..52955d1 Binary files /dev/null and b/hindi/region/15.mp3 differ diff --git a/hindi/region/16.mp3 b/hindi/region/16.mp3 new file mode 100644 index 0000000..06d71ac Binary files /dev/null and b/hindi/region/16.mp3 differ diff --git a/hindi/region/17.mp3 b/hindi/region/17.mp3 new file mode 100644 index 0000000..db8d00a Binary files /dev/null and b/hindi/region/17.mp3 differ diff --git a/hindi/region/18.mp3 b/hindi/region/18.mp3 new file mode 100644 index 0000000..27ab3e3 Binary files /dev/null and b/hindi/region/18.mp3 differ diff --git a/hindi/region/19.mp3 b/hindi/region/19.mp3 new file mode 100644 index 0000000..028a3e3 Binary files /dev/null and b/hindi/region/19.mp3 differ diff --git a/hindi/region/2.mp3 b/hindi/region/2.mp3 new file mode 100644 index 0000000..1f0f1ed Binary files /dev/null and b/hindi/region/2.mp3 differ diff --git a/hindi/region/20.mp3 b/hindi/region/20.mp3 new file mode 100644 index 0000000..037cadf Binary files /dev/null and b/hindi/region/20.mp3 differ diff --git a/hindi/region/21.mp3 b/hindi/region/21.mp3 new file mode 100644 index 0000000..ac9ecf1 Binary files /dev/null and b/hindi/region/21.mp3 differ diff --git a/hindi/region/3.mp3 b/hindi/region/3.mp3 new file mode 100644 index 0000000..819458b Binary files /dev/null and b/hindi/region/3.mp3 differ diff --git a/hindi/region/4.mp3 b/hindi/region/4.mp3 new file mode 100644 index 0000000..20711e1 Binary files /dev/null and b/hindi/region/4.mp3 differ diff --git a/hindi/region/5.mp3 b/hindi/region/5.mp3 new file mode 100644 index 0000000..7141aeb Binary files /dev/null and b/hindi/region/5.mp3 differ diff --git a/hindi/region/6.mp3 b/hindi/region/6.mp3 new file mode 100644 index 0000000..4745f31 Binary files /dev/null and b/hindi/region/6.mp3 differ diff --git a/hindi/region/7.mp3 b/hindi/region/7.mp3 new file mode 100644 index 0000000..01e9e07 Binary files /dev/null and b/hindi/region/7.mp3 differ diff --git a/hindi/region/8.mp3 b/hindi/region/8.mp3 new file mode 100644 index 0000000..5700389 Binary files /dev/null and b/hindi/region/8.mp3 differ diff --git a/hindi/region/9.mp3 b/hindi/region/9.mp3 new file mode 100644 index 0000000..3fe1b17 Binary files /dev/null and b/hindi/region/9.mp3 differ diff --git a/hindi/script.js b/hindi/script.js new file mode 100755 index 0000000..1faaf07 --- /dev/null +++ b/hindi/script.js @@ -0,0 +1,649 @@ +var filemaps = { +'-': '1', +'`': '2', +'.': '2', +'=': '3', +'0': '4', +'1': '5', +'2': '6', +'3': '7', +'4': '8', +'5': '9', +'6': '10', +'7': '11', +'8': '12', +'9': '13', +'Backspace': '14', +'/': '15', +'Escape': '16', +'Enter': '17', +'*': '18', +'Clear': '19', +'+': '20', +'R': '21' +} + +// filemaps[date] + + +function doFunction(testxi){ + +// console.log(Array.from([1, 2, 3], (x) => x + '.mp3')); + + // Create an array of audio file URLs + // const audioFiles = ['audio1.mp3', 'audio2.mp3', 'audio3.mp3']; + + const audioFiles = Array.from(testxi.toString().replaceAll('.', '`'), (x) => 'region/' + filemaps[x] + '.mp3') + + // Create an array to store audio elements + const audioElements = []; + + // Create audio elements for each audio file and store them in the array + audioFiles.forEach(file => { + const audio = new Audio(file); + audioElements.push(audio); + }); + + // Play the first audio file + audioElements[0].play(); + + let j=(Number(audioElements.length.toString()) - 1); + + console.log('j equals : '+j); + + // Use the onended event of each audio element to play the next one + for (let i = 0; i < audioElements.length - 1; i++) { + audioElements[i].onended = () => { + audioElements[i + 1].play(); + + console.log('i equals : ' + i); + console.log('audio elements equals : ' + Number(audioElements.length - 1).toString() ) + + console.log('j equals : '+j); + if ( i == (Number(j) - 1) ) { + + setTimeout(function () { + console.log('Hi') + location.reload(); +}, 1000) + +} + + // if ( i == 4 ) location.reload(); + }; + + } + +} + + +function roundDown(number, decimals) { + decimals = decimals || 0; + return ( Math.floor( number * Math.pow(10, decimals) ) / Math.pow(10, decimals) ); +} + + +var myContent=""; + +/* +function myLoad() { + var myContent = localStorage.getItem("myContent"); + console.log(myContent); + document.getElementById("calc-history-box").innerHTML = myContent; + } +*/ + +// Get reference to the "canvas" +var can = document.getElementById("calc-history-box"); + +// Save the content of the canvas to localStorage +function saveData(){ + localStorage.setItem("canvas", can.innerHTML); +} + +// Get localStorage data +function restoreData(){ + can.innerHTML = localStorage.getItem("canvas"); +} + +$(document).ready(function() { + +restoreData(); + + // A database of the symbols and functions of every operand. Order of operators determines precedence. + var operators = [ + { + id: "op-power", + numOperands: 2, + symbol: " ^ ", + calc: function(a, b) { + return Math.pow(a, b); + } + }, + { + id: "op-negate", + numOperands: 1, + symbol: " -", + calc: function(a) { + return -a; + } + }, + { + id: "op-square-root", + numOperands: 1, + symbol: " √", + calc: function(a) { + return Math.sqrt(a); + } + }, + { + id: "op-log", + numOperands: 1, + symbol: " log ", + calc: function(a) { + return Math.log10(a); + } + }, + { + id: "op-natural-log", + numOperands: 1, + symbol: " ln ", + calc: function(a) { + return Math.log(a); + } + }, + { + id: "op-sin", + numOperands: 1, + symbol: " sin ", + calc: function(a) { + return Math.sin(a); + } + }, + { + id: "op-cos", + numOperands: 1, + symbol: " cos ", + calc: function(a) { + return Math.cos(a); + } + }, + { + id: "op-tan", + numOperands: 1, + symbol: " tan ", + calc: function(a) { + return Math.tan(a); + } + }, + { + id: "op-inverse-sin", + numOperands: 1, + symbol: " sin-1 ", + calc: function(a) { + return Math.asin(a); + } + }, + { + id: "op-inverse-cos", + numOperands: 1, + symbol: " cos-1 ", + calc: function(a) { + return Math.acos(a); + } + }, + { + id: "op-inverse-tan", + numOperands: 1, + symbol: " tan-1 ", + calc: function(a) { + return Math.atan(a); + } + }, + { + id: "op-e", + numOperands: 1, + symbol: " e ^ ", + calc: function(a) { + return Math.exp(a); + } + }, + { + id: "op-nth-root", + numOperands: 2, + symbol: "*√", + calc: function(a, b) { + return Math.pow(b, 1/a); + } + }, + { + id: "op-multiply", + numOperands: 2, + symbol: " x ", + calc: function(a, b) { + return a * b; + } + }, + { + id: "op-divide", + numOperands: 2, + symbol: " ÷ ", + calc: function(a, b) { + return a / b; + } + }, + { + id: "op-add", + numOperands: 2, + symbol: " + ", + calc: function(a, b) { + return a + b; + } + }, + { + id: "op-subtract", + numOperands: 2, + symbol: " - ", + calc: function(a, b) { + return a - b; + } + } + ]; + + // The number of places to round to + const roundPlaces = 2; + + // Get the operator object for a given operator ID + function getOperator(opID) { + for(var i = 0; i < operators.length; i++) { + if(operators[i].id === opID) { + return operators[i]; + } + } + return undefined; + } + + // Get the precedence of an operator given its ID + function getOpPrecedence(opID) { + for(var i = 0; i < operators.length; i++) { + if(operators[i].id === opID) { + return i; + } + } + + // If the given ID does not return an operator, then return a large value that will always lose in precedence + return 1000; + } + + // Returns true if op1 ID has equal or higher precedence than op2 ID, false otherwise + function hasPrecedence(op1, op2) { + if(getOperator(op1) != undefined) { + return getOpPrecedence(op1) <= getOpPrecedence(op2); + } + } + + // Converts the given radian value to degrees + function toDegrees(radians) { + return radians * (180 / Math.PI); + } + + // Converts the given degrees value to radians + function toRadians(degrees) { + return degrees * (Math.PI / 180); + } + + // A list of every token (number or operator) currently in the expression + var tokenList = []; + + // A list of previous results and expressions in the form {out: output, expression: expression string, tokens: list of tokens in the expression} + var calcHistory = []; + + // Evaluates the expression and outputs the result + function calculate() { + // Check if brackets are balanced + var count = 0; + for(var i = 0; i < tokenList.length; i++) { + if(tokenList[i] === "bracket-left") { + count++; + } else if(tokenList[i] === "bracket-right") { + count--; + } + } + if(count != 0) { + output("Error: unbalanced brackets"); + return; + } + + // Evaluate the expression using a modified version of the shunting yard algorithm + var valStack = []; + var opStack = []; + + for(var i = 0; i < tokenList.length; i++) { + if(!isNaN(tokenList[i])) { + valStack.push(tokenList[i]); + } else if(tokenList[i] === "num-pi") { + valStack.push(Math.PI); + } else if(tokenList[i] === "bracket-left") { + opStack.push(tokenList[i]); + } else if(tokenList[i] === "bracket-right") { + while(opStack[opStack.length - 1] !== "bracket-left") { + var operator = getOperator(opStack.pop()); + if(operator.numOperands === 1) + valStack.push(applyOperator(operator, [valStack.pop()])); + else + valStack.push(applyOperator(operator, [valStack.pop(), valStack.pop()])); + } + opStack.pop(); + } else { + while(opStack.length > 0 && hasPrecedence(opStack[opStack.length - 1], tokenList[i])) { + var operator = getOperator(opStack.pop()); + if(operator.numOperands === 1) + valStack.push(applyOperator(operator, [valStack.pop()])); + else + valStack.push(applyOperator(operator, [valStack.pop(), valStack.pop()])); + } + opStack.push(tokenList[i]); + } + } + + while(opStack.length > 0) { + var operator = getOperator(opStack.pop()); + if(operator.numOperands === 1) + valStack.push(applyOperator(operator, [valStack.pop()])); + else + valStack.push(applyOperator(operator, [valStack.pop(), valStack.pop()])); + } + + // Output the calculated result and the original expression + output(valStack[0], $("#expression").html(), tokenList); + } + + // Returns the result of applying the given unary or binary operator on the top values of the value stack + function applyOperator(operator, vals) { + var valA = vals[0]; + var result; + + if(vals.length === 1) { + result = operator.calc(parseFloat(valA)); + } else { + var valB = vals[1]; + result = operator.calc(parseFloat(valB), parseFloat(valA)); + } + + return result; + } + + var textii = ""; + var testi = ""; + + // Updates the equation and calc history with the given output + function output(out, expression, tokens) { + out = +out.toFixed(roundPlaces); + $("#expression").html(out.toString()); + + calcHistory.push({out: out, expression: expression, tokens: tokens}); + // $("#calc-history-box").html(""); + for(var i = calcHistory.length - 1; i >= 0; i--) { + $("#calc-history-box").prepend("

" + moment().format('llll') + "

" + "

" + calcHistory[i].expression + "

= " + calcHistory[i].out + "

"); + + textii = calcHistory[i].out; + let textvi = calcHistory[i].out.toString(); + textiv="1248.64"; + console.log(textvi); + testi="="+textvi+"R"+textvi; + // testi=textvi; + console.log(testi); + // responsiveVoice.speak(textvi,'UK English Female', parameters); + // responsiveVoice.speak(" I Repeat. ",'UK English Female', parameters); + // responsiveVoice.speak( testi.toString(), 'UK English Female', {rate: 0.95, onend: () => location.reload()}); + doFunction(testi); + } + } + + // Adds a token to the token list and updates the display + function addToken(token) { + if(isNaN(token)) { + if((token === "bracket-left" || token === "num-pi") && !isNaN(tokenList[tokenList.length - 1])) { + tokenList.push("op-multiply"); + } + tokenList.push(token); + } else { + if(!isNaN(tokenList[tokenList.length - 1])) { + tokenList[tokenList.length - 1] = tokenList[tokenList.length - 1] + token; + } else { + if(!isNaN(token) && (tokenList[tokenList.length - 1] === "bracket-right" || tokenList[tokenList.length - 1] === "num-pi")) { + tokenList.push("op-multiply"); + } + tokenList.push(token); + } + } + + displayEquation(); + } + + // Updates the expression display's HTML + function displayEquation() { + var htmlString = ""; + for(var i = 0; i < tokenList.length; i++) { + if(isNaN(tokenList[i])) { + if(tokenList[i] === "bracket-left") { + htmlString += " ("; + } else if(tokenList[i] === "bracket-right") { + htmlString += ") "; + } else if(tokenList[i] === "num-pi") { + htmlString += " π "; + } else { + htmlString += getOperator(tokenList[i]).symbol; + } + } else { + htmlString += tokenList[i]; + } + } + $("#expression").html(htmlString); + } + + // Deletes the last entered token + function deleteLast() { + if(isNaN(tokenList[tokenList.length - 1])) { + tokenList.pop(); + } else { + tokenList[tokenList.length - 1] = tokenList[tokenList.length - 1].slice(0, -1); + if(tokenList[tokenList.length -1].length === 0) { + tokenList.pop(); + } + } + + displayEquation(); + } + + // Shows/hides the advanced operators panel + function toggleAdvanced() { + $("#advanced-buttons").toggle(); + if($("#advanced-buttons").is(":visible")) { + $("#toggle-advanced").removeClass("button-off"); + $("#toggle-advanced span").removeClass("glyphicon-triangle-bottom").addClass("glyphicon-triangle-top"); + } else { + $("#toggle-advanced").addClass("button-off"); + $("#toggle-advanced span").removeClass("glyphicon-triangle-top").addClass("glyphicon-triangle-bottom"); + } + } + + // Triggers the appropriate action for each button that can be pressed + function processButton(button) { + switch($(button).attr("id")) { + case "delete": + deleteLast(); + break; + case "clear": + if(tokenList.length === 0) { + // calcHistory.length = 0; + // $("#calc-history-box").html(""); + } else { + tokenList.length = 0; + displayEquation(); + } + break; + case "period": + if(isNaN(tokenList[tokenList.length - 1])) { + addToken("0."); + } else { + if(tokenList[tokenList.length - 1].indexOf(".") === -1) { + tokenList[tokenList.length - 1] += "."; + } + } + displayEquation(); + break; + case "equals": + calculate(); + break; + case "toggle-advanced": + toggleAdvanced(); + break; + case "num-pi": + addToken("num-pi"); + break; + default: + if($(button).hasClass("num")) { + addToken($(button).html()); + } else { + addToken($(button).attr("id")); + } + } + } + + // Catches all button clicks on the page + + $(".btn").off('click').click(function(event) { + event.stopPropagation(); + event.stopImmediatePropagation(); + $(event.target).blur(); + // console.log("i am called"); + processButton(event.target); + return false; + }); + + $(document).on("click", ".calc-history-eq", function(event) { + var tokens = calcHistory[parseInt($(event.target).attr("id").substring(2))].tokens; + console.log(parseInt($(event.target).attr("id").substring(2))); + console.log(calcHistory); + console.log(tokens); + tokenList = tokens; + displayEquation(); + }); + +}); + +/* +function mySave() { + myContent += document.getElementById("calc-history-box").innerHTML; + console.log(myContent); + localStorage.setItem("myContent", myContent); + // console.log('History Saved'); + } +*/ + +function speak() { +// $('#61')[0].play(); +console.log('i am called'); +document.getElementById('13').play(); +} + +var down = false; + + document.addEventListener("keydown", (e) => { + + if(down) return; + down = true; + +var keyPressed = window.event.keyCode; +var shiftPressed = window.event.shiftKey; + + +if (e.key !== "Enter" && typeof filemaps[e.key] !== 'undefined') { +// console.log(filemaps[e.key]); +var myaudio = new Audio('region/' + filemaps[e.key] + '.mp3'); +myaudio.play(); +} + +// console.log(e.key); + +if (e.key >= 0 && e.key <= 9) { + event.preventDefault(); + e.stopPropagation(); + // document.getElementById(filemaps[e.key]).play(); + document.getElementById("num-" + e.key).click(); + return false; +} else if (e.key == "Enter" || e.key == "=") { + event.preventDefault(); + // document.getElementById('61').play(); + // speak(); + // document.getElementById('13').play(); + + // var speech = new SpeechSynthesisUtterance("hello world"); + // Window.speechSynthesis.speak(speech); + + // document.getElementById('=').play(); + document.getElementById("equals").click(); + saveData(); + // window.location.reload(); + // document.getElementById("clear").click(); + +/* + document.onkeydown = function (e) { + return false; +} + + setTimeout(function() { + // Do something after 5 seconds + location.reload();//reload page + +document.onkeydown = function (e) { + return true; +} + +}, 10000); +*/ + + +} else if (e.key == ".") { + event.preventDefault(); + // document.getElementById(filemaps['`']).play(); + document.getElementById("period").click(); +} else if (e.key == "+") { + event.preventDefault(); + // document.getElementById(filemaps['P']).play(); + document.getElementById("op-add").click(); +} else if (event.keyCode == 16 && keyPressed == 43) { + event.preventDefault(); + // document.getElementById(filemaps['P']).play(); + document.getElementById("op-add").click(); +} else if (e.key == "-") { + event.preventDefault(); + // document.getElementById(filemaps['-']).play(); + document.getElementById("op-subtract").click(); +} else if (e.key == "*") { + event.preventDefault(); + // document.getElementById(filemaps['MU']).play(); + document.getElementById("op-multiply").click(); +} else if (e.key == "/") { + event.preventDefault(); + // document.getElementById(filemaps['D']).play(); + document.getElementById("op-divide").click(); +} else if (e.key == "Backspace") { + event.preventDefault(); + // document.getElementById(filemaps['B']).play(); + document.getElementById("delete").click(); +} else if (e.key == "Escape") { + event.preventDefault(); + // document.getElementById(filemaps['E']).play(); + document.getElementById("clear").click(); +} else if (event.keyCode == 12) { + event.preventDefault(); + // document.getElementById(filemaps['NL']).play(); + // document.getElementById("clear").click(); +} +}, false); + +document.addEventListener('keyup', function () { + down = false; +}, false); diff --git a/hindi/style.css b/hindi/style.css new file mode 100755 index 0000000..3331338 --- /dev/null +++ b/hindi/style.css @@ -0,0 +1,146 @@ +body { + background-color: #121212; + color: white; +} + +h1 { + margin-bottom: 20px; + text-align: center; +} + +.btn { + box-shadow: 0px 5px 10px #222222; + font-size:18px; +} + +.btn:focus { + outline: none; +} + +.button-row div { + width: 60px; + height: 60px; + text-align: center; + line-height: 60px; + margin: 5px; +} + +.button-row .btn { + width: 60px; + height: 60px; + background-color: #636363; +} + +.button-row .btn:hover { + background-color: #858585; + color: white !important; +} + +.button-orange { + background-color: #FF8400 !important; +} + +.button-orange:hover { + background-color: #FFA647 !important; +} + +.button-blue { + background-color: #0099FF !important; +} + +.button-blue:hover { + background-color: #33ADFF !important; +} + +.button-off { + background-color: aquamarine !important; + color: black !important; +} + +.button-khaki { + background-color: khaki !important; + color: black !important; +} + +.calc-history-eq { + color: #B0B0B0; + cursor: pointer; +} + +#container { + width: 600px; + background-color: #2E2E2E; + height: 100%; + border-radius: 10px; + margin-top: 4%; +} + +#expression { + height: 60px; + margin-bottom: 20px; + padding: 10px; + text-align: right; + background-color: #636363; + border-radius: 5px; + font-size: 30px; + box-shadow: 0px 5px 10px #444444 inset; +} + +#standard-buttons { + display: inline-block; + margin-left: -20px; + margin-bottom: 10px; +} + +#advanced-buttons { + display: inline-block; + display: none; + margin-left: -20px; +} + +#toggle-advanced:hover { + background-color: #858585 !important; +} + +#toggle-advanced span { + pointer-events: none; +} + +#calc-history { + float: right; + width: 200px; + height: 270px; + background-color: #636363; + border-radius: 5px; + margin-top: 6px; + padding: 10px; + box-shadow: 0px 5px 10px #444444 inset; + overflow:auto; + font-size:18px; +} + +#calc-history-box { + width: 180px !important; + height: 220px !important; + resize: none; + overflow: auto; + font-size:18px; +} + +#calc-history hr { + margin-top: 5px; + margin-bottom: 5px; +} + +#footer { + background-color: #262626; + margin-left: -15px; + margin-right: -15px; + margin-bottom: -15px; + margin-top: 15px; + padding: 10px; + padding-bottom: 1px; + color: #636363; + border-bottom-left-radius: 10px; + border-bottom-right-radius: 10px; +} diff --git a/marathi/LICENSE b/marathi/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/marathi/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + 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. + + + Copyright (C) + + 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 . + +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: + + Copyright (C) + 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 +. + + 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 +. diff --git a/marathi/README.md b/marathi/README.md new file mode 100644 index 0000000..5cee341 --- /dev/null +++ b/marathi/README.md @@ -0,0 +1 @@ +# voice-acct-local \ No newline at end of file diff --git a/marathi/index.html b/marathi/index.html new file mode 100755 index 0000000..1e28ede --- /dev/null +++ b/marathi/index.html @@ -0,0 +1,243 @@ + + + + + + + + + + + + + + Voice Accounting + + + + + + + + + +
+
+

Voice Accounting

+
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ Accounting History +
+
+ + + +
+
+
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+
+ +
+
+ +
+
+ +
+
+ +
+
+ +
+
+
+ +

Hint: Just Type from the Numeric Keypad itself &
Also Adjust Speaker Volume to the desired level.

Can attach a USB Keyboard with Numeric Keypad as well.

Pressing esc key will now clear the input field fully.
Pressing Backspace key will clear input, one by one.

For typing Plus & Multiply Signs from Main Keyboard, use Shift+Plus (twice) & Shift+Multiply(twice), the second key is repeated twice here.

+ + +
+ + + + + + + + + + + + + + + + + + + + + + diff --git a/marathi/moment-with-locales.min.js b/marathi/moment-with-locales.min.js new file mode 100755 index 0000000..8a6c9b4 --- /dev/null +++ b/marathi/moment-with-locales.min.js @@ -0,0 +1,2 @@ +!function(e,a){"object"==typeof exports&&"undefined"!=typeof module?module.exports=a():"function"==typeof define&&define.amd?define(a):e.moment=a()}(this,function(){"use strict";var E;function c(){return E.apply(null,arguments)}function F(e){return e instanceof Array||"[object Array]"===Object.prototype.toString.call(e)}function z(e){return null!=e&&"[object Object]"===Object.prototype.toString.call(e)}function l(e,a){return Object.prototype.hasOwnProperty.call(e,a)}function N(e){if(Object.getOwnPropertyNames)return 0===Object.getOwnPropertyNames(e).length;for(var a in e)if(l(e,a))return;return 1}function L(e){return void 0===e}function J(e){return"number"==typeof e||"[object Number]"===Object.prototype.toString.call(e)}function R(e){return e instanceof Date||"[object Date]"===Object.prototype.toString.call(e)}function C(e,a){for(var t=[],s=e.length,n=0;n>>0,s=0;sFe(e)?(r=e+1,a-Fe(e)):(r=e,a);return{year:r,dayOfYear:t}}function aa(e,a,t){var s,n,r=Xe(e.year(),a,t),r=Math.floor((e.dayOfYear()-r-1)/7)+1;return r<1?s=r+ta(n=e.year()-1,a,t):r>ta(e.year(),a,t)?(s=r-ta(e.year(),a,t),n=e.year()+1):(n=e.year(),s=r),{week:s,year:n}}function ta(e,a,t){var s=Xe(e,a,t),a=Xe(e+1,a,t);return(Fe(e)-s+a)/7}s("w",["ww",2],"wo","week"),s("W",["WW",2],"Wo","isoWeek"),h("w",r,u),h("ww",r,a),h("W",r,u),h("WW",r,a),Se(["w","ww","W","WW"],function(e,a,t,s){a[s.substr(0,1)]=f(e)});function sa(e,a){return e.slice(a,7).concat(e.slice(0,a))}s("d",0,"do","day"),s("dd",0,0,function(e){return this.localeData().weekdaysMin(this,e)}),s("ddd",0,0,function(e){return this.localeData().weekdaysShort(this,e)}),s("dddd",0,0,function(e){return this.localeData().weekdays(this,e)}),s("e",0,0,"weekday"),s("E",0,0,"isoWeekday"),h("d",r),h("e",r),h("E",r),h("dd",function(e,a){return a.weekdaysMinRegex(e)}),h("ddd",function(e,a){return a.weekdaysShortRegex(e)}),h("dddd",function(e,a){return a.weekdaysRegex(e)}),Se(["dd","ddd","dddd"],function(e,a,t,s){s=t._locale.weekdaysParse(e,s,t._strict);null!=s?a.d=s:Y(t).invalidWeekday=e}),Se(["d","e","E"],function(e,a,t,s){a[s]=f(e)});var na="Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"),ra="Sun_Mon_Tue_Wed_Thu_Fri_Sat".split("_"),da="Su_Mo_Tu_We_Th_Fr_Sa".split("_"),_a=m,ia=m,oa=m;function ma(){function e(e,a){return a.length-e.length}for(var a,t,s,n=[],r=[],d=[],_=[],i=0;i<7;i++)s=U([2e3,1]).day(i),a=we(this.weekdaysMin(s,"")),t=we(this.weekdaysShort(s,"")),s=we(this.weekdays(s,"")),n.push(a),r.push(t),d.push(s),_.push(a),_.push(t),_.push(s);n.sort(e),r.sort(e),d.sort(e),_.sort(e),this._weekdaysRegex=new RegExp("^("+_.join("|")+")","i"),this._weekdaysShortRegex=this._weekdaysRegex,this._weekdaysMinRegex=this._weekdaysRegex,this._weekdaysStrictRegex=new RegExp("^("+d.join("|")+")","i"),this._weekdaysShortStrictRegex=new RegExp("^("+r.join("|")+")","i"),this._weekdaysMinStrictRegex=new RegExp("^("+n.join("|")+")","i")}function ua(){return this.hours()%12||12}function la(e,a){s(e,0,0,function(){return this.localeData().meridiem(this.hours(),this.minutes(),a)})}function Ma(e,a){return a._meridiemParse}s("H",["HH",2],0,"hour"),s("h",["hh",2],0,ua),s("k",["kk",2],0,function(){return this.hours()||24}),s("hmm",0,0,function(){return""+ua.apply(this)+de(this.minutes(),2)}),s("hmmss",0,0,function(){return""+ua.apply(this)+de(this.minutes(),2)+de(this.seconds(),2)}),s("Hmm",0,0,function(){return""+this.hours()+de(this.minutes(),2)}),s("Hmmss",0,0,function(){return""+this.hours()+de(this.minutes(),2)+de(this.seconds(),2)}),la("a",!0),la("A",!1),h("a",Ma),h("A",Ma),h("H",r,M),h("h",r,u),h("k",r,u),h("HH",r,a),h("hh",r,a),h("kk",r,a),h("hmm",ye),h("hmmss",_),h("Hmm",ye),h("Hmmss",_),k(["H","HH"],D),k(["k","kk"],function(e,a,t){e=f(e);a[D]=24===e?0:e}),k(["a","A"],function(e,a,t){t._isPm=t._locale.isPM(e),t._meridiem=e}),k(["h","hh"],function(e,a,t){a[D]=f(e),Y(t).bigHour=!0}),k("hmm",function(e,a,t){var s=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s)),Y(t).bigHour=!0}),k("hmmss",function(e,a,t){var s=e.length-4,n=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s,2)),a[Oe]=f(e.substr(n)),Y(t).bigHour=!0}),k("Hmm",function(e,a,t){var s=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s))}),k("Hmmss",function(e,a,t){var s=e.length-4,n=e.length-2;a[D]=f(e.substr(0,s)),a[Pe]=f(e.substr(s,2)),a[Oe]=f(e.substr(n))});m=Ne("Hours",!0);var ha,ca={calendar:{sameDay:"[Today at] LT",nextDay:"[Tomorrow at] LT",nextWeek:"dddd [at] LT",lastDay:"[Yesterday at] LT",lastWeek:"[Last] dddd [at] LT",sameElse:"L"},longDateFormat:{LTS:"h:mm:ss A",LT:"h:mm A",L:"MM/DD/YYYY",LL:"MMMM D, YYYY",LLL:"MMMM D, YYYY h:mm A",LLLL:"dddd, MMMM D, YYYY h:mm A"},invalidDate:"Invalid date",ordinal:"%d",dayOfMonthOrdinalParse:/\d{1,2}/,relativeTime:{future:"in %s",past:"%s ago",s:"a few seconds",ss:"%d seconds",m:"a minute",mm:"%d minutes",h:"an hour",hh:"%d hours",d:"a day",dd:"%d days",w:"a week",ww:"%d weeks",M:"a month",MM:"%d months",y:"a year",yy:"%d years"},months:Ie,monthsShort:Ue,week:{dow:0,doy:6},weekdays:na,weekdaysMin:da,weekdaysShort:ra,meridiemParse:/[ap]\.?m?\.?/i},g={},La={};function Ya(e){return e&&e.toLowerCase().replace("_","-")}function ya(e){for(var a,t,s,n,r=0;r=a&&function(e,a){for(var t=Math.min(e.length,a.length),s=0;s=a-1)break;a--}r++}return ha}function fa(a){var e,t;if(void 0===g[a]&&"undefined"!=typeof module&&module&&module.exports&&(t=a)&&t.match("^[^/\\\\]*$"))try{e=ha._abbr,require("./locale/"+a),ka(e)}catch(e){g[a]=null}return g[a]}function ka(e,a){return e&&((a=L(a)?Da(e):pa(e,a))?ha=a:"undefined"!=typeof console&&console.warn&&console.warn("Locale "+e+" not found. Did you forget to load it?")),ha._abbr}function pa(e,a){if(null===a)return delete g[e],null;var t,s=ca;if(a.abbr=e,null!=g[e])ae("defineLocaleOverride","use moment.updateLocale(localeName, config) to change an existing locale. moment.defineLocale(localeName, config) should only be used for creating a new locale See http://momentjs.com/guides/#/warnings/define-locale/ for more info."),s=g[e]._config;else if(null!=a.parentLocale)if(null!=g[a.parentLocale])s=g[a.parentLocale]._config;else{if(null==(t=fa(a.parentLocale)))return La[a.parentLocale]||(La[a.parentLocale]=[]),La[a.parentLocale].push({name:e,config:a}),null;s=t._config}return g[e]=new ne(se(s,a)),La[e]&&La[e].forEach(function(e){pa(e.name,e.config)}),ka(e),g[e]}function Da(e){var a;if(!(e=e&&e._locale&&e._locale._abbr?e._locale._abbr:e))return ha;if(!F(e)){if(a=fa(e))return a;e=[e]}return ya(e)}function Ta(e){var a=e._a;return a&&-2===Y(e).overflow&&(a=a[je]<0||11Ce(a[p],a[je])?xe:a[D]<0||24ta(r,i,o)?Y(s)._overflowWeeks=!0:null!=m?Y(s)._overflowWeekday=!0:(u=ea(r,d,_,i,o),s._a[p]=u.year,s._dayOfYear=u.dayOfYear)),null!=e._dayOfYear&&(n=Aa(e._a[p],t[p]),(e._dayOfYear>Fe(n)||0===e._dayOfYear)&&(Y(e)._overflowDayOfYear=!0),m=Qe(n,0,e._dayOfYear),e._a[je]=m.getUTCMonth(),e._a[xe]=m.getUTCDate()),a=0;a<3&&null==e._a[a];++a)e._a[a]=l[a]=t[a];for(;a<7;a++)e._a[a]=l[a]=null==e._a[a]?2===a?1:0:e._a[a];24===e._a[D]&&0===e._a[Pe]&&0===e._a[Oe]&&0===e._a[We]&&(e._nextDay=!0,e._a[D]=0),e._d=(e._useUTC?Qe:$e).apply(null,l),r=e._useUTC?e._d.getUTCDay():e._d.getDay(),null!=e._tzm&&e._d.setUTCMinutes(e._d.getUTCMinutes()-e._tzm),e._nextDay&&(e._a[D]=24),e._w&&void 0!==e._w.d&&e._w.d!==r&&(Y(e).weekdayMismatch=!0)}}function Fa(e){if(e._f===c.ISO_8601)Pa(e);else if(e._f===c.RFC_2822)Wa(e);else{e._a=[],Y(e).empty=!0;for(var a,t,s,n,r,d=""+e._i,_=d.length,i=0,o=le(e._f,e._locale).match(_e)||[],m=o.length,u=0;ue.valueOf():e.valueOf()"}),u.toJSON=function(){return this.isValid()?this.toISOString():null},u.toString=function(){return this.clone().locale("en").format("ddd MMM DD YYYY HH:mm:ss [GMT]ZZ")},u.unix=function(){return Math.floor(this.valueOf()/1e3)},u.valueOf=function(){return this._d.valueOf()-6e4*(this._offset||0)},u.creationData=function(){return{input:this._i,format:this._f,locale:this._locale,isUTC:this._isUTC,strict:this._strict}},u.eraName=function(){for(var e,a=this.localeData().eras(),t=0,s=a.length;tthis.clone().month(0).utcOffset()||this.utcOffset()>this.clone().month(5).utcOffset()},u.isLocal=function(){return!!this.isValid()&&!this._isUTC},u.isUtcOffset=function(){return!!this.isValid()&&this._isUTC},u.isUtc=Za,u.isUTC=Za,u.zoneAbbr=function(){return this._isUTC?"UTC":""},u.zoneName=function(){return this._isUTC?"Coordinated Universal Time":""},u.dates=e("dates accessor is deprecated. Use date instead.",i),u.months=e("months accessor is deprecated. Use month instead",Ke),u.years=e("years accessor is deprecated. Use year instead",ze),u.zone=e("moment().zone is deprecated, use moment().utcOffset instead. http://momentjs.com/guides/#/warnings/zone/",function(e,a){return null!=e?(this.utcOffset(e="string"!=typeof e?-e:e,a),this):-this.utcOffset()}),u.isDSTShifted=e("isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information",function(){var e,a;return L(this._isDSTShifted)&&(Z(e={},this),(e=za(e))._a?(a=(e._isUTC?U:w)(e._a),this._isDSTShifted=this.isValid()&&0 + + \ No newline at end of file diff --git a/marathi/playdigits.js b/marathi/playdigits.js new file mode 100644 index 0000000..8df0364 --- /dev/null +++ b/marathi/playdigits.js @@ -0,0 +1,29 @@ +function doFunction(){ + +// console.log(Array.from([1, 2, 3], (x) => x + '.mp3')); + + // Create an array of audio file URLs + // const audioFiles = ['audio1.mp3', 'audio2.mp3', 'audio3.mp3']; + + const audioFiles = Array.from(testi.toString().replaceAll('.', '_'), (x) => 'region/' + x + '.mp3') + + // Create an array to store audio elements + const audioElements = []; + + // Create audio elements for each audio file and store them in the array + audioFiles.forEach(file => { + const audio = new Audio(file); + audioElements.push(audio); + }); + + // Play the first audio file + audioElements[0].play(); + + // Use the onended event of each audio element to play the next one + for (let i = 0; i < audioElements.length - 1; i++) { + audioElements[i].onended = () => { + audioElements[i + 1].play(); + }; + } + +} diff --git a/marathi/region/1.mp3 b/marathi/region/1.mp3 new file mode 100644 index 0000000..3bb96a9 Binary files /dev/null and b/marathi/region/1.mp3 differ diff --git a/marathi/region/10.mp3 b/marathi/region/10.mp3 new file mode 100644 index 0000000..a110740 Binary files /dev/null and b/marathi/region/10.mp3 differ diff --git a/marathi/region/11.mp3 b/marathi/region/11.mp3 new file mode 100644 index 0000000..42b745d Binary files /dev/null and b/marathi/region/11.mp3 differ diff --git a/marathi/region/12.mp3 b/marathi/region/12.mp3 new file mode 100644 index 0000000..052dd94 Binary files /dev/null and b/marathi/region/12.mp3 differ diff --git a/marathi/region/13.mp3 b/marathi/region/13.mp3 new file mode 100644 index 0000000..5407745 Binary files /dev/null and b/marathi/region/13.mp3 differ diff --git a/marathi/region/14.mp3 b/marathi/region/14.mp3 new file mode 100644 index 0000000..48228a6 Binary files /dev/null and b/marathi/region/14.mp3 differ diff --git a/marathi/region/15.mp3 b/marathi/region/15.mp3 new file mode 100644 index 0000000..5822a14 Binary files /dev/null and b/marathi/region/15.mp3 differ diff --git a/marathi/region/16.mp3 b/marathi/region/16.mp3 new file mode 100644 index 0000000..f0fb129 Binary files /dev/null and b/marathi/region/16.mp3 differ diff --git a/marathi/region/17.mp3 b/marathi/region/17.mp3 new file mode 100644 index 0000000..71110f6 Binary files /dev/null and b/marathi/region/17.mp3 differ diff --git a/marathi/region/18.mp3 b/marathi/region/18.mp3 new file mode 100644 index 0000000..36ceb54 Binary files /dev/null and b/marathi/region/18.mp3 differ diff --git a/marathi/region/19.mp3 b/marathi/region/19.mp3 new file mode 100644 index 0000000..940ecea Binary files /dev/null and b/marathi/region/19.mp3 differ diff --git a/marathi/region/2.mp3 b/marathi/region/2.mp3 new file mode 100644 index 0000000..e4bc899 Binary files /dev/null and b/marathi/region/2.mp3 differ diff --git a/marathi/region/20.mp3 b/marathi/region/20.mp3 new file mode 100644 index 0000000..a75e579 Binary files /dev/null and b/marathi/region/20.mp3 differ diff --git a/marathi/region/21.mp3 b/marathi/region/21.mp3 new file mode 100644 index 0000000..ba6ae57 Binary files /dev/null and b/marathi/region/21.mp3 differ diff --git a/marathi/region/3.mp3 b/marathi/region/3.mp3 new file mode 100644 index 0000000..369487a Binary files /dev/null and b/marathi/region/3.mp3 differ diff --git a/marathi/region/4.mp3 b/marathi/region/4.mp3 new file mode 100644 index 0000000..969ea5a Binary files /dev/null and b/marathi/region/4.mp3 differ diff --git a/marathi/region/5.mp3 b/marathi/region/5.mp3 new file mode 100644 index 0000000..520cace Binary files /dev/null and b/marathi/region/5.mp3 differ diff --git a/marathi/region/6.mp3 b/marathi/region/6.mp3 new file mode 100644 index 0000000..b0846be Binary files /dev/null and b/marathi/region/6.mp3 differ diff --git a/marathi/region/7.mp3 b/marathi/region/7.mp3 new file mode 100644 index 0000000..57d799d Binary files /dev/null and b/marathi/region/7.mp3 differ diff --git a/marathi/region/8.mp3 b/marathi/region/8.mp3 new file mode 100644 index 0000000..c6e6a25 Binary files /dev/null and b/marathi/region/8.mp3 differ diff --git a/marathi/region/9.mp3 b/marathi/region/9.mp3 new file mode 100644 index 0000000..59786f3 Binary files /dev/null and b/marathi/region/9.mp3 differ diff --git a/marathi/script.js b/marathi/script.js new file mode 100755 index 0000000..1faaf07 --- /dev/null +++ b/marathi/script.js @@ -0,0 +1,649 @@ +var filemaps = { +'-': '1', +'`': '2', +'.': '2', +'=': '3', +'0': '4', +'1': '5', +'2': '6', +'3': '7', +'4': '8', +'5': '9', +'6': '10', +'7': '11', +'8': '12', +'9': '13', +'Backspace': '14', +'/': '15', +'Escape': '16', +'Enter': '17', +'*': '18', +'Clear': '19', +'+': '20', +'R': '21' +} + +// filemaps[date] + + +function doFunction(testxi){ + +// console.log(Array.from([1, 2, 3], (x) => x + '.mp3')); + + // Create an array of audio file URLs + // const audioFiles = ['audio1.mp3', 'audio2.mp3', 'audio3.mp3']; + + const audioFiles = Array.from(testxi.toString().replaceAll('.', '`'), (x) => 'region/' + filemaps[x] + '.mp3') + + // Create an array to store audio elements + const audioElements = []; + + // Create audio elements for each audio file and store them in the array + audioFiles.forEach(file => { + const audio = new Audio(file); + audioElements.push(audio); + }); + + // Play the first audio file + audioElements[0].play(); + + let j=(Number(audioElements.length.toString()) - 1); + + console.log('j equals : '+j); + + // Use the onended event of each audio element to play the next one + for (let i = 0; i < audioElements.length - 1; i++) { + audioElements[i].onended = () => { + audioElements[i + 1].play(); + + console.log('i equals : ' + i); + console.log('audio elements equals : ' + Number(audioElements.length - 1).toString() ) + + console.log('j equals : '+j); + if ( i == (Number(j) - 1) ) { + + setTimeout(function () { + console.log('Hi') + location.reload(); +}, 1000) + +} + + // if ( i == 4 ) location.reload(); + }; + + } + +} + + +function roundDown(number, decimals) { + decimals = decimals || 0; + return ( Math.floor( number * Math.pow(10, decimals) ) / Math.pow(10, decimals) ); +} + + +var myContent=""; + +/* +function myLoad() { + var myContent = localStorage.getItem("myContent"); + console.log(myContent); + document.getElementById("calc-history-box").innerHTML = myContent; + } +*/ + +// Get reference to the "canvas" +var can = document.getElementById("calc-history-box"); + +// Save the content of the canvas to localStorage +function saveData(){ + localStorage.setItem("canvas", can.innerHTML); +} + +// Get localStorage data +function restoreData(){ + can.innerHTML = localStorage.getItem("canvas"); +} + +$(document).ready(function() { + +restoreData(); + + // A database of the symbols and functions of every operand. Order of operators determines precedence. + var operators = [ + { + id: "op-power", + numOperands: 2, + symbol: " ^ ", + calc: function(a, b) { + return Math.pow(a, b); + } + }, + { + id: "op-negate", + numOperands: 1, + symbol: " -", + calc: function(a) { + return -a; + } + }, + { + id: "op-square-root", + numOperands: 1, + symbol: " √", + calc: function(a) { + return Math.sqrt(a); + } + }, + { + id: "op-log", + numOperands: 1, + symbol: " log ", + calc: function(a) { + return Math.log10(a); + } + }, + { + id: "op-natural-log", + numOperands: 1, + symbol: " ln ", + calc: function(a) { + return Math.log(a); + } + }, + { + id: "op-sin", + numOperands: 1, + symbol: " sin ", + calc: function(a) { + return Math.sin(a); + } + }, + { + id: "op-cos", + numOperands: 1, + symbol: " cos ", + calc: function(a) { + return Math.cos(a); + } + }, + { + id: "op-tan", + numOperands: 1, + symbol: " tan ", + calc: function(a) { + return Math.tan(a); + } + }, + { + id: "op-inverse-sin", + numOperands: 1, + symbol: " sin-1 ", + calc: function(a) { + return Math.asin(a); + } + }, + { + id: "op-inverse-cos", + numOperands: 1, + symbol: " cos-1 ", + calc: function(a) { + return Math.acos(a); + } + }, + { + id: "op-inverse-tan", + numOperands: 1, + symbol: " tan-1 ", + calc: function(a) { + return Math.atan(a); + } + }, + { + id: "op-e", + numOperands: 1, + symbol: " e ^ ", + calc: function(a) { + return Math.exp(a); + } + }, + { + id: "op-nth-root", + numOperands: 2, + symbol: "*√", + calc: function(a, b) { + return Math.pow(b, 1/a); + } + }, + { + id: "op-multiply", + numOperands: 2, + symbol: " x ", + calc: function(a, b) { + return a * b; + } + }, + { + id: "op-divide", + numOperands: 2, + symbol: " ÷ ", + calc: function(a, b) { + return a / b; + } + }, + { + id: "op-add", + numOperands: 2, + symbol: " + ", + calc: function(a, b) { + return a + b; + } + }, + { + id: "op-subtract", + numOperands: 2, + symbol: " - ", + calc: function(a, b) { + return a - b; + } + } + ]; + + // The number of places to round to + const roundPlaces = 2; + + // Get the operator object for a given operator ID + function getOperator(opID) { + for(var i = 0; i < operators.length; i++) { + if(operators[i].id === opID) { + return operators[i]; + } + } + return undefined; + } + + // Get the precedence of an operator given its ID + function getOpPrecedence(opID) { + for(var i = 0; i < operators.length; i++) { + if(operators[i].id === opID) { + return i; + } + } + + // If the given ID does not return an operator, then return a large value that will always lose in precedence + return 1000; + } + + // Returns true if op1 ID has equal or higher precedence than op2 ID, false otherwise + function hasPrecedence(op1, op2) { + if(getOperator(op1) != undefined) { + return getOpPrecedence(op1) <= getOpPrecedence(op2); + } + } + + // Converts the given radian value to degrees + function toDegrees(radians) { + return radians * (180 / Math.PI); + } + + // Converts the given degrees value to radians + function toRadians(degrees) { + return degrees * (Math.PI / 180); + } + + // A list of every token (number or operator) currently in the expression + var tokenList = []; + + // A list of previous results and expressions in the form {out: output, expression: expression string, tokens: list of tokens in the expression} + var calcHistory = []; + + // Evaluates the expression and outputs the result + function calculate() { + // Check if brackets are balanced + var count = 0; + for(var i = 0; i < tokenList.length; i++) { + if(tokenList[i] === "bracket-left") { + count++; + } else if(tokenList[i] === "bracket-right") { + count--; + } + } + if(count != 0) { + output("Error: unbalanced brackets"); + return; + } + + // Evaluate the expression using a modified version of the shunting yard algorithm + var valStack = []; + var opStack = []; + + for(var i = 0; i < tokenList.length; i++) { + if(!isNaN(tokenList[i])) { + valStack.push(tokenList[i]); + } else if(tokenList[i] === "num-pi") { + valStack.push(Math.PI); + } else if(tokenList[i] === "bracket-left") { + opStack.push(tokenList[i]); + } else if(tokenList[i] === "bracket-right") { + while(opStack[opStack.length - 1] !== "bracket-left") { + var operator = getOperator(opStack.pop()); + if(operator.numOperands === 1) + valStack.push(applyOperator(operator, [valStack.pop()])); + else + valStack.push(applyOperator(operator, [valStack.pop(), valStack.pop()])); + } + opStack.pop(); + } else { + while(opStack.length > 0 && hasPrecedence(opStack[opStack.length - 1], tokenList[i])) { + var operator = getOperator(opStack.pop()); + if(operator.numOperands === 1) + valStack.push(applyOperator(operator, [valStack.pop()])); + else + valStack.push(applyOperator(operator, [valStack.pop(), valStack.pop()])); + } + opStack.push(tokenList[i]); + } + } + + while(opStack.length > 0) { + var operator = getOperator(opStack.pop()); + if(operator.numOperands === 1) + valStack.push(applyOperator(operator, [valStack.pop()])); + else + valStack.push(applyOperator(operator, [valStack.pop(), valStack.pop()])); + } + + // Output the calculated result and the original expression + output(valStack[0], $("#expression").html(), tokenList); + } + + // Returns the result of applying the given unary or binary operator on the top values of the value stack + function applyOperator(operator, vals) { + var valA = vals[0]; + var result; + + if(vals.length === 1) { + result = operator.calc(parseFloat(valA)); + } else { + var valB = vals[1]; + result = operator.calc(parseFloat(valB), parseFloat(valA)); + } + + return result; + } + + var textii = ""; + var testi = ""; + + // Updates the equation and calc history with the given output + function output(out, expression, tokens) { + out = +out.toFixed(roundPlaces); + $("#expression").html(out.toString()); + + calcHistory.push({out: out, expression: expression, tokens: tokens}); + // $("#calc-history-box").html(""); + for(var i = calcHistory.length - 1; i >= 0; i--) { + $("#calc-history-box").prepend("

" + moment().format('llll') + "

" + "

" + calcHistory[i].expression + "

= " + calcHistory[i].out + "

"); + + textii = calcHistory[i].out; + let textvi = calcHistory[i].out.toString(); + textiv="1248.64"; + console.log(textvi); + testi="="+textvi+"R"+textvi; + // testi=textvi; + console.log(testi); + // responsiveVoice.speak(textvi,'UK English Female', parameters); + // responsiveVoice.speak(" I Repeat. ",'UK English Female', parameters); + // responsiveVoice.speak( testi.toString(), 'UK English Female', {rate: 0.95, onend: () => location.reload()}); + doFunction(testi); + } + } + + // Adds a token to the token list and updates the display + function addToken(token) { + if(isNaN(token)) { + if((token === "bracket-left" || token === "num-pi") && !isNaN(tokenList[tokenList.length - 1])) { + tokenList.push("op-multiply"); + } + tokenList.push(token); + } else { + if(!isNaN(tokenList[tokenList.length - 1])) { + tokenList[tokenList.length - 1] = tokenList[tokenList.length - 1] + token; + } else { + if(!isNaN(token) && (tokenList[tokenList.length - 1] === "bracket-right" || tokenList[tokenList.length - 1] === "num-pi")) { + tokenList.push("op-multiply"); + } + tokenList.push(token); + } + } + + displayEquation(); + } + + // Updates the expression display's HTML + function displayEquation() { + var htmlString = ""; + for(var i = 0; i < tokenList.length; i++) { + if(isNaN(tokenList[i])) { + if(tokenList[i] === "bracket-left") { + htmlString += " ("; + } else if(tokenList[i] === "bracket-right") { + htmlString += ") "; + } else if(tokenList[i] === "num-pi") { + htmlString += " π "; + } else { + htmlString += getOperator(tokenList[i]).symbol; + } + } else { + htmlString += tokenList[i]; + } + } + $("#expression").html(htmlString); + } + + // Deletes the last entered token + function deleteLast() { + if(isNaN(tokenList[tokenList.length - 1])) { + tokenList.pop(); + } else { + tokenList[tokenList.length - 1] = tokenList[tokenList.length - 1].slice(0, -1); + if(tokenList[tokenList.length -1].length === 0) { + tokenList.pop(); + } + } + + displayEquation(); + } + + // Shows/hides the advanced operators panel + function toggleAdvanced() { + $("#advanced-buttons").toggle(); + if($("#advanced-buttons").is(":visible")) { + $("#toggle-advanced").removeClass("button-off"); + $("#toggle-advanced span").removeClass("glyphicon-triangle-bottom").addClass("glyphicon-triangle-top"); + } else { + $("#toggle-advanced").addClass("button-off"); + $("#toggle-advanced span").removeClass("glyphicon-triangle-top").addClass("glyphicon-triangle-bottom"); + } + } + + // Triggers the appropriate action for each button that can be pressed + function processButton(button) { + switch($(button).attr("id")) { + case "delete": + deleteLast(); + break; + case "clear": + if(tokenList.length === 0) { + // calcHistory.length = 0; + // $("#calc-history-box").html(""); + } else { + tokenList.length = 0; + displayEquation(); + } + break; + case "period": + if(isNaN(tokenList[tokenList.length - 1])) { + addToken("0."); + } else { + if(tokenList[tokenList.length - 1].indexOf(".") === -1) { + tokenList[tokenList.length - 1] += "."; + } + } + displayEquation(); + break; + case "equals": + calculate(); + break; + case "toggle-advanced": + toggleAdvanced(); + break; + case "num-pi": + addToken("num-pi"); + break; + default: + if($(button).hasClass("num")) { + addToken($(button).html()); + } else { + addToken($(button).attr("id")); + } + } + } + + // Catches all button clicks on the page + + $(".btn").off('click').click(function(event) { + event.stopPropagation(); + event.stopImmediatePropagation(); + $(event.target).blur(); + // console.log("i am called"); + processButton(event.target); + return false; + }); + + $(document).on("click", ".calc-history-eq", function(event) { + var tokens = calcHistory[parseInt($(event.target).attr("id").substring(2))].tokens; + console.log(parseInt($(event.target).attr("id").substring(2))); + console.log(calcHistory); + console.log(tokens); + tokenList = tokens; + displayEquation(); + }); + +}); + +/* +function mySave() { + myContent += document.getElementById("calc-history-box").innerHTML; + console.log(myContent); + localStorage.setItem("myContent", myContent); + // console.log('History Saved'); + } +*/ + +function speak() { +// $('#61')[0].play(); +console.log('i am called'); +document.getElementById('13').play(); +} + +var down = false; + + document.addEventListener("keydown", (e) => { + + if(down) return; + down = true; + +var keyPressed = window.event.keyCode; +var shiftPressed = window.event.shiftKey; + + +if (e.key !== "Enter" && typeof filemaps[e.key] !== 'undefined') { +// console.log(filemaps[e.key]); +var myaudio = new Audio('region/' + filemaps[e.key] + '.mp3'); +myaudio.play(); +} + +// console.log(e.key); + +if (e.key >= 0 && e.key <= 9) { + event.preventDefault(); + e.stopPropagation(); + // document.getElementById(filemaps[e.key]).play(); + document.getElementById("num-" + e.key).click(); + return false; +} else if (e.key == "Enter" || e.key == "=") { + event.preventDefault(); + // document.getElementById('61').play(); + // speak(); + // document.getElementById('13').play(); + + // var speech = new SpeechSynthesisUtterance("hello world"); + // Window.speechSynthesis.speak(speech); + + // document.getElementById('=').play(); + document.getElementById("equals").click(); + saveData(); + // window.location.reload(); + // document.getElementById("clear").click(); + +/* + document.onkeydown = function (e) { + return false; +} + + setTimeout(function() { + // Do something after 5 seconds + location.reload();//reload page + +document.onkeydown = function (e) { + return true; +} + +}, 10000); +*/ + + +} else if (e.key == ".") { + event.preventDefault(); + // document.getElementById(filemaps['`']).play(); + document.getElementById("period").click(); +} else if (e.key == "+") { + event.preventDefault(); + // document.getElementById(filemaps['P']).play(); + document.getElementById("op-add").click(); +} else if (event.keyCode == 16 && keyPressed == 43) { + event.preventDefault(); + // document.getElementById(filemaps['P']).play(); + document.getElementById("op-add").click(); +} else if (e.key == "-") { + event.preventDefault(); + // document.getElementById(filemaps['-']).play(); + document.getElementById("op-subtract").click(); +} else if (e.key == "*") { + event.preventDefault(); + // document.getElementById(filemaps['MU']).play(); + document.getElementById("op-multiply").click(); +} else if (e.key == "/") { + event.preventDefault(); + // document.getElementById(filemaps['D']).play(); + document.getElementById("op-divide").click(); +} else if (e.key == "Backspace") { + event.preventDefault(); + // document.getElementById(filemaps['B']).play(); + document.getElementById("delete").click(); +} else if (e.key == "Escape") { + event.preventDefault(); + // document.getElementById(filemaps['E']).play(); + document.getElementById("clear").click(); +} else if (event.keyCode == 12) { + event.preventDefault(); + // document.getElementById(filemaps['NL']).play(); + // document.getElementById("clear").click(); +} +}, false); + +document.addEventListener('keyup', function () { + down = false; +}, false); diff --git a/marathi/style.css b/marathi/style.css new file mode 100755 index 0000000..3331338 --- /dev/null +++ b/marathi/style.css @@ -0,0 +1,146 @@ +body { + background-color: #121212; + color: white; +} + +h1 { + margin-bottom: 20px; + text-align: center; +} + +.btn { + box-shadow: 0px 5px 10px #222222; + font-size:18px; +} + +.btn:focus { + outline: none; +} + +.button-row div { + width: 60px; + height: 60px; + text-align: center; + line-height: 60px; + margin: 5px; +} + +.button-row .btn { + width: 60px; + height: 60px; + background-color: #636363; +} + +.button-row .btn:hover { + background-color: #858585; + color: white !important; +} + +.button-orange { + background-color: #FF8400 !important; +} + +.button-orange:hover { + background-color: #FFA647 !important; +} + +.button-blue { + background-color: #0099FF !important; +} + +.button-blue:hover { + background-color: #33ADFF !important; +} + +.button-off { + background-color: aquamarine !important; + color: black !important; +} + +.button-khaki { + background-color: khaki !important; + color: black !important; +} + +.calc-history-eq { + color: #B0B0B0; + cursor: pointer; +} + +#container { + width: 600px; + background-color: #2E2E2E; + height: 100%; + border-radius: 10px; + margin-top: 4%; +} + +#expression { + height: 60px; + margin-bottom: 20px; + padding: 10px; + text-align: right; + background-color: #636363; + border-radius: 5px; + font-size: 30px; + box-shadow: 0px 5px 10px #444444 inset; +} + +#standard-buttons { + display: inline-block; + margin-left: -20px; + margin-bottom: 10px; +} + +#advanced-buttons { + display: inline-block; + display: none; + margin-left: -20px; +} + +#toggle-advanced:hover { + background-color: #858585 !important; +} + +#toggle-advanced span { + pointer-events: none; +} + +#calc-history { + float: right; + width: 200px; + height: 270px; + background-color: #636363; + border-radius: 5px; + margin-top: 6px; + padding: 10px; + box-shadow: 0px 5px 10px #444444 inset; + overflow:auto; + font-size:18px; +} + +#calc-history-box { + width: 180px !important; + height: 220px !important; + resize: none; + overflow: auto; + font-size:18px; +} + +#calc-history hr { + margin-top: 5px; + margin-bottom: 5px; +} + +#footer { + background-color: #262626; + margin-left: -15px; + margin-right: -15px; + margin-bottom: -15px; + margin-top: 15px; + padding: 10px; + padding-bottom: 1px; + color: #636363; + border-bottom-left-radius: 10px; + border-bottom-right-radius: 10px; +}