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