mirror of
https://gitlab.com/niansa/qcommsy.git
synced 2025-03-06 20:53:33 +01:00
Compare commits
22 commits
1.0-stable
...
master
Author | SHA1 | Date | |
---|---|---|---|
|
0e823d333a | ||
|
b45564a408 | ||
|
f9b56f2f36 | ||
|
9b200f79c1 | ||
|
6f2c9286e2 | ||
|
c3d595f68b | ||
|
c56be2137f | ||
|
08a6dbc3c8 | ||
|
04e3532f6b | ||
|
da4990a7bc | ||
|
dee579771e | ||
|
9f5861b9f9 | ||
|
e1c1f26cce | ||
|
83b2ec15fa | ||
|
2b0a942557 | ||
|
51bc98e48e | ||
|
7393917d50 | ||
|
7877bcbbe2 | ||
|
ab3649739a | ||
|
f692d1fd15 | ||
|
eab9d27b0c | ||
|
2236997dba |
10 changed files with 1348 additions and 455 deletions
674
LICENSE.txt
Normal file
674
LICENSE.txt
Normal file
|
@ -0,0 +1,674 @@
|
|||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
QCommsy
|
||||
Copyright (C) 2020 niansa
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
QCommsy Copyright (C) 2020 niansa
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
|
@ -16,6 +16,8 @@ DEFINES += QT_DEPRECATED_WARNINGS
|
|||
#DEFINES += QT_DISABLE_DEPRECATED_BEFORE=0x060000 # disables all the APIs deprecated before Qt 6.0.0
|
||||
|
||||
SOURCES += \
|
||||
curlreq.cpp \
|
||||
libcommsy.cpp \
|
||||
main.cpp
|
||||
|
||||
HEADERS += \
|
||||
|
@ -30,8 +32,10 @@ FORMS += \
|
|||
overview.ui \
|
||||
postView.ui
|
||||
|
||||
LIBS += -lcurlpp -lcurl
|
||||
LIBS += -lgumbo
|
||||
LIBS += -lm -lcurl -lcurlpp \
|
||||
-lgumbo
|
||||
|
||||
DEFINES += GIT_CURRENT_SHA1="\\\"$(shell git -C \""$$_PRO_FILE_PWD_"\" describe)\\\""
|
||||
|
||||
# Default rules for deployment.
|
||||
qnx: target.path = /tmp/$${TARGET}/bin
|
||||
|
|
45
curlreq.cpp
Normal file
45
curlreq.cpp
Normal file
|
@ -0,0 +1,45 @@
|
|||
/*
|
||||
QCommsy
|
||||
Copyright (C) 2020 niansa
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
#include <sstream>
|
||||
|
||||
#include <curlpp/cURLpp.hpp>
|
||||
#include <curlpp/Easy.hpp>
|
||||
#include <curlpp/Infos.hpp>
|
||||
#include <curlpp/Options.hpp>
|
||||
|
||||
long curlreq(std::stringstream &responsebuffer, std::string SID, std::string URL) {
|
||||
std::cout << "Connection details begin" << std::endl;
|
||||
std::cout << "URL: " << URL << std::endl;
|
||||
std::cout << "SID: " << SID << std::endl;
|
||||
std::cout << "Connection details end" << std::endl;
|
||||
// Initialise variables
|
||||
curlpp::Cleanup cleaner;
|
||||
curlpp::Easy request;
|
||||
// Set the writer callback to enable cURL to write result in a memory area
|
||||
request.setOpt(new curlpp::options::WriteStream(&responsebuffer));
|
||||
// Setting the URL to retrive.
|
||||
request.setOpt(new curlpp::options::Url(URL));
|
||||
// Set SID cookie
|
||||
std::list<std::string> header;
|
||||
header.push_back("Cookie: SID=" + SID);
|
||||
request.setOpt(new curlpp::options::HttpHeader(header));
|
||||
// Perform request
|
||||
request.perform();
|
||||
// Return result
|
||||
return curlpp::infos::ResponseCode::get(request);
|
||||
}
|
19
info.ui
19
info.ui
|
@ -16,7 +16,7 @@
|
|||
<widget class="QWidget" name="centralwidget">
|
||||
<layout class="QVBoxLayout" name="verticalLayout">
|
||||
<item>
|
||||
<spacer name="verticalSpacer_2">
|
||||
<spacer name="verticalSpacer">
|
||||
<property name="orientation">
|
||||
<enum>Qt::Vertical</enum>
|
||||
</property>
|
||||
|
@ -39,7 +39,7 @@
|
|||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<spacer name="verticalSpacer">
|
||||
<spacer name="verticalSpacer_2">
|
||||
<property name="orientation">
|
||||
<enum>Qt::Vertical</enum>
|
||||
</property>
|
||||
|
@ -51,6 +51,21 @@
|
|||
</property>
|
||||
</spacer>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="font">
|
||||
<font>
|
||||
<pointsize>6</pointsize>
|
||||
</font>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string><html><head/><body><p>QCommsy<br/>Copyright (C) 2020 niansa<br/><br/><br/>This program is free software: you can redistribute it and/or modify<br/>it under the terms of the GNU General Public License as published by<br/>the Free Software Foundation, either version 3 of the License, or<br/>(at your option) any later version.<br/><br/><br/>This program is distributed in the hope that it will be useful,<br/>but WITHOUT ANY WARRANTY; without even the implied warranty of<br/>MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the<br/>GNU General Public License for more details.<br/><br/><br/>You should have received a copy of the GNU General Public License<br/>along with this program. If not, see &lt;<a href="http://www.gnu.org/licenses/"><span style=" text-decoration: underline; color:#007af4;">http://www.gnu.org/licenses/</span></a>&gt;.</p></body></html></string>
|
||||
</property>
|
||||
<property name="wordWrap">
|
||||
<bool>true</bool>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="buildDateInfo">
|
||||
<property name="font">
|
||||
|
|
433
libcommsy.cpp
Normal file
433
libcommsy.cpp
Normal file
|
@ -0,0 +1,433 @@
|
|||
/*
|
||||
QCommsy
|
||||
Copyright (C) 2020 niansa
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
#include <iostream>
|
||||
#include <string>
|
||||
#include <sstream>
|
||||
#include <fstream>
|
||||
#include <vector>
|
||||
#include <map>
|
||||
#include <regex>
|
||||
#include <exception>
|
||||
|
||||
#include <csignal>
|
||||
#include <cstdio>
|
||||
#include <unistd.h>
|
||||
|
||||
#include <gumbo.h>
|
||||
|
||||
#include "libcommsy.hpp"
|
||||
|
||||
|
||||
|
||||
std::string ltrim(const std::string& s) {
|
||||
static const std::regex lws{"^[[:space:]]*", std::regex_constants::extended};
|
||||
return std::regex_replace(s, lws, "");
|
||||
}
|
||||
std::string rtrim(const std::string& s) {
|
||||
static const std::regex tws{"[[:space:]]*$", std::regex_constants::extended};
|
||||
return std::regex_replace(s, tws, "");
|
||||
}
|
||||
std::string trim(const std::string& s) {
|
||||
return ltrim(rtrim(s));
|
||||
}
|
||||
|
||||
std::string get_filename(const std::string& path) {
|
||||
return path.substr(path.find_last_of("/\\") + 1);
|
||||
}
|
||||
|
||||
std::string clean_spaces(const std::string& s) {
|
||||
static const std::regex tws{"[ ]{2,}", std::regex_constants::extended};
|
||||
std::string newstr = std::regex_replace(s, tws, "");
|
||||
std::replace(newstr.begin(), newstr.end(), '\n', ' ');
|
||||
newstr.erase(0, 4);
|
||||
return newstr;
|
||||
}
|
||||
|
||||
std::vector<std::string> merge_strvects(std::vector<std::string> base, const std::vector<std::string> &addition) {
|
||||
base.insert(base.end(), addition.begin(), addition.end());
|
||||
return base;
|
||||
}
|
||||
|
||||
extern long curlreq(std::stringstream &responsebuffer, std::string SID, std::string URL);
|
||||
|
||||
void gumbo_search_by_attr(std::vector<GumboNode *> *elemvect, GumboNode* node, const std::string& attrname, const std::string& searchword, const GumboTag& expectedtag) {
|
||||
if (node->type != GUMBO_NODE_ELEMENT) {
|
||||
return;
|
||||
}
|
||||
|
||||
GumboAttribute* hclass;
|
||||
if (node->v.element.tag == expectedtag &&
|
||||
(hclass = gumbo_get_attribute(&node->v.element.attributes, attrname.c_str()))) {
|
||||
if (hclass->value == searchword) {
|
||||
elemvect->push_back(node);
|
||||
}
|
||||
}
|
||||
|
||||
GumboVector* children = &node->v.element.children;
|
||||
for (unsigned int i = 0; i < children->length; ++i) {
|
||||
gumbo_search_by_attr(elemvect, static_cast<GumboNode*>(children->data[i]), attrname, searchword, expectedtag);
|
||||
}
|
||||
}
|
||||
|
||||
inline void gumbo_search_by_class(std::vector<GumboNode *> *elemvect, GumboNode* node, const std::string& searchword, const GumboTag& expectedtag) {
|
||||
return gumbo_search_by_attr(elemvect, node, "class", searchword, expectedtag);
|
||||
}
|
||||
|
||||
GumboNode *gumbo_search_by_id(GumboNode* node, const std::string& searchword, const GumboTag& expectedtag) {
|
||||
std::vector<GumboNode *> elemvect;
|
||||
gumbo_search_by_attr(&elemvect, node, "id", searchword, expectedtag);
|
||||
// Use first node found
|
||||
if (elemvect.size() > 0) {
|
||||
return elemvect[0];
|
||||
}
|
||||
// If no nodes were found, panic()
|
||||
throw libCommsy::scrapError();
|
||||
}
|
||||
|
||||
void gumbo_search_by_tag(std::vector<GumboNode *> *elemvect, GumboNode* node, const GumboTag& searchedtag) {
|
||||
if (node->type != GUMBO_NODE_ELEMENT) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (node->v.element.tag == searchedtag) {
|
||||
elemvect->push_back(node);
|
||||
}
|
||||
|
||||
GumboVector* children = &node->v.element.children;
|
||||
for (unsigned int i = 0; i < children->length; ++i) {
|
||||
gumbo_search_by_tag(elemvect, static_cast<GumboNode*>(children->data[i]), searchedtag);
|
||||
}
|
||||
}
|
||||
|
||||
std::string gumbo_cleantext(GumboNode* node) {
|
||||
if (node->type == GUMBO_NODE_TEXT) {
|
||||
return std::string(node->v.text.text);
|
||||
|
||||
} else if (node->type == GUMBO_NODE_ELEMENT &&
|
||||
node->v.element.tag != GUMBO_TAG_SCRIPT &&
|
||||
node->v.element.tag != GUMBO_TAG_STYLE) {
|
||||
|
||||
std::string contents = "";
|
||||
GumboVector* children = &node->v.element.children;
|
||||
|
||||
for (unsigned int i = 0; i < children->length; ++i) {
|
||||
const std::string text = gumbo_cleantext(reinterpret_cast<GumboNode*> (children->data[i]));
|
||||
if (i != 0 && !text.empty()) {
|
||||
contents.append(" ");
|
||||
}
|
||||
contents.append(text);
|
||||
}
|
||||
|
||||
return contents;
|
||||
|
||||
} else {
|
||||
return "";
|
||||
}
|
||||
}
|
||||
|
||||
std::vector<std::string> gumbo_get_attr(GumboNode *node, const std::string& attrkey, const GumboTag& expected_tag) {
|
||||
std::vector<std::string> attrvals;
|
||||
GumboNode *childnode;
|
||||
GumboVector* children = &node->v.element.children;
|
||||
std::vector<std::string> toappend;
|
||||
|
||||
// Check if current element is already the right one
|
||||
if (node->v.element.tag == expected_tag) {
|
||||
// Return this elements wanted attribute key
|
||||
return {gumbo_get_attribute(&node->v.element.attributes, attrkey.c_str())->value};
|
||||
}
|
||||
|
||||
// Check if This is a node element
|
||||
else if (node->type != GUMBO_NODE_ELEMENT) {
|
||||
return {};
|
||||
}
|
||||
|
||||
// Iterate through child nodes
|
||||
for (unsigned int it = 0; it < children->length; ++it) {
|
||||
childnode = reinterpret_cast<GumboNode*> (children->data[it]);
|
||||
if (childnode->v.element.tag == expected_tag) { // If node is the expected tag; use it
|
||||
attrvals.push_back(gumbo_get_attribute(&childnode->v.element.attributes, attrkey.c_str())->value);
|
||||
} else if (childnode->type == GUMBO_NODE_ELEMENT) { // Else; iterate through its child nodes
|
||||
toappend = gumbo_get_attr(childnode, attrkey, expected_tag);
|
||||
attrvals = merge_strvects(attrvals, toappend);
|
||||
}
|
||||
}
|
||||
|
||||
// Return the final result
|
||||
return attrvals;
|
||||
}
|
||||
|
||||
std::string gumbo_find_text_by_tag(GumboNode *node, const GumboTag& searchtag) {
|
||||
GumboNode *childnode;
|
||||
GumboVector* children = &node->v.element.children;
|
||||
|
||||
// Iterate through childs
|
||||
for (unsigned int it = 0; it < children->length; ++it) {
|
||||
childnode = reinterpret_cast<GumboNode*> (children->data[it]);
|
||||
if (childnode->v.element.tag == searchtag) { // If node is the expected tag; check content
|
||||
return trim(gumbo_cleantext(childnode));
|
||||
}
|
||||
}
|
||||
|
||||
throw libCommsy::scrapError();
|
||||
}
|
||||
|
||||
|
||||
namespace libCommsyLowlevel {
|
||||
auto get_posts(GumboNode *node) {
|
||||
std::vector<GumboNode *> posts;
|
||||
gumbo_search_by_class(&posts, node, "uk-comment", GUMBO_TAG_ARTICLE);
|
||||
return posts;
|
||||
}
|
||||
|
||||
std::string get_post_name(GumboNode *node) {
|
||||
std::vector<GumboNode *> titlenodes;
|
||||
gumbo_search_by_class(&titlenodes, node, "uk-comment-title", GUMBO_TAG_H4);
|
||||
if (titlenodes.empty())
|
||||
throw libCommsy::scrapError();
|
||||
return trim(gumbo_cleantext(titlenodes[0]));
|
||||
}
|
||||
|
||||
std::string get_post_id(GumboNode *node) {
|
||||
return gumbo_get_attr(node, "data-item-id", GUMBO_TAG_ARTICLE)[0];
|
||||
}
|
||||
|
||||
std::string get_post_meta(GumboNode *node) {
|
||||
std::vector<GumboNode *> metanodes;
|
||||
gumbo_search_by_class(&metanodes, node, "uk-comment-meta", GUMBO_TAG_DIV);
|
||||
if (metanodes.size() < 2)
|
||||
throw libCommsy::scrapError();
|
||||
return clean_spaces(trim(gumbo_cleantext(metanodes[1])));
|
||||
}
|
||||
|
||||
std::string get_post_url(GumboNode *node) {
|
||||
std::vector<GumboNode *> urlnodes;
|
||||
gumbo_search_by_class(&urlnodes, node, "uk-comment-title", GUMBO_TAG_H4);
|
||||
if (urlnodes.empty())
|
||||
throw libCommsy::scrapError();
|
||||
return gumbo_get_attr(urlnodes[0], "href", GUMBO_TAG_A)[0];
|
||||
}
|
||||
|
||||
bool get_post_unread(GumboNode *node) {
|
||||
std::vector<GumboNode *> elems;
|
||||
gumbo_search_by_class(&elems, node, "cs-comment-change-info", GUMBO_TAG_DIV);
|
||||
return !elems.empty();
|
||||
}
|
||||
|
||||
taskState::type get_post_taskState(GumboNode *node) {
|
||||
// Find all elements that could contain the information we need and grab their "class" attribute
|
||||
std::vector<std::string> divClassAttrs;
|
||||
divClassAttrs = gumbo_get_attr(node, "class", GUMBO_TAG_I);
|
||||
|
||||
// Try to find the information we need
|
||||
for (const auto& classAttr : divClassAttrs) {
|
||||
if (classAttr.find("todo") != std::string::npos) {
|
||||
return taskState::todo;
|
||||
} else if (classAttr.find("inProgress") != std::string::npos) {
|
||||
return taskState::inProgress;
|
||||
} else if (classAttr.find("done") != std::string::npos) {
|
||||
return taskState::done;
|
||||
}
|
||||
}
|
||||
|
||||
return taskState::none;
|
||||
}
|
||||
|
||||
std::vector<std::map<std::string, std::string>> get_post_files(GumboNode *node) {
|
||||
std::vector<GumboNode *> metanodes;
|
||||
std::vector<std::string> fileurls;
|
||||
std::vector<std::string> filenames;
|
||||
std::vector<std::map<std::string, std::string>> filenameurlmap;
|
||||
std::map<std::string, std::string> tmpmap;
|
||||
|
||||
// Get meta nodes
|
||||
gumbo_search_by_class(&metanodes, node, "uk-comment-meta", GUMBO_TAG_DIV);
|
||||
// Get URLs
|
||||
fileurls = gumbo_get_attr(metanodes[2], "href", GUMBO_TAG_A);
|
||||
// Get filenames
|
||||
filenames = gumbo_get_attr(metanodes[2], "title", GUMBO_TAG_A);
|
||||
|
||||
// Generate map
|
||||
auto urlit = fileurls.begin();
|
||||
auto nameit = filenames.begin();
|
||||
while (true) {
|
||||
|
||||
// Break if last item was reached
|
||||
if (urlit == fileurls.end() or nameit == filenames.end()) {
|
||||
break;
|
||||
}
|
||||
|
||||
// Generate temporary map
|
||||
tmpmap = {};
|
||||
tmpmap[*nameit] = *urlit;
|
||||
// Append it to the result vector map
|
||||
filenameurlmap.push_back(tmpmap);
|
||||
// Get next item in both vectors
|
||||
urlit++; nameit++;
|
||||
}
|
||||
return filenameurlmap;
|
||||
}
|
||||
|
||||
std::string get_post_desc(const std::string& post_url, const std::string& server_sid) {
|
||||
std::string material_id;
|
||||
std::stringstream httpcontent;
|
||||
GumboOutput *post_document;
|
||||
GumboNode *desc_node;
|
||||
std::vector<GumboNode *> results;
|
||||
|
||||
// Get material ID
|
||||
material_id = get_filename(post_url);
|
||||
// Download post
|
||||
long statuscode = curlreq(httpcontent, server_sid, post_url);
|
||||
// Check statuscode
|
||||
if (statuscode != 200) {
|
||||
throw libCommsy::descDownloadError();
|
||||
}
|
||||
|
||||
// Parse post
|
||||
post_document = gumbo_parse(httpcontent.str().c_str());
|
||||
// Get description element
|
||||
desc_node = gumbo_search_by_id(post_document->root, "description" + material_id, GUMBO_TAG_DIV);
|
||||
// Extract description
|
||||
gumbo_search_by_tag(&results, desc_node, GUMBO_TAG_P);
|
||||
|
||||
// Cencenate occurencies
|
||||
std::string result_string;
|
||||
for (const auto& result : results) {
|
||||
result_string.append(trim(gumbo_cleantext(result)) + "\n");
|
||||
}
|
||||
|
||||
// Return first occurence
|
||||
return result_string;
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
using namespace libCommsyLowlevel;
|
||||
// Class functions
|
||||
bool libCommsy::postExists(unsigned long postID) {
|
||||
return postID < numposts;
|
||||
}
|
||||
|
||||
commsyPost *libCommsy::getPost(unsigned long postID) {
|
||||
// Check if post exists
|
||||
if (not postExists(postID)) {
|
||||
throw invalidPostError();
|
||||
}
|
||||
// Return post pointer
|
||||
return &posts[postID];
|
||||
}
|
||||
|
||||
std::string *libCommsy::getDescription(unsigned long postID) {
|
||||
// Get post
|
||||
commsyPost *thispost = getPost(postID);
|
||||
|
||||
// Check if post description was downloaded already
|
||||
if (thispost->description == "\xFF") {
|
||||
// Download post
|
||||
thispost->description = get_post_desc(server_url + thispost->url, server_sid);
|
||||
}
|
||||
|
||||
// Return it
|
||||
return &thispost->description;
|
||||
}
|
||||
|
||||
libCommsy::libCommsy(const std::string& _server_url, const std::string& _server_sid, const std::string& room, const std::string start_id, const unsigned long max_posts) {
|
||||
// Define required variables
|
||||
server_url = _server_url;
|
||||
server_sid = _server_sid;
|
||||
lastID = start_id;
|
||||
std::stringstream httpcontent;
|
||||
GumboOutput *document;
|
||||
long statuscode;
|
||||
numposts = 0;
|
||||
|
||||
// Loop until all or max_posts posts are fetched
|
||||
while (1) {
|
||||
// Check connection and download feed
|
||||
try {
|
||||
statuscode = curlreq(httpcontent, server_sid, server_url + "/room/" + room + "/feed/0/date?lastId=" + lastID);
|
||||
} catch (std::exception&) {
|
||||
throw connectionFailError();
|
||||
}
|
||||
if (statuscode == 302) {
|
||||
throw invalidSIDError();
|
||||
} else if (statuscode == 500) {
|
||||
throw invalidRoomError();
|
||||
} else if (statuscode != 200) {
|
||||
std::cout << "Unhandled status code " << statuscode << std::endl;
|
||||
throw connectionFailError();
|
||||
}
|
||||
|
||||
// Initialise document
|
||||
document = gumbo_parse(httpcontent.str().c_str());
|
||||
|
||||
// Get posts
|
||||
auto gumboPosts = get_posts(document->root);
|
||||
if (gumboPosts.size() == 0) {
|
||||
// Stop fetching more data
|
||||
return;
|
||||
}
|
||||
|
||||
// Map posts and their corresponding URL to a number
|
||||
for (auto it = gumboPosts.begin(); it != gumboPosts.end(); it++) {
|
||||
// Create post struct
|
||||
commsyPost thispost;
|
||||
{
|
||||
// Get posts name
|
||||
thispost.name = get_post_name(*it);
|
||||
// Get posts ID
|
||||
thispost.id = get_post_id(*it);
|
||||
// Get posts meta string
|
||||
thispost.meta = get_post_meta(*it);
|
||||
// Get if post is unread
|
||||
thispost.unread = get_post_unread(*it);
|
||||
// Get posts task state
|
||||
thispost.taskState = get_post_taskState(*it);
|
||||
// Get posts URL
|
||||
thispost.url = get_post_url(*it);
|
||||
// Get posts files
|
||||
auto files = get_post_files(*it);
|
||||
for (const auto& filemap : files) {
|
||||
for (const auto& [filename, fileurl] : filemap) {
|
||||
commsyFile thisfile;
|
||||
{
|
||||
thisfile.name = filename;
|
||||
thisfile.url = fileurl;
|
||||
}
|
||||
thispost.files.push_back(thisfile);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Append to posts vector
|
||||
posts.push_back(thispost);
|
||||
// Increment post counter
|
||||
numposts++;
|
||||
// Get lastID
|
||||
lastID = posts.back().id;
|
||||
// Check if maximum amount of posts to load was exceeded
|
||||
if (max_posts != 0 and numposts >= max_posts) {
|
||||
// Stop loading more posts
|
||||
return;
|
||||
}
|
||||
}
|
||||
// Clear buffer just in case we need it later
|
||||
httpcontent.str(std::string());
|
||||
}
|
||||
}
|
441
libcommsy.hpp
441
libcommsy.hpp
|
@ -1,305 +1,27 @@
|
|||
#include <iostream>
|
||||
/*
|
||||
QCommsy
|
||||
Copyright (C) 2020 niansa
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
#include <string>
|
||||
#include <sstream>
|
||||
#include <fstream>
|
||||
#include <vector>
|
||||
#include <map>
|
||||
#include <regex>
|
||||
#include <exception>
|
||||
|
||||
#include <csignal>
|
||||
#include <cstdio>
|
||||
#include <unistd.h>
|
||||
|
||||
#include <curlpp/cURLpp.hpp>
|
||||
#include <curlpp/Easy.hpp>
|
||||
#include <curlpp/Infos.hpp>
|
||||
#include <curlpp/Options.hpp>
|
||||
|
||||
#include <gumbo.h>
|
||||
|
||||
class invalidSIDError {};
|
||||
class invalidRoomError {};
|
||||
class invalidPostError {};
|
||||
class connectionFailError {};
|
||||
class parsingNoSuchIDError {};
|
||||
class parsingNoSuchTagError {};
|
||||
class descDownloadError {};
|
||||
|
||||
|
||||
static std::string server_url;
|
||||
static std::string server_sid;
|
||||
static std::string room;
|
||||
|
||||
|
||||
std::string ltrim(const std::string& s) {
|
||||
static const std::regex lws{"^[[:space:]]*", std::regex_constants::extended};
|
||||
return std::regex_replace(s, lws, "");
|
||||
}
|
||||
std::string rtrim(const std::string& s) {
|
||||
static const std::regex tws{"[[:space:]]*$", std::regex_constants::extended};
|
||||
return std::regex_replace(s, tws, "");
|
||||
}
|
||||
std::string trim(const std::string& s) {
|
||||
return ltrim(rtrim(s));
|
||||
}
|
||||
|
||||
std::string get_filename(const std::string& path) {
|
||||
return path.substr(path.find_last_of("/\\") + 1);
|
||||
}
|
||||
|
||||
std::string clean_spaces(const std::string& s) {
|
||||
static const std::regex tws{"[ ]{2,}", std::regex_constants::extended};
|
||||
std::string newstr = std::regex_replace(s, tws, "");
|
||||
std::replace(newstr.begin(), newstr.end(), '\n', ' ');
|
||||
newstr.erase(0, 4);
|
||||
return newstr;
|
||||
}
|
||||
|
||||
std::vector<std::string> merge_strvects(std::vector<std::string> base, const std::vector<std::string> &addition) {
|
||||
base.insert(base.end(), addition.begin(), addition.end());
|
||||
return base;
|
||||
}
|
||||
|
||||
static long curlreq(std::stringstream &responsebuffer, std::string SID, std::string URL) {
|
||||
std::cout << "Connection details begin" << std::endl;
|
||||
std::cout << "URL: " << URL << std::endl;
|
||||
std::cout << "SID: " << SID << std::endl;
|
||||
std::cout << "Connection details end" << std::endl;
|
||||
// Initialise variables
|
||||
curlpp::Cleanup cleaner;
|
||||
curlpp::Easy request;
|
||||
// Set the writer callback to enable cURL to write result in a memory area
|
||||
request.setOpt(new curlpp::options::WriteStream(&responsebuffer));
|
||||
// Setting the URL to retrive.
|
||||
request.setOpt(new curlpp::options::Url(URL));
|
||||
// Set SID cookie
|
||||
std::list<std::string> header;
|
||||
header.push_back("Cookie: SID=" + SID);
|
||||
request.setOpt(new curlpp::options::HttpHeader(header));
|
||||
// Perform request
|
||||
request.perform();
|
||||
// Return result
|
||||
return curlpp::infos::ResponseCode::get(request);
|
||||
}
|
||||
|
||||
void gumbo_search_by_attr(std::vector<GumboNode *> &elemvect, GumboNode* node, std::string attrname, std::string searchword, GumboTag expectedtag) {
|
||||
if (node->type != GUMBO_NODE_ELEMENT) {
|
||||
return;
|
||||
}
|
||||
|
||||
GumboAttribute* hclass;
|
||||
if (node->v.element.tag == expectedtag &&
|
||||
(hclass = gumbo_get_attribute(&node->v.element.attributes, attrname.c_str()))) {
|
||||
if (hclass->value == searchword) {
|
||||
elemvect.push_back(node);
|
||||
}
|
||||
}
|
||||
|
||||
GumboVector* children = &node->v.element.children;
|
||||
for (unsigned int i = 0; i < children->length; ++i) {
|
||||
gumbo_search_by_attr(elemvect, static_cast<GumboNode*>(children->data[i]), attrname, searchword, expectedtag);
|
||||
}
|
||||
}
|
||||
|
||||
void gumbo_search_by_class(std::vector<GumboNode *> &elemvect, GumboNode* node, std::string searchword, GumboTag expectedtag) {
|
||||
return gumbo_search_by_attr(elemvect, node, "class", searchword, expectedtag);
|
||||
}
|
||||
|
||||
GumboNode *gumbo_search_by_id(GumboNode* node, std::string searchword, GumboTag expectedtag) {
|
||||
std::vector<GumboNode *> elemvect;
|
||||
gumbo_search_by_attr(elemvect, node, "id", searchword, expectedtag);
|
||||
// Use first node found
|
||||
if (elemvect.size() > 0) {
|
||||
return elemvect[0];
|
||||
}
|
||||
// If no nodes were found, panic()
|
||||
throw parsingNoSuchIDError();
|
||||
}
|
||||
|
||||
void gumbo_search_by_tag(std::vector<GumboNode *> &elemvect, GumboNode* node, GumboTag searchedtag) {
|
||||
if (node->type != GUMBO_NODE_ELEMENT) {
|
||||
return;
|
||||
}
|
||||
|
||||
if (node->v.element.tag == searchedtag) {
|
||||
elemvect.push_back(node);
|
||||
}
|
||||
|
||||
GumboVector* children = &node->v.element.children;
|
||||
for (unsigned int i = 0; i < children->length; ++i) {
|
||||
gumbo_search_by_tag(elemvect, static_cast<GumboNode*>(children->data[i]), searchedtag);
|
||||
}
|
||||
}
|
||||
|
||||
static std::string gumbo_cleantext(GumboNode* node) {
|
||||
if (node->type == GUMBO_NODE_TEXT) {
|
||||
return std::string(node->v.text.text);
|
||||
|
||||
} else if (node->type == GUMBO_NODE_ELEMENT &&
|
||||
node->v.element.tag != GUMBO_TAG_SCRIPT &&
|
||||
node->v.element.tag != GUMBO_TAG_STYLE) {
|
||||
|
||||
std::string contents = "";
|
||||
GumboVector* children = &node->v.element.children;
|
||||
|
||||
for (unsigned int i = 0; i < children->length; ++i) {
|
||||
const std::string text = gumbo_cleantext(reinterpret_cast<GumboNode*> (children->data[i]));
|
||||
if (i != 0 && !text.empty()) {
|
||||
contents.append(" ");
|
||||
}
|
||||
contents.append(text);
|
||||
}
|
||||
|
||||
return contents;
|
||||
|
||||
} else {
|
||||
return "";
|
||||
}
|
||||
}
|
||||
|
||||
std::vector<std::string> gumbo_get_attr(GumboNode *node, std::string attrkey, GumboTag expected_tag) {
|
||||
std::vector<std::string> attrvals;
|
||||
GumboNode *childnode;
|
||||
GumboVector* children = &node->v.element.children;
|
||||
std::vector<std::string> toappend;
|
||||
|
||||
// Check if current element is already the right one
|
||||
if (node->v.element.tag == expected_tag) {
|
||||
// Return this elements wanted attribute key
|
||||
return {gumbo_get_attribute(&node->v.element.attributes, attrkey.c_str())->value};
|
||||
}
|
||||
|
||||
// Check if This is a node element
|
||||
else if (node->type != GUMBO_NODE_ELEMENT) {
|
||||
return {};
|
||||
}
|
||||
|
||||
// Iterate through child nodes
|
||||
for (unsigned int it = 0; it < children->length; ++it) {
|
||||
childnode = reinterpret_cast<GumboNode*> (children->data[it]);
|
||||
if (childnode->v.element.tag == expected_tag) { // If node is the expected tag; use it
|
||||
attrvals.push_back(gumbo_get_attribute(&childnode->v.element.attributes, attrkey.c_str())->value);
|
||||
} else if (childnode->type == GUMBO_NODE_ELEMENT) { // Else; iterate through its child nodes
|
||||
toappend = gumbo_get_attr(childnode, attrkey, expected_tag);
|
||||
attrvals = merge_strvects(attrvals, toappend);
|
||||
}
|
||||
}
|
||||
|
||||
// Return the final result
|
||||
return attrvals;
|
||||
}
|
||||
|
||||
std::string gumbo_find_text_by_tag(GumboNode *node, GumboTag searchtag) {
|
||||
GumboNode *childnode;
|
||||
GumboVector* children = &node->v.element.children;
|
||||
|
||||
// Iterate through childs
|
||||
for (unsigned int it = 0; it < children->length; ++it) {
|
||||
childnode = reinterpret_cast<GumboNode*> (children->data[it]);
|
||||
if (childnode->v.element.tag == searchtag) { // If node is the expected tag; check content
|
||||
return trim(gumbo_cleantext(childnode));
|
||||
}
|
||||
}
|
||||
|
||||
throw parsingNoSuchTagError();
|
||||
}
|
||||
|
||||
|
||||
auto get_posts(GumboNode *node) {
|
||||
std::vector<GumboNode *> posts;
|
||||
gumbo_search_by_class(posts, node, "uk-comment", GUMBO_TAG_ARTICLE);
|
||||
return posts;
|
||||
}
|
||||
|
||||
std::string get_post_name(GumboNode *node) {
|
||||
std::vector<GumboNode *> titlenodes;
|
||||
gumbo_search_by_class(titlenodes, node, "uk-comment-title", GUMBO_TAG_H4);
|
||||
return trim(gumbo_cleantext(titlenodes[0]));
|
||||
}
|
||||
|
||||
std::string get_post_id(GumboNode *node) {
|
||||
return gumbo_get_attr(node, "data-item-id", GUMBO_TAG_ARTICLE)[0];
|
||||
}
|
||||
|
||||
std::string get_post_meta(GumboNode *node) {
|
||||
std::vector<GumboNode *> metanodes;
|
||||
gumbo_search_by_class(metanodes, node, "uk-comment-meta", GUMBO_TAG_DIV);
|
||||
return clean_spaces(trim(gumbo_cleantext(metanodes[1])));
|
||||
}
|
||||
|
||||
std::string get_post_url(GumboNode *node) {
|
||||
std::vector<GumboNode *> titlenodes;
|
||||
gumbo_search_by_class(titlenodes, node, "uk-comment-title", GUMBO_TAG_H4);
|
||||
return gumbo_get_attr(titlenodes[0], "href", GUMBO_TAG_A)[0];
|
||||
}
|
||||
|
||||
std::vector<std::map<std::string, std::string>> get_post_files(GumboNode *node) {
|
||||
std::vector<GumboNode *> metanodes;
|
||||
std::vector<std::string> fileurls;
|
||||
std::vector<std::string> filenames;
|
||||
std::vector<std::map<std::string, std::string>> filenameurlmap;
|
||||
std::map<std::string, std::string> tmpmap;
|
||||
|
||||
// Get meta nodes
|
||||
gumbo_search_by_class(metanodes, node, "uk-comment-meta", GUMBO_TAG_DIV);
|
||||
// Get URLs
|
||||
fileurls = gumbo_get_attr(metanodes[2], "href", GUMBO_TAG_A);
|
||||
// Get filenames
|
||||
filenames = gumbo_get_attr(metanodes[2], "title", GUMBO_TAG_A);
|
||||
|
||||
// Generate map
|
||||
auto urlit = fileurls.begin();
|
||||
auto nameit = filenames.begin();
|
||||
while (true) {
|
||||
|
||||
// Break if last item was reached
|
||||
if (urlit == fileurls.end() or nameit == filenames.end()) {
|
||||
break;
|
||||
}
|
||||
|
||||
// Generate temporary map
|
||||
tmpmap = {};
|
||||
tmpmap[*nameit] = *urlit;
|
||||
// Append it to the result vector map
|
||||
filenameurlmap.push_back(tmpmap);
|
||||
// Get next item in both vectors
|
||||
urlit++; nameit++;
|
||||
}
|
||||
return filenameurlmap;
|
||||
}
|
||||
|
||||
std::string get_post_desc(std::string post_url) {
|
||||
std::string material_id;
|
||||
std::stringstream httpcontent;
|
||||
GumboOutput *post_document;
|
||||
GumboNode *desc_node;
|
||||
std::vector<GumboNode *> results;
|
||||
|
||||
// Get material ID
|
||||
material_id = get_filename(post_url);
|
||||
// Download post
|
||||
long statuscode = curlreq(httpcontent, server_sid, post_url);
|
||||
// Check statuscode
|
||||
if (statuscode != 200) {
|
||||
throw descDownloadError();
|
||||
}
|
||||
|
||||
// Parse post
|
||||
post_document = gumbo_parse(httpcontent.str().c_str());
|
||||
// Get description element
|
||||
desc_node = gumbo_search_by_id(post_document->root, "description" + material_id, GUMBO_TAG_DIV);
|
||||
// Extract description
|
||||
gumbo_search_by_tag(results, desc_node, GUMBO_TAG_P);
|
||||
|
||||
// Cencenate occurencies
|
||||
std::string result_string;
|
||||
for (auto it = results.begin(); it != results.end(); it++) {
|
||||
result_string.append(trim(gumbo_cleantext(*it)) + "\n");
|
||||
}
|
||||
|
||||
// Return first occurence
|
||||
return result_string;
|
||||
namespace taskState {
|
||||
enum type {none, done, inProgress, todo};
|
||||
}
|
||||
|
||||
|
||||
|
@ -311,125 +33,42 @@ struct commsyFile {
|
|||
struct commsyPost {
|
||||
std::string name;
|
||||
std::string id;
|
||||
std::string description;
|
||||
std::string description = "\xFF";
|
||||
std::string meta;
|
||||
std::string url;
|
||||
bool unread;
|
||||
taskState::type taskState;
|
||||
std::vector<commsyFile> files;
|
||||
};
|
||||
|
||||
|
||||
#define libCommsy_NAME "libcommsy"
|
||||
#define libCommsy_VERSION "1.1-stable"
|
||||
#define libCommsy_VERSION "1.4-stable"
|
||||
class libCommsy {
|
||||
public:
|
||||
std::vector<commsyPost> posts;
|
||||
unsigned long numposts;
|
||||
std::string lastID;
|
||||
std::string server_url;
|
||||
std::string server_sid;
|
||||
|
||||
bool postExists(unsigned long postID) {
|
||||
return postID < numposts;
|
||||
}
|
||||
bool postExists(unsigned long postID);
|
||||
|
||||
commsyPost *getPost(unsigned long postID) {
|
||||
// Check if post exists
|
||||
if (not postExists(postID)) {
|
||||
throw invalidPostError();
|
||||
}
|
||||
// Return post pointer
|
||||
return &posts[postID];
|
||||
}
|
||||
commsyPost *getPost(unsigned long postID);
|
||||
|
||||
std::string *getDescription(unsigned long postID) {
|
||||
// Get post
|
||||
commsyPost *thispost = getPost(postID);
|
||||
std::string *getDescription(unsigned long postID);
|
||||
|
||||
// Check if post description was downloaded already
|
||||
if (thispost->description.empty()) {
|
||||
// Download post
|
||||
thispost->description = get_post_desc(server_url + thispost->url);
|
||||
}
|
||||
// Return it
|
||||
return &thispost->description;
|
||||
}
|
||||
libCommsy(const std::string& _server_url, const std::string& _server_sid, const std::string& _room, const std::string start_id = "", const unsigned long max_posts = 0);
|
||||
|
||||
libCommsy(const std::string& _server_url, const std::string& _server_sid, const std::string& _room, const std::string start_id = "", const unsigned long max_posts = 0) {
|
||||
// Define required variables
|
||||
server_url = _server_url;
|
||||
server_sid = _server_sid;
|
||||
room = _room;
|
||||
lastID = start_id;
|
||||
std::stringstream httpcontent;
|
||||
GumboOutput *document;
|
||||
long statuscode;
|
||||
numposts = 0;
|
||||
|
||||
// Loop until all or max_posts posts are fetched
|
||||
while (1) {
|
||||
// Check connection and download feed
|
||||
try {
|
||||
statuscode = curlreq(httpcontent, server_sid, server_url + "/room/" + room + "/feed/10/date?lastId=" + lastID);
|
||||
} catch (std::exception&) {
|
||||
throw connectionFailError();
|
||||
}
|
||||
if (statuscode == 302) {
|
||||
throw invalidSIDError();
|
||||
} else if (statuscode == 500) {
|
||||
throw invalidRoomError();
|
||||
} else if (statuscode != 200) {
|
||||
std::cout << "Unhandled status code " << statuscode << std::endl;
|
||||
throw connectionFailError();
|
||||
}
|
||||
|
||||
// Do some stuff XD
|
||||
document = gumbo_parse(httpcontent.str().c_str());
|
||||
httpcontent.str(std::string()); // Clear buffer just in case we need it later
|
||||
|
||||
// Get posts
|
||||
auto gumboPosts = get_posts(document->root);
|
||||
if (gumboPosts.size() == 0) {
|
||||
// Stop fetching more data
|
||||
break;
|
||||
}
|
||||
|
||||
// Map posts and their corresponding URL to a number
|
||||
for (auto it = gumboPosts.begin(); it != gumboPosts.end(); it++) {
|
||||
// Create post struct
|
||||
commsyPost thispost;
|
||||
{
|
||||
// Get posts name
|
||||
thispost.name = get_post_name(*it);
|
||||
// Get posts ID
|
||||
thispost.id = get_post_id(*it);
|
||||
// Get posts meta string
|
||||
thispost.meta = get_post_meta(*it);
|
||||
// Get posts URL
|
||||
thispost.url = get_post_url(*it);
|
||||
// Get posts files
|
||||
auto files = get_post_files(*it);
|
||||
for (const auto& filemap : files) {
|
||||
for (const auto& [filename, fileurl] : filemap) {
|
||||
commsyFile thisfile;
|
||||
{
|
||||
thisfile.name = filename;
|
||||
thisfile.url = fileurl;
|
||||
}
|
||||
thispost.files.push_back(thisfile);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Append to posts vector
|
||||
posts.push_back(thispost);
|
||||
// Increment post counter
|
||||
numposts++;
|
||||
// Get lastID
|
||||
lastID = posts.back().id;
|
||||
// Check if maximum amount of posts to load was exceeded
|
||||
if (numposts == max_posts) {
|
||||
// Stop loading more posts
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
// Exceptions
|
||||
class invalidSIDError {};
|
||||
class invalidRoomError {};
|
||||
class invalidPostError {};
|
||||
class connectionFailError {};
|
||||
class descDownloadError {};
|
||||
class scrapError {};
|
||||
};
|
||||
|
||||
namespace libCommsyLowlevel {
|
||||
std::string get_post_desc(const std::string& post_url, const std::string& server_sid);
|
||||
}
|
||||
|
|
|
@ -1,3 +1,20 @@
|
|||
/*
|
||||
QCommsy
|
||||
Copyright (C) 2020 niansa
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
#include <exception>
|
||||
#include <iostream>
|
||||
|
||||
|
@ -29,7 +46,7 @@ public:
|
|||
QNetworkAccessManager *mNetManAuth = nullptr;
|
||||
QNetworkRequest *mNetReq = nullptr;
|
||||
|
||||
explicit libCommsyAuth(QObject *p = nullptr) : QObject (p){
|
||||
libCommsyAuth(QObject *p = nullptr) : QObject (p){
|
||||
mNetManTestconn = new QNetworkAccessManager(this);
|
||||
mNetManAuth = new QNetworkAccessManager(this);
|
||||
mNetReq = new QNetworkRequest();
|
||||
|
@ -46,7 +63,7 @@ public:
|
|||
void connectionInit(const QUrl& serverBaseUrl) {
|
||||
// Initialise request
|
||||
mNetReq->setUrl(serverBaseUrl);
|
||||
mNetReq->setAttribute(QNetworkRequest::FollowRedirectsAttribute, true);
|
||||
mNetReq->setAttribute(QNetworkRequest::Attribute::RedirectPolicyAttribute, true);
|
||||
std::cout << mNetReq->url().toString().toStdString() << std::endl;
|
||||
mNetManTestconn->get(*mNetReq);
|
||||
}
|
||||
|
@ -65,7 +82,7 @@ public:
|
|||
// Create request
|
||||
mNetReq->setUrl(authUrl + "&mod=context&fct=login");
|
||||
mNetReq->setHeader(QNetworkRequest::ContentTypeHeader, "application/x-www-form-urlencoded");
|
||||
mNetReq->setAttribute(QNetworkRequest::FollowRedirectsAttribute, false);
|
||||
mNetReq->setAttribute(QNetworkRequest::RedirectPolicyAttribute, false);
|
||||
|
||||
// Perform the request
|
||||
std::cout << mNetReq->url().toString().toStdString() << std::endl;
|
||||
|
|
145
main.cpp
145
main.cpp
|
@ -1,3 +1,20 @@
|
|||
/*
|
||||
QCommsy
|
||||
Copyright (C) 2020 niansa
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
#include "ui_overview.h"
|
||||
#include "ui_info.h"
|
||||
#include "ui_login.h"
|
||||
|
@ -11,6 +28,7 @@
|
|||
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include <functional>
|
||||
|
||||
#include <QMainWindow>
|
||||
#include <QApplication>
|
||||
|
@ -21,17 +39,18 @@
|
|||
#include <QFile>
|
||||
#include <QTimer>
|
||||
#include <QMainWindow>
|
||||
#include <QListWidgetItem>
|
||||
#include <QFont>
|
||||
#include <QStyleFactory>
|
||||
#include <QDesktopServices>
|
||||
#include <QSettings>
|
||||
#include <QNetworkAccessManager>
|
||||
#include <QNetworkReply>
|
||||
#include <QNetworkRequest>
|
||||
#include <QStandardPaths>
|
||||
|
||||
#define QCommsy_NAME "QCommsy"
|
||||
#define QCommsy_VERSION "1.0-stable"
|
||||
|
||||
#define UPDATE_WINDOW(a) a->processEvents();
|
||||
#define QCommsy_VERSION "1.2-stable"
|
||||
|
||||
static QSettings *settings;
|
||||
static QApplication *a;
|
||||
|
@ -48,7 +67,7 @@ public:
|
|||
void overviewWindow(bool catchInvalidRoomError = true);
|
||||
void loginWindow(const QString& failure = "");
|
||||
void infoWindow();
|
||||
void postViewWindow(commsyPost *thispost, const QString& description);
|
||||
void postViewWindow(commsyPost *thispost, QString description);
|
||||
void offlineWindow();
|
||||
|
||||
_UILoader () {
|
||||
|
@ -95,7 +114,6 @@ public:
|
|||
destFile.close();
|
||||
|
||||
// Open file in some application
|
||||
//QDesktopServices::openUrl(destPath);
|
||||
QDesktopServices::openUrl(QUrl::fromLocalFile(destPath));
|
||||
}
|
||||
|
||||
|
@ -121,6 +139,8 @@ void _UILoader::infoWindow() {
|
|||
"<b>App frontend:</b> " QCommsy_NAME " version " QCommsy_VERSION "<br />"
|
||||
"<b>Authentication backend:</b> " libCommsyAuth_NAME " version " libCommsyAuth_VERSION "<br />"
|
||||
"<b>Scrapping backend:</b> " libCommsy_NAME " version " libCommsy_VERSION "<br />"
|
||||
"<b>Git version:</b> " GIT_CURRENT_SHA1 "<br />"
|
||||
"<b>Build ID:</b> " + QString::number(std::hash<std::string>{}(__DATE__ __TIME__)) + "<br />"
|
||||
);
|
||||
thisui->buildDateInfo->setText(
|
||||
"Build date:\n"
|
||||
|
@ -133,18 +153,15 @@ void _UILoader::infoWindow() {
|
|||
|
||||
void _UILoader::failureWindow() {
|
||||
Ui::failureWindow *thisui = new Ui::failureWindow;
|
||||
QString reason;
|
||||
|
||||
// Show initial UI
|
||||
thisui->setupUi(w);
|
||||
w->show();
|
||||
|
||||
// Get error message
|
||||
reason = "Ein interner Fehler ist aufgetreten<br />"
|
||||
"<i>Dies ist sehr wahrscheinlich ein Programmfehler. Sollte das zu häufig passieren, kontaktiere bitte den Entwickler</i>";
|
||||
|
||||
// Show error message
|
||||
thisui->descriptionText->setText("<b>Verbindung fehlgeschlagen</b><br />" + reason);
|
||||
thisui->descriptionText->setText("<b>Verbindung fehlgeschlagen</b><br />"
|
||||
"Ein interner Fehler ist aufgetreten<br />"
|
||||
"<i>Dies ist sehr wahrscheinlich ein Programmfehler. Sollte das zu häufig passieren, kontaktiere bitte den Entwickler</i>");
|
||||
|
||||
// Add button handlers
|
||||
w->connect(thisui->retryButton, &QPushButton::pressed, [this] () { loginWindow(); });
|
||||
|
@ -194,12 +211,12 @@ void _UILoader::loginWindow(const QString& failure) {
|
|||
// Login
|
||||
try {
|
||||
settings->setValue("server_sid", auther->getSID(netReply));
|
||||
auther->deleteLater();
|
||||
cacheInvalidate = true;
|
||||
return overviewWindow(false);
|
||||
overviewWindow(false);
|
||||
auther->deleteLater();
|
||||
} catch (authFailureError&) {
|
||||
thisui->failureText->setText("Die eingegebenen Anmeldedaten sind ungültig");
|
||||
} catch (invalidRoomError&) {
|
||||
} catch (libCommsy::invalidRoomError&) {
|
||||
thisui->failureText->setText("Der angegebene Raum existiert nicht");
|
||||
}
|
||||
});
|
||||
|
@ -237,7 +254,7 @@ void _UILoader::loginWindow(const QString& failure) {
|
|||
});
|
||||
}
|
||||
|
||||
void _UILoader::postViewWindow(commsyPost *thispost, const QString& description) {
|
||||
void _UILoader::postViewWindow(commsyPost *thispost, QString description) {
|
||||
Ui::postViewWindow *thisui = new Ui::postViewWindow;
|
||||
|
||||
// Show initial UI
|
||||
|
@ -245,14 +262,24 @@ void _UILoader::postViewWindow(commsyPost *thispost, const QString& description)
|
|||
w->show();
|
||||
thisui->statusText->setVisible(false);
|
||||
|
||||
// Remove trailing space from description
|
||||
if (description.size() != 0 and description.back() == '\n') {
|
||||
description.chop(1);
|
||||
}
|
||||
|
||||
// Update informations
|
||||
thisui->titleText->setText(QString::fromStdString(thispost->name));
|
||||
thisui->metaText->setText(QString::fromStdString(thispost->meta));
|
||||
thisui->descriptionText->setText(description);
|
||||
|
||||
// Update file list
|
||||
for (const auto& thisfile : thispost->files) {
|
||||
thisui->fileList->addItem(QString::fromStdString(thisfile.name));
|
||||
// Update file list if required
|
||||
if (thispost->files.size() != 0) {
|
||||
for (const auto& thisfile : thispost->files) {
|
||||
thisui->fileList->addItem(QString::fromStdString(thisfile.name));
|
||||
}
|
||||
} else { // If no files exist, hide the list
|
||||
thisui->filesInfo->setHidden(true);
|
||||
thisui->fileList->setHidden(true);
|
||||
}
|
||||
|
||||
// Add button handlers
|
||||
|
@ -274,6 +301,30 @@ void _UILoader::postViewWindow(commsyPost *thispost, const QString& description)
|
|||
void _UILoader::overviewWindow(bool catchInvalidRoomError) {
|
||||
Ui::overviewWindow *thisui = new Ui::overviewWindow;
|
||||
|
||||
// Following code is blocking
|
||||
a->processEvents();
|
||||
|
||||
// Connect if required
|
||||
try {
|
||||
reconnect();
|
||||
} catch (libCommsy::invalidSIDError&) {
|
||||
logout();
|
||||
return loginWindow("Die Sitzung ist abgelaufen - bitte erneut anmelden");
|
||||
} catch (libCommsy::invalidRoomError& exception) {
|
||||
|
||||
if (catchInvalidRoomError) {
|
||||
logout();
|
||||
return loginWindow("Der Raum existiert nicht mehr");
|
||||
} else {
|
||||
throw exception;
|
||||
}
|
||||
|
||||
} catch (libCommsy::connectionFailError&) {
|
||||
return offlineWindow();
|
||||
} catch (std::exception&) {
|
||||
return failureWindow();
|
||||
}
|
||||
|
||||
// Show initial UI
|
||||
thisui->setupUi(w);
|
||||
w->show();
|
||||
|
@ -281,46 +332,48 @@ void _UILoader::overviewWindow(bool catchInvalidRoomError) {
|
|||
// Add button handlers
|
||||
w->connect(thisui->postList, &QListWidget::activated, [this, thisui] (QModelIndex index) {
|
||||
auto postID = static_cast<unsigned long>(index.row());
|
||||
commsyPost *thispost = connector->getPost(postID);
|
||||
thisui->centralwidget->setDisabled(true);
|
||||
thispost->unread = false; // Mark post as read locally
|
||||
|
||||
// Run blocking code
|
||||
UPDATE_WINDOW(a) {
|
||||
postViewWindow(connector->getPost(postID), QString::fromStdString(*connector->getDescription(postID)));
|
||||
}
|
||||
a->processEvents();
|
||||
postViewWindow(thispost, QString::fromStdString(*connector->getDescription(postID)));
|
||||
});
|
||||
|
||||
w->connect(thisui->logoutButton, &QPushButton::pressed, [this] () { logout(); loginWindow(); });
|
||||
w->connect(thisui->infoButton, &QPushButton::pressed, [this] () { infoWindow(); });
|
||||
|
||||
// Run blocking code
|
||||
UPDATE_WINDOW(a) {
|
||||
// Connect if required
|
||||
try {
|
||||
reconnect();
|
||||
} catch (invalidSIDError&) {
|
||||
logout();
|
||||
return loginWindow("Die Sitzung ist abgelaufen - bitte erneut anmelden");
|
||||
} catch (invalidRoomError& exception) {
|
||||
// Get font used for unread posts
|
||||
QFont unreadFont = QFont();
|
||||
unreadFont.setBold(true);
|
||||
|
||||
if (catchInvalidRoomError) {
|
||||
logout();
|
||||
return loginWindow("Der Raum existiert nicht mehr");
|
||||
} else {
|
||||
throw exception;
|
||||
}
|
||||
// Refresh view
|
||||
thisui->postCounter->setText(QString::number(connector->numposts) + " Einträge");
|
||||
thisui->postList->clear();
|
||||
for (const auto& thispost : connector->posts) {
|
||||
QListWidgetItem *thisitem = new QListWidgetItem(QString::fromStdString(thispost.name), thisui->postList);
|
||||
|
||||
} catch (connectionFailError&) {
|
||||
return offlineWindow();
|
||||
} catch (std::exception&) {
|
||||
return failureWindow();
|
||||
if (thispost.unread) {
|
||||
thisitem->setFont(unreadFont);
|
||||
}
|
||||
|
||||
// Refresh view
|
||||
thisui->postCounter->setText(QString::number(connector->numposts) + " Einträge");
|
||||
thisui->postList->clear();
|
||||
for (const auto& thispost : connector->posts) {
|
||||
thisui->postList->addItem(QString::fromStdString(thispost.name));
|
||||
QString postIcon;
|
||||
switch(thispost.taskState) {
|
||||
case taskState::done:
|
||||
postIcon = "checkbox-checked-symbolic";
|
||||
break;
|
||||
case taskState::inProgress:
|
||||
postIcon = "clock";
|
||||
break;
|
||||
case taskState::todo:
|
||||
postIcon = "emblem-important-symbolic";
|
||||
break;
|
||||
default:
|
||||
postIcon = "arrow-right";
|
||||
break;
|
||||
}
|
||||
thisitem->setIcon(QIcon::fromTheme(postIcon));
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -340,7 +393,7 @@ int main(int argc, char *argv[]) {
|
|||
_UILoader UILoader;
|
||||
|
||||
// Set theme
|
||||
a->setStyle(QStyleFactory::create("android"));
|
||||
//a->setStyle(QStyleFactory::create("android"));
|
||||
|
||||
// Load initial window
|
||||
UILoader.loginWindow();
|
||||
|
|
|
@ -46,7 +46,7 @@
|
|||
<item>
|
||||
<widget class="QLabel" name="descriptionText">
|
||||
<property name="text">
|
||||
<string><html><head/><body><p><span style=" font-weight:600;">Entweder dein Handy oder der Server ist offline<br/></span>Wenn du dir ganz sicher bist, dass du eine funktionierende Internet Verbindung hast, ist sehr wahrscheinlich der Server wegen Wartungsarbeiten zurzeit offline.</p></body></html></string>
|
||||
<string><html><head/><body><p><span style=" font-weight:600;">Entweder du oder der Server ist offline<br/></span>Wenn du dir ganz sicher bist, dass du eine funktionierende Internet Verbindung hast, ist sehr wahrscheinlich der Server wegen Wartungsarbeiten zurzeit offline.</p></body></html></string>
|
||||
</property>
|
||||
<property name="alignment">
|
||||
<set>Qt::AlignCenter</set>
|
||||
|
|
13
postView.ui
13
postView.ui
|
@ -80,6 +80,19 @@
|
|||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<spacer name="verticalSpacer">
|
||||
<property name="orientation">
|
||||
<enum>Qt::Vertical</enum>
|
||||
</property>
|
||||
<property name="sizeHint" stdset="0">
|
||||
<size>
|
||||
<width>20</width>
|
||||
<height>40</height>
|
||||
</size>
|
||||
</property>
|
||||
</spacer>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="filesInfo">
|
||||
<property name="text">
|
||||
|
|
Loading…
Add table
Reference in a new issue