├── COPYING ├── Makefile ├── README.pod ├── c.c ├── c.sh ├── config.mk ├── jarowinkler.c ├── jarowinkler.h ├── levenshtein ├── Makefile ├── levenshtein.c └── levenshtein.h ├── matcher.h ├── options.c ├── options.h ├── util.c └── util.h /COPYING: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | include config.mk 2 | 3 | SRC = c.c jarowinkler.c options.c util.c 4 | OBJ = $(SRC:.c=.o) 5 | 6 | all: c c.1 7 | 8 | .c.o: 9 | $(CC) $(CFLAGS) -c $< 10 | 11 | c: $(OBJ) 12 | $(CC) $(LDFLAGS) $(LIBS) -o $@ $(OBJ) 13 | 14 | c.1: README.pod 15 | pod2man --section=1 --name="C" --center="User Commands" --release="c ${VERSION}" $< > $@ 16 | 17 | clean: 18 | rm -f c c.1 $(OBJ) 19 | 20 | install: all 21 | install -D c $(DESTDIR)$(PREFIX)/bin/c 22 | install -D c.sh $(DESTDIR)/etc/bash_completion.d/c 23 | install -D -m 644 c.1 $(DESTDIR)$(PREFIX)/share/man/man1/c.1 24 | 25 | uninstall: 26 | rm -f $(DESTDIR)$(PREFIX)/bin/c 27 | rm -f $(DESTDIR)/etc/bash_completion.d/c 28 | rm -f $(DESTDIR)$(PREFIX)/share/man/man1/c.1 29 | 30 | .PHONY: all clean install uninstall 31 | -------------------------------------------------------------------------------- /README.pod: -------------------------------------------------------------------------------- 1 | =head1 NAME 2 | 3 | c - a 'cd' wrapper 4 | 5 | =head1 SYNOPSIS 6 | 7 | B [B<-chisv>] [B<-l> I] [B<-m> I] [B<-t> I] [I] 8 | 9 | =head1 DESCRIPTION 10 | 11 | B is a 'cd' wrapper that fuzzy finds and cd into I. 12 | 13 | For instance, if you have I and I directories and run 'B I' you'll end up in I I. 14 | 15 | =head1 OPTIONS 16 | 17 | =over 4 18 | 19 | =item B<-c> 20 | 21 | Do bash completion. 22 | 23 | =item B<-h> 24 | 25 | Print usage information. 26 | 27 | =item B<-i> 28 | 29 | Do insensitive case completion. 30 | 31 | =item B<-l> I 32 | 33 | Select the shared library where I is found. 34 | 35 | =item B<-m> I 36 | 37 | Set the aproximate string matching function. See B<-l>. 38 | 39 | =item B<-s> 40 | 41 | Simulate. Print all matching directories. 42 | 43 | =item B<-t> I 44 | 45 | Set the threshold ([0,1]). 46 | 47 | =item B<-v> 48 | 49 | Print version information. 50 | 51 | =back 52 | 53 | =head1 ENVIRONMENT 54 | 55 | Defines a c() function that wraps shell 'cd'. 56 | 57 | If set, $_C_OPTS will be passed as arguments. 58 | 59 | =head1 EXAMPLE 60 | 61 | =over 4 62 | 63 | =item c foo 64 | 65 | cd to the directory with name most similar to foo. 66 | 67 | =item c -t 0.75 foo 68 | 69 | cd to the directory with name most similar to foo using a threshold of 75%. 70 | 71 | =item c -l liblevenshtein.so -m normalized_levenshtein_distance foo 72 | 73 | cd to the directory with name most similar to foo using a levenshtein distance algorithm instead of the default. 74 | 75 | =back 76 | 77 | =head1 AUTHOR 78 | 79 | Miguel Serrano 80 | 81 | =head1 HOMEPAGE 82 | 83 | http://github.com/miguelvps/c 84 | 85 | 86 | =head1 SEE ALSO 87 | 88 | cd, cdargs, autojump, z 89 | -------------------------------------------------------------------------------- /c.c: -------------------------------------------------------------------------------- 1 | /* c: c.c 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #define _BSD_SOURCE 19 | 20 | #include 21 | #include 22 | #include 23 | #include 24 | #include 25 | #include 26 | 27 | #include "options.h" 28 | #include "util.h" 29 | 30 | #define darray(type) \ 31 | { type *items; int size; int alloc; } 32 | 33 | #define darray_init(a, n) \ 34 | do { \ 35 | (a)->items = s_malloc(n * sizeof(*(a)->items)); \ 36 | (a)->size = 0; \ 37 | (a)->alloc = n; \ 38 | } while (0) 39 | 40 | #define darray_free(a) \ 41 | free((a)->items) 42 | 43 | #define darray_destroy(a, d, i) \ 44 | do { \ 45 | for (i=0; i<(a)->size; i++) \ 46 | d((a)->items[i]); \ 47 | darray_free(a); \ 48 | } while (0) 49 | 50 | #define darray_append(a, i) \ 51 | do { \ 52 | if ((a)->size >= (a)->alloc) \ 53 | (a)->items = s_realloc((a)->items, \ 54 | ((a)->alloc*=2) * sizeof(*(a)->items)); \ 55 | (a)->items[(a)->size++] = i; \ 56 | } while (0) 57 | 58 | struct darray_match darray(struct match *); 59 | struct darray_string darray(char *); 60 | 61 | struct match { 62 | char *dir; 63 | double score; 64 | }; 65 | 66 | struct match *match_new(char *dir, double score) { 67 | struct match *match = s_malloc(sizeof(*match)); 68 | 69 | match->dir = dir; 70 | match->score = score; 71 | return match; 72 | } 73 | 74 | void match_free(struct match *match) { 75 | free(match->dir); 76 | free(match); 77 | } 78 | 79 | int match_compare(const void *a, const void *b) { 80 | struct match **m1 = (struct match **)a; 81 | struct match **m2 = (struct match **)b; 82 | 83 | return ((*m1)->score > (*m2)->score) - ((*m1)->score < (*m2)->score); 84 | } 85 | 86 | /* from path find match directories for tokens and return it in matches */ 87 | void aprox_path_match_rec(const char *path, struct darray_string *tokens, 88 | int level, double score, 89 | struct darray_match *matches) { 90 | double s; 91 | char *p; 92 | DIR *dp; 93 | struct dirent *dir; 94 | 95 | dp = opendir(*path ? path : "."); 96 | if (dp == NULL) 97 | return; 98 | 99 | while ((dir = readdir(dp))) { 100 | if (dir->d_type != DT_DIR) 101 | continue; 102 | 103 | s = options.matcher(dir->d_name, tokens->items[level]); 104 | if (s > options.threshold) { 105 | if (level + 1 >= tokens->size) { 106 | p = s_malloc(strlen(path) + strlen(dir->d_name) + 1); 107 | sprintf(p, "%s%s", path, dir->d_name); 108 | darray_append(matches, match_new(p, (score + s) / (level + 1))); 109 | } 110 | else { 111 | p = s_malloc(strlen(path) + strlen(dir->d_name) + 2); 112 | sprintf(p, "%s%s/", path, dir->d_name); 113 | aprox_path_match_rec(p, tokens, level + 1, score + s, matches); 114 | free(p); 115 | } 116 | } 117 | } 118 | closedir(dp); 119 | } 120 | 121 | struct darray_match *aprox_path_match(const char *path) { 122 | char *p, *token; 123 | struct darray_string tokens; 124 | struct darray_match *matches; 125 | 126 | p = s_malloc((strlen(path) + 1) * sizeof(*p)); 127 | p = strcpy(p, path); 128 | 129 | darray_init(&tokens, 10); 130 | token = strtok(p, "/"); 131 | while (token != NULL) { 132 | darray_append(&tokens, token); 133 | token = strtok(NULL, "/"); 134 | } 135 | 136 | matches = s_malloc(sizeof(*matches)); 137 | darray_init(matches, 10); 138 | aprox_path_match_rec((path[0] == '/') ? "/" : "", &tokens, 0, 0, matches); 139 | 140 | darray_free(&tokens); 141 | free(p); 142 | 143 | return matches; 144 | } 145 | 146 | int print_dir_complete(const char *path, const char *prefix, int full) { 147 | int i; 148 | DIR *dp; 149 | struct dirent *dir; 150 | 151 | dp = opendir(*path ? path : "."); 152 | if (dp == NULL) 153 | return 0; 154 | 155 | i = 0; 156 | while ((dir = readdir(dp))) { 157 | if (dir->d_type != DT_DIR 158 | || (prefix[0] != '.' 159 | && (strcmp(dir->d_name, ".") == 0 160 | || strcmp(dir->d_name, "..") == 0))) 161 | continue; 162 | if (str_starts_with(dir->d_name, prefix, options.icase)) { 163 | if (full) 164 | printf("%s%s%s\n", path, 165 | path[max(0, strlen(path) - 1)] == '/' ? "" : "/", 166 | dir->d_name); 167 | else 168 | printf("%s\n", dir->d_name); 169 | i++; 170 | } 171 | } 172 | closedir(dp); 173 | return i; 174 | } 175 | 176 | void complete(const char *path) { 177 | int i, path_len; 178 | char *p, *c, *dname; 179 | struct stat buf; 180 | struct darray_match *matches; 181 | 182 | path_len = strlen(path); 183 | 184 | /* Normal completion */ 185 | if (path_len == 0) { 186 | print_dir_complete("", "", 0); 187 | return; 188 | } 189 | p = c = s_malloc((path_len + 1) * sizeof(*p)); 190 | p = strcpy(p, path); 191 | dname = strrchr(p, '/'); 192 | if (dname == NULL) { 193 | if (print_dir_complete("", p, 0)) 194 | return; 195 | } 196 | else { 197 | if (dname == p) 198 | p = "/"; 199 | dname[0] = '\0'; 200 | dname++; 201 | if (stat(p, &buf) == 0 && S_ISDIR(buf.st_mode)) { 202 | if (print_dir_complete(p, dname, 1)) 203 | return; 204 | } 205 | } 206 | free(c); 207 | 208 | /* Aprox completion */ 209 | matches = aprox_path_match(path); 210 | qsort(matches->items, matches->size, sizeof(*matches->items), 211 | match_compare); 212 | if (path[path_len - 1] == '/') 213 | for (i = 0; i < matches->size; i++) 214 | print_dir_complete(matches->items[i]->dir, "", 1); 215 | else 216 | for (i = 0; i < matches->size; i++) 217 | printf("%s\n", matches->items[i]->dir); 218 | darray_destroy(matches, match_free, i); 219 | free(matches); 220 | } 221 | 222 | int main(int argc, char *const argv[]) { 223 | int i; 224 | char *path; 225 | struct darray_match *matches; 226 | struct stat buf; 227 | 228 | parse_options(argc, argv); 229 | 230 | if (options.simulate) { 231 | matches = aprox_path_match(options.directory); 232 | qsort(matches->items, matches->size, sizeof(*matches->items), 233 | match_compare); 234 | for (i = matches->size - 1; i >= 0; i--) { 235 | path = realpath(matches->items[i]->dir, NULL); 236 | fprintf(stderr, "%.0f%% %s\n", matches->items[i]->score * 100, path); 237 | free(path); 238 | } 239 | darray_destroy(matches, match_free, i); 240 | free(matches); 241 | return 0; 242 | } 243 | 244 | if (options.complete) { 245 | complete(options.directory); 246 | return 0; 247 | } 248 | 249 | if (!*options.directory) { 250 | printf("%s", getenv("HOME")); 251 | return 0; 252 | } 253 | 254 | if (strcmp(options.directory, "-") == 0) { 255 | printf("%s", options.directory); 256 | return 0; 257 | } 258 | 259 | if (stat(options.directory, &buf) == 0 && S_ISDIR(buf.st_mode)) { 260 | printf("%s", options.directory); 261 | return 0; 262 | } 263 | 264 | matches = aprox_path_match(options.directory); 265 | if (matches->size) { 266 | qsort(matches->items, matches->size, sizeof(*matches->items), 267 | match_compare); 268 | path = realpath(matches->items[matches->size - 1]->dir, NULL); 269 | printf("%s", path); 270 | fprintf(stderr, "%.0f%% %s\n", matches->items[0]->score * 100, path); 271 | free(path); 272 | } 273 | else 274 | printf("%s", options.directory); 275 | 276 | darray_destroy(matches, match_free, i); 277 | free(matches); 278 | 279 | return 0; 280 | } 281 | -------------------------------------------------------------------------------- /c.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | function c() { 4 | cd "`command c $_C_OPTS "$@"`" 5 | } 6 | if [[ `bind -v` == *"set completion-ignore-case on"* ]] 7 | then 8 | complete -o filenames -C 'command c $_C_OPTS -ci' c 9 | else 10 | complete -o filenames -C 'command c $_C_OPTS -c' c 11 | fi 12 | -------------------------------------------------------------------------------- /config.mk: -------------------------------------------------------------------------------- 1 | VERSION = $(shell git describe --tags --always --dirty) 2 | 3 | CC = gcc 4 | DESTDIR = 5 | PREFIX = /usr/local 6 | LIBS = -ldl 7 | CFLAGS = -std=c99 -Wall -Wextra -pedantic -g -DVERSION=\"$(VERSION)\" 8 | LDFLAGS = -g 9 | SHARED_CFLAGS = -fPIC 10 | SHARED_LDFLAGS = -shared -Wl,-soname,$@.$(MAJOR_VERSION) 11 | -------------------------------------------------------------------------------- /jarowinkler.c: -------------------------------------------------------------------------------- 1 | /* c: jarowinkler.c 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #include 19 | 20 | #define SCALING_FACTOR 0.1 21 | 22 | static int max(int x, int y) { 23 | return x > y ? x : y; 24 | } 25 | 26 | static int min(int x, int y) { 27 | return x < y ? x : y; 28 | } 29 | 30 | double jaro_winkler_distance(const char *s, const char *a) { 31 | int i, j, l; 32 | int m = 0, t = 0; 33 | int sl = strlen(s); 34 | int al = strlen(a); 35 | int sflags[sl], aflags[al]; 36 | int range = max(0, max(sl, al) / 2 - 1); 37 | double dw; 38 | 39 | if (!sl || !al) 40 | return 0.0; 41 | 42 | for (i = 0; i < al; i++) 43 | aflags[i] = 0; 44 | 45 | for (i = 0; i < sl; i++) 46 | sflags[i] = 0; 47 | 48 | /* calculate matching characters */ 49 | for (i = 0; i < al; i++) { 50 | for (j = max(i - range, 0), l = min(i + range + 1, sl); j < l; j++) { 51 | if (a[i] == s[j] && !sflags[j]) { 52 | sflags[j] = 1; 53 | aflags[i] = 1; 54 | m++; 55 | break; 56 | } 57 | } 58 | } 59 | 60 | if (!m) 61 | return 0.0; 62 | 63 | /* calculate character transpositions */ 64 | l = 0; 65 | for (i = 0; i < al; i++) { 66 | if (aflags[i] == 1) { 67 | for (j = l; j < sl; j++) { 68 | if (sflags[j] == 1) { 69 | l = j + 1; 70 | break; 71 | } 72 | } 73 | if (a[i] != s[j]) 74 | t++; 75 | } 76 | } 77 | t /= 2; 78 | 79 | /* Jaro distance */ 80 | dw = (((double)m / sl) + ((double)m / al) + ((double)(m - t) / m)) / 3.0; 81 | 82 | /* calculate common string prefix up to 4 chars */ 83 | l = 0; 84 | for (i = 0; i < min(min(sl, al), 4); i++) 85 | if (s[i] == a[i]) 86 | l++; 87 | 88 | /* Jaro-Winkler distance */ 89 | dw = dw + (l * SCALING_FACTOR * (1 - dw)); 90 | 91 | return dw; 92 | } 93 | -------------------------------------------------------------------------------- /jarowinkler.h: -------------------------------------------------------------------------------- 1 | /* c: jarowinkler.h 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | double jaro_winkler_distance(const char *s, const char *a); 19 | -------------------------------------------------------------------------------- /levenshtein/Makefile: -------------------------------------------------------------------------------- 1 | include ../config.mk 2 | 3 | MAJOR_VERSION = 1 4 | MINOR_VERSION = 0 5 | 6 | SRC = levenshtein.c 7 | OBJ = $(SRC:.c=.o) 8 | 9 | all: liblevenshtein.so 10 | 11 | liblevenshtein.so: $(OBJ) 12 | $(CC) $(LDFLAGS) $(SHARED_LDFLAGS) -o $@.$(MAJOR_VERSION).$(MINOR_VERSION) $(OBJ) 13 | ln -sf $@.$(MAJOR_VERSION).$(MINOR_VERSION) $@.$(MAJOR_VERSION) 14 | ln -sf $@.$(MAJOR_VERSION).$(MINOR_VERSION) $@ 15 | 16 | .c.o: 17 | $(CC) $(CFLAGS) $(SHARED_CFLAGS) -c $< 18 | 19 | clean: 20 | rm -f liblevenshtein.so* $(OBJ) 21 | 22 | install: all 23 | install -m 644 -D levenshtein.h $(DESTDIR)$(PREFIX)/include/levenshtein.h 24 | install -D liblevenshtein.so.$(MAJOR_VERSION).$(MINOR_VERSION) $(DESTDIR)$(PREFIX)/lib/liblevenshtein.so.$(MAJOR_VERSION).$(MINOR_VERSION) 25 | ln -sf liblevenshtein.so.$(MAJOR_VERSION).$(MINOR_VERSION) $(DESTDIR)$(PREFIX)/lib/liblevenshtein.so 26 | ldconfig 27 | 28 | uninstall: 29 | rm -f $(DESTDIR)$(PREFIX)/include/levenshtein.h 30 | rm -f $(DESTDIR)$(PREFIX)/lib/liblevenshtein.so 31 | rm -f $(DESTDIR)$(PREFIX)/lib/liblevenshtein.so.$(MAJOR_VERSION) 32 | rm -f $(DESTDIR)$(PREFIX)/lib/liblevenshtein.so.$(MAJOR_VERSION).$(MINOR_VERSION) 33 | 34 | .PHONY: all clean install uninstall 35 | -------------------------------------------------------------------------------- /levenshtein/levenshtein.c: -------------------------------------------------------------------------------- 1 | /* c: levenhstein.c 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #include 19 | 20 | static int min(int x, int y) { 21 | return x < y ? x : y; 22 | } 23 | 24 | int levenshtein_distance(const char *s, const char *t) { 25 | int i, j; 26 | int sl = strlen(s); 27 | int tl = strlen(t); 28 | int d[sl + 1][tl + 1]; 29 | 30 | for (i = 0; i <= sl; i++) 31 | d[i][0] = i; 32 | 33 | for (j = 0; j <= tl; j++) 34 | d[0][j] = j; 35 | 36 | for (j = 1; j <= tl; j++) { 37 | for (i = 1; i <= sl; i++) { 38 | if (s[i - 1] == t[j - 1]) { 39 | d[i][j] = d[i - 1][j - 1]; 40 | } 41 | else { 42 | d[i][j] = min(d[i - 1][j] + 1, /* deletion */ 43 | min(d[i][j - 1] + 1, /* insertion */ 44 | d[i - 1][j - 1] + 1)); /* substitution */ 45 | } 46 | } 47 | } 48 | return d[sl][tl]; 49 | } 50 | 51 | double normalized_levenshtein_distance(const char *s, const char *t) { 52 | int sl = strlen(s); 53 | int tl = strlen(t); 54 | double d = levenshtein_distance(s, t); 55 | 56 | return 1 - (d / (sl > tl ? sl : tl)); 57 | } 58 | -------------------------------------------------------------------------------- /levenshtein/levenshtein.h: -------------------------------------------------------------------------------- 1 | /* c: levenshtein.h 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | int levenshtein_distance(const char *s, const char *t); 19 | double normalized_levenshtein_distance(const char *s, const char *t); 20 | -------------------------------------------------------------------------------- /matcher.h: -------------------------------------------------------------------------------- 1 | /* c: matcher.h 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #ifndef MATCHER_H 19 | #define MATCHER_H 20 | 21 | #include "jarowinkler.h" 22 | 23 | #define THRESHOLD 0.75 24 | #define MATCHER jaro_winkler_distance 25 | 26 | typedef double (*matcher_t)(const char *, const char *); 27 | 28 | #endif /* MATCHER_H */ 29 | -------------------------------------------------------------------------------- /options.c: -------------------------------------------------------------------------------- 1 | /* c: options.c 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #define _XOPEN_SOURCE 19 | 20 | #include 21 | #include 22 | #include 23 | #include 24 | #include 25 | 26 | #include "options.h" 27 | #include "util.h" 28 | 29 | char *program_name; 30 | struct options options; 31 | 32 | void print_usage() { 33 | fprintf(stderr, 34 | "Usage: %s [-chisv] [-l library] [-m matcher] [-t threshold] [directory]\n", 35 | program_name); 36 | } 37 | 38 | void print_version() { 39 | fprintf(stderr, "c %s - a 'cd' wrapper\n", VERSION); 40 | } 41 | 42 | void parse_options(int argc, char *const argv[]) { 43 | int i; 44 | 45 | program_name = argv[0]; 46 | 47 | memset(&options, 0, sizeof(options)); 48 | options.matcher = MATCHER; 49 | options.threshold = THRESHOLD; 50 | options.directory = ""; 51 | 52 | while ((i=getopt(argc, argv, "chisvl:m:t:")) != -1) { 53 | switch (i) { 54 | case 'c': 55 | options.complete = 1; 56 | break; 57 | case 'h': 58 | print_usage(); 59 | exit(EXIT_SUCCESS); 60 | case 'i': 61 | options.icase = 1; 62 | break; 63 | case 'l': 64 | options.library = optarg; 65 | break; 66 | case 'm': 67 | options.matcher_name = optarg; 68 | break; 69 | case 's': 70 | options.simulate = 1; 71 | break; 72 | case 't': 73 | options.threshold = atof(optarg); 74 | break; 75 | case 'v': 76 | print_version(); 77 | exit(EXIT_SUCCESS); 78 | default: 79 | print_usage(); 80 | exit(EXIT_FAILURE); 81 | } 82 | } 83 | 84 | if (options.library && options.matcher_name) { 85 | void *handle; 86 | 87 | handle = dlopen(options.library, RTLD_LAZY); 88 | if (!handle) 89 | error(EXIT_FAILURE, 0, "dlopen: %s\n", dlerror()); 90 | *(void **)(&options.matcher) = dlsym(handle, options.matcher_name); 91 | if (options.matcher == NULL) 92 | error(EXIT_FAILURE, 0, "dlsym: %s\n", dlerror()); 93 | } 94 | 95 | if (options.complete && optind + 1 < argc) 96 | optind++; 97 | 98 | if (optind < argc) 99 | options.directory = argv[optind]; 100 | } 101 | -------------------------------------------------------------------------------- /options.h: -------------------------------------------------------------------------------- 1 | /* c: options.h 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #ifndef OPTIONS_H 19 | #define OPTIONS_H 20 | 21 | #include "matcher.h" 22 | 23 | struct options { 24 | int complete; 25 | int icase; 26 | char *library; 27 | char *matcher_name; 28 | matcher_t matcher; 29 | double threshold; 30 | char *directory; 31 | int simulate; 32 | }; 33 | 34 | extern char *program_name; 35 | extern struct options options; 36 | 37 | void print_usage(); 38 | void print_version(); 39 | 40 | void parse_options(int, char *const[]); 41 | 42 | #endif /* OPTIONS_H */ 43 | -------------------------------------------------------------------------------- /util.c: -------------------------------------------------------------------------------- 1 | /* c: util.c 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #include 19 | #include 20 | #include 21 | #include 22 | #include 23 | #include 24 | 25 | #include "options.h" 26 | 27 | void error(int status, int errnum, const char *format, ...) { 28 | va_list args; 29 | 30 | fprintf(stderr, "%s: error: ", program_name); 31 | va_start(args, format); 32 | vfprintf(stderr, format, args); 33 | va_end(args); 34 | if (errnum) 35 | fprintf(stderr, ": %s", strerror(errnum)); 36 | fprintf(stderr, "\n"); 37 | 38 | exit(status); 39 | } 40 | 41 | void *s_malloc(size_t size) { 42 | void *ptr; 43 | 44 | if (!(ptr = malloc(size))) 45 | error(EXIT_FAILURE, errno, "malloc"); 46 | 47 | return ptr; 48 | } 49 | 50 | void *s_realloc(void *ptr, size_t size) { 51 | if (!(ptr = realloc(ptr, size))) 52 | error(EXIT_FAILURE, errno, "realloc"); 53 | 54 | return ptr; 55 | } 56 | 57 | int str_starts_with(const char *str, const char *prefix, int icase) { 58 | if (icase) 59 | for (; *prefix && tolower(*str) == tolower(*prefix); str++, prefix++); 60 | else 61 | for (; *prefix && *str == *prefix; str++, prefix++); 62 | 63 | return !*prefix; 64 | } 65 | 66 | int max(int x, int y) { 67 | return x > y ? x : y; 68 | } 69 | -------------------------------------------------------------------------------- /util.h: -------------------------------------------------------------------------------- 1 | /* c: util.h 2 | * Copyright (C) 2011 Miguel Serrano 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | * 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | * 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | #ifndef UTIL_H 19 | #define UTIL_H 20 | 21 | void error(int, int, const char *, ...); 22 | 23 | void *s_malloc(size_t); 24 | void *s_realloc(void *, size_t); 25 | 26 | int str_starts_with(const char *, const char *, int); 27 | 28 | int max(int, int); 29 | 30 | #endif /* UTIL_H */ 31 | --------------------------------------------------------------------------------