diff --git a/autoload/SpaceVim/layers/lang/lua.vim b/autoload/SpaceVim/layers/lang/lua.vim index d8e7f2575..e65c52ed9 100644 --- a/autoload/SpaceVim/layers/lang/lua.vim +++ b/autoload/SpaceVim/layers/lang/lua.vim @@ -37,7 +37,7 @@ function! SpaceVim#layers#lang#lua#plugins() abort let plugins = [] " Improved Lua 5.3 syntax and indentation support for Vim - call add(plugins, ['wsdjeg/vim-lua', {'on_ft' : 'lua'}]) + call add(plugins, [g:_spacevim_root_dir . 'bundle/vim-lua', {'on_ft' : 'lua'}]) call add(plugins, ['WolfgangMehner/lua-support', {'on_ft' : 'lua'}]) return plugins endfunction diff --git a/bundle/vim-lua/LICENSE b/bundle/vim-lua/LICENSE new file mode 100644 index 000000000..f288702d2 --- /dev/null +++ b/bundle/vim-lua/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/bundle/vim-lua/README.md b/bundle/vim-lua/README.md new file mode 100644 index 000000000..16ab77485 --- /dev/null +++ b/bundle/vim-lua/README.md @@ -0,0 +1,11 @@ +# vim-lua [![](https://spacevim.org/img/build-with-SpaceVim.svg)](https://spacevim.org) +> lua development plugin for Vim + +![lua](https://user-images.githubusercontent.com/13142418/51436347-3502f780-1cc6-11e9-9ae1-02e1dfa1e165.png) + +#### Features + +- syntax highlight +- indent +- omni complete +- code runner diff --git a/bundle/vim-lua/addon-info.json b/bundle/vim-lua/addon-info.json new file mode 100644 index 000000000..6bfc6ea10 --- /dev/null +++ b/bundle/vim-lua/addon-info.json @@ -0,0 +1,5 @@ +{ + "name": "vim-lua", + "description": "lua development plugin for Vim", + "author": "SpaceVim" +} diff --git a/bundle/vim-lua/autoload/lua.vim b/bundle/vim-lua/autoload/lua.vim new file mode 100644 index 000000000..687c31c90 --- /dev/null +++ b/bundle/vim-lua/autoload/lua.vim @@ -0,0 +1,21 @@ +" source Lua... +if has('lua') + exe 'luafile ' . fnamemodify(expand(''), ':h:h').'/lua/luavi/complete.lua' +endif + + +"" +" @public +" this function is the omnifunc for lua file. to enable lua complete, add this +" to you vimrc. +" > +" augroup vim-lua +" autocmd! +" autocmd FileType lua setlocal omnifunc=lua#complete +" augroup END +" < +function! lua#complete(findstart, base) abort + + return lua#omni#complete(a:findstart, a:base) + +endfunction diff --git a/bundle/vim-lua/autoload/lua/fold.vim b/bundle/vim-lua/autoload/lua/fold.vim new file mode 100644 index 000000000..11bb8b8cb --- /dev/null +++ b/bundle/vim-lua/autoload/lua/fold.vim @@ -0,0 +1,5 @@ +function! lua#fold#foldlevel(linenum) abort + lua require('luavi').fold(require('luavi.vimutils').eval('a:linenum')) +endfunction + + diff --git a/bundle/vim-lua/autoload/lua/omni.vim b/bundle/vim-lua/autoload/lua/omni.vim new file mode 100644 index 000000000..87ad7db52 --- /dev/null +++ b/bundle/vim-lua/autoload/lua/omni.vim @@ -0,0 +1,3 @@ +function! lua#omni#complete(findstart, base) abort + lua require('luavi').complete(require('luavi.vimutils').eval('a:findstart'), require('luavi.vimutils').eval('a:base')) +endfunction diff --git a/bundle/vim-lua/doc/vim-lua.txt b/bundle/vim-lua/doc/vim-lua.txt new file mode 100644 index 000000000..652eb333b --- /dev/null +++ b/bundle/vim-lua/doc/vim-lua.txt @@ -0,0 +1,49 @@ +*vim-lua.txt* lua development plugin for Vim +SpaceVim *vim-lua* + +============================================================================== +CONTENTS *vim-lua-contents* + 1. Introduction..............................................|vim-lua-intro| + 2. Configuration............................................|vim-lua-config| + 3. Functions.............................................|vim-lua-functions| + 4. Mappings...............................................|vim-lua-mappings| + +============================================================================== +INTRODUCTION *vim-lua-intro* + +lua development plugin for vim and neovim. + +============================================================================== +CONFIGURATION *vim-lua-config* + + *g:lua_default_mappings* +Diable/Enable default mappings in lua buffer. +> + mode key functinon + normal fl print functin list +< + +============================================================================== +FUNCTIONS *vim-lua-functions* + +lua#complete({findstart}, {base}) *lua#complete()* + this function is the omnifunc for lua file. to enable lua complete, add this + to you vimrc. +> + augroup vim-lua + autocmd! + autocmd FileType lua setlocal omnifunc=lua#complete + augroup END +< + +============================================================================== +MAPPINGS *vim-lua-mappings* + +luacomplete defined some mappings for lua buffer: +> + PrintFunctionList print functino list + WriteAndLuaFile wirte and luafile +< + + +vim:tw=78:ts=8:ft=help:norl: diff --git a/bundle/vim-lua/ftplugin/lua.vim b/bundle/vim-lua/ftplugin/lua.vim new file mode 100644 index 000000000..49592ae73 --- /dev/null +++ b/bundle/vim-lua/ftplugin/lua.vim @@ -0,0 +1,6 @@ +setlocal omnifunc=lua#complete + +if &l:foldmethod ==# 'expr' + setlocal foldexpr=lua#fold#foldlevel(v:lnum) +endif +setlocal nofoldenable diff --git a/bundle/vim-lua/indent/lua.vim b/bundle/vim-lua/indent/lua.vim new file mode 100644 index 000000000..65e83501a --- /dev/null +++ b/bundle/vim-lua/indent/lua.vim @@ -0,0 +1,116 @@ +" Vim indent file +" Language: Lua +" URL: https://github.com/tbastos/vim-lua + +" Initialization ------------------------------------------{{{1 + +if exists("b:did_indent") + finish +endif +let b:did_indent = 1 + +setlocal autoindent +setlocal nosmartindent + +setlocal indentexpr=GetLuaIndent() +setlocal indentkeys+=0=end,0=until,0=elseif,0=else + +" Only define the function once. +if exists("*GetLuaIndent") + finish +endif + +" Variables -----------------------------------------------{{{1 + +let s:open_patt = '\C\%(\<\%(function\|if\|repeat\|do\)\>\|(\|{\)' +let s:middle_patt = '\C\<\%(else\|elseif\)\>' +let s:close_patt = '\C\%(\<\%(end\|until\)\>\|)\|}\)' + +let s:anon_func_start = '\S\+\s*[({].*\ 0 && contents_prev !~# s:anon_func_end + let i -= 1 + endif + + " if this line closed a paren, indent (except with anon funcs) + call cursor(prev_line, col([prev_line, '$'])) + let num_cur_closed_parens = searchpair('(', '', ')', 'mr', s:skip_expr, v:lnum) + if num_cur_closed_parens > 0 && contents_cur !~# s:anon_func_end + let i += 1 + endif + + " special case: call(with, {anon = function() -- should indent only once + if i > 1 && contents_prev =~# s:anon_func_start + let i = 1 + endif + + " special case: end}) -- end of call w/ anon func should outdent only once + if i < -1 && contents_cur =~# s:anon_func_end + let i = -1 + endif + + " restore cursor + call setpos(".", original_cursor_pos) + + return indent(prev_line) + (shiftwidth() * i) + +endfunction diff --git a/bundle/vim-lua/lib/luavi/luacomplete.lua b/bundle/vim-lua/lib/luavi/luacomplete.lua new file mode 100644 index 000000000..3c2988cfb --- /dev/null +++ b/bundle/vim-lua/lib/luavi/luacomplete.lua @@ -0,0 +1,734 @@ +local PATTERN_LUA_IDENTIFIER = '([%a_]+[%a%d_.]*)' + +local vimutil = require("luavi.vimutils") + + +local __p_counter = 0 +--- Writes given arguments to temporary file adding counting and "\n" when appropriate. Useful when debugging. +-- @param ... anything that a io.write function could accept +local function __p(...) + __p_counter = __p_counter + 1 + local f = io.open("/tmp/lua_omni_out.txt", "a") + if f then + f:write(__p_counter .. ": ") + f:write(...) + local last = select(select("#", ...), ...) + if type(last) == "string" and not string.find(last, "\n$") then + f:write("\n") + end + f:close() + end +end + + +--- Finds all assignments in given buffer and return a table with them with order the closest ones being first. +-- @param buf Vim's buffer to be used as source (current one if absent) +-- @param line line number to be checked for being within function' body +-- @return table with list of assignments +function find_assigments(buf, line) + if not line then + buf = vim.window().buffer + line = vim.window().line + end + buf = buf or vim.buffer() + -- scan from first line + local set = {} + local list = {} + local absidx + + local function add_multi_names(str) + string.gsub(str, '([^, ]+)', function(s) + if not set[s] or (set[s] > absidx) then + set[s] = absidx + table.insert(list, s) + end + end) + end + + for lineidx = 1, #buf do + local sts = string.match(buf[lineidx], PATTERN_LUA_IDENTIFIER .. '%s*=[^=]?.*$') + -- collect assignments with relative line numbers + absidx = math.abs(line - lineidx) + if sts and (not set[sts] or (set[sts] > absidx)) then + -- set new key or replace but only if the new absolute index is smaller + set[sts] = absidx + table.insert(list, sts) + end + -- Check for variables defined without assignments as local. It may + -- generate redundant match but conditions in gsub's argument functions + -- will make it get correct results. + sts = string.match(buf[lineidx], 'local%s+([^=]+)') + if sts then add_multi_names(sts) end + -- matching variables initialized in generic for loop + sts = string.match(buf[lineidx], 'for%s+(.*)%s+in') + if sts then add_multi_names(sts) end + -- function names matching + sts = string.match(buf[lineidx], 'function%s+(' .. PATTERN_LUA_IDENTIFIER .. ')%s*%(') + if sts and (not set[sts] or (set[sts] > absidx)) then + -- set new key or replace but only if the new absolute index is smaller + set[sts] = absidx + table.insert(list, sts) + end + -- check for variables defined in functions statements + sts = string.match(buf[lineidx], 'function%s*[^(]*%(([^)]+)%)') + if sts then add_multi_names(sts) end + end + -- sort list using set's absolute indexes in comparator + table.sort(list, function(v1, v2) return set[v1] < set[v2] end) + return list +end + + +--- Escape Lua pattern magic characters "[().%+-*?[^$]" using escape "%". +-- @param s a string to be escaped +-- @return just an escaped string +function escape_magic_chars(s) + assert(type(s) == "string", "s must be a string!") + + return (string.gsub(s, '([().%+-*?[^$])', '%%%1')) +end + + +--- Replaces "*" and "." characters to more fitting Lua pattern ones. +-- @param s a string +-- @return pattern +function glob_to_pattern(s) + assert(type(s) == "string", "s must be a string!") + + local pat = string.gsub(s, '.', function(c) + if c == "*" then + return '.-' + elseif c == '?' then + return '.' + else return escape_magic_chars(c) end + end) + return pat +end + + +--- Iterator which walks over a Vim buffer. +-- @param buf buffer to be used as source +-- @return next buffer's line +function line_buf_iter(buf) + buf = buf or vim.buffer() + local lineidx = 0 + return function() + lineidx = lineidx + 1 + if lineidx <= #buf then + return buf[lineidx] + end + end +end + + +-- The completion functionality ------------------------------------------------ + + +--- Search for a single part path in _G environment. +-- Nested tables aren't supported. +-- @param pat path to be used in search +-- @return Table with list of k, v pairs. +-- k is function, table, or just variable) name. +-- v is an actual object reference. +function find_completions1(pat) + local comps = {} + for k, v in pairs(_G) do + if string.find(k, "^" .. pat) then + table.insert(comps, {k, v}) + end + end + return comps +end + + +--- Search for multi level paths starting from _G environment. +-- @param pat path to be used in search +-- @return Table with list of k, v pairs. +-- k is function, table, or just variable name (however it's absolute path). +-- v is an actual object reference. +function find_completions2(pat) + local results = {} + -- split path pattern into levels + local levels = {} + for lev in string.gmatch(pat, "[^%.]+") do + table.insert(levels, lev) + end + -- if the last character in pat is '.' and matching all level + if string.sub(pat, -1) == "." then + table.insert(levels, ".*") + end + + -- set prepath if there are multiple levels (used for generating absolute paths) + local prepath = #levels > 1 and table.concat(slice(levels, 1, #levels - 1), ".") .. "." or "" + -- find target table namespace + local where = _G + for i, lev in ipairs(levels) do + if i < #levels then -- not last final path's part? + local w = where[lev] + if w and type(w) == "table" then -- going into inner table/namespace? + where = w + else -- not, path is incorrect! + break + end + else -- the last part of path + for k, v in pairs(where) do + if string.find(k, "^" .. lev) then -- final names search... + table.insert(results, {prepath .. k, v}) + end + end + end + end + return results +end + + +--- Returns a list with paths to files with additional path for Lua omnicompletion. +function lua_omni_files() + local list = {} + -- first check LUA_OMNI shell variable + string.gsub(vim.eval("$LUA_OMNI") or "", '([^ ;,]+)', function(s) table.insert(list, s) end) + -- Next try b:lua_omni buffer variable or... + if vim.eval('exists("b:lua_omni")') == 1 then + string.gsub(vim.eval("b:lua_omni") or "", '([^ ;,]+)', function(s) table.insert(list, s) end) + -- there isn't buffer's var check for global one. + elseif vim.eval('exists("g:lua_omni")') == 1 then + string.gsub(vim.eval("g:lua_omni") or "", '([^ ;,]+)', function(s) table.insert(list, s) end) + end + return list +end + + +--- Search for paths in _G environment table and returns ones matching given pattern. +-- @param pat a pattern +-- @return list of matching paths from _G +function find_completions3(pat) + local flat = {} + local visited = {} + local count = 0 + + function flatten_recursively(t, lvl) + lvl = lvl or "" + -- just to be safe... + if count > 10000 then return end + + for k, v in pairs(t) do + -- for safe measure above + count = count + 1 + if type(k) == "string" then + table.insert(flat, #lvl > 0 and lvl .. "." .. k or k) + end + -- Inner table but do it recursively only when this run hasn't found it + -- already. + if type(v) == "table" and not visited[v] then + -- check to avoid in recursive call + visited[v] = true + if type(k) == "string" then + flatten_recursively(v, #lvl > 0 and lvl .. "." .. k or k) + end + -- Uncheck to allow to visit the same table but from different path. + visited[v] = nil + end + end + end + + -- start from _G + flatten_recursively(_G) + + -- add paths from file(s) + local pathfiles = lua_omni_files() + for _, fname in ipairs(pathfiles) do + -- there is chance that filename is invalid so guard for error + local res, err = pcall(function() + for line in io.lines(fname) do + -- trim line + line = string.gsub(line, "^%s-(%S.-)%s-$", "%1") + -- put every line as path + table.insert(flat, line) + end + end) + -- If pcall above did catch error then echo about it. + if not res then vim.command('echoerr "' .. tostring(err) .. '"') end + end + + local res = {} + -- match paths with pattern + for _, v in ipairs(flat) do + if string.match(v, pat) then table.insert(res, v) end + end + + return res +end + + +--- Utility function to be used with Vim's completefunc. +function completion_findstart() + local w = vim.window() + local buf = w.buffer + local line = buf[w.line] + for i = w.col - 1, 1, -1 do + local c = string.sub(line, i, i) + -- "*" and "?" may be used by glob pattern + if string.find(c, "[^a-zA-Z0-9_%.*?]") then + return i + end + end + return 0 +end + + +--- Find matching completions. +-- @param base a base to which complete +-- @return list with possible (string) abbreviations +function complete_base_string(base) + local t = {} + + if type(base) == "string" then + -- completion using _G environment + -- obsolete the new version seems better +-- local comps = find_completions2(base) +-- for _, v in pairs(comps) do +-- table.insert(t, v[1]) +-- end +-- table.sort(t) + + local sortbylen = false + local pat = string.match(base, '^[%a_][%a%d_]*$') + if pat then -- single word completion + pat = ".*" .. escape_magic_chars(pat) .. ".*" + sortbylen = true + else -- full completion + pat = glob_to_pattern(base) + if not string.match(pat, '%.%*$') then pat = pat .. '.*' end + end + -- try to find something matching... + t = find_completions3("^" .. pat .. "$") + -- in a case no results were found try to expand dots + if #t == 0 then + pat = string.gsub(base, "%.", "[^.]*%%.") .. '.*' + t = find_completions3("^" .. pat .. "$") + end + + -- For single word matches it's more convenient to have results sorted by + -- their string length. + if sortbylen then + table.sort(t, function(o1, o2) + o1 = o1 or "" + o2 = o2 or "" + local l1 = string.len(o1) + local l2 = string.len(o2) + return l1 < l2 + end) + else + table.sort(t) + end + + -- Always do variable assignments matching per buffer now as + -- find_assigments will return most close assignments first. + local assigments = {} + for i, v in ipairs(find_assigments()) do + if string.find(v, "^" .. base) then table.insert(assigments, v) end + end + t = merge_list(assigments, t) + end + return t +end + + +--- To be called within CompleteLua Vim function. +function completefunc_luacode() + -- getting arguments from Vim function + local findstart = vim.eval("a:findstart") + local base = vim.eval("a:base") + -- this function is called twice - first for finding range in line to complete + if findstart == 1 then + vim.command("return " .. completion_findstart()) + else -- the second run - do proper complete + local comps = complete_base_string(base) + for i = 1, #comps do comps[i] = "'" .. comps[i] .. "'" end + -- returning + vim.command("return [" .. table.concat(comps, ", ") .. "]") + end +end + + +-- The outline window. --------------------------------------------------------- + +--- Get a list of Lua defined functions in a buffer. +-- @param buf a buffer to be used (parsed?) for doing funcs list (optional, if +-- absent then use current one) +-- @return list of {linenumber, linecontent} tables +function function_list(buf) + local funcs = {} + local linenum = 0 + for line in line_buf_iter(buf) do + linenum = linenum + 1 + if string.find(line, "^%s-function%s+") then + funcs[#funcs + 1] = {linenum, line} + end + -- TODO reuse later +-- local funcname = string.match(buf[lineidx], "function%s+" .. PATTERN_LUA_IDENTIFIER .. "%s*%(") +-- if funcname then +-- table.insert(funcs, funcname) +-- else +-- funcname = string.match(buf[lineidx], PATTERN_LUA_IDENTIFIER .. "%s*=%s*function%s*%(") +-- if funcname then +-- table.insert(funcs, funcname) +-- end +-- end + end + return funcs +end + + +--- Prints list of function within Vim buffer. +-- The output format is line_number: function func_name __spaces__ function's title (if exists) +-- @param buf buffer to be used as source +function print_function_list(buf) + local funclist = function_list(buf) + if #funclist > 0 then + local countsize = #tostring(funclist[#funclist][1]) + for i, f in ipairs(funclist) do + if i == 1 then print("line: function definition...") end + -- try to get any doc about function... + local doc = func_doc(f[1]) + local title = string.gmatch(doc["---"] or "", "[^\n]+") + title = title and title() or nil + local s = string.format("%" .. countsize .. "d: %-" .. (40 - countsize) .. "s %s", f[1], f[2], + (title or "")) + print(s) + end + else + print "no functions found..." + end +end + + +--- Checks if current line lies in function definition. +-- Depends on usual code formating where "function" and "end" statements start +-- at first column. +-- @param buf Vim's buffer to be used as source (current one if absent) +-- @param line line number to be checked for being within function' body +-- @return funcstart, funcend pair or nil, nil if line is outside a function +function in_func_body(buf, line) + if not line then + buf = vim.window().buffer + line = vim.window().line + end + buf = buf or vim.buffer() + -- search for function definition first + local funcstart + for lineidx = line, 1, -1 do + -- If iterating back end at first column is found, then it's outside + -- function. + if string.find(buf[lineidx], "^end") then break end + if string.find(buf[lineidx], "^function") then + funcstart = lineidx + break + end + end + -- search for the function's closing "end" + -- (depends on an usual formating, doesn't count code chunks) + local funcend + if funcstart then -- search for function's end only when start was found... + for lineidx = line + 1, #buf do + if string.find(buf[lineidx], "^end") then + funcend = lineidx + break + end + end + end + return funcstart, funcend +end + + +--- Search for variable assignments in a Vim buffer within given line range. +-- @param buf Vim buffer to be used +-- @param startline line number from search of assignments will begin +-- @param endline line number to search of assignments will end +-- @return table with list of found variable names +function search_assignments1(buf, startline, endline) + assert(type(buf) == "userdata", "buf must be a Vim buffer!") + assert(type(startline) == "number", "startline must be a number!") + assert(type(endline) == "number", "endline must be a number!") + assert(startline < endline, "startline must precede endline!") + + -- assignment has a forms like: + -- varname = something + -- varname1[, varname2[, varname3]] = something1[, something2[, something3]] + -- lets assume that there is only one "=" per line + -- visibility of closures by dammed (for now...) + local assignments = {} + -- Patterns have list of patterns matching variable definitions. The first + -- must be the usual "varname = something" type. + local patterns = {"([%w,%s_,]-[^=])=([^=].-)", -- check if there is assignment in a line + "for%s+(.-)%s+in%s+(.-)", -- check if there are variable definitions in "for ... in" loop + "function%s%s-[%w-_]-%s-%((.-)%)"} -- check if there are variable set in function definition + + for lineidx = startline, endline - 1 do + -- filter out eventual comments + local line = string.gsub(buf[lineidx], "%s*%-%-.*$", "") + -- Search for assignments, variable definitions in "for in" and in + -- function statements. + for i, pat in ipairs(patterns) do + local s, e, pre, post = string.find(" " .. line .. " ", "%s" .. pat .. "%s") + if pre then + -- if subnum is 1 then assignment is local + local line, subnum + if i == 1 then -- only assignments can have local/not local variety + line, subnum = string.gsub(pre, "local%s+", "") + else + line = pre + end + -- just store variable names in a set + for varname in string.gmatch(line, "[^, \t]+") do assignments[varname] = true end + end + end + + end + -- convert set to a list + local assignmentlist = {} + for k, v in pairs(assignments) do table.insert(assignmentlist, k) end + return assignmentlist +end + + +--- Miscellaneous. ------------------------------------------------------------- + +--- Prints keys within a table (or environment). Similar to Python's dir. +-- @param t should be a table or a nil +function dir(t) + if t == nil then + t = _G + assert(type(t) == "table", "t should be a table!") + elseif type(t) == "table" then + for k, v in pairs(t) do + -- TODO commit to main directory + -- if value is a string and it's too long then trim it + if type(v) == "string" and string.len(v) > 150 then + v = string.sub(v, 1, 150) .. "..." + end + -- TODO end + print(k .. ":", v) + end + end +end + + +--- Prints keys of internal Vim's vim Lua module. +function dir_vim() + for k, v in pairs(vim) do + local ty = type(v) + if ty == "function" or ty == "string" or ty == "number" then + print(k) + end + end +end + + +--- Slice function operating on tables. +-- Minus indexes aren't supported (yet...). +-- @param t a table to be sliced +-- @param s the starting index of slice (inclusive) +-- @param s the ending index of slice (inclusive) +-- @return a new table containing a slice from t +function slice(t, s, e) + assert(type(t) == "table", "t should be a table!") + s = s or 1 + e = e or #t + local sliced = {} + for idx = s, e do + if t[idx] then table.insert(sliced, t[idx]) end + end + return sliced +end + + +--- Merges multiple tables as lists. +-- @return resulting list have merged arguments from left to right in ascending order +function merge_list(...) + local res = {} + for idx = 1, select("#", ...) do + local t = select(idx, ...) + if type(t) == "table" then + for i, v in ipairs(t) do table.insert(res, v) end + else + table.insert(res, t) + end + end + return res +end + + +--- Returns list of active windows in a current tab. +-- @return vim.window like tables with similar keys +function window_list() + local idx = 1 + local winlist = {} + while true do + local w = vim.window(idx) + if not w then break end + winlist[#winlist + 1] = {line = w.line, col = w.col, width = w.width, + height = w.height, firstline = w.buffer[1], + currentline = w.buffer[w.line]} + idx = idx + 1 + end + return winlist +end + + +--- Just prints current window list. +function print_window_list() + local wincount + for i, w in ipairs(window_list()) do + if i == 1 then print("win number, line, col, width, height :current line content...") end + print(string.format("%02d: %s", i, w.currentline)) + wincount = i + end + if not wincount then print("no windows found (how it's possible?!)...") end +end + + +--- Try to parse function documentation using luadoc format. +-- At first it wasn't easy to write, but after some thought I had it done +-- in quite efficient way (I think :). +-- @param line starting line of function which luadoc to parse +-- @param buf Vim's buffer to be used as source (current one if absent) +-- @return table containing k/v pairs analogous to luadoc's "@" flags +function func_doc(line, buf) + buf = buf or vim.buffer() + assert(type(line) == "number", "line must be a number!") + assert(line >= 1 and line <= #buf, "line should be withing range of buffer's lines!") + local curlines, doc = {}, {} + for l = line - 1, 1, -1 do + local spciter = string.gmatch(buf[l], "%S+") + local pre = spciter() + local flag, fvalue, rest + if pre == "---" then + rest = table.concat(iter_to_table(spciter), " ") + table.insert(curlines, rest) + doc["---"] = curlines + elseif pre == "--" then + flag = spciter() + if string.sub(flag, 1, 1) == "@" then + fvalue = spciter() + rest = table.concat(iter_to_table(spciter), " ") + table.insert(curlines, rest) + doc[flag .. ":" .. fvalue] = curlines + curlines = {} + else + rest = table.concat(iter_to_table(spciter), " ") + table.insert(curlines, rest) + end + else + break + end + end + -- post reverse and concat doc's strings + for k, t in pairs(doc) do + local reversed = {} + for i = 1, #t do reversed[i] = t[#t - i + 1] end -- reverse accumulated lines + doc[k] = table.concat(reversed, "\n") + end + return doc +end + + +--- Translates iterator function into a table. +-- @param iter iterator function +-- @return table populated by iterator +function iter_to_table(iter) + assert(type(iter) == "function", "iter has to be a function!") + local t = {} + local idx = 0 + for v in iter do + idx = idx + 1 + t[idx] = v + end + return t +end + + +--- Iterator which scans Vim buffer and returns on each call a supposed fold level, line number and line itself. Parsing is simplified but should be good enough for most of the time. +-- @param buf a Vim buffer to scan, nil for current buffer +-- @param fromline a line number from which scanning starts, nil for 1 +-- @param toline a line number at which scanning stops, nil for the last buffer's line +-- @return fold level, line number, line's content +function fold_iter(buf, fromline, toline) + assert(fromline == nil or type(fromline) == "number", "fromline must be a number if specified!") + buf = buf or vim.buffer() + toline = toline or #buf + assert(type(toline) == "number", "toline must be a number if specified!") + + local lineidx = fromline and (fromline - 1) or 0 + -- to remember consecutive folds + local foldlist = {} + -- closure blocks opening/closing statements + local patterns = {{"do", "end"}, + {"repeat", "until%s+.+"}, + {"if%s+.+%s+then", "end"}, + {"for%s+.+%s+do", "end"}, + {"function.+", "end"}, + {"return%s+function.+", "end"}, + {"local%s+function%s+.+", "end"}, + } + + return function() + lineidx = lineidx + 1 + if lineidx <= toline then + -- search for one of blocks statements + for i, t in ipairs(patterns) do + -- add whole line anchors + local tagopen = '^%s*' .. t[1] .. '%s*$' + local tagclose = '^%s*' .. t[2] .. '%s*$' + -- try to find opening statement + if string.find(buf[lineidx], tagopen) then + -- just remember it + table.insert(foldlist, t) + elseif string.find(buf[lineidx], tagclose) then -- check for closing statement + -- Proceed only if there is unclosed block in foldlist and its + -- closing statement matches. + if #foldlist > 0 and string.find(buf[lineidx], foldlist[#foldlist][2]) then + table.remove(foldlist) + -- Add 1 to foldlist length (synonymous to fold level) to include + -- closing statement in the fold too. + return #foldlist + 1, lineidx, buf[lineidx] + else + -- An incorrect situation where opening/closing statements didn't + -- match (probably due to malformed formating or erroneous code). + -- Just "reset" foldlist. + foldlist = {} + end + end + end + -- #foldlist is fold level + return #foldlist, lineidx, buf[lineidx] + end + end +end + + +--- A Lua part to be called from Vim script FoldLuaLevel function used by foldexpr option. It returns fold level for given line number. +function foldlevel_luacode() + local linenum = vim.eval("a:linenum") + assert(type(linenum) == "number", "linenum must be a number!") + + -- by default don't make nested folds + local innerfolds = false + -- though a configuration variable can enable it + if vim.eval('exists("b:lua_inner_folds")') == 1 then + innerfolds = vim.eval('b:lua_inner_folds') == 1 + elseif vim.eval('exists("g:lua_inner_folds")') == 1 then + innerfolds = vim.eval('g:lua_inner_folds') == 1 + end + __p("innerfolds " .. tostring(innerfolds)) + -- Iterate over line fold levels to find that one for which Vim is asking. + -- TODO It's repetitively inefficient - perhaps some kind of caching would + -- be beneficial? + for lvl, lineidx in fold_iter() do + if lineidx == linenum then + vim.command("return " .. (innerfolds and lvl or (lvl > 1 and 1 or lvl))) + break + end + end +end + diff --git a/bundle/vim-lua/lua/luavi.lua b/bundle/vim-lua/lua/luavi.lua new file mode 100644 index 000000000..93fe4e7de --- /dev/null +++ b/bundle/vim-lua/lua/luavi.lua @@ -0,0 +1,82 @@ +luavi = {} + +local complete = require('luavi.complete') + +function luavi.complete(findstart, base) + complete.complete(findstart, base) +end + +local function fold_iter(buf, fromline, toline) + assert(fromline == nil or type(fromline) == "number", "fromline must be a number if specified!") + buf = buf or vimutils.current_buffer() + toline = toline or #buf + assert(type(toline) == "number", "toline must be a number if specified!") + + local lineidx = fromline and (fromline - 1) or 0 + -- to remember consecutive folds + local foldlist = {} + -- closure blocks opening/closing statements + local patterns = {{"do", "end"}, + {"repeat", "until%s+.+"}, + {"if%s+.+%s+then", "end"}, + {"for%s+.+%s+do", "end"}, + {"function.+", "end"}, + {"return%s+function.+", "end"}, + {"local%s+function%s+.+", "end"}, + } + + return function() + lineidx = lineidx + 1 + if lineidx <= toline then + -- search for one of blocks statements + for i, t in ipairs(patterns) do + -- add whole line anchors + local tagopen = '^%s*' .. t[1] .. '%s*$' + local tagclose = '^%s*' .. t[2] .. '%s*$' + -- try to find opening statement + if string.find(buf[lineidx], tagopen) then + -- just remember it + table.insert(foldlist, t) + elseif string.find(buf[lineidx], tagclose) then -- check for closing statement + -- Proceed only if there is unclosed block in foldlist and its + -- closing statement matches. + if #foldlist > 0 and string.find(buf[lineidx], foldlist[#foldlist][2]) then + table.remove(foldlist) + -- Add 1 to foldlist length (synonymous to fold level) to include + -- closing statement in the fold too. + return #foldlist + 1, lineidx, buf[lineidx] + else + -- An incorrect situation where opening/closing statements didn't + -- match (probably due to malformed formating or erroneous code). + -- Just "reset" foldlist. + foldlist = {} + end + end + end + -- #foldlist is fold level + return #foldlist, lineidx, buf[lineidx] + end + end +end + +function luavi.fold(linenum) + assert(type(linenum) == "number", "linenum must be a number!") + + -- by default don't make nested folds + local innerfolds = false + -- though a configuration variable can enable it + if vimutils.eval('exists("b:lua_inner_folds")') == 1 then + innerfolds = vimutils.eval('b:lua_inner_folds') == 1 + elseif vimutils.eval('exists("g:lua_inner_folds")') == 1 then + innerfolds = vimutils.eval('g:lua_inner_folds') == 1 + end + + for lvl, lineidx in fold_iter() do + if lineidx == linenum then + vim.command("return " .. (innerfolds and lvl or (lvl > 1 and 1 or lvl))) + break + end + end +end + +return luavi diff --git a/bundle/vim-lua/lua/luavi/complete.lua b/bundle/vim-lua/lua/luavi/complete.lua new file mode 100644 index 000000000..9dd30df3c --- /dev/null +++ b/bundle/vim-lua/lua/luavi/complete.lua @@ -0,0 +1,248 @@ +local PATTERN_LUA_IDENTIFIER = '([%a_]+[%a%d_.]*)' + +complete = {} + +local vimutil = require('luavi.vimutils') + +local function merge_list(...) + local res = {} + for idx = 1, select("#", ...) do + local t = select(idx, ...) + if type(t) == "table" then + for i, v in ipairs(t) do table.insert(res, v) end + else + table.insert(res, t) + end + end + return res +end + +local function find_assigments(buf, line) + if not line then + buf = vimutils.current_buffer() + -- line = current line number + line = vimutils.current_linenr() + end + buf = buf or vimutils.current_buffer() + -- scan from first line + local set = {} + local list = {} + local absidx + + local function add_multi_names(str) + string.gsub(str, '([^, ]+)', function(s) + if not set[s] or (set[s] > absidx) then + set[s] = absidx + table.insert(list, s) + end + end) + end + + for lineidx = 1, #buf do + local sts = string.match(buf[lineidx], PATTERN_LUA_IDENTIFIER .. '%s*=[^=]?.*$') + -- collect assignments with relative line numbers + absidx = math.abs(line - lineidx) + if sts and (not set[sts] or (set[sts] > absidx)) then + -- set new key or replace but only if the new absolute index is smaller + set[sts] = absidx + table.insert(list, sts) + end + -- Check for variables defined without assignments as local. It may + -- generate redundant match but conditions in gsub's argument functions + -- will make it get correct results. + sts = string.match(buf[lineidx], 'local%s+([^=]+)') + if sts then add_multi_names(sts) end + -- matching variables initialized in generic for loop + sts = string.match(buf[lineidx], 'for%s+(.*)%s+in') + if sts then add_multi_names(sts) end + -- function names matching + sts = string.match(buf[lineidx], 'function%s+(' .. PATTERN_LUA_IDENTIFIER .. ')%s*%(') + if sts and (not set[sts] or (set[sts] > absidx)) then + -- set new key or replace but only if the new absolute index is smaller + set[sts] = absidx + table.insert(list, sts) + end + -- check for variables defined in functions statements + sts = string.match(buf[lineidx], 'function%s*[^(]*%(([^)]+)%)') + if sts then add_multi_names(sts) end + end + -- sort list using set's absolute indexes in comparator + table.sort(list, function(v1, v2) return set[v1] < set[v2] end) + return list +end + + +local function lua_omni_files() + local list = {} + -- first check LUA_OMNI shell variable + string.gsub(vimutils.eval("$LUA_OMNI") or "", '([^ ;,]+)', function(s) table.insert(list, s) end) + -- Next try b:lua_omni buffer variable or... + if vimutils.eval('exists("b:lua_omni")') == 1 then + string.gsub(vimutils.eval("b:lua_omni") or "", '([^ ;,]+)', function(s) table.insert(list, s) end) + -- there isn't buffer's var check for global one. + elseif vimutils.eval('exists("g:lua_omni")') == 1 then + string.gsub(vimutils.eval("g:lua_omni") or "", '([^ ;,]+)', function(s) table.insert(list, s) end) + end + return list +end + +local function completion_findstart() + local line = vimutil.get_current_line() + local col = vimutils.eval('col(".")') + for i = col - 1, 1, -1 do + local c = string.sub(line, i, i) + -- "*" and "?" may be used by glob pattern + if string.find(c, "[^a-zA-Z0-9_%.*?]") then + return i + end + end + return 0 +end + +local function escape_magic_chars(s) + assert(type(s) == "string", "s must be a string!") + + return (string.gsub(s, '([().%+-*?[^$])', '%%%1')) +end + +local function glob_to_pattern(s) + assert(type(s) == "string", "s must be a string!") + + local pat = string.gsub(s, '.', function(c) + if c == "*" then + return '.-' + elseif c == '?' then + return '.' + else return escape_magic_chars(c) end + end) + return pat +end + +local function find_completions3(pat) + local flat = {} + local visited = {} + local count = 0 + + function flatten_recursively(t, lvl) + lvl = lvl or "" + -- just to be safe... + if count > 10000 then return end + + for k, v in pairs(t) do + -- for safe measure above + count = count + 1 + if type(k) == "string" then + table.insert(flat, #lvl > 0 and lvl .. "." .. k or k) + end + -- Inner table but do it recursively only when this run hasn't found it + -- already. + if type(v) == "table" and not visited[v] then + -- check to avoid in recursive call + visited[v] = true + if type(k) == "string" then + flatten_recursively(v, #lvl > 0 and lvl .. "." .. k or k) + end + -- Uncheck to allow to visit the same table but from different path. + visited[v] = nil + end + end + end + + -- start from _G + flatten_recursively(_G) + + -- add paths from file(s) + local pathfiles = lua_omni_files() + for _, fname in ipairs(pathfiles) do + -- there is chance that filename is invalid so guard for error + local res, err = pcall(function() + for line in io.lines(fname) do + -- trim line + line = string.gsub(line, "^%s-(%S.-)%s-$", "%1") + -- put every line as path + table.insert(flat, line) + end + end) + -- If pcall above did catch error then echo about it. + if not res then vimutils.command('echoerr "' .. tostring(err) .. '"') end + end + + local res = {} + -- match paths with pattern + for _, v in ipairs(flat) do + if string.match(v, pat) then table.insert(res, v) end + end + + return res +end + +local function complete_base_string(base) + local t = {} + + if type(base) == "string" then + -- completion using _G environment + -- obsolete the new version seems better + -- local comps = find_completions2(base) + -- for _, v in pairs(comps) do + -- table.insert(t, v[1]) + -- end + -- table.sort(t) + + local sortbylen = false + local pat = string.match(base, '^[%a_][%a%d_]*$') + if pat then -- single word completion + pat = ".*" .. escape_magic_chars(pat) .. ".*" + sortbylen = true + else -- full completion + pat = glob_to_pattern(base) + if not string.match(pat, '%.%*$') then pat = pat .. '.*' end + end + -- try to find something matching... + t = find_completions3("^" .. pat .. "$") + -- in a case no results were found try to expand dots + if #t == 0 then + pat = string.gsub(base, "%.", "[^.]*%%.") .. '.*' + t = find_completions3("^" .. pat .. "$") + end + + -- For single word matches it's more convenient to have results sorted by + -- their string length. + if sortbylen then + table.sort(t, function(o1, o2) + o1 = o1 or "" + o2 = o2 or "" + local l1 = string.len(o1) + local l2 = string.len(o2) + return l1 < l2 + end) + else + table.sort(t) + end + + -- Always do variable assignments matching per buffer now as + -- find_assigments will return most close assignments first. + local assigments = {} + for i, v in ipairs(find_assigments()) do + if string.find(v, "^" .. base) then table.insert(assigments, v) end + end + t = merge_list(assigments, t) + end + return t +end + + + +function complete.complete(findstart, base) + -- this function is called twice - first for finding range in line to complete + if findstart == 1 then + vimutil.command("return " .. completion_findstart()) + else -- the second run - do proper complete + local comps = complete_base_string(base) + for i = 1, #comps do comps[i] = "'" .. comps[i] .. "'" end + -- returning + vimutil.command("return [" .. table.concat(comps, ", ") .. "]") + end +end + + +return complete diff --git a/bundle/vim-lua/lua/luavi/fold.lua b/bundle/vim-lua/lua/luavi/fold.lua new file mode 100644 index 000000000..e69de29bb diff --git a/bundle/vim-lua/lua/luavi/vimutils.lua b/bundle/vim-lua/lua/luavi/vimutils.lua new file mode 100644 index 000000000..c80a9a46d --- /dev/null +++ b/bundle/vim-lua/lua/luavi/vimutils.lua @@ -0,0 +1,66 @@ +vimutils = {} + +vimutils.constant = "hello" + +function table.has_key(test_table, test_key) + for key, value in pairs(test_table) do + if key == test_key then + return true + end + end + return false +end + +local is_nvim = table.has_key(vim, 'api') + +function vimutils.command(cmd) + if is_nvim then + vim.api.nvim_command(cmd) + else + vim.command(cmd) + end +end + + +function vimutils.eval(expr) + if is_nvim then + return vim.api.nvim_eval(expr) + else + return vim.eval(expr) + end +end + + +function vimutils.get_current_line() + if is_nvim then + return vim.api.nvim_get_current_line() + else + return vim.window().line + end +end + +local buffer_metatables = { + __index = function (self, line) + return vim.api.nvim_buf_get_lines(self._bufnr, 0, -1, 0)[line] + end, + __len = function (self) + return #vim.api.nvim_buf_get_lines(self._bufnr, 0, -1, 0) + end +} + +function vimutils.current_buffer() + if is_nvim then + local buffer = {} + buffer._bufnr = vim.api.nvim_get_current_buf() + setmetatable(buffer, buffer_metatables) + return buffer + else + return vim.window().buffer + end +end + +function vimutils.current_linenr() + return vimutils.eval('line(".")') +end + +return vimutils diff --git a/bundle/vim-lua/plugin/lua.vim b/bundle/vim-lua/plugin/lua.vim new file mode 100644 index 000000000..b9707f4c8 --- /dev/null +++ b/bundle/vim-lua/plugin/lua.vim @@ -0,0 +1,51 @@ +"" +" @section Introduction, intro +" @order intro mappings +" lua development plugin for vim and neovim. + + +" check if Vim is in correct version and has Lua support +if v:version < 703 + finish +endif +if !has('lua') && !has('nvim') + finish +endif + +if !has('nvim') && has('lua') + " add lua path + let s:plugin_dir = fnamemodify(expand(''), ':h:h').'\lua' + let s:str = s:plugin_dir . '\?.lua;' . s:plugin_dir . '\?\init.lua;' + lua package.path=vim.eval("s:str") .. package.path +endif + +" save and reset compatibility options +let s:save_cpo = &cpo +set cpo&vim + +if exists('g:luacomplete_loaded') + finish +else + let g:luacomplete_loaded = 1 +endif + +"" +" Diable/Enable default mappings in lua buffer. +" > +" mode key functinon +" normal fl print functin list +" < +let g:lua_default_mappings = 0 + +"" +" @section Mappings, mappings +" luacomplete defined some mappings for lua buffer: +" > +" PrintFunctionList print functino list +" WriteAndLuaFile wirte and luafile +" < + +noremap