├── LICENSE.txt ├── README.md ├── main.cpp ├── meson.build └── test.html /LICENSE.txt: -------------------------------------------------------------------------------- 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 by 637 | 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 | # hq 2 | 3 | A HTML processor inspired by jq (https://github.com/stedolan/jq) 4 | 5 | ## Building & Usage 6 | 7 | ### Building 8 | 9 | #### Dependencies 10 | - meson 11 | - modest (https://github.com/lexborisov/Modest) 12 | 13 | #### Build 14 | `meson build && ninja -C build` 15 | 16 | The executable will be built to `build/hq`. 17 | 18 | ### Usage 19 | 20 | #### Dependencies 21 | - modest (https://github.com/lexborisov/Modest) 22 | 23 | #### Use 24 | 25 | Application help text: 26 | ``` 27 | hq (html query) - commandline HTML processor © Mara Robin Broda, 2018 28 | Usage: build/hq [options] [mode argument] 29 | 30 | Options: 31 | -h, --help 32 | show this text 33 | -f, --file 34 | file to read (defaults to stdin) 35 | -d, --delimiter 36 | delimiter character to use between results (defaults to newline) 37 | -0, --null 38 | uses \0 as delimiter 39 | 40 | 41 | CSS selector to match against 42 | 43 | processing mode 44 | may be one of { data, text, attr }: 45 | data - return raw html of matching elements 46 | text - return inner text of matching elements 47 | [mode argument: formatting] 48 | supported modes: { plain, ansi, md } 49 | default: plain 50 | for plain, ANSI, or markdown formatted output respectively 51 | attr - return attribute value of matching elements 52 | 53 | attribute to return 54 | 55 | Examples: 56 | curl -sSL https://example.com | build/hq a data 57 | curl -sSL https://example.com | build/hq a attr href 58 | ``` 59 | 60 | Example usage: 61 | 62 | `curl -s https://coderobe.net | hq a data` 63 | ``` 64 | Keybase (coderobe) 65 | Github (coderobe) 66 | Twitter (coderobe) 67 | ``` 68 | 69 | 70 | `curl -s https://coderobe.net | hq a text` 71 | ``` 72 | Keybase (coderobe) 73 | Github (coderobe) 74 | Twitter (coderobe) 75 | ``` 76 | 77 | `curl -s https://coderobe.net | hq a attr href` 78 | ``` 79 | https://keybase.io/coderobe 80 | https://github.com/coderobe 81 | https://twitter.com/coderobe 82 | ``` 83 | 84 | You get the idea. 85 | 86 | ## License 87 | 88 | This work, written by Mara Robin Broda (coderobe) in 2018, is licensed under the terms of the GNU Affero General Public License v3.0 89 | -------------------------------------------------------------------------------- /main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | 17 | using namespace std; 18 | 19 | static const char* helptext = R"(hq (html query) - commandline HTML processor © Mara Robin Broda, 2018 20 | Usage: %s [options] [mode argument] 21 | 22 | Options: 23 | -h, --help 24 | show this text 25 | -f, --file 26 | file to read (defaults to stdin) 27 | -d, --delimiter 28 | delimiter character to use between results (defaults to newline) 29 | -0, --null 30 | uses \0 as delimiter 31 | -F, --format 32 | specify custom format string for element stringification (can be specified multiple times) 33 | example: `-F a '->{}<-'` - renders text wrapped in '->' and '<-' 34 | 35 | 36 | CSS selector to match against 37 | 38 | processing mode 39 | may be one of { data, text, attr }: 40 | data - return raw html of matching elements 41 | text - return inner text of matching elements 42 | [mode argument: formatting] 43 | supported modes: { plain, ansi, md } 44 | default: plain 45 | for plain, ANSI, or markdown formatted output respectively 46 | attr - return attribute value of matching elements 47 | 48 | attribute to return 49 | 50 | Examples: 51 | curl -sSL https://example.com | %s a data 52 | curl -sSL https://example.com | %s a attr href 53 | )"; 54 | 55 | static const string afmt_s = "\033["; 56 | static const string afmt_e = "m"; 57 | static const vector collapsible = {' ', '\t', '\n', '\r'}; 58 | static const vector breaking = { 59 | MyHTML_TAG_BR, 60 | MyHTML_TAG_P, 61 | MyHTML_TAG_H1, 62 | MyHTML_TAG_H2, 63 | MyHTML_TAG_H3, 64 | MyHTML_TAG_H4, 65 | MyHTML_TAG_H5, 66 | MyHTML_TAG_H6, 67 | MyHTML_TAG_HR, 68 | }; 69 | 70 | static map flags = { 71 | {"dirtyargs", 0} 72 | }; 73 | 74 | static map state = { // global state 75 | {"progname", "hq"}, // program name 76 | {"file", "-"}, // input file path, or - for stdin 77 | {"delim", "\n"}, // result delimiter 78 | {"selector", ""}, // matching selector 79 | {"mode", ""}, // output mode 80 | {"data", ""}, // read input data 81 | {"modearg", ""}, // mode argument (optional) 82 | {"scratch", ""}, // scratchpad value (internal use) 83 | }; 84 | 85 | bool readarg(int &argc, const char** &argv, string argname, const bool die_on_err = true){ 86 | if(argc > 1){ 87 | argv++; 88 | argc--; 89 | state[argname] = *argv; 90 | flags["dirtyargs"]++; 91 | return true; 92 | }else{ 93 | if(die_on_err){ 94 | cerr << "no " << argname << " given" << endl; 95 | exit(EXIT_FAILURE); 96 | } 97 | return false; 98 | } 99 | } 100 | 101 | bool readfile(string filename, string &target){ 102 | shared_ptr input; 103 | if(filename == "-"){ 104 | input.reset(&cin, [](...){}); 105 | }else{ 106 | input.reset(new ifstream(filename.c_str())); 107 | if(!input.get()->good()) return false; 108 | } 109 | target = string(istreambuf_iterator(*input.get()), {}); 110 | return true; 111 | } 112 | 113 | template inline bool vec_has(const vector &vec, T val){ 114 | return std::find(vec.begin(), vec.end(), val) != vec.end(); 115 | } 116 | 117 | template inline bool node_in(myhtml_tree_node_t* node, T... tags){ 118 | while((node = node->parent)) 119 | for(myhtml_tag_id_t tag : {tags...}) 120 | if(node->tag_id == tag) return true; 121 | 122 | return false; 123 | } 124 | 125 | bool node_sort(myhtml_tree_node_t* lhs, myhtml_tree_node_t* rhs){ 126 | return myhtml_node_element_position(lhs).begin < myhtml_node_element_position(rhs).begin; 127 | } 128 | 129 | template inline bool node_before(myhtml_tree_node_t* node, T... tags){ 130 | while((node = node->next) && node->tag_id <= 0x003); 131 | 132 | if(node) 133 | for(myhtml_tag_id_t tag : {tags...}) 134 | if(node->tag_id == tag) return true; 135 | 136 | return false; 137 | } 138 | 139 | template inline bool node_after(myhtml_tree_node_t* node, T... tags){ 140 | while((node = node->prev) && node->tag_id <= 0x003); 141 | 142 | if(node) 143 | for(myhtml_tag_id_t tag : {tags...}) 144 | if(node->tag_id == tag) return true; 145 | 146 | return false; 147 | } 148 | 149 | static map option_longopts = { // maps shortopts to longopts from option_handlers 150 | {'h', "help"}, 151 | {'f', "file"}, 152 | {'d', "delimiter"}, 153 | {'0', "zero"}, 154 | {'F', "format"}, 155 | }; 156 | 157 | vector> selector_format = {}; 158 | 159 | const char* format_node(myhtml_tree_node_t* node){ 160 | for(auto& [fselect, fstr, fcollect] : selector_format) 161 | if(fcollect) 162 | for(myhtml_tree_node_t* select_node : vector(fcollect->list, fcollect->list+fcollect->length)) 163 | if(node == select_node) return fstr.c_str(); 164 | 165 | return "{}"; 166 | } 167 | 168 | static map> option_handlers = { // maps longopts to functions 169 | {"help", [](int &argc, const char** &argv) { 170 | fprintf(stderr, helptext, state["progname"].c_str(), state["progname"].c_str(), state["progname"].c_str()); 171 | exit(EXIT_FAILURE); 172 | }}, 173 | {"file", [](int &argc, const char** &argv) { 174 | readarg(argc, ++argv, "file"); 175 | argv--; 176 | }}, 177 | {"delimiter", [](int &argc, const char** &argv) { 178 | readarg(argc, ++argv, "delim"); 179 | argv--; 180 | }}, 181 | {"zero", [](int &argc, const char** &argv) { 182 | state["delim"] = "\0"; 183 | }}, 184 | {"format", [](int &argc, const char** &argv) { 185 | argv++, argc--; 186 | if(!readarg(argc, argv, "scratch", false)){ 187 | cerr << "missing selector in --format" << endl; 188 | exit(EXIT_FAILURE); 189 | } 190 | string fselect = state["scratch"]; 191 | if(!readarg(argc, argv, "scratch", false)){ 192 | cerr << "missing format string in --format" << endl; 193 | exit(EXIT_FAILURE); 194 | } 195 | string form = state["scratch"]; 196 | 197 | if(fselect.length() == 0){ 198 | cerr << "invalid --format " << fselect << " " << form << endl; 199 | exit(EXIT_FAILURE); 200 | } 201 | 202 | selector_format.push_back(tuple(fselect, form, nullptr)); 203 | 204 | argv--, argc++; 205 | }}, 206 | }; 207 | 208 | static pair, const function> format_handlers = { // {format, unformat} 209 | [](myhtml_tree_node_t* node_iter, string &rendered){ 210 | if(state["modearg"].length() > 0){ 211 | const bool ansi = state["modearg"] == "ansi"; 212 | const bool md = state["modearg"] == "md"; 213 | switch(node_iter->tag_id){ // modearg formatters 214 | case MyHTML_TAG_B: // bold on 215 | case MyHTML_TAG_STRONG: 216 | if(ansi) rendered += afmt_s + "1" + afmt_e; 217 | if(md) rendered += "**"; 218 | break; 219 | case MyHTML_TAG_I: // italics on 220 | case MyHTML_TAG_U: 221 | case MyHTML_TAG_EM: 222 | case MyHTML_TAG_H1: 223 | case MyHTML_TAG_H2: 224 | case MyHTML_TAG_H3: 225 | case MyHTML_TAG_H4: 226 | case MyHTML_TAG_H5: 227 | case MyHTML_TAG_H6: 228 | if(ansi) rendered += afmt_s + "4" + afmt_e; 229 | if(md) rendered += "_"; 230 | break; 231 | case MyHTML_TAG_CODE: // code on 232 | if(node_in(node_iter, MyHTML_TAG_PRE)){ 233 | rendered += "```\n"; 234 | }else{ 235 | if(ansi) rendered += afmt_s + "7" + afmt_e; 236 | if(md) rendered += "`"; 237 | } 238 | break; 239 | } 240 | } 241 | switch(node_iter->tag_id){ // global formatters 242 | case MyHTML_TAG_LI: 243 | rendered += "- "; 244 | break; 245 | } 246 | }, 247 | [](myhtml_tree_node_t* node_iter, string &rendered){ 248 | if(state["modearg"].length() > 0){ 249 | const bool ansi = state["modearg"] == "ansi"; 250 | const bool md = state["modearg"] == "md"; 251 | switch(node_iter->tag_id){ // modearg unformatters 252 | case MyHTML_TAG_B: // bold off 253 | case MyHTML_TAG_STRONG: 254 | if(ansi) rendered += afmt_s + "21" + afmt_e; 255 | if(md) rendered += "**"; 256 | break; 257 | case MyHTML_TAG_I: // italics off 258 | case MyHTML_TAG_U: 259 | case MyHTML_TAG_EM: 260 | case MyHTML_TAG_H1: 261 | case MyHTML_TAG_H2: 262 | case MyHTML_TAG_H3: 263 | case MyHTML_TAG_H4: 264 | case MyHTML_TAG_H5: 265 | case MyHTML_TAG_H6: 266 | if(ansi) rendered += afmt_s + "24" + afmt_e; // no italics here :( 267 | if(md) rendered += "_"; 268 | break; 269 | case MyHTML_TAG_CODE: // code off 270 | if(node_in(node_iter, MyHTML_TAG_PRE)){ 271 | rendered += "```\n"; 272 | }else{ 273 | if(ansi) rendered += afmt_s + "27" + afmt_e; 274 | if(md) rendered += "`"; 275 | } 276 | break; 277 | } 278 | } 279 | switch(node_iter->tag_id){ // global unformatters 280 | case MyHTML_TAG_LI: 281 | case MyHTML_TAG_UL: 282 | rendered += "\n"; 283 | break; 284 | case MyHTML_TAG_TH: 285 | case MyHTML_TAG_TD: 286 | if(node_before(node_iter, MyHTML_TAG_TH, MyHTML_TAG_TD)){ 287 | rendered += "\t"; 288 | } 289 | break; 290 | case MyHTML_TAG_TR: 291 | if(rendered.back() != '\n'){ 292 | rendered += "\n"; 293 | } 294 | break; 295 | } 296 | 297 | if(vec_has(breaking, node_iter->tag_id)){ //
298 | rendered += "\n"; 299 | } 300 | } 301 | }; 302 | 303 | string render_node(myhtml_tree_node_t* node_iter){ 304 | string rendered = ""; 305 | 306 | if(node_iter->tag_id == MyHTML_TAG_STYLE) return rendered; 307 | 308 | format_handlers.first(node_iter, rendered); 309 | 310 | if(node_iter->tag_id == MyHTML_TAG__TEXT){ 311 | string text(myhtml_node_text(node_iter, nullptr)); 312 | if(!node_in(node_iter, MyHTML_TAG_PRE)){ 313 | // collapse whitespace to single character 314 | string::iterator nend = unique(text.begin(), text.end(), [](char c1, char c2) -> bool { 315 | return vec_has(collapsible, c1) && vec_has(collapsible, c2); 316 | }); 317 | text.resize(static_cast(nend-text.begin())); 318 | 319 | // replace whitespace with space 320 | replace_if(text.begin(), text.end(), [](char c) -> bool { 321 | return vec_has(collapsible, c); 322 | }, ' '); 323 | } 324 | 325 | rendered += text; 326 | } 327 | 328 | if(node_iter->child){ 329 | rendered += render_node(node_iter->child); 330 | } 331 | 332 | rendered = fmt::format(format_node(node_iter), rendered); 333 | 334 | format_handlers.second(node_iter, rendered); 335 | 336 | if((node_iter = node_iter->next)){ 337 | rendered += render_node(node_iter); 338 | } 339 | 340 | return rendered; 341 | } 342 | 343 | static map> mode_handlers = { // maps modes to functions 344 | {"data", [](myhtml_tree_node_t* node) { 345 | myhtml_serialization_tree_callback(node, [](const char* data, size_t len, void* ctx) -> unsigned int { 346 | printf("%s", data); 347 | return 0; 348 | }, node); 349 | printf("%c", state["delim"][0]); 350 | }}, 351 | 352 | {"text", [](myhtml_tree_node_t* node) { 353 | string rendered = render_node(node->child); 354 | 355 | size_t index = 0; 356 | while((index = rendered.find("\n ", index)) != string::npos){ // clear whitespace before multiline content 357 | rendered.erase(index+1, 1); 358 | } 359 | index = 0; 360 | while((index = rendered.find(" \n", index)) != string::npos){ // clear whitespace after multiline content 361 | rendered.erase(index, 1); 362 | } 363 | 364 | while(vec_has(collapsible, rendered[0])) rendered.erase(0, 1); // clear whitespace before single-line content 365 | while(vec_has(collapsible, *(rendered.end()-1))) rendered.erase(rendered.length()-1, 1); // clear whitespace after single-line content 366 | 367 | fmt::print(format_node(node), rendered); 368 | //printf(fmt, rendered); 369 | printf("%c", state["delim"][0]); 370 | }}, 371 | 372 | {"attr", [](myhtml_tree_node_t* node) { 373 | if(state["modearg"].length() == 0){ 374 | cerr << "no attr name given" << endl; 375 | exit(EXIT_FAILURE); 376 | } 377 | 378 | myhtml_token_node_t* token = node->token; 379 | if(token == nullptr) return; 380 | 381 | myhtml_token_attr_t* attr = token->attr_first; 382 | if(attr == nullptr) return; 383 | 384 | do{ 385 | if(state["modearg"] == mycore_string_data(&attr->key)){ 386 | const char* attr_value = mycore_string_data(&attr->value); 387 | if(attr_value != nullptr) { 388 | fmt::print(format_node(node), attr_value); 389 | } 390 | printf("%c", state["delim"][0]); 391 | } 392 | }while(attr != token->attr_last && (attr = attr->next)); // move attr pointer further & loop if attr_last not hit 393 | }} 394 | }; 395 | 396 | void parseopts(int &argc, const char** &argv){ 397 | while(argc > 1){ 398 | if(argv[1][0] == '-'){ // is opt 399 | if(argv[1][1] == '-'){ // is long opt 400 | if(argv[1][2] == '\0'){ // stop parsing opts after '--' 401 | break; 402 | }else{ 403 | try{ 404 | option_handlers[argv[1]+2](argc, argv); 405 | }catch(bad_function_call&){ 406 | cerr << "invalid long option '" << argv[1] << "'" << endl; 407 | exit(EXIT_FAILURE); 408 | } 409 | } 410 | }else{ // is short opt 411 | while(*++argv[1] != '\0'){ // iterate through short opts 412 | try{ 413 | option_handlers[option_longopts[argv[1][0]]](argc, argv); 414 | }catch(bad_function_call&){ 415 | cerr << "invalid short option '-" << argv[1][0] << "'" << endl; 416 | exit(EXIT_FAILURE); 417 | } 418 | if(flags["dirtyargs"] > 0){ // option handler touched argv (args?); skip 419 | flags["dirtyargs"]--; 420 | break; 421 | } 422 | } 423 | } 424 | argv++; 425 | argc--; 426 | }else{ 427 | break; 428 | } 429 | } 430 | } 431 | 432 | int main(int argc, const char* argv[]){ 433 | state["progname"] = argv[0]; 434 | 435 | parseopts(argc, argv); 436 | readarg(argc, argv, "selector"); 437 | readarg(argc, argv, "mode"); 438 | readarg(argc, argv, "modearg", false); 439 | if(!readfile(state["file"], state["data"])){ 440 | cerr << "failed reading '" << state["file"] << "'" << endl; 441 | exit(EXIT_FAILURE); 442 | } 443 | 444 | myhtml_t* myhtml = myhtml_create(); 445 | myhtml_tree_t* html_tree = myhtml_tree_create(); 446 | mycss_t* mycss = mycss_create(); 447 | mycss_entry_t* css_entry = mycss_entry_create(); 448 | 449 | vector> modest_setup = { // init functions 450 | bind(myhtml_init, myhtml, MyHTML_OPTIONS_DEFAULT, 1, 0), 451 | bind(myhtml_tree_init, html_tree, myhtml), 452 | bind(myhtml_parse, html_tree, MyENCODING_UTF_8, state["data"].c_str(), state["data"].length()), 453 | bind(mycss_init, mycss), 454 | bind(mycss_entry_init, mycss, css_entry) 455 | }; 456 | 457 | for(function modest_setup_func : modest_setup){ // init and check for errors 458 | if(modest_setup_func()){ 459 | cerr << "failed to init (modest_setup)" << endl; 460 | exit(EXIT_FAILURE); 461 | } 462 | } 463 | 464 | modest_finder_t* finder = modest_finder_create_simple(); 465 | mystatus_t mystatus; 466 | mycss_selectors_list_t* selectors_list = mycss_selectors_parse( 467 | mycss_entry_selectors(css_entry), 468 | MyENCODING_UTF_8, 469 | state["selector"].c_str(), state["selector"].length(), 470 | &mystatus 471 | ); 472 | 473 | if(selectors_list == nullptr || (selectors_list->flags & MyCSS_SELECTORS_FLAGS_SELECTOR_BAD)){ 474 | cerr << "bad selector '" << state["selector"] << "'" << endl; 475 | exit(EXIT_FAILURE); 476 | } 477 | 478 | myhtml_collection_t* collection = nullptr; 479 | modest_finder_by_selectors_list(finder, html_tree->node_html, selectors_list, &collection); 480 | 481 | for(auto& [fselect, fstr, fcollect] : selector_format){ 482 | mycss_selectors_list_t* fselect_parsed = mycss_selectors_parse( 483 | mycss_entry_selectors(css_entry), 484 | MyENCODING_UTF_8, 485 | fselect.c_str(), fselect.length(), 486 | &mystatus 487 | ); 488 | if(fselect_parsed == nullptr || (fselect_parsed->flags & MyCSS_SELECTORS_FLAGS_SELECTOR_BAD)){ 489 | cerr << "bad format selector '" << fselect << "'" << endl; 490 | exit(EXIT_FAILURE); 491 | } 492 | modest_finder_by_selectors_list(finder, html_tree->node_html, fselect_parsed, &fcollect); 493 | } 494 | 495 | if(collection){ 496 | vector nodes(collection->list, collection->list+collection->length); 497 | sort(nodes.begin(), nodes.end(), node_sort); 498 | try{ 499 | for(myhtml_tree_node_t* node : nodes){ 500 | mode_handlers[state["mode"]](node); 501 | } 502 | }catch(bad_function_call&){ 503 | cerr << "invalid mode '" << state["mode"] << "'" << endl; 504 | exit(EXIT_FAILURE); 505 | } 506 | } 507 | 508 | // destroy modest datastructures 509 | myhtml_collection_destroy(collection); 510 | mycss_selectors_list_destroy(mycss_entry_selectors(css_entry), selectors_list, true); 511 | modest_finder_destroy(finder, true); 512 | mycss_destroy(css_entry->mycss, true); 513 | mycss_entry_destroy(css_entry, true); 514 | myhtml_destroy(html_tree->myhtml); 515 | myhtml_tree_destroy(html_tree); 516 | } 517 | -------------------------------------------------------------------------------- /meson.build: -------------------------------------------------------------------------------- 1 | project('hq', 'cpp', default_options: ['cpp_std=c++17']) 2 | modest = dependency('modest') 3 | fmt = dependency('fmt') 4 | executable('hq', 'main.cpp', 5 | dependencies: [modest, fmt] 6 | ) 7 | -------------------------------------------------------------------------------- /test.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 |

6 | This paragraph 7 | contains a lot of lines 8 | in the source code, 9 | but the browser 10 | ignores it. 11 |

12 | 13 |

14 | This paragraph 15 | contains a lot of spaces 16 | in the source code, 17 | but the browser 18 | ignores it. 19 |

20 | 21 |

22 | This paragraph is all in one line and should be rendered the same as the others. 23 |

24 | 25 |

26 | This paragraph contains phrasing content, which is used to mark up text at the intra-paragraph level. 27 |

28 | 29 |

30 | This paragraph contains a line break,
which should split this text into two lines and collapse the leading space of the second line. 31 |

32 | 33 |
34 | This is a link to example.com 35 | 36 | 37 | 38 | 39 | --------------------------------------------------------------------------------