├── LICENSE
├── README.md
├── app
├── api_wiki.php
├── api_wiki_complement.php
├── motAnalyse.php
└── simple_html_dom.php
├── assets
├── app.js
├── fonts
│ └── metropolis
│ │ ├── Metropolis-Bold.otf
│ │ ├── Metropolis-BoldItalic.otf
│ │ ├── Metropolis-Medium.otf
│ │ ├── Metropolis-MediumItalic.otf
│ │ ├── Metropolis-Regular.otf
│ │ ├── Metropolis-RegularItalic.otf
│ │ ├── Metropolis-SemiBold.otf
│ │ └── Metropolis-SemiBoldItalic.otf
├── img
│ ├── CC-BY-SA-logo.png
│ ├── GNU-logo.png
│ ├── dico.png
│ ├── exemple-def.jpg
│ ├── exemple-pluriel.jpg
│ ├── favicon-letters
│ │ ├── android-chrome-192x192.png
│ │ ├── android-chrome-512x512.png
│ │ ├── apple-touch-icon.png
│ │ ├── browserconfig.xml
│ │ ├── favicon-16x16.png
│ │ ├── favicon-32x32.png
│ │ ├── favicon.ico
│ │ ├── mstile-150x150.png
│ │ ├── safari-pinned-tab.svg
│ │ └── site.webmanifest
│ ├── loader-bdd.svg
│ ├── loader.gif
│ └── search_icon.png
└── style.css
└── index.php
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # API Dictionnaire Wiktionnaire
2 |
3 | 
4 |
5 | API qui permet d'obtenir, via le [Wiktionnaire](https://fr.wiktionary.org), la définition des termes passés en input.
6 |
7 |
8 | 
9 |
10 | ## *** Demo ***
11 |
12 | Page de test [ici](https://api-definition.fgainza.fr)
13 |
14 |
15 | ## *** Features ***
16 |
17 | Les éléments extraits sont :
18 |
19 | * l'url de la page web
20 | * l'url de l'image
21 | * la légende de l'image
22 | * l'url du crédit de l'image
23 |
24 | * classe(s) grammaticale(s) du terme recherché
25 | * le genre (pour les noms et pour les adjectifs)
26 | * les définitions associées (sans aucun exemple)
27 |
28 | * message d'erreur si le parsing a échoué
29 |
30 | ```javascript
31 | {
32 | "motWiki": "carpe",
33 | "error": "",
34 | "direct_link": "https://fr.wiktionary.org/wiki/carpe",
35 | "url_img": "https://upload.wikimedia.org/wikipedia/commons/a/a8/Common_carp.jpg",
36 | "legende_img": "",
37 | "url_credits": "https://commons.wikimedia.org/wiki/File:Common_carp.jpg?uselang=fr",
38 | "nature": [
39 | "Nom commun 1",
40 | "Nom commun 2"
41 | ],
42 | "genre": [
43 | [
44 | "Nom commun 1",
45 | "féminin"
46 | ],
47 | [
48 | "Nom commun 2",
49 | "masculin"
50 | ]
51 | ],
52 | "natureDef": [
53 | [
54 | {
55 | "1": "(Zoologie) Poisson d’eau douce, de taille moyenne, originaire d'Asie (Chine surtout), de la famille des cyprinidés (Cyprinidae), comestible. ",
56 | "2": "(Cuisine) Chair cuisinée de ce poisson.",
57 | "3": "(Zoologie) Variante de carpe commune (poisson). "
58 | }
59 | ],
60 | [
61 | {
62 | "1": "(Anatomie) Nom générique des huit petits os du poignet. "
63 | }
64 | ]
65 | ]
66 | }
67 | ```
68 |
69 |
70 | ## *** Suppléments ***
71 |
72 | 2 cas particuliers pour lesquels des liens internes ont été ajoutés :
73 |
74 | * les mots pluriels (lien vers la définition du mot au singulier)
75 | * les verbes conjugués (lien vers la définition du verbe à l'infinitif)
76 |
77 | Cela permet d'éviter d'avoir pour seule définition "Pluriel de ..." ou "3eme personne du singulier du verbe ..."
78 |
79 |
80 | 
81 |
82 |
83 |
84 | ## *** Langages et bibliothèques utilisés ***
85 |
86 | * Bootstrap
87 | * PHP avec bibliothèque "simple_html_dom"
88 | * Ajax JQuery
89 |
90 |
91 | ## *** Auteur ***
92 |
93 | * **Frédéric Gainza** _alias_ [@FredGainza](https://github.com/FredGainza)
94 |
95 |
96 | ## *** License ***
97 |
98 | Licence ``GNU General Public License v3.0`` - voir [LICENSE](LICENSE) pour plus d'informations
99 |
--------------------------------------------------------------------------------
/app/api_wiki.php:
--------------------------------------------------------------------------------
1 | ';
21 | print_r($x);
22 | echo '';
23 | }
24 |
25 | // Fonction de validation des données
26 | function valid_donnees($donnees) {
27 | $donnees = trim($donnees);
28 | $donnees = stripslashes($donnees);
29 | $donnees = htmlspecialchars($donnees);
30 | return $donnees;
31 | }
32 |
33 | // Fonction pour enlever certains tags (ne pas enlever )
34 | function enleveTagsPerso($chaine) {
35 | $search = array('', '', '', '
', '', '', '', '
');
36 | $replace = array('', '', '', '', '', '', '', '');
37 |
38 | $chaine = str_replace($search, $replace, $chaine);
39 | return $chaine;
40 | }
41 |
42 | // Fonction qui vérifie l'existence d'une page web
43 | function IFilesExists($url) {
44 | $headers = @get_headers($url, 1);
45 | if ($headers[0] == '') return false;
46 | return !((preg_match('/404/', $headers[0])) == 1);
47 | }
48 |
49 | // Nettoyer les données passées en POST
50 | $motWikiTemp = $_POST['motWiki'];
51 | $motWiki = valid_donnees($motWikiTemp);
52 |
53 |
54 | /* ############################################################################################# */
55 | // Définir et Initialiser les variables
56 | $url = ''; // url Wikitionary du mot recherché
57 | $error= ''; // msg erreur renvoyé à l'utilisateur
58 | $naturesGram = []; // tab des classes grammaticales du mot recherché
59 | $url_img = ''; // url de l'illustration si présente sur Wikitionnaire
60 | $url_credits = ''; // url de credit de la photo
61 | $legende_img = ''; // légende de l'image
62 | $resfinal = []; // tableau final des résultats
63 | $nbNaturesGram = 0; // Nb de natures grammaticales
64 | $resFin = []; // tableau de résultat temp (résultat pour une classe grammaticale)
65 | $genre = []; // tableau de genre pour la classe "nom commun"
66 | /* ############################################################################################### */
67 |
68 | // Messsage si pas de page Wikitionnaire
69 | if (IFilesExists("https://fr.wiktionary.org/wiki/".$motWiki)){
70 | $url = "https://fr.wiktionary.org/wiki/".$motWiki;
71 |
72 | // ############################################################
73 | // DEBUT DU PARSING
74 | // ############################################################
75 |
76 | // Parser l'ensemble de la page
77 | $html = new simple_html_dom();
78 | $html->load_file($url);
79 |
80 | // Cherche les span spécifiques aux classes grammaticales
81 | $nbNaturesGram=count($html->find('h3 span.titredef[id^=fr-]'));
82 |
83 | // Si il y a une ou des classes grammaticales
84 | if($nbNaturesGram != 0){
85 | // On récupère le texte des classes grammaticales
86 | foreach($html->find('h3 span.titredef[id^=fr-]') as $v){
87 | $naturesGram[] = $v->plaintext;
88 | }
89 |
90 | // On récupère le genre pour la classe de "nom commun"
91 | $z=0;
92 | foreach($naturesGram as $i => $class){
93 | if ((strpos($class, "commun") !== FALSE) && (strpos($class, "Forme") === FALSE)){
94 | $x = $html->find('p span.ligne-de-forme', $z)->plaintext;
95 | $genre[]=[$class, $x];
96 | $z++;
97 | }else{
98 | $genre[]=$class;
99 | }
100 | }
101 |
102 | // s'il y a une image
103 | if (null != $html->find('figure[typeof="mw:File/Thumb"]', 0)) {
104 | // On récupère l'url du creditial
105 | if (null != $html->find('figure[typeof="mw:File/Thumb"]', 0)->find('a.mw-file-description', 0)) {
106 | $href = $html->find('figure[typeof="mw:File/Thumb"]', 0)->find('a.mw-file-description', 0)->getAttribute('href');
107 | if ($href) {
108 | $imageTab = mb_str_split($href);
109 | $imageSousTab = array_slice($imageTab, 5);
110 | $imageSousStrTemp = join($imageSousTab);
111 | $imageSousStr = str_replace('Fichier', 'File', $imageSousStrTemp);
112 | $url_credits = "https://commons.wikimedia.org/wiki" . $imageSousStr . "?uselang=fr";
113 | }
114 | }
115 |
116 | // On récupère l'url de l'image
117 | if (null != $html->find('figure[typeof="mw:File/Thumb"]', 0)->find('img.mw-file-element', 0)) {
118 | $img = $html->find('figure[typeof="mw:File/Thumb"]', 0)->find('img.mw-file-element', 0);
119 | if ($img->getAttribute('srcset')) {
120 | $imageSrc = $img->getAttribute('srcset');
121 | // On prend la version 2x de l'image (plus haute qualité)
122 | $srcsetParts = explode(', ', $imageSrc);
123 | foreach ($srcsetParts as $part) {
124 | if (strpos($part, '2x') !== false) {
125 | $url_temp = explode(' ', $part)[0];
126 | $url_img = "https:" . $url_temp;
127 | break;
128 | }
129 | }
130 | } else {
131 | // Fallback sur src si srcset n'existe pas
132 | $url_img = "https:" . $img->getAttribute('src');
133 | }
134 | }
135 |
136 | // On récupère la légende en français directement depuis le Wiktionnaire
137 | $legende_img = '';
138 | if (null != $html->find('figure[typeof="mw:File/Thumb"]', 0)->find('figcaption', 0)) {
139 | $legende = $html->find('figure[typeof="mw:File/Thumb"]', 0)->find('figcaption', 0)->plaintext;
140 | $legende_img = strip_tags($legende);
141 |
142 | // Enlever tous les (i) où i est un chiffre, peu importe leur position
143 | $legende_img = preg_replace('/\s*\([0-9]+\)/', '', $legende_img);
144 |
145 | // Nettoyer les espaces multiples qui pourraient rester
146 | $legende_img = preg_replace('/\s+/', ' ', trim($legende_img));
147 | }
148 |
149 | // On récupère les informations de crédit
150 | $credits_img = '';
151 | if (isset($url_credits)) {
152 | $html2 = new simple_html_dom();
153 | $html2->load_file($url_credits);
154 | $test = $html2->find('table', 0);
155 | $test2 = $html2->find('table', 1);
156 | if ($test && count($test->find('tr')) > 3) {
157 | $tt = $test;
158 | } else if ($test2 && count($test2->find('tr')) > 3) {
159 | $tt = $test2;
160 | } else {
161 | $tt = '';
162 | }
163 | if ($tt != '') {
164 | foreach ($tt->find('tr') as $k => $tr) {
165 | if ($tr->find('td[id=fileinfotpl_desc]', 0)) {
166 | if ($tr->find('td.description', 0)) {
167 | $temp = $tr->find('td.description', 0)->plaintext;
168 | $legendeSlug = strip_tags($temp);
169 | $legendNbCar = mb_strlen($legendeSlug);
170 | if ($legendNbCar > 4 && $legendNbCar < 120) {
171 | $credits_img = strip_tags($temp);
172 | }
173 | }
174 | }
175 | }
176 | }
177 | }
178 | }
179 |
180 |
181 | // ############################################################
182 | // DEFINITIONS POUR CHAQUE CLASSE GRAMMATICALE
183 | // ############################################################
184 |
185 | for($z=0; $z<$nbNaturesGram; $z++){
186 |
187 | // Détermine à partir de quelle liste commence les définitions
188 | if($z == 0){
189 | $teteOk = false;
190 | $ol_rang = 0;
191 |
192 | // On exclut les listes de symbole
193 | if(null != $html->find('div[id=mw-content-text]', 0)){
194 | if(null != $html->find('div[id=mw-content-text]', 0)->find('dl', 0)){
195 | if(null != $html->find('div[id=mw-content-text]', 0)->find('dl', 0)->find('ol', 0)){
196 | $nbOl = count($html->find('div[id=mw-content-text]', 0)->find('dl', 0)->find('ol'));
197 | $ol_rang = $nbOl;
198 | }
199 | }
200 | }
201 |
202 | // On exclut les listes d'éthymologie
203 | if(null != $html->find('ol', $ol_rang)){
204 | if(null != $html->find('ol', $ol_rang)->find('li', 0)){
205 | if(null != $html->find('ol', $ol_rang)->find('li', 0)->find('span', 0)){
206 | if($html->find('ol', $ol_rang)->find('li', 0)->find('span', 0)->plaintext == 'Linguistique'){
207 | $ol_rang++;
208 |
209 | }
210 | }
211 | }
212 | }
213 |
214 | }
215 |
216 | // on obtient $ol_rang : rang de la première liste à parser
217 | if($z != 0){
218 | $ol_rang++;
219 | }
220 |
221 | // Parse la 1ère liste
222 | $tete=$html->find('ol', $ol_rang);
223 |
224 | // Si on trouve une liste ol de définition
225 | if($tete != ''){
226 | $str='';
227 | $str2='';
228 | $ref='';
229 |
230 | // On détermine les relatives aux exemples
231 | $html3 = new simple_html_dom();
232 | $html3->load($tete);
233 | foreach($html3->find('ul') as $ul){
234 | $ul->innertext="";
235 | }
236 |
237 | // Cas particulier des Formes de verbes :
238 | // - on détermine le verbe à l'infinitif et on crée un lien vers celui-ci
239 | if($naturesGram[$z] == "Forme de verbe"){
240 | $needLink = false;
241 | $isPluriel = false;
242 | foreach($html3->find('a') as $p => $a){
243 | $a->id = "complement_verbe_".$p;
244 | $radical = $a->title;
245 | if ($radical != $motWiki){
246 | $needLink = true;
247 | $a->href = "https://fr.wiktionary.org/wiki/".$radical;
248 | $a->class = "link-perso click-def-complement";
249 | }
250 | }
251 | }
252 |
253 | // Cas particulier des autres formes :
254 | // - on détermine si c'est le pluriel qui est défini : dans ce cas, on crée un lien vers le mot au singulier
255 | if($naturesGram[$z] != "Forme de verbe"){
256 | $isPluriel = false;
257 | $plurielTest = $html3->find('li', 0);
258 | $text=strip_tags($plurielTest);
259 | $html3Tab = explode(" ", $text);
260 |
261 | foreach($html3Tab as $mot){
262 | if($mot == "Pluriel" || $mot == "pluriel" || (strpos($text, "Féminin singulier") !== FALSE)){
263 | $linkSingulier = $html3->find('a', 0);
264 | $singulier = $linkSingulier->title;
265 | $linkSingulier->href = "https://fr.wiktionary.org/wiki/".$singulier;
266 | $linkSingulier->id = "complement_genre";
267 | $linkSingulier->class = "link-perso click-def-complement";
268 | $isPluriel = true;
269 | }
270 | }
271 | }
272 |
273 | // ############################################################
274 | // METHODE UTILISEE :
275 | // - on va déterminer toutes les - dans les
qui restent;
276 | // - va falloir repérer les sous listes, les présentes dans
277 | // les que l'on parse.
278 | //
279 | //
280 | // Méthode choisie : faire la différence entre :
281 | //
282 | // ** tab de tous les li (si sous liste "ol", il y aura une "li" qui
283 | // qui contiendra "l'intitulé" et l'"ol" avec ses "li" ) :
284 | //
285 | // -
286 | // Intitulé
287 | //
288 | // - l1 de la sous-liste "ol"
289 | // - l2 de la sous-liste "ol"
290 | //
291 | //
292 | //
293 | // ** tab des li des sous-listes
294 | //
295 | //
296 | // ############################################################
297 |
298 |
299 | $str=$html3;
300 | // On supprime les relatives aux exemples
301 | $str2 = str_replace("", "", $str);
302 |
303 | $html4 = new simple_html_dom();
304 | $html4->load($str2);
305 |
306 | // Variables temporaires pour effectuer le tri
307 | $t = $html4->find('ol', 0);
308 |
309 | $ref = $t->innertext;
310 |
311 | $resTep = [];
312 | $resOl = [];
313 | $resT = [];
314 | $resTT = [];
315 | $res2 = [];
316 | $res = [];
317 | $resTTT = [];
318 | $resTemmp = [];
319 | $resTemmp2 = [];
320 | $resFin = [];
321 | $lastDef='';
322 |
323 | // Tableau de tous les -
324 | $html5 = new simple_html_dom();
325 | $html5->load($ref);
326 | $testLi=$html5->find('li');
327 | foreach($testLi as $li){
328 | $res[]=$li;
329 | }
330 |
331 | // verifie si il y a une "ol" dans les "li"
332 | foreach($res as $v){
333 | $test = $v->find('ol', 0);
334 | if($test != ''){
335 | foreach($test->find('li') as $li){
336 | $resTep[]=$li;
337 | }
338 | }
339 |
340 | }
341 |
342 | // Si "ol" dans "li", on fait la différence
343 | $res = array_diff($res, $resTep);
344 |
345 | $resStr = '';
346 |
347 | // On réorganise les résultats obtenus
348 | foreach($res as $v){
349 | $resStr .= $v;
350 | }
351 |
352 | $resOl = explode("
", $resStr);
353 |
354 | $nbEl = count($resOl);
355 |
356 | /* ###################################################
357 | On organise de la la façon suivante:
358 | si une sous-liste "ol" : [intitulé, li_1, li_2] par exemple
359 | si pas de sous liste : li
360 | */ ###################################################
361 |
362 | if ($nbEl == 1){
363 | $resTemmp=explode("- ", $resOl[0]);
364 | foreach($resTemmp as $l){
365 | $res2[]=$l;
366 | }
367 | }else{
368 | foreach($resOl as $i => $v){
369 | if (strpos($v, "
") !== FALSE){
370 | $resTTT=explode("
", $v);
371 |
372 | $resTemmp=explode("- ", $resTTT[0]);
373 | foreach($resTemmp as $l){
374 | $resT[]=$l;
375 | }
376 | $res2[]=[$resT];
377 |
378 | $resTemmp2=explode("
- ", $resTTT[1]);
379 | foreach($resTemmp2 as $l2){
380 | $res2[]=$l2;
381 | }
382 |
383 | }else{
384 | $resTemmp=explode("
- ", $v);
385 | foreach($resTemmp as $l){
386 | $res2[]=$l;
387 | }
388 | }
389 | }
390 | }
391 |
392 | // On supprime les tags html et on supprime les doublons
393 | $nbArray=0;
394 | foreach($res2 as $i => $v){
395 | if(is_string($v)){
396 | // sauf pour les cas particuliers (verbes conjugués et pluriels)
397 | if(($naturesGram[$z] == "Forme de verbe" && $needLink) || $isPluriel == true){
398 | $resFin[] = enleveTagsPerso($v);
399 | }else{
400 | $resFin[] = strip_tags($v);
401 | }
402 | if($resFin[$i] == ''){
403 | unset($resFin[$i]);
404 | }
405 | }
406 | if(is_array($v)){
407 | $nbArray++;
408 | foreach($v[0] as $p => $l){
409 | if($p != 0){
410 | $resTT[]=strip_tags($l);
411 | }
412 | }
413 | if ($p != 0 && $nbArray>1){
414 | $restTTUnique =array_values(array_unique($resTT));
415 | $k=array_search("", $restTTUnique);
416 | $resFin[]=[array_slice($restTTUnique, $k+1)];
417 | }else{
418 |
419 | $resFin[]=[array_keys(array_flip($resTT))];
420 | }
421 |
422 | }
423 |
424 | }
425 | $ol_rang += $nbArray;
426 |
427 | // Le résultat de la classe grammaticale z $resTT est ajouté au tab resFinal
428 | $resfinal[$z][]=$resFin;
429 |
430 | // Si on ne trouve pas de liste ol dans la classe grammaticale z
431 | }else{
432 | $error = "Un problème est survenu lors de la recherche de la définition du mot ".strtoupper($motWiki);
433 | }
434 |
435 | }
436 |
437 | // Si on ne trouve pas de classes grammaticales
438 | }else{
439 | $error = "Un problème est survenu lors de la recherche de la définition du mot ".strtoupper($motWiki);
440 | }
441 |
442 | // Si le mot saisi n'est pas présent sur Wikitionnaire
443 | } else {
444 | $error = "Le mot ".strtoupper($motWiki). " n'apparait pas dans notre dictionnaire de référence, le Wiktionary.";
445 | }
446 |
447 |
448 | // Tableau final
449 | $data = array();
450 | $data["motWiki"]=$motWiki;
451 | $data["error"]=$error;
452 | $data["direct_link"]=$url;
453 | $data["url_img"]=$url_img;
454 | $data["legende_img"]=$legende_img;
455 | $data["url_credits"]=$url_credits;
456 | $data["nature"]=$naturesGram;
457 | $data["genre"]=$genre;
458 | $data["natureDef"]=$resfinal;
459 |
460 | // Encodage du tableau au format JSON
461 | echo json_encode($data);
462 | }
463 |
--------------------------------------------------------------------------------
/app/api_wiki_complement.php:
--------------------------------------------------------------------------------
1 | ';
14 | print_r($x);
15 | echo '';
16 | }
17 |
18 | // Fonction de validation des données
19 | function valid_donnees($donnees)
20 | {
21 | $donnees = trim($donnees);
22 | $donnees = stripslashes($donnees);
23 | $donnees = htmlspecialchars($donnees);
24 | return $donnees;
25 | }
26 |
27 | // Fonction pour enlever certains tags (ne pas enlever )
28 | function enleveTagsPerso($chaine)
29 | {
30 | $search = array('', '', '
', '
', ' - ', '
', '', '
');
31 | $replace = array('', '', '', '', '', '', '', '');
32 |
33 | $chaine = str_replace($search, $replace, $chaine);
34 | return $chaine;
35 | }
36 |
37 | // Fonction qui vérifie l'existence d'une page web
38 | function IFilesExists($url)
39 | {
40 | $headers = @get_headers($url, 1);
41 | if ($headers[0] == '') return false;
42 | return !((preg_match('/404/', $headers[0])) == 1);
43 | }
44 |
45 | $motWikiComplementTemp = $_POST['motWikiComplement'];
46 | $motWikiComplement = valid_donnees($motWikiComplementTemp);
47 | $url = '';
48 | $errorComp = '';
49 |
50 | if (IFilesExists("https://fr.wiktionary.org/wiki/" . $motWikiComplement)) {
51 | $url = "https://fr.wiktionary.org/wiki/" . $motWikiComplement;
52 |
53 | $naturesGramComp = [];
54 | $resfinalComp = [];
55 | $resTempComp = [];
56 | $resComp = [];
57 | $nbNaturesGramComp = 0;
58 | $resFinComp = [];
59 | $genreTComp = [];
60 | $genreComp = [];
61 |
62 | $html = new simple_html_dom();
63 | $html->load_file($url);
64 | $nbNaturesGramComp = count($html->find('h3 span.titredef[id^=fr-]'));
65 |
66 | if ($nbNaturesGramComp != 0) {
67 |
68 | foreach ($html->find('h3 span.titredef[id^=fr-]') as $v) {
69 | $naturesGramComp[] = $v->plaintext;
70 | }
71 |
72 | $z = 0;
73 | foreach ($naturesGramComp as $i => $class) {
74 | if (strpos($class, "commun") !== FALSE) {
75 | $x = $html->find('p span.ligne-de-forme', $z)->plaintext;
76 | $genreComp[] = [$class, $x];
77 | $z++;
78 | } else {
79 | $genreComp[] = $class;
80 | }
81 | }
82 |
83 |
84 | for ($z = 0; $z < $nbNaturesGramComp; $z++) {
85 |
86 | if ($z == 0) {
87 | $teteOk = false;
88 | $ol_rang = 0;
89 | if (null != $html->find('div[id=mw-content-text]', 0)) {
90 | if (null != $html->find('div[id=mw-content-text]', 0)->find('dl', 0)) {
91 | if (null != $html->find('div[id=mw-content-text]', 0)->find('dl', 0)->find('ol', 0)) {
92 | $nbOl = count($html->find('div[id=mw-content-text]', 0)->find('dl', 0)->find('ol'));
93 | $ol_rang = $nbOl;
94 | }
95 | }
96 | }
97 |
98 | if (null != $html->find('ol', $ol_rang)) {
99 | if (null != $html->find('ol', $ol_rang)->find('li', 0)) {
100 | if (null != $html->find('ol', $ol_rang)->find('li', 0)->find('span', 0)) {
101 | if ($html->find('ol', $ol_rang)->find('li', 0)->find('span', 0)->plaintext == 'Linguistique') {
102 | $ol_rang++;
103 | }
104 | }
105 | }
106 | }
107 | }
108 | if ($z != 0) {
109 | $ol_rang++;
110 | }
111 |
112 | $str = '';
113 | $str2 = '';
114 | $ref = '';
115 |
116 | $tete = $html->find('ol', $ol_rang);
117 |
118 | $html10 = new simple_html_dom();
119 | $html10->load($tete);
120 | foreach ($html10->find('ul') as $ul) {
121 | $ul->innertext = "";
122 | }
123 |
124 | $str = $html10;
125 | $str2 = str_replace("", "", $str);
126 |
127 | $html15 = new simple_html_dom();
128 | $html15->load($str2);
129 |
130 | $t = $html15->find('ol', 0);
131 |
132 | $ref = $t->innertext;
133 |
134 | $resTepComp = [];
135 | $resFinComp = [];
136 | $resOlComp = [];
137 | $resTComp = [];
138 | $resTTComp = [];
139 | $res2Comp = [];
140 | $resComp = [];
141 | $resTTTComp = [];
142 | $resTemmpComp = [];
143 | $resTemmp2Comp = [];
144 |
145 | $html20 = new simple_html_dom();
146 | $html20->load($ref);
147 | $testLi = $html20->find('li');
148 | foreach ($testLi as $li) {
149 | $resComp[] = $li;
150 | }
151 |
152 | foreach ($resComp as $v) {
153 | $test = $v->find('ol', 0);
154 | if ($test != '') {
155 | foreach ($test->find('li') as $li) {
156 | $resTepComp[] = $li;
157 | }
158 | }
159 | }
160 | $resComp = array_diff($resComp, $resTepComp);
161 |
162 | $resStr = '';
163 |
164 | foreach ($resComp as $v) {
165 | $resStr .= $v;
166 | }
167 |
168 | $resOlComp = explode("", $resStr);
169 |
170 | $nbEl = count($resOlComp);
171 |
172 | if ($nbEl == 1) {
173 | $resTemmpComp = explode("- ", $resOlComp[0]);
174 | foreach ($resTemmpComp as $l) {
175 | $res2Comp[] = $l;
176 | }
177 | } else {
178 | foreach ($resOlComp as $i => $v) {
179 | if (strpos($v, "
") !== FALSE) {
180 | $resTTTComp = explode("
", $v);
181 |
182 | $resTemmpComp = explode("- ", $resTTTComp[0]);
183 | foreach ($resTemmpComp as $l) {
184 | $resTComp[] = $l;
185 | }
186 | $res2Comp[] = [$resTComp];
187 |
188 | $resTemmp2Comp = explode("
- ", $resTTTComp[1]);
189 | foreach ($resTemmp2Comp as $l2) {
190 | $res2Comp[] = $l2;
191 | }
192 | } else {
193 | $resTemmpComp = explode("
- ", $v);
194 | foreach ($resTemmpComp as $l) {
195 | $res2Comp[] = $l;
196 | }
197 | }
198 | }
199 | }
200 |
201 | $nbArrayComp = 0;
202 | foreach ($res2Comp as $i => $v) {
203 | if (is_string($v)) {
204 | $resFinComp[] = strip_tags($v);
205 | if ($resFinComp[$i] == '') {
206 | unset($resFinComp[$i]);
207 | }
208 | }
209 | if (is_array($v)) {
210 | $nbArrayComp++;
211 | foreach ($v[0] as $p => $l) {
212 | if ($p != 0) {
213 | $resTTComp[] = strip_tags($l);
214 | }
215 | }
216 | if ($p != 0 && $nbArrayComp > 1) {
217 | $restTTUniqueComp = array_values(array_unique($resTTComp));
218 | $k = array_search("", $restTTUniqueComp);
219 | $resFinComp[] = [array_slice($restTTUniqueComp, $k + 1)];
220 | } else {
221 | $resFinComp[] = [array_keys(array_flip($resTTComp))];
222 | }
223 | }
224 | }
225 | $ol_rang += $nbArrayComp;
226 | $resfinalComp[$z][] = $resFinComp;
227 | }
228 | } else {
229 | $errorComp = "Un problème est survenu lors de la recherche de la définition du mot " . strtoupper($motWikiComplement);
230 | }
231 | } else {
232 | $errorComp = "Le mot " . strtoupper($motWikiComplement) . " n'apparait pas dans notre dictionnaire de référence, le Wiktionary.";
233 | }
234 |
235 | $dataComp = array();
236 | $dataComp["direct_link_comp"] = $url;
237 | $dataComp["motWikiComplement"] = $motWikiComplement;
238 | $dataComp["natureComp"] = $naturesGramComp;
239 | $dataComp["genreComp"] = $genreComp;
240 | $dataComp["natureDefComp"] = $resfinalComp;
241 | $dataComp["error"] = $errorComp;
242 |
243 | echo json_encode($dataComp);
244 | }
245 |
--------------------------------------------------------------------------------
/app/motAnalyse.php:
--------------------------------------------------------------------------------
1 | ';
5 | print_r($x);
6 | echo '';
7 | }
8 |
9 | function valid_donnees($donnees)
10 | {
11 | $donnees = trim($donnees);
12 | $donnees = stripslashes($donnees);
13 | $donnees = htmlspecialchars($donnees);
14 | return $donnees;
15 | }
16 |
17 | $_SESSION['errors'] = '';
18 | $_SESSION['motInput'] = '';
19 | $errors='';
20 | $motValid='';
21 |
22 | // On vérifie les données
23 | if (isset($_POST['motInput']) && !empty($_POST['motInput'])) {
24 | // Vérification des données passées en POST
25 | $motInput = $_POST['motInput'];
26 | $validInput = valid_donnees($motInput);
27 |
28 | // On vérifie le pattern
29 | $pattern = '/^[a-zA-ZàâäçéèêëîïôöùûüÀÂÄÇÉÈÊËÎÏÔÖÙÛÜ-]{1,26}$/';
30 | $subject = $validInput;
31 |
32 | // Si c'est ok
33 | if (preg_match($pattern, $subject)) {
34 | // On passe l'input en variable de session
35 | $motValid = $validInput;
36 |
37 | // Sinon Notif si input trop long (+ de 26 caractères)
38 | } else if (strlen($motInput) > 26) {
39 | $errors="Vous devez saisir un mot de 26 caractères au maximum.";
40 |
41 | // Sinon Notif si des caractères autres que des lettres ou un tiret sont saisis
42 | } else {
43 | $errors = "Vous ne pouvez saisir que des lettres, accentuées ou non, ainsi que le tiret";
44 | }
45 |
46 | // Sinon, notif si input empty
47 | } else {
48 | $errors = "Vous devez sasir un mot à définir.";
49 | }
50 | $dataInput = array();
51 | $dataInput["motValid"]=$motValid;
52 | $dataInput["error"]=$errors;
53 | echo json_encode($dataInput);
--------------------------------------------------------------------------------
/app/simple_html_dom.php:
--------------------------------------------------------------------------------
1 | $maxLen) {
87 | $dom->clear();
88 | return false;
89 | }
90 |
91 | return $dom->load($contents, $lowercase, $stripRN);
92 | }
93 |
94 | function str_get_html(
95 | $str,
96 | $lowercase = true,
97 | $forceTagsClosed = true,
98 | $target_charset = DEFAULT_TARGET_CHARSET,
99 | $stripRN = true,
100 | $defaultBRText = DEFAULT_BR_TEXT,
101 | $defaultSpanText = DEFAULT_SPAN_TEXT)
102 | {
103 | $dom = new simple_html_dom(
104 | null,
105 | $lowercase,
106 | $forceTagsClosed,
107 | $target_charset,
108 | $stripRN,
109 | $defaultBRText,
110 | $defaultSpanText
111 | );
112 |
113 | if (empty($str) || strlen($str) > MAX_FILE_SIZE) {
114 | $dom->clear();
115 | return false;
116 | }
117 |
118 | return $dom->load($str, $lowercase, $stripRN);
119 | }
120 |
121 | function dump_html_tree($node, $show_attr = true, $deep = 0)
122 | {
123 | $node->dump($node);
124 | }
125 |
126 | class simple_html_dom_node
127 | {
128 | public $nodetype = HDOM_TYPE_TEXT;
129 | public $tag = 'text';
130 | public $attr = array();
131 | public $children = array();
132 | public $nodes = array();
133 | public $parent = null;
134 | public $_ = array();
135 | public $tag_start = 0;
136 | private $dom = null;
137 |
138 | function __construct($dom)
139 | {
140 | $this->dom = $dom;
141 | $dom->nodes[] = $this;
142 | }
143 |
144 | function __destruct()
145 | {
146 | $this->clear();
147 | }
148 |
149 | function __toString()
150 | {
151 | return $this->outertext();
152 | }
153 |
154 | function clear()
155 | {
156 | $this->dom = null;
157 | $this->nodes = null;
158 | $this->parent = null;
159 | $this->children = null;
160 | }
161 |
162 | function dump($show_attr = true, $depth = 0)
163 | {
164 | echo str_repeat("\t", $depth) . $this->tag;
165 |
166 | if ($show_attr && count($this->attr) > 0) {
167 | echo '(';
168 | foreach ($this->attr as $k => $v) {
169 | echo "[$k]=>\"$v\", ";
170 | }
171 | echo ')';
172 | }
173 |
174 | echo "\n";
175 |
176 | if ($this->nodes) {
177 | foreach ($this->nodes as $node) {
178 | $node->dump($show_attr, $depth + 1);
179 | }
180 | }
181 | }
182 |
183 | function dump_node($echo = true)
184 | {
185 | $string = $this->tag;
186 |
187 | if (count($this->attr) > 0) {
188 | $string .= '(';
189 | foreach ($this->attr as $k => $v) {
190 | $string .= "[$k]=>\"$v\", ";
191 | }
192 | $string .= ')';
193 | }
194 |
195 | if (count($this->_) > 0) {
196 | $string .= ' $_ (';
197 | foreach ($this->_ as $k => $v) {
198 | if (is_array($v)) {
199 | $string .= "[$k]=>(";
200 | foreach ($v as $k2 => $v2) {
201 | $string .= "[$k2]=>\"$v2\", ";
202 | }
203 | $string .= ')';
204 | } else {
205 | $string .= "[$k]=>\"$v\", ";
206 | }
207 | }
208 | $string .= ')';
209 | }
210 |
211 | if (isset($this->text)) {
212 | $string .= " text: ({$this->text})";
213 | }
214 |
215 | $string .= ' HDOM_INNER_INFO: ';
216 |
217 | if (isset($node->_[HDOM_INFO_INNER])) {
218 | $string .= "'" . $node->_[HDOM_INFO_INNER] . "'";
219 | } else {
220 | $string .= ' NULL ';
221 | }
222 |
223 | $string .= ' children: ' . count($this->children);
224 | $string .= ' nodes: ' . count($this->nodes);
225 | $string .= ' tag_start: ' . $this->tag_start;
226 | $string .= "\n";
227 |
228 | if ($echo) {
229 | echo $string;
230 | return;
231 | } else {
232 | return $string;
233 | }
234 | }
235 |
236 | function parent($parent = null)
237 | {
238 | // I am SURE that this doesn't work properly.
239 | // It fails to unset the current node from it's current parents nodes or
240 | // children list first.
241 | if ($parent !== null) {
242 | $this->parent = $parent;
243 | $this->parent->nodes[] = $this;
244 | $this->parent->children[] = $this;
245 | }
246 |
247 | return $this->parent;
248 | }
249 |
250 | function has_child()
251 | {
252 | return !empty($this->children);
253 | }
254 |
255 | function children($idx = -1)
256 | {
257 | if ($idx === -1) {
258 | return $this->children;
259 | }
260 |
261 | if (isset($this->children[$idx])) {
262 | return $this->children[$idx];
263 | }
264 |
265 | return null;
266 | }
267 |
268 | function first_child()
269 | {
270 | if (count($this->children) > 0) {
271 | return $this->children[0];
272 | }
273 | return null;
274 | }
275 |
276 | function last_child()
277 | {
278 | if (count($this->children) > 0) {
279 | return end($this->children);
280 | }
281 | return null;
282 | }
283 |
284 | function next_sibling()
285 | {
286 | if ($this->parent === null) {
287 | return null;
288 | }
289 |
290 | $idx = array_search($this, $this->parent->children, true);
291 |
292 | if ($idx !== false && isset($this->parent->children[$idx + 1])) {
293 | return $this->parent->children[$idx + 1];
294 | }
295 |
296 | return null;
297 | }
298 |
299 | function prev_sibling()
300 | {
301 | if ($this->parent === null) {
302 | return null;
303 | }
304 |
305 | $idx = array_search($this, $this->parent->children, true);
306 |
307 | if ($idx !== false && $idx > 0) {
308 | return $this->parent->children[$idx - 1];
309 | }
310 |
311 | return null;
312 | }
313 |
314 | function find_ancestor_tag($tag)
315 | {
316 | global $debug_object;
317 | if (is_object($debug_object)) { $debug_object->debug_log_entry(1); }
318 |
319 | if ($this->parent === null) {
320 | return null;
321 | }
322 |
323 | $ancestor = $this->parent;
324 |
325 | while (!is_null($ancestor)) {
326 | if (is_object($debug_object)) {
327 | $debug_object->debug_log(2, 'Current tag is: ' . $ancestor->tag);
328 | }
329 |
330 | if ($ancestor->tag === $tag) {
331 | break;
332 | }
333 |
334 | $ancestor = $ancestor->parent;
335 | }
336 |
337 | return $ancestor;
338 | }
339 |
340 | function innertext()
341 | {
342 | if (isset($this->_[HDOM_INFO_INNER])) {
343 | return $this->_[HDOM_INFO_INNER];
344 | }
345 |
346 | if (isset($this->_[HDOM_INFO_TEXT])) {
347 | return $this->dom->restore_noise($this->_[HDOM_INFO_TEXT]);
348 | }
349 |
350 | $ret = '';
351 |
352 | foreach ($this->nodes as $n) {
353 | $ret .= $n->outertext();
354 | }
355 |
356 | return $ret;
357 | }
358 |
359 | function outertext()
360 | {
361 | global $debug_object;
362 |
363 | if (is_object($debug_object)) {
364 | $text = '';
365 |
366 | if ($this->tag === 'text') {
367 | if (!empty($this->text)) {
368 | $text = ' with text: ' . $this->text;
369 | }
370 | }
371 |
372 | $debug_object->debug_log(1, 'Innertext of tag: ' . $this->tag . $text);
373 | }
374 |
375 | if ($this->tag === 'root') {
376 | return $this->innertext();
377 | }
378 |
379 | // todo: What is the use of this callback? Remove?
380 | if ($this->dom && $this->dom->callback !== null) {
381 | call_user_func_array($this->dom->callback, array($this));
382 | }
383 |
384 | if (isset($this->_[HDOM_INFO_OUTER])) {
385 | return $this->_[HDOM_INFO_OUTER];
386 | }
387 |
388 | if (isset($this->_[HDOM_INFO_TEXT])) {
389 | return $this->dom->restore_noise($this->_[HDOM_INFO_TEXT]);
390 | }
391 |
392 | $ret = '';
393 |
394 | if ($this->dom && $this->dom->nodes[$this->_[HDOM_INFO_BEGIN]]) {
395 | $ret = $this->dom->nodes[$this->_[HDOM_INFO_BEGIN]]->makeup();
396 | }
397 |
398 | if (isset($this->_[HDOM_INFO_INNER])) {
399 | // todo:
should either never have HDOM_INFO_INNER or always
400 | if ($this->tag !== 'br') {
401 | $ret .= $this->_[HDOM_INFO_INNER];
402 | }
403 | } elseif ($this->nodes) {
404 | foreach ($this->nodes as $n) {
405 | $ret .= $this->convert_text($n->outertext());
406 | }
407 | }
408 |
409 | if (isset($this->_[HDOM_INFO_END]) && $this->_[HDOM_INFO_END] != 0) {
410 | $ret .= 'tag . '>';
411 | }
412 |
413 | return $ret;
414 | }
415 |
416 | function text()
417 | {
418 | if (isset($this->_[HDOM_INFO_INNER])) {
419 | return $this->_[HDOM_INFO_INNER];
420 | }
421 |
422 | switch ($this->nodetype) {
423 | case HDOM_TYPE_TEXT: return $this->dom->restore_noise($this->_[HDOM_INFO_TEXT]);
424 | case HDOM_TYPE_COMMENT: return '';
425 | case HDOM_TYPE_UNKNOWN: return '';
426 | }
427 |
428 | if (strcasecmp($this->tag, 'script') === 0) { return ''; }
429 | if (strcasecmp($this->tag, 'style') === 0) { return ''; }
430 |
431 | $ret = '';
432 |
433 | // In rare cases, (always node type 1 or HDOM_TYPE_ELEMENT - observed
434 | // for some span tags, and some p tags) $this->nodes is set to NULL.
435 | // NOTE: This indicates that there is a problem where it's set to NULL
436 | // without a clear happening.
437 | // WHY is this happening?
438 | if (!is_null($this->nodes)) {
439 | foreach ($this->nodes as $n) {
440 | // Start paragraph after a blank line
441 | if ($n->tag === 'p') {
442 | $ret = trim($ret) . "\n\n";
443 | }
444 |
445 | $ret .= $this->convert_text($n->text());
446 |
447 | // If this node is a span... add a space at the end of it so
448 | // multiple spans don't run into each other. This is plaintext
449 | // after all.
450 | if ($n->tag === 'span') {
451 | $ret .= $this->dom->default_span_text;
452 | }
453 | }
454 | }
455 | return $ret;
456 | }
457 |
458 | function xmltext()
459 | {
460 | $ret = $this->innertext();
461 | $ret = str_ireplace('', '', $ret);
463 | return $ret;
464 | }
465 |
466 | function makeup()
467 | {
468 | // text, comment, unknown
469 | if (isset($this->_[HDOM_INFO_TEXT])) {
470 | return $this->dom->restore_noise($this->_[HDOM_INFO_TEXT]);
471 | }
472 |
473 | $ret = '<' . $this->tag;
474 | $i = -1;
475 |
476 | foreach ($this->attr as $key => $val) {
477 | ++$i;
478 |
479 | // skip removed attribute
480 | if ($val === null || $val === false) { continue; }
481 |
482 | $ret .= $this->_[HDOM_INFO_SPACE][$i][0];
483 |
484 | //no value attr: nowrap, checked selected...
485 | if ($val === true) {
486 | $ret .= $key;
487 | } else {
488 | switch ($this->_[HDOM_INFO_QUOTE][$i])
489 | {
490 | case HDOM_QUOTE_DOUBLE: $quote = '"'; break;
491 | case HDOM_QUOTE_SINGLE: $quote = '\''; break;
492 | default: $quote = '';
493 | }
494 |
495 | $ret .= $key
496 | . $this->_[HDOM_INFO_SPACE][$i][1]
497 | . '='
498 | . $this->_[HDOM_INFO_SPACE][$i][2]
499 | . $quote
500 | . $val
501 | . $quote;
502 | }
503 | }
504 |
505 | $ret = $this->dom->restore_noise($ret);
506 | return $ret . $this->_[HDOM_INFO_ENDSPACE] . '>';
507 | }
508 |
509 | function find($selector, $idx = null, $lowercase = false)
510 | {
511 | $selectors = $this->parse_selector($selector);
512 | if (($count = count($selectors)) === 0) { return array(); }
513 | $found_keys = array();
514 |
515 | // find each selector
516 | for ($c = 0; $c < $count; ++$c) {
517 | // The change on the below line was documented on the sourceforge
518 | // code tracker id 2788009
519 | // used to be: if (($levle=count($selectors[0]))===0) return array();
520 | if (($levle = count($selectors[$c])) === 0) { return array(); }
521 | if (!isset($this->_[HDOM_INFO_BEGIN])) { return array(); }
522 |
523 | $head = array($this->_[HDOM_INFO_BEGIN] => 1);
524 | $cmd = ' '; // Combinator
525 |
526 | // handle descendant selectors, no recursive!
527 | for ($l = 0; $l < $levle; ++$l) {
528 | $ret = array();
529 |
530 | foreach ($head as $k => $v) {
531 | $n = ($k === -1) ? $this->dom->root : $this->dom->nodes[$k];
532 | //PaperG - Pass this optional parameter on to the seek function.
533 | $n->seek($selectors[$c][$l], $ret, $cmd, $lowercase);
534 | }
535 |
536 | $head = $ret;
537 | $cmd = $selectors[$c][$l][4]; // Next Combinator
538 | }
539 |
540 | foreach ($head as $k => $v) {
541 | if (!isset($found_keys[$k])) {
542 | $found_keys[$k] = 1;
543 | }
544 | }
545 | }
546 |
547 | // sort keys
548 | ksort($found_keys);
549 |
550 | $found = array();
551 | foreach ($found_keys as $k => $v) {
552 | $found[] = $this->dom->nodes[$k];
553 | }
554 |
555 | // return nth-element or array
556 | if (is_null($idx)) { return $found; }
557 | elseif ($idx < 0) { $idx = count($found) + $idx; }
558 | return (isset($found[$idx])) ? $found[$idx] : null;
559 | }
560 |
561 | protected function seek($selector, &$ret, $parent_cmd, $lowercase = false)
562 | {
563 | global $debug_object;
564 | if (is_object($debug_object)) { $debug_object->debug_log_entry(1); }
565 |
566 | list($tag, $id, $class, $attributes, $cmb) = $selector;
567 | $nodes = array();
568 |
569 | if ($parent_cmd === ' ') { // Descendant Combinator
570 | // Find parent closing tag if the current element doesn't have a closing
571 | // tag (i.e. void element)
572 | $end = (!empty($this->_[HDOM_INFO_END])) ? $this->_[HDOM_INFO_END] : 0;
573 | if ($end == 0) {
574 | $parent = $this->parent;
575 | while (!isset($parent->_[HDOM_INFO_END]) && $parent !== null) {
576 | $end -= 1;
577 | $parent = $parent->parent;
578 | }
579 | $end += $parent->_[HDOM_INFO_END];
580 | }
581 |
582 | // Get list of target nodes
583 | $nodes_start = $this->_[HDOM_INFO_BEGIN] + 1;
584 | $nodes_count = $end - $nodes_start;
585 | $nodes = array_slice($this->dom->nodes, $nodes_start, $nodes_count, true);
586 | } elseif ($parent_cmd === '>') { // Child Combinator
587 | $nodes = $this->children;
588 | } elseif ($parent_cmd === '+'
589 | && $this->parent
590 | && in_array($this, $this->parent->children)) { // Next-Sibling Combinator
591 | $index = array_search($this, $this->parent->children, true) + 1;
592 | if ($index < count($this->parent->children))
593 | $nodes[] = $this->parent->children[$index];
594 | } elseif ($parent_cmd === '~'
595 | && $this->parent
596 | && in_array($this, $this->parent->children)) { // Subsequent Sibling Combinator
597 | $index = array_search($this, $this->parent->children, true);
598 | $nodes = array_slice($this->parent->children, $index);
599 | }
600 |
601 | // Go throgh each element starting at this element until the end tag
602 | // Note: If this element is a void tag, any previous void element is
603 | // skipped.
604 | foreach($nodes as $node) {
605 | $pass = true;
606 |
607 | // Skip root nodes
608 | if(!$node->parent) {
609 | $pass = false;
610 | }
611 |
612 | // Handle 'text' selector
613 | if($pass && $tag === 'text' && $node->tag === 'text') {
614 | $ret[array_search($node, $this->dom->nodes, true)] = 1;
615 | unset($node);
616 | continue;
617 | }
618 |
619 | // Skip if node isn't a child node (i.e. text nodes)
620 | if($pass && !in_array($node, $node->parent->children, true)) {
621 | $pass = false;
622 | }
623 |
624 | // Skip if tag doesn't match
625 | if ($pass && $tag !== '' && $tag !== $node->tag && $tag !== '*') {
626 | $pass = false;
627 | }
628 |
629 | // Skip if ID doesn't exist
630 | if ($pass && $id !== '' && !isset($node->attr['id'])) {
631 | $pass = false;
632 | }
633 |
634 | // Check if ID matches
635 | if ($pass && $id !== '' && isset($node->attr['id'])) {
636 | // Note: Only consider the first ID (as browsers do)
637 | $node_id = explode(' ', trim($node->attr['id']))[0];
638 |
639 | if($id !== $node_id) { $pass = false; }
640 | }
641 |
642 | // Check if all class(es) exist
643 | if ($pass && $class !== '' && is_array($class) && !empty($class)) {
644 | if (isset($node->attr['class'])) {
645 | $node_classes = explode(' ', $node->attr['class']);
646 |
647 | if ($lowercase) {
648 | $node_classes = array_map('strtolower', $node_classes);
649 | }
650 |
651 | foreach($class as $c) {
652 | if(!in_array($c, $node_classes)) {
653 | $pass = false;
654 | break;
655 | }
656 | }
657 | } else {
658 | $pass = false;
659 | }
660 | }
661 |
662 | // Check attributes
663 | if ($pass
664 | && $attributes !== ''
665 | && is_array($attributes)
666 | && !empty($attributes)) {
667 | foreach($attributes as $a) {
668 | list (
669 | $att_name,
670 | $att_expr,
671 | $att_val,
672 | $att_inv,
673 | $att_case_sensitivity
674 | ) = $a;
675 |
676 | // Handle indexing attributes (i.e. "[2]")
677 | /**
678 | * Note: This is not supported by the CSS Standard but adds
679 | * the ability to select items compatible to XPath (i.e.
680 | * the 3rd element within it's parent).
681 | *
682 | * Note: This doesn't conflict with the CSS Standard which
683 | * doesn't work on numeric attributes anyway.
684 | */
685 | if (is_numeric($att_name)
686 | && $att_expr === ''
687 | && $att_val === '') {
688 | $count = 0;
689 |
690 | // Find index of current element in parent
691 | foreach ($node->parent->children as $c) {
692 | if ($c->tag === $node->tag) ++$count;
693 | if ($c === $node) break;
694 | }
695 |
696 | // If this is the correct node, continue with next
697 | // attribute
698 | if ($count === (int)$att_name) continue;
699 | }
700 |
701 | // Check attribute availability
702 | if ($att_inv) { // Attribute should NOT be set
703 | if (isset($node->attr[$att_name])) {
704 | $pass = false;
705 | break;
706 | }
707 | } else { // Attribute should be set
708 | // todo: "plaintext" is not a valid CSS selector!
709 | if ($att_name !== 'plaintext'
710 | && !isset($node->attr[$att_name])) {
711 | $pass = false;
712 | break;
713 | }
714 | }
715 |
716 | // Continue with next attribute if expression isn't defined
717 | if ($att_expr === '') continue;
718 |
719 | // If they have told us that this is a "plaintext"
720 | // search then we want the plaintext of the node - right?
721 | // todo "plaintext" is not a valid CSS selector!
722 | if ($att_name === 'plaintext') {
723 | $nodeKeyValue = $node->text();
724 | } else {
725 | $nodeKeyValue = $node->attr[$att_name];
726 | }
727 |
728 | if (is_object($debug_object)) {
729 | $debug_object->debug_log(2,
730 | 'testing node: '
731 | . $node->tag
732 | . ' for attribute: '
733 | . $att_name
734 | . $att_expr
735 | . $att_val
736 | . ' where nodes value is: '
737 | . $nodeKeyValue
738 | );
739 | }
740 |
741 | // If lowercase is set, do a case insensitive test of
742 | // the value of the selector.
743 | if ($lowercase) {
744 | $check = $this->match(
745 | $att_expr,
746 | strtolower($att_val),
747 | strtolower($nodeKeyValue),
748 | $att_case_sensitivity
749 | );
750 | } else {
751 | $check = $this->match(
752 | $att_expr,
753 | $att_val,
754 | $nodeKeyValue,
755 | $att_case_sensitivity
756 | );
757 | }
758 |
759 | if (is_object($debug_object)) {
760 | $debug_object->debug_log(2,
761 | 'after match: '
762 | . ($check ? 'true' : 'false')
763 | );
764 | }
765 |
766 | if (!$check) {
767 | $pass = false;
768 | break;
769 | }
770 | }
771 | }
772 |
773 | // Found a match. Add to list and clear node
774 | if ($pass) $ret[$node->_[HDOM_INFO_BEGIN]] = 1;
775 | unset($node);
776 | }
777 | // It's passed by reference so this is actually what this function returns.
778 | if (is_object($debug_object)) {
779 | $debug_object->debug_log(1, 'EXIT - ret: ', $ret);
780 | }
781 | }
782 |
783 | protected function match($exp, $pattern, $value, $case_sensitivity)
784 | {
785 | global $debug_object;
786 | if (is_object($debug_object)) {$debug_object->debug_log_entry(1);}
787 |
788 | if ($case_sensitivity === 'i') {
789 | $pattern = strtolower($pattern);
790 | $value = strtolower($value);
791 | }
792 |
793 | switch ($exp) {
794 | case '=':
795 | return ($value === $pattern);
796 | case '!=':
797 | return ($value !== $pattern);
798 | case '^=':
799 | return preg_match('/^' . preg_quote($pattern, '/') . '/', $value);
800 | case '$=':
801 | return preg_match('/' . preg_quote($pattern, '/') . '$/', $value);
802 | case '*=':
803 | return preg_match('/' . preg_quote($pattern, '/') . '/', $value);
804 | case '|=':
805 | /**
806 | * [att|=val]
807 | *
808 | * Represents an element with the att attribute, its value
809 | * either being exactly "val" or beginning with "val"
810 | * immediately followed by "-" (U+002D).
811 | */
812 | return strpos($value, $pattern) === 0;
813 | case '~=':
814 | /**
815 | * [att~=val]
816 | *
817 | * Represents an element with the att attribute whose value is a
818 | * whitespace-separated list of words, one of which is exactly
819 | * "val". If "val" contains whitespace, it will never represent
820 | * anything (since the words are separated by spaces). Also if
821 | * "val" is the empty string, it will never represent anything.
822 | */
823 | return in_array($pattern, explode(' ', trim($value)), true);
824 | }
825 | return false;
826 | }
827 |
828 | protected function parse_selector($selector_string)
829 | {
830 | global $debug_object;
831 | if (is_object($debug_object)) { $debug_object->debug_log_entry(1); }
832 |
833 | /**
834 | * Pattern of CSS selectors, modified from mootools (https://mootools.net/)
835 | *
836 | * Paperg: Add the colon to the attribute, so that it properly finds
837 | * like google does.
838 | *
839 | * Note: if you try to look at this attribute, you MUST use getAttribute
840 | * since $dom->x:y will fail the php syntax check.
841 | *
842 | * Notice the \[ starting the attribute? and the @? following? This
843 | * implies that an attribute can begin with an @ sign that is not
844 | * captured. This implies that an html attribute specifier may start
845 | * with an @ sign that is NOT captured by the expression. Farther study
846 | * is required to determine of this should be documented or removed.
847 | *
848 | * Matches selectors in this order:
849 | *
850 | * [0] - full match
851 | *
852 | * [1] - tag name
853 | * ([\w:\*-]*)
854 | * Matches the tag name consisting of zero or more words, colons,
855 | * asterisks and hyphens.
856 | *
857 | * [2] - id name
858 | * (?:\#([\w-]+))
859 | * Optionally matches a id name, consisting of an "#" followed by
860 | * the id name (one or more words and hyphens).
861 | *
862 | * [3] - class names (including dots)
863 | * (?:\.([\w\.-]+))?
864 | * Optionally matches a list of classs, consisting of an "."
865 | * followed by the class name (one or more words and hyphens)
866 | * where multiple classes can be chained (i.e. ".foo.bar.baz")
867 | *
868 | * [4] - attributes
869 | * ((?:\[@?(?:!?[\w:-]+)(?:(?:[!*^$|~]?=)[\"']?(?:.*?)[\"']?)?(?:\s*?(?:[iIsS])?)?\])+)?
870 | * Optionally matches the attributes list
871 | *
872 | * [5] - separator
873 | * ([\/, >+~]+)
874 | * Matches the selector list separator
875 | */
876 | // phpcs:ignore Generic.Files.LineLength
877 | $pattern = "/([\w:\*-]*)(?:\#([\w-]+))?(?:|\.([\w\.-]+))?((?:\[@?(?:!?[\w:-]+)(?:(?:[!*^$|~]?=)[\"']?(?:.*?)[\"']?)?(?:\s*?(?:[iIsS])?)?\])+)?([\/, >+~]+)/is";
878 |
879 | preg_match_all(
880 | $pattern,
881 | trim($selector_string) . ' ', // Add final ' ' as pseudo separator
882 | $matches,
883 | PREG_SET_ORDER
884 | );
885 |
886 | if (is_object($debug_object)) {
887 | $debug_object->debug_log(2, 'Matches Array: ', $matches);
888 | }
889 |
890 | $selectors = array();
891 | $result = array();
892 |
893 | foreach ($matches as $m) {
894 | $m[0] = trim($m[0]);
895 |
896 | // Skip NoOps
897 | if ($m[0] === '' || $m[0] === '/' || $m[0] === '//') { continue; }
898 |
899 | // Convert to lowercase
900 | if ($this->dom->lowercase) {
901 | $m[1] = strtolower($m[1]);
902 | }
903 |
904 | // Extract classes
905 | if ($m[3] !== '') { $m[3] = explode('.', $m[3]); }
906 |
907 | /* Extract attributes (pattern based on the pattern above!)
908 |
909 | * [0] - full match
910 | * [1] - attribute name
911 | * [2] - attribute expression
912 | * [3] - attribute value
913 | * [4] - case sensitivity
914 | *
915 | * Note: Attributes can be negated with a "!" prefix to their name
916 | */
917 | if($m[4] !== '') {
918 | preg_match_all(
919 | "/\[@?(!?[\w:-]+)(?:([!*^$|~]?=)[\"']?(.*?)[\"']?)?(?:\s+?([iIsS])?)?\]/is",
920 | trim($m[4]),
921 | $attributes,
922 | PREG_SET_ORDER
923 | );
924 |
925 | // Replace element by array
926 | $m[4] = array();
927 |
928 | foreach($attributes as $att) {
929 | // Skip empty matches
930 | if(trim($att[0]) === '') { continue; }
931 |
932 | $inverted = (isset($att[1][0]) && $att[1][0] === '!');
933 | $m[4][] = array(
934 | $inverted ? substr($att[1], 1) : $att[1], // Name
935 | (isset($att[2])) ? $att[2] : '', // Expression
936 | (isset($att[3])) ? $att[3] : '', // Value
937 | $inverted, // Inverted Flag
938 | (isset($att[4])) ? strtolower($att[4]) : '', // Case-Sensitivity
939 | );
940 | }
941 | }
942 |
943 | // Sanitize Separator
944 | if ($m[5] !== '' && trim($m[5]) === '') { // Descendant Separator
945 | $m[5] = ' ';
946 | } else { // Other Separator
947 | $m[5] = trim($m[5]);
948 | }
949 |
950 | // Clear Separator if it's a Selector List
951 | if ($is_list = ($m[5] === ',')) { $m[5] = ''; }
952 |
953 | // Remove full match before adding to results
954 | array_shift($m);
955 | $result[] = $m;
956 |
957 | if ($is_list) { // Selector List
958 | $selectors[] = $result;
959 | $result = array();
960 | }
961 | }
962 |
963 | if (count($result) > 0) { $selectors[] = $result; }
964 | return $selectors;
965 | }
966 |
967 | function __get($name)
968 | {
969 | if (isset($this->attr[$name])) {
970 | return $this->convert_text($this->attr[$name]);
971 | }
972 | switch ($name) {
973 | case 'outertext': return $this->outertext();
974 | case 'innertext': return $this->innertext();
975 | case 'plaintext': return $this->text();
976 | case 'xmltext': return $this->xmltext();
977 | default: return array_key_exists($name, $this->attr);
978 | }
979 | }
980 |
981 | function __set($name, $value)
982 | {
983 | global $debug_object;
984 | if (is_object($debug_object)) { $debug_object->debug_log_entry(1); }
985 |
986 | switch ($name) {
987 | case 'outertext': return $this->_[HDOM_INFO_OUTER] = $value;
988 | case 'innertext':
989 | if (isset($this->_[HDOM_INFO_TEXT])) {
990 | return $this->_[HDOM_INFO_TEXT] = $value;
991 | }
992 | return $this->_[HDOM_INFO_INNER] = $value;
993 | }
994 |
995 | if (!isset($this->attr[$name])) {
996 | $this->_[HDOM_INFO_SPACE][] = array(' ', '', '');
997 | $this->_[HDOM_INFO_QUOTE][] = HDOM_QUOTE_DOUBLE;
998 | }
999 |
1000 | $this->attr[$name] = $value;
1001 | }
1002 |
1003 | function __isset($name)
1004 | {
1005 | switch ($name) {
1006 | case 'outertext': return true;
1007 | case 'innertext': return true;
1008 | case 'plaintext': return true;
1009 | }
1010 | //no value attr: nowrap, checked selected...
1011 | return (array_key_exists($name, $this->attr)) ? true : isset($this->attr[$name]);
1012 | }
1013 |
1014 | function __unset($name)
1015 | {
1016 | if (isset($this->attr[$name])) { unset($this->attr[$name]); }
1017 | }
1018 |
1019 | function convert_text($text)
1020 | {
1021 | global $debug_object;
1022 | if (is_object($debug_object)) { $debug_object->debug_log_entry(1); }
1023 |
1024 | $converted_text = $text;
1025 |
1026 | $sourceCharset = '';
1027 | $targetCharset = '';
1028 |
1029 | if ($this->dom) {
1030 | $sourceCharset = strtoupper($this->dom->_charset);
1031 | $targetCharset = strtoupper($this->dom->_target_charset);
1032 | }
1033 |
1034 | if (is_object($debug_object)) {
1035 | $debug_object->debug_log(3,
1036 | 'source charset: '
1037 | . $sourceCharset
1038 | . ' target charaset: '
1039 | . $targetCharset
1040 | );
1041 | }
1042 |
1043 | if (!empty($sourceCharset)
1044 | && !empty($targetCharset)
1045 | && (strcasecmp($sourceCharset, $targetCharset) != 0)) {
1046 | // Check if the reported encoding could have been incorrect and the text is actually already UTF-8
1047 | if ((strcasecmp($targetCharset, 'UTF-8') == 0)
1048 | && ($this->is_utf8($text))) {
1049 | $converted_text = $text;
1050 | } else {
1051 | $converted_text = iconv($sourceCharset, $targetCharset, $text);
1052 | }
1053 | }
1054 |
1055 | // Lets make sure that we don't have that silly BOM issue with any of the utf-8 text we output.
1056 | if ($targetCharset === 'UTF-8') {
1057 | if (substr($converted_text, 0, 3) === "\xef\xbb\xbf") {
1058 | $converted_text = substr($converted_text, 3);
1059 | }
1060 |
1061 | if (substr($converted_text, -3) === "\xef\xbb\xbf") {
1062 | $converted_text = substr($converted_text, 0, -3);
1063 | }
1064 | }
1065 |
1066 | return $converted_text;
1067 | }
1068 |
1069 | static function is_utf8($str)
1070 | {
1071 | $c = 0; $b = 0;
1072 | $bits = 0;
1073 | $len = strlen($str);
1074 | for($i = 0; $i < $len; $i++) {
1075 | $c = ord($str[$i]);
1076 | if($c > 128) {
1077 | if(($c >= 254)) { return false; }
1078 | elseif($c >= 252) { $bits = 6; }
1079 | elseif($c >= 248) { $bits = 5; }
1080 | elseif($c >= 240) { $bits = 4; }
1081 | elseif($c >= 224) { $bits = 3; }
1082 | elseif($c >= 192) { $bits = 2; }
1083 | else { return false; }
1084 | if(($i + $bits) > $len) { return false; }
1085 | while($bits > 1) {
1086 | $i++;
1087 | $b = ord($str[$i]);
1088 | if($b < 128 || $b > 191) { return false; }
1089 | $bits--;
1090 | }
1091 | }
1092 | }
1093 | return true;
1094 | }
1095 |
1096 | function get_display_size()
1097 | {
1098 | global $debug_object;
1099 |
1100 | $width = -1;
1101 | $height = -1;
1102 |
1103 | if ($this->tag !== 'img') {
1104 | return false;
1105 | }
1106 |
1107 | // See if there is aheight or width attribute in the tag itself.
1108 | if (isset($this->attr['width'])) {
1109 | $width = $this->attr['width'];
1110 | }
1111 |
1112 | if (isset($this->attr['height'])) {
1113 | $height = $this->attr['height'];
1114 | }
1115 |
1116 | // Now look for an inline style.
1117 | if (isset($this->attr['style'])) {
1118 | // Thanks to user gnarf from stackoverflow for this regular expression.
1119 | $attributes = array();
1120 |
1121 | preg_match_all(
1122 | '/([\w-]+)\s*:\s*([^;]+)\s*;?/',
1123 | $this->attr['style'],
1124 | $matches,
1125 | PREG_SET_ORDER
1126 | );
1127 |
1128 | foreach ($matches as $match) {
1129 | $attributes[$match[1]] = $match[2];
1130 | }
1131 |
1132 | // If there is a width in the style attributes:
1133 | if (isset($attributes['width']) && $width == -1) {
1134 | // check that the last two characters are px (pixels)
1135 | if (strtolower(substr($attributes['width'], -2)) === 'px') {
1136 | $proposed_width = substr($attributes['width'], 0, -2);
1137 | // Now make sure that it's an integer and not something stupid.
1138 | if (filter_var($proposed_width, FILTER_VALIDATE_INT)) {
1139 | $width = $proposed_width;
1140 | }
1141 | }
1142 | }
1143 |
1144 | // If there is a width in the style attributes:
1145 | if (isset($attributes['height']) && $height == -1) {
1146 | // check that the last two characters are px (pixels)
1147 | if (strtolower(substr($attributes['height'], -2)) == 'px') {
1148 | $proposed_height = substr($attributes['height'], 0, -2);
1149 | // Now make sure that it's an integer and not something stupid.
1150 | if (filter_var($proposed_height, FILTER_VALIDATE_INT)) {
1151 | $height = $proposed_height;
1152 | }
1153 | }
1154 | }
1155 |
1156 | }
1157 |
1158 | // Future enhancement:
1159 | // Look in the tag to see if there is a class or id specified that has
1160 | // a height or width attribute to it.
1161 |
1162 | // Far future enhancement
1163 | // Look at all the parent tags of this image to see if they specify a
1164 | // class or id that has an img selector that specifies a height or width
1165 | // Note that in this case, the class or id will have the img subselector
1166 | // for it to apply to the image.
1167 |
1168 | // ridiculously far future development
1169 | // If the class or id is specified in a SEPARATE css file thats not on
1170 | // the page, go get it and do what we were just doing for the ones on
1171 | // the page.
1172 |
1173 | $result = array(
1174 | 'height' => $height,
1175 | 'width' => $width
1176 | );
1177 |
1178 | return $result;
1179 | }
1180 |
1181 | function save($filepath = '')
1182 | {
1183 | $ret = $this->outertext();
1184 |
1185 | if ($filepath !== '') {
1186 | file_put_contents($filepath, $ret, LOCK_EX);
1187 | }
1188 |
1189 | return $ret;
1190 | }
1191 |
1192 | function addClass($class)
1193 | {
1194 | if (is_string($class)) {
1195 | $class = explode(' ', $class);
1196 | }
1197 |
1198 | if (is_array($class)) {
1199 | foreach($class as $c) {
1200 | if (isset($this->class)) {
1201 | if ($this->hasClass($c)) {
1202 | continue;
1203 | } else {
1204 | $this->class .= ' ' . $c;
1205 | }
1206 | } else {
1207 | $this->class = $c;
1208 | }
1209 | }
1210 | } else {
1211 | if (is_object($debug_object)) {
1212 | $debug_object->debug_log(2, 'Invalid type: ', gettype($class));
1213 | }
1214 | }
1215 | }
1216 |
1217 | function hasClass($class)
1218 | {
1219 | if (is_string($class)) {
1220 | if (isset($this->class)) {
1221 | return in_array($class, explode(' ', $this->class), true);
1222 | }
1223 | } else {
1224 | if (is_object($debug_object)) {
1225 | $debug_object->debug_log(2, 'Invalid type: ', gettype($class));
1226 | }
1227 | }
1228 |
1229 | return false;
1230 | }
1231 |
1232 | function removeClass($class = null)
1233 | {
1234 | if (!isset($this->class)) {
1235 | return;
1236 | }
1237 |
1238 | if (is_null($class)) {
1239 | $this->removeAttribute('class');
1240 | return;
1241 | }
1242 |
1243 | if (is_string($class)) {
1244 | $class = explode(' ', $class);
1245 | }
1246 |
1247 | if (is_array($class)) {
1248 | $class = array_diff(explode(' ', $this->class), $class);
1249 | if (empty($class)) {
1250 | $this->removeAttribute('class');
1251 | } else {
1252 | $this->class = implode(' ', $class);
1253 | }
1254 | }
1255 | }
1256 |
1257 | function getAllAttributes()
1258 | {
1259 | return $this->attr;
1260 | }
1261 |
1262 | function getAttribute($name)
1263 | {
1264 | return $this->__get($name);
1265 | }
1266 |
1267 | function setAttribute($name, $value)
1268 | {
1269 | $this->__set($name, $value);
1270 | }
1271 |
1272 | function hasAttribute($name)
1273 | {
1274 | return $this->__isset($name);
1275 | }
1276 |
1277 | function removeAttribute($name)
1278 | {
1279 | $this->__set($name, null);
1280 | }
1281 |
1282 | function remove()
1283 | {
1284 | if ($this->parent) {
1285 | $this->parent->removeChild($this);
1286 | }
1287 | }
1288 |
1289 | function removeChild($node)
1290 | {
1291 | $nidx = array_search($node, $this->nodes, true);
1292 | $cidx = array_search($node, $this->children, true);
1293 | $didx = array_search($node, $this->dom->nodes, true);
1294 |
1295 | if ($nidx !== false && $cidx !== false && $didx !== false) {
1296 |
1297 | foreach($node->children as $child) {
1298 | $node->removeChild($child);
1299 | }
1300 |
1301 | foreach($node->nodes as $entity) {
1302 | $enidx = array_search($entity, $node->nodes, true);
1303 | $edidx = array_search($entity, $node->dom->nodes, true);
1304 |
1305 | if ($enidx !== false && $edidx !== false) {
1306 | unset($node->nodes[$enidx]);
1307 | unset($node->dom->nodes[$edidx]);
1308 | }
1309 | }
1310 |
1311 | unset($this->nodes[$nidx]);
1312 | unset($this->children[$cidx]);
1313 | unset($this->dom->nodes[$didx]);
1314 |
1315 | $node->clear();
1316 |
1317 | }
1318 | }
1319 |
1320 | function getElementById($id)
1321 | {
1322 | return $this->find("#$id", 0);
1323 | }
1324 |
1325 | function getElementsById($id, $idx = null)
1326 | {
1327 | return $this->find("#$id", $idx);
1328 | }
1329 |
1330 | function getElementByTagName($name)
1331 | {
1332 | return $this->find($name, 0);
1333 | }
1334 |
1335 | function getElementsByTagName($name, $idx = null)
1336 | {
1337 | return $this->find($name, $idx);
1338 | }
1339 |
1340 | function parentNode()
1341 | {
1342 | return $this->parent();
1343 | }
1344 |
1345 | function childNodes($idx = -1)
1346 | {
1347 | return $this->children($idx);
1348 | }
1349 |
1350 | function firstChild()
1351 | {
1352 | return $this->first_child();
1353 | }
1354 |
1355 | function lastChild()
1356 | {
1357 | return $this->last_child();
1358 | }
1359 |
1360 | function nextSibling()
1361 | {
1362 | return $this->next_sibling();
1363 | }
1364 |
1365 | function previousSibling()
1366 | {
1367 | return $this->prev_sibling();
1368 | }
1369 |
1370 | function hasChildNodes()
1371 | {
1372 | return $this->has_child();
1373 | }
1374 |
1375 | function nodeName()
1376 | {
1377 | return $this->tag;
1378 | }
1379 |
1380 | function appendChild($node)
1381 | {
1382 | $node->parent($this);
1383 | return $node;
1384 | }
1385 |
1386 | }
1387 |
1388 | class simple_html_dom
1389 | {
1390 | public $root = null;
1391 | public $nodes = array();
1392 | public $callback = null;
1393 | public $lowercase = false;
1394 | public $original_size;
1395 | public $size;
1396 |
1397 | protected $pos;
1398 | protected $doc;
1399 | protected $char;
1400 |
1401 | protected $cursor;
1402 | protected $parent;
1403 | protected $noise = array();
1404 | protected $token_blank = " \t\r\n";
1405 | protected $token_equal = ' =/>';
1406 | protected $token_slash = " />\r\n\t";
1407 | protected $token_attr = ' >';
1408 |
1409 | public $_charset = '';
1410 | public $_target_charset = '';
1411 |
1412 | protected $default_br_text = '';
1413 |
1414 | public $default_span_text = '';
1415 |
1416 | protected $self_closing_tags = array(
1417 | 'area' => 1,
1418 | 'base' => 1,
1419 | 'br' => 1,
1420 | 'col' => 1,
1421 | 'embed' => 1,
1422 | 'hr' => 1,
1423 | 'img' => 1,
1424 | 'input' => 1,
1425 | 'link' => 1,
1426 | 'meta' => 1,
1427 | 'param' => 1,
1428 | 'source' => 1,
1429 | 'track' => 1,
1430 | 'wbr' => 1
1431 | );
1432 | protected $block_tags = array(
1433 | 'body' => 1,
1434 | 'div' => 1,
1435 | 'form' => 1,
1436 | 'root' => 1,
1437 | 'span' => 1,
1438 | 'table' => 1
1439 | );
1440 | protected $optional_closing_tags = array(
1441 | // Not optional, see
1442 | // https://www.w3.org/TR/html/textlevel-semantics.html#the-b-element
1443 | 'b' => array('b' => 1),
1444 | 'dd' => array('dd' => 1, 'dt' => 1),
1445 | // Not optional, see
1446 | // https://www.w3.org/TR/html/grouping-content.html#the-dl-element
1447 | 'dl' => array('dd' => 1, 'dt' => 1),
1448 | 'dt' => array('dd' => 1, 'dt' => 1),
1449 | 'li' => array('li' => 1),
1450 | 'optgroup' => array('optgroup' => 1, 'option' => 1),
1451 | 'option' => array('optgroup' => 1, 'option' => 1),
1452 | 'p' => array('p' => 1),
1453 | 'rp' => array('rp' => 1, 'rt' => 1),
1454 | 'rt' => array('rp' => 1, 'rt' => 1),
1455 | 'td' => array('td' => 1, 'th' => 1),
1456 | 'th' => array('td' => 1, 'th' => 1),
1457 | 'tr' => array('td' => 1, 'th' => 1, 'tr' => 1),
1458 | );
1459 |
1460 | function __construct(
1461 | $str = null,
1462 | $lowercase = true,
1463 | $forceTagsClosed = true,
1464 | $target_charset = DEFAULT_TARGET_CHARSET,
1465 | $stripRN = true,
1466 | $defaultBRText = DEFAULT_BR_TEXT,
1467 | $defaultSpanText = DEFAULT_SPAN_TEXT,
1468 | $options = 0)
1469 | {
1470 | if ($str) {
1471 | if (preg_match('/^http:\/\//i', $str) || is_file($str)) {
1472 | $this->load_file($str);
1473 | } else {
1474 | $this->load(
1475 | $str,
1476 | $lowercase,
1477 | $stripRN,
1478 | $defaultBRText,
1479 | $defaultSpanText,
1480 | $options
1481 | );
1482 | }
1483 | }
1484 | // Forcing tags to be closed implies that we don't trust the html, but
1485 | // it can lead to parsing errors if we SHOULD trust the html.
1486 | if (!$forceTagsClosed) {
1487 | $this->optional_closing_array = array();
1488 | }
1489 |
1490 | $this->_target_charset = $target_charset;
1491 | }
1492 |
1493 | function __destruct()
1494 | {
1495 | $this->clear();
1496 | }
1497 |
1498 | function load(
1499 | $str,
1500 | $lowercase = true,
1501 | $stripRN = true,
1502 | $defaultBRText = DEFAULT_BR_TEXT,
1503 | $defaultSpanText = DEFAULT_SPAN_TEXT,
1504 | $options = 0)
1505 | {
1506 | global $debug_object;
1507 |
1508 | // prepare
1509 | $this->prepare($str, $lowercase, $defaultBRText, $defaultSpanText);
1510 |
1511 | // Per sourceforge http://sourceforge.net/tracker/?func=detail&aid=2949097&group_id=218559&atid=1044037
1512 | // Script tags removal now preceeds style tag removal.
1513 | // strip out
199 |
200 |
201 |
202 |
203 |
204 |