Compare commits
10
Commits
d7c65ed551
...
a3c6a7c633
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
a3c6a7c633 | ||
|
|
fc3d6cb826 | ||
|
|
f9e798f3b3 | ||
|
|
831ec1d989 | ||
|
|
757536c277 | ||
|
|
d003f0783d | ||
|
|
5666dc4a4b | ||
|
|
c2b0351598 | ||
|
|
a8a3d95c40 | ||
|
|
97e800bfd5 |
@@ -0,0 +1,661 @@
|
|||||||
|
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||||
|
Version 3, 19 November 2007
|
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The GNU Affero General Public License is a free, copyleft license for
|
||||||
|
software and other kinds of works, specifically designed to ensure
|
||||||
|
cooperation with the community in the case of network server software.
|
||||||
|
|
||||||
|
The licenses for most software and other practical works are designed
|
||||||
|
to take away your freedom to share and change the works. By contrast,
|
||||||
|
our General Public Licenses are 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.
|
||||||
|
|
||||||
|
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.
|
||||||
|
|
||||||
|
Developers that use our General Public Licenses protect your rights
|
||||||
|
with two steps: (1) assert copyright on the software, and (2) offer
|
||||||
|
you this License which gives you legal permission to copy, distribute
|
||||||
|
and/or modify the software.
|
||||||
|
|
||||||
|
A secondary benefit of defending all users' freedom is that
|
||||||
|
improvements made in alternate versions of the program, if they
|
||||||
|
receive widespread use, become available for other developers to
|
||||||
|
incorporate. Many developers of free software are heartened and
|
||||||
|
encouraged by the resulting cooperation. However, in the case of
|
||||||
|
software used on network servers, this result may fail to come about.
|
||||||
|
The GNU General Public License permits making a modified version and
|
||||||
|
letting the public access it on a server without ever releasing its
|
||||||
|
source code to the public.
|
||||||
|
|
||||||
|
The GNU Affero General Public License is designed specifically to
|
||||||
|
ensure that, in such cases, the modified source code becomes available
|
||||||
|
to the community. It requires the operator of a network server to
|
||||||
|
provide the source code of the modified version running there to the
|
||||||
|
users of that server. Therefore, public use of a modified version, on
|
||||||
|
a publicly accessible server, gives the public access to the source
|
||||||
|
code of the modified version.
|
||||||
|
|
||||||
|
An older license, called the Affero General Public License and
|
||||||
|
published by Affero, was designed to accomplish similar goals. This is
|
||||||
|
a different license, not a version of the Affero GPL, but Affero has
|
||||||
|
released a new version of the Affero GPL which permits relicensing under
|
||||||
|
this license.
|
||||||
|
|
||||||
|
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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, if you modify the
|
||||||
|
Program, your modified version must prominently offer all users
|
||||||
|
interacting with it remotely through a computer network (if your version
|
||||||
|
supports such interaction) an opportunity to receive the Corresponding
|
||||||
|
Source of your version by providing access to the Corresponding Source
|
||||||
|
from a network server at no charge, through some standard or customary
|
||||||
|
means of facilitating copying of software. This Corresponding Source
|
||||||
|
shall include the Corresponding Source for any work covered by version 3
|
||||||
|
of the GNU General Public License that is incorporated pursuant to the
|
||||||
|
following paragraph.
|
||||||
|
|
||||||
|
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 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 work with which it is combined will remain governed by version
|
||||||
|
3 of the GNU General Public License.
|
||||||
|
|
||||||
|
14. Revised Versions of this License.
|
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions of
|
||||||
|
the GNU Affero 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 Affero 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 Affero 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 Affero 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.
|
||||||
|
|
||||||
|
<one line to give the program's name and a brief idea of what it does.>
|
||||||
|
Copyright (C) <year> <name of author>
|
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU Affero 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 Affero General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Affero General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If your software can interact with users remotely through a computer
|
||||||
|
network, you should also make sure that it provides a way for users to
|
||||||
|
get its source. For example, if your program is a web application, its
|
||||||
|
interface could display a "Source" link that leads users to an archive
|
||||||
|
of the code. There are many ways you could offer source, and different
|
||||||
|
solutions will be better for different programs; see section 13 for the
|
||||||
|
specific requirements.
|
||||||
|
|
||||||
|
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 AGPL, see
|
||||||
|
<https://www.gnu.org/licenses/>.
|
||||||
@@ -0,0 +1,2 @@
|
|||||||
|
ALTER TABLE document_versions
|
||||||
|
DROP COLUMN metadata;
|
||||||
@@ -0,0 +1,2 @@
|
|||||||
|
ALTER TABLE document_versions
|
||||||
|
ADD COLUMN metadata JSONB NOT NULL DEFAULT '{}'::jsonb;
|
||||||
@@ -0,0 +1,2 @@
|
|||||||
|
ALTER TABLE folders
|
||||||
|
ADD COLUMN path_cache VARCHAR(1000);
|
||||||
@@ -0,0 +1,2 @@
|
|||||||
|
ALTER TABLE folders
|
||||||
|
DROP COLUMN path_cache;
|
||||||
@@ -30,7 +30,6 @@ pub struct Folder {
|
|||||||
pub id: Uuid,
|
pub id: Uuid,
|
||||||
pub name: String,
|
pub name: String,
|
||||||
pub parent_id: Option<Uuid>,
|
pub parent_id: Option<Uuid>,
|
||||||
pub path_cache: Option<String>,
|
|
||||||
pub created_at: NaiveDateTime,
|
pub created_at: NaiveDateTime,
|
||||||
pub updated_at: NaiveDateTime,
|
pub updated_at: NaiveDateTime,
|
||||||
}
|
}
|
||||||
@@ -41,7 +40,6 @@ pub struct NewFolder {
|
|||||||
pub id: Uuid,
|
pub id: Uuid,
|
||||||
pub name: String,
|
pub name: String,
|
||||||
pub parent_id: Option<Uuid>,
|
pub parent_id: Option<Uuid>,
|
||||||
pub path_cache: Option<String>,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Debug, Clone, Queryable, Identifiable, Associations)]
|
#[derive(Debug, Clone, Queryable, Identifiable, Associations)]
|
||||||
@@ -88,6 +86,7 @@ pub struct DocumentVersion {
|
|||||||
pub checksum: String,
|
pub checksum: String,
|
||||||
pub created_at: NaiveDateTime,
|
pub created_at: NaiveDateTime,
|
||||||
pub operations_summary: serde_json::Value,
|
pub operations_summary: serde_json::Value,
|
||||||
|
pub metadata: serde_json::Value,
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Debug, Insertable)]
|
#[derive(Debug, Insertable)]
|
||||||
@@ -100,6 +99,7 @@ pub struct NewDocumentVersion {
|
|||||||
pub size_bytes: i64,
|
pub size_bytes: i64,
|
||||||
pub checksum: String,
|
pub checksum: String,
|
||||||
pub operations_summary: serde_json::Value,
|
pub operations_summary: serde_json::Value,
|
||||||
|
pub metadata: serde_json::Value,
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Debug, Clone, Queryable, Identifiable, Associations)]
|
#[derive(Debug, Clone, Queryable, Identifiable, Associations)]
|
||||||
|
|||||||
@@ -14,7 +14,7 @@ use reqwest::Client;
|
|||||||
use serde::{Deserialize, Serialize};
|
use serde::{Deserialize, Serialize};
|
||||||
use serde_json::{json, Value};
|
use serde_json::{json, Value};
|
||||||
use sha2::{Digest, Sha256};
|
use sha2::{Digest, Sha256};
|
||||||
use tracing::{error, info, warn};
|
use tracing::{debug, error, info, warn};
|
||||||
use uuid::Uuid;
|
use uuid::Uuid;
|
||||||
|
|
||||||
use super::folders::gather_descendant_folder_ids;
|
use super::folders::gather_descendant_folder_ids;
|
||||||
@@ -107,6 +107,7 @@ pub struct DocumentVersionResponse {
|
|||||||
pub size_bytes: i64,
|
pub size_bytes: i64,
|
||||||
pub checksum: String,
|
pub checksum: String,
|
||||||
pub created_at: String,
|
pub created_at: String,
|
||||||
|
pub metadata: Value,
|
||||||
pub operations_summary: Value,
|
pub operations_summary: Value,
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -395,6 +396,7 @@ pub async fn list_documents(
|
|||||||
let mut quickwit_order: Option<Vec<Uuid>> = None;
|
let mut quickwit_order: Option<Vec<Uuid>> = None;
|
||||||
|
|
||||||
if let Some(query_str) = search_text.as_ref() {
|
if let Some(query_str) = search_text.as_ref() {
|
||||||
|
debug!(query = %query_str, "performing quickwit document search");
|
||||||
let endpoint = state
|
let endpoint = state
|
||||||
.config
|
.config
|
||||||
.quickwit_endpoint
|
.quickwit_endpoint
|
||||||
@@ -1640,6 +1642,7 @@ async fn process_upload(
|
|||||||
s3_key: s3_key.clone(),
|
s3_key: s3_key.clone(),
|
||||||
size_bytes,
|
size_bytes,
|
||||||
checksum: checksum_hex.clone(),
|
checksum: checksum_hex.clone(),
|
||||||
|
metadata: Value::Object(Default::default()),
|
||||||
operations_summary: Value::Object(Default::default()),
|
operations_summary: Value::Object(Default::default()),
|
||||||
};
|
};
|
||||||
|
|
||||||
@@ -1870,6 +1873,7 @@ fn to_version_response(version: DocumentVersion) -> DocumentVersionResponse {
|
|||||||
size_bytes: version.size_bytes,
|
size_bytes: version.size_bytes,
|
||||||
checksum: version.checksum,
|
checksum: version.checksum,
|
||||||
created_at: to_iso(version.created_at),
|
created_at: to_iso(version.created_at),
|
||||||
|
metadata: version.metadata,
|
||||||
operations_summary: version.operations_summary,
|
operations_summary: version.operations_summary,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -1945,8 +1949,14 @@ pub(crate) fn to_iso(dt: NaiveDateTime) -> String {
|
|||||||
|
|
||||||
async fn quickwit_search(endpoint: &str, index: &str, query: &str) -> anyhow::Result<Vec<Uuid>> {
|
async fn quickwit_search(endpoint: &str, index: &str, query: &str) -> anyhow::Result<Vec<Uuid>> {
|
||||||
let quickwit_query = match build_quickwit_query(query) {
|
let quickwit_query = match build_quickwit_query(query) {
|
||||||
Some(q) => q,
|
Some(q) => {
|
||||||
None => return Ok(vec![]),
|
debug!(%query, quickwit_query = %q, "built quickwit search query");
|
||||||
|
q
|
||||||
|
}
|
||||||
|
None => {
|
||||||
|
debug!(%query, "quickwit search skipped because query produced no tokens");
|
||||||
|
return Ok(vec![]);
|
||||||
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
let client = Client::new();
|
let client = Client::new();
|
||||||
@@ -1957,20 +1967,25 @@ async fn quickwit_search(endpoint: &str, index: &str, query: &str) -> anyhow::Re
|
|||||||
"max_hits": QUICKWIT_MAX_HITS,
|
"max_hits": QUICKWIT_MAX_HITS,
|
||||||
});
|
});
|
||||||
|
|
||||||
|
debug!(%url, payload = %payload, "sending quickwit search request");
|
||||||
let response = client.post(url).json(&payload).send().await?;
|
let response = client.post(url).json(&payload).send().await?;
|
||||||
if !response.status().is_success() {
|
if !response.status().is_success() {
|
||||||
let status = response.status();
|
let status = response.status();
|
||||||
let body = response.text().await.unwrap_or_default();
|
let body = response.text().await.unwrap_or_default();
|
||||||
|
error!(%status, body = %body, "quickwit search request failed");
|
||||||
return Err(anyhow::anyhow!(
|
return Err(anyhow::anyhow!(
|
||||||
"quickwit search failed with status {status}: {body}"
|
"quickwit search failed with status {status}: {body}"
|
||||||
));
|
));
|
||||||
}
|
}
|
||||||
|
|
||||||
let data: QuickwitSearchResponse = response.json().await?;
|
let data: QuickwitSearchResponse = response.json().await?;
|
||||||
|
debug!("quickwit search response parsed successfully");
|
||||||
|
let QuickwitSearchResponse { hits } = data;
|
||||||
let mut seen = HashSet::new();
|
let mut seen = HashSet::new();
|
||||||
let mut doc_ids = Vec::new();
|
let mut doc_ids = Vec::new();
|
||||||
|
let total_hits = hits.len();
|
||||||
|
|
||||||
for hit in data.hits {
|
for hit in hits {
|
||||||
if let Some(doc_id) = extract_document_id(&hit) {
|
if let Some(doc_id) = extract_document_id(&hit) {
|
||||||
if seen.insert(doc_id) {
|
if seen.insert(doc_id) {
|
||||||
doc_ids.push(doc_id);
|
doc_ids.push(doc_id);
|
||||||
@@ -1978,6 +1993,11 @@ async fn quickwit_search(endpoint: &str, index: &str, query: &str) -> anyhow::Re
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
debug!(
|
||||||
|
total_hits = total_hits,
|
||||||
|
unique_ids = doc_ids.len(),
|
||||||
|
"quickwit search completed"
|
||||||
|
);
|
||||||
Ok(doc_ids)
|
Ok(doc_ids)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -1,5 +1,5 @@
|
|||||||
use axum::{
|
use axum::{
|
||||||
extract::{Json, Path, State},
|
extract::{Json, Path, Query, State},
|
||||||
http::StatusCode,
|
http::StatusCode,
|
||||||
};
|
};
|
||||||
use diesel::{dsl::exists, prelude::*, PgConnection};
|
use diesel::{dsl::exists, prelude::*, PgConnection};
|
||||||
@@ -50,12 +50,21 @@ pub struct FolderContentsResponse {
|
|||||||
pub documents: Vec<DocumentResponse>,
|
pub documents: Vec<DocumentResponse>,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[derive(Deserialize)]
|
||||||
|
pub struct FolderContentsQuery {
|
||||||
|
#[serde(default = "default_include_documents")]
|
||||||
|
pub include_documents: bool,
|
||||||
|
}
|
||||||
|
|
||||||
|
const fn default_include_documents() -> bool {
|
||||||
|
true
|
||||||
|
}
|
||||||
|
|
||||||
#[derive(Serialize)]
|
#[derive(Serialize)]
|
||||||
pub struct FolderInfo {
|
pub struct FolderInfo {
|
||||||
pub id: Uuid,
|
pub id: Uuid,
|
||||||
pub name: String,
|
pub name: String,
|
||||||
pub parent_id: Option<Uuid>,
|
pub parent_id: Option<Uuid>,
|
||||||
pub path_cache: Option<String>,
|
|
||||||
pub created_at: String,
|
pub created_at: String,
|
||||||
pub updated_at: String,
|
pub updated_at: String,
|
||||||
}
|
}
|
||||||
@@ -97,12 +106,10 @@ pub async fn ensure_folder_path(
|
|||||||
let folder = if let Some(folder) = existing {
|
let folder = if let Some(folder) = existing {
|
||||||
folder
|
folder
|
||||||
} else {
|
} else {
|
||||||
let path_cache = build_path_cache(conn, current_parent, name)?;
|
|
||||||
let new_folder = NewFolder {
|
let new_folder = NewFolder {
|
||||||
id: Uuid::new_v4(),
|
id: Uuid::new_v4(),
|
||||||
name: name.to_string(),
|
name: name.to_string(),
|
||||||
parent_id: current_parent,
|
parent_id: current_parent,
|
||||||
path_cache,
|
|
||||||
};
|
};
|
||||||
|
|
||||||
diesel::insert_into(folders::table)
|
diesel::insert_into(folders::table)
|
||||||
@@ -133,13 +140,11 @@ pub async fn create_folder(
|
|||||||
}
|
}
|
||||||
|
|
||||||
let mut conn = state.db()?;
|
let mut conn = state.db()?;
|
||||||
let path_cache = build_path_cache(&mut conn, payload.parent_id, &payload.name)?;
|
|
||||||
|
|
||||||
let new_folder = NewFolder {
|
let new_folder = NewFolder {
|
||||||
id: Uuid::new_v4(),
|
id: Uuid::new_v4(),
|
||||||
name: payload.name.trim().to_string(),
|
name: payload.name.trim().to_string(),
|
||||||
parent_id: payload.parent_id,
|
parent_id: payload.parent_id,
|
||||||
path_cache,
|
|
||||||
};
|
};
|
||||||
|
|
||||||
diesel::insert_into(folders::table)
|
diesel::insert_into(folders::table)
|
||||||
@@ -155,6 +160,7 @@ pub async fn create_folder(
|
|||||||
pub async fn list_folder_contents(
|
pub async fn list_folder_contents(
|
||||||
State(state): State<AppState>,
|
State(state): State<AppState>,
|
||||||
Path(folder_identifier): Path<String>,
|
Path(folder_identifier): Path<String>,
|
||||||
|
Query(query): Query<FolderContentsQuery>,
|
||||||
user: AuthenticatedUser,
|
user: AuthenticatedUser,
|
||||||
) -> AppResult<Json<FolderContentsResponse>> {
|
) -> AppResult<Json<FolderContentsResponse>> {
|
||||||
let mut conn = state.db()?;
|
let mut conn = state.db()?;
|
||||||
@@ -188,42 +194,48 @@ pub async fn list_folder_contents(
|
|||||||
};
|
};
|
||||||
let subfolders = child_folders.into_iter().map(folder_to_info).collect();
|
let subfolders = child_folders.into_iter().map(folder_to_info).collect();
|
||||||
|
|
||||||
let docs_query = documents::table
|
let documents = if query.include_documents {
|
||||||
.filter(documents::deleted_at.is_null())
|
let docs_query = documents::table
|
||||||
.order(documents::uploaded_at.desc());
|
.filter(documents::deleted_at.is_null())
|
||||||
|
.order(documents::uploaded_at.desc());
|
||||||
|
|
||||||
let docs: Vec<Document> = if let Some(current_folder) = folder_id {
|
let docs: Vec<Document> = if let Some(current_folder) = folder_id {
|
||||||
docs_query
|
docs_query
|
||||||
.filter(documents::folder_id.eq(current_folder))
|
.filter(documents::folder_id.eq(current_folder))
|
||||||
.load(&mut conn)?
|
.load(&mut conn)?
|
||||||
|
} else {
|
||||||
|
docs_query
|
||||||
|
.filter(documents::folder_id.is_null())
|
||||||
|
.load(&mut conn)?
|
||||||
|
};
|
||||||
|
|
||||||
|
let doc_ids: Vec<Uuid> = docs.iter().map(|doc| doc.id).collect();
|
||||||
|
let tags_map = load_tags_for_documents(&mut conn, &doc_ids)?;
|
||||||
|
let mut correspondents_map = load_correspondents_for_documents(&mut conn, &doc_ids)?;
|
||||||
|
drop(conn);
|
||||||
|
|
||||||
|
let primary_versions = load_primary_assets(&state, &docs).await?;
|
||||||
|
|
||||||
|
let mut documents = Vec::with_capacity(doc_ids.len());
|
||||||
|
for doc in docs {
|
||||||
|
let tags = tags_map.get(&doc.id).cloned();
|
||||||
|
let correspondents = correspondents_map.remove(&doc.id).unwrap_or_default();
|
||||||
|
let current_version = primary_versions.get(&doc.id).cloned();
|
||||||
|
documents.push(to_document_response(
|
||||||
|
&state,
|
||||||
|
user.user_id,
|
||||||
|
doc,
|
||||||
|
tags,
|
||||||
|
correspondents,
|
||||||
|
current_version,
|
||||||
|
)?);
|
||||||
|
}
|
||||||
|
|
||||||
|
documents
|
||||||
} else {
|
} else {
|
||||||
docs_query
|
Vec::new()
|
||||||
.filter(documents::folder_id.is_null())
|
|
||||||
.load(&mut conn)?
|
|
||||||
};
|
};
|
||||||
|
|
||||||
let doc_ids: Vec<Uuid> = docs.iter().map(|doc| doc.id).collect();
|
|
||||||
let tags_map = load_tags_for_documents(&mut conn, &doc_ids)?;
|
|
||||||
let mut correspondents_map = load_correspondents_for_documents(&mut conn, &doc_ids)?;
|
|
||||||
drop(conn);
|
|
||||||
|
|
||||||
let primary_versions = load_primary_assets(&state, &docs).await?;
|
|
||||||
|
|
||||||
let mut documents = Vec::with_capacity(doc_ids.len());
|
|
||||||
for doc in docs {
|
|
||||||
let tags = tags_map.get(&doc.id).cloned();
|
|
||||||
let correspondents = correspondents_map.remove(&doc.id).unwrap_or_default();
|
|
||||||
let current_version = primary_versions.get(&doc.id).cloned();
|
|
||||||
documents.push(to_document_response(
|
|
||||||
&state,
|
|
||||||
user.user_id,
|
|
||||||
doc,
|
|
||||||
tags,
|
|
||||||
correspondents,
|
|
||||||
current_version,
|
|
||||||
)?);
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(Json(FolderContentsResponse {
|
Ok(Json(FolderContentsResponse {
|
||||||
folder,
|
folder,
|
||||||
subfolders,
|
subfolders,
|
||||||
@@ -346,49 +358,24 @@ pub async fn update_folder(
|
|||||||
));
|
));
|
||||||
}
|
}
|
||||||
|
|
||||||
let new_path = build_path_cache(conn, next_parent, &new_name)?;
|
|
||||||
|
|
||||||
diesel::update(folders::table.find(folder_id))
|
diesel::update(folders::table.find(folder_id))
|
||||||
.set((
|
.set((
|
||||||
folders::parent_id.eq(next_parent),
|
folders::parent_id.eq(next_parent),
|
||||||
folders::name.eq(&new_name),
|
folders::name.eq(&new_name),
|
||||||
folders::path_cache.eq(new_path),
|
|
||||||
))
|
))
|
||||||
.execute(conn)?;
|
.execute(conn)?;
|
||||||
|
|
||||||
refresh_descendant_paths(conn, folder_id)?;
|
|
||||||
|
|
||||||
Ok(())
|
Ok(())
|
||||||
})?;
|
})?;
|
||||||
|
|
||||||
Ok(StatusCode::NO_CONTENT)
|
Ok(StatusCode::NO_CONTENT)
|
||||||
}
|
}
|
||||||
|
|
||||||
fn build_path_cache(
|
|
||||||
conn: &mut PgConnection,
|
|
||||||
parent_id: Option<Uuid>,
|
|
||||||
name: &str,
|
|
||||||
) -> AppResult<Option<String>> {
|
|
||||||
let path = if let Some(parent_id) = parent_id {
|
|
||||||
let parent: Folder = folders::table.find(parent_id).first(conn)?;
|
|
||||||
let base = parent
|
|
||||||
.path_cache
|
|
||||||
.unwrap_or_else(|| "/".to_string())
|
|
||||||
.trim_end_matches('/')
|
|
||||||
.to_string();
|
|
||||||
format!("{}/{}", base, name)
|
|
||||||
} else {
|
|
||||||
format!("/{}", name)
|
|
||||||
};
|
|
||||||
Ok(Some(path))
|
|
||||||
}
|
|
||||||
|
|
||||||
fn folder_to_info(folder: Folder) -> FolderInfo {
|
fn folder_to_info(folder: Folder) -> FolderInfo {
|
||||||
FolderInfo {
|
FolderInfo {
|
||||||
id: folder.id,
|
id: folder.id,
|
||||||
name: folder.name,
|
name: folder.name,
|
||||||
parent_id: folder.parent_id,
|
parent_id: folder.parent_id,
|
||||||
path_cache: folder.path_cache,
|
|
||||||
created_at: to_iso(folder.created_at),
|
created_at: to_iso(folder.created_at),
|
||||||
updated_at: to_iso(folder.updated_at),
|
updated_at: to_iso(folder.updated_at),
|
||||||
}
|
}
|
||||||
@@ -412,19 +399,3 @@ pub(super) fn gather_descendant_folder_ids(
|
|||||||
|
|
||||||
Ok(ids)
|
Ok(ids)
|
||||||
}
|
}
|
||||||
|
|
||||||
fn refresh_descendant_paths(conn: &mut PgConnection, parent_id: Uuid) -> AppResult<()> {
|
|
||||||
let children: Vec<Folder> = folders::table
|
|
||||||
.filter(folders::parent_id.eq(Some(parent_id)))
|
|
||||||
.load(conn)?;
|
|
||||||
|
|
||||||
for child in children {
|
|
||||||
let path_cache = build_path_cache(conn, Some(parent_id), &child.name)?;
|
|
||||||
diesel::update(folders::table.find(child.id))
|
|
||||||
.set(folders::path_cache.eq(path_cache))
|
|
||||||
.execute(conn)?;
|
|
||||||
refresh_descendant_paths(conn, child.id)?;
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(())
|
|
||||||
}
|
|
||||||
|
|||||||
@@ -55,6 +55,7 @@ diesel::table! {
|
|||||||
checksum -> Varchar,
|
checksum -> Varchar,
|
||||||
created_at -> Timestamptz,
|
created_at -> Timestamptz,
|
||||||
operations_summary -> Jsonb,
|
operations_summary -> Jsonb,
|
||||||
|
metadata -> Jsonb,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -85,8 +86,6 @@ diesel::table! {
|
|||||||
#[max_length = 255]
|
#[max_length = 255]
|
||||||
name -> Varchar,
|
name -> Varchar,
|
||||||
parent_id -> Nullable<Uuid>,
|
parent_id -> Nullable<Uuid>,
|
||||||
#[max_length = 1000]
|
|
||||||
path_cache -> Nullable<Varchar>,
|
|
||||||
created_at -> Timestamptz,
|
created_at -> Timestamptz,
|
||||||
updated_at -> Timestamptz,
|
updated_at -> Timestamptz,
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -129,8 +129,8 @@ impl JobHandler for IndexDocumentTextJob {
|
|||||||
let payload = json!({
|
let payload = json!({
|
||||||
"document_id": context.document.id,
|
"document_id": context.document.id,
|
||||||
"version_id": context.version.id,
|
"version_id": context.version.id,
|
||||||
"title": context.document.title,
|
"title": context.document.title.to_lowercase(),
|
||||||
"text": text,
|
"text": text.to_lowercase()
|
||||||
});
|
});
|
||||||
|
|
||||||
let body = serde_json::to_string(&payload).unwrap();
|
let body = serde_json::to_string(&payload).unwrap();
|
||||||
|
|||||||
@@ -1,4 +1,4 @@
|
|||||||
use std::{io::Cursor, panic, sync::Arc, time::Duration};
|
use std::{convert::TryInto, io::Cursor, panic, sync::Arc, time::Duration};
|
||||||
|
|
||||||
use async_trait::async_trait;
|
use async_trait::async_trait;
|
||||||
use chrono::Utc;
|
use chrono::Utc;
|
||||||
@@ -6,7 +6,7 @@ use diesel::{pg::upsert::excluded, prelude::*};
|
|||||||
use image::{GenericImageView, ImageFormat, ImageReader};
|
use image::{GenericImageView, ImageFormat, ImageReader};
|
||||||
use pdfium_render::prelude::*;
|
use pdfium_render::prelude::*;
|
||||||
use serde::Deserialize;
|
use serde::Deserialize;
|
||||||
use serde_json::json;
|
use serde_json::{json, Map, Value};
|
||||||
use tokio::task;
|
use tokio::task;
|
||||||
use tracing::{error, info, warn};
|
use tracing::{error, info, warn};
|
||||||
use uuid::Uuid;
|
use uuid::Uuid;
|
||||||
@@ -103,6 +103,45 @@ impl JobHandler for GenerateThumbnailsJob {
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
|
if let Some(page_count) = generation.page_count {
|
||||||
|
let state_clone = state.clone();
|
||||||
|
let document_id = initial.document.id;
|
||||||
|
let version_id = initial.version.id;
|
||||||
|
match task::spawn_blocking(move || {
|
||||||
|
persist_document_page_count(state_clone, document_id, version_id, page_count)
|
||||||
|
})
|
||||||
|
.await
|
||||||
|
{
|
||||||
|
Ok(Ok(())) => {}
|
||||||
|
Ok(Err(err)) => {
|
||||||
|
warn!(
|
||||||
|
job_id = %job.id,
|
||||||
|
document_id = %document_id,
|
||||||
|
version_id = %version_id,
|
||||||
|
error = %err,
|
||||||
|
"failed to update document page count metadata; retrying"
|
||||||
|
);
|
||||||
|
return JobExecution::Retry {
|
||||||
|
delay: Duration::from_secs(30),
|
||||||
|
error: err,
|
||||||
|
};
|
||||||
|
}
|
||||||
|
Err(join_err) => {
|
||||||
|
error!(
|
||||||
|
job_id = %job.id,
|
||||||
|
document_id = %document_id,
|
||||||
|
version_id = %version_id,
|
||||||
|
error = %join_err,
|
||||||
|
"page count metadata task panicked"
|
||||||
|
);
|
||||||
|
return JobExecution::Retry {
|
||||||
|
delay: Duration::from_secs(60),
|
||||||
|
error: format!("metadata panic: {join_err}"),
|
||||||
|
};
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
let thumbnail_asset_id = initial
|
let thumbnail_asset_id = initial
|
||||||
.existing_thumbnail
|
.existing_thumbnail
|
||||||
.as_ref()
|
.as_ref()
|
||||||
@@ -224,6 +263,7 @@ struct GeneratedImage {
|
|||||||
struct GeneratedAssets {
|
struct GeneratedAssets {
|
||||||
thumbnail: GeneratedImage,
|
thumbnail: GeneratedImage,
|
||||||
preview: GeneratedImage,
|
preview: GeneratedImage,
|
||||||
|
page_count: Option<u32>,
|
||||||
}
|
}
|
||||||
|
|
||||||
struct AssetPersistence<'a> {
|
struct AssetPersistence<'a> {
|
||||||
@@ -305,13 +345,21 @@ fn generate_preview_and_thumbnail(
|
|||||||
.unwrap_or(false)
|
.unwrap_or(false)
|
||||||
});
|
});
|
||||||
|
|
||||||
let (preview, thumbnail) = if is_pdf {
|
if is_pdf {
|
||||||
generate_pdf_assets(bytes)?
|
let pdf_assets = generate_pdf_assets(bytes)?;
|
||||||
|
Ok(GeneratedAssets {
|
||||||
|
preview: pdf_assets.preview,
|
||||||
|
thumbnail: pdf_assets.thumbnail,
|
||||||
|
page_count: Some(pdf_assets.page_count),
|
||||||
|
})
|
||||||
} else {
|
} else {
|
||||||
generate_image_assets(bytes)?
|
let (preview, thumbnail) = generate_image_assets(bytes)?;
|
||||||
};
|
Ok(GeneratedAssets {
|
||||||
|
preview,
|
||||||
Ok(GeneratedAssets { preview, thumbnail })
|
thumbnail,
|
||||||
|
page_count: None,
|
||||||
|
})
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn generate_image_assets(bytes: &[u8]) -> Result<(GeneratedImage, GeneratedImage), String> {
|
fn generate_image_assets(bytes: &[u8]) -> Result<(GeneratedImage, GeneratedImage), String> {
|
||||||
@@ -339,7 +387,13 @@ fn generate_image_assets(bytes: &[u8]) -> Result<(GeneratedImage, GeneratedImage
|
|||||||
Ok((preview, thumbnail))
|
Ok((preview, thumbnail))
|
||||||
}
|
}
|
||||||
|
|
||||||
fn generate_pdf_assets(bytes: &[u8]) -> Result<(GeneratedImage, GeneratedImage), String> {
|
struct PdfGeneratedAssets {
|
||||||
|
preview: GeneratedImage,
|
||||||
|
thumbnail: GeneratedImage,
|
||||||
|
page_count: u32,
|
||||||
|
}
|
||||||
|
|
||||||
|
fn generate_pdf_assets(bytes: &[u8]) -> Result<PdfGeneratedAssets, String> {
|
||||||
let pdfium = panic::catch_unwind(|| Pdfium::default())
|
let pdfium = panic::catch_unwind(|| Pdfium::default())
|
||||||
.map_err(|_| "failed to initialize PDFium".to_string())?;
|
.map_err(|_| "failed to initialize PDFium".to_string())?;
|
||||||
|
|
||||||
@@ -347,8 +401,10 @@ fn generate_pdf_assets(bytes: &[u8]) -> Result<(GeneratedImage, GeneratedImage),
|
|||||||
.load_pdf_from_byte_slice(bytes, None)
|
.load_pdf_from_byte_slice(bytes, None)
|
||||||
.map_err(|err| format!("load pdf: {err}"))?;
|
.map_err(|err| format!("load pdf: {err}"))?;
|
||||||
|
|
||||||
let page = document
|
let pages = document.pages();
|
||||||
.pages()
|
let total_pages = pages.len();
|
||||||
|
|
||||||
|
let page = pages
|
||||||
.get(0)
|
.get(0)
|
||||||
.map_err(|err| format!("load first page: {err}"))?;
|
.map_err(|err| format!("load first page: {err}"))?;
|
||||||
|
|
||||||
@@ -375,7 +431,15 @@ fn generate_pdf_assets(bytes: &[u8]) -> Result<(GeneratedImage, GeneratedImage),
|
|||||||
let preview = encode_dynamic_image(preview_image)?;
|
let preview = encode_dynamic_image(preview_image)?;
|
||||||
let thumbnail = encode_dynamic_image(thumbnail_image)?;
|
let thumbnail = encode_dynamic_image(thumbnail_image)?;
|
||||||
|
|
||||||
Ok((preview, thumbnail))
|
let page_count: u32 = total_pages
|
||||||
|
.try_into()
|
||||||
|
.map_err(|_| "page count exceeds supported range".to_string())?;
|
||||||
|
|
||||||
|
Ok(PdfGeneratedAssets {
|
||||||
|
preview,
|
||||||
|
thumbnail,
|
||||||
|
page_count,
|
||||||
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
fn encode_dynamic_image(image: image::DynamicImage) -> Result<GeneratedImage, String> {
|
fn encode_dynamic_image(image: image::DynamicImage) -> Result<GeneratedImage, String> {
|
||||||
@@ -430,3 +494,42 @@ fn persist_assets_metadata(
|
|||||||
|
|
||||||
Ok(())
|
Ok(())
|
||||||
}
|
}
|
||||||
|
|
||||||
|
fn persist_document_page_count(
|
||||||
|
state: Arc<AppState>,
|
||||||
|
document_id: Uuid,
|
||||||
|
document_version_id: Uuid,
|
||||||
|
page_count: u32,
|
||||||
|
) -> Result<(), String> {
|
||||||
|
let mut conn = state.db().map_err(|err| format!("{err:?}"))?;
|
||||||
|
|
||||||
|
let existing_metadata: Value = document_versions::table
|
||||||
|
.filter(document_versions::id.eq(document_version_id))
|
||||||
|
.filter(document_versions::document_id.eq(document_id))
|
||||||
|
.select(document_versions::metadata)
|
||||||
|
.first(&mut conn)
|
||||||
|
.map_err(|err| format!("{err:?}"))?;
|
||||||
|
|
||||||
|
let updated = match existing_metadata {
|
||||||
|
Value::Object(mut map) => {
|
||||||
|
map.insert("page_count".to_string(), Value::from(page_count));
|
||||||
|
Value::Object(map)
|
||||||
|
}
|
||||||
|
_ => {
|
||||||
|
let mut map = Map::new();
|
||||||
|
map.insert("page_count".to_string(), Value::from(page_count));
|
||||||
|
Value::Object(map)
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
diesel::update(
|
||||||
|
document_versions::table
|
||||||
|
.filter(document_versions::id.eq(document_version_id))
|
||||||
|
.filter(document_versions::document_id.eq(document_id)),
|
||||||
|
)
|
||||||
|
.set(document_versions::metadata.eq(updated))
|
||||||
|
.execute(&mut conn)
|
||||||
|
.map_err(|err| format!("{err:?}"))?;
|
||||||
|
|
||||||
|
Ok(())
|
||||||
|
}
|
||||||
|
|||||||
@@ -16,7 +16,6 @@ struct FolderResponse {
|
|||||||
struct FolderInfo {
|
struct FolderInfo {
|
||||||
id: Uuid,
|
id: Uuid,
|
||||||
name: String,
|
name: String,
|
||||||
path_cache: Option<String>,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Deserialize)]
|
#[derive(Deserialize)]
|
||||||
@@ -287,7 +286,20 @@ async fn folder_rename_updates_name_and_child_paths() -> Result<()> {
|
|||||||
.find(|f| f.id == parent.folder.id)
|
.find(|f| f.id == parent.folder.id)
|
||||||
.expect("renamed folder present");
|
.expect("renamed folder present");
|
||||||
assert_eq!(renamed.name, "Archive");
|
assert_eq!(renamed.name, "Archive");
|
||||||
assert_eq!(renamed.path_cache.as_deref(), Some("/Archive"));
|
|
||||||
|
let folders_only = app
|
||||||
|
.get(
|
||||||
|
&format!(
|
||||||
|
"/api/folders/{}/contents?include_documents=false",
|
||||||
|
parent.folder.id
|
||||||
|
),
|
||||||
|
Some(&token),
|
||||||
|
)
|
||||||
|
.await?;
|
||||||
|
assert_eq!(folders_only.status(), StatusCode::OK);
|
||||||
|
let folders_only_body = body_to_vec(folders_only.into_body()).await?;
|
||||||
|
let folders_only_contents: FolderContents = serde_json::from_slice(&folders_only_body)?;
|
||||||
|
assert!(folders_only_contents.documents.is_empty());
|
||||||
|
|
||||||
let child_contents = app
|
let child_contents = app
|
||||||
.get(
|
.get(
|
||||||
@@ -299,7 +311,7 @@ async fn folder_rename_updates_name_and_child_paths() -> Result<()> {
|
|||||||
let child_contents_body = body_to_vec(child_contents.into_body()).await?;
|
let child_contents_body = body_to_vec(child_contents.into_body()).await?;
|
||||||
let child_details: FolderContents = serde_json::from_slice(&child_contents_body)?;
|
let child_details: FolderContents = serde_json::from_slice(&child_contents_body)?;
|
||||||
let child_folder = child_details.folder.expect("child folder info");
|
let child_folder = child_details.folder.expect("child folder info");
|
||||||
assert_eq!(child_folder.path_cache.as_deref(), Some("/Archive/Q1"));
|
assert_eq!(child_folder.name, "Q1");
|
||||||
|
|
||||||
app.cleanup().await?;
|
app.cleanup().await?;
|
||||||
Ok(())
|
Ok(())
|
||||||
|
|||||||
@@ -41,3 +41,7 @@ npm run build
|
|||||||
- Tag management (create/assign/remove) from the detail panel
|
- Tag management (create/assign/remove) from the detail panel
|
||||||
- Login via the seeded admin account (`admin` / `adminadmin`) with stored JWT session
|
- Login via the seeded admin account (`admin` / `adminadmin`) with stored JWT session
|
||||||
- Inline status banner for quick feedback on API interactions
|
- Inline status banner for quick feedback on API interactions
|
||||||
|
|
||||||
|
## Assets
|
||||||
|
|
||||||
|
- The folder icon (`public/folder.svg`) is derived from the Adwaita icon theme by the [GNOME Project](http://www.gnome.org/).
|
||||||
|
|||||||
@@ -0,0 +1,14 @@
|
|||||||
|
<?xml version="1.0" encoding="UTF-8"?>
|
||||||
|
<svg height="128px" viewBox="0 0 128 128" width="128px" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||||
|
<linearGradient id="a" gradientTransform="matrix(0.45451 0 0 0.455522 -1210.292114 616.172607)" gradientUnits="userSpaceOnUse" x1="2689.251953" x2="2918.069824" y1="-1106.802979" y2="-1106.802979">
|
||||||
|
<stop offset="0" stop-color="#62a0ea"/>
|
||||||
|
<stop offset="0.0576991" stop-color="#afd4ff"/>
|
||||||
|
<stop offset="0.122204" stop-color="#62a0ea"/>
|
||||||
|
<stop offset="0.873306" stop-color="#62a0ea"/>
|
||||||
|
<stop offset="0.955997" stop-color="#c0d5ea"/>
|
||||||
|
<stop offset="1" stop-color="#62a0ea"/>
|
||||||
|
</linearGradient>
|
||||||
|
<path d="m 21.976562 12 c -5.527343 0 -9.976562 4.460938 -9.976562 10 v 86.03125 c 0 5.542969 4.449219 10 9.976562 10 h 84.042969 c 5.53125 0 9.980469 -4.457031 9.980469 -10 v -72.085938 c 0 -6.628906 -5.359375 -12 -11.972656 -12 h -46.027344 c -2.453125 0 -4.695312 -1.386718 -5.796875 -3.582031 l -1.503906 -2.992187 c -1.65625 -3.292969 -5.019531 -5.371094 -8.699219 -5.371094 z m 0 0" fill="#438de6"/>
|
||||||
|
<path d="m 65.976562 36 c -2.746093 0 -5.226562 1.101562 -7.027343 2.890625 c -2.273438 2.253906 -5.382813 5.109375 -8.632813 5.109375 h -28.339844 c -5.527343 0 -9.976562 4.460938 -9.976562 10 v 54.03125 c 0 5.542969 4.449219 10 9.976562 10 h 84.042969 c 5.53125 0 9.980469 -4.457031 9.980469 -10 v -62.03125 c 0 -5.539062 -4.449219 -10 -9.980469 -10 z m 0 0" fill="url(#a)"/>
|
||||||
|
<path d="m 65.976562 32 c -2.746093 0 -5.226562 1.101562 -7.027343 2.890625 c -2.273438 2.253906 -5.382813 5.109375 -8.632813 5.109375 h -28.339844 c -5.527343 0 -9.976562 4.460938 -9.976562 10 v 55.976562 c 0 5.539063 4.449219 10 9.976562 10 h 84.042969 c 5.53125 0 9.980469 -4.460937 9.980469 -10 v -63.976562 c 0 -5.539062 -4.449219 -10 -9.980469 -10 z m 0 0" fill="#a4caee"/>
|
||||||
|
</svg>
|
||||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -1,4 +1,5 @@
|
|||||||
import React, { useCallback, useEffect, useMemo, useState } from 'react';
|
import React, { useCallback, useEffect, useMemo, useState } from 'react';
|
||||||
|
import { createPortal } from 'react-dom';
|
||||||
import { DownloadIcon, EditIcon } from '../ui/icons';
|
import { DownloadIcon, EditIcon } from '../ui/icons';
|
||||||
import { getTagColorStyle } from '../utils/colors';
|
import { getTagColorStyle } from '../utils/colors';
|
||||||
import { formatFileSize } from '../utils/format';
|
import { formatFileSize } from '../utils/format';
|
||||||
@@ -294,6 +295,10 @@ const DetailPanel = ({
|
|||||||
const [titleDraft, setTitleDraft] = useState('');
|
const [titleDraft, setTitleDraft] = useState('');
|
||||||
const [titleSaving, setTitleSaving] = useState(false);
|
const [titleSaving, setTitleSaving] = useState(false);
|
||||||
const [titleError, setTitleError] = useState(null);
|
const [titleError, setTitleError] = useState(null);
|
||||||
|
const [ocrOpen, setOcrOpen] = useState(false);
|
||||||
|
const [ocrUrl, setOcrUrl] = useState(null);
|
||||||
|
const [ocrLoading, setOcrLoading] = useState(false);
|
||||||
|
const [ocrError, setOcrError] = useState(null);
|
||||||
|
|
||||||
useEffect(() => {
|
useEffect(() => {
|
||||||
if (!singleDoc) {
|
if (!singleDoc) {
|
||||||
@@ -301,6 +306,10 @@ const DetailPanel = ({
|
|||||||
setTitleDraft('');
|
setTitleDraft('');
|
||||||
setTitleError(null);
|
setTitleError(null);
|
||||||
setTitleSaving(false);
|
setTitleSaving(false);
|
||||||
|
setOcrOpen(false);
|
||||||
|
setOcrLoading(false);
|
||||||
|
setOcrError(null);
|
||||||
|
setOcrUrl(null);
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -312,6 +321,13 @@ const DetailPanel = ({
|
|||||||
}
|
}
|
||||||
}, [singleDoc, titleEditDocId]);
|
}, [singleDoc, titleEditDocId]);
|
||||||
|
|
||||||
|
useEffect(() => {
|
||||||
|
setOcrOpen(false);
|
||||||
|
setOcrLoading(false);
|
||||||
|
setOcrError(null);
|
||||||
|
setOcrUrl(null);
|
||||||
|
}, [singleDoc?.id]);
|
||||||
|
|
||||||
const startTitleEdit = useCallback(() => {
|
const startTitleEdit = useCallback(() => {
|
||||||
if (!singleDoc) return;
|
if (!singleDoc) return;
|
||||||
setTitleEditDocId(singleDoc.id);
|
setTitleEditDocId(singleDoc.id);
|
||||||
@@ -360,6 +376,65 @@ const DetailPanel = ({
|
|||||||
[onPromoteSelection],
|
[onPromoteSelection],
|
||||||
);
|
);
|
||||||
|
|
||||||
|
const hasOcrAsset = useMemo(
|
||||||
|
() => Boolean(singleDoc && getDocumentAsset(singleDoc, 'ocr-text')),
|
||||||
|
[singleDoc, getDocumentAsset],
|
||||||
|
);
|
||||||
|
|
||||||
|
const loadOcrUrl = useCallback(async () => {
|
||||||
|
if (!singleDoc) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
const asset = getDocumentAsset(singleDoc, 'ocr-text');
|
||||||
|
if (!asset) {
|
||||||
|
setOcrError('No OCR text available for this document.');
|
||||||
|
setOcrUrl(null);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
setOcrLoading(true);
|
||||||
|
setOcrError(null);
|
||||||
|
try {
|
||||||
|
let entry = asset;
|
||||||
|
let url = entry?.url ||
|
||||||
|
resolveDocumentAssetUrl(singleDoc, 'ocr-text', {
|
||||||
|
ensureAssetUrl,
|
||||||
|
getAsset: getDocumentAsset,
|
||||||
|
});
|
||||||
|
if (!url && typeof ensureAssetUrl === 'function') {
|
||||||
|
const ensured = await ensureAssetUrl(singleDoc.id, asset, { force: false });
|
||||||
|
if (ensured) {
|
||||||
|
entry = ensured;
|
||||||
|
}
|
||||||
|
url = entry?.url ||
|
||||||
|
resolveDocumentAssetUrl(singleDoc, 'ocr-text', {
|
||||||
|
ensureAssetUrl,
|
||||||
|
getAsset: getDocumentAsset,
|
||||||
|
});
|
||||||
|
}
|
||||||
|
if (!url) {
|
||||||
|
throw new Error('OCR text URL is unavailable.');
|
||||||
|
}
|
||||||
|
setOcrUrl(url);
|
||||||
|
} catch (error) {
|
||||||
|
setOcrError(error.message || 'Failed to load OCR text.');
|
||||||
|
setOcrUrl(null);
|
||||||
|
} finally {
|
||||||
|
setOcrLoading(false);
|
||||||
|
}
|
||||||
|
}, [singleDoc, ensureAssetUrl, getDocumentAsset]);
|
||||||
|
|
||||||
|
const openOcrModal = useCallback(() => {
|
||||||
|
if (!singleDoc) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
setOcrOpen(true);
|
||||||
|
loadOcrUrl();
|
||||||
|
}, [singleDoc, loadOcrUrl]);
|
||||||
|
|
||||||
|
const closeOcrModal = useCallback(() => {
|
||||||
|
setOcrOpen(false);
|
||||||
|
}, []);
|
||||||
|
|
||||||
const makePreviewItem = useCallback(
|
const makePreviewItem = useCallback(
|
||||||
(doc) => {
|
(doc) => {
|
||||||
if (!doc) return null;
|
if (!doc) return null;
|
||||||
@@ -681,14 +756,21 @@ const DetailPanel = ({
|
|||||||
>
|
>
|
||||||
Open preview
|
Open preview
|
||||||
</button>
|
</button>
|
||||||
<button
|
<button
|
||||||
type="button"
|
type="button"
|
||||||
className="secondary"
|
className="secondary"
|
||||||
onClick={() => onRegenerateThumbnails(singleDoc.id)}
|
onClick={() => onRegenerateThumbnails(singleDoc.id)}
|
||||||
>
|
>
|
||||||
Re-run analysis
|
Re-run analysis
|
||||||
</button>
|
</button>
|
||||||
</div>
|
</div>
|
||||||
|
{hasOcrAsset ? (
|
||||||
|
<div className="detail-ocr-trigger">
|
||||||
|
<button type="button" className="secondary" onClick={openOcrModal}>
|
||||||
|
View OCR text
|
||||||
|
</button>
|
||||||
|
</div>
|
||||||
|
) : null}
|
||||||
<TagSection
|
<TagSection
|
||||||
title="Tags"
|
title="Tags"
|
||||||
tags={tagsForDoc.map((tag) => ({
|
tags={tagsForDoc.map((tag) => ({
|
||||||
@@ -728,6 +810,47 @@ const DetailPanel = ({
|
|||||||
<pre>{JSON.stringify(metadata, null, 2)}</pre>
|
<pre>{JSON.stringify(metadata, null, 2)}</pre>
|
||||||
</div>
|
</div>
|
||||||
)}
|
)}
|
||||||
|
{hasOcrAsset && ocrOpen
|
||||||
|
? createPortal(
|
||||||
|
<div className="modal-backdrop" role="presentation" onClick={closeOcrModal}>
|
||||||
|
<div
|
||||||
|
className="modal modal--ocr"
|
||||||
|
role="dialog"
|
||||||
|
aria-modal="true"
|
||||||
|
aria-label="OCR text"
|
||||||
|
onClick={(event) => event.stopPropagation()}
|
||||||
|
>
|
||||||
|
<div className="modal__header">
|
||||||
|
<h3>OCR Text</h3>
|
||||||
|
<button
|
||||||
|
type="button"
|
||||||
|
className="icon-button ghost"
|
||||||
|
onClick={closeOcrModal}
|
||||||
|
aria-label="Close OCR text"
|
||||||
|
>
|
||||||
|
×
|
||||||
|
</button>
|
||||||
|
</div>
|
||||||
|
<div className="modal__body detail-ocr__content">
|
||||||
|
{ocrLoading ? (
|
||||||
|
<div className="meta">Loading OCR text…</div>
|
||||||
|
) : ocrError ? (
|
||||||
|
<div className="status-inline error">{ocrError}</div>
|
||||||
|
) : ocrUrl ? (
|
||||||
|
<iframe
|
||||||
|
title="OCR text"
|
||||||
|
src={ocrUrl}
|
||||||
|
className="detail-ocr__frame"
|
||||||
|
/>
|
||||||
|
) : (
|
||||||
|
<div className="meta">OCR text empty.</div>
|
||||||
|
)}
|
||||||
|
</div>
|
||||||
|
</div>
|
||||||
|
</div>,
|
||||||
|
document.body,
|
||||||
|
)
|
||||||
|
: null}
|
||||||
</>
|
</>
|
||||||
);
|
);
|
||||||
};
|
};
|
||||||
|
|||||||
@@ -1,7 +1,9 @@
|
|||||||
import React, { useCallback, useEffect, useMemo, useRef } from 'react';
|
import React, { useCallback, useEffect, useMemo, useRef } from 'react';
|
||||||
import { resolveDocumentAssetUrl } from '../asset_manager';
|
import { resolveDocumentAssetUrl } from '../asset_manager';
|
||||||
import { getTagColorStyle } from '../utils/colors';
|
import { getTagColorStyle } from '../utils/colors';
|
||||||
import { DownloadIcon, FolderIcon, EditIcon, ViewListIcon, ViewGridIcon } from '../ui/icons';
|
import { DownloadIcon, EditIcon, ViewListIcon, ViewGridIcon } from '../ui/icons';
|
||||||
|
|
||||||
|
const FOLDER_ICON_SRC = '/folder.svg';
|
||||||
|
|
||||||
const TAG_MIME_TYPES = ['application/x-papercrate-tag', 'text/papercrate-tag'];
|
const TAG_MIME_TYPES = ['application/x-papercrate-tag', 'text/papercrate-tag'];
|
||||||
|
|
||||||
@@ -368,13 +370,16 @@ const DocumentsTable = ({
|
|||||||
}}
|
}}
|
||||||
>
|
>
|
||||||
<div className="folder-card__icon">
|
<div className="folder-card__icon">
|
||||||
<FolderIcon className="folder-card__icon-svg" size={128} />
|
<img
|
||||||
|
src={FOLDER_ICON_SRC}
|
||||||
|
alt="Folder"
|
||||||
|
className="folder-card__icon-svg"
|
||||||
|
/>
|
||||||
</div>
|
</div>
|
||||||
<div className="folder-card__meta">
|
<div className="folder-card__meta">
|
||||||
<div className="folder-card__name" title={folder.name}>
|
<div className="folder-card__name" title={folder.name}>
|
||||||
{folder.name}
|
{folder.name}
|
||||||
</div>
|
</div>
|
||||||
<div className="folder-card__badge">Folder</div>
|
|
||||||
</div>
|
</div>
|
||||||
</div>
|
</div>
|
||||||
);
|
);
|
||||||
@@ -545,7 +550,11 @@ const DocumentsTable = ({
|
|||||||
>
|
>
|
||||||
<td className="thumb-cell">
|
<td className="thumb-cell">
|
||||||
<div className="thumb-icon">
|
<div className="thumb-icon">
|
||||||
<FolderIcon className="icon-inline" size={18} />
|
<img
|
||||||
|
src={FOLDER_ICON_SRC}
|
||||||
|
alt="Folder"
|
||||||
|
className="thumb-icon__image"
|
||||||
|
/>
|
||||||
</div>
|
</div>
|
||||||
</td>
|
</td>
|
||||||
<td className="doc-list__name">
|
<td className="doc-list__name">
|
||||||
|
|||||||
+12
-4
@@ -1295,13 +1295,18 @@ const AppLayout = () => {
|
|||||||
|
|
||||||
|
|
||||||
const ensureFolderData = useCallback(
|
const ensureFolderData = useCallback(
|
||||||
async (folderId, { force = false } = {}) => {
|
async (folderId, { force = false, includeDocuments = true } = {}) => {
|
||||||
if (!force && folderContents.has(folderId)) {
|
if (!force && folderContents.has(folderId)) {
|
||||||
return folderContents.get(folderId);
|
return folderContents.get(folderId);
|
||||||
}
|
}
|
||||||
|
|
||||||
const path = folderId === 'root' ? 'root' : folderId;
|
const path = folderId === 'root' ? 'root' : folderId;
|
||||||
const { data } = await api.get(`/folders/${path}/contents`);
|
const params = includeDocuments
|
||||||
|
? undefined
|
||||||
|
: { include_documents: false };
|
||||||
|
const { data } = await api.get(`/folders/${path}/contents`, {
|
||||||
|
params,
|
||||||
|
});
|
||||||
const hydrated = assetManager.hydrateFolderContents(data);
|
const hydrated = assetManager.hydrateFolderContents(data);
|
||||||
|
|
||||||
setFolderNodes((prev) => {
|
setFolderNodes((prev) => {
|
||||||
@@ -1363,7 +1368,10 @@ const AppLayout = () => {
|
|||||||
visited.add(nextId);
|
visited.add(nextId);
|
||||||
|
|
||||||
try {
|
try {
|
||||||
const contents = await ensureFolderData(nextId, { force: false });
|
const contents = await ensureFolderData(nextId, {
|
||||||
|
force: false,
|
||||||
|
includeDocuments: false,
|
||||||
|
});
|
||||||
const subfolders = Array.isArray(contents?.subfolders) ? contents.subfolders : [];
|
const subfolders = Array.isArray(contents?.subfolders) ? contents.subfolders : [];
|
||||||
subfolders.forEach((entry) => {
|
subfolders.forEach((entry) => {
|
||||||
if (entry?.id && !visited.has(entry.id)) {
|
if (entry?.id && !visited.has(entry.id)) {
|
||||||
@@ -4090,7 +4098,7 @@ const AppLayout = () => {
|
|||||||
const node = folderNodes.get(folderId);
|
const node = folderNodes.get(folderId);
|
||||||
if (node && !node.loaded) {
|
if (node && !node.loaded) {
|
||||||
try {
|
try {
|
||||||
await ensureFolderData(folderId);
|
await ensureFolderData(folderId, { includeDocuments: false });
|
||||||
} catch (error) {
|
} catch (error) {
|
||||||
notifyApiError(error, 'Failed to load folder.');
|
notifyApiError(error, 'Failed to load folder.');
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,5 +1,7 @@
|
|||||||
import React, { useCallback, useMemo } from 'react';
|
import React, { useCallback, useMemo } from 'react';
|
||||||
import { ChevronIcon, FolderIcon, TrashIcon, EditIcon } from '../ui/icons';
|
import { ChevronIcon, TrashIcon, EditIcon } from '../ui/icons';
|
||||||
|
|
||||||
|
const FOLDER_ICON_SRC = '/folder.svg';
|
||||||
import { getTagColorStyle } from '../utils/colors';
|
import { getTagColorStyle } from '../utils/colors';
|
||||||
|
|
||||||
const FolderNode = ({
|
const FolderNode = ({
|
||||||
@@ -66,7 +68,7 @@ const FolderNode = ({
|
|||||||
</span>
|
</span>
|
||||||
)}
|
)}
|
||||||
<span className="name">
|
<span className="name">
|
||||||
<FolderIcon className="folder-icon" />
|
<img src={FOLDER_ICON_SRC} alt="Folder" className="folder-icon-image" />
|
||||||
{node.name}
|
{node.name}
|
||||||
</span>
|
</span>
|
||||||
{node.id !== 'root' && (
|
{node.id !== 'root' && (
|
||||||
|
|||||||
+59
-8
@@ -858,11 +858,10 @@ button.icon-button.ghost:hover:not([disabled]) {
|
|||||||
padding-right: 3rem;
|
padding-right: 3rem;
|
||||||
}
|
}
|
||||||
|
|
||||||
.folder-row span.name .folder-icon {
|
.folder-row span.name .folder-icon-image {
|
||||||
width: 1rem;
|
width: 1rem;
|
||||||
height: 1rem;
|
height: 1rem;
|
||||||
flex-shrink: 0;
|
flex-shrink: 0;
|
||||||
color: var(--accent);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
.folder-row:hover {
|
.folder-row:hover {
|
||||||
@@ -1242,12 +1241,12 @@ button.icon-button.ghost:hover:not([disabled]) {
|
|||||||
display: inline-flex;
|
display: inline-flex;
|
||||||
align-items: center;
|
align-items: center;
|
||||||
justify-content: center;
|
justify-content: center;
|
||||||
color: var(--accent);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
.thumb-icon svg {
|
.thumb-icon__image {
|
||||||
width: 32px;
|
width: 32px;
|
||||||
height: 32px;
|
height: 32px;
|
||||||
|
display: block;
|
||||||
}
|
}
|
||||||
|
|
||||||
.documents-panel th.actions-column,
|
.documents-panel th.actions-column,
|
||||||
@@ -1380,12 +1379,12 @@ button.icon-button.ghost:hover:not([disabled]) {
|
|||||||
justify-content: center;
|
justify-content: center;
|
||||||
width: 128px;
|
width: 128px;
|
||||||
height: 128px;
|
height: 128px;
|
||||||
color: var(--accent);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
.folder-card__icon-svg {
|
.folder-card__icon-svg {
|
||||||
width: 100%;
|
width: 100%;
|
||||||
height: 100%;
|
height: 100%;
|
||||||
|
object-fit: contain;
|
||||||
}
|
}
|
||||||
|
|
||||||
.folder-card__meta {
|
.folder-card__meta {
|
||||||
@@ -1396,12 +1395,10 @@ button.icon-button.ghost:hover:not([disabled]) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
.folder-card__name {
|
.folder-card__name {
|
||||||
font-weight: 600;
|
|
||||||
font-size: 0.95rem;
|
|
||||||
color: var(--fg);
|
color: var(--fg);
|
||||||
overflow: hidden;
|
overflow: hidden;
|
||||||
text-overflow: ellipsis;
|
text-overflow: ellipsis;
|
||||||
white-space: nowrap;
|
white-space: break-word;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
@@ -1516,6 +1513,60 @@ button.icon-button.ghost:hover:not([disabled]) {
|
|||||||
margin: 0.6rem 0;
|
margin: 0.6rem 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
.detail-ocr-trigger {
|
||||||
|
margin: 0.75rem 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
.detail-ocr__content {
|
||||||
|
max-height: 60vh;
|
||||||
|
overflow: auto;
|
||||||
|
padding: 0.75rem;
|
||||||
|
background: var(--surface-soft);
|
||||||
|
border: 1px solid var(--border);
|
||||||
|
border-radius: 6px;
|
||||||
|
box-shadow: inset 0 1px 2px rgba(15, 23, 42, 0.05);
|
||||||
|
}
|
||||||
|
|
||||||
|
.detail-ocr__content pre {
|
||||||
|
margin: 0;
|
||||||
|
white-space: pre-wrap;
|
||||||
|
word-break: break-word;
|
||||||
|
font-family: var(--font-mono, 'SFMono-Regular', Consolas, 'Liberation Mono', Menlo, monospace);
|
||||||
|
font-size: 0.85rem;
|
||||||
|
line-height: 1.4;
|
||||||
|
}
|
||||||
|
|
||||||
|
.detail-ocr__frame {
|
||||||
|
width: 100%;
|
||||||
|
min-height: 360px;
|
||||||
|
height: 60vh;
|
||||||
|
border: none;
|
||||||
|
background: var(--surface-subtle);
|
||||||
|
border-radius: 4px;
|
||||||
|
box-shadow: inset 0 1px 2px rgba(15, 23, 42, 0.05);
|
||||||
|
}
|
||||||
|
|
||||||
|
.modal__body {
|
||||||
|
width: 100%;
|
||||||
|
}
|
||||||
|
|
||||||
|
.modal--ocr {
|
||||||
|
width: min(720px, 100%);
|
||||||
|
max-height: 80vh;
|
||||||
|
gap: 0.75rem;
|
||||||
|
}
|
||||||
|
|
||||||
|
.modal--ocr .modal__header {
|
||||||
|
display: flex;
|
||||||
|
align-items: center;
|
||||||
|
justify-content: space-between;
|
||||||
|
gap: 0.75rem;
|
||||||
|
}
|
||||||
|
|
||||||
|
.modal--ocr .modal__body {
|
||||||
|
padding: 0;
|
||||||
|
}
|
||||||
|
|
||||||
.preview-pane {
|
.preview-pane {
|
||||||
margin-top: 0.4rem;
|
margin-top: 0.4rem;
|
||||||
border: none;
|
border: none;
|
||||||
|
|||||||
Reference in New Issue
Block a user