diff --git a/math/fibonacci/main.c b/c/math/fibonacci/main.c similarity index 72% rename from math/fibonacci/main.c rename to c/math/fibonacci/main.c index 3a56a67..ea3a2bc 100644 --- a/math/fibonacci/main.c +++ b/c/math/fibonacci/main.c @@ -21,32 +21,32 @@ void f_fibonacci(int v_i) { - long long int v_fibonacci[v_i]; - int i; - v_fibonacci[0]=0; - v_fibonacci[1]=1; - for (i=-1;i\n", program_name); - exit(1); - } -int main(int argc, char *argv[]) + exit(1); +} +void main(int argc, char *argv[]) { if(argc == 2) { - int fibonacci = atoi(argv[1]); - f_fibonacci(fibonacci); + int fibonacci = atoi(argv[1]); + f_fibonacci(fibonacci); } else { - usage(argv[0]); + usage(argv[0]); } } diff --git a/c/math/fraction2float/main.c b/c/math/fraction2float/main.c new file mode 100644 index 0000000..c0c0de6 --- /dev/null +++ b/c/math/fraction2float/main.c @@ -0,0 +1,83 @@ +/* This program calculates a float out of a fraction. + Copyright (C) 2012 Fabian Nedoluha + + 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 . +*/ + +#include +#include + +long double fraction2float(int num, int denum) +{ + long double result; + + result = (float)num/denum; + return(result); +} + +int get_longest(int num, int denum) +{ + int longest,i; + + for(i=1;num>10;i++) + { + num=num/10; + } + longest = i; + for(i=1;denum>10;i++) + { + denum=denum/10; + } + if(longest \n", program_name); + exit(1); +} + +void main(int argc, char *argv[]) +{ + if(argc == 3) + { + int num, denum; + + num = atoi(argv[1]); + denum = atoi(argv[2]); + print_fraction(num, denum, get_longest(num, denum)); + printf(" = %Lf\n", fraction2float(num, denum)); + exit(0); + } + else + { + usage(argv[0]); + } +} diff --git a/math/herons method/main.c b/c/math/herons method/main.c similarity index 100% rename from math/herons method/main.c rename to c/math/herons method/main.c diff --git a/gpl-3.0.txt b/gpl-3.0.txt new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/gpl-3.0.txt @@ -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/python/curses/pong/animated_ball.py b/python/curses/pong/animated_ball.py new file mode 100755 index 0000000..4d5e29c --- /dev/null +++ b/python/curses/pong/animated_ball.py @@ -0,0 +1,69 @@ +#!/usr/bin/env python +# coding: utf-8 + +# import classes +import curses +import time + +# initialize +stdscr = curses.initscr() + +# getch non-blocking +stdscr.nodelay(1) + +# disable echoing +curses.noecho() + +# react to keys instantly +curses.cbreak() + +# also to special keys +stdscr.keypad(1) + +# color +curses.start_color() +curses.init_pair(1, curses.COLOR_GREEN, curses.COLOR_BLUE) +curses.init_pair(2, curses.COLOR_YELLOW, curses.COLOR_BLACK) + +# get terminal size +size = stdscr.getmaxyx() +size_x = size[1] +size_y = size[0] + +# bit/ball +bit_begin_x = int(size_x / 2 - 1) +bit_begin_y = int(size_y / 2 - 3) +bit_height = 1 +bit_width = 2 +bit_move_x = -1 +bit_move_y = 2 +bit_win = curses.newwin(bit_height, bit_width, bit_begin_y, bit_begin_x) + +speed = 0.1 + +while True: + curses.doupdate() + time.sleep(speed) + if (bit_begin_x + bit_move_x < 0) | (bit_begin_x + bit_move_x > size_x - 2): + bit_move_x = bit_move_x * -1 + curses.beep() + if (bit_begin_y + bit_move_y < 0) | (bit_begin_y + bit_move_y > size_y - 1): + bit_move_y = bit_move_y * -1 + curses.beep() + bit_begin_x = bit_begin_x + bit_move_x + bit_begin_y = bit_begin_y + bit_move_y + bit_win.mvwin(int(bit_begin_y), int(bit_begin_x)) + c = stdscr.getch() + if c == ord('q'): + # close application + curses.nocbreak() + stdscr.keypad(0) + curses.echo() + + # end it + curses.endwin() + exit() + stdscr.bkgd(curses.color_pair(1)) + bit_win.bkgd(curses.color_pair(2)) + stdscr.noutrefresh() + bit_win.noutrefresh() diff --git a/python/curses/pong/pong.py b/python/curses/pong/pong.py new file mode 100755 index 0000000..cb5bddc --- /dev/null +++ b/python/curses/pong/pong.py @@ -0,0 +1,235 @@ +#!/usr/bin/env python +# coding: utf-8 + +""" +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 . + +Copyright (C) 2013 Fabian Nedoluha +""" + +# import classes +import curses +import time + +# initialize +stdscr = curses.initscr() + +# getch non-blocking +stdscr.nodelay(1) + +# disable echoing +curses.noecho() + +# react to keys instantly +curses.cbreak() + +# also to special keys +stdscr.keypad(1) + +# color +curses.start_color() +curses.init_pair(1, curses.COLOR_GREEN, curses.COLOR_BLUE) +curses.init_pair(2, curses.COLOR_YELLOW, curses.COLOR_BLACK) + +# get terminal size +size = stdscr.getmaxyx() +size_x = size[1] +size_y = size[0] + +# scores +pl1_score = 0 +pl2_score = 0 + +scores_begin_x = 0 +scores_begin_y = int(size_y - 5) +scores_height = 5 +scores_width = int(size_x) +scores_win = curses.newwin(scores_height, scores_width, scores_begin_y, scores_begin_x) + +# make player1 +pl1_begin_x = 2 +pl1_begin_y = int(size_y / 2 - 5) +pl1_height = 6 +pl1_width = 3 +pl1_win = curses.newwin(pl1_height, pl1_width, pl1_begin_y, pl1_begin_x) + +# make player2 +pl2_begin_x = size_x - 5 +pl2_begin_y = int(size_y / 2 - 5) +pl2_height = 6 +pl2_width = 3 +pl2_win = curses.newwin(pl2_height, pl2_width, pl2_begin_y, pl2_begin_x) + +# bit/ball +bit_begin_x = int(size_x / 2 - 1) +bit_begin_y = int(size_y / 2 - 3) +bit_height = 1 +bit_width = 2 +bit_move_x = -1 +bit_move_y = 0 +bit_win = curses.newwin(bit_height, bit_width, bit_begin_y, bit_begin_x) + +# help +hlp_begin_x = int(size_x / 2 - 28) +hlp_begin_y = int(size_y - 4) +hlp_height = 4 +hlp_width = 56 +hlp_win = curses.newwin(hlp_height, hlp_width, hlp_begin_y, hlp_begin_x) +hlp_win.addstr(0,0, 'A:\tPlayer 1 up') +hlp_win.addstr(1,0, 'Z:\tPlayer 1 down') +hlp_win.addstr(2,0, 'Q:\tQuit') +hlp_win.addstr(0,34, 'Up:\tPlayer 2 up') +hlp_win.addstr(1,34, 'Down:\tPlayer 2 down') +hlp_win.addstr(2,34, 'P:\tPause') + +# game logic +while True: + + # update screen + curses.doupdate() + + # game tick + time.sleep(0.02) + + # bounce on top & bottom + if (bit_begin_y + bit_move_y < 0) | (bit_begin_y + bit_move_y > size_y - 6): + bit_move_y *= -1 + + # collusion with pl1 + if (bit_begin_x + bit_move_x < 5): + if (bit_begin_y + bit_move_y > pl1_begin_y - 1) & (bit_begin_y + bit_move_y < pl1_begin_y + pl1_height): + # change direction + bit_move_x *= - 1 + + # angle + bit_diff = bit_begin_y - pl1_begin_y + if bit_diff == 0: + bit_move_y -= 0.5 + elif bit_diff == 1: + bit_move_y -= 0.3 + elif bit_diff == 2: + bit_move_y -= 0.1 + elif bit_diff == 3: + bit_move_y += 0.1 + elif bit_diff == 4: + bit_move_y += 0.3 + elif bit_diff == 5: + bit_move_y += 0.5 + # hit? + elif (bit_begin_x + bit_move_x < 0): + pl2_score += 1 + curses.beep() + time.sleep(0.5) + bit_begin_x = int(size_x / 2 - 1) + bit_begin_y = int(size_y / 2 - 3) + bit_move_x = -1 + bit_move_y = 0 + + # collusion with pl2, comments == # collusion with pl1 + if (bit_begin_x + bit_move_x > size_x - 7): + if (bit_begin_y + bit_move_y > pl2_begin_y - 1) & (bit_begin_y + bit_move_y < pl2_begin_y + pl2_height): + bit_move_x *= - 1 + bit_diff = bit_begin_y - pl1_begin_y + if bit_diff == 0: + bit_move_y -= 0.5 + elif bit_diff == 1: + bit_move_y -= 0.3 + elif bit_diff == 2: + bit_move_y -= 0.1 + elif bit_diff == 3: + bit_move_y += 0.1 + elif bit_diff == 4: + bit_move_y += 0.3 + elif bit_diff == 5: + bit_move_y += 0.5 + elif (bit_begin_x + bit_move_x > size_x - 2): + pl1_score += 1 + curses.beep() + time.sleep(0.5) + bit_begin_x = int(size_x / 2 - 1) + bit_begin_y = int(size_y / 2 - 3) + bit_move_x = 1 + bit_move_y = 0 + + # update ball + bit_begin_x = bit_begin_x + bit_move_x + bit_begin_y = bit_begin_y + bit_move_y + bit_win.mvwin(int(bit_begin_y), int(bit_begin_x)) + + # player input + c = stdscr.getch() + if c == ord('z'): + # move pl1 down + if pl1_begin_y < size_y - 11: + pl1_begin_y = pl1_begin_y + 1 + pl1_win.mvwin(pl1_begin_y, pl1_begin_x) + elif c == ord('a'): + # move pl1 up + if pl1_begin_y > 0: + pl1_begin_y = pl1_begin_y - 1 + pl1_win.mvwin(pl1_begin_y, pl1_begin_x) + elif c == curses.KEY_DOWN: + # move pl2 down + if pl2_begin_y < size_y -11: + pl2_begin_y = pl2_begin_y + 1 + pl2_win.mvwin(pl2_begin_y, pl2_begin_x) + elif c == curses.KEY_UP: + # move pl2 up + if pl2_begin_y > 0: + pl2_begin_y = pl2_begin_y - 1 + pl2_win.mvwin(pl2_begin_y, pl2_begin_x) + elif c == ord('p'): + # pause + stdscr.nodelay(0) + while True: + c = stdscr.getch() + if c == ord('p'): + stdscr.nodelay(1) + break; + elif c == ord('q'): + # close application + curses.nocbreak() + stdscr.keypad(0) + curses.echo() + + # end it + curses.endwin() + exit() + if c == ord('p'): + stdscr.nodelay(1) + + elif c == ord('q'): + # close application + curses.nocbreak() + stdscr.keypad(0) + curses.echo() + + # end it + curses.endwin() + exit() + # update most & write score + stdscr.bkgd(curses.color_pair(1)) + bit_win.bkgd(curses.color_pair(2)) + scores_win.bkgd(curses.color_pair(2)) + pl1_win.bkgd(curses.color_pair(2)) + pl2_win.bkgd(curses.color_pair(2)) + hlp_win.bkgd(curses.color_pair(2)) + stdscr.noutrefresh() + bit_win.noutrefresh() + pl1_win.noutrefresh() + pl2_win.noutrefresh() + scores_win.noutrefresh() + hlp_win.noutrefresh() + scores_win.addstr(1, 1, 'score: ' + str(pl1_score)) + scores_win.addstr(1, int(size_x - 10), 'score: ' + str(pl2_score)) diff --git a/python/from web/life.py b/python/from web/life.py new file mode 100644 index 0000000..98fb62e --- /dev/null +++ b/python/from web/life.py @@ -0,0 +1,216 @@ +#!/usr/bin/env python +# life.py -- A curses-based version of Conway's Game of Life. +# Contributed by AMK +# +# An empty board will be displayed, and the following commands are available: +# E : Erase the board +# R : Fill the board randomly +# S : Step for a single generation +# C : Update continuously until a key is struck +# Q : Quit +# Cursor keys : Move the cursor around the board +# Space or Enter : Toggle the contents of the cursor's position +# +# TODO : +# Support the mouse +# Use colour if available +# Make board updates faster +# + +import random, string, traceback +import curses + +class LifeBoard: + """Encapsulates a Life board + + Attributes: + X,Y : horizontal and vertical size of the board + state : dictionary mapping (x,y) to 0 or 1 + + Methods: + display(update_board) -- If update_board is true, compute the + next generation. Then display the state + of the board and refresh the screen. + erase() -- clear the entire board + makeRandom() -- fill the board randomly + set(y,x) -- set the given cell to Live; doesn't refresh the screen + toggle(y,x) -- change the given cell from live to dead, or vice + versa, and refresh the screen display + + """ + def __init__(self, scr, char=ord('*')): + """Create a new LifeBoard instance. + + scr -- curses screen object to use for display + char -- character used to render live cells (default: '*') + """ + self.state = {} + self.scr = scr + Y, X = self.scr.getmaxyx() + self.X, self.Y = X-2, Y-2-1 + self.char = char + self.scr.clear() + + # Draw a border around the board + border_line = '+'+(self.X*'-')+'+' + self.scr.addstr(0, 0, border_line) + self.scr.addstr(self.Y+1,0, border_line) + for y in range(0, self.Y): + self.scr.addstr(1+y, 0, '|') + self.scr.addstr(1+y, self.X+1, '|') + self.scr.refresh() + + def set(self, y, x): + """Set a cell to the live state""" + if x<0 or self.X<=x or y<0 or self.Y<=y: + raise ValueError, "Coordinates out of range %i,%i"% (y,x) + self.state[x,y] = 1 + + def toggle(self, y, x): + """Toggle a cell's state between live and dead""" + if x<0 or self.X<=x or y<0 or self.Y<=y: + raise ValueError, "Coordinates out of range %i,%i"% (y,x) + if self.state.has_key( (x,y) ): + del self.state[x,y] + self.scr.addch(y+1, x+1, ' ') + else: + self.state[x,y] = 1 + self.scr.addch(y+1, x+1, self.char) + self.scr.refresh() + + def erase(self): + """Clear the entire board and update the board display""" + self.state = {} + self.display(update_board=False) + + def display(self, update_board=True): + """Display the whole board, optionally computing one generation""" + M,N = self.X, self.Y + if not update_board: + for i in range(0, M): + for j in range(0, N): + if self.state.has_key( (i,j) ): + self.scr.addch(j+1, i+1, self.char) + else: + self.scr.addch(j+1, i+1, ' ') + self.scr.refresh() + return + + d = {} + self.boring = 1 + for i in range(0, M): + L = range( max(0, i-1), min(M, i+2) ) + for j in range(0, N): + s = 0 + live = self.state.has_key( (i,j) ) + for k in range( max(0, j-1), min(N, j+2) ): + for l in L: + if self.state.has_key( (l,k) ): + s += 1 + s -= live + if s == 3: + # Birth + d[i,j] = 1 + self.scr.addch(j+1, i+1, self.char) + if not live: self.boring = 0 + elif s == 2 and live: d[i,j] = 1 # Survival + elif live: + # Death + self.scr.addch(j+1, i+1, ' ') + self.boring = 0 + self.state = d + self.scr.refresh() + + def makeRandom(self): + "Fill the board with a random pattern" + self.state = {} + for i in range(0, self.X): + for j in range(0, self.Y): + if random.random() > 0.5: + self.set(j,i) + + +def erase_menu(stdscr, menu_y): + "Clear the space where the menu resides" + stdscr.move(menu_y, 0) + stdscr.clrtoeol() + stdscr.move(menu_y+1, 0) + stdscr.clrtoeol() + +def display_menu(stdscr, menu_y): + "Display the menu of possible keystroke commands" + erase_menu(stdscr, menu_y) + stdscr.addstr(menu_y, 4, + 'Use the cursor keys to move, and space or Enter to toggle a cell.') + stdscr.addstr(menu_y+1, 4, + 'E)rase the board, R)andom fill, S)tep once or C)ontinuously, Q)uit') + +def keyloop(stdscr): + # Clear the screen and display the menu of keys + stdscr.clear() + stdscr_y, stdscr_x = stdscr.getmaxyx() + menu_y = (stdscr_y-3)-1 + display_menu(stdscr, menu_y) + + # Allocate a subwindow for the Life board and create the board object + subwin = stdscr.subwin(stdscr_y-3, stdscr_x, 0, 0) + board = LifeBoard(subwin, char=ord('*')) + board.display(update_board=False) + + # xpos, ypos are the cursor's position + xpos, ypos = board.X//2, board.Y//2 + + # Main loop: + while (1): + stdscr.move(1+ypos, 1+xpos) # Move the cursor + c = stdscr.getch() # Get a keystroke + if 00: ypos -= 1 + elif c == curses.KEY_DOWN and ypos0: xpos -= 1 + elif c == curses.KEY_RIGHT and xpos", "LAST"] + + stdscr.refresh() + + for y in range(0, curses.LINES - 1): + for x in range(0, curses.COLS): + stdscr.addstr("%d" % ((y + x) % 10)) + for y in range(0, 1): + p1 = mkpanel(curses.COLOR_RED, + curses.LINES // 2 - 2, + curses.COLS // 8 + 1, + 0, + 0) + p1.set_userptr("p1") + + p2 = mkpanel(curses.COLOR_GREEN, + curses.LINES // 2 + 1, + curses.COLS // 7, + curses.LINES // 4, + curses.COLS // 10) + p2.set_userptr("p2") + + p3 = mkpanel(curses.COLOR_YELLOW, + curses.LINES // 4, + curses.COLS // 10, + curses.LINES // 2, + curses.COLS // 9) + p3.set_userptr("p3") + + p4 = mkpanel(curses.COLOR_BLUE, + curses.LINES // 2 - 2, + curses.COLS // 8, + curses.LINES // 2 - 2, + curses.COLS // 3) + p4.set_userptr("p4") + + p5 = mkpanel(curses.COLOR_MAGENTA, + curses.LINES // 2 - 2, + curses.COLS // 8, + curses.LINES // 2, + curses.COLS // 2 - 2) + p5.set_userptr("p5") + + fill_panel(p1) + fill_panel(p2) + fill_panel(p3) + fill_panel(p4) + fill_panel(p5) + p4.hide() + p5.hide() + pflush() + saywhat("press any key to continue") + wait_a_while() + + saywhat("h3 s1 s2 s4 s5;press any key to continue") + p1.move(0, 0) + p3.hide() + p1.show() + p2.show() + p4.show() + p5.show() + pflush() + wait_a_while() + + saywhat("s1; press any key to continue") + p1.show() + pflush() + wait_a_while() + + saywhat("s2; press any key to continue") + p2.show() + pflush() + wait_a_while() + + saywhat("m2; press any key to continue") + p2.move(curses.LINES // 3 + 1, curses.COLS // 8) + pflush() + wait_a_while() + + saywhat("s3; press any key to continue") + p3.show() + pflush() + wait_a_while() + + saywhat("m3; press any key to continue") + p3.move(curses.LINES // 4 + 1, curses.COLS // 15) + pflush() + wait_a_while() + + saywhat("b3; press any key to continue") + p3.bottom() + pflush() + wait_a_while() + + saywhat("s4; press any key to continue") + p4.show() + pflush() + wait_a_while() + + saywhat("s5; press any key to continue") + p5.show() + pflush() + wait_a_while() + + saywhat("t3; press any key to continue") + p3.top() + pflush() + wait_a_while() + + saywhat("t1; press any key to continue") + p1.show() + pflush() + wait_a_while() + + saywhat("t2; press any key to continue") + p2.show() + pflush() + wait_a_while() + + saywhat("t3; press any key to continue") + p3.show() + pflush() + wait_a_while() + + saywhat("t4; press any key to continue") + p4.show() + pflush() + wait_a_while() + + for itmp in range(0, 6): + w4 = p4.window() + w5 = p5.window() + + saywhat("m4; press any key to continue") + w4.move(curses.LINES // 8, 1) + w4.addstr(mod[itmp]) + p4.move(curses.LINES // 6, itmp * curses.COLS // 8) + w5.move(curses.LINES // 6, 1) + w5.addstr(mod[itmp]) + pflush() + wait_a_while() + + saywhat("m5; press any key to continue") + w4.move(curses.LINES // 6, 1) + w4.addstr(mod[itmp]) + p5.move(curses.LINES // 3 - 1, itmp * 10 + 6) + w5.move(curses.LINES // 8, 1) + w5.addstr(mod[itmp]) + pflush() + wait_a_while() + + saywhat("m4; press any key to continue") + p4.move(curses.LINES // 6, (itmp + 1) * curses.COLS // 8) + pflush() + wait_a_while() + + saywhat("t5; press any key to continue") + p5.top() + pflush() + wait_a_while() + + saywhat("t2; press any key to continue") + p2.top() + pflush() + wait_a_while() + + saywhat("t1; press any key to continue") + p1.top() + pflush() + wait_a_while() + + saywhat("d2; press any key to continue") + del p2 + pflush() + wait_a_while() + + saywhat("h3; press any key to continue") + p3.hide() + pflush() + wait_a_while() + + saywhat("d1; press any key to continue") + del p1 + pflush() + wait_a_while() + + saywhat("d4; press any key to continue") + del p4 + pflush() + wait_a_while() + + saywhat("d5; press any key to continue") + del p5 + pflush() + wait_a_while() + if nap_msec == 1: + break + nap_msec = 100 + +# +# one fine day there'll be the menu at this place +# +curses.wrapper(demo_panels) diff --git a/python/from web/rain.py b/python/from web/rain.py new file mode 100644 index 0000000..9d46e6e --- /dev/null +++ b/python/from web/rain.py @@ -0,0 +1,94 @@ +#!/usr/bin/env python +# +# $Id$ +# +# somebody should probably check the randrange()s... + +import curses +from random import randrange + +def next_j(j): + if j == 0: + j = 4 + else: + j -= 1 + + if curses.has_colors(): + z = randrange(0, 3) + color = curses.color_pair(z) + if z: + color = color | curses.A_BOLD + stdscr.attrset(color) + + return j + +def main(win): + # we know that the first argument from curses.wrapper() is stdscr. + # Initialize it globally for convenience. + global stdscr + stdscr = win + + if curses.has_colors(): + bg = curses.COLOR_BLACK + curses.init_pair(1, curses.COLOR_BLUE, bg) + curses.init_pair(2, curses.COLOR_CYAN, bg) + + curses.nl() + curses.noecho() + # XXX curs_set() always returns ERR + # curses.curs_set(0) + stdscr.timeout(0) + + c = curses.COLS - 4 + r = curses.LINES - 4 + xpos = [0] * c + ypos = [0] * r + for j in range(4, -1, -1): + xpos[j] = randrange(0, c) + 2 + ypos[j] = randrange(0, r) + 2 + + j = 0 + while True: + x = randrange(0, c) + 2 + y = randrange(0, r) + 2 + + stdscr.addch(y, x, ord('.')) + + stdscr.addch(ypos[j], xpos[j], ord('o')) + + j = next_j(j) + stdscr.addch(ypos[j], xpos[j], ord('O')) + + j = next_j(j) + stdscr.addch( ypos[j] - 1, xpos[j], ord('-')) + stdscr.addstr(ypos[j], xpos[j] - 1, "|.|") + stdscr.addch( ypos[j] + 1, xpos[j], ord('-')) + + j = next_j(j) + stdscr.addch( ypos[j] - 2, xpos[j], ord('-')) + stdscr.addstr(ypos[j] - 1, xpos[j] - 1, "/ \\") + stdscr.addstr(ypos[j], xpos[j] - 2, "| O |") + stdscr.addstr(ypos[j] + 1, xpos[j] - 1, "\\ /") + stdscr.addch( ypos[j] + 2, xpos[j], ord('-')) + + j = next_j(j) + stdscr.addch( ypos[j] - 2, xpos[j], ord(' ')) + stdscr.addstr(ypos[j] - 1, xpos[j] - 1, " ") + stdscr.addstr(ypos[j], xpos[j] - 2, " ") + stdscr.addstr(ypos[j] + 1, xpos[j] - 1, " ") + stdscr.addch( ypos[j] + 2, xpos[j], ord(' ')) + + xpos[j] = x + ypos[j] = y + + ch = stdscr.getch() + if ch == ord('q') or ch == ord('Q'): + return + elif ch == ord('s'): + stdscr.nodelay(0) + elif ch == ord(' '): + stdscr.nodelay(1) + + curses.napms(50) + +curses.wrapper(main) diff --git a/python/from web/repeat.py b/python/from web/repeat.py new file mode 100644 index 0000000..fa7daac --- /dev/null +++ b/python/from web/repeat.py @@ -0,0 +1,58 @@ +#! /usr/bin/env python + +"""repeat + +This simple program repeatedly (at 1-second intervals) executes the +shell command given on the command line and displays the output (or as +much of it as fits on the screen). It uses curses to paint each new +output on top of the old output, so that if nothing changes, the +screen doesn't change. This is handy to watch for changes in e.g. a +directory or process listing. + +To end, hit Control-C. +""" + +# Author: Guido van Rossum + +# Disclaimer: there's a Linux program named 'watch' that does the same +# thing. Honestly, I didn't know of its existence when I wrote this! + +# To do: add features until it has the same functionality as watch(1); +# then compare code size and development time. + +import os +import sys +import time +import curses + +def main(): + if not sys.argv[1:]: + print __doc__ + sys.exit(0) + cmd = " ".join(sys.argv[1:]) + p = os.popen(cmd, "r") + text = p.read() + sts = p.close() + if sts: + print >>sys.stderr, "Exit code:", sts + sys.exit(sts) + w = curses.initscr() + try: + while True: + w.erase() + try: + w.addstr(text) + except curses.error: + pass + w.refresh() + time.sleep(1) + p = os.popen(cmd, "r") + text = p.read() + sts = p.close() + if sts: + print >>sys.stderr, "Exit code:", sts + sys.exit(sts) + finally: + curses.endwin() + +main() diff --git a/python/from web/tclock.py b/python/from web/tclock.py new file mode 100644 index 0000000..8058d9a --- /dev/null +++ b/python/from web/tclock.py @@ -0,0 +1,147 @@ +#!/usr/bin/env python +# +# $Id$ +# +# From tclock.c, Copyright Howard Jones , September 1994. + +from math import * +import curses, time + +ASPECT = 2.2 + +def sign(_x): + if _x < 0: return -1 + return 1 + +def A2XY(angle, radius): + return (int(round(ASPECT * radius * sin(angle))), + int(round(radius * cos(angle)))) + +def plot(x, y, col): + stdscr.addch(y, x, col) + +# draw a diagonal line using Bresenham's algorithm +def dline(pair, from_x, from_y, x2, y2, ch): + if curses.has_colors(): + stdscr.attrset(curses.color_pair(pair)) + + dx = x2 - from_x + dy = y2 - from_y + + ax = abs(dx * 2) + ay = abs(dy * 2) + + sx = sign(dx) + sy = sign(dy) + + x = from_x + y = from_y + + if ax > ay: + d = ay - ax // 2 + + while True: + plot(x, y, ch) + if x == x2: + return + + if d >= 0: + y += sy + d -= ax + x += sx + d += ay + else: + d = ax - ay // 2 + + while True: + plot(x, y, ch) + if y == y2: + return + + if d >= 0: + x += sx + d -= ay + y += sy + d += ax + +def main(win): + global stdscr + stdscr = win + + lastbeep = -1 + my_bg = curses.COLOR_BLACK + + stdscr.nodelay(1) + stdscr.timeout(0) +# curses.curs_set(0) + if curses.has_colors(): + curses.init_pair(1, curses.COLOR_RED, my_bg) + curses.init_pair(2, curses.COLOR_MAGENTA, my_bg) + curses.init_pair(3, curses.COLOR_GREEN, my_bg) + + cx = (curses.COLS - 1) // 2 + cy = curses.LINES // 2 + ch = min( cy-1, int(cx // ASPECT) - 1) + mradius = (3 * ch) // 4 + hradius = ch // 2 + sradius = 5 * ch // 6 + + for i in range(0, 12): + sangle = (i + 1) * 2.0 * pi / 12.0 + sdx, sdy = A2XY(sangle, sradius) + + stdscr.addstr(cy - sdy, cx + sdx, "%d" % (i + 1)) + + stdscr.addstr(0, 0, + "ASCII Clock by Howard Jones , 1994") + + sradius = max(sradius-4, 8) + + while True: + curses.napms(1000) + + tim = time.time() + t = time.localtime(tim) + + hours = t[3] + t[4] / 60.0 + if hours > 12.0: + hours -= 12.0 + + mangle = t[4] * 2 * pi / 60.0 + mdx, mdy = A2XY(mangle, mradius) + + hangle = hours * 2 * pi / 12.0 + hdx, hdy = A2XY(hangle, hradius) + + sangle = t[5] * 2 * pi / 60.0 + sdx, sdy = A2XY(sangle, sradius) + + dline(3, cx, cy, cx + mdx, cy - mdy, ord('#')) + + stdscr.attrset(curses.A_REVERSE) + dline(2, cx, cy, cx + hdx, cy - hdy, ord('.')) + stdscr.attroff(curses.A_REVERSE) + + if curses.has_colors(): + stdscr.attrset(curses.color_pair(1)) + + plot(cx + sdx, cy - sdy, ord('O')) + + if curses.has_colors(): + stdscr.attrset(curses.color_pair(0)) + + stdscr.addstr(curses.LINES - 2, 0, time.ctime(tim)) + stdscr.refresh() + if (t[5] % 5) == 0 and t[5] != lastbeep: + lastbeep = t[5] + curses.beep() + + ch = stdscr.getch() + if ch == ord('q'): + return 0 + + plot(cx + sdx, cy - sdy, ord(' ')) + dline(0, cx, cy, cx + hdx, cy - hdy, ord(' ')) + dline(0, cx, cy, cx + mdx, cy - mdy, ord(' ')) + +curses.wrapper(main) diff --git a/python/from web/xmas.py b/python/from web/xmas.py new file mode 100644 index 0000000..349b3a8 --- /dev/null +++ b/python/from web/xmas.py @@ -0,0 +1,906 @@ +# asciixmas +# December 1989 Larry Bartz Indianapolis, IN +# +# $Id$ +# +# I'm dreaming of an ascii character-based monochrome Christmas, +# Just like the ones I used to know! +# Via a full duplex communications channel, +# At 9600 bits per second, +# Even though it's kinda slow. +# +# I'm dreaming of an ascii character-based monochrome Christmas, +# With ev'ry C program I write! +# May your screen be merry and bright! +# And may all your Christmases be amber or green, +# (for reduced eyestrain and improved visibility)! +# +# +# Notes on the Python version: +# I used a couple of `try...except curses.error' to get around some functions +# returning ERR. The errors come from using wrapping functions to fill +# windows to the last character cell. The C version doesn't have this problem, +# it simply ignores any return values. +# + +import curses +import sys + +FROMWHO = "Thomas Gellekum " + +def set_color(win, color): + if curses.has_colors(): + n = color + 1 + curses.init_pair(n, color, my_bg) + win.attroff(curses.A_COLOR) + win.attron(curses.color_pair(n)) + +def unset_color(win): + if curses.has_colors(): + win.attrset(curses.color_pair(0)) + +def look_out(msecs): + curses.napms(msecs) + if stdscr.getch() != -1: + curses.beep() + sys.exit(0) + +def boxit(): + for y in range(0, 20): + stdscr.addch(y, 7, ord('|')) + + for x in range(8, 80): + stdscr.addch(19, x, ord('_')) + + for x in range(0, 80): + stdscr.addch(22, x, ord('_')) + + return + +def seas(): + stdscr.addch(4, 1, ord('S')) + stdscr.addch(6, 1, ord('E')) + stdscr.addch(8, 1, ord('A')) + stdscr.addch(10, 1, ord('S')) + stdscr.addch(12, 1, ord('O')) + stdscr.addch(14, 1, ord('N')) + stdscr.addch(16, 1, ord("'")) + stdscr.addch(18, 1, ord('S')) + + return + +def greet(): + stdscr.addch(3, 5, ord('G')) + stdscr.addch(5, 5, ord('R')) + stdscr.addch(7, 5, ord('E')) + stdscr.addch(9, 5, ord('E')) + stdscr.addch(11, 5, ord('T')) + stdscr.addch(13, 5, ord('I')) + stdscr.addch(15, 5, ord('N')) + stdscr.addch(17, 5, ord('G')) + stdscr.addch(19, 5, ord('S')) + + return + +def fromwho(): + stdscr.addstr(21, 13, FROMWHO) + return + +def tree(): + set_color(treescrn, curses.COLOR_GREEN) + treescrn.addch(1, 11, ord('/')) + treescrn.addch(2, 11, ord('/')) + treescrn.addch(3, 10, ord('/')) + treescrn.addch(4, 9, ord('/')) + treescrn.addch(5, 9, ord('/')) + treescrn.addch(6, 8, ord('/')) + treescrn.addch(7, 7, ord('/')) + treescrn.addch(8, 6, ord('/')) + treescrn.addch(9, 6, ord('/')) + treescrn.addch(10, 5, ord('/')) + treescrn.addch(11, 3, ord('/')) + treescrn.addch(12, 2, ord('/')) + + treescrn.addch(1, 13, ord('\\')) + treescrn.addch(2, 13, ord('\\')) + treescrn.addch(3, 14, ord('\\')) + treescrn.addch(4, 15, ord('\\')) + treescrn.addch(5, 15, ord('\\')) + treescrn.addch(6, 16, ord('\\')) + treescrn.addch(7, 17, ord('\\')) + treescrn.addch(8, 18, ord('\\')) + treescrn.addch(9, 18, ord('\\')) + treescrn.addch(10, 19, ord('\\')) + treescrn.addch(11, 21, ord('\\')) + treescrn.addch(12, 22, ord('\\')) + + treescrn.addch(4, 10, ord('_')) + treescrn.addch(4, 14, ord('_')) + treescrn.addch(8, 7, ord('_')) + treescrn.addch(8, 17, ord('_')) + + treescrn.addstr(13, 0, "//////////// \\\\\\\\\\\\\\\\\\\\\\\\") + + treescrn.addstr(14, 11, "| |") + treescrn.addstr(15, 11, "|_|") + + unset_color(treescrn) + treescrn.refresh() + w_del_msg.refresh() + + return + +def balls(): + treescrn.overlay(treescrn2) + + set_color(treescrn2, curses.COLOR_BLUE) + treescrn2.addch(3, 9, ord('@')) + treescrn2.addch(3, 15, ord('@')) + treescrn2.addch(4, 8, ord('@')) + treescrn2.addch(4, 16, ord('@')) + treescrn2.addch(5, 7, ord('@')) + treescrn2.addch(5, 17, ord('@')) + treescrn2.addch(7, 6, ord('@')) + treescrn2.addch(7, 18, ord('@')) + treescrn2.addch(8, 5, ord('@')) + treescrn2.addch(8, 19, ord('@')) + treescrn2.addch(10, 4, ord('@')) + treescrn2.addch(10, 20, ord('@')) + treescrn2.addch(11, 2, ord('@')) + treescrn2.addch(11, 22, ord('@')) + treescrn2.addch(12, 1, ord('@')) + treescrn2.addch(12, 23, ord('@')) + + unset_color(treescrn2) + treescrn2.refresh() + w_del_msg.refresh() + return + +def star(): + treescrn2.attrset(curses.A_BOLD | curses.A_BLINK) + set_color(treescrn2, curses.COLOR_YELLOW) + + treescrn2.addch(0, 12, ord('*')) + treescrn2.standend() + + unset_color(treescrn2) + treescrn2.refresh() + w_del_msg.refresh() + return + +def strng1(): + treescrn2.attrset(curses.A_BOLD | curses.A_BLINK) + set_color(treescrn2, curses.COLOR_WHITE) + + treescrn2.addch(3, 13, ord('\'')) + treescrn2.addch(3, 12, ord(':')) + treescrn2.addch(3, 11, ord('.')) + + treescrn2.attroff(curses.A_BOLD | curses.A_BLINK) + unset_color(treescrn2) + + treescrn2.refresh() + w_del_msg.refresh() + return + +def strng2(): + treescrn2.attrset(curses.A_BOLD | curses.A_BLINK) + set_color(treescrn2, curses.COLOR_WHITE) + + treescrn2.addch(5, 14, ord('\'')) + treescrn2.addch(5, 13, ord(':')) + treescrn2.addch(5, 12, ord('.')) + treescrn2.addch(5, 11, ord(',')) + treescrn2.addch(6, 10, ord('\'')) + treescrn2.addch(6, 9, ord(':')) + + treescrn2.attroff(curses.A_BOLD | curses.A_BLINK) + unset_color(treescrn2) + + treescrn2.refresh() + w_del_msg.refresh() + return + +def strng3(): + treescrn2.attrset(curses.A_BOLD | curses.A_BLINK) + set_color(treescrn2, curses.COLOR_WHITE) + + treescrn2.addch(7, 16, ord('\'')) + treescrn2.addch(7, 15, ord(':')) + treescrn2.addch(7, 14, ord('.')) + treescrn2.addch(7, 13, ord(',')) + treescrn2.addch(8, 12, ord('\'')) + treescrn2.addch(8, 11, ord(':')) + treescrn2.addch(8, 10, ord('.')) + treescrn2.addch(8, 9, ord(',')) + + treescrn2.attroff(curses.A_BOLD | curses.A_BLINK) + unset_color(treescrn2) + + treescrn2.refresh() + w_del_msg.refresh() + return + +def strng4(): + treescrn2.attrset(curses.A_BOLD | curses.A_BLINK) + set_color(treescrn2, curses.COLOR_WHITE) + + treescrn2.addch(9, 17, ord('\'')) + treescrn2.addch(9, 16, ord(':')) + treescrn2.addch(9, 15, ord('.')) + treescrn2.addch(9, 14, ord(',')) + treescrn2.addch(10, 13, ord('\'')) + treescrn2.addch(10, 12, ord(':')) + treescrn2.addch(10, 11, ord('.')) + treescrn2.addch(10, 10, ord(',')) + treescrn2.addch(11, 9, ord('\'')) + treescrn2.addch(11, 8, ord(':')) + treescrn2.addch(11, 7, ord('.')) + treescrn2.addch(11, 6, ord(',')) + treescrn2.addch(12, 5, ord('\'')) + + treescrn2.attroff(curses.A_BOLD | curses.A_BLINK) + unset_color(treescrn2) + + treescrn2.refresh() + w_del_msg.refresh() + return + +def strng5(): + treescrn2.attrset(curses.A_BOLD | curses.A_BLINK) + set_color(treescrn2, curses.COLOR_WHITE) + + treescrn2.addch(11, 19, ord('\'')) + treescrn2.addch(11, 18, ord(':')) + treescrn2.addch(11, 17, ord('.')) + treescrn2.addch(11, 16, ord(',')) + treescrn2.addch(12, 15, ord('\'')) + treescrn2.addch(12, 14, ord(':')) + treescrn2.addch(12, 13, ord('.')) + treescrn2.addch(12, 12, ord(',')) + + treescrn2.attroff(curses.A_BOLD | curses.A_BLINK) + unset_color(treescrn2) + + # save a fully lit tree + treescrn2.overlay(treescrn) + + treescrn2.refresh() + w_del_msg.refresh() + return + +def blinkit(): + treescrn8.touchwin() + + for cycle in range(5): + if cycle == 0: + treescrn3.overlay(treescrn8) + treescrn8.refresh() + w_del_msg.refresh() + break + elif cycle == 1: + treescrn4.overlay(treescrn8) + treescrn8.refresh() + w_del_msg.refresh() + break + elif cycle == 2: + treescrn5.overlay(treescrn8) + treescrn8.refresh() + w_del_msg.refresh() + break + elif cycle == 3: + treescrn6.overlay(treescrn8) + treescrn8.refresh() + w_del_msg.refresh() + break + elif cycle == 4: + treescrn7.overlay(treescrn8) + treescrn8.refresh() + w_del_msg.refresh() + break + + treescrn8.touchwin() + + # ALL ON + treescrn.overlay(treescrn8) + treescrn8.refresh() + w_del_msg.refresh() + + return + +def deer_step(win, y, x): + win.mvwin(y, x) + win.refresh() + w_del_msg.refresh() + look_out(5) + +def reindeer(): + y_pos = 0 + + for x_pos in range(70, 62, -1): + if x_pos < 66: y_pos = 1 + for looper in range(0, 4): + dotdeer0.addch(y_pos, x_pos, ord('.')) + dotdeer0.refresh() + w_del_msg.refresh() + dotdeer0.erase() + dotdeer0.refresh() + w_del_msg.refresh() + look_out(50) + + y_pos = 2 + + for x_pos in range(x_pos - 1, 50, -1): + for looper in range(0, 4): + if x_pos < 56: + y_pos = 3 + + try: + stardeer0.addch(y_pos, x_pos, ord('*')) + except curses.error: + pass + stardeer0.refresh() + w_del_msg.refresh() + stardeer0.erase() + stardeer0.refresh() + w_del_msg.refresh() + else: + dotdeer0.addch(y_pos, x_pos, ord('*')) + dotdeer0.refresh() + w_del_msg.refresh() + dotdeer0.erase() + dotdeer0.refresh() + w_del_msg.refresh() + + x_pos = 58 + + for y_pos in range(2, 5): + lildeer0.touchwin() + lildeer0.refresh() + w_del_msg.refresh() + + for looper in range(0, 4): + deer_step(lildeer3, y_pos, x_pos) + deer_step(lildeer2, y_pos, x_pos) + deer_step(lildeer1, y_pos, x_pos) + deer_step(lildeer2, y_pos, x_pos) + deer_step(lildeer3, y_pos, x_pos) + + lildeer0.touchwin() + lildeer0.refresh() + w_del_msg.refresh() + + x_pos -= 2 + + x_pos = 35 + + for y_pos in range(5, 10): + + middeer0.touchwin() + middeer0.refresh() + w_del_msg.refresh() + + for looper in range(2): + deer_step(middeer3, y_pos, x_pos) + deer_step(middeer2, y_pos, x_pos) + deer_step(middeer1, y_pos, x_pos) + deer_step(middeer2, y_pos, x_pos) + deer_step(middeer3, y_pos, x_pos) + + middeer0.touchwin() + middeer0.refresh() + w_del_msg.refresh() + + x_pos -= 3 + + look_out(300) + + y_pos = 1 + + for x_pos in range(8, 16): + deer_step(bigdeer4, y_pos, x_pos) + deer_step(bigdeer3, y_pos, x_pos) + deer_step(bigdeer2, y_pos, x_pos) + deer_step(bigdeer1, y_pos, x_pos) + deer_step(bigdeer2, y_pos, x_pos) + deer_step(bigdeer3, y_pos, x_pos) + deer_step(bigdeer4, y_pos, x_pos) + deer_step(bigdeer0, y_pos, x_pos) + + x_pos -= 1 + + for looper in range(0, 6): + deer_step(lookdeer4, y_pos, x_pos) + deer_step(lookdeer3, y_pos, x_pos) + deer_step(lookdeer2, y_pos, x_pos) + deer_step(lookdeer1, y_pos, x_pos) + deer_step(lookdeer2, y_pos, x_pos) + deer_step(lookdeer3, y_pos, x_pos) + deer_step(lookdeer4, y_pos, x_pos) + + deer_step(lookdeer0, y_pos, x_pos) + + for y_pos in range(y_pos, 10): + for looper in range(0, 2): + deer_step(bigdeer4, y_pos, x_pos) + deer_step(bigdeer3, y_pos, x_pos) + deer_step(bigdeer2, y_pos, x_pos) + deer_step(bigdeer1, y_pos, x_pos) + deer_step(bigdeer2, y_pos, x_pos) + deer_step(bigdeer3, y_pos, x_pos) + deer_step(bigdeer4, y_pos, x_pos) + deer_step(bigdeer0, y_pos, x_pos) + + y_pos -= 1 + + deer_step(lookdeer3, y_pos, x_pos) + return + +def main(win): + global stdscr + stdscr = win + + global my_bg, y_pos, x_pos + global treescrn, treescrn2, treescrn3, treescrn4 + global treescrn5, treescrn6, treescrn7, treescrn8 + global dotdeer0, stardeer0 + global lildeer0, lildeer1, lildeer2, lildeer3 + global middeer0, middeer1, middeer2, middeer3 + global bigdeer0, bigdeer1, bigdeer2, bigdeer3, bigdeer4 + global lookdeer0, lookdeer1, lookdeer2, lookdeer3, lookdeer4 + global w_holiday, w_del_msg + + my_bg = curses.COLOR_BLACK + # curses.curs_set(0) + + treescrn = curses.newwin(16, 27, 3, 53) + treescrn2 = curses.newwin(16, 27, 3, 53) + treescrn3 = curses.newwin(16, 27, 3, 53) + treescrn4 = curses.newwin(16, 27, 3, 53) + treescrn5 = curses.newwin(16, 27, 3, 53) + treescrn6 = curses.newwin(16, 27, 3, 53) + treescrn7 = curses.newwin(16, 27, 3, 53) + treescrn8 = curses.newwin(16, 27, 3, 53) + + dotdeer0 = curses.newwin(3, 71, 0, 8) + + stardeer0 = curses.newwin(4, 56, 0, 8) + + lildeer0 = curses.newwin(7, 53, 0, 8) + lildeer1 = curses.newwin(2, 4, 0, 0) + lildeer2 = curses.newwin(2, 4, 0, 0) + lildeer3 = curses.newwin(2, 4, 0, 0) + + middeer0 = curses.newwin(15, 42, 0, 8) + middeer1 = curses.newwin(3, 7, 0, 0) + middeer2 = curses.newwin(3, 7, 0, 0) + middeer3 = curses.newwin(3, 7, 0, 0) + + bigdeer0 = curses.newwin(10, 23, 0, 0) + bigdeer1 = curses.newwin(10, 23, 0, 0) + bigdeer2 = curses.newwin(10, 23, 0, 0) + bigdeer3 = curses.newwin(10, 23, 0, 0) + bigdeer4 = curses.newwin(10, 23, 0, 0) + + lookdeer0 = curses.newwin(10, 25, 0, 0) + lookdeer1 = curses.newwin(10, 25, 0, 0) + lookdeer2 = curses.newwin(10, 25, 0, 0) + lookdeer3 = curses.newwin(10, 25, 0, 0) + lookdeer4 = curses.newwin(10, 25, 0, 0) + + w_holiday = curses.newwin(1, 27, 3, 27) + + w_del_msg = curses.newwin(1, 20, 23, 60) + + try: + w_del_msg.addstr(0, 0, "Hit any key to quit") + except curses.error: + pass + + try: + w_holiday.addstr(0, 0, "H A P P Y H O L I D A Y S") + except curses.error: + pass + + # set up the windows for our various reindeer + lildeer1.addch(0, 0, ord('V')) + lildeer1.addch(1, 0, ord('@')) + lildeer1.addch(1, 1, ord('<')) + lildeer1.addch(1, 2, ord('>')) + try: + lildeer1.addch(1, 3, ord('~')) + except curses.error: + pass + + lildeer2.addch(0, 0, ord('V')) + lildeer2.addch(1, 0, ord('@')) + lildeer2.addch(1, 1, ord('|')) + lildeer2.addch(1, 2, ord('|')) + try: + lildeer2.addch(1, 3, ord('~')) + except curses.error: + pass + + lildeer3.addch(0, 0, ord('V')) + lildeer3.addch(1, 0, ord('@')) + lildeer3.addch(1, 1, ord('>')) + lildeer3.addch(1, 2, ord('<')) + try: + lildeer2.addch(1, 3, ord('~')) # XXX + except curses.error: + pass + + middeer1.addch(0, 2, ord('y')) + middeer1.addch(0, 3, ord('y')) + middeer1.addch(1, 2, ord('0')) + middeer1.addch(1, 3, ord('(')) + middeer1.addch(1, 4, ord('=')) + middeer1.addch(1, 5, ord(')')) + middeer1.addch(1, 6, ord('~')) + middeer1.addch(2, 3, ord('\\')) + middeer1.addch(2, 5, ord('/')) + + middeer2.addch(0, 2, ord('y')) + middeer2.addch(0, 3, ord('y')) + middeer2.addch(1, 2, ord('0')) + middeer2.addch(1, 3, ord('(')) + middeer2.addch(1, 4, ord('=')) + middeer2.addch(1, 5, ord(')')) + middeer2.addch(1, 6, ord('~')) + middeer2.addch(2, 3, ord('|')) + middeer2.addch(2, 5, ord('|')) + + middeer3.addch(0, 2, ord('y')) + middeer3.addch(0, 3, ord('y')) + middeer3.addch(1, 2, ord('0')) + middeer3.addch(1, 3, ord('(')) + middeer3.addch(1, 4, ord('=')) + middeer3.addch(1, 5, ord(')')) + middeer3.addch(1, 6, ord('~')) + middeer3.addch(2, 3, ord('/')) + middeer3.addch(2, 5, ord('\\')) + + bigdeer1.addch(0, 17, ord('\\')) + bigdeer1.addch(0, 18, ord('/')) + bigdeer1.addch(0, 19, ord('\\')) + bigdeer1.addch(0, 20, ord('/')) + bigdeer1.addch(1, 18, ord('\\')) + bigdeer1.addch(1, 20, ord('/')) + bigdeer1.addch(2, 19, ord('|')) + bigdeer1.addch(2, 20, ord('_')) + bigdeer1.addch(3, 18, ord('/')) + bigdeer1.addch(3, 19, ord('^')) + bigdeer1.addch(3, 20, ord('0')) + bigdeer1.addch(3, 21, ord('\\')) + bigdeer1.addch(4, 17, ord('/')) + bigdeer1.addch(4, 18, ord('/')) + bigdeer1.addch(4, 19, ord('\\')) + bigdeer1.addch(4, 22, ord('\\')) + bigdeer1.addstr(5, 7, "^~~~~~~~~// ~~U") + bigdeer1.addstr(6, 7, "( \\_____( /") # )) + bigdeer1.addstr(7, 8, "( ) /") + bigdeer1.addstr(8, 9, "\\\\ /") + bigdeer1.addstr(9, 11, "\\>/>") + + bigdeer2.addch(0, 17, ord('\\')) + bigdeer2.addch(0, 18, ord('/')) + bigdeer2.addch(0, 19, ord('\\')) + bigdeer2.addch(0, 20, ord('/')) + bigdeer2.addch(1, 18, ord('\\')) + bigdeer2.addch(1, 20, ord('/')) + bigdeer2.addch(2, 19, ord('|')) + bigdeer2.addch(2, 20, ord('_')) + bigdeer2.addch(3, 18, ord('/')) + bigdeer2.addch(3, 19, ord('^')) + bigdeer2.addch(3, 20, ord('0')) + bigdeer2.addch(3, 21, ord('\\')) + bigdeer2.addch(4, 17, ord('/')) + bigdeer2.addch(4, 18, ord('/')) + bigdeer2.addch(4, 19, ord('\\')) + bigdeer2.addch(4, 22, ord('\\')) + bigdeer2.addstr(5, 7, "^~~~~~~~~// ~~U") + bigdeer2.addstr(6, 7, "(( )____( /") # )) + bigdeer2.addstr(7, 7, "( / |") + bigdeer2.addstr(8, 8, "\\/ |") + bigdeer2.addstr(9, 9, "|> |>") + + bigdeer3.addch(0, 17, ord('\\')) + bigdeer3.addch(0, 18, ord('/')) + bigdeer3.addch(0, 19, ord('\\')) + bigdeer3.addch(0, 20, ord('/')) + bigdeer3.addch(1, 18, ord('\\')) + bigdeer3.addch(1, 20, ord('/')) + bigdeer3.addch(2, 19, ord('|')) + bigdeer3.addch(2, 20, ord('_')) + bigdeer3.addch(3, 18, ord('/')) + bigdeer3.addch(3, 19, ord('^')) + bigdeer3.addch(3, 20, ord('0')) + bigdeer3.addch(3, 21, ord('\\')) + bigdeer3.addch(4, 17, ord('/')) + bigdeer3.addch(4, 18, ord('/')) + bigdeer3.addch(4, 19, ord('\\')) + bigdeer3.addch(4, 22, ord('\\')) + bigdeer3.addstr(5, 7, "^~~~~~~~~// ~~U") + bigdeer3.addstr(6, 6, "( ()_____( /") # )) + bigdeer3.addstr(7, 6, "/ / /") + bigdeer3.addstr(8, 5, "|/ \\") + bigdeer3.addstr(9, 5, "/> \\>") + + bigdeer4.addch(0, 17, ord('\\')) + bigdeer4.addch(0, 18, ord('/')) + bigdeer4.addch(0, 19, ord('\\')) + bigdeer4.addch(0, 20, ord('/')) + bigdeer4.addch(1, 18, ord('\\')) + bigdeer4.addch(1, 20, ord('/')) + bigdeer4.addch(2, 19, ord('|')) + bigdeer4.addch(2, 20, ord('_')) + bigdeer4.addch(3, 18, ord('/')) + bigdeer4.addch(3, 19, ord('^')) + bigdeer4.addch(3, 20, ord('0')) + bigdeer4.addch(3, 21, ord('\\')) + bigdeer4.addch(4, 17, ord('/')) + bigdeer4.addch(4, 18, ord('/')) + bigdeer4.addch(4, 19, ord('\\')) + bigdeer4.addch(4, 22, ord('\\')) + bigdeer4.addstr(5, 7, "^~~~~~~~~// ~~U") + bigdeer4.addstr(6, 6, "( )______( /") # ) + bigdeer4.addstr(7, 5, "(/ \\") # ) + bigdeer4.addstr(8, 0, "v___= ----^") + + lookdeer1.addstr(0, 16, "\\/ \\/") + lookdeer1.addstr(1, 17, "\\Y/ \\Y/") + lookdeer1.addstr(2, 19, "\\=/") + lookdeer1.addstr(3, 17, "^\\o o/^") + lookdeer1.addstr(4, 17, "//( )") + lookdeer1.addstr(5, 7, "^~~~~~~~~// \\O/") + lookdeer1.addstr(6, 7, "( \\_____( /") # )) + lookdeer1.addstr(7, 8, "( ) /") + lookdeer1.addstr(8, 9, "\\\\ /") + lookdeer1.addstr(9, 11, "\\>/>") + + lookdeer2.addstr(0, 16, "\\/ \\/") + lookdeer2.addstr(1, 17, "\\Y/ \\Y/") + lookdeer2.addstr(2, 19, "\\=/") + lookdeer2.addstr(3, 17, "^\\o o/^") + lookdeer2.addstr(4, 17, "//( )") + lookdeer2.addstr(5, 7, "^~~~~~~~~// \\O/") + lookdeer2.addstr(6, 7, "(( )____( /") # )) + lookdeer2.addstr(7, 7, "( / |") + lookdeer2.addstr(8, 8, "\\/ |") + lookdeer2.addstr(9, 9, "|> |>") + + lookdeer3.addstr(0, 16, "\\/ \\/") + lookdeer3.addstr(1, 17, "\\Y/ \\Y/") + lookdeer3.addstr(2, 19, "\\=/") + lookdeer3.addstr(3, 17, "^\\o o/^") + lookdeer3.addstr(4, 17, "//( )") + lookdeer3.addstr(5, 7, "^~~~~~~~~// \\O/") + lookdeer3.addstr(6, 6, "( ()_____( /") # )) + lookdeer3.addstr(7, 6, "/ / /") + lookdeer3.addstr(8, 5, "|/ \\") + lookdeer3.addstr(9, 5, "/> \\>") + + lookdeer4.addstr(0, 16, "\\/ \\/") + lookdeer4.addstr(1, 17, "\\Y/ \\Y/") + lookdeer4.addstr(2, 19, "\\=/") + lookdeer4.addstr(3, 17, "^\\o o/^") + lookdeer4.addstr(4, 17, "//( )") + lookdeer4.addstr(5, 7, "^~~~~~~~~// \\O/") + lookdeer4.addstr(6, 6, "( )______( /") # ) + lookdeer4.addstr(7, 5, "(/ \\") # ) + lookdeer4.addstr(8, 0, "v___= ----^") + + ############################################### + curses.cbreak() + stdscr.nodelay(1) + + while 1: + stdscr.clear() + treescrn.erase() + w_del_msg.touchwin() + treescrn.touchwin() + treescrn2.erase() + treescrn2.touchwin() + treescrn8.erase() + treescrn8.touchwin() + stdscr.refresh() + look_out(150) + boxit() + stdscr.refresh() + look_out(150) + seas() + stdscr.refresh() + greet() + stdscr.refresh() + look_out(150) + fromwho() + stdscr.refresh() + look_out(150) + tree() + look_out(150) + balls() + look_out(150) + star() + look_out(150) + strng1() + strng2() + strng3() + strng4() + strng5() + + # set up the windows for our blinking trees + # + # treescrn3 + treescrn.overlay(treescrn3) + + # balls + treescrn3.addch(4, 18, ord(' ')) + treescrn3.addch(7, 6, ord(' ')) + treescrn3.addch(8, 19, ord(' ')) + treescrn3.addch(11, 22, ord(' ')) + + # star + treescrn3.addch(0, 12, ord('*')) + + # strng1 + treescrn3.addch(3, 11, ord(' ')) + + # strng2 + treescrn3.addch(5, 13, ord(' ')) + treescrn3.addch(6, 10, ord(' ')) + + # strng3 + treescrn3.addch(7, 16, ord(' ')) + treescrn3.addch(7, 14, ord(' ')) + + # strng4 + treescrn3.addch(10, 13, ord(' ')) + treescrn3.addch(10, 10, ord(' ')) + treescrn3.addch(11, 8, ord(' ')) + + # strng5 + treescrn3.addch(11, 18, ord(' ')) + treescrn3.addch(12, 13, ord(' ')) + + # treescrn4 + treescrn.overlay(treescrn4) + + # balls + treescrn4.addch(3, 9, ord(' ')) + treescrn4.addch(4, 16, ord(' ')) + treescrn4.addch(7, 6, ord(' ')) + treescrn4.addch(8, 19, ord(' ')) + treescrn4.addch(11, 2, ord(' ')) + treescrn4.addch(12, 23, ord(' ')) + + # star + treescrn4.standout() + treescrn4.addch(0, 12, ord('*')) + treescrn4.standend() + + # strng1 + treescrn4.addch(3, 13, ord(' ')) + + # strng2 + + # strng3 + treescrn4.addch(7, 15, ord(' ')) + treescrn4.addch(8, 11, ord(' ')) + + # strng4 + treescrn4.addch(9, 16, ord(' ')) + treescrn4.addch(10, 12, ord(' ')) + treescrn4.addch(11, 8, ord(' ')) + + # strng5 + treescrn4.addch(11, 18, ord(' ')) + treescrn4.addch(12, 14, ord(' ')) + + # treescrn5 + treescrn.overlay(treescrn5) + + # balls + treescrn5.addch(3, 15, ord(' ')) + treescrn5.addch(10, 20, ord(' ')) + treescrn5.addch(12, 1, ord(' ')) + + # star + treescrn5.addch(0, 12, ord(' ')) + + # strng1 + treescrn5.addch(3, 11, ord(' ')) + + # strng2 + treescrn5.addch(5, 12, ord(' ')) + + # strng3 + treescrn5.addch(7, 14, ord(' ')) + treescrn5.addch(8, 10, ord(' ')) + + # strng4 + treescrn5.addch(9, 15, ord(' ')) + treescrn5.addch(10, 11, ord(' ')) + treescrn5.addch(11, 7, ord(' ')) + + # strng5 + treescrn5.addch(11, 17, ord(' ')) + treescrn5.addch(12, 13, ord(' ')) + + # treescrn6 + treescrn.overlay(treescrn6) + + # balls + treescrn6.addch(6, 7, ord(' ')) + treescrn6.addch(7, 18, ord(' ')) + treescrn6.addch(10, 4, ord(' ')) + treescrn6.addch(11, 23, ord(' ')) + + # star + treescrn6.standout() + treescrn6.addch(0, 12, ord('*')) + treescrn6.standend() + + # strng1 + + # strng2 + treescrn6.addch(5, 11, ord(' ')) + + # strng3 + treescrn6.addch(7, 13, ord(' ')) + treescrn6.addch(8, 9, ord(' ')) + + # strng4 + treescrn6.addch(9, 14, ord(' ')) + treescrn6.addch(10, 10, ord(' ')) + treescrn6.addch(11, 6, ord(' ')) + + # strng5 + treescrn6.addch(11, 16, ord(' ')) + treescrn6.addch(12, 12, ord(' ')) + + # treescrn7 + + treescrn.overlay(treescrn7) + + # balls + treescrn7.addch(3, 15, ord(' ')) + treescrn7.addch(6, 7, ord(' ')) + treescrn7.addch(7, 18, ord(' ')) + treescrn7.addch(10, 4, ord(' ')) + treescrn7.addch(11, 22, ord(' ')) + + # star + treescrn7.addch(0, 12, ord('*')) + + # strng1 + treescrn7.addch(3, 12, ord(' ')) + + # strng2 + treescrn7.addch(5, 13, ord(' ')) + treescrn7.addch(6, 9, ord(' ')) + + # strng3 + treescrn7.addch(7, 15, ord(' ')) + treescrn7.addch(8, 11, ord(' ')) + + # strng4 + treescrn7.addch(9, 16, ord(' ')) + treescrn7.addch(10, 12, ord(' ')) + treescrn7.addch(11, 8, ord(' ')) + + # strng5 + treescrn7.addch(11, 18, ord(' ')) + treescrn7.addch(12, 14, ord(' ')) + + look_out(150) + reindeer() + + w_holiday.touchwin() + w_holiday.refresh() + w_del_msg.refresh() + + look_out(500) + for i in range(0, 20): + blinkit() + +curses.wrapper(main) diff --git a/python/http/url fetcher/url fetcher.py b/python/http/url fetcher/url fetcher.py new file mode 100755 index 0000000..8b62d9b --- /dev/null +++ b/python/http/url fetcher/url fetcher.py @@ -0,0 +1,54 @@ +#!/usr/bin/env python +# coding: utf-8 + +""" +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 . + +Copyright (C) 2013 Fabian Nedoluha +""" + +# import classes +import os +import time +import httplib2 + +def opener(path, flags): + return os.open(path, flags) + +try: input = raw_input +except NameError: pass + +url = input('URL: http://') +itime = input('Interval Time [sec]: ') +count = input('Loop Count: ') +filename = input('Save to[' + str(url) + '.txt]: ') + +if filename == '': + filename = url + '.txt' + +file = open(str(filename), 'w') + +for i in range(int(count)): + + print('Round: ' + str(i + 1)) + resp, content = httplib2.Http().request('http://' + str(url)) + with open(str(filename), 'a', opener=opener) as f: + print(resp, file=f) + print(content, file=f) + os.close + if i != (int(count) - 1): + time.sleep(float(itime)) + +print('done...') +exit() diff --git a/python/template.py b/python/template.py new file mode 100644 index 0000000..470c949 --- /dev/null +++ b/python/template.py @@ -0,0 +1,19 @@ +#!/usr/bin/env python +# coding: utf-8 + + """ + 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 . + + Copyright (C) 2013 Fabian Nedoluha + """