├── .github └── FUNDING.yml ├── .gitignore ├── LICENSE ├── README.md ├── SYMBOLS.md ├── includes ├── base_hacks.hpp ├── core.hpp ├── hacks.hpp └── list_utils.hpp └── tests.cpp /.github/FUNDING.yml: -------------------------------------------------------------------------------- 1 | # These are supported funding model platforms 2 | 3 | github: [Z-Shang] 4 | patreon: # Replace with a single Patreon username 5 | open_collective: # Replace with a single Open Collective username 6 | ko_fi: # Replace with a single Ko-fi username 7 | tidelift: # Replace with a single Tidelift platform-name/package-name e.g., npm/babel 8 | community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry 9 | liberapay: # Replace with a single Liberapay username 10 | issuehunt: # Replace with a single IssueHunt username 11 | otechie: # Replace with a single Otechie username 12 | custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2'] 13 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Compiled Object files 5 | *.slo 6 | *.lo 7 | *.o 8 | *.obj 9 | 10 | # Precompiled Headers 11 | *.gch 12 | *.pch 13 | 14 | # Compiled Dynamic libraries 15 | *.so 16 | *.dylib 17 | *.dll 18 | 19 | # Fortran module files 20 | *.mod 21 | *.smod 22 | 23 | # Compiled Static libraries 24 | *.lai 25 | *.la 26 | *.a 27 | *.lib 28 | 29 | # Executables 30 | *.exe 31 | *.out 32 | *.app 33 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU AFFERO GENERAL PUBLIC LICENSE 2 | Version 3, 19 November 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 Affero General Public License is a free, copyleft license for 11 | software and other kinds of works, specifically designed to ensure 12 | cooperation with the community in the case of network server software. 13 | 14 | The licenses for most software and other practical works are designed 15 | to take away your freedom to share and change the works. By contrast, 16 | our General Public Licenses are intended to guarantee your freedom to 17 | share and change all versions of a program--to make sure it remains free 18 | software for all its users. 19 | 20 | When we speak of free software, we are referring to freedom, not 21 | price. Our General Public Licenses are designed to make sure that you 22 | have the freedom to distribute copies of free software (and charge for 23 | them if you wish), that you receive source code or can get it if you 24 | want it, that you can change the software or use pieces of it in new 25 | free programs, and that you know you can do these things. 26 | 27 | Developers that use our General Public Licenses protect your rights 28 | with two steps: (1) assert copyright on the software, and (2) offer 29 | you this License which gives you legal permission to copy, distribute 30 | and/or modify the software. 31 | 32 | A secondary benefit of defending all users' freedom is that 33 | improvements made in alternate versions of the program, if they 34 | receive widespread use, become available for other developers to 35 | incorporate. Many developers of free software are heartened and 36 | encouraged by the resulting cooperation. However, in the case of 37 | software used on network servers, this result may fail to come about. 38 | The GNU General Public License permits making a modified version and 39 | letting the public access it on a server without ever releasing its 40 | source code to the public. 41 | 42 | The GNU Affero General Public License is designed specifically to 43 | ensure that, in such cases, the modified source code becomes available 44 | to the community. It requires the operator of a network server to 45 | provide the source code of the modified version running there to the 46 | users of that server. Therefore, public use of a modified version, on 47 | a publicly accessible server, gives the public access to the source 48 | code of the modified version. 49 | 50 | An older license, called the Affero General Public License and 51 | published by Affero, was designed to accomplish similar goals. This is 52 | a different license, not a version of the Affero GPL, but Affero has 53 | released a new version of the Affero GPL which permits relicensing under 54 | this license. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | TERMS AND CONDITIONS 60 | 61 | 0. Definitions. 62 | 63 | "This License" refers to version 3 of the GNU Affero General Public License. 64 | 65 | "Copyright" also means copyright-like laws that apply to other kinds of 66 | works, such as semiconductor masks. 67 | 68 | "The Program" refers to any copyrightable work licensed under this 69 | License. Each licensee is addressed as "you". "Licensees" and 70 | "recipients" may be individuals or organizations. 71 | 72 | To "modify" a work means to copy from or adapt all or part of the work 73 | in a fashion requiring copyright permission, other than the making of an 74 | exact copy. The resulting work is called a "modified version" of the 75 | earlier work or a work "based on" the earlier work. 76 | 77 | A "covered work" means either the unmodified Program or a work based 78 | on the Program. 79 | 80 | To "propagate" a work means to do anything with it that, without 81 | permission, would make you directly or secondarily liable for 82 | infringement under applicable copyright law, except executing it on a 83 | computer or modifying a private copy. Propagation includes copying, 84 | distribution (with or without modification), making available to the 85 | public, and in some countries other activities as well. 86 | 87 | To "convey" a work means any kind of propagation that enables other 88 | parties to make or receive copies. Mere interaction with a user through 89 | a computer network, with no transfer of a copy, is not conveying. 90 | 91 | An interactive user interface displays "Appropriate Legal Notices" 92 | to the extent that it includes a convenient and prominently visible 93 | feature that (1) displays an appropriate copyright notice, and (2) 94 | tells the user that there is no warranty for the work (except to the 95 | extent that warranties are provided), that licensees may convey the 96 | work under this License, and how to view a copy of this License. If 97 | the interface presents a list of user commands or options, such as a 98 | menu, a prominent item in the list meets this criterion. 99 | 100 | 1. Source Code. 101 | 102 | The "source code" for a work means the preferred form of the work 103 | for making modifications to it. "Object code" means any non-source 104 | form of a work. 105 | 106 | A "Standard Interface" means an interface that either is an official 107 | standard defined by a recognized standards body, or, in the case of 108 | interfaces specified for a particular programming language, one that 109 | is widely used among developers working in that language. 110 | 111 | The "System Libraries" of an executable work include anything, other 112 | than the work as a whole, that (a) is included in the normal form of 113 | packaging a Major Component, but which is not part of that Major 114 | Component, and (b) serves only to enable use of the work with that 115 | Major Component, or to implement a Standard Interface for which an 116 | implementation is available to the public in source code form. A 117 | "Major Component", in this context, means a major essential component 118 | (kernel, window system, and so on) of the specific operating system 119 | (if any) on which the executable work runs, or a compiler used to 120 | produce the work, or an object code interpreter used to run it. 121 | 122 | The "Corresponding Source" for a work in object code form means all 123 | the source code needed to generate, install, and (for an executable 124 | work) run the object code and to modify the work, including scripts to 125 | control those activities. However, it does not include the work's 126 | System Libraries, or general-purpose tools or generally available free 127 | programs which are used unmodified in performing those activities but 128 | which are not part of the work. For example, Corresponding Source 129 | includes interface definition files associated with source files for 130 | the work, and the source code for shared libraries and dynamically 131 | linked subprograms that the work is specifically designed to require, 132 | such as by intimate data communication or control flow between those 133 | subprograms and other parts of the work. 134 | 135 | The Corresponding Source need not include anything that users 136 | can regenerate automatically from other parts of the Corresponding 137 | Source. 138 | 139 | The Corresponding Source for a work in source code form is that 140 | same work. 141 | 142 | 2. Basic Permissions. 143 | 144 | All rights granted under this License are granted for the term of 145 | copyright on the Program, and are irrevocable provided the stated 146 | conditions are met. This License explicitly affirms your unlimited 147 | permission to run the unmodified Program. The output from running a 148 | covered work is covered by this License only if the output, given its 149 | content, constitutes a covered work. This License acknowledges your 150 | rights of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not 153 | convey, without conditions so long as your license otherwise remains 154 | in force. You may convey covered works to others for the sole purpose 155 | of having them make modifications exclusively for you, or provide you 156 | with facilities for running those works, provided that you comply with 157 | the terms of this License in conveying all material for which you do 158 | not control copyright. Those thus making or running the covered works 159 | for you must do so exclusively on your behalf, under your direction 160 | and control, on terms that prohibit them from making any copies of 161 | your copyrighted material outside their relationship with you. 162 | 163 | Conveying under any other circumstances is permitted solely under 164 | the conditions stated below. Sublicensing is not allowed; section 10 165 | makes it unnecessary. 166 | 167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 168 | 169 | No covered work shall be deemed part of an effective technological 170 | measure under any applicable law fulfilling obligations under article 171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 172 | similar laws prohibiting or restricting circumvention of such 173 | measures. 174 | 175 | When you convey a covered work, you waive any legal power to forbid 176 | circumvention of technological measures to the extent such circumvention 177 | is effected by exercising rights under this License with respect to 178 | the covered work, and you disclaim any intention to limit operation or 179 | modification of the work as a means of enforcing, against the work's 180 | users, your or third parties' legal rights to forbid circumvention of 181 | technological measures. 182 | 183 | 4. Conveying Verbatim Copies. 184 | 185 | You may convey verbatim copies of the Program's source code as you 186 | receive it, in any medium, provided that you conspicuously and 187 | appropriately publish on each copy an appropriate copyright notice; 188 | keep intact all notices stating that this License and any 189 | non-permissive terms added in accord with section 7 apply to the code; 190 | keep intact all notices of the absence of any warranty; and give all 191 | recipients a copy of this License along with the Program. 192 | 193 | You may charge any price or no price for each copy that you convey, 194 | and you may offer support or warranty protection for a fee. 195 | 196 | 5. Conveying Modified Source Versions. 197 | 198 | You may convey a work based on the Program, or the modifications to 199 | produce it from the Program, in the form of source code under the 200 | terms of section 4, provided that you also meet all of these conditions: 201 | 202 | a) The work must carry prominent notices stating that you modified 203 | it, and giving a relevant date. 204 | 205 | b) The work must carry prominent notices stating that it is 206 | released under this License and any conditions added under section 207 | 7. This requirement modifies the requirement in section 4 to 208 | "keep intact all notices". 209 | 210 | c) You must license the entire work, as a whole, under this 211 | License to anyone who comes into possession of a copy. This 212 | License will therefore apply, along with any applicable section 7 213 | additional terms, to the whole of the work, and all its parts, 214 | regardless of how they are packaged. This License gives no 215 | permission to license the work in any other way, but it does not 216 | invalidate such permission if you have separately received it. 217 | 218 | d) If the work has interactive user interfaces, each must display 219 | Appropriate Legal Notices; however, if the Program has interactive 220 | interfaces that do not display Appropriate Legal Notices, your 221 | work need not make them do so. 222 | 223 | A compilation of a covered work with other separate and independent 224 | works, which are not by their nature extensions of the covered work, 225 | and which are not combined with it such as to form a larger program, 226 | in or on a volume of a storage or distribution medium, is called an 227 | "aggregate" if the compilation and its resulting copyright are not 228 | used to limit the access or legal rights of the compilation's users 229 | beyond what the individual works permit. Inclusion of a covered work 230 | in an aggregate does not cause this License to apply to the other 231 | parts of the aggregate. 232 | 233 | 6. Conveying Non-Source Forms. 234 | 235 | You may convey a covered work in object code form under the terms 236 | of sections 4 and 5, provided that you also convey the 237 | machine-readable Corresponding Source under the terms of this License, 238 | in one of these ways: 239 | 240 | a) Convey the object code in, or embodied in, a physical product 241 | (including a physical distribution medium), accompanied by the 242 | Corresponding Source fixed on a durable physical medium 243 | customarily used for software interchange. 244 | 245 | b) Convey the object code in, or embodied in, a physical product 246 | (including a physical distribution medium), accompanied by a 247 | written offer, valid for at least three years and valid for as 248 | long as you offer spare parts or customer support for that product 249 | model, to give anyone who possesses the object code either (1) a 250 | copy of the Corresponding Source for all the software in the 251 | product that is covered by this License, on a durable physical 252 | medium customarily used for software interchange, for a price no 253 | more than your reasonable cost of physically performing this 254 | conveying of source, or (2) access to copy the 255 | Corresponding Source from a network server at no charge. 256 | 257 | c) Convey individual copies of the object code with a copy of the 258 | written offer to provide the Corresponding Source. This 259 | alternative is allowed only occasionally and noncommercially, and 260 | only if you received the object code with such an offer, in accord 261 | with subsection 6b. 262 | 263 | d) Convey the object code by offering access from a designated 264 | place (gratis or for a charge), and offer equivalent access to the 265 | Corresponding Source in the same way through the same place at no 266 | further charge. You need not require recipients to copy the 267 | Corresponding Source along with the object code. If the place to 268 | copy the object code is a network server, the Corresponding Source 269 | may be on a different server (operated by you or a third party) 270 | that supports equivalent copying facilities, provided you maintain 271 | clear directions next to the object code saying where to find the 272 | Corresponding Source. Regardless of what server hosts the 273 | Corresponding Source, you remain obligated to ensure that it is 274 | available for as long as needed to satisfy these requirements. 275 | 276 | e) Convey the object code using peer-to-peer transmission, provided 277 | you inform other peers where the object code and Corresponding 278 | Source of the work are being offered to the general public at no 279 | charge under subsection 6d. 280 | 281 | A separable portion of the object code, whose source code is excluded 282 | from the Corresponding Source as a System Library, need not be 283 | included in conveying the object code work. 284 | 285 | A "User Product" is either (1) a "consumer product", which means any 286 | tangible personal property which is normally used for personal, family, 287 | or household purposes, or (2) anything designed or sold for incorporation 288 | into a dwelling. In determining whether a product is a consumer product, 289 | doubtful cases shall be resolved in favor of coverage. For a particular 290 | product received by a particular user, "normally used" refers to a 291 | typical or common use of that class of product, regardless of the status 292 | of the particular user or of the way in which the particular user 293 | actually uses, or expects or is expected to use, the product. A product 294 | is a consumer product regardless of whether the product has substantial 295 | commercial, industrial or non-consumer uses, unless such uses represent 296 | the only significant mode of use of the product. 297 | 298 | "Installation Information" for a User Product means any methods, 299 | procedures, authorization keys, or other information required to install 300 | and execute modified versions of a covered work in that User Product from 301 | a modified version of its Corresponding Source. The information must 302 | suffice to ensure that the continued functioning of the modified object 303 | code is in no case prevented or interfered with solely because 304 | modification has been made. 305 | 306 | If you convey an object code work under this section in, or with, or 307 | specifically for use in, a User Product, and the conveying occurs as 308 | part of a transaction in which the right of possession and use of the 309 | User Product is transferred to the recipient in perpetuity or for a 310 | fixed term (regardless of how the transaction is characterized), the 311 | Corresponding Source conveyed under this section must be accompanied 312 | by the Installation Information. But this requirement does not apply 313 | if neither you nor any third party retains the ability to install 314 | modified object code on the User Product (for example, the work has 315 | been installed in ROM). 316 | 317 | The requirement to provide Installation Information does not include a 318 | requirement to continue to provide support service, warranty, or updates 319 | for a work that has been modified or installed by the recipient, or for 320 | the User Product in which it has been modified or installed. Access to a 321 | network may be denied when the modification itself materially and 322 | adversely affects the operation of the network or violates the rules and 323 | protocols for communication across the network. 324 | 325 | Corresponding Source conveyed, and Installation Information provided, 326 | in accord with this section must be in a format that is publicly 327 | documented (and with an implementation available to the public in 328 | source code form), and must require no special password or key for 329 | unpacking, reading or copying. 330 | 331 | 7. Additional Terms. 332 | 333 | "Additional permissions" are terms that supplement the terms of this 334 | License by making exceptions from one or more of its conditions. 335 | Additional permissions that are applicable to the entire Program shall 336 | be treated as though they were included in this License, to the extent 337 | that they are valid under applicable law. If additional permissions 338 | apply only to part of the Program, that part may be used separately 339 | under those permissions, but the entire Program remains governed by 340 | this License without regard to the additional permissions. 341 | 342 | When you convey a copy of a covered work, you may at your option 343 | remove any additional permissions from that copy, or from any part of 344 | it. (Additional permissions may be written to require their own 345 | removal in certain cases when you modify the work.) You may place 346 | additional permissions on material, added by you to a covered work, 347 | for which you have or can give appropriate copyright permission. 348 | 349 | Notwithstanding any other provision of this License, for material you 350 | add to a covered work, you may (if authorized by the copyright holders of 351 | that material) supplement the terms of this License with terms: 352 | 353 | a) Disclaiming warranty or limiting liability differently from the 354 | terms of sections 15 and 16 of this License; or 355 | 356 | b) Requiring preservation of specified reasonable legal notices or 357 | author attributions in that material or in the Appropriate Legal 358 | Notices displayed by works containing it; or 359 | 360 | c) Prohibiting misrepresentation of the origin of that material, or 361 | requiring that modified versions of such material be marked in 362 | reasonable ways as different from the original version; or 363 | 364 | d) Limiting the use for publicity purposes of names of licensors or 365 | authors of the material; or 366 | 367 | e) Declining to grant rights under trademark law for use of some 368 | trade names, trademarks, or service marks; or 369 | 370 | f) Requiring indemnification of licensors and authors of that 371 | material by anyone who conveys the material (or modified versions of 372 | it) with contractual assumptions of liability to the recipient, for 373 | any liability that these contractual assumptions directly impose on 374 | those licensors and authors. 375 | 376 | All other non-permissive additional terms are considered "further 377 | restrictions" within the meaning of section 10. If the Program as you 378 | received it, or any part of it, contains a notice stating that it is 379 | governed by this License along with a term that is a further 380 | restriction, you may remove that term. If a license document contains 381 | a further restriction but permits relicensing or conveying under this 382 | License, you may add to a covered work material governed by the terms 383 | of that license document, provided that the further restriction does 384 | not survive such relicensing or conveying. 385 | 386 | If you add terms to a covered work in accord with this section, you 387 | must place, in the relevant source files, a statement of the 388 | additional terms that apply to those files, or a notice indicating 389 | where to find the applicable terms. 390 | 391 | Additional terms, permissive or non-permissive, may be stated in the 392 | form of a separately written license, or stated as exceptions; 393 | the above requirements apply either way. 394 | 395 | 8. Termination. 396 | 397 | You may not propagate or modify a covered work except as expressly 398 | provided under this License. Any attempt otherwise to propagate or 399 | modify it is void, and will automatically terminate your rights under 400 | this License (including any patent licenses granted under the third 401 | paragraph of section 11). 402 | 403 | However, if you cease all violation of this License, then your 404 | license from a particular copyright holder is reinstated (a) 405 | provisionally, unless and until the copyright holder explicitly and 406 | finally terminates your license, and (b) permanently, if the copyright 407 | holder fails to notify you of the violation by some reasonable means 408 | prior to 60 days after the cessation. 409 | 410 | Moreover, your license from a particular copyright holder is 411 | reinstated permanently if the copyright holder notifies you of the 412 | violation by some reasonable means, this is the first time you have 413 | received notice of violation of this License (for any work) from that 414 | copyright holder, and you cure the violation prior to 30 days after 415 | your receipt of the notice. 416 | 417 | Termination of your rights under this section does not terminate the 418 | licenses of parties who have received copies or rights from you under 419 | this License. If your rights have been terminated and not permanently 420 | reinstated, you do not qualify to receive new licenses for the same 421 | material under section 10. 422 | 423 | 9. Acceptance Not Required for Having Copies. 424 | 425 | You are not required to accept this License in order to receive or 426 | run a copy of the Program. Ancillary propagation of a covered work 427 | occurring solely as a consequence of using peer-to-peer transmission 428 | to receive a copy likewise does not require acceptance. However, 429 | nothing other than this License grants you permission to propagate or 430 | modify any covered work. These actions infringe copyright if you do 431 | not accept this License. Therefore, by modifying or propagating a 432 | covered work, you indicate your acceptance of this License to do so. 433 | 434 | 10. Automatic Licensing of Downstream Recipients. 435 | 436 | Each time you convey a covered work, the recipient automatically 437 | receives a license from the original licensors, to run, modify and 438 | propagate that work, subject to this License. You are not responsible 439 | for enforcing compliance by third parties with this License. 440 | 441 | An "entity transaction" is a transaction transferring control of an 442 | organization, or substantially all assets of one, or subdividing an 443 | organization, or merging organizations. If propagation of a covered 444 | work results from an entity transaction, each party to that 445 | transaction who receives a copy of the work also receives whatever 446 | licenses to the work the party's predecessor in interest had or could 447 | give under the previous paragraph, plus a right to possession of the 448 | Corresponding Source of the work from the predecessor in interest, if 449 | the predecessor has it or can get it with reasonable efforts. 450 | 451 | You may not impose any further restrictions on the exercise of the 452 | rights granted or affirmed under this License. For example, you may 453 | not impose a license fee, royalty, or other charge for exercise of 454 | rights granted under this License, and you may not initiate litigation 455 | (including a cross-claim or counterclaim in a lawsuit) alleging that 456 | any patent claim is infringed by making, using, selling, offering for 457 | sale, or importing the Program or any portion of it. 458 | 459 | 11. Patents. 460 | 461 | A "contributor" is a copyright holder who authorizes use under this 462 | License of the Program or a work on which the Program is based. The 463 | work thus licensed is called the contributor's "contributor version". 464 | 465 | A contributor's "essential patent claims" are all patent claims 466 | owned or controlled by the contributor, whether already acquired or 467 | hereafter acquired, that would be infringed by some manner, permitted 468 | by this License, of making, using, or selling its contributor version, 469 | but do not include claims that would be infringed only as a 470 | consequence of further modification of the contributor version. For 471 | purposes of this definition, "control" includes the right to grant 472 | patent sublicenses in a manner consistent with the requirements of 473 | this License. 474 | 475 | Each contributor grants you a non-exclusive, worldwide, royalty-free 476 | patent license under the contributor's essential patent claims, to 477 | make, use, sell, offer for sale, import and otherwise run, modify and 478 | propagate the contents of its contributor version. 479 | 480 | In the following three paragraphs, a "patent license" is any express 481 | agreement or commitment, however denominated, not to enforce a patent 482 | (such as an express permission to practice a patent or covenant not to 483 | sue for patent infringement). To "grant" such a patent license to a 484 | party means to make such an agreement or commitment not to enforce a 485 | patent against the party. 486 | 487 | If you convey a covered work, knowingly relying on a patent license, 488 | and the Corresponding Source of the work is not available for anyone 489 | to copy, free of charge and under the terms of this License, through a 490 | publicly available network server or other readily accessible means, 491 | then you must either (1) cause the Corresponding Source to be so 492 | available, or (2) arrange to deprive yourself of the benefit of the 493 | patent license for this particular work, or (3) arrange, in a manner 494 | consistent with the requirements of this License, to extend the patent 495 | license to downstream recipients. "Knowingly relying" means you have 496 | actual knowledge that, but for the patent license, your conveying the 497 | covered work in a country, or your recipient's use of the covered work 498 | in a country, would infringe one or more identifiable patents in that 499 | country that you have reason to believe are valid. 500 | 501 | If, pursuant to or in connection with a single transaction or 502 | arrangement, you convey, or propagate by procuring conveyance of, a 503 | covered work, and grant a patent license to some of the parties 504 | receiving the covered work authorizing them to use, propagate, modify 505 | or convey a specific copy of the covered work, then the patent license 506 | you grant is automatically extended to all recipients of the covered 507 | work and works based on it. 508 | 509 | A patent license is "discriminatory" if it does not include within 510 | the scope of its coverage, prohibits the exercise of, or is 511 | conditioned on the non-exercise of one or more of the rights that are 512 | specifically granted under this License. You may not convey a covered 513 | work if you are a party to an arrangement with a third party that is 514 | in the business of distributing software, under which you make payment 515 | to the third party based on the extent of your activity of conveying 516 | the work, and under which the third party grants, to any of the 517 | parties who would receive the covered work from you, a discriminatory 518 | patent license (a) in connection with copies of the covered work 519 | conveyed by you (or copies made from those copies), or (b) primarily 520 | for and in connection with specific products or compilations that 521 | contain the covered work, unless you entered into that arrangement, 522 | or that patent license was granted, prior to 28 March 2007. 523 | 524 | Nothing in this License shall be construed as excluding or limiting 525 | any implied license or other defenses to infringement that may 526 | otherwise be available to you under applicable patent law. 527 | 528 | 12. No Surrender of Others' Freedom. 529 | 530 | If conditions are imposed on you (whether by court order, agreement or 531 | otherwise) that contradict the conditions of this License, they do not 532 | excuse you from the conditions of this License. If you cannot convey a 533 | covered work so as to satisfy simultaneously your obligations under this 534 | License and any other pertinent obligations, then as a consequence you may 535 | not convey it at all. For example, if you agree to terms that obligate you 536 | to collect a royalty for further conveying from those to whom you convey 537 | the Program, the only way you could satisfy both those terms and this 538 | License would be to refrain entirely from conveying the Program. 539 | 540 | 13. Remote Network Interaction; Use with the GNU General Public License. 541 | 542 | Notwithstanding any other provision of this License, if you modify the 543 | Program, your modified version must prominently offer all users 544 | interacting with it remotely through a computer network (if your version 545 | supports such interaction) an opportunity to receive the Corresponding 546 | Source of your version by providing access to the Corresponding Source 547 | from a network server at no charge, through some standard or customary 548 | means of facilitating copying of software. This Corresponding Source 549 | shall include the Corresponding Source for any work covered by version 3 550 | of the GNU General Public License that is incorporated pursuant to the 551 | following paragraph. 552 | 553 | Notwithstanding any other provision of this License, you have 554 | permission to link or combine any covered work with a work licensed 555 | under version 3 of the GNU General Public License into a single 556 | combined work, and to convey the resulting work. The terms of this 557 | License will continue to apply to the part which is the covered work, 558 | but the work with which it is combined will remain governed by version 559 | 3 of the GNU General Public License. 560 | 561 | 14. Revised Versions of this License. 562 | 563 | The Free Software Foundation may publish revised and/or new versions of 564 | the GNU Affero General Public License from time to time. Such new versions 565 | will be similar in spirit to the present version, but may differ in detail to 566 | address new problems or concerns. 567 | 568 | Each version is given a distinguishing version number. If the 569 | Program specifies that a certain numbered version of the GNU Affero General 570 | Public License "or any later version" applies to it, you have the 571 | option of following the terms and conditions either of that numbered 572 | version or of any later version published by the Free Software 573 | Foundation. If the Program does not specify a version number of the 574 | GNU Affero General Public License, you may choose any version ever published 575 | by the Free Software Foundation. 576 | 577 | If the Program specifies that a proxy can decide which future 578 | versions of the GNU Affero General Public License can be used, that proxy's 579 | public statement of acceptance of a version permanently authorizes you 580 | to choose that version for the Program. 581 | 582 | Later license versions may give you additional or different 583 | permissions. However, no additional obligations are imposed on any 584 | author or copyright holder as a result of your choosing to follow a 585 | later version. 586 | 587 | 15. Disclaimer of Warranty. 588 | 589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 597 | 598 | 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 608 | SUCH DAMAGES. 609 | 610 | 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these terms. 626 | 627 | To do so, attach the following notices to the program. It is safest 628 | to attach them to the start of each source file to most effectively 629 | state the exclusion of warranty; and each file should have at least 630 | the "copyright" line and a pointer to where the full notice is found. 631 | 632 | 633 | Copyright (C) 634 | 635 | This program is free software: you can redistribute it and/or modify 636 | it under the terms of the GNU Affero General Public License as published 637 | by the Free Software Foundation, either version 3 of the License, or 638 | (at your option) any later version. 639 | 640 | This program is distributed in the hope that it will be useful, 641 | but WITHOUT ANY WARRANTY; without even the implied warranty of 642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 643 | GNU Affero General Public License for more details. 644 | 645 | You should have received a copy of the GNU Affero General Public License 646 | along with this program. If not, see . 647 | 648 | Also add information on how to contact you by electronic and paper mail. 649 | 650 | If your software can interact with users remotely through a computer 651 | network, you should also make sure that it provides a way for users to 652 | get its source. For example, if your program is a web application, its 653 | interface could display a "Source" link that leads users to an archive 654 | of the code. There are many ways you could offer source, and different 655 | solutions will be better for different programs; see section 13 for the 656 | specific requirements. 657 | 658 | You should also get your employer (if you work as a programmer) or school, 659 | if any, to sign a "copyright disclaimer" for the program, if necessary. 660 | For more information on this, and how to apply and follow the GNU AGPL, see 661 | . 662 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | > # *C++! THIS IS THE LAST OF MY PARENTHESES! TAKE IT FROM MEEEEEEE!* 2 | 3 | # LICPP 4 | 5 | [![AGPLv3 license](https://img.shields.io/badge/License-AGPLv3-blue.svg)](http://perso.crans.org/besson/LICENSE.html) 6 | [![Open Source Love svg2](https://badges.frapsoft.com/os/v2/open-source.svg?v=103)](https://github.com/ellerbrock/open-source-badges/) 7 | 8 | [![Made with Secret Alien Technology](https://img.shields.io/badge/Made%20with-Secret%20Alien%20Technology-green.svg?longCache=true&style=for-the-badge&colorB=82ce82)](https://common-lisp.net/) 9 | 10 | [![Knights of the Lambda Calculus](https://img.shields.io/badge/Knights%20of-the%20lambda%20Calculus-brightgreen.svg?longCache=true&style=for-the-badge)](http://catb.org/jargon/html/K/Knights-of-the-Lambda-Calculus.html) 11 | 12 | 13 | A Lisp Flavoured C++ 14 | 15 | An Visual Studio specified version is in the branch `ms`, licensed under MIT. 16 | 17 | ## About 18 | A tiny library that implements some basic Lisp (mainly Common Lisp) utilities as a DSL, currently just a toy, beware of dirty hacks and low performance. 19 | 20 | This has been tested with Clang 9.0, GCC 7.1, and Visual Studio Community 2017. 21 | 22 | ## Usage 23 | At least C++ 14 is required. 24 | 25 | You may expect everything to work similarly to what you know in Common Lisp (although there will be limitation because of the differences between C++ and Lisp). 26 | 27 | For the details of symbols defined in LICPP, check out [SYMBOLS.md](SYMBOLS.md). 28 | 29 | If you want some extra features, please use the latest version of GCC with the flags mentioned below: 30 | 31 | - Type Constraints, enable with flag `-fconcepts` (GCC only) 32 | 33 | ## Note 34 | `tlist` stands for the type `List` which does not have an equivalance in Common Lisp, you may think this is `(type t) => [t]` in Haskell. 35 | 36 | ## Contributing 37 | All functions should be (preferably) implemented in the same way as its corresponding definition in [CLHS](http://www.lispworks.com/documentation/lw70/CLHS/Front/X_AllSym.htm). 38 | 39 | ## License 40 | AGPLv3+ 41 | -------------------------------------------------------------------------------- /SYMBOLS.md: -------------------------------------------------------------------------------- 1 | # Symbols Defined in LICPP 2 | 3 | - `cons: T -> U -> Cons` 4 | 5 | - `list: T -> Cons` 6 | 7 | - `list: T -> ...Us -> cons(T, list(Us...))` 8 | 9 | - `tlist: [T] -> List` 10 | 11 | - `car: Cons -> T` 12 | 13 | - `cdr: Cons -> U` 14 | 15 | - Shortcuts: 16 | 17 | - `caar` 18 | 19 | - `cadr` 20 | 21 | - `cdar` 22 | 23 | - `caaar` 24 | 25 | - `caadr` 26 | 27 | - `cadar` 28 | 29 | - `cdaar` 30 | 31 | - `caddr` 32 | 33 | - `cdadr` 34 | 35 | - `cddar` 36 | 37 | - `caaaar` 38 | 39 | - `caaadr` 40 | 41 | - `caadar` 42 | 43 | - `cadaar` 44 | 45 | - `cdaaar` 46 | 47 | - `caaddr` 48 | 49 | - `cadadr` 50 | 51 | - `cdaadr` 52 | 53 | - `caddar` 54 | 55 | - `cdadar` 56 | 57 | - `cddaar` 58 | 59 | - `cadddr` 60 | 61 | - `cdaddr` 62 | 63 | - `cddadr` 64 | 65 | - `cdddar` 66 | 67 | - `cddddr` 68 | 69 | - `consp: (type a) => a -> bool` 70 | 71 | - `listp: (type a) => a -> bool` 72 | 73 | - `nullp: (type a) => a -> bool` 74 | 75 | - `operator<<: std::ostream& -> nil_t -> std::ostream&` 76 | 77 | - `operator<<: std::ostream& -> Cons -> std::ostream&` 78 | 79 | - `to_string: Cons -> string` 80 | 81 | - `equals: (type a) => a -> a -> bool` 82 | 83 | - `equals: Cons -> Cons -> bool` 84 | 85 | - `append: Cons -> Cons -> _append_t, Cons>` (See the definition in `list_utils.hpp` for detail) 86 | 87 | - `reverse: Cons -> _reverse_t>` (See the definition in `list_utils.hpp` for detail) 88 | 89 | - `mapcar: (type a, type b) => (a -> b) -> Cons -> _mapcar_t, (a -> b)>` (See the definition in `list_utils.hpp` for detail) 90 | 91 | # Types Defined in LICPP 92 | 93 | `Cons` 94 | 95 | `List` 96 | 97 | `nil_t := Cons` 98 | 99 | `_list_t<...T>` A short hand for `Cons>` 100 | 101 | `_consp::value : bool` 102 | 103 | `_listp::value : bool` 104 | 105 | `_nullp::value : bool` 106 | 107 | `_append_t` (See the definition in `list_utils.hpp` for detail) 108 | 109 | `_reverse_t` (See the definition in `list_utils.hpp` for detail) 110 | 111 | `_mapcar_t` (See the definition in `list_utils.hpp` for detail) 112 | -------------------------------------------------------------------------------- /includes/base_hacks.hpp: -------------------------------------------------------------------------------- 1 | /* 2 | * This file is a part of the LICPP project, 3 | * licensed under AGPL, version 3 or above. 4 | * Please read LICENSE and README.MKD for more information. 5 | */ 6 | 7 | #ifndef __BASE_HACKS_HPP__ 8 | #define __BASE_HACKS_HPP__ 9 | 10 | #include 11 | #include 12 | #include 13 | #include "core.hpp" 14 | 15 | namespace licpp { 16 | template 17 | struct _lambda_type { 18 | static const bool constp = cp; 19 | enum { arity = sizeof...(As) }; 20 | using return_type = R; 21 | using arg_type = typename _list_t::type; 22 | }; 23 | template 24 | struct lambda_type : lambda_type {}; 25 | template 26 | struct lambda_type : _lambda_type {}; 27 | template 28 | struct lambda_type : _lambda_type {}; 29 | }; 30 | 31 | #endif 32 | -------------------------------------------------------------------------------- /includes/core.hpp: -------------------------------------------------------------------------------- 1 | /* 2 | * This file is a part of the LICPP project, 3 | * licensed under AGPL, version 3 or above. 4 | * Please read LICENSE and README.MKD for more information. 5 | */ 6 | 7 | //#pragma once 8 | #ifdef _MSC_VER 9 | #if _MSC_VER < 1900 10 | #error At least Visual Studio 2015 is required 11 | #endif 12 | #else 13 | #if __cplusplus <= 201103L 14 | #error At least C++ 14 is required 15 | #endif 16 | #endif // _MSC_VER 17 | 18 | #ifdef __GNUG__ 19 | #ifndef __clang__ 20 | #define __USING_GCC__ 21 | #if __cpp_concepts > 201507 22 | #define __HAS_CONCEPTS__ 23 | #endif 24 | #endif 25 | #endif 26 | 27 | 28 | #ifndef __LICPP_CORE_HPP__ 29 | #define __LICPP_CORE_HPP__ 30 | 31 | #include 32 | #include 33 | #include 34 | #include 35 | #include 36 | #include 37 | 38 | using std::nullptr_t; 39 | 40 | namespace licpp { 41 | #define caar(X) car(car(X)) 42 | #define cadr(X) car(cdr(X)) 43 | #define cdar(X) cdr(car(X)) 44 | #define caaar(X) car(car(car(X))) 45 | #define caadr(X) car(car(cdr(X))) 46 | #define cadar(X) car(cdr(car(X))) 47 | #define cdaar(X) cdr(car(car(X))) 48 | #define caddr(X) car(cdr(cdr(X))) 49 | #define cdadr(X) cdr(car(cdr(X))) 50 | #define cddar(X) cdr(cdr(car(X))) 51 | #define caaaar(X) car(car(car(car(X)))) 52 | #define caaadr(X) car(car(car(cdr(X)))) 53 | #define caadar(X) car(car(cdr(car(X)))) 54 | #define cadaar(X) car(cdr(car(car(X)))) 55 | #define cdaaar(X) cdr(car(car(car(X)))) 56 | #define caaddr(X) car(car(cdr(cdr(X)))) 57 | #define cadadr(X) car(cdr(car(cdr(X)))) 58 | #define cdaadr(X) cdr(car(car(cdr(X)))) 59 | #define caddar(X) car(cdr(cdr(car(X)))) 60 | #define cdadar(X) cdr(car(cdr(car(X)))) 61 | #define cddaar(X) cdr(cdr(car(car(X)))) 62 | #define cadddr(X) car(cdr(cdr(cdr(X)))) 63 | #define cdaddr(X) cdr(car(cdr(cdr(X)))) 64 | #define cddadr(X) cdr(cdr(car(cdr(X)))) 65 | #define cdddar(X) cdr(cdr(cdr(car(X)))) 66 | #define cddddr(X) cdr(cdr(cdr(cdr(X)))) 67 | 68 | #define var auto 69 | // A 2-Element Pair Structure That Holds Arbitary Types 70 | template class Cons; 71 | using nil_t = Cons *; 72 | static const nil_t nil = nullptr; 73 | template 74 | class Cons { 75 | private: 76 | T _car; 77 | U _cdr; 78 | 79 | public: 80 | Cons(T car) :_car(car), _cdr(nil) {} 81 | Cons(T car, U cdr) :_car(car), _cdr(cdr) {} 82 | 83 | T car() const { 84 | return _car; 85 | } 86 | U cdr() const { 87 | return _cdr; 88 | } 89 | Cons * set_car(T car) { 90 | _car = car; 91 | return this; 92 | } 93 | Cons * set_cdr(U cdr) { 94 | _cdr = cdr; 95 | return this; 96 | } 97 | }; 98 | 99 | template 100 | inline auto cons(T car, U cdr) { 101 | return new Cons(car, cdr); 102 | } 103 | 104 | template 105 | inline auto list(T car) { 106 | return cons(car, nil); 107 | } 108 | template 109 | inline auto list(T car, U cadr) { 110 | return cons(car, cons(cadr, nil)); 111 | } 112 | template 113 | inline auto list(T car, Us... rest) { 114 | auto tmp = list(rest...); 115 | return cons(car, tmp); 116 | } 117 | 118 | template 119 | inline T car(Cons * c) { 120 | return c->car(); 121 | } 122 | 123 | template 124 | inline U cdr(Cons * c) { 125 | return c->cdr(); 126 | } 127 | 128 | template 129 | struct _consp : std::false_type {}; 130 | template 131 | struct _consp * > : std::true_type {}; 132 | template 133 | inline bool consp(T) { 134 | return _consp::value; 135 | } 136 | template constexpr bool consp_v = _consp::value; 137 | 138 | template 139 | struct _list_t{ 140 | using type = nullptr_t; 141 | }; 142 | template <> 143 | struct _list_t{ 144 | using type = nil_t; 145 | }; 146 | template 147 | struct _list_t{ 148 | using type = Cons * ; 149 | }; 150 | template 151 | struct _list_t{ 152 | using type = Cons::type> * ; 153 | }; 154 | 155 | template 156 | struct _car_t{}; 157 | template <> 158 | struct _car_t{ 159 | using type = nil_t; 160 | }; 161 | template 162 | struct _car_t * >{ 163 | using type = T; 164 | }; 165 | template 166 | struct _cdr_t{}; 167 | template <> 168 | struct _cdr_t{ 169 | using type = nil_t; 170 | }; 171 | template 172 | struct _cdr_t * >{ 173 | using type = U; 174 | }; 175 | 176 | 177 | template 178 | struct _listp : std::false_type {}; 179 | template <> 180 | struct _listp std::true_type {}; 181 | template 182 | struct _listp *> : _listp { 183 | //static const bool value = _listp::value; 184 | }; 185 | template 186 | inline bool listp(T){ 187 | return _listp::value; 188 | } 189 | template constexpr bool listp_v = _listp::value; 190 | 191 | template 192 | struct _list_len{ 193 | static const int value = 0; 194 | }; 195 | template <> 196 | struct _list_len{ 197 | static const int value = 0; 198 | }; 199 | template 200 | struct _list_len * >{ 201 | static const int value = 1; 202 | }; 203 | template 204 | struct _list_len * >{ 205 | static const int value = 1 + _list_len::value; 206 | }; 207 | #ifdef __HAS_CONCEPTS__ 208 | template 209 | // This requires Concepts TS (Available in GCC >= 6.1 with flag `-fconcepts`) 210 | requires listp_v *> 211 | #else 212 | template *>>> 213 | #endif 214 | inline constexpr int length(Cons * l){ 215 | return _list_len * >::value; 216 | } 217 | 218 | template 219 | struct _nth_t {}; 220 | template 221 | struct _nth_t <0, Cons *> { 222 | using type = T; 223 | }; 224 | template 225 | struct _nth_t *> { 226 | using type = typename _nth_t::type; 227 | }; 228 | template 229 | struct _nth; 230 | template <> 231 | struct _nth<0>{ 232 | template 233 | T operator() (Cons* lst) const { 234 | return car(lst); 235 | } 236 | }; 237 | template 238 | struct _nth{ 239 | template 240 | typename _nth_t*>::type 241 | operator() (Cons* lst) const { 242 | return _nth()(cdr(lst)); 243 | } 244 | }; 245 | #ifdef __HAS_CONCEPTS__ 246 | template 247 | requires ((N < _list_len *>::value) && listp_v *>) 248 | #else 249 | template *>::value) && listp_v *>>> 251 | #endif 252 | auto nth(Cons * lst) -> typename _nth_t * >::type { 253 | return _nth()(lst); 254 | } 255 | 256 | template 257 | struct _nullp : std::false_type {}; 258 | template <> 259 | struct _nullp : std::true_type {}; 260 | template 261 | inline bool nullp(T){ 262 | return _nullp::value; 263 | } 264 | template constexpr bool nullp_v = _nullp::value; 265 | 266 | 267 | inline std::ostream & operator<<(std::ostream& os, Cons *) { 268 | os << "nil"; 269 | return os; 270 | } 271 | template 272 | inline std::ostream & operator<<(std::ostream& os, Cons * c) { 273 | os << "("; 274 | os << car(c); 275 | os << ". nil)"; 276 | return os; 277 | } 278 | template 279 | inline std::ostream & operator<<(std::ostream& os, Cons * c) { 280 | os << "("; 281 | os << car(c); 282 | if(cdr(c)){ 283 | os << " . "; 284 | os << cdr(c); 285 | } 286 | os << ")"; 287 | return os; 288 | } 289 | 290 | template 291 | inline std::string to_string(Cons * c) { 292 | std::stringstream ss; 293 | ss << c; 294 | return ss.str(); 295 | } 296 | 297 | template 298 | inline bool equals(T a, T b) { 299 | return a == b; 300 | } 301 | template 302 | inline bool equals(Cons * lhs, Cons * rhs) { 303 | if (car(lhs) == car(rhs)) { 304 | if (consp(cdr(lhs)) && consp(cdr(rhs))) { 305 | return equals(cdr(lhs), cdr(lhs)); 306 | } 307 | return cdr(lhs) == cdr(rhs); 308 | } 309 | return false; 310 | } 311 | 312 | 313 | // A List Type That Holds Dynamic Number Of Element Of One Type 314 | template 315 | class List { 316 | private: 317 | T _head; 318 | List * _tail; 319 | 320 | public: 321 | T head() const { return _head; } 322 | List * tail() const { return _tail; } 323 | List() : 324 | _head(nullptr), 325 | _tail(nullptr) 326 | {} 327 | 328 | List(T hd) : 329 | _head(hd), 330 | _tail(nullptr) 331 | {} 332 | List(T hd, T tl) : 333 | _head(hd), 334 | _tail(new List(tl)) 335 | {} 336 | List(T hd, List * lst) : 337 | _head(hd), 338 | _tail(lst) 339 | {} 340 | 341 | // A Trick To Use nullptr In The Places Require A Type Of List* 342 | static List * 343 | Nil() { 344 | return nullptr; 345 | } 346 | 347 | // Determine Whether Two Lists are Identical, Order Matters 348 | bool 349 | equals(List & b, std::function pred = [](T a, T b) { return a == b; }) { 350 | if (length(this) != length(b)) { 351 | return false; 352 | } 353 | if (pred(_head, b->head())) { 354 | if (_tail != nullptr) { 355 | return _tail->equals(b->tail(), pred); 356 | } 357 | else { 358 | return true; 359 | } 360 | } 361 | return false; 362 | } 363 | 364 | }; 365 | 366 | // Some Handy Sugars 367 | template 368 | inline T 369 | car(List * lst) { 370 | return lst->head(); 371 | } 372 | 373 | template 374 | inline List * 375 | cdr(List * lst) { 376 | return lst->tail(); 377 | } 378 | 379 | template 380 | inline List * 381 | lcons(T ele, List * lst) { 382 | return new List(ele, lst); 383 | } 384 | 385 | 386 | template 387 | inline List * 388 | tlist(T head) { 389 | return new List(head, nullptr); 390 | } 391 | 392 | template 393 | inline List * 394 | tlist(T head, Ts... rest) { 395 | return lcons(head, list(rest...)); 396 | } 397 | }; 398 | 399 | #endif 400 | -------------------------------------------------------------------------------- /includes/hacks.hpp: -------------------------------------------------------------------------------- 1 | /* 2 | * This file is a part of the LICPP project, 3 | * licensed under AGPL, version 3 or above. 4 | * Please read LICENSE and README.MKD for more information. 5 | */ 6 | 7 | #ifndef __LICPP_HACKS__ 8 | #define __LICPP_HACKS__ 9 | 10 | #include "core.hpp" 11 | #include "base_hacks.hpp" 12 | #include 13 | 14 | namespace licpp{ 15 | // MULTIPLE-VALUE-BIND 16 | template 17 | struct _values_t { 18 | using type = nullptr_t; 19 | }; 20 | template 21 | struct _values_t * >{ 22 | using type = Cons *; 23 | }; 24 | template 25 | struct _values_t * > { 26 | using type = Cons::type> * ; 27 | }; 28 | 29 | template * >::type> 30 | void _mvb(Cons * lst, S sym){ 31 | *(car(sym)) = car(lst); 32 | } 33 | template * >::type> 34 | void _mvb(Cons * lst, S sym){ 35 | *(car(sym)) = car(lst); 36 | _mvb(cdr(lst), cdr(sym)); 37 | } 38 | 39 | template 40 | struct get_return : get_return 41 | {}; 42 | template 43 | struct get_return { 44 | template 45 | Cons * operator()(L fn){ 46 | fn(); 47 | return cons(false, nullptr); 48 | } 49 | }; 50 | template 51 | struct get_return { 52 | template 53 | Cons * operator()(L fn){ 54 | return cons(true, fn()); 55 | } 56 | }; 57 | template 58 | struct get_return { 59 | template 60 | Cons * operator()(L fn){ 61 | fn(); 62 | return cons(false, nullptr); 63 | } 64 | }; 65 | template 66 | struct get_return { 67 | template 68 | Cons * operator()(L fn){ 69 | return cons(true, fn()); 70 | } 71 | }; 72 | 73 | #ifdef __HAS_CONCEPTS__ 74 | template 75 | // This requires Concepts TS (Available in GCC >= 6.1 with flag `-fconcepts`) 76 | requires std::is_same * >::type, 77 | typename _list_t::type>::value && 78 | _listp * >::value 79 | #else 80 | template *>>, typename ... Ss> 81 | #endif 82 | auto multiple_value_bind(Cons * c, Ss ... sym){ 83 | if(!std::is_same * >::type, 84 | typename _list_t::type>::value){ 85 | throw "The type of Pointer-List does not match the type of the given List"; 86 | } 87 | using sym_lst_t = typename _values_t * >::type; 88 | sym_lst_t sym_lst = list(sym...); 89 | auto orig = mapcar([](auto p){ return *p; }, sym_lst); 90 | _mvb(c, sym_lst); 91 | return [orig, sym_lst](auto fn){ 92 | auto retval = get_return()(fn); 93 | _mvb(orig, sym_lst); 94 | if(car(retval)){ 95 | return cdr(retval); 96 | } 97 | typename _cdr_t::type ret = 0; 98 | return ret; 99 | }; 100 | } 101 | 102 | // APPLY 103 | template 104 | auto _apply(F fn, Cons * lst, std::index_sequence){ 105 | return fn(nth(lst)...); 106 | } 107 | #ifdef __HAS_CONCEPTS__ 108 | template 109 | requires std::is_same_v::arg_type, Cons *> 110 | #else 111 | template ::arg_type, Cons *>>> 113 | #endif 114 | auto apply(F fn, Cons * lst) -> typename lambda_type::return_type { 115 | return _apply(fn, lst, std::make_index_sequence::arity>()); 116 | } 117 | }; 118 | 119 | #endif 120 | -------------------------------------------------------------------------------- /includes/list_utils.hpp: -------------------------------------------------------------------------------- 1 | /* 2 | * This file is a part of the LICPP project, 3 | * licensed under AGPL, version 3 or above. 4 | * Please read LICENSE and README.MKD for more information. 5 | */ 6 | 7 | #ifndef __LICPP_LIST_UTILS__ 8 | #define __LICPP_LIST_UTILS__ 9 | 10 | #include "core.hpp" 11 | #include 12 | #include 13 | 14 | namespace licpp{ 15 | // List-of 16 | template 17 | struct _list_of : std::false_type {}; 18 | template 19 | struct _list_of * > : std::true_type {}; 20 | template 21 | struct _list_of *> : _list_of {}; 22 | template 23 | constexpr bool list_of_v = _list_of::value; 24 | // M-List-Of : Multiple-level list-of, e.g.: [[T], [[T]]] gives true 25 | template 26 | struct _m_list_of : std::false_type {}; 27 | template 28 | struct _m_list_of * > : std::true_type {}; 29 | template 30 | struct _m_list_of * > : _m_list_of {}; 31 | template 32 | struct _m_list_of * > : _m_list_of {}; 33 | template 34 | struct _m_list_of * > { 35 | static const bool value = _m_list_of::value && _m_list_of::value; 36 | }; 37 | template 38 | constexpr bool m_list_of_v = _m_list_of::value; 39 | 40 | // APPEND 41 | template 42 | struct _append_t{ 43 | using type = nullptr_t; 44 | }; 45 | template 46 | struct _append_t * >{ 47 | using type = Cons *; 48 | }; 49 | template 50 | struct _append_t *, nil_t>{ 51 | using type = Cons *; 52 | }; 53 | template 54 | struct _append_t * >{ 55 | using type = Cons * > * ; 56 | }; 57 | template 58 | struct _append_t * , Cons * >{ 59 | using type = Cons * > * ; 60 | }; 61 | template 62 | struct _append_t *, Cons * >{ 63 | using type = Cons * >::type> *; 64 | }; 65 | template 66 | inline Cons * _append(nil_t, Cons * b){ 67 | return b; 68 | } 69 | template 70 | inline Cons * _append(Cons * a, nil_t){ 71 | return a; 72 | } 73 | template *, Cons *>::type> 75 | R _append(Cons * a, Cons * b){ 76 | return cons(car(a), _append(cdr(a), b)); 77 | } 78 | #ifdef __HAS_CONCEPTS__ 79 | template 80 | requires (listp_v*> && listp_v*>) 81 | #else 82 | template *> && listp_v*>>> 84 | #endif 85 | auto append(Cons * a, Cons * b){ 86 | return _append(a, b); 87 | } 88 | 89 | // REVERSE 90 | template 91 | struct _reverse_t { 92 | using type = nullptr_t; 93 | }; 94 | template <> 95 | struct _reverse_t { 96 | using type = nil_t; 97 | }; 98 | template 99 | struct _reverse_t *>{ 100 | using type = Cons *; 101 | }; 102 | template 103 | struct _reverse_t * > *>{ 104 | using type = Cons *> *; 105 | }; 106 | template 107 | struct _reverse_t *>{ 108 | using type = typename _append_t::type, Cons * >::type; 109 | }; 110 | inline nil_t _reverse(nil_t){ 111 | return nil; 112 | } 113 | template *>::type> 114 | R _reverse(Cons * lst){ 115 | return append(_reverse(cdr(lst)), list(car(lst))); 116 | } 117 | #ifdef __HAS_CONCEPTS__ 118 | template 119 | requires listp_v*> 120 | #else 121 | template *>>> 123 | #endif 124 | auto reverse(Cons * lst){ 125 | return _reverse(lst); 126 | } 127 | 128 | // MAPCAR 129 | template 130 | struct _mapcar_t {}; 131 | template 132 | struct _mapcar_t{ 133 | using type = nil_t; 134 | }; 135 | template 136 | struct _mapcar_t *>{ 137 | using type = Cons::type, nil_t> *; 138 | }; 139 | template 140 | struct _mapcar_t *>{ 141 | using type = Cons::type, typename _mapcar_t::type> * ; 142 | }; 143 | template 144 | struct _packed_result_t{ 145 | using type = typename std::result_of::type; 146 | }; 147 | template 148 | struct _mapcar_t *, S...>{ 149 | using type = Cons::type ...>::type, 150 | nil_t> * ; 151 | }; 152 | template 153 | struct _mapcar_t *, S...>{ 154 | using type = Cons::type ...>::type, 155 | typename _mapcar_t::type ...>::type> *; 156 | }; 157 | 158 | template 159 | auto _mapcar(F fn, Cons * lst){ 160 | return list(fn(car(lst))); 161 | } 162 | template *, F>::type> 164 | R _mapcar(F fn, Cons * lst){ 165 | return cons(fn(car(lst)), _mapcar(fn, cdr(lst))); 166 | } 167 | template 168 | auto _mapcar(F fn, Cons * lst, S... rest){ 169 | return list(fn(car(lst), car(rest)...)); 170 | } 171 | template 172 | auto _mapcar(F fn, Cons * lst, S... rest){ 173 | return cons(fn(car(lst), car(rest)...), _mapcar(fn, cdr(lst), cdr(rest)...)); 174 | } 175 | #ifdef __HAS_CONCEPTS__ 176 | template 177 | requires listp_v*> 178 | #else 179 | template *>>> 181 | #endif 182 | auto mapcar(F fn, Cons * lst){ 183 | return _mapcar(fn, lst); 184 | } 185 | #ifdef __HAS_CONCEPTS__ 186 | template 187 | requires listp_v*> 188 | #else 189 | template *>>, typename ...S> 191 | #endif 192 | auto mapcar(F fn, Cons * lst, S... rest){ 193 | return _mapcar(fn, lst, rest...); 194 | } 195 | }; 196 | 197 | #endif 198 | -------------------------------------------------------------------------------- /tests.cpp: -------------------------------------------------------------------------------- 1 | #include "includes/core.hpp" 2 | #include "includes/hacks.hpp" 3 | #include "includes/list_utils.hpp" 4 | 5 | #include 6 | #include 7 | 8 | using namespace std; 9 | using namespace licpp; 10 | 11 | int main(int, char**){ 12 | var cons_1 = cons(1, 2); 13 | var cons_2 = cons("foo", "bar"); 14 | var cons_3 = cons(1, "foo"); 15 | cout << "Cons 1: " << cons_1 << endl; 16 | cout << "Cons 2: " << cons_2 << endl; 17 | cout << "Cons 3: " << cons_3 << endl; 18 | 19 | var list_1 = list(1, 2, 3); 20 | var list_2 = cons("foo", list_1); 21 | var list_3 = append(list_1, list_2); 22 | var list_4 = reverse(list_1); 23 | var list_5 = mapcar([](auto n) { return n + 1; }, list_1); 24 | var list_6 = mapcar([](auto n, auto s) { return to_string(n) + s; }, list_1, list("a", "b", "c")); 25 | cout << "List 1: " << list_1 << endl; 26 | cout << "List 2: " << list_2 << endl; 27 | cout << "List 3: " << list_3 << endl; 28 | cout << "List 4: " << list_4 << endl; 29 | cout << "List 5: " << list_5 << endl; 30 | cout << "List 6: " << list_6 << endl; 31 | 32 | int v1, v2, v3; 33 | string v4; 34 | cout << multiple_value_bind(append(list_5, list((string)"foo")), &v1, &v2, &v3, &v4)([=](){ 35 | cout << "v1: " << v1 << " v2: " << v2 << " v3: " << v3 << " v4: " << v4 << endl; 36 | return list(v4, v1, v2, v3); 37 | }) << endl; 38 | 39 | return 0; 40 | } 41 | --------------------------------------------------------------------------------