pax_global_header00006660000000000000000000000064150132731720014513gustar00rootroot0000000000000052 comment=c9191ee9e13e86a7b40c3d25c8bf7907c085a1cf cape-2.1/000077500000000000000000000000001501327317200122655ustar00rootroot00000000000000cape-2.1/.elpaignore000066400000000000000000000000331501327317200144070ustar00rootroot00000000000000LICENSE .elpaignore .githubcape-2.1/.github/000077500000000000000000000000001501327317200136255ustar00rootroot00000000000000cape-2.1/.github/ISSUE_TEMPLATE/000077500000000000000000000000001501327317200160105ustar00rootroot00000000000000cape-2.1/.github/ISSUE_TEMPLATE/bug_report.md000066400000000000000000000011301501327317200204750ustar00rootroot00000000000000--- title: name: 🐞 Bug report about: Report a bug. Do not use this for questions, support or feature requests. --- Thank you for reporting a bug. Please use the latest stable release of Emacs 30.1 and start with `emacs -Q` or `package-isolate` in order to only load a minimal set of packages. This way your Emacs configuration is not loaded. Please provide precise information and the exact steps to reproduce the issue. This is important to ensure that your problem can be reproduced on a different machine. If you are not really sure if your issue is a bug, please open a discussion instead. cape-2.1/.github/ISSUE_TEMPLATE/config.yml000066400000000000000000000026561501327317200200110ustar00rootroot00000000000000blank_issues_enabled: false contact_links: - name: "🙏 Please support my work on Cape and my other Emacs packages" url: https://github.com/sponsors/minad about: Thanks! Your support helps dedicating time to project maintenance and development. - name: "💡 Suggest a feature ➞ Please create a discussion" url: https://github.com/minad/cape/discussions/categories/ideas about: Start a new discussion suggesting an improvement or a feature. - name: "🧑‍🤝‍🧑 Ask the community for support" url: https://www.reddit.com/r/emacs about: Please be kind and support others. - name: "🤓 Ask the maintainer for support ➞ Please create a discussion" url: https://github.com/minad/cape/discussions/categories/q-a about: Please keep in mind that my bandwidth is limited. - name: "🔍 Search through old issues or discussions" url: https://github.com/search?q=repo%3Aminad%2Fcape&type=issues about: The same question may have been asked before. # - name: "📝 Cape wiki" # url: https://github.com/minad/cape/wiki # about: Additional configuration tips are covered there. Feel free to edit! - name: "📝 Corfu wiki" url: https://github.com/minad/corfu/wiki about: Additional configuration tips are covered there. Feel free to edit! - name: "📖 Cape manual" url: https://github.com/minad/cape/blob/main/README.org about: The manual covers the basic setup and workflow. cape-2.1/.gitignore000066400000000000000000000001021501327317200142460ustar00rootroot00000000000000*-autoloads.el *-pkg.el *.elc *.info *.texi *~ \#*\# /README-elpa cape-2.1/CHANGELOG.org000066400000000000000000000134211501327317200142660ustar00rootroot00000000000000#+title: cape.el - Changelog #+author: Daniel Mendler #+language: en * Version 2.1 (2025-05-21) - Simplify ~cape-dabbrev~ configuration. - ~cape-dabbrev-buffer-function~: New variable to configure the buffers searched by ~cape-dabbrev~. - ~cape-dabbrev-check-other-buffers~: Removed in favor of ~cape-dabbrev-buffer-function~. - ~cape-dabbrev-min-length~: Remove variable, since it leads to confusion due to missing completion candidates. - ~cape-same-mode-buffers~: New public function, renamed from ~cape--buffers-major-mode~. - ~cape-text-buffers~: New function. - ~cape-dabbrev-buffer-function~, ~cape-line-buffer-function~: Use ~cape-same-mode-buffers~. * Version 2.0 (2025-03-11) - ~cape-file~: Improve handling of environment variables as part of the path, e.g., ~$HOME~. - ~cape-company-to-capf~: Handle updated return value convention of the ~prefix~ action of Company backends. * Version 1.9 (2025-01-28) - ~cape-capf-super~: Use extra metadata instead of completion table metadata. - ~cape-emoji~: Improve emoji name normalization. * Version 1.8 (2024-12-22) - Require Emacs 28.1. - ~cape-capf-properties~: Add ~:strip~ keyword to strip a Capf of its metadata. - ~cape-capf-sort~: New function. - Add ~:display-sort-function~ and ~:cycle-sort-function~ functions to the various Capf property lists. * Version 1.7 (2024-08-26) - ~cape-elisp-symbol~: Add wrappers only if not yet there. - ~cape-elisp-symbol~: Add wrappers in ~emacs-lisp-mode~ inside strings/comments. * Version 1.6 (2024-07-23) - Add ~cape-prefix-map~ for simplified configuration. - ~cape-wrap-super~: Bugfix. Ensure that annotation functions are called with candidates belonging to the originating Capf. - Disallow ~cape-company-to-capf~ if ~company-mode~ is enabled. - Bump Compat dependency to Compat 30. * Version 1.5 (2024-04-12) - ~cape-file-prefix~: New variable to customize file name completion prefix. If the input matches one of the configured prefixes, file completion is started. - ~cape-capf-super~: Support Capfs which return different prefix lengths. This change improves compatibility with Company. - ~cape-capf-super~: Add support for the ~:with~ keyword. See the docstring of ~cape-wrap-super~ for details. This change improves compatibility with Company. - ~cape-capf-super~: The resulting Capf is exclusive if one of the main Capfs (the Capfs listed before the ~:with~ keyword) is exclusive. - ~cape-capf-super~: If the resulting Capf is non-exclusive, one of the main Capfs must have returned candidates, in order for the resulting Capf to return candidates. - ~cape-capf-super~: Normalize plists which are attached to candidates. This helps with deduplication, such that only candidates with different annotations or icons appear twice. - ~cape-dabbrev-check-other-buffers~: Support function as customization value. The function should return the exact list of buffers to search. * Version 1.4 (2024-03-08) - =cape-char=: Look back from point, instead of using the match at point. This makes sure that double quotes of a string literal behind point are not included in the completion. - =cape-capf-inside-faces=: Use the face before point to handle completion at the end of comments more gracefully. * Version 1.3 (2024-02-14) - Add =cape-wrap-inside-code= and =cape-capf-inside-code=. * Version 1.2 (2024-01-23) - =cape-capf-super=: Bugfixes. * Version 1.1 (2023-12-27) - =cape-capf-super=, =cape-company-to-capf=: Support duplicate candidates. - Remove obsolete function aliases ~cape-super-capf~, ~cape-interactive-capf~ and ~cape-symbol~. * Version 1.0 (2023-12-01) - =cape-emoji=: New Capf available on Emacs 29 and newer. - =cape-wrap-debug=, =cape-capf-debug=: New Capf transformers to add debug messages to a Capf. - =cape-wrap-passthrough=, =cape-capf-passthrough=: New Capf transformers to defeat completion style filtering. - =cape-capf-inside-faces=, =cape-wrap-inside-faces=: New transformer - Rename =cape-super-capf= to =cape-capf-super=. Add =cape-wrap-super= for consistency with other Capf combinators. - Rename =cape-interactive-capf= to =cape-capf-interactive= for consistency with other Capf combinators. - Rename =cape-symbol= to =cape-elisp-symbol=. * Version 0.17 (2023-08-14) - Bugfixes. - =cape-dict=: Always use grep, remove =cape-dict-use-grep=. - =cape-dict=: Add =cape-dict-limit=. - Remove obsolete alias =cape-ispell=. - Generalize =cape--cached-table=. The candidate computation function must return a pair of a predicate function and the list of candidates. * Version 0.16 (2023-07-02) - =cape-dabbrev=: Respect =dabbrev-abbrev-char-regexp= and =dabbrev-abbrev-skip-leading-regexp=. - =cape-file=: Quote file names in comint/eshell buffers. * Version 0.15 (2023-04-17) - Bugfixes * Version 0.14 (2023-04-13) - =cape-wrap-buster=, =cape-capf-buster= and =cape-company-to-capf=: The argument VALID must be a function taking two arguments, the old and new input. It should return nil if the input must be considered invalid such that the candidates must be recomputed. - =cape-ispell=: Deprecate in favor of improved =cape-dict=. Note that =cape-ispell= and =ispell-lookup-words= did not really consult =ispell= or =aspell=, but only grep through the word list specified by =ispell-alternate-dictionary=. - =cape-dict-file=: Support multiple dictionary files or a function returning one or more files. - =cape-dict=, =cape-dabbrev=: Replace case depending on initial input. - =cape-dict-case-replace=: New variable to configure case replacement, similar to =dabbrev-case-replace=. - =cape-dict-case-fold=: New variable to configure if case is ignored during search and completion. - =cape-elisp-block=: Complete Elisp in Org or Markdown code block. This Capf is particularly useful for literate Emacs configurations. * Version 0.13 (2023-02-15) - Start of changelog. cape-2.1/LICENSE000066400000000000000000001045151501327317200133000ustar00rootroot00000000000000 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 . cape-2.1/README.org000066400000000000000000000354751501327317200137510ustar00rootroot00000000000000#+title: cape.el - Let your completions fly! #+author: Daniel Mendler #+language: en #+export_file_name: cape.texi #+texinfo_dir_category: Emacs misc features #+texinfo_dir_title: Cape: (cape). #+texinfo_dir_desc: Completion At Point Extensions #+html: GNU Emacs #+html: GNU ELPA #+html: GNU-devel ELPA #+html: MELPA #+html: MELPA Stable Cape provides Completion At Point Extensions which can be used in combination with [[https://github.com/minad/corfu][Corfu]], [[https://github.com/company-mode/company-mode][Company]] or the default completion UI. The completion backends used by ~completion-at-point~ are so called ~completion-at-point-functions~ (Capfs). #+html: You can register the ~cape-*~ functions in the ~completion-at-point-functions~ list. This makes the backends available for completion, which is usually invoked by pressing ~TAB~ or ~M-TAB~. The functions can also be invoked interactively to trigger the respective completion at point. You can bind them directly to a key in your user configuration. Notable commands/Capfs are ~cape-line~ for completion of a line from the current buffer, ~cape-history~ for history completion in shell or Comint modes and ~cape-file~ for completion of file names. The commands ~cape-elisp-symbol~ and ~cape-elisp-block~ are useful for documentation of Elisp packages or configurations, since they complete Elisp anywhere. Cape has the super power to transform Company backends into Capfs and merge multiple Capfs into a Super-Capf! These transformers allow you to still take advantage of Company backends even if you are not using Company as frontend. #+toc: headlines 8 * Available Capfs + ~cape-abbrev~: Complete abbreviation (~add-global-abbrev~, ~add-mode-abbrev~). + ~cape-dabbrev~: Complete word from current buffers. See also ~dabbrev-capf~ on Emacs 29. + ~cape-dict~: Complete word from dictionary file. + ~cape-elisp-block~: Complete Elisp in Org or Markdown code block. + ~cape-elisp-symbol~: Complete Elisp symbol. + ~cape-emoji~: Complete Emoji. Available on Emacs 29 and newer. + ~cape-file~: Complete file name. + ~cape-history~: Complete from Eshell, Comint or minibuffer history. + ~cape-keyword~: Complete programming language keyword. + ~cape-line~: Complete entire line from current buffer. + ~cape-rfc1345~: Complete Unicode char using RFC 1345 mnemonics. + ~cape-sgml~: Complete Unicode char from SGML entity, e.g., ~&alpha~. + ~cape-tex~: Complete Unicode char from TeX command, e.g. ~\hbar~. * Configuration Cape is available on GNU ELPA and MELPA. You can install the package with ~package-install~. In the following we present a sample configuration based on the popular ~use-package~ macro. I recommend to bind the =cape-*= completion commands to keys such that you can invoke them explicitly. This makes particular sense for special Capfs which you only want to trigger in rare circumstances. See the =:bind= specification below. Furthermore the =cape-*= functions are Capfs which you can add to the =completion-at-point-functions= list. Take care when adding Capfs to the list since each of the Capfs adds a small runtime cost. Note that the Capfs which occur earlier in the list take precedence, such that the first Capf returning a result will win and the later Capfs may not get a chance to run. In order to merge Capfs you can try the function =cape-capf-super=. One must distinguish the buffer-local and the global value of the =completion-at-point-functions= variable. The buffer-local value of the list takes precedence, but if the buffer-local list contains the symbol =t= at the end, it means that the functions specified in the global list should be executed afterwards. The special meaning of the value =t= is a feature of the =run-hooks= function, see the section [[info:elisp#Running Hooks]["Running Hooks" in the Elisp manual]] for further information. #+begin_src emacs-lisp ;; Enable Corfu completion UI ;; See the Corfu README for more configuration tips. (use-package corfu :init (global-corfu-mode)) ;; Add extensions (use-package cape ;; Bind prefix keymap providing all Cape commands under a mnemonic key. ;; Press C-c p ? to for help. :bind ("C-c p" . cape-prefix-map) ;; Alternative key: M-, M-p, M-+ ;; Alternatively bind Cape commands individually. ;; :bind (("C-c p d" . cape-dabbrev) ;; ("C-c p h" . cape-history) ;; ("C-c p f" . cape-file) ;; ...) :init ;; Add to the global default value of `completion-at-point-functions' which is ;; used by `completion-at-point'. The order of the functions matters, the ;; first function returning a result wins. Note that the list of buffer-local ;; completion functions takes precedence over the global list. (add-hook 'completion-at-point-functions #'cape-dabbrev) (add-hook 'completion-at-point-functions #'cape-file) (add-hook 'completion-at-point-functions #'cape-elisp-block) ;; (add-hook 'completion-at-point-functions #'cape-history) ;; ... ) #+end_src * CAPF adapters and transformers ** Company adapter /Wrap your Company backend in a Cape and turn it into a Capf!/ Cape provides the adapter ~cape-company-to-capf~ for Company backends. The adapter transforms Company backends to Capfs which are understood by the built-in Emacs completion mechanism. The function is approximately the inverse of the ~company-capf~ backend from Company. The adapter can be used as follows: #+begin_src emacs-lisp ;; Use Company backends as Capfs. (setq-local completion-at-point-functions (mapcar #'cape-company-to-capf (list #'company-files #'company-keywords #'company-dabbrev))) #+end_src Note that the adapter does not require Company to be installed or enabled. Backends implementing the Company specification do not necessarily have to depend on Company, however in practice most backends do. The following shows a small example completion backend, which can be used with both ~completion-at-point~ (Corfu, default completion) and Company. #+begin_src emacs-lisp (defvar demo-alist '((":-D" . "😀") (";-)" . "😉") (":-/" . "😕") (":-(" . "🙁") (":-*" . "😙"))) (defun demo-backend (action &optional arg &rest _) (pcase action ('prefix (and (memq (char-before) '(?: ?\;)) (cons (string (char-before)) t))) ('candidates (all-completions arg demo-alist)) ('annotation (concat " " (cdr (assoc arg demo-alist)))) ('post-completion (let ((str (buffer-substring (- (point) 3) (point)))) (delete-region (- (point) 3) (point)) (insert (cdr (assoc str demo-alist))))))) ;; Register demo backend with `completion-at-point' (setq completion-at-point-functions (list (cape-company-to-capf #'demo-backend))) ;; Register demo backend with Company. (setq company-backends '(demo-backend)) #+end_src It is possible to merge multiple Company backends and use them as a single Capf using the ~company--multi-backend-adapter~ function from Company. The adapter transforms multiple Company backends into a single Company backend, which can then be used as a Capf via ~cape-company-to-capf~. Capfs can be merged directly with ~cape-capf-super~. #+begin_src emacs-lisp (require 'company) ;; Use the company-dabbrev and company-elisp backends together. (setq completion-at-point-functions (list (cape-company-to-capf (apply-partially #'company--multi-backend-adapter '(company-dabbrev company-elisp))))) #+end_src ** Super-Capf - Merging multiple Capfs /Throw multiple Capfs under the Cape and get a Super-Capf!/ Cape supports merging multiple Capfs using the function ~cape-capf-super~. Due to some technical details, not all Capfs can be merged successfully. Merge Capfs one by one and make sure that you get the desired outcome. Note that ~cape-capf-super~ is not needed if multiple Capfs should betried one after the other, for example you can use ~cape-file~ together with programming mode Capfs by adding ~cape-file~ to the ~completion-at-point-functions~ list. File completion will then be available in comments and string literals, but not in normal code. ~cape-capf-super~ is only necessary if you want to combine multiple Capfs, such that the candidates from multiple sources appear /together/ in the completion list at the same time. Capf merging requires completion functions which are sufficiently well-behaved and completion functions which do not define completion boundaries. ~cape-capf-super~ has the same restrictions as ~completion-table-merge~ and ~completion-table-in-turn~. As a simple rule of thumb, ~cape-capf-super~ works for static completion functions like ~cape-dabbrev~, ~cape-keyword~, ~cape-dict~, etc., but not for multi-step completions like ~cape-file~. #+begin_src emacs-lisp ;; Merge the dabbrev, dict and keyword capfs, display candidates together. (setq-local completion-at-point-functions (list (cape-capf-super #'cape-dabbrev #'cape-dict #'cape-keyword))) ;; Alternative: Define named Capf instead of using the anonymous Capf directly (defun cape-dabbrev-dict-keyword () (cape-wrap-super #'cape-dabbrev #'cape-dict #'cape-keyword)) (setq-local completion-at-point-functions (list #'cape-dabbrev-dict-keyword)) #+end_src See also the aforementioned ~company--multi-backend-adapter~ from Company, which allows you to merge multiple Company backends. ** Capf-Buster - Cache busting /The Capf-Buster ensures that you always get a fresh set of candidates!/ If a Capf caches the candidates for too long we can use a cache busting Capf-transformer. For example the Capf merging function ~cape-capf-super~ creates a Capf, which caches the candidates for the whole lifetime of the Capf. Therefore you may want to combine a merged Capf with a cache buster under some circumstances. It is noteworthy that the ~company-capf~ backend from Company refreshes the completion table frequently. With the ~cape-capf-buster~ we can achieve a similarly refreshing strategy. #+begin_src emacs-lisp (setq-local completion-at-point-functions (list (cape-capf-buster #'some-caching-capf))) #+end_src ** Capf transformers Cape provides a set of additional Capf transformation functions, which are mostly meant to used by experts to fine tune the Capf behavior and Capf interaction. These can either be used as advices (=cape-wrap-*)= or to create a new Capf from an existing Capf (=cape-capf-*=). You can bind the Capfs created by the Capf transformers with =defalias= to a function symbol. - ~cape-capf-accept-all~, ~cape-wrap-accept-all~: Create a Capf which accepts every input as valid. - ~cape-capf-case-fold~, ~cape-wrap-case-fold~: Create a Capf which is case insensitive. - ~cape-capf-debug~, ~cape-wrap-debug~: Create a Capf which prints debugging messages. - ~cape-capf-inside-code~, ~cape-wrap-inside-code~: Ensure that Capf triggers only inside code. - ~cape-capf-inside-comment~, ~cape-wrap-inside-comment~: Ensure that Capf triggers only inside comments. - ~cape-capf-inside-faces~, ~cape-wrap-inside-faces~: Ensure that Capf triggers only inside text with certain faces. - ~cape-capf-inside-string~, ~cape-wrap-inside-string~: Ensure that Capf triggers only inside a string literal. - ~cape-capf-interactive~, ~cape-interactive~: Create a Capf which can be called interactively. - ~cape-capf-nonexclusive~, ~cape-wrap-nonexclusive~: Mark Capf as non-exclusive. - ~cape-capf-noninterruptible~, ~cape-wrap-noninterruptible~: Protect a Capf which does not like to be interrupted. - ~cape-capf-passthrough~, ~cape-wrap-passthrough~: Defeat entire completion style filtering. - ~cape-capf-predicate~, ~cape-wrap-predicate~: Add candidate predicate to a Capf. - ~cape-capf-prefix-length~, ~cape-wrap-prefix-length~: Enforce a minimal prefix length. - ~cape-capf-properties~, ~cape-wrap-properties~: Add completion properties to a Capf. - ~cape-capf-purify~, ~cape-wrap-purify~: Purify a broken Capf and ensure that it does not modify the buffer. - ~cape-capf-silent~, ~cape-wrap-silent~: Silence Capf messages and errors. - ~cape-capf-sort~, ~cape-wrap-sort~: Add sort function to a Capf. - ~cape-capf-super~, ~cape-wrap-super~: Merge multiple Capfs into a Super-Capf. In the following we show a few example configurations, which have come up on the [[https://github.com/minad/cape/issues][Cape]] or [[https://github.com/minad/corfu/issues][Corfu issue tracker]] or the [[https://github.com/minad/corfu/wiki][Corfu wiki.]] I use some of these tweaks in my personal configuration. #+begin_src emacs-lisp ;; Example 1: Sanitize the `pcomplete-completions-at-point' Capf. The Capf has ;; undesired side effects on Emacs 28. These advices are not needed on Emacs 29 ;; and newer. (when (< emacs-major-version 29) (advice-add 'pcomplete-completions-at-point :around #'cape-wrap-silent) (advice-add 'pcomplete-completions-at-point :around #'cape-wrap-purify)) ;; Example 2: Configure a Capf with a specific auto completion prefix length (setq-local completion-at-point-functions (list (cape-capf-prefix-length #'cape-dabbrev 2))) ;; Example 3: Create a Capf with debugging messages (setq-local completion-at-point-functions (list (cape-capf-debug #'cape-dict))) ;; Example 4: Named Capf (defalias 'cape-dabbrev-min-2 (cape-capf-prefix-length #'cape-dabbrev 2)) (setq-local completion-at-point-functions (list #'cape-dabbrev-min-2)) ;; Example 5: Define a defensive Dabbrev Capf, which accepts all inputs. If you ;; use Corfu and `corfu-auto=t', the first candidate won't be auto selected if ;; `corfu-preselect=valid', such that it cannot be accidentally committed when ;; pressing RET. (defun my-cape-dabbrev-accept-all () (cape-wrap-accept-all #'cape-dabbrev)) (add-hook 'completion-at-point-functions #'my-cape-dabbrev-accept-all) ;; Example 6: Define interactive Capf which can be bound to a key. Here we wrap ;; the `elisp-completion-at-point' such that we can complete Elisp code ;; explicitly in arbitrary buffers. (keymap-global-set "C-c p e" (cape-capf-interactive #'elisp-completion-at-point)) ;; Example 7: Ignore :keywords in Elisp completion. (defun ignore-elisp-keywords (sym) (not (keywordp sym))) (setq-local completion-at-point-functions (list (cape-capf-predicate #'elisp-completion-at-point #'ignore-elisp-keywords))) #+end_src * Contributions Since this package is part of [[https://elpa.gnu.org/packages/cape.html][GNU ELPA]] contributions require a copyright assignment to the FSF. cape-2.1/cape-char.el000066400000000000000000000136301501327317200144350ustar00rootroot00000000000000;;; cape-char.el --- Character completion functions -*- lexical-binding: t -*- ;; Copyright (C) 2021-2025 Free Software Foundation, Inc. ;; This file is part of GNU Emacs. ;; 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 . ;;; Commentary: ;; This package provides the `cape-emoji', `cape-tex', `cape-sgml' and ;; `cape-rfc1345' completion functions. ;;; Code: (require 'cape) (declare-function quail-deactivate "quail") (declare-function quail-build-decode-map "quail") (declare-function quail-map "quail") (eval-and-compile (defun cape-char--translation (method prefix) "Return character translation hash for input method METHOD. PREFIX are the prefix characters. Names (hash keys) that map to multiple candidates (hash values) in the quail translation map are not included. Hash values are either char or strings." (when-let ((im (assoc method input-method-alist)) ((eq #'quail-use-package (nth 2 im)))) (let ((hash (make-hash-table :test #'equal)) (dm (list 'decode-map))) (require 'quail) (apply #'quail-use-package method (nthcdr 5 im)) (quail-build-decode-map (list (quail-map)) "" dm 0) (pcase-dolist (`(,name . ,val) (cdr dm)) (when (equal method "emoji") (setq name (replace-regexp-in-string ": " "-" (replace-regexp-in-string "[’“”!()]" "" (replace-regexp-in-string "[_ &.]+" "-" name)))) (when (string-match-p "\\`[[:alnum:]-]*\\'" name) (setq name (format ":%s:" name)))) (when (memq (aref name 0) prefix) (puthash name (if (vectorp val) (aref val 0) val) hash))) (quail-deactivate) hash)))) (defun cape-char--annotation (hash name) "Lookup NAME in HASH and return annotation." (when-let ((char (gethash name hash))) (format (if (stringp char) " %s " " %c ") char))) (defun cape-char--signature (hash name) "Lookup NAME in HASH and return signature." (when-let ((val (gethash name hash))) (concat (and (stringp val) (concat val " = ")) (mapconcat (lambda (char) (format "%c %s (%s)" char (get-char-code-property char 'name) (char-code-property-description 'general-category (get-char-code-property char 'general-category)))) (if (stringp val) val (list val)) " + ")))) (defun cape-char--exit (hash name status) "Exit function given completion STATUS, looks-up NAME in HASH." (when-let (((not (eq status 'exact))) (char (gethash name hash))) (delete-region (max (point-min) (- (point) (length name))) (point)) (insert char))) (defmacro cape-char--define (name method &rest prefix) "Define character translation Capf. NAME is the name of the Capf. METHOD is the input method. PREFIX are the prefix characters." (when-let ((capf (intern (format "cape-%s" name))) (pre-req (intern (format "cape-%s-prefix-required" name))) (props (intern (format "cape--%s-properties" name))) (pre-rx (concat (regexp-opt (mapcar #'char-to-string prefix)) "[^ \n\t]*" )) (hash (intern (format "cape--%s-hash" name))) (hash-val (cape-char--translation method prefix))) `(progn (defvar ,hash ,hash-val) (defcustom ,pre-req t ,(format "Initial prefix is required for `%s' to trigger." capf) :type 'boolean :group 'cape) (defvar ,props (list :annotation-function (apply-partially #'cape-char--annotation ,hash) :company-docsig (apply-partially #'cape-char--signature ,hash) :exit-function (apply-partially #'cape-char--exit ,hash) :company-kind (lambda (_) 'text) :category ',capf :exclusive 'no) ,(format "Completion extra properties for `%s'." capf)) (defun ,capf (&optional interactive) ,(format "Complete Unicode character at point. Uses the input format of the %s input method, see (describe-input-method %S). If INTERACTIVE is nil the function acts like a Capf." method method) (interactive (list t)) (if interactive ;; No cycling since it breaks the :exit-function. (let (completion-cycle-threshold ,pre-req) (when (and (memq last-input-event ',prefix) (not (looking-back ,pre-rx (pos-bol)))) (self-insert-command 1 last-input-event)) (cape-interactive #',capf)) (when-let ((bounds (cond ((looking-back ,pre-rx (pos-bol)) (cons (match-beginning 0) (point))) ((not ,pre-req) (cons (point) (point)))))) (append (list (car bounds) (cdr bounds) ,hash) ,props))))))) ;;;###autoload (autoload 'cape-tex "cape-char" nil t) (cape-char--define tex "TeX" ?\\ ?^ ?_) ;;;###autoload (autoload 'cape-sgml "cape-char" nil t) (cape-char--define sgml "sgml" ?&) ;;;###autoload (autoload 'cape-rfc1345 "cape-char" nil t) (cape-char--define rfc1345 "rfc1345" ?&) ;;;###autoload (when (> emacs-major-version 28) (autoload 'cape-emoji "cape-char" nil t)) (cape-char--define emoji "emoji" ?:) (provide 'cape-char) ;;; cape-char.el ends here cape-2.1/cape-keyword.el000066400000000000000000000657561501327317200152240ustar00rootroot00000000000000;;; cape-keyword.el --- Keyword completion function -*- lexical-binding: t -*- ;; Copyright (C) 2021-2025 Free Software Foundation, Inc. ;; This file is part of GNU Emacs. ;; 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 . ;;; Commentary: ;; This package provides the `cape-keyword' completion function. ;;; Code: (require 'cape) (defcustom cape-keyword-list ;; This variable was taken from company-keywords.el. ;; Please contribute corrections or additions to both Cape and Company. '((c++-mode ;; https://en.cppreference.com/w/cpp/keyword "alignas" "alignof" "and" "and_eq" "asm" "atomic_cancel" "atomic_commit" "atomic_noexcept" "auto" "bitand" "bitor" "bool" "break" "case" "catch" "char" "char16_t" "char32_t" "char8_t" "class" "co_await" "co_return" "co_yield" "compl" "concept" "const" "const_cast" "consteval" "constexpr" "constinit" "continue" "decltype" "default" "delete" "do" "double" "dynamic_cast" "else" "enum" "explicit" "export" "extern" "false" "final" "float" "for" "friend" "goto" "if" "import" "inline" "int" "long" "module" "mutable" "namespace" "new" "noexcept" "not" "not_eq" "nullptr" "operator" "or" "or_eq" "override" "private" "protected" "public" "reflexpr" "register" "reinterpret_cast" "requires" "return" "short" "signed" "sizeof" "static" "static_assert" "static_cast" "struct" "switch" "synchronized" "template" "this" "thread_local" "throw" "true" "try" "typedef" "typeid" "typename" "union" "unsigned" "using" "virtual" "void" "volatile" "wchar_t" "while" "xor" "xor_eq") (c-mode ;; https://en.cppreference.com/w/c/keyword "_Alignas" "_Alignof" "_Atomic" "_Bool" "_Complex" "_Decimal128" "_Decimal32" "_Decimal64" "_Generic" "_Imaginary" "_Noreturn" "_Static_assert" "_Thread_local" "__asm__" "asm" "auto" "break" "case" "char" "const" "continue" "default" "do" "double" "else" "enum" "extern" "float" "for" "goto" "if" "inline" "int" "long" "register" "restrict" "return" "short" "signed" "sizeof" "static" "struct" "switch" "typedef" "union" "unsigned" "void" "volatile" "while") (caml-mode ;; ocaml, from https://v2.ocaml.org/manual/lex.html#sss:keywords "and" "as" "asr" "assert" "begin" "class" "constraint" "do" "done" "downto" "else" "end" "exception" "external" "false" "for" "fun" "function" "functor" "if" "in" "include" "inherit" "initializer" "land" "lazy" "let" "lor" "lsl" "lsr" "lxor" "match" "method" "mod" "module" "mutable" "new" "nonrec" "object" "of" "open" "or" "private" "rec" "sig" "struct" "then" "to" "true" "try" "type" "val" "virtual" "when" "while" "with") (crystal-mode ;; https://github.com/crystal-lang/crystal-book "abstract" "alias" "annotation" "as" "as?" "asm" "begin" "break" "case" "class" "def" "do" "else" "elsif" "end" "ensure" "enum" "extend" "false" "for" "fun" "if" "in" "include" "instance_sizeof" "is_a?" "lib" "macro" "module" "next" "nil" "nil?" "of" "offsetof" "out" "pointerof" "private" "protected" "require" "rescue" "responds_to?" "return" "select" "self" "sizeof" "struct" "super" "then" "true" "type" "typeof" "uninitialized" "union" "unless" "until" "verbatim" "when" "while" "with" "yield") (csharp-mode "abstract" "add" "alias" "as" "base" "bool" "break" "byte" "case" "catch" "char" "checked" "class" "const" "continue" "decimal" "default" "delegate" "do" "double" "else" "enum" "event" "explicit" "extern" "false" "finally" "fixed" "float" "for" "foreach" "get" "global" "goto" "if" "implicit" "in" "int" "interface" "internal" "is" "lock" "long" "namespace" "new" "null" "object" "operator" "out" "override" "params" "partial" "private" "protected" "public" "readonly" "ref" "remove" "return" "sbyte" "sealed" "set" "short" "sizeof" "stackalloc" "static" "string" "struct" "switch" "this" "throw" "true" "try" "typeof" "uint" "ulong" "unchecked" "unsafe" "ushort" "using" "value" "var" "virtual" "void" "volatile" "where" "while" "yield") (d-mode ;; https://www.digitalmars.com/d/2.0/lex.html "abstract" "alias" "align" "asm" "assert" "auto" "body" "bool" "break" "byte" "case" "cast" "catch" "cdouble" "cent" "cfloat" "char" "class" "const" "continue" "creal" "dchar" "debug" "default" "delegate" "delete" "deprecated" "do" "double" "else" "enum" "export" "extern" "false" "final" "finally" "float" "for" "foreach" "foreach_reverse" "function" "goto" "idouble" "if" "ifloat" "import" "in" "inout" "int" "interface" "invariant" "ireal" "is" "lazy" "long" "macro" "mixin" "module" "new" "nothrow" "null" "out" "override" "package" "pragma" "private" "protected" "public" "pure" "real" "ref" "return" "scope" "short" "static" "struct" "super" "switch" "synchronized" "template" "this" "throw" "true" "try" "typedef" "typeid" "typeof" "ubyte" "ucent" "uint" "ulong" "union" "unittest" "ushort" "version" "void" "volatile" "wchar" "while" "with") (elixir-mode ;; https://hexdocs.pm/elixir/Kernel.html "__CALLER__" "__DIR__" "__ENV__" "__MODULE__" "__STACKTRACE__" "__aliases__" "__block__" "abs" "alias" "alias!" "and" "apply" "binary_part" "binary_slice" "binding" "bit_size" "byte_size" "case" "ceil" "cond" "dbg" "def" "defdelegate" "defexception" "defguard" "defguardp" "defimpl" "defmacro" "defmacrop" "defmodule" "defoverridable" "defp" "defprotocol" "defstruct" "destructure" "div" "elem" "exit" "floor" "fn" "for" "function_exported?" "get_and_update_in" "get_in" "hd" "if" "import" "in" "inspect" "is_atom" "is_binary" "is_bitstring" "is_boolean" "is_exception" "is_float" "is_function" "is_integer" "is_list" "is_map" "is_map_key" "is_nil" "is_number" "is_pid" "is_port" "is_reference" "is_struct" "is_tuple" "length" "macro_exported?" "make_ref" "map_size" "match?" "max" "min" "node" "not" "or" "pop_in" "put_elem" "put_in" "quote" "raise" "receive" "rem" "require" "reraise" "round" "self" "send" "spawn" "spawn_link" "spawn_monitor" "struct" "struct!" "super" "tap" "then" "throw" "tl" "to_charlist" "to_string" "trunc" "try" "tuple_size" "unless" "unquote" "unquote_splicing" "update_in" "use" "var!" "with") (erlang-mode ;; https://www.erlang.org/docs/20/reference_manual/introduction.html "after" "and" "andalso" "band" "begin" "bnot" "bor" "bsl" "bsr" "bxor" "case" "catch" "cond" "div" "end" "fun" "if" "let" "not" "of" "or" "orelse" "receive" "rem" "try" "when" "xor") (f90-mode ;; f90.el "abs" "abstract" "achar" "acos" "adjustl" "adjustr" "aimag" "aint" "align" "all" "all_prefix" "all_scatter" "all_suffix" "allocatable" "allocate" "allocated" "and" "anint" "any" "any_prefix" "any_scatter" "any_suffix" "asin" "assign" "assignment" "associate" "associated" "asynchronous" "atan" "atan2" "backspace" "bind" "bit_size" "block" "btest" "c_alert" "c_associated" "c_backspace" "c_bool" "c_carriage_return" "c_char" "c_double" "c_double_complex" "c_f_pointer" "c_f_procpointer" "c_float" "c_float_complex" "c_form_feed" "c_funloc" "c_funptr" "c_horizontal_tab" "c_int" "c_int16_t" "c_int32_t" "c_int64_t" "c_int8_t" "c_int_fast16_t" "c_int_fast32_t" "c_int_fast64_t" "c_int_fast8_t" "c_int_least16_t" "c_int_least32_t" "c_int_least64_t" "c_int_least8_t" "c_intmax_t" "c_intptr_t" "c_loc" "c_long" "c_long_double" "c_long_double_complex" "c_long_long" "c_new_line" "c_null_char" "c_null_funptr" "c_null_ptr" "c_ptr" "c_short" "c_signed_char" "c_size_t" "c_vertical_tab" "call" "case" "ceiling" "char" "character" "character_storage_size" "class" "close" "cmplx" "command_argument_count" "common" "complex" "conjg" "contains" "continue" "copy_prefix" "copy_scatter" "copy_suffix" "cos" "cosh" "count" "count_prefix" "count_scatter" "count_suffix" "cpu_time" "cshift" "cycle" "cyclic" "data" "date_and_time" "dble" "deallocate" "deferred" "digits" "dim" "dimension" "distribute" "do" "dot_product" "double" "dprod" "dynamic" "elemental" "else" "elseif" "elsewhere" "end" "enddo" "endfile" "endif" "entry" "enum" "enumerator" "eoshift" "epsilon" "eq" "equivalence" "eqv" "error_unit" "exit" "exp" "exponent" "extends" "extends_type_of" "external" "extrinsic" "false" "file_storage_size" "final" "floor" "flush" "forall" "format" "fraction" "function" "ge" "generic" "get_command" "get_command_argument" "get_environment_variable" "goto" "grade_down" "grade_up" "gt" "hpf_alignment" "hpf_distribution" "hpf_template" "huge" "iachar" "iall" "iall_prefix" "iall_scatter" "iall_suffix" "iand" "iany" "iany_prefix" "iany_scatter" "iany_suffix" "ibclr" "ibits" "ibset" "ichar" "ieee_arithmetic" "ieee_exceptions" "ieee_features" "ieee_get_underflow_mode" "ieee_set_underflow_mode" "ieee_support_underflow_control" "ieor" "if" "ilen" "implicit" "import" "include" "independent" "index" "inherit" "input_unit" "inquire" "int" "integer" "intent" "interface" "intrinsic" "ior" "iostat_end" "iostat_eor" "iparity" "iparity_prefix" "iparity_scatter" "iparity_suffix" "ishft" "ishftc" "iso_c_binding" "iso_fortran_env" "kind" "lbound" "le" "leadz" "len" "len_trim" "lge" "lgt" "lle" "llt" "log" "log10" "logical" "lt" "matmul" "max" "maxexponent" "maxloc" "maxval" "maxval_prefix" "maxval_scatter" "maxval_suffix" "merge" "min" "minexponent" "minloc" "minval" "minval_prefix" "minval_scatter" "minval_suffix" "mod" "module" "modulo" "move_alloc" "mvbits" "namelist" "ne" "nearest" "neqv" "new" "new_line" "nint" "non_intrinsic" "non_overridable" "none" "nopass" "not" "null" "nullify" "number_of_processors" "numeric_storage_size" "only" "onto" "open" "operator" "optional" "or" "output_unit" "pack" "parameter" "parity" "parity_prefix" "parity_scatter" "parity_suffix" "pass" "pause" "pointer" "popcnt" "poppar" "precision" "present" "print" "private" "procedure" "processors" "processors_shape" "product" "product_prefix" "product_scatter" "product_suffix" "program" "protected" "public" "pure" "radix" "random_number" "random_seed" "range" "read" "real" "realign" "recursive" "redistribute" "repeat" "reshape" "result" "return" "rewind" "rrspacing" "same_type_as" "save" "scale" "scan" "select" "selected_char_kind" "selected_int_kind" "selected_real_kind" "sequence" "set_exponent" "shape" "sign" "sin" "sinh" "size" "spacing" "spread" "sqrt" "stop" "subroutine" "sum" "sum_prefix" "sum_scatter" "sum_suffix" "system_clock" "tan" "tanh" "target" "template" "then" "tiny" "transfer" "transpose" "trim" "true" "type" "ubound" "unpack" "use" "value" "verify" "volatile" "wait" "where" "while" "with" "write") (go-mode ;; https://golang.org/ref/spec#Keywords, https://golang.org/pkg/builtin/ "append" "bool" "break" "byte" "cap" "case" "chan" "close" "complex" "complex128" "complex64" "const" "continue" "copy" "default" "defer" "delete" "else" "error" "fallthrough" "false" "float32" "float64" "for" "func" "go" "goto" "if" "imag" "import" "int" "int16" "int32" "int64" "int8" "interface" "len" "make" "map" "new" "nil" "package" "panic" "print" "println" "range" "real" "recover" "return" "rune" "select" "string" "struct" "switch" "true" "type" "uint" "uint16" "uint32" "uint64" "uint8" "uintptr" "var") (java-mode "abstract" "assert" "boolean" "break" "byte" "case" "catch" "char" "class" "continue" "default" "do" "double" "else" "enum" "extends" "final" "finally" "float" "for" "if" "implements" "import" "instanceof" "int" "interface" "long" "native" "new" "package" "private" "protected" "public" "return" "short" "static" "strictfp" "super" "switch" "synchronized" "this" "throw" "throws" "transient" "try" "void" "volatile" "while") (javascript-mode ;; https://tc39.github.io/ecma262/ "async" "await" "break" "case" "catch" "class" "const" "continue" "debugger" "default" "delete" "do" "else" "enum" "export" "extends" "false" "finally" "for" "function" "if" "import" "in" "instanceof" "let" "new" "null" "return" "static" "super" "switch" "this" "throw" "true" "try" "typeof" "undefined" "var" "void" "while" "with" "yield") (kotlin-mode "abstract" "annotation" "as" "break" "by" "catch" "class" "companion" "const" "constructor" "continue" "data" "do" "else" "enum" "false" "final" "finally" "for" "fun" "if" "import" "in" "init" "inner" "interface" "internal" "is" "lateinit" "nested" "null" "object" "open" "out" "override" "package" "private" "protected" "public" "return" "super" "this" "throw" "trait" "true" "try" "typealias" "val" "var" "when" "while") (lua-mode ;; https://www.lua.org/manual/5.3/manual.html "and" "break" "do" "else" "elseif" "end" "false" "for" "function" "goto" "if" "in" "local" "nil" "not" "or" "repeat" "return" "then" "true" "until" "while") (nim-mode ;; https://nim-lang.org/docs/manual.html#lexical-analysis-identifiers-amp-keywords "addr" "and" "as" "asm" "bind" "block" "break" "case" "cast" "concept" "const" "continue" "converter" "defer" "discard" "distinct" "div" "do" "elif" "else" "end" "enum" "except" "export" "finally" "for" "from" "func" "if" "import" "in" "include" "interface" "is" "isnot" "iterator" "let" "macro" "method" "mixin" "mod" "nil" "not" "notin" "object" "of" "or" "out" "proc" "ptr" "raise" "ref" "return" "shl" "shr" "static" "template" "try" "tuple" "type" "using" "var" "when" "while" "xor" "yield") (objc-mode "@catch" "@class" "@encode" "@end" "@finally" "@implementation" "@interface" "@private" "@protected" "@protocol" "@public" "@selector" "@synchronized" "@throw" "@try" "alloc" "autorelease" "bycopy" "byref" "in" "inout" "oneway" "out" "release" "retain") (perl-mode ;; cperl.el "AUTOLOAD" "BEGIN" "CHECK" "CORE" "DESTROY" "END" "INIT" "__END__" "__FILE__" "__LINE__" "abs" "accept" "alarm" "and" "atan2" "bind" "binmode" "bless" "caller" "chdir" "chmod" "chomp" "chop" "chown" "chr" "chroot" "close" "closedir" "cmp" "connect" "continue" "cos" "crypt" "dbmclose" "dbmopen" "defined" "delete" "die" "do" "dump" "each" "else" "elsif" "endgrent" "endhostent" "endnetent" "endprotoent" "endpwent" "endservent" "eof" "eq" "eval" "exec" "exists" "exit" "exp" "fcntl" "fileno" "flock" "for" "foreach" "fork" "format" "formline" "ge" "getc" "getgrent" "getgrgid" "getgrnam" "gethostbyaddr" "gethostbyname" "gethostent" "getlogin" "getnetbyaddr" "getnetbyname" "getnetent" "getpeername" "getpgrp" "getppid" "getpriority" "getprotobyname" "getprotobynumber" "getprotoent" "getpwent" "getpwnam" "getpwuid" "getservbyname" "getservbyport" "getservent" "getsockname" "getsockopt" "glob" "gmtime" "goto" "grep" "gt" "hex" "if" "index" "int" "ioctl" "join" "keys" "kill" "last" "lc" "lcfirst" "le" "length" "link" "listen" "local" "localtime" "lock" "log" "lstat" "lt" "map" "mkdir" "msgctl" "msgget" "msgrcv" "msgsnd" "my" "ne" "next" "no" "not" "oct" "open" "opendir" "or" "ord" "our" "pack" "package" "pipe" "pop" "pos" "print" "printf" "push" "q" "qq" "quotemeta" "qw" "qx" "rand" "read" "readdir" "readline" "readlink" "readpipe" "recv" "redo" "ref" "rename" "require" "reset" "return" "reverse" "rewinddir" "rindex" "rmdir" "scalar" "seek" "seekdir" "select" "semctl" "semget" "semop" "send" "setgrent" "sethostent" "setnetent" "setpgrp" "setpriority" "setprotoent" "setpwent" "setservent" "setsockopt" "shift" "shmctl" "shmget" "shmread" "shmwrite" "shutdown" "sin" "sleep" "socket" "socketpair" "sort" "splice" "split" "sprintf" "sqrt" "srand" "stat" "study" "sub" "substr" "symlink" "syscall" "sysopen" "sysread" "system" "syswrite" "tell" "telldir" "tie" "time" "times" "tr" "truncate" "uc" "ucfirst" "umask" "undef" "unless" "unlink" "unpack" "unshift" "untie" "until" "use" "utime" "values" "vec" "wait" "waitpid" "wantarray" "warn" "while" "write" "x" "xor" "y") (php-mode ;; https://www.php.net/manual/reserved.php "Closure" "Error" "Exception" "Generator" "Throwable" "__CLASS__" "__DIR__" "__FILE__" "__FUNCTION__" "__LINE__" "__METHOD__" "__NAMESPACE__" "__TRAIT__" "abstract" "and" "array" "as" "bool" "break" "callable" "case" "catch" "class" "clone" "const" "continue" "declare" "default" "die" "do" "echo" "else" "elseif" "empty" "enddeclare" "endfor" "endforeach" "endif" "endswitch" "endwhile" "enum" "eval" "exit" "extends" "false" "final" "finally" "float" "fn" "for" "foreach" "function" "global" "goto" "if" "implements" "include" "include_once" "instanceof" "insteadof" "interface" "isset" "iterable" "list" "match" "namespace" "new" "null" "object" "or" "print" "private" "protected" "public" "readonly" "require" "require_once" "return" "self" "static" "string" "switch" "this" "throw" "trait" "true" "try" "unset" "use" "var" "void" "while" "xor" "yield" "yield from") (purescript-mode ;; purescript-font-lock.el "ado" "case" "class" "data" "default" "deriving" "do" "else" "if" "import" "in" "infix" "infixl" "infixr" "instance" "let" "module" "newtype" "of" "then" "type" "where") (python-mode ;; https://docs.python.org/3/reference/lexical_analysis.html#keywords "False" "None" "True" "and" "as" "assert" "break" "case" "class" "continue" "def" "del" "elif" "else" "except" "exec" "finally" "for" "from" "global" "if" "import" "in" "is" "lambda" "match" "nonlocal" "not" "or" "pass" "print" "raise" "return" "try" "while" "with" "yield") (ruby-mode "BEGIN" "END" "alias" "and" "begin" "break" "case" "class" "def" "defined?" "do" "else" "elsif" "end" "ensure" "false" "for" "if" "in" "module" "next" "nil" "not" "or" "redo" "rescue" "retry" "return" "self" "super" "then" "true" "undef" "unless" "until" "when" "while" "yield") (rust-mode ;; https://doc.rust-lang.org/grammar.html#keywords "Self" "as" "box" "break" "const" "continue" "crate" "else" "enum" "extern" "false" "fn" "for" "if" "impl" "in" "let" "loop" "macro" "match" "mod" "move" "mut" "pub" "ref" "return" "self" "static" "struct" "super" "trait" "true" "type" "unsafe" "use" "where" "while") (scala-mode "abstract" "case" "catch" "class" "def" "do" "else" "extends" "false" "final" "finally" "for" "forSome" "if" "implicit" "import" "lazy" "match" "new" "null" "object" "override" "package" "private" "protected" "return" "sealed" "super" "this" "throw" "trait" "true" "try" "type" "val" "var" "while" "with" "yield") (scheme-mode ;; R7RS-small: https://small.r7rs.org/ "abs" "acos" "angle" "append" "apply" "asin" "assoc" "assq" "assv" "atan" "binary-port?" "body" "boolean=?" "boolean?" "bytevector" "bytevector-append" "bytevector-copy" "bytevector-copy!" "bytevector-length" "bytevector-u8-ref" "bytevector-u8-set!" "bytevector?" "caaaar" "caaadr" "caaar" "caadar" "caaddr" "caadr" "caar" "cadaar" "cadadr" "cadar" "caddar" "cadddr" "caddr" "cadr" "call-with-port" "call-with-values" "car" "car-internal" "cdaaar" "cdaadr" "cdaar" "cdadar" "cdaddr" "cdadr" "cdar" "cddaar" "cddadr" "cddar" "cdddar" "cddddr" "cdddr" "cddr" "cdr" "ceiling" "char->integer" "char-alphabetic?" "char-ci<=?" "char-ci=?" "char-ci>?" "char-downcase" "char-foldcase" "char-lower-case?" "char-numeric?" "char-ready?" "char-upcase" "char-upper-case?" "char-whitespace?" "char<=?" "char=?" "char>?" "char?" "close-input-port" "close-output-port" "close-port" "command-line" "complex?" "cons" "cos" "current-error-port" "current-input-port" "current-jiffy" "current-output-port" "current-second" "delete-file" "denominator" "digit-value" "display" "dynamic-wind" "emergency-exit" "environment" "eof-object" "eof-object?" "eq?" "equal?" "eqv?" "error" "error-object-irritants" "error-object-message" "error-object?" "eval" "even?" "exact" "exact-integer-sqrt" "exact-integer?" "exact?" "exit" "exp" "expt" "features" "file-error?" "file-exists?" "finite?" "floor" "floor-quotient" "floor-remainder" "floor/" "flush-output-port" "gcd" "get-environment-variable" "get-environment-variables" "get-output-bytevector" "get-output-string" "imag-part" "inexact" "inexact?" "infinite?" "input-port-open?" "input-port?" "integer->char" "integer?" "interaction-environment" "jiffies-per-second" "lcm" "length" "list" "list->string" "list->vector" "list-copy" "list-ref" "list-set!" "list-tail" "list?" "load" "log" "magnitude" "make-bytevector" "make-list" "make-parameter" "make-polar" "make-promise" "make-rectangular" "make-string" "make-vector" "max" "member" "memq" "memv" "min" "modulo" "nan?" "negative?" "newline" "nil" "not" "null-environment" "null?" "number->string" "number?" "numerator" "odd?" "open-binary-input-file" "open-binary-output-file" "open-input-bytevector" "open-input-file" "open-input-string" "open-output-bytevector" "open-output-file" "open-output-string" "output-port-open?" "output-port?" "pair?" "peek-char" "peek-u8" "port?" "positive?" "procedure?" "promise?" "quasiquote" "quote" "quotient" "raise" "raise-continuable" "rational?" "rationalize" "read" "read-bytevector" "read-bytevector!" "read-char" "read-error?" "read-line" "read-string" "read-u8" "real-part" "real?" "remainder" "reverse" "round" "scheme-report-environment" "set!" "set-car!" "set-cdr!" "setcar" "sin" "sqrt" "square" "string" "string->list" "string->number" "string->symbol" "string->utf" "string->vector" "string-append" "string-ci<=?" "string-ci=?" "string-ci>?" "string-copy" "string-copy!" "string-downcase" "string-fill!" "string-foldcase" "string-for-each" "string-length" "string-map" "string-ref" "string-set!" "string-upcase" "string<=?" "string=?" "string>?" "string?" "substring" "symbol->string" "symbol=?" "symbol?" "tan" "textual-port?" "truncate" "truncate-quotient" "truncate-remainder" "truncate/" "u8-ready?" "unquote" "unquote-splicing" "utf->string" "values" "vector" "vector->list" "vector->string" "vector-append" "vector-copy" "vector-copy!" "vector-fill!" "vector-for-each" "vector-length" "vector-map" "vector-ref" "vector-set!" "vector?" "with-exception-handler" "with-input-from-file" "with-output-to-file" "write" "write-bytevector" "write-char" "write-shared" "write-simple" "write-string" "write-u8" "zero?") (swift-mode "Protocol" "Self" "Type" "and" "as" "assignment" "associatedtype" "associativity" "available" "break" "case" "catch" "class" "column" "continue" "convenience" "default" "defer" "deinit" "didSet" "do" "dynamic" "dynamicType" "else" "elseif" "endif" "enum" "extension" "fallthrough" "false" "file" "fileprivate" "final" "for" "func" "function" "get" "guard" "higherThan" "if" "import" "in" "indirect" "infix" "init" "inout" "internal" "is" "lazy" "left" "let" "line" "lowerThan" "mutating" "nil" "none" "nonmutating" "open" "operator" "optional" "override" "postfix" "precedence" "precedencegroup" "prefix" "private" "protocol" "public" "repeat" "required" "rethrows" "return" "right" "selector" "self" "set" "static" "struct" "subscript" "super" "switch" "throw" "throws" "true" "try" "typealias" "unowned" "var" "weak" "where" "while" "willSet") (julia-mode "abstract" "break" "case" "catch" "const" "continue" "do" "else" "elseif" "end" "eval" "export" "false" "finally" "for" "function" "global" "if" "ifelse" "immutable" "import" "importall" "in" "let" "macro" "module" "otherwise" "quote" "return" "switch" "throw" "true" "try" "type" "typealias" "using" "while") (thrift-mode ;; https://github.com/apache/thrift/blob/master/contrib/thrift.el "binary" "bool" "byte" "const" "double" "enum" "exception" "extends" "i16" "i32" "i64" "include" "list" "map" "oneway" "optional" "required" "service" "set" "string" "struct" "throws" "typedef" "void") (sh-mode "break" "case" "continue" "do" "done" "elif" "else" "esac" "eval" "exec" "exit" "export" "false" "fi" "for" "function" "if" "in" "readonly" "return" "set" "shift" "test" "then" "time" "times" "trap" "true" "unset" "until" "while") ;; Aliases (cperl-mode perl-mode) (enh-ruby-mode ruby-mode) (espresso-mode javascript-mode) (ess-julia-mode julia-mode) (jde-mode java-mode) (js-jsx-mode javascript-mode) (js-mode javascript-mode) (js2-jsx-mode javascript-mode) (js2-mode javascript-mode) (php-ts-mode php-mode) (phps-mode php-mode) (rjsx-mode javascript-mode) (tuareg-mode caml-mode) ;; Emacs 29 treesitter modes (c++-ts-mode c++-mode) (c-ts-mode c-mode) (csharp-ts-mode csharp-mode) (css-ts-mode css-mode) (elixir-ts-mode elixir-mode) (go-ts-mode go-mode) (java-ts-mode java-mode) (js-ts-mode javascript-mode) (lua-ts-mode lua-mode) (python-ts-mode python-mode) (ruby-ts-mode ruby-mode) (rust-ts-mode rust-mode) (bash-ts-mode sh-mode)) "Alist of major modes and keywords." :type 'alist :group 'cape) (defun cape--keyword-list () "Return keywords for current major mode." (when-let ((kw (or (alist-get major-mode cape-keyword-list) (when-let (((eval-when-compile (> emacs-major-version 28))) (remap (rassq major-mode (bound-and-true-p major-mode-remap-alist)))) (alist-get (car remap) cape-keyword-list))))) (if (symbolp (car kw)) (alist-get (car kw) cape-keyword-list) kw))) (defvar cape--keyword-properties (list :annotation-function (lambda (_) " Keyword") :company-kind (lambda (_) 'keyword) :exclusive 'no :category 'cape-keyword) "Completion extra properties for `cape-keyword'.") ;;;###autoload (defun cape-keyword (&optional interactive) "Complete programming language keyword at point. See the variable `cape-keyword-list'. If INTERACTIVE is nil the function acts like a capf." (interactive (list t)) (if interactive (cape-interactive #'cape-keyword) (when-let (keywords (cape--keyword-list)) (let ((bounds (cape--bounds 'symbol))) `(,(car bounds) ,(cdr bounds) ,keywords ,@cape--keyword-properties))))) (provide 'cape-keyword) ;;; cape-keyword.el ends here cape-2.1/cape.el000066400000000000000000001520471501327317200135300ustar00rootroot00000000000000;;; cape.el --- Completion At Point Extensions -*- lexical-binding: t -*- ;; Copyright (C) 2021-2025 Free Software Foundation, Inc. ;; Author: Daniel Mendler ;; Maintainer: Daniel Mendler ;; Created: 2021 ;; Version: 2.1 ;; Package-Requires: ((emacs "28.1") (compat "30")) ;; URL: https://github.com/minad/cape ;; Keywords: abbrev, convenience, matching, completion, text ;; This file is part of GNU Emacs. ;; 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 . ;;; Commentary: ;; Let your completions fly! This package provides additional completion ;; backends in the form of Capfs (completion-at-point-functions). ;; ;; `cape-abbrev': Complete abbreviation (add-global-abbrev, add-mode-abbrev). ;; `cape-dabbrev': Complete word from current buffers. ;; `cape-dict': Complete word from dictionary file. ;; `cape-elisp-block': Complete Elisp in Org or Markdown code block. ;; `cape-elisp-symbol': Complete Elisp symbol. ;; `cape-emoji': Complete Emoji. ;; `cape-file': Complete file name. ;; `cape-history': Complete from Eshell, Comint or minibuffer history. ;; `cape-keyword': Complete programming language keyword. ;; `cape-line': Complete entire line from file. ;; `cape-rfc1345': Complete Unicode char using RFC 1345 mnemonics. ;; `cape-sgml': Complete Unicode char from SGML entity, e.g., &alpha. ;; `cape-tex': Complete Unicode char from TeX command, e.g. \hbar. ;;; Code: (require 'compat) (eval-when-compile (require 'cl-lib) (require 'subr-x)) ;;;; Customization (defgroup cape nil "Completion At Point Extensions." :link '(info-link :tag "Info Manual" "(cape)") :link '(url-link :tag "Website" "https://github.com/minad/cape") :link '(emacs-library-link :tag "Library Source" "cape.el") :group 'convenience :group 'tools :group 'matching :prefix "cape-") (defcustom cape-dict-limit 100 "Maximal number of completion candidates returned by `cape-dict'." :type '(choice (const nil) natnum)) (defcustom cape-dict-file "/usr/share/dict/words" "Path to dictionary word list file. This variable can also be a list of paths or a function returning a single or more paths." :type '(choice string (repeat string) function)) (defcustom cape-dict-case-replace 'case-replace "Preserve case of input. See `dabbrev-case-replace' for details." :type '(choice (const :tag "Disable" nil) (const :tag "Use `case-replace'" case-replace) (other :tag "Enable" t))) (defcustom cape-dict-case-fold 'case-fold-search "Case fold search during search. See `dabbrev-case-fold-search' for details." :type '(choice (const :tag "Disable" nil) (const :tag "Use `case-fold-search'" case-fold-search) (other :tag "Enable" t))) (defcustom cape-dabbrev-buffer-function #'cape-same-mode-buffers "Function which returns list of buffers. The buffers are scanned for completion candidates by `cape-dabbrev'." :type `(choice (const :tag "Current buffer" current-buffer) (const :tag "Text buffers" ,#'cape-text-buffers) (const :tag "Buffers with same mode" ,#'cape-same-mode-buffers) (function :tag "Custom function"))) (defcustom cape-file-directory nil "Base directory used by `cape-file." :type '(choice (const nil) string function)) (defcustom cape-file-prefix "file:" "File completion trigger prefixes. The value can be a string or a list of strings. The default `file:' is the prefix of Org file links which work in arbitrary buffers via `org-open-at-point-global'." :type '(choice string (repeat string))) (defcustom cape-file-directory-must-exist t "The parent directory must exist for file completion." :type 'boolean) (defcustom cape-line-buffer-function #'cape-same-mode-buffers "Function which returns list of buffers. The buffers are scanned for completion candidates by `cape-line'." :type `(choice (const :tag "Current buffer" current-buffer) (const :tag "Text buffers" ,#'cape-text-buffers) (const :tag "Buffers with same mode" ,#'cape-same-mode-buffers) (function :tag "Custom function"))) (defcustom cape-elisp-symbol-wrapper '((org-mode ?~ ?~) (markdown-mode ?` ?`) (emacs-lisp-mode ?` ?') (rst-mode "``" "``") (log-edit-mode "`" "'") (change-log-mode "`" "'") (message-mode "`" "'") (rcirc-mode "`" "'")) "Wrapper characters for symbols." :type '(alist :key-type symbol :value-type (list (choice character string) (choice character string)))) ;;;; Helpers (defun cape--buffer-list (pred) "Return list of buffers satisfying PRED." (let* ((cur (current-buffer)) (orig (and (minibufferp) (window-buffer (minibuffer-selected-window)))) (list (cl-loop for buf in (buffer-list) if (and (not (eq buf cur)) (not (eq buf orig)) (funcall pred buf)) collect buf))) `(,cur ,@(and orig (list orig)) ,@list))) (defun cape-same-mode-buffers () "Return buffers with same major mode as current buffer." (cape--buffer-list (lambda (buf) (eq major-mode (buffer-local-value 'major-mode buf))))) (defun cape-text-buffers () "Return `text-mode' and `prog-mode' buffers." (cape--buffer-list (lambda (buf) (let ((mode (buffer-local-value 'major-mode buf))) (or (provided-mode-derived-p mode #'text-mode) (provided-mode-derived-p mode #'prog-mode)))))) (defun cape--case-fold-p (fold) "Return non-nil if case folding is enabled for FOLD." (if (eq fold 'case-fold-search) case-fold-search fold)) (defun cape--case-replace-list (flag input strs) "Replace case of STRS depending on INPUT and FLAG." (if (and (if (eq flag 'case-replace) case-replace flag) (let (case-fold-search) (string-match-p "\\`[[:upper:]]" input))) (mapcar (apply-partially #'cape--case-replace flag input) strs) strs)) (defun cape--case-replace (flag input str) "Replace case of STR depending on INPUT and FLAG." (or (and (if (eq flag 'case-replace) case-replace flag) (string-prefix-p input str t) (let (case-fold-search) (string-match-p "\\`[[:upper:]]" input)) (save-match-data ;; Ensure that single character uppercase input does not lead to an ;; all uppercase result. (when (and (= (length input) 1) (> (length str) 1)) (setq input (concat input (substring str 1 2)))) (and (string-match input input) (replace-match str nil nil input)))) str)) (defun cape--separator-p (str) "Return non-nil if input STR has a separator character. Separator characters are used by completion styles like Orderless to split filter words. In Corfu, the separator is configurable via the variable `corfu-separator'." (string-search (string ;; Support `corfu-separator' and Orderless (or (and (bound-and-true-p corfu-mode) (bound-and-true-p corfu-separator)) ?\s)) str)) (defmacro cape--silent (&rest body) "Silence BODY." (declare (indent 0)) `(cl-letf ((inhibit-message t) (message-log-max nil) ((symbol-function #'minibuffer-message) #'ignore)) (ignore-errors ,@body))) (defun cape--bounds (thing) "Return bounds of THING." (or (bounds-of-thing-at-point thing) (cons (point) (point)))) (defmacro cape--wrapped-table (wrap body) "Create wrapped completion table, handle `completion--unquote'. WRAP is the wrapper function. BODY is the wrapping expression." (declare (indent 1)) `(lambda (str pred action) (,@body (let ((result (complete-with-action action table str pred))) (when (and (eq action 'completion--unquote) (functionp (cadr result))) (cl-callf ,wrap (cadr result))) result)))) (defun cape--accept-all-table (table) "Create completion TABLE which accepts all input." (cape--wrapped-table cape--accept-all-table (or (eq action 'lambda)))) (defun cape--passthrough-table (table) "Create completion TABLE disabling any filtering." (cape--wrapped-table cape--passthrough-table (let (completion-ignore-case completion-regexp-list (_ (setq str "")))))) (defun cape--noninterruptible-table (table) "Create non-interruptible completion TABLE." (cape--wrapped-table cape--noninterruptible-table (let (throw-on-input)))) (defun cape--silent-table (table) "Create a new completion TABLE which is silent (no messages, no errors)." (cape--wrapped-table cape--silent-table (cape--silent))) (defun cape--nonessential-table (table) "Mark completion TABLE as `non-essential'." (let ((dir default-directory)) (cape--wrapped-table cape--nonessential-table (let ((default-directory dir) (non-essential t)))))) (defvar cape--debug-length 5 "Length of printed lists in `cape--debug-print'.") (defvar cape--debug-id 0 "Completion table identifier.") (defun cape--debug-message (&rest msg) "Print debug MSG." (let ((inhibit-message t)) (apply #'message msg))) (defun cape--debug-print (obj &optional full) "Print OBJ as string, truncate lists if FULL is nil." (cond ((symbolp obj) (symbol-name obj)) ((functionp obj) "#") ((proper-list-p obj) (concat "(" (string-join (mapcar #'cape--debug-print (if full obj (take cape--debug-length obj))) " ") (if (and (not full) (length> obj cape--debug-length)) " ...)" ")"))) (t (let ((print-level 2)) (prin1-to-string obj))))) (defun cape--debug-table (table name beg end) "Create completion TABLE with debug messages. NAME is the name of the Capf, BEG and END are the input markers." (lambda (str pred action) (let ((result (complete-with-action action table str pred))) (if (and (eq action 'completion--unquote) (functionp (cadr result))) ;; See `cape--wrapped-table' (cl-callf cape--debug-table (cadr result) name beg end) (cape--debug-message "%s(action=%S input=%s:%s:%S prefix=%S ignore-case=%S%s%s) => %s" name (pcase action ('nil 'try) ('t 'all) ('lambda 'test) (_ action)) (+ beg 0) (+ end 0) (buffer-substring-no-properties beg end) str completion-ignore-case (if completion-regexp-list (format " regexp=%s" (cape--debug-print completion-regexp-list t)) "") (if pred (format " predicate=%s" (cape--debug-print pred)) "") (cape--debug-print result))) result))) (defun cape--dynamic-table (beg end fun) "Create dynamic completion table from FUN with caching. BEG and END are the input bounds. FUN is the function which computes the candidates. FUN must return a pair of a predicate function function and the list of candidates. The predicate is passed new input and must return non-nil if the candidates are still valid. It is only necessary to use this function if the set of candidates is computed dynamically based on the input and not statically determined. The behavior is similar but slightly different to `completion-table-dynamic'. The difference to the builtins `completion-table-dynamic' and `completion-table-with-cache' is that this function does not use the prefix argument of the completion table to compute the candidates. Instead it uses the input in the buffer between BEG and END to FUN to compute the candidates. This way the dynamic candidate computation is compatible with non-prefix completion styles like `substring' or `orderless', which pass the empty string as first argument to the completion table." (let ((beg (copy-marker beg)) (end (copy-marker end t)) valid table) (lambda (str pred action) ;; Bail out early for `metadata' and `boundaries'. This is a pointless ;; move because of caching, but we do it anyway in the hope that the ;; profiler report looks less confusing, since the weight of the expensive ;; FUN computation is moved to the `all-completions' action. Computing ;; `all-completions' must surely be most expensive, so nobody will suspect ;; a thing. (unless (or (eq action 'metadata) (eq (car-safe action) 'boundaries)) (let ((input (buffer-substring-no-properties beg end))) (unless (and valid (or (cape--separator-p input) (funcall valid input))) (let* (;; Reset in case `all-completions' is used inside FUN completion-ignore-case completion-regexp-list ;; Retrieve new state by calling FUN (new (and (< beg end) (funcall fun input))) ;; No interrupt during state update throw-on-input) (setq valid (car new) table (cdr new))))) (complete-with-action action table str pred))))) ;;;; Capfs ;;;;; cape-history (declare-function ring-elements "ring") (declare-function eshell-bol "eshell") (declare-function comint-line-beginning-position "comint") (defvar eshell-history-ring) (defvar comint-input-ring) (defvar cape--history-properties (list :company-kind (lambda (_) 'text) :exclusive 'no :display-sort-function #'identity :cycle-sort-function #'identity :category 'cape-history) "Completion extra properties for `cape-history'.") ;;;###autoload (defun cape-history (&optional interactive) "Complete from Eshell, Comint or minibuffer history. See also `consult-history' for a more flexible variant based on `completing-read'. If INTERACTIVE is nil the function acts like a Capf." (interactive (list t)) (if interactive (cape-interactive #'cape-history) (let (history bol) (cond ((derived-mode-p 'eshell-mode) (setq history eshell-history-ring bol (static-if (< emacs-major-version 30) (save-excursion (eshell-bol) (point)) (line-beginning-position)))) ((derived-mode-p 'comint-mode) (setq history comint-input-ring bol (comint-line-beginning-position))) ((and (minibufferp) (not (eq minibuffer-history-variable t))) (setq history (symbol-value minibuffer-history-variable) bol (line-beginning-position)))) (when (ring-p history) (setq history (ring-elements history))) (when history `(,bol ,(point) ,history ,@cape--history-properties))))) ;;;;; cape-file (defvar comint-unquote-function) (defvar comint-requote-function) (defvar cape--file-properties (list :annotation-function (lambda (s) (if (string-suffix-p "/" s) " Dir" " File")) :company-kind (lambda (s) (if (string-suffix-p "/" s) 'folder 'file)) :exclusive 'no :category 'file) "Completion extra properties for `cape-file'.") ;;;###autoload (defun cape-file (&optional interactive) "Complete file name at point. See the user option `cape-file-directory-must-exist'. If INTERACTIVE is nil the function acts like a Capf." (interactive (list t)) (if interactive (cape-interactive '(cape-file-directory-must-exist) #'cape-file) (pcase-let* ((default-directory (pcase cape-file-directory ('nil default-directory) ((pred stringp) cape-file-directory) (_ (funcall cape-file-directory)))) (prefix (and cape-file-prefix (looking-back (concat (regexp-opt (ensure-list cape-file-prefix) t) "[^ \n\t]*") (pos-bol)) (match-end 1))) (`(,beg . ,end) (if prefix (cons prefix (point)) (cape--bounds 'filename))) (non-essential t) (file (buffer-substring-no-properties beg end))) (when (or prefix (not cape-file-directory-must-exist) (and (string-search "/" file) (file-exists-p (file-name-directory (substitute-in-file-name file))))) (unless (boundp 'comint-unquote-function) (require 'comint)) `( ,beg ,end ,(cape--nonessential-table (completion-table-with-quoting #'read-file-name-internal comint-unquote-function comint-requote-function)) ,@(when (or prefix (string-match-p "./" file)) '(:company-prefix-length t)) ,@cape--file-properties))))) ;;;;; cape-elisp-symbol (autoload 'elisp--company-kind "elisp-mode") (autoload 'elisp--company-doc-buffer "elisp-mode") (autoload 'elisp--company-doc-string "elisp-mode") (autoload 'elisp--company-location "elisp-mode") (defvar cape--elisp-symbol-properties (list :annotation-function #'cape--elisp-symbol-annotation :exit-function #'cape--elisp-symbol-exit :predicate #'cape--elisp-symbol-predicate :company-kind #'elisp--company-kind :company-doc-buffer #'elisp--company-doc-buffer :company-docsig #'elisp--company-doc-string :company-location #'elisp--company-location :exclusive 'no :category 'symbol) "Completion extra properties for `cape-elisp-symbol'.") (defun cape--elisp-symbol-predicate (sym) "Return t if SYM is bound, fbound or propertized." (or (fboundp sym) (boundp sym) (symbol-plist sym))) (defun cape--elisp-symbol-exit (sym status) "Wrap symbol SYM with `cape-elisp-symbol-wrapper' buffers. STATUS is the exit status." (when-let (((not (eq status 'exact))) (c (cl-loop for (m . c) in cape-elisp-symbol-wrapper if (derived-mode-p m) return c)) ((or (not (derived-mode-p 'emacs-lisp-mode)) ;; Inside comment or string (let ((s (syntax-ppss))) (or (nth 3 s) (nth 4 s))))) (x (if (stringp (car c)) (car c) (string (car c)))) (y (if (stringp (cadr c)) (cadr c) (string (cadr c))))) (save-excursion (backward-char (length sym)) (unless (save-excursion (and (ignore-errors (or (backward-char (length x)) t)) (looking-at-p (regexp-quote x)))) (insert x))) (unless (looking-at-p (regexp-quote y)) (insert y)))) (defun cape--elisp-symbol-annotation (sym) "Return kind of SYM." (setq sym (intern-soft sym)) (cond ((special-form-p sym) " Special") ((macrop sym) " Macro") ((commandp sym) " Command") ((fboundp sym) " Function") ((custom-variable-p sym) " Custom") ((boundp sym) " Variable") ((featurep sym) " Feature") ((facep sym) " Face") (t " Symbol"))) ;;;###autoload (defun cape-elisp-symbol (&optional interactive) "Complete Elisp symbol at point. If INTERACTIVE is nil the function acts like a Capf." (interactive (list t)) (if interactive ;; No cycling since it breaks the :exit-function. (let (completion-cycle-threshold) (cape-interactive #'cape-elisp-symbol)) (pcase-let ((`(,beg . ,end) (cape--bounds 'symbol))) (when (eq (char-after beg) ?') (setq beg (1+ beg) end (max beg end))) `(,beg ,end ,obarray ,@cape--elisp-symbol-properties)))) ;;;;; cape-elisp-block (declare-function org-element-context "org-element") (declare-function markdown-code-block-lang "ext:markdown-mode") (defun cape--inside-block-p (&rest langs) "Return non-nil if inside LANGS code block." (when-let ((face (get-text-property (point) 'face)) (lang (or (and (if (listp face) (memq 'org-block face) (eq 'org-block face)) (plist-get (cadr (org-element-context)) :language)) (and (if (listp face) (memq 'markdown-code-face face) (eq 'markdown-code-face face)) (save-excursion (markdown-code-block-lang)))))) (member lang langs))) ;;;###autoload (defun cape-elisp-block (&optional interactive) "Complete Elisp in Org or Markdown code block. This Capf is particularly useful for literate Emacs configurations. If INTERACTIVE is nil the function acts like a Capf." (interactive (list t)) (cond (interactive ;; No code block check. Always complete Elisp when command was ;; explicitly invoked interactively. (cape-interactive #'elisp-completion-at-point)) ((cape--inside-block-p "elisp" "emacs-lisp") (elisp-completion-at-point)))) ;;;;; cape-dabbrev (defvar cape--dabbrev-properties (list :annotation-function (lambda (_) " Dabbrev") :company-kind (lambda (_) 'text) :exclusive 'no :category 'cape-dabbrev) "Completion extra properties for `cape-dabbrev'.") (defvar dabbrev-case-replace) (defvar dabbrev-case-fold-search) (defvar dabbrev-abbrev-char-regexp) (defvar dabbrev-abbrev-skip-leading-regexp) (declare-function dabbrev--find-all-expansions "dabbrev") (declare-function dabbrev--reset-global-variables "dabbrev") (defun cape--dabbrev-list (input) "Find all Dabbrev expansions for INPUT." (cape--silent (dlet ((dabbrev-check-other-buffers nil) (dabbrev-check-all-buffers nil) (dabbrev-backward-only nil) (dabbrev-limit nil) (dabbrev-search-these-buffers-only (ensure-list (funcall cape-dabbrev-buffer-function)))) (dabbrev--reset-global-variables) (cons (apply-partially #'string-prefix-p input) (cl-loop with ic = (cape--case-fold-p dabbrev-case-fold-search) for w in (dabbrev--find-all-expansions input ic) collect (cape--case-replace (and ic dabbrev-case-replace) input w)))))) (defun cape--dabbrev-bounds () "Return bounds of abbreviation." (unless (boundp 'dabbrev-abbrev-char-regexp) (require 'dabbrev)) (let ((re (or dabbrev-abbrev-char-regexp "\\sw\\|\\s_")) (limit (minibuffer-prompt-end))) (when (or (looking-at re) (and (> (point) limit) (save-excursion (forward-char -1) (looking-at re)))) (cons (save-excursion (while (and (> (point) limit) (save-excursion (forward-char -1) (looking-at re))) (forward-char -1)) (when dabbrev-abbrev-skip-leading-regexp (while (looking-at dabbrev-abbrev-skip-leading-regexp) (forward-char 1))) (point)) (save-excursion (while (looking-at re) (forward-char 1)) (point)))))) ;;;###autoload (defun cape-dabbrev (&optional interactive) "Complete with Dabbrev at point. If INTERACTIVE is nil the function acts like a Capf. In case you observe a performance issue with auto-completion and `cape-dabbrev' it is strongly recommended to disable scanning in other buffers. See the user option `cape-dabbrev-buffer-function'." (interactive (list t)) (if interactive (cape-interactive #'cape-dabbrev) (when-let ((bounds (cape--dabbrev-bounds))) `(,(car bounds) ,(cdr bounds) ,(completion-table-case-fold (cape--dynamic-table (car bounds) (cdr bounds) #'cape--dabbrev-list) (not (cape--case-fold-p dabbrev-case-fold-search))) ,@cape--dabbrev-properties)))) ;;;;; cape-dict (defvar cape--dict-properties (list :annotation-function (lambda (_) " Dict") :company-kind (lambda (_) 'text) :display-sort-function #'identity :cycle-sort-function #'identity :exclusive 'no :category 'cape-dict) "Completion extra properties for `cape-dict'.") (defun cape--dict-list (input) "Return all words from `cape-dict-file' matching INPUT." (let* ((inhibit-message t) (message-log-max nil) (default-directory (if (and (not (file-remote-p default-directory)) (file-directory-p default-directory)) default-directory user-emacs-directory)) (files (mapcar #'expand-file-name (ensure-list (if (functionp cape-dict-file) (funcall cape-dict-file) cape-dict-file)))) (words (apply #'process-lines-ignore-status "grep" (concat "-Fh" (and (cape--case-fold-p cape-dict-case-fold) "i") (and cape-dict-limit (format "m%d" cape-dict-limit))) input files))) (cons (apply-partially (if (and cape-dict-limit (length= words cape-dict-limit)) #'equal #'string-search) input) (cape--case-replace-list cape-dict-case-replace input words)))) ;;;###autoload (defun cape-dict (&optional interactive) "Complete word from dictionary at point. This completion function works best if the dictionary is sorted by frequency. See the custom option `cape-dict-file'. If INTERACTIVE is nil the function acts like a Capf." (interactive (list t)) (if interactive (cape-interactive #'cape-dict) (pcase-let ((`(,beg . ,end) (cape--bounds 'word))) `( ,beg ,end ,(completion-table-case-fold (cape--dynamic-table beg end #'cape--dict-list) (not (cape--case-fold-p cape-dict-case-fold))) ,@cape--dict-properties)))) ;;;;; cape-abbrev (defun cape--abbrev-list () "Abbreviation list." (delete "" (cl-loop for x in (abbrev--suggest-get-active-tables-including-parents) nconc (all-completions "" x)))) (defun cape--abbrev-annotation (abbrev) "Annotate ABBREV with expansion." (concat " " (truncate-string-to-width (format "%s" (symbol-value (cl-loop for x in (abbrev--suggest-get-active-tables-including-parents) thereis (abbrev--symbol abbrev x)))) 30 0 nil t))) (defun cape--abbrev-exit (_str status) "Expand expansion if STATUS is not exact." (unless (eq status 'exact) (expand-abbrev))) (defvar cape--abbrev-properties (list :annotation-function #'cape--abbrev-annotation :exit-function #'cape--abbrev-exit :company-kind (lambda (_) 'snippet) :exclusive 'no :category 'cape-abbrev) "Completion extra properties for `cape-abbrev'.") ;;;###autoload (defun cape-abbrev (&optional interactive) "Complete abbreviation at point. If INTERACTIVE is nil the function acts like a Capf." (interactive (list t)) (if interactive ;; No cycling since it breaks the :exit-function. (let (completion-cycle-threshold) (cape-interactive #'cape-abbrev)) (when-let (abbrevs (cape--abbrev-list)) (let ((bounds (cape--bounds 'symbol))) `(,(car bounds) ,(cdr bounds) ,abbrevs ,@cape--abbrev-properties))))) ;;;;; cape-line (defvar cape--line-properties (list :display-sort-function #'identity :cycle-sort-function #'identity :exclusive 'no :category 'cape-line) "Completion extra properties for `cape-line'.") (defun cape--line-list () "Return all lines from buffer." (let ((ht (make-hash-table :test #'equal)) (curr-buf (current-buffer)) (buffers (funcall cape-line-buffer-function)) lines) (dolist (buf (ensure-list buffers)) (with-current-buffer buf (let ((beg (point-min)) (max (point-max)) (pt (if (eq curr-buf buf) (point) -1)) end) (save-excursion (while (< beg max) (goto-char beg) (setq end (pos-eol)) (unless (<= beg pt end) (let ((line (buffer-substring-no-properties beg end))) (unless (or (string-blank-p line) (gethash line ht)) (puthash line t ht) (push line lines)))) (setq beg (1+ end))))))) (nreverse lines))) ;;;###autoload (defun cape-line (&optional interactive) "Complete current line from other lines. The buffers returned by `cape-line-buffer-function' are scanned for lines. If INTERACTIVE is nil the function acts like a Capf." (interactive (list t)) (if interactive (cape-interactive #'cape-line) `(,(pos-bol) ,(point) ,(cape--line-list) ,@cape--line-properties))) ;;;; Capf combinators (defun cape--company-call (&rest app) "Apply APP and handle future return values." ;; Backends are non-interruptible. Disable interrupts! (let ((toi throw-on-input) (throw-on-input nil)) (pcase (apply app) ;; Handle async future return values. (`(:async . ,fetch) (let ((res 'cape--waiting)) (if toi (unwind-protect (progn (funcall fetch (lambda (arg) (when (eq res 'cape--waiting) (push 'cape--done unread-command-events) (setq res arg)))) (when (eq res 'cape--waiting) (let ((ev (let ((input-method-function nil) (echo-keystrokes 0)) (read-event nil t)))) (unless (eq ev 'cape--done) (push (cons t ev) unread-command-events) (setq res 'cape--cancelled) (throw toi t))))) (setq unread-command-events (delq 'cape--done unread-command-events))) (funcall fetch (lambda (arg) (setq res arg))) ;; Force synchronization, not interruptible! We use polling ;; here and ignore pending input since we don't use ;; `sit-for'. This is the same method used by Company itself. (while (eq res 'cape--waiting) (sleep-for 0.01))) res)) ;; Plain old synchronous return value. (res res)))) (defvar-local cape--company-init nil) ;;;###autoload (defun cape-company-to-capf (backend &optional valid) "Convert Company BACKEND function to Capf. VALID is a function taking the old and new input string. It should return nil if the cached candidates became invalid. The default value for VALID is `string-prefix-p' such that the candidates are only fetched again if the input prefix changed." (lambda () (when (and (symbolp backend) (not (fboundp backend))) (ignore-errors (require backend nil t))) (when (bound-and-true-p company-mode) (error "`cape-company-to-capf' should not be used with `company-mode', use the Company backend directly instead")) (when (and (symbolp backend) (not (alist-get backend cape--company-init))) (funcall backend 'init) (put backend 'company-init t) (setf (alist-get backend cape--company-init) t)) (when-let ((pre (pcase (cape--company-call backend 'prefix) ((or `(,p ,_s) (and (pred stringp) p)) (cons p (length p))) ((or `(,p ,_s ,l) `(,p . ,l)) (cons p l))))) (let* ((end (point)) (beg (- end (length (car pre)))) (valid (if (cape--company-call backend 'no-cache (car pre)) #'equal (or valid #'string-prefix-p))) (sort-fun (and (cape--company-call backend 'sorted) #'identity)) restore-props) (list beg end (funcall (if (cape--company-call backend 'ignore-case) #'completion-table-case-fold #'identity) (cape--dynamic-table beg end (lambda (input) (let ((cands (cape--company-call backend 'candidates input))) ;; The candidate string including text properties should be ;; restored in the :exit-function, unless the UI guarantees ;; this itself, like Corfu. (unless (bound-and-true-p corfu-mode) (setq restore-props cands)) (cons (apply-partially valid input) cands))))) :category backend :exclusive 'no :company-prefix-length (cdr pre) :company-doc-buffer (lambda (x) (cape--company-call backend 'doc-buffer x)) :company-location (lambda (x) (cape--company-call backend 'location x)) :company-docsig (lambda (x) (cape--company-call backend 'meta x)) :company-deprecated (lambda (x) (cape--company-call backend 'deprecated x)) :company-kind (lambda (x) (cape--company-call backend 'kind x)) :display-sort-function sort-fun :cycle-sort-function sort-fun :annotation-function (lambda (x) (when-let (ann (cape--company-call backend 'annotation x)) (concat " " (string-trim ann)))) :exit-function (lambda (x _status) ;; Restore the candidate string including ;; properties if restore-props is non-nil. See ;; the comment above. (setq x (or (car (member x restore-props)) x)) (cape--company-call backend 'post-completion x))))))) ;;;###autoload (defun cape-interactive (&rest capfs) "Complete interactively with the given CAPFS." (let* ((ctx (and (consp (car capfs)) (car capfs))) (capfs (if ctx (cdr capfs) capfs)) (completion-at-point-functions (if ctx (mapcar (lambda (f) `(lambda () (let ,ctx (funcall ',f)))) capfs) capfs))) (unless (completion-at-point) (user-error "%s: No completions" (mapconcat (lambda (fun) (if (symbolp fun) (symbol-name fun) "anonymous-capf")) capfs ", "))))) ;;;###autoload (defun cape-capf-interactive (capf) "Create interactive completion function from CAPF." (lambda (&optional interactive) (interactive (list t)) (if interactive (cape-interactive capf) (funcall capf)))) ;;;###autoload (defun cape-wrap-super (&rest capfs) "Call CAPFS and return merged completion result. The CAPFS list can contain the keyword `:with' to mark the Capfs afterwards as auxiliary. One of the non-auxiliary Capfs before `:with' must return non-nil for the super Capf to set in and return a non-nil result. Such behavior is useful when listing multiple super Capfs in the `completion-at-point-functions': (setq completion-at-point-functions (list (cape-capf-super \\='eglot-completion-at-point :with \\='tempel-complete) (cape-capf-super \\='cape-dabbrev :with \\='tempel-complete)))" (when-let ((results (cl-loop for capf in capfs until (eq capf :with) for res = (funcall capf) if res collect (cons t res)))) (pcase-let* ((results (nconc results (cl-loop for capf in (cdr (memq :with capfs)) for res = (funcall capf) if res collect (cons nil res)))) (`((,_main ,beg ,end . ,_)) results) (cand-ht nil) (tables nil) (exclusive nil) (prefix-len nil) (cand-functions '( :company-docsig :company-location :company-kind :company-doc-buffer :company-deprecated :annotation-function :exit-function))) (cl-loop for (main beg2 end2 table . plist) in results do ;; Note: `cape-capf-super' currently cannot merge Capfs which ;; trigger at different beginning positions. In order to support ;; this, take the smallest BEG value and then normalize all ;; candidates by prefixing them such that they all start at the ;; smallest BEG position. (when (= beg beg2) (push (list main (plist-get plist :predicate) table ;; Plist attached to the candidates (mapcan (lambda (f) (when-let ((v (plist-get plist f))) (list f v))) cand-functions)) tables) ;; The resulting merged Capf is exclusive if one of the main ;; Capfs is exclusive. (when (and main (not (eq (plist-get plist :exclusive) 'no))) (setq exclusive t)) (setq end (max end end2)) (let ((plen (plist-get plist :company-prefix-length))) (cond ((eq plen t) (setq prefix-len t)) ((and (not prefix-len) (integerp plen)) (setq prefix-len plen)) ((and (integerp prefix-len) (integerp plen)) (setq prefix-len (max prefix-len plen))))))) (setq tables (nreverse tables)) `( ,beg ,end ,(lambda (str pred action) (pcase action ((or `(boundaries . ,_) 'metadata) nil) ('t ;; all-completions (let ((ht (make-hash-table :test #'equal)) (candidates nil)) (cl-loop for (main table-pred table cand-plist) in tables do (let* ((pr (if (and table-pred pred) (lambda (x) (and (funcall table-pred x) (funcall pred x))) (or table-pred pred))) (md (completion-metadata "" table pr)) (sort (or (completion-metadata-get md 'display-sort-function) #'identity)) ;; Always compute candidates of the main Capf ;; tables, which come first in the tables ;; list. For the :with Capfs only compute ;; candidates if we've already determined that ;; main candidates are available. (cands (when (or main (or exclusive cand-ht candidates)) (funcall sort (all-completions str table pr))))) ;; Handle duplicates with a hash table. (cl-loop for cand in-ref cands for dup = (gethash cand ht t) do (cond ((eq dup t) ;; Candidate does not yet exist. (puthash cand cand-plist ht)) ((not (equal dup cand-plist)) ;; Duplicate candidate. Candidate plist is ;; different, therefore disambiguate the ;; candidates. (setf cand (propertize cand 'cape-capf-super (cons cand cand-plist)))))) (when cands (push cands candidates)))) (when (or cand-ht candidates) (setq candidates (apply #'nconc (nreverse candidates)) cand-ht ht) candidates))) (_ ;; try-completion and test-completion (cl-loop for (_main table-pred table _cand-plist) in tables thereis (complete-with-action action table str (if (and table-pred pred) (lambda (x) (and (funcall table-pred x) (funcall pred x))) (or table-pred pred))))))) :company-prefix-length ,prefix-len :category cape-super :display-sort-function identity :cycle-sort-function identity ,@(and (not exclusive) '(:exclusive no)) ,@(mapcan (lambda (prop) (list prop (lambda (cand &rest args) (if-let ((ref (get-text-property 0 'cape-capf-super cand))) (when-let ((fun (plist-get (cdr ref) prop))) (apply fun (car ref) args)) (when-let ((plist (and cand-ht (gethash cand cand-ht))) (fun (plist-get plist prop))) (apply fun cand args)))))) cand-functions))))) ;;;###autoload (defun cape-wrap-debug (capf &optional name) "Call CAPF and return a completion table which prints trace messages. If CAPF is an anonymous lambda, pass the Capf NAME explicitly for meaningful debugging output." (unless name (setq name (if (symbolp capf) capf "capf"))) (setq name (format "%s@%s" name (cl-incf cape--debug-id))) (pcase (funcall capf) (`(,beg ,end ,table . ,plist) (let* ((limit (1+ cape--debug-length)) (pred (plist-get plist :predicate)) (cands ;; Reset regexps for `all-completions' (let (completion-ignore-case completion-regexp-list) (all-completions "" table (lambda (&rest args) (and (or (not pred) (apply pred args)) (>= (cl-decf limit) 0)))))) (plist-str "") (plist-elt plist)) (while (cdr plist-elt) (setq plist-str (format "%s %s=%s" plist-str (substring (symbol-name (car plist-elt)) 1) (cape--debug-print (cadr plist-elt))) plist-elt (cddr plist-elt))) (cape--debug-message "%s => input=%s:%s:%S table=%s%s" name (+ beg 0) (+ end 0) (buffer-substring-no-properties beg end) (cape--debug-print cands) plist-str)) `( ,beg ,end ,(cape--debug-table table name (copy-marker beg) (copy-marker end t)) ,@(when-let ((exit (plist-get plist :exit-function))) (list :exit-function (lambda (cand status) (cape--debug-message "%s:exit(candidate=%S status=%s)" name cand status) (funcall exit cand status)))) . ,plist)) (result (cape--debug-message "%s() => %s (No completion)" name (cape--debug-print result))))) ;;;###autoload (defun cape-wrap-buster (capf &optional valid) "Call CAPF and return a completion table with cache busting. This function can be used as an advice around an existing Capf. The cache is busted when the input changes. The argument VALID can be a function taking the old and new input string. It should return nil if the new input requires that the completion table is refreshed. The default value for VALID is `equal', such that the completion table is refreshed on every input change." (setq valid (or valid #'equal)) (pcase (funcall capf) (`(,beg ,end ,table . ,plist) (setq plist `(:cape--buster t . ,plist)) `( ,beg ,end ,(let* ((beg (copy-marker beg)) (end (copy-marker end t)) (input (buffer-substring-no-properties beg end))) (lambda (str pred action) (let ((new-input (buffer-substring-no-properties beg end))) (unless (or (not (eq action t)) (cape--separator-p new-input) (funcall valid input new-input)) (pcase ;; Reset in case `all-completions' is used inside CAPF (let (completion-ignore-case completion-regexp-list) (funcall capf)) ((and `(,new-beg ,new-end ,new-table . ,new-plist) (guard (and (= beg new-beg) (= end new-end)))) (let (throw-on-input) ;; No interrupt during state update (setf table new-table input new-input (cddr plist) new-plist)))))) (complete-with-action action table str pred))) ,@plist)))) ;;;###autoload (defun cape-wrap-passthrough (capf) "Call CAPF and make sure that no completion style filtering takes place." (pcase (funcall capf) (`(,beg ,end ,table . ,plist) `(,beg ,end ,(cape--passthrough-table table) ,@plist)))) ;;;###autoload (defun cape-wrap-properties (capf &rest properties) "Call CAPF and strip or add completion PROPERTIES. Completion properties include for example :exclusive, :category, :annotation-function, :display-sort-function and various :company-* extensions. The :strip flag means to strip all completion properties." (pcase (funcall capf) (`(,beg ,end ,table . ,plist) `( ,beg ,end ,table ,@(and (not (plist-get properties :strip)) (append properties plist)))))) ;;;###autoload (defun cape-wrap-nonexclusive (capf) "Call CAPF and ensure that it is marked as non-exclusive. This function can be used as an advice around an existing Capf." (cape-wrap-properties capf :exclusive 'no)) ;;;###autoload (defun cape-wrap-sort (capf sort) "Call CAPF and add SORT function. This function can be used as an advice around an existing Capf." (cape-wrap-properties capf :display-sort-function sort :cycle-sort-function sort)) ;;;###autoload (defun cape-wrap-predicate (capf predicate) "Call CAPF and add an additional candidate PREDICATE. The PREDICATE is passed the candidate symbol or string." (pcase (funcall capf) (`(,beg ,end ,table . ,plist) `( ,beg ,end ,table :predicate ,(if-let (pred (plist-get plist :predicate)) ;; First argument is key, second is value for hash tables. ;; The first argument can be a cons cell for alists. Then ;; the candidate itself is either a string or a symbol. We ;; normalize the calling convention here such that PREDICATE ;; always receives a string or a symbol. (lambda (&rest args) (when (apply pred args) (setq args (car args)) (funcall predicate (if (consp args) (car args) args)))) (lambda (key &optional _val) (funcall predicate (if (consp key) (car key) key)))) ,@plist)))) ;;;###autoload (defun cape-wrap-silent (capf) "Call CAPF and silence it (no messages, no errors). This function can be used as an advice around an existing Capf." (pcase (cape--silent (funcall capf)) (`(,beg ,end ,table . ,plist) `(,beg ,end ,(cape--silent-table table) ,@plist)))) ;;;###autoload (defun cape-wrap-case-fold (capf &optional nofold) "Call CAPF and return a case-insensitive completion table. If NOFOLD is non-nil return a case sensitive table instead. This function can be used as an advice around an existing Capf." (pcase (funcall capf) (`(,beg ,end ,table . ,plist) `(,beg ,end ,(completion-table-case-fold table nofold) ,@plist)))) ;;;###autoload (defun cape-wrap-noninterruptible (capf) "Call CAPF and return a non-interruptible completion table. This function can be used as an advice around an existing Capf." (pcase (let (throw-on-input) (funcall capf)) (`(,beg ,end ,table . ,plist) `(,beg ,end ,(cape--noninterruptible-table table) ,@plist)))) ;;;###autoload (defun cape-wrap-prefix-length (capf length) "Call CAPF and ensure that prefix length is greater or equal than LENGTH. If the prefix is long enough, enforce auto completion." (pcase (funcall capf) (`(,beg ,end ,table . ,plist) (when (>= (- end beg) length) `(,beg ,end ,table :company-prefix-length t ,@plist))))) ;;;###autoload (defun cape-wrap-inside-faces (capf &rest faces) "Call CAPF only if inside FACES. This function can be used as an advice around an existing Capf." (when-let (((> (point) (point-min))) (fs (get-text-property (1- (point)) 'face)) ((if (listp fs) (cl-loop for f in fs thereis (memq f faces)) (memq fs faces)))) (funcall capf))) ;;;###autoload (defun cape-wrap-inside-code (capf) "Call CAPF only if inside code, not inside a comment or string. This function can be used as an advice around an existing Capf." (let ((s (syntax-ppss))) (and (not (nth 3 s)) (not (nth 4 s)) (funcall capf)))) ;;;###autoload (defun cape-wrap-inside-comment (capf) "Call CAPF only if inside comment. This function can be used as an advice around an existing Capf." (and (nth 4 (syntax-ppss)) (funcall capf))) ;;;###autoload (defun cape-wrap-inside-string (capf) "Call CAPF only if inside string. This function can be used as an advice around an existing Capf." (and (nth 3 (syntax-ppss)) (funcall capf))) ;;;###autoload (defun cape-wrap-purify (capf) "Call CAPF and ensure that it does not illegally modify the buffer. This function can be used as an advice around an existing Capf. It has been introduced mainly to fix the broken `pcomplete-completions-at-point' function in Emacs versions < 29." ;; bug#50470: Fix Capfs which illegally modify the buffer or which illegally ;; call `completion-in-region'. The workaround here was proposed by ;; @jakanakaevangeli and is used in his capf-autosuggest package. In Emacs 29 ;; the purity bug of Pcomplete has been fixed, such that make ;; `cape-wrap-purify' is not necessary anymore. (catch 'cape--illegal-completion-in-region (condition-case nil (let ((buffer-read-only t) (inhibit-read-only nil) (completion-in-region-function (lambda (beg end coll pred) (throw 'cape--illegal-completion-in-region (list beg end coll :predicate pred))))) (funcall capf)) (buffer-read-only nil)))) ;;;###autoload (defun cape-wrap-accept-all (capf) "Call CAPF and return a completion table which accepts every input. This function can be used as an advice around an existing Capf." (pcase (funcall capf) (`(,beg ,end ,table . ,plist) `(,beg ,end ,(cape--accept-all-table table) . ,plist)))) ;;;###autoload (autoload 'cape-capf-accept-all "cape") ;;;###autoload (autoload 'cape-capf-buster "cape") ;;;###autoload (autoload 'cape-capf-case-fold "cape") ;;;###autoload (autoload 'cape-capf-debug "cape") ;;;###autoload (autoload 'cape-capf-inside-code "cape") ;;;###autoload (autoload 'cape-capf-inside-comment "cape") ;;;###autoload (autoload 'cape-capf-inside-faces "cape") ;;;###autoload (autoload 'cape-capf-inside-string "cape") ;;;###autoload (autoload 'cape-capf-nonexclusive "cape") ;;;###autoload (autoload 'cape-capf-noninterruptible "cape") ;;;###autoload (autoload 'cape-capf-passthrough "cape") ;;;###autoload (autoload 'cape-capf-predicate "cape") ;;;###autoload (autoload 'cape-capf-prefix-length "cape") ;;;###autoload (autoload 'cape-capf-properties "cape") ;;;###autoload (autoload 'cape-capf-purify "cape") ;;;###autoload (autoload 'cape-capf-silent "cape") ;;;###autoload (autoload 'cape-capf-super "cape") (dolist (wrapper (list #'cape-wrap-accept-all #'cape-wrap-buster #'cape-wrap-case-fold #'cape-wrap-debug #'cape-wrap-inside-code #'cape-wrap-inside-comment #'cape-wrap-inside-faces #'cape-wrap-inside-string #'cape-wrap-nonexclusive #'cape-wrap-noninterruptible #'cape-wrap-passthrough #'cape-wrap-predicate #'cape-wrap-prefix-length #'cape-wrap-properties #'cape-wrap-purify #'cape-wrap-silent #'cape-wrap-sort #'cape-wrap-super)) (let ((name (string-remove-prefix "cape-wrap-" (symbol-name wrapper)))) (defalias (intern (format "cape-capf-%s" name)) (lambda (capf &rest args) (lambda () (apply wrapper capf args))) (format "Create a %s Capf from CAPF. The Capf calls `%s' with CAPF and ARGS as arguments." name wrapper)))) (defvar-keymap cape-prefix-map :doc "Keymap used as completion entry point. The keymap should be installed globally under a prefix." "TAB" #'completion-at-point "M-TAB" #'completion-at-point "p" #'completion-at-point "t" #'complete-tag "d" #'cape-dabbrev "h" #'cape-history "f" #'cape-file "s" #'cape-elisp-symbol "e" #'cape-elisp-block "a" #'cape-abbrev "l" #'cape-line "w" #'cape-dict "k" 'cape-keyword ":" 'cape-emoji "\\" 'cape-tex "_" 'cape-tex "^" 'cape-tex "&" 'cape-sgml "r" 'cape-rfc1345) ;;;###autoload (autoload 'cape-prefix-map "cape" nil t 'keymap) (defalias 'cape-prefix-map cape-prefix-map) (provide 'cape) ;;; cape.el ends here