Clonez le dépot, installez les dépendances, et lancez le serveur local qui se recharge lorsque vous sauvegardez des fichiers dans le dépot. Les fois suivantes vous n'aurez qu'a lancer yarn start.
Pour interagir avec la base de données, il vous faudra également faire démarrer l'API Symfony de backend dans l'autre dépot, qui se lance par défaut sur le port 8000.
-
Pas de config docker
-
Nous n'avons pas actuellement de config docker qui solutionnerait tout ça, les merge request sont les bienvenues! :)
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
Français: Cette page n'est pas traduite en Français.
-
-
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/.
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
Idées pour de futures améliorations (pertinence à vérifier)
-
-
Gagner en vie privée en chiffrant certaines informations ? Stockage zéro knowledge avec un chiffrement robuste à courbe elliptique.
-
À réfléchir : permettre à Framadate de faire entrer à des gens plusieurs plages de temps de disponibilité et le service déduit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait être avec divers niveaux de détail. Comme https://omnipointment.com/ (qui est un logiciel privateur)
voir le [changelog.md]
-Les idées et rapports de bugs sont disponibles dans le tableau des Issues sur la forge logicielle.
-
principales
-
-
Accessibilité renforcée.
-
Adapté aussi bien sur mobile que grands écrans à haute ou faible densité de pixels.
-
Tests unitaires et end-to-end.
-
Couverture de test.
-
Choix de réponses possibles. Proposer de ne répondre que « oui » ou rien, ou aller dans la nuance en proposant « oui », « peut-être », « non », « ? ». # Redondance ou le choix de réponses possibles de la première phrase concerne un autre choix ?
-
Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien.
-
Thème sombre.
-
Duplication de sondage à partir d'un autre.
-
Limiter le nombre de participants maximum
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
All doc for Angular is available under https://www.angular.io
-
Code scaffolding
-
Run ng generate component component-choice_label to generate a new component. You can also use ng generate directive|pipe|service|class|guard|interface|enum|module.
-
Build
-
Run ng build to build the project. The build artifacts will be stored in the dist/ directory. Use the --prod flag for a production build.
Vérifiez toujours que ce que vous développez est Accessible pour des personnes aux handicaps divers tels que le préconise le WECAG.
-https://www.w3.org/Translations/WCAG20-fr/
-
Quelques lignes à vérifier:
-* Couleurs contrastées
-* ordre des liens cohérent
-* textes des liens éloquents
-* textes alternatifs aux images les décrivant
-* possibilité de changer la taille des textes et le thème visuel
-* couleurs lisibles pour les personnes daltoniennes
-* raccourcis claviers. alt+t pour passer a un autre thème visuel par exemple.
-* attributs aria pour les lecteurs d'écran
-* performance de chargement pour les petits débits
-* server side rendering
-* pas d'éléments perdus en dehors de l'écran, faites du mobile first
-* parcimonie: si un élément n'est pas prévu pour être montré sur petit écran, ne le mettez pas sur grand écran sous prétexte qu'il y a plus de place.
-* less is more
-* système de recherche basique
-
N'ayez pas peur de demander de l'aide
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
Documentation de référence dans le dossier "doc" de ce dépot.
-
Frontend généré avec Angular CLI
-
chaque commit sur ce dépot passe les contrôles de format de Husky avant de pouvoir être envoyé.
-
Doc sur l'api du nouveau backend à utiliser pour les appels REST du front funky : https://framagit.org/tykayn/date-poll-api/wikis/home
- toujours se référer à la sortie de la commande de symfony bin/console debug:router du dépot back.
-
-
ancien backend en PHP sans framework ici pour mémoire : https://framagit.org/framasoft/framadate/framadate
png créé avec sqlfairy https://www.cipherbliss.com/exporter-une-visualisation-de-son-schma-sql/
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
-
-
-
-
-
-
-
-
-
-
-
Keyboard Shortcuts
-
-
-
-
-
-
-
Keys
-
Action
-
-
-
-
-
?
-
Open this help
-
-
-
n
-
Next page
-
-
-
p
-
Previous page
-
-
-
s
-
Search
-
-
-
-
-
-
-
-
-
-
-
diff --git a/site/cadrage/backend-api-endpoints-doc.txt b/site/cadrage/backend-api-endpoints-doc.txt
deleted file mode 100644
index 7926807c..00000000
--- a/site/cadrage/backend-api-endpoints-doc.txt
+++ /dev/null
@@ -1,56 +0,0 @@
-# temporary documentation of backend API endpoints
-
- ------------------------------------------ ---------- -------- ------ ------------------------------------------------
- Name Method Scheme Host Path
- ------------------------------------------ ---------- -------- ------ ------------------------------------------------
- _twig_error_test ANY ANY ANY /_error/{code}.{_format}
- admin_homepage_get_default GET ANY ANY /admin/
- admin_homepage_clean_expired_polls GET ANY ANY /admin/polls/clean/{token}
- admin_homepage_migrate_framadate GET ANY ANY /admin/polls/migrate
- api_get_poll_comment GET ANY ANY /api/v1/poll/{id}/comments
- api_new_comment POST ANY ANY /api/v1/poll/{id}/comment
- api_poll_comments_delete DELETE ANY ANY /api/v1/poll/{id}/comments
- api_page_home GET ANY ANY /page/
- user_homepageget_default GET ANY ANY /user/
- user_homepage_polls_send_by_email GET ANY ANY /user/{email}/polls/send-by-email
- poll_index GET ANY ANY /poll/
- poll_new GET|POST ANY ANY /poll/new
- poll_show GET ANY ANY /poll/{id}
- poll_edit GET|POST ANY ANY /poll/{id}/edit
- poll_delete DELETE ANY ANY /poll/{id}
- api_new_vote_stack POST ANY ANY /api/v1/poll/{id}/answer
- api_update_vote_stack PATCH ANY ANY /api/v1/vote-stack/{id}/token/{modifierToken}
- api_poll_votes_delete DELETE ANY ANY /api/v1/poll/{id}/votes/{accessToken}
- api_get_all_polls GET ANY ANY /api/v1/poll/
- api_get_poll GET ANY ANY /api/v1/poll/{id}
- api_update_poll PUT ANY ANY /api/v1/poll/{id}/{token}
- api_new_poll POST ANY ANY /api/v1/poll/
- api_test-mail-poll GET ANY ANY /api/v1/poll/mail/test-mail-poll/{emailChoice}
- api_poll_delete DELETE ANY ANY /api/v1/poll/{id}
- api_check_slug_is_unique GET ANY ANY /api/v1/poll/slug/{slug}
- api_get_admin_config GET ANY ANY /api/v1/poll/admin/{token}
- overblog_graphql_endpoint ANY ANY ANY /api/graphql/
- overblog_graphql_batch_endpoint ANY ANY ANY /api/graphql/batch
- overblog_graphql_multiple_endpoint ANY ANY ANY /api/graphql/graphql/{schemaName}
- overblog_graphql_batch_multiple_endpoint ANY ANY ANY /api/graphql/graphql/{schemaName}/batch
- app.swagger GET ANY ANY /api/doc.json
- ------------------------------------------ ---------- -------- ------ ------------------------------------------------
-
-
-/**
- * WANTED CHANGES (seraf)
- * -------------------------- -------- -------- ------ ------------------------------------------------
- Name Method Scheme Host Path
- -------------------------- -------- -------- ------ ------------------------------------------------
- api_get_poll_comment GET ANY ANY /polls/{id}/comment
- api_delete_poll_comments DELETE ANY ANY /polls/{id}/comment
- api_user_polls_send_by_email GET ANY ANY /users/{email}/polls/send-by-email
- api_get_user_polls GET ANY ANY /users/{email}/polls
- api_get_poll_slug GET ANY ANY /polls/slug/{id}/{token}
- api_clean_expired_polls GET ANY ANY /admin/clean-polls/{token}
-
- api_test-mail-polls GET ANY ANY /polls/mail/test-mail-polls/{emailChoice}
- api_update_vote_stack PATCH ANY ANY /polls/{slug}/answers/{pseudo}/token/{modifierToken}
-
- -------------------------- -------- -------- ------ ------------------------------------------------
- */
diff --git a/site/cadrage/i18n/index.html b/site/cadrage/i18n/index.html
deleted file mode 100644
index d9deedc4..00000000
--- a/site/cadrage/i18n/index.html
+++ /dev/null
@@ -1,276 +0,0 @@
-
-
-
-
-
-
-
-
-
-
- Traduction - Funky Framadate Front end
-
-
-
-
-
-
-
-
-
-
-
-
-
Toutes les chaînes de texte doivent être disponible en minimum deux langues: Français et Anglais.
-
La documentation a été pensée pour être compréhensible en premier lieu par des personnes francophones, le projet étant issu de Framasoft et de personnes uniquement Francophones, nous avons jugé que c'était le moyen le plus efficace pour le faire grandir.
-
Voir les fichiers src/assets/i18n EN.json et FR.json
-La traduction se base sur un système de clés-valeur.
-Les clés sont entrées dans les templates html, et c'est la config d'Angular qui les traduit selon la langue demandée par le visiteur du site.
-
Chaque fichier de traduction est déclaré dans le AppModule avec le module @ngx-translate. Examinez l'exemple pour rajouter votre propre traduction.
-
Utilisez des sous groupes dans vos traductions afin de mieux segmenter les chaines de caractère par page et selon le sens qu'elles sous tendent.
Empêcher votes et commentaires mais conserver les résultats
-
-
-
Slug
-
Partie le l'URL identifiant un sondage de manière unique
-
-
-
-
Fonctionnalités actuellement dans framadate legacy et à conserver
-
Généralités
-
Il existe deux types de sondage. Le type « dates » est adapté à la proposition de dates (voir §plages horaires) et le type « texte », plus généraliste, ne contient que du texte. Ce choix est l'un des premiers choix effectués lors de la création d'un nouveau sondage.
-
Deux types d'acteurs sont distingués : la personne ayant créé le sondage et les personnes qui répondent au sondage. Ces deux types d'acteurs n'ont pas les mêmes droits sur le sondage : la personne ayant créé le sondage est la seule ayant des droits d'administration sur celui-ci, en plus des droits des participants. En particulier, les droits d'administration permettent d'ajuster les droits des participants.
-
Création d'un sondage
-
Il est nécessaire de fournir un email lors de la création du sondage. Cela permet aux créateurs de sondages de pouvoir obtenir via email la liste des sondages qu'ils ont créés.
-
Il est possible de choisir le slug dans l'URL du sondage, à condition que ce slug soit disponible.
-
Le sondage reste modifiable après sa création.
-
Plages horaires
-
Les sondages de type « dates » permettent de proposer des jours et des plages horaires pour chaque journée.
-
Pour faciliter la saisie des dates proposées, il est demandé si les plages horaires sont les mêmes chaque jour ou si elles sont différentes selon les jours. Dans le premier cas, les plages horaires sont demandées uniquement pour le premier jour et sont automatiquement reproduites sur les autres jours.
-
Toujours pour faciliter la saisie des propositions, il est possible d'ajouter plusieurs jours consécutifs en sélectionnant le premier et le dernier jour plutôt qu'en sélectionnant chaque jour un à un.
-
Participation à un sondage
-
Votes
-
Les participants n'ont pas besoin de créer un compte ou de fournir leur email pour participer à un sondage.
-
Le créateur du sondage peut protéger le sondage par un mot de passe. Sans ce mot de passe, il est impossible de voir le sondage, donc impossible d'y voter. Attention cependant, le sondage est stocké en clair dans la base de données et ne bénéficie donc d'aucun chiffrement. # Le mot de passe, lui, est-il chiffré ?
-
Le créateur du sondage choisit de permettre ou non les modifications des votes sur le sondage. Il a le choix entre les trois formules suivantes :
-
-
ne pas permettre de modifier de réponse ;
-
permettre de modifier uniquement sa propre réponse a un sondage (modalités d'identification encore non déterminées) ;
-
permettre de modifier toute réponse à un sondage (y compris celles des autres).
-
-
Commentaires
-
Les participants au sondage ont la possibilité de créer des commentaires sur le sondage. Seule la personne ayant les droits d'administration sur le sondage peut modifier les commentaires.
-
Résultats
-
Selon la configuration du sondage, les résultats peuvent n'être accessibles qu'à la personne ayant un accès d'administration ou bien être publics. Les personnes pouvant accéder aux résultats du sondage peuvent exporter ces résultats au format CSV.
-
Emails
-
Lorsqu'une personne crée un sondage, un email reprenant les informations du sondage ainsi que les URL uniques servant à le modifier (lien d'administration) et à y participer (lien à transmettre aux participants) lui est envoyé. De plus, elle peut choisir de recevoir des emails lors d'un nouveau vote ou commentaire sur le sondage.
-
Une personne ayant créé au moins un sondage peut demander à recevoir par email la liste des sondages qu'elle a créés en utilisant cette adresse email.
-
Stockage et export de données
-
Les données sont stockées en clair sur le serveur. L'archivage (resp. suppression) automatique des sondages est effectué via cronjob 90 (resp. 120) jours après sa création. Il est possible pour l'administrateur d'un sondage de modifier la durée avant archivage et la suppression automatique suit toujours de 30 jours la date d'archivage.
-
L'export d'un sondage et des résultats d'un sondage est possible au format CSV.
-
Nouveautés principales
-
-
Accessibilité renforcée.
-
Traduction dynamique de toutes les phrases en choisissant la langue dans le menu.
-
Adapté aussi bien sur mobile que grands écrans à haute ou faible densité de pixels.
-
Anti-spam de commentaires.
-
Anti-spam de vote.
-
Tests unitaires et end-to-end.
-
Couverture de test.
-
-
Nouveautés secondaires
-
-
Choix de réponses possibles. Proposer de ne répondre que « oui » ou rien, ou aller dans la nuance en proposant « oui », « peut-être », « non », « ? ». # Redondance ou le choix de réponses possibles de la première phrase concerne un autre choix ?
-
Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien.
-
Thème sombre.
-
Boutons pour copier dans le presse-papier les liens publics et privés / admin des sondages.
-
Limiter le nombre de participants maximum
-
-
Idées pour de futures améliorations (pertinence à vérifier)
-
-
Gagner en vie privée en chiffrant certaines informations ?
-
À réfléchir : permettre à Framadate de faire entrer à des gens plusieurs plages de temps de disponibilité et le service déduit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait être avec divers niveaux de détail. Comme https://omnipointment.com/ (qui est un logiciel privateur)
-
SSO du fédiverse ?
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
Vous pouvez modifier les variables d'environnement afin de modifier le logo et le titre de votre installation.
-Ce logiciel étant libre et sous la licence GNU Affero V3 vous pouvez bien entendu le modifier à volonté. Voici donc un guide concernant le titre et le logo.
-
Modifiez le fichier src/environment.prod.ts, et remplacez le contenu des variables appTitle (un texte, pas forcément un seul mot) et appLogo (une URL absolue ou relative d'image)
- Et voilà!
-
Quand vous builderez votre app, vous verrez ces valeurs dans la barre titre, incluses par le composant HeaderComponent automatiquement.
-
Vous pouvez modifier les valeurs dans le fichier src/environment.ts pour voir ce que cela donne en environnement de développement en lancant l'app avec npm start ou yarn start.
-
Customization
-
Change the content of the file src/environment.prod.ts, and the content of the vars appTitle (any text) and appLogo (any picture URL, relative or absolute) .
- And voilà!
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
Il existe des tas de façons de contribuer à un logiciel libre comme Framadate. Vous pouvez discuter avec d'autres personnes de ce que vous souhaiteriez voir naître dans le logiciel, essayer de l'utiliser dans sa version expérimentale, mettre en place une démo ou un service publiquement utilisable, écrire des modifications de code, proposer de l'aide de toute sorte, traduire les textes, vérifier l'accessibilité, lire la documentation d'architecture etc...
-
-
Avoir un compte Framateam, et Framagit si vous souhaitez contribuer au code
-
Examiner les tickets
-Discuter avec les autres membres participant, sur un ticket en particulier et aussi dans les canaux de framateam
-
Nous avons créé deux canaux: un pour les discussions générales, et un autre pour les discussions techniques de dev. Prenez soin de bien cibler le canal dans lequel vous communiquez afin de ne pas faire peur aux gens qui ne codent pas et qui souhaitent contribuer de toutes les autres façons.
choisir un ticket gitlab consacré à votre branche, si il n'en existe pas, le créer. Un ticket doit avoir un sujet suffisament petit pour pouvoir le réaliser dans un temps raisonnable. Faites des sous-tickets reliés pour les longues fonctionnalités. Le but des tickets n'étant pas de rester ad vitam dans la backlog, mais bien de montrer un avancement détaillé, avec un titre évocateur. "exit donc les tickets du genre 'ça ne marche pas' ou 'finir framadate'"
-
Faire une branche dédiée à vos modifications en lui mettant un nom éloquent.
- git checkout -b ma-description-de-fonctionnalite
-
lisez les logs des commits les plus récents pour comprendre ce qui se passe.
-
Faites des petits commits, avec un titre désignant précisément ce sur quoi vous progressez.
-
Faire une merge request sur framagit qui sera soumise à la revue de code par les pairs du projet.
-
Continuer à interagir avec les autres membres pour utiliser au mieux les savoir-faire de chacun et ne pas se marcher sur les pieds.
-
Mettez toujours en avant la politesse et l'empathie, la collaboration n'en sera que meilleure.
-
N'hésitez pas à contacter en direct les personnes avec lesquelles vous souhaitez avancer.
-
-
Qui veut faire quoi ?
-
-
maiwann : maquettes, UX
-
tykayn : développeur front end, JS & styles
-
newick : intégrateur dans la vraie vie
-
llaq : plutôt HTML / css et un peu de développement en php
-
talone : plutôt coté JS
-
tcit : dev tout qui connait bien le backend de Framadate actuel
-
pouhiou : soutien moral
-
come_744 : git, découverte d'angular
-
arnaldo : php, découverte du libre
-
elbuffeto : l'intégration HTML/CSS, accessibilité
-
l4pin : un peu de front JS, beaucoup de back
-
wadouk : dev compilé (elm, haskell, scala)
-
cbossard : dev (plutôt backend), java/javascript, avec un peu de temps en ce moment
(How one can reproduce the issue - this is very important)
-
Example Project
-
(If possible, please create an example project here on GitLab.com that exhibits the problematic
-behavior, and link to it here in the bug report.
-If you are using an older version of GitLab, this will also determine whether the bug has been fixed
-in a more recent version)
-
What is the current bug behavior?
-
(What actually happens)
-
What is the expected correct behavior?
-
(What you should see instead)
-
Relevant logs and/or screenshots
-
(Paste any relevant logs - please use code blocks (```) to format console output, logs, and code, as
-it's very hard to read otherwise.)
-
Possible fixes
-
(If you can, link to the line of code that might be responsible for the problem)
EN: A libre polling software made by contributors around the French association Framasoft.
-This version uses a brand new backend API.ntributeurs de l'association Framasoft, avec une API backend.
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend.
-
Index
-
-
Meeting notes
-
Getting Started (yarn start / npm start)
-
How to contribute
-
Architecture
-
Translation i18n
-
Accesibility
-
Licence GNU affero V3
-
-
Framadate - funky version
-
FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend.
-EN: A libre polling software made by contributors around the French association Framasoft.
-This version uses a brand new backend API.
FR: Toute la documentation est disponible dans le dossier "doc", principalement en Français.
-EN: All documentation is available in the "doc" folder, mainly in French because reasons.
FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend.
-
-
EN: A libre polling software made by contributors around the French association Framasoft.
-This version uses a brand new backend API.ntributeurs de l'association Framasoft, avec une API backend.
-
Index
-
-
Meeting notes
-
Getting Started (yarn start / npm start)
-
How to contribute
-
Architecture
-
Translation i18n
-
Accesibility
-
Licence GNU affero V3
-
-
Framadate - funky version
-
FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend.
-EN: A libre polling software made by contributors around the French association Framasoft.
-This version uses a brand new backend API.
Quel est le projet ? Quels sont les enjeux ?
-Quelles méthodes de travail ?
-Quel niveau de qualité ? standards et de bonnes pratiques ?
- *
-Quelles priorités ?
- *
-Qui veut faire quoi ?
- *
discussion via framatalk ? plutôt mumble !
-
-Se connecter à mumble.tcit.fr. Il n'a pas de mot de passe et il y a un salon Framadate ouvert.
-
-
-qui peut/veut faire quoi ?
-
-tykayn: dev front end, JS & styles
-
-newick : intégrateur dans la vraie vie
-
-llaq : plutôt HTML
-
-talone : plutôt coté JS
-
-
-on ne s'occupe toujours que du front ?
-
-[newick] Est-ce que tout le monde est ok sur le fait de faire que le front et pas tout ?
-
-llaq : pas de souci avec le back, donc pourquoi le changer ?
-
-Ok on y touche pas
-
-
-repartir de 0 ?
-
-Je parle de funky framadate
-
-llaq : Pourquoi pas recommencer car c'est bien différent des maquettes
-
-newick : On est toujours en mode "MVP", on fait ça pour tester les maquettes et ensuite seulement on le connecte au back-end ?
-
-maiwann : Ouip tant que ça reste cohérent niveau expérience de l'utilisateur
-
-newick : C'est plutot coté JS qu'il faut voir… talone ?
-
-Talone : on peut faire des choses, je maitrise pas php
-
-llaq : moi non plus
-
-talone : il y a des contributeurices de framadate ici ?
-
-maiwann : nope :x
-
-newick : on peut avancer comme ça, surtout sur le front et ensuite on verra le back ?
-
-talone & llaq : oui on peut faire ça
-
-
[tentative de tykayn de nous rejoindre]
-
pourquoi y'a des pages php dans le dossier front end ?
-
-newick : C'est dans le dossier principal, pas dans funky
-
-maiwann : donc a priori rien d'obligatoire ?
-
-
-API de backend existe t elle?
-
-llaq : nope ^_^
-
-
-
-
-Sass, css, autre ?
-
-https://css2sass.herokuapp.com/ pour convertir le css actuel vers du sass
-
-
-
-
-intérêt de Bootstrap / frameworks ?
-
-Angular cli pour se concentrer sur des composants front end
-
-Boostrap a priori c'est pas forcément nécessaire, newick assez à l'aise pour ne pas en avoir besoin dans HTML / CSS
-
-Composants <3 Atomic design <3
-
-tykayn : propose de faire une démo
-
-(Beaucoup de discussion sur les framework front, j'ai pas tout compris ce qu'il se passait donc mes notes sont très limitées !)
-
-En gros, on fait du Angular et chacun intègre son truc indépendamment
-
-
Invitation sur funkyframadate, on repart de 0 !
-La suite
-remplissons le wiki et les board d'issues
-on zieute la démo et on voit ce qu'on fait ensuite
-
-
Questions notées par Come.
-
Suite au visionnage de la vidéo de présentation de maiwann (Framadate_Presentation_maquettes.flv), des questions ont été levées :
-
-
Quel est l'intérêt de différentier les dates limites de modification et vote ? Pourquoi appelle-t-on cela archivage ?
-
Peut-on écrire plus explicitement que le nom du créateur, s'il est renseigné, est affiché à ceux qui répondent ?
-
Lors de la validation du vote, peut-on mettre davantage en avant l'importance de l'URL d'édition afin d'éviter la fermeture machinale (par réflexe) du popup ?
-
Pour la vue des réponses, pourquoi ne pas mettre pour tous les utilisateurs les petites icônes actuellement réservées aux daltoniens ? On économiserait alors un champ.
-
-
Quitte à faire la chasse aux clics, pour les menus déroulants à deux options (du type « je veux » / « je ne veux pas ») qui nécessitent deux clics pour commuter, pourquoi pas une commutation en un clic ; comme une check-box mais avec du texte à la place du check ? Bien-sûr, ceci à condition que les champs conditionnels ne soient pas vidés lorsqu'ils disparaissent.
-
-
-
Y a-t-il des champs obligatoires ? Si oui, comment les matérialiser ?
-
-
En cas d'erreur à la validation du formulaire (pour cause de champ vide ou format incorrect par exemple), on affiche systématiquement le message d'erreur en orange (cf. écran sondage_date_intervalle) en dessous du champ concerné ?
-
Quel est l'état de focus sur les champs ? Celui par défaut du navigateur ?
-
Étant donné qu'il y a plusieurs étapes dans la création du sondage, ne faudrait-il pas les indiquer au début de la page ? Ex : 1/3, 2/3, 3/3 (je tire ça des bonnes pratiques opquast)
-
Dans le récapitulatif à la fin, pourquoi ne rappelle-t-on pas également le titre et la description du sondage créé ?
-
-
Les boutons :
-
-
-
Quel est l'état de focus sur les boutons ?
-
-
-
Sur l'écran « Mot de passe », le bouton « Voir » est-il immédiatement actif ou on attend d'avoir tapé la première lettre ? Une fois qu'on a cliqué sur « Voir », est-ce que le contenu du bouton devient « Masquer » ?
-
-
-
Dans ta vidéo tu précises que le popup pour ajouter l'intervalle de dates se situe en dessous du calendrier pour qu'on puisse voir les dates préalablement sélectionnées, mais je pense que sur mobile ça va être compliqué : ça signifierait que le popup se situe très bas dans l'écran, il n'y aurait que le titre visible sur les téléphones de petite taille.
-
-
-
Dans les écrans de réponse au sondage date, quelle est la règle pour l'abbréviation des dates ? Des fois c'est le jour qui est abrégé, des fois le mois.
-
-
-
On part sur une version desktop à partir de 768px ? Je demande, car tes maquettes desktop font 602 px de large et je ne sais pas si c'est délibéré ou non.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
Quel est le projet ? Quels sont les enjeux ?
-- Avoir un truc utilisable (sur téléphone !)
-- Graphiquement plus élégant
-
Quelles méthodes de travail ?
-- Une refonte ergonomique avant de faire des tests utilisateurs pour vérifier que la nouvelle interface est chouette
-
Quel niveau de qualité ? standards et de bonnes pratiques ?
-- Une refonte graphique, utilisable sur mobile
-- De l'internationalisation
-- Un logiciel accessible
-
Quelles priorités ?
-- Cycle de vote à finir
-
Qui veut faire quoi ?
-
-
Notes de réunion
-
-
Le nom semble peu approprié depuis l'apparition des nouvelles fonctionnalités.
Vidéo de présentation : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
-
-
-
-
-
-
-
-
-
-
-
Keyboard Shortcuts
-
-
-
-
-
-
-
Keys
-
Action
-
-
-
-
-
?
-
Open this help
-
-
-
n
-
Next page
-
-
-
p
-
Previous page
-
-
-
s
-
Search
-
-
-
-
-
-
-
-
-
-
-
diff --git a/site/search/lunr.js b/site/search/lunr.js
deleted file mode 100644
index 42dfbd2b..00000000
--- a/site/search/lunr.js
+++ /dev/null
@@ -1,3486 +0,0 @@
-/**
- * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.8
- * Copyright (C) 2019 Oliver Nightingale
- * @license MIT
- */
-
-(function () {
- /**
- * A convenience function for configuring and constructing
- * a new lunr Index.
- *
- * A lunr.Builder instance is created and the pipeline setup
- * with a trimmer, stop word filter and stemmer.
- *
- * This builder object is yielded to the configuration function
- * that is passed as a parameter, allowing the list of fields
- * and other builder parameters to be customised.
- *
- * All documents _must_ be added within the passed config function.
- *
- * @example
- * var idx = lunr(function () {
- * this.field('title')
- * this.field('body')
- * this.ref('id')
- *
- * documents.forEach(function (doc) {
- * this.add(doc)
- * }, this)
- * })
- *
- * @see {@link lunr.Builder}
- * @see {@link lunr.Pipeline}
- * @see {@link lunr.trimmer}
- * @see {@link lunr.stopWordFilter}
- * @see {@link lunr.stemmer}
- * @namespace {function} lunr
- */
- var lunr = function (config) {
- var builder = new lunr.Builder();
-
- builder.pipeline.add(lunr.trimmer, lunr.stopWordFilter, lunr.stemmer);
-
- builder.searchPipeline.add(lunr.stemmer);
-
- config.call(builder, builder);
- return builder.build();
- };
-
- lunr.version = '2.3.8';
- /*!
- * lunr.utils
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * A namespace containing utils for the rest of the lunr library
- * @namespace lunr.utils
- */
- lunr.utils = {};
-
- /**
- * Print a warning message to the console.
- *
- * @param {String} message The message to be printed.
- * @memberOf lunr.utils
- * @function
- */
- lunr.utils.warn = (function (global) {
- /* eslint-disable no-console */
- return function (message) {
- if (global.console && console.warn) {
- console.warn(message);
- }
- };
- /* eslint-enable no-console */
- })(this);
-
- /**
- * Convert an object to a string.
- *
- * In the case of `null` and `undefined` the function returns
- * the empty string, in all other cases the result of calling
- * `toString` on the passed object is returned.
- *
- * @param {Any} obj The object to convert to a string.
- * @return {String} string representation of the passed object.
- * @memberOf lunr.utils
- */
- lunr.utils.asString = function (obj) {
- if (obj === void 0 || obj === null) {
- return '';
- } else {
- return obj.toString();
- }
- };
-
- /**
- * Clones an object.
- *
- * Will create a copy of an existing object such that any mutations
- * on the copy cannot affect the original.
- *
- * Only shallow objects are supported, passing a nested object to this
- * function will cause a TypeError.
- *
- * Objects with primitives, and arrays of primitives are supported.
- *
- * @param {Object} obj The object to clone.
- * @return {Object} a clone of the passed object.
- * @throws {TypeError} when a nested object is passed.
- * @memberOf Utils
- */
- lunr.utils.clone = function (obj) {
- if (obj === null || obj === undefined) {
- return obj;
- }
-
- var clone = Object.create(null),
- keys = Object.keys(obj);
-
- for (var i = 0; i < keys.length; i++) {
- var key = keys[i],
- val = obj[key];
-
- if (Array.isArray(val)) {
- clone[key] = val.slice();
- continue;
- }
-
- if (typeof val === 'string' || typeof val === 'number' || typeof val === 'boolean') {
- clone[key] = val;
- continue;
- }
-
- throw new TypeError('clone is not deep and does not support nested objects');
- }
-
- return clone;
- };
- lunr.FieldRef = function (docRef, fieldName, stringValue) {
- this.docRef = docRef;
- this.fieldName = fieldName;
- this._stringValue = stringValue;
- };
-
- lunr.FieldRef.joiner = '/';
-
- lunr.FieldRef.fromString = function (s) {
- var n = s.indexOf(lunr.FieldRef.joiner);
-
- if (n === -1) {
- throw 'malformed field ref string';
- }
-
- var fieldRef = s.slice(0, n),
- docRef = s.slice(n + 1);
-
- return new lunr.FieldRef(docRef, fieldRef, s);
- };
-
- lunr.FieldRef.prototype.toString = function () {
- if (this._stringValue == undefined) {
- this._stringValue = this.fieldName + lunr.FieldRef.joiner + this.docRef;
- }
-
- return this._stringValue;
- };
- /*!
- * lunr.Set
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * A lunr set.
- *
- * @constructor
- */
- lunr.Set = function (elements) {
- this.elements = Object.create(null);
-
- if (elements) {
- this.length = elements.length;
-
- for (var i = 0; i < this.length; i++) {
- this.elements[elements[i]] = true;
- }
- } else {
- this.length = 0;
- }
- };
-
- /**
- * A complete set that contains all elements.
- *
- * @static
- * @readonly
- * @type {lunr.Set}
- */
- lunr.Set.complete = {
- intersect: function (other) {
- return other;
- },
-
- union: function (other) {
- return other;
- },
-
- contains: function () {
- return true;
- },
- };
-
- /**
- * An empty set that contains no elements.
- *
- * @static
- * @readonly
- * @type {lunr.Set}
- */
- lunr.Set.empty = {
- intersect: function () {
- return this;
- },
-
- union: function (other) {
- return other;
- },
-
- contains: function () {
- return false;
- },
- };
-
- /**
- * Returns true if this set contains the specified object.
- *
- * @param {object} object - Object whose presence in this set is to be tested.
- * @returns {boolean} - True if this set contains the specified object.
- */
- lunr.Set.prototype.contains = function (object) {
- return !!this.elements[object];
- };
-
- /**
- * Returns a new set containing only the elements that are present in both
- * this set and the specified set.
- *
- * @param {lunr.Set} other - set to intersect with this set.
- * @returns {lunr.Set} a new set that is the intersection of this and the specified set.
- */
-
- lunr.Set.prototype.intersect = function (other) {
- var a,
- b,
- elements,
- intersection = [];
-
- if (other === lunr.Set.complete) {
- return this;
- }
-
- if (other === lunr.Set.empty) {
- return other;
- }
-
- if (this.length < other.length) {
- a = this;
- b = other;
- } else {
- a = other;
- b = this;
- }
-
- elements = Object.keys(a.elements);
-
- for (var i = 0; i < elements.length; i++) {
- var element = elements[i];
- if (element in b.elements) {
- intersection.push(element);
- }
- }
-
- return new lunr.Set(intersection);
- };
-
- /**
- * Returns a new set combining the elements of this and the specified set.
- *
- * @param {lunr.Set} other - set to union with this set.
- * @return {lunr.Set} a new set that is the union of this and the specified set.
- */
-
- lunr.Set.prototype.union = function (other) {
- if (other === lunr.Set.complete) {
- return lunr.Set.complete;
- }
-
- if (other === lunr.Set.empty) {
- return this;
- }
-
- return new lunr.Set(Object.keys(this.elements).concat(Object.keys(other.elements)));
- };
- /**
- * A function to calculate the inverse document frequency for
- * a posting. This is shared between the builder and the index
- *
- * @private
- * @param {object} posting - The posting for a given term
- * @param {number} documentCount - The total number of documents.
- */
- lunr.idf = function (posting, documentCount) {
- var documentsWithTerm = 0;
-
- for (var fieldName in posting) {
- if (fieldName == '_index') continue; // Ignore the term index, its not a field
- documentsWithTerm += Object.keys(posting[fieldName]).length;
- }
-
- var x = (documentCount - documentsWithTerm + 0.5) / (documentsWithTerm + 0.5);
-
- return Math.log(1 + Math.abs(x));
- };
-
- /**
- * A token wraps a string representation of a token
- * as it is passed through the text processing pipeline.
- *
- * @constructor
- * @param {string} [str=''] - The string token being wrapped.
- * @param {object} [metadata={}] - Metadata associated with this token.
- */
- lunr.Token = function (str, metadata) {
- this.str = str || '';
- this.metadata = metadata || {};
- };
-
- /**
- * Returns the token string that is being wrapped by this object.
- *
- * @returns {string}
- */
- lunr.Token.prototype.toString = function () {
- return this.str;
- };
-
- /**
- * A token update function is used when updating or optionally
- * when cloning a token.
- *
- * @callback lunr.Token~updateFunction
- * @param {string} str - The string representation of the token.
- * @param {Object} metadata - All metadata associated with this token.
- */
-
- /**
- * Applies the given function to the wrapped string token.
- *
- * @example
- * token.update(function (str, metadata) {
- * return str.toUpperCase()
- * })
- *
- * @param {lunr.Token~updateFunction} fn - A function to apply to the token string.
- * @returns {lunr.Token}
- */
- lunr.Token.prototype.update = function (fn) {
- this.str = fn(this.str, this.metadata);
- return this;
- };
-
- /**
- * Creates a clone of this token. Optionally a function can be
- * applied to the cloned token.
- *
- * @param {lunr.Token~updateFunction} [fn] - An optional function to apply to the cloned token.
- * @returns {lunr.Token}
- */
- lunr.Token.prototype.clone = function (fn) {
- fn =
- fn ||
- function (s) {
- return s;
- };
- return new lunr.Token(fn(this.str, this.metadata), this.metadata);
- };
- /*!
- * lunr.tokenizer
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * A function for splitting a string into tokens ready to be inserted into
- * the search index. Uses `lunr.tokenizer.separator` to split strings, change
- * the value of this property to change how strings are split into tokens.
- *
- * This tokenizer will convert its parameter to a string by calling `toString` and
- * then will split this string on the character in `lunr.tokenizer.separator`.
- * Arrays will have their elements converted to strings and wrapped in a lunr.Token.
- *
- * Optional metadata can be passed to the tokenizer, this metadata will be cloned and
- * added as metadata to every token that is created from the object to be tokenized.
- *
- * @static
- * @param {?(string|object|object[])} obj - The object to convert into tokens
- * @param {?object} metadata - Optional metadata to associate with every token
- * @returns {lunr.Token[]}
- * @see {@link lunr.Pipeline}
- */
- lunr.tokenizer = function (obj, metadata) {
- if (obj == null || obj == undefined) {
- return [];
- }
-
- if (Array.isArray(obj)) {
- return obj.map(function (t) {
- return new lunr.Token(lunr.utils.asString(t).toLowerCase(), lunr.utils.clone(metadata));
- });
- }
-
- var str = obj.toString().toLowerCase(),
- len = str.length,
- tokens = [];
-
- for (var sliceEnd = 0, sliceStart = 0; sliceEnd <= len; sliceEnd++) {
- var char = str.charAt(sliceEnd),
- sliceLength = sliceEnd - sliceStart;
-
- if (char.match(lunr.tokenizer.separator) || sliceEnd == len) {
- if (sliceLength > 0) {
- var tokenMetadata = lunr.utils.clone(metadata) || {};
- tokenMetadata['position'] = [sliceStart, sliceLength];
- tokenMetadata['index'] = tokens.length;
-
- tokens.push(new lunr.Token(str.slice(sliceStart, sliceEnd), tokenMetadata));
- }
-
- sliceStart = sliceEnd + 1;
- }
- }
-
- return tokens;
- };
-
- /**
- * The separator used to split a string into tokens. Override this property to change the behaviour of
- * `lunr.tokenizer` behaviour when tokenizing strings. By default this splits on whitespace and hyphens.
- *
- * @static
- * @see lunr.tokenizer
- */
- lunr.tokenizer.separator = /[\s\-]+/;
- /*!
- * lunr.Pipeline
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * lunr.Pipelines maintain an ordered list of functions to be applied to all
- * tokens in documents entering the search index and queries being ran against
- * the index.
- *
- * An instance of lunr.Index created with the lunr shortcut will contain a
- * pipeline with a stop word filter and an English language stemmer. Extra
- * functions can be added before or after either of these functions or these
- * default functions can be removed.
- *
- * When run the pipeline will call each function in turn, passing a token, the
- * index of that token in the original list of all tokens and finally a list of
- * all the original tokens.
- *
- * The output of functions in the pipeline will be passed to the next function
- * in the pipeline. To exclude a token from entering the index the function
- * should return undefined, the rest of the pipeline will not be called with
- * this token.
- *
- * For serialisation of pipelines to work, all functions used in an instance of
- * a pipeline should be registered with lunr.Pipeline. Registered functions can
- * then be loaded. If trying to load a serialised pipeline that uses functions
- * that are not registered an error will be thrown.
- *
- * If not planning on serialising the pipeline then registering pipeline functions
- * is not necessary.
- *
- * @constructor
- */
- lunr.Pipeline = function () {
- this._stack = [];
- };
-
- lunr.Pipeline.registeredFunctions = Object.create(null);
-
- /**
- * A pipeline function maps lunr.Token to lunr.Token. A lunr.Token contains the token
- * string as well as all known metadata. A pipeline function can mutate the token string
- * or mutate (or add) metadata for a given token.
- *
- * A pipeline function can indicate that the passed token should be discarded by returning
- * null, undefined or an empty string. This token will not be passed to any downstream pipeline
- * functions and will not be added to the index.
- *
- * Multiple tokens can be returned by returning an array of tokens. Each token will be passed
- * to any downstream pipeline functions and all will returned tokens will be added to the index.
- *
- * Any number of pipeline functions may be chained together using a lunr.Pipeline.
- *
- * @interface lunr.PipelineFunction
- * @param {lunr.Token} token - A token from the document being processed.
- * @param {number} i - The index of this token in the complete list of tokens for this document/field.
- * @param {lunr.Token[]} tokens - All tokens for this document/field.
- * @returns {(?lunr.Token|lunr.Token[])}
- */
-
- /**
- * Register a function with the pipeline.
- *
- * Functions that are used in the pipeline should be registered if the pipeline
- * needs to be serialised, or a serialised pipeline needs to be loaded.
- *
- * Registering a function does not add it to a pipeline, functions must still be
- * added to instances of the pipeline for them to be used when running a pipeline.
- *
- * @param {lunr.PipelineFunction} fn - The function to check for.
- * @param {String} label - The label to register this function with
- */
- lunr.Pipeline.registerFunction = function (fn, label) {
- if (label in this.registeredFunctions) {
- lunr.utils.warn('Overwriting existing registered function: ' + label);
- }
-
- fn.label = label;
- lunr.Pipeline.registeredFunctions[fn.label] = fn;
- };
-
- /**
- * Warns if the function is not registered as a Pipeline function.
- *
- * @param {lunr.PipelineFunction} fn - The function to check for.
- * @private
- */
- lunr.Pipeline.warnIfFunctionNotRegistered = function (fn) {
- var isRegistered = fn.label && fn.label in this.registeredFunctions;
-
- if (!isRegistered) {
- lunr.utils.warn(
- 'Function is not registered with pipeline. This may cause problems when serialising the index.\n',
- fn
- );
- }
- };
-
- /**
- * Loads a previously serialised pipeline.
- *
- * All functions to be loaded must already be registered with lunr.Pipeline.
- * If any function from the serialised data has not been registered then an
- * error will be thrown.
- *
- * @param {Object} serialised - The serialised pipeline to load.
- * @returns {lunr.Pipeline}
- */
- lunr.Pipeline.load = function (serialised) {
- var pipeline = new lunr.Pipeline();
-
- serialised.forEach(function (fnName) {
- var fn = lunr.Pipeline.registeredFunctions[fnName];
-
- if (fn) {
- pipeline.add(fn);
- } else {
- throw new Error('Cannot load unregistered function: ' + fnName);
- }
- });
-
- return pipeline;
- };
-
- /**
- * Adds new functions to the end of the pipeline.
- *
- * Logs a warning if the function has not been registered.
- *
- * @param {lunr.PipelineFunction[]} functions - Any number of functions to add to the pipeline.
- */
- lunr.Pipeline.prototype.add = function () {
- var fns = Array.prototype.slice.call(arguments);
-
- fns.forEach(function (fn) {
- lunr.Pipeline.warnIfFunctionNotRegistered(fn);
- this._stack.push(fn);
- }, this);
- };
-
- /**
- * Adds a single function after a function that already exists in the
- * pipeline.
- *
- * Logs a warning if the function has not been registered.
- *
- * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.
- * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.
- */
- lunr.Pipeline.prototype.after = function (existingFn, newFn) {
- lunr.Pipeline.warnIfFunctionNotRegistered(newFn);
-
- var pos = this._stack.indexOf(existingFn);
- if (pos == -1) {
- throw new Error('Cannot find existingFn');
- }
-
- pos = pos + 1;
- this._stack.splice(pos, 0, newFn);
- };
-
- /**
- * Adds a single function before a function that already exists in the
- * pipeline.
- *
- * Logs a warning if the function has not been registered.
- *
- * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.
- * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.
- */
- lunr.Pipeline.prototype.before = function (existingFn, newFn) {
- lunr.Pipeline.warnIfFunctionNotRegistered(newFn);
-
- var pos = this._stack.indexOf(existingFn);
- if (pos == -1) {
- throw new Error('Cannot find existingFn');
- }
-
- this._stack.splice(pos, 0, newFn);
- };
-
- /**
- * Removes a function from the pipeline.
- *
- * @param {lunr.PipelineFunction} fn The function to remove from the pipeline.
- */
- lunr.Pipeline.prototype.remove = function (fn) {
- var pos = this._stack.indexOf(fn);
- if (pos == -1) {
- return;
- }
-
- this._stack.splice(pos, 1);
- };
-
- /**
- * Runs the current list of functions that make up the pipeline against the
- * passed tokens.
- *
- * @param {Array} tokens The tokens to run through the pipeline.
- * @returns {Array}
- */
- lunr.Pipeline.prototype.run = function (tokens) {
- var stackLength = this._stack.length;
-
- for (var i = 0; i < stackLength; i++) {
- var fn = this._stack[i];
- var memo = [];
-
- for (var j = 0; j < tokens.length; j++) {
- var result = fn(tokens[j], j, tokens);
-
- if (result === null || result === void 0 || result === '') continue;
-
- if (Array.isArray(result)) {
- for (var k = 0; k < result.length; k++) {
- memo.push(result[k]);
- }
- } else {
- memo.push(result);
- }
- }
-
- tokens = memo;
- }
-
- return tokens;
- };
-
- /**
- * Convenience method for passing a string through a pipeline and getting
- * strings out. This method takes care of wrapping the passed string in a
- * token and mapping the resulting tokens back to strings.
- *
- * @param {string} str - The string to pass through the pipeline.
- * @param {?object} metadata - Optional metadata to associate with the token
- * passed to the pipeline.
- * @returns {string[]}
- */
- lunr.Pipeline.prototype.runString = function (str, metadata) {
- var token = new lunr.Token(str, metadata);
-
- return this.run([token]).map(function (t) {
- return t.toString();
- });
- };
-
- /**
- * Resets the pipeline by removing any existing processors.
- *
- */
- lunr.Pipeline.prototype.reset = function () {
- this._stack = [];
- };
-
- /**
- * Returns a representation of the pipeline ready for serialisation.
- *
- * Logs a warning if the function has not been registered.
- *
- * @returns {Array}
- */
- lunr.Pipeline.prototype.toJSON = function () {
- return this._stack.map(function (fn) {
- lunr.Pipeline.warnIfFunctionNotRegistered(fn);
-
- return fn.label;
- });
- };
- /*!
- * lunr.Vector
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * A vector is used to construct the vector space of documents and queries. These
- * vectors support operations to determine the similarity between two documents or
- * a document and a query.
- *
- * Normally no parameters are required for initializing a vector, but in the case of
- * loading a previously dumped vector the raw elements can be provided to the constructor.
- *
- * For performance reasons vectors are implemented with a flat array, where an elements
- * index is immediately followed by its value. E.g. [index, value, index, value]. This
- * allows the underlying array to be as sparse as possible and still offer decent
- * performance when being used for vector calculations.
- *
- * @constructor
- * @param {Number[]} [elements] - The flat list of element index and element value pairs.
- */
- lunr.Vector = function (elements) {
- this._magnitude = 0;
- this.elements = elements || [];
- };
-
- /**
- * Calculates the position within the vector to insert a given index.
- *
- * This is used internally by insert and upsert. If there are duplicate indexes then
- * the position is returned as if the value for that index were to be updated, but it
- * is the callers responsibility to check whether there is a duplicate at that index
- *
- * @param {Number} insertIdx - The index at which the element should be inserted.
- * @returns {Number}
- */
- lunr.Vector.prototype.positionForIndex = function (index) {
- // For an empty vector the tuple can be inserted at the beginning
- if (this.elements.length == 0) {
- return 0;
- }
-
- var start = 0,
- end = this.elements.length / 2,
- sliceLength = end - start,
- pivotPoint = Math.floor(sliceLength / 2),
- pivotIndex = this.elements[pivotPoint * 2];
-
- while (sliceLength > 1) {
- if (pivotIndex < index) {
- start = pivotPoint;
- }
-
- if (pivotIndex > index) {
- end = pivotPoint;
- }
-
- if (pivotIndex == index) {
- break;
- }
-
- sliceLength = end - start;
- pivotPoint = start + Math.floor(sliceLength / 2);
- pivotIndex = this.elements[pivotPoint * 2];
- }
-
- if (pivotIndex == index) {
- return pivotPoint * 2;
- }
-
- if (pivotIndex > index) {
- return pivotPoint * 2;
- }
-
- if (pivotIndex < index) {
- return (pivotPoint + 1) * 2;
- }
- };
-
- /**
- * Inserts an element at an index within the vector.
- *
- * Does not allow duplicates, will throw an error if there is already an entry
- * for this index.
- *
- * @param {Number} insertIdx - The index at which the element should be inserted.
- * @param {Number} val - The value to be inserted into the vector.
- */
- lunr.Vector.prototype.insert = function (insertIdx, val) {
- this.upsert(insertIdx, val, function () {
- throw 'duplicate index';
- });
- };
-
- /**
- * Inserts or updates an existing index within the vector.
- *
- * @param {Number} insertIdx - The index at which the element should be inserted.
- * @param {Number} val - The value to be inserted into the vector.
- * @param {function} fn - A function that is called for updates, the existing value and the
- * requested value are passed as arguments
- */
- lunr.Vector.prototype.upsert = function (insertIdx, val, fn) {
- this._magnitude = 0;
- var position = this.positionForIndex(insertIdx);
-
- if (this.elements[position] == insertIdx) {
- this.elements[position + 1] = fn(this.elements[position + 1], val);
- } else {
- this.elements.splice(position, 0, insertIdx, val);
- }
- };
-
- /**
- * Calculates the magnitude of this vector.
- *
- * @returns {Number}
- */
- lunr.Vector.prototype.magnitude = function () {
- if (this._magnitude) return this._magnitude;
-
- var sumOfSquares = 0,
- elementsLength = this.elements.length;
-
- for (var i = 1; i < elementsLength; i += 2) {
- var val = this.elements[i];
- sumOfSquares += val * val;
- }
-
- return (this._magnitude = Math.sqrt(sumOfSquares));
- };
-
- /**
- * Calculates the dot product of this vector and another vector.
- *
- * @param {lunr.Vector} otherVector - The vector to compute the dot product with.
- * @returns {Number}
- */
- lunr.Vector.prototype.dot = function (otherVector) {
- var dotProduct = 0,
- a = this.elements,
- b = otherVector.elements,
- aLen = a.length,
- bLen = b.length,
- aVal = 0,
- bVal = 0,
- i = 0,
- j = 0;
-
- while (i < aLen && j < bLen) {
- (aVal = a[i]), (bVal = b[j]);
- if (aVal < bVal) {
- i += 2;
- } else if (aVal > bVal) {
- j += 2;
- } else if (aVal == bVal) {
- dotProduct += a[i + 1] * b[j + 1];
- i += 2;
- j += 2;
- }
- }
-
- return dotProduct;
- };
-
- /**
- * Calculates the similarity between this vector and another vector.
- *
- * @param {lunr.Vector} otherVector - The other vector to calculate the
- * similarity with.
- * @returns {Number}
- */
- lunr.Vector.prototype.similarity = function (otherVector) {
- return this.dot(otherVector) / this.magnitude() || 0;
- };
-
- /**
- * Converts the vector to an array of the elements within the vector.
- *
- * @returns {Number[]}
- */
- lunr.Vector.prototype.toArray = function () {
- var output = new Array(this.elements.length / 2);
-
- for (var i = 1, j = 0; i < this.elements.length; i += 2, j++) {
- output[j] = this.elements[i];
- }
-
- return output;
- };
-
- /**
- * A JSON serializable representation of the vector.
- *
- * @returns {Number[]}
- */
- lunr.Vector.prototype.toJSON = function () {
- return this.elements;
- };
- /* eslint-disable */
- /*!
- * lunr.stemmer
- * Copyright (C) 2019 Oliver Nightingale
- * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt
- */
-
- /**
- * lunr.stemmer is an english language stemmer, this is a JavaScript
- * implementation of the PorterStemmer taken from http://tartarus.org/~martin
- *
- * @static
- * @implements {lunr.PipelineFunction}
- * @param {lunr.Token} token - The string to stem
- * @returns {lunr.Token}
- * @see {@link lunr.Pipeline}
- * @function
- */
- lunr.stemmer = (function () {
- var step2list = {
- ational: 'ate',
- tional: 'tion',
- enci: 'ence',
- anci: 'ance',
- izer: 'ize',
- bli: 'ble',
- alli: 'al',
- entli: 'ent',
- eli: 'e',
- ousli: 'ous',
- ization: 'ize',
- ation: 'ate',
- ator: 'ate',
- alism: 'al',
- iveness: 'ive',
- fulness: 'ful',
- ousness: 'ous',
- aliti: 'al',
- iviti: 'ive',
- biliti: 'ble',
- logi: 'log',
- },
- step3list = {
- icate: 'ic',
- ative: '',
- alize: 'al',
- iciti: 'ic',
- ical: 'ic',
- ful: '',
- ness: '',
- },
- c = '[^aeiou]', // consonant
- v = '[aeiouy]', // vowel
- C = c + '[^aeiouy]*', // consonant sequence
- V = v + '[aeiou]*', // vowel sequence
- mgr0 = '^(' + C + ')?' + V + C, // [C]VC... is m>0
- meq1 = '^(' + C + ')?' + V + C + '(' + V + ')?$', // [C]VC[V] is m=1
- mgr1 = '^(' + C + ')?' + V + C + V + C, // [C]VCVC... is m>1
- s_v = '^(' + C + ')?' + v; // vowel in stem
-
- var re_mgr0 = new RegExp(mgr0);
- var re_mgr1 = new RegExp(mgr1);
- var re_meq1 = new RegExp(meq1);
- var re_s_v = new RegExp(s_v);
-
- var re_1a = /^(.+?)(ss|i)es$/;
- var re2_1a = /^(.+?)([^s])s$/;
- var re_1b = /^(.+?)eed$/;
- var re2_1b = /^(.+?)(ed|ing)$/;
- var re_1b_2 = /.$/;
- var re2_1b_2 = /(at|bl|iz)$/;
- var re3_1b_2 = new RegExp('([^aeiouylsz])\\1$');
- var re4_1b_2 = new RegExp('^' + C + v + '[^aeiouwxy]$');
-
- var re_1c = /^(.+?[^aeiou])y$/;
- var re_2 = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;
-
- var re_3 = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;
-
- var re_4 = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;
- var re2_4 = /^(.+?)(s|t)(ion)$/;
-
- var re_5 = /^(.+?)e$/;
- var re_5_1 = /ll$/;
- var re3_5 = new RegExp('^' + C + v + '[^aeiouwxy]$');
-
- var porterStemmer = function porterStemmer(w) {
- var stem, suffix, firstch, re, re2, re3, re4;
-
- if (w.length < 3) {
- return w;
- }
-
- firstch = w.substr(0, 1);
- if (firstch == 'y') {
- w = firstch.toUpperCase() + w.substr(1);
- }
-
- // Step 1a
- re = re_1a;
- re2 = re2_1a;
-
- if (re.test(w)) {
- w = w.replace(re, '$1$2');
- } else if (re2.test(w)) {
- w = w.replace(re2, '$1$2');
- }
-
- // Step 1b
- re = re_1b;
- re2 = re2_1b;
- if (re.test(w)) {
- var fp = re.exec(w);
- re = re_mgr0;
- if (re.test(fp[1])) {
- re = re_1b_2;
- w = w.replace(re, '');
- }
- } else if (re2.test(w)) {
- var fp = re2.exec(w);
- stem = fp[1];
- re2 = re_s_v;
- if (re2.test(stem)) {
- w = stem;
- re2 = re2_1b_2;
- re3 = re3_1b_2;
- re4 = re4_1b_2;
- if (re2.test(w)) {
- w = w + 'e';
- } else if (re3.test(w)) {
- re = re_1b_2;
- w = w.replace(re, '');
- } else if (re4.test(w)) {
- w = w + 'e';
- }
- }
- }
-
- // Step 1c - replace suffix y or Y by i if preceded by a non-vowel which is not the first letter of the word (so cry -> cri, by -> by, say -> say)
- re = re_1c;
- if (re.test(w)) {
- var fp = re.exec(w);
- stem = fp[1];
- w = stem + 'i';
- }
-
- // Step 2
- re = re_2;
- if (re.test(w)) {
- var fp = re.exec(w);
- stem = fp[1];
- suffix = fp[2];
- re = re_mgr0;
- if (re.test(stem)) {
- w = stem + step2list[suffix];
- }
- }
-
- // Step 3
- re = re_3;
- if (re.test(w)) {
- var fp = re.exec(w);
- stem = fp[1];
- suffix = fp[2];
- re = re_mgr0;
- if (re.test(stem)) {
- w = stem + step3list[suffix];
- }
- }
-
- // Step 4
- re = re_4;
- re2 = re2_4;
- if (re.test(w)) {
- var fp = re.exec(w);
- stem = fp[1];
- re = re_mgr1;
- if (re.test(stem)) {
- w = stem;
- }
- } else if (re2.test(w)) {
- var fp = re2.exec(w);
- stem = fp[1] + fp[2];
- re2 = re_mgr1;
- if (re2.test(stem)) {
- w = stem;
- }
- }
-
- // Step 5
- re = re_5;
- if (re.test(w)) {
- var fp = re.exec(w);
- stem = fp[1];
- re = re_mgr1;
- re2 = re_meq1;
- re3 = re3_5;
- if (re.test(stem) || (re2.test(stem) && !re3.test(stem))) {
- w = stem;
- }
- }
-
- re = re_5_1;
- re2 = re_mgr1;
- if (re.test(w) && re2.test(w)) {
- re = re_1b_2;
- w = w.replace(re, '');
- }
-
- // and turn initial Y back to y
-
- if (firstch == 'y') {
- w = firstch.toLowerCase() + w.substr(1);
- }
-
- return w;
- };
-
- return function (token) {
- return token.update(porterStemmer);
- };
- })();
-
- lunr.Pipeline.registerFunction(lunr.stemmer, 'stemmer');
- /*!
- * lunr.stopWordFilter
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * lunr.generateStopWordFilter builds a stopWordFilter function from the provided
- * list of stop words.
- *
- * The built in lunr.stopWordFilter is built using this generator and can be used
- * to generate custom stopWordFilters for applications or non English languages.
- *
- * @function
- * @param {Array} token The token to pass through the filter
- * @returns {lunr.PipelineFunction}
- * @see lunr.Pipeline
- * @see lunr.stopWordFilter
- */
- lunr.generateStopWordFilter = function (stopWords) {
- var words = stopWords.reduce(function (memo, stopWord) {
- memo[stopWord] = stopWord;
- return memo;
- }, {});
-
- return function (token) {
- if (token && words[token.toString()] !== token.toString()) return token;
- };
- };
-
- /**
- * lunr.stopWordFilter is an English language stop word list filter, any words
- * contained in the list will not be passed through the filter.
- *
- * This is intended to be used in the Pipeline. If the token does not pass the
- * filter then undefined will be returned.
- *
- * @function
- * @implements {lunr.PipelineFunction}
- * @params {lunr.Token} token - A token to check for being a stop word.
- * @returns {lunr.Token}
- * @see {@link lunr.Pipeline}
- */
- lunr.stopWordFilter = lunr.generateStopWordFilter([
- 'a',
- 'able',
- 'about',
- 'across',
- 'after',
- 'all',
- 'almost',
- 'also',
- 'am',
- 'among',
- 'an',
- 'and',
- 'any',
- 'are',
- 'as',
- 'at',
- 'be',
- 'because',
- 'been',
- 'but',
- 'by',
- 'can',
- 'cannot',
- 'could',
- 'dear',
- 'did',
- 'do',
- 'does',
- 'either',
- 'else',
- 'ever',
- 'every',
- 'for',
- 'from',
- 'get',
- 'got',
- 'had',
- 'has',
- 'have',
- 'he',
- 'her',
- 'hers',
- 'him',
- 'his',
- 'how',
- 'however',
- 'i',
- 'if',
- 'in',
- 'into',
- 'is',
- 'it',
- 'its',
- 'just',
- 'least',
- 'let',
- 'like',
- 'likely',
- 'may',
- 'me',
- 'might',
- 'most',
- 'must',
- 'my',
- 'neither',
- 'no',
- 'nor',
- 'not',
- 'of',
- 'off',
- 'often',
- 'on',
- 'only',
- 'or',
- 'other',
- 'our',
- 'own',
- 'rather',
- 'said',
- 'say',
- 'says',
- 'she',
- 'should',
- 'since',
- 'so',
- 'some',
- 'than',
- 'that',
- 'the',
- 'their',
- 'them',
- 'then',
- 'there',
- 'these',
- 'they',
- 'this',
- 'tis',
- 'to',
- 'too',
- 'twas',
- 'us',
- 'wants',
- 'was',
- 'we',
- 'were',
- 'what',
- 'when',
- 'where',
- 'which',
- 'while',
- 'who',
- 'whom',
- 'why',
- 'will',
- 'with',
- 'would',
- 'yet',
- 'you',
- 'your',
- ]);
-
- lunr.Pipeline.registerFunction(lunr.stopWordFilter, 'stopWordFilter');
- /*!
- * lunr.trimmer
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * lunr.trimmer is a pipeline function for trimming non word
- * characters from the beginning and end of tokens before they
- * enter the index.
- *
- * This implementation may not work correctly for non latin
- * characters and should either be removed or adapted for use
- * with languages with non-latin characters.
- *
- * @static
- * @implements {lunr.PipelineFunction}
- * @param {lunr.Token} token The token to pass through the filter
- * @returns {lunr.Token}
- * @see lunr.Pipeline
- */
- lunr.trimmer = function (token) {
- return token.update(function (s) {
- return s.replace(/^\W+/, '').replace(/\W+$/, '');
- });
- };
-
- lunr.Pipeline.registerFunction(lunr.trimmer, 'trimmer');
- /*!
- * lunr.TokenSet
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * A token set is used to store the unique list of all tokens
- * within an index. Token sets are also used to represent an
- * incoming query to the index, this query token set and index
- * token set are then intersected to find which tokens to look
- * up in the inverted index.
- *
- * A token set can hold multiple tokens, as in the case of the
- * index token set, or it can hold a single token as in the
- * case of a simple query token set.
- *
- * Additionally token sets are used to perform wildcard matching.
- * Leading, contained and trailing wildcards are supported, and
- * from this edit distance matching can also be provided.
- *
- * Token sets are implemented as a minimal finite state automata,
- * where both common prefixes and suffixes are shared between tokens.
- * This helps to reduce the space used for storing the token set.
- *
- * @constructor
- */
- lunr.TokenSet = function () {
- this.final = false;
- this.edges = {};
- this.id = lunr.TokenSet._nextId;
- lunr.TokenSet._nextId += 1;
- };
-
- /**
- * Keeps track of the next, auto increment, identifier to assign
- * to a new tokenSet.
- *
- * TokenSets require a unique identifier to be correctly minimised.
- *
- * @private
- */
- lunr.TokenSet._nextId = 1;
-
- /**
- * Creates a TokenSet instance from the given sorted array of words.
- *
- * @param {String[]} arr - A sorted array of strings to create the set from.
- * @returns {lunr.TokenSet}
- * @throws Will throw an error if the input array is not sorted.
- */
- lunr.TokenSet.fromArray = function (arr) {
- var builder = new lunr.TokenSet.Builder();
-
- for (var i = 0, len = arr.length; i < len; i++) {
- builder.insert(arr[i]);
- }
-
- builder.finish();
- return builder.root;
- };
-
- /**
- * Creates a token set from a query clause.
- *
- * @private
- * @param {Object} clause - A single clause from lunr.Query.
- * @param {string} clause.term - The query clause term.
- * @param {number} [clause.editDistance] - The optional edit distance for the term.
- * @returns {lunr.TokenSet}
- */
- lunr.TokenSet.fromClause = function (clause) {
- if ('editDistance' in clause) {
- return lunr.TokenSet.fromFuzzyString(clause.term, clause.editDistance);
- } else {
- return lunr.TokenSet.fromString(clause.term);
- }
- };
-
- /**
- * Creates a token set representing a single string with a specified
- * edit distance.
- *
- * Insertions, deletions, substitutions and transpositions are each
- * treated as an edit distance of 1.
- *
- * Increasing the allowed edit distance will have a dramatic impact
- * on the performance of both creating and intersecting these TokenSets.
- * It is advised to keep the edit distance less than 3.
- *
- * @param {string} str - The string to create the token set from.
- * @param {number} editDistance - The allowed edit distance to match.
- * @returns {lunr.Vector}
- */
- lunr.TokenSet.fromFuzzyString = function (str, editDistance) {
- var root = new lunr.TokenSet();
-
- var stack = [
- {
- node: root,
- editsRemaining: editDistance,
- str: str,
- },
- ];
-
- while (stack.length) {
- var frame = stack.pop();
-
- // no edit
- if (frame.str.length > 0) {
- var char = frame.str.charAt(0),
- noEditNode;
-
- if (char in frame.node.edges) {
- noEditNode = frame.node.edges[char];
- } else {
- noEditNode = new lunr.TokenSet();
- frame.node.edges[char] = noEditNode;
- }
-
- if (frame.str.length == 1) {
- noEditNode.final = true;
- }
-
- stack.push({
- node: noEditNode,
- editsRemaining: frame.editsRemaining,
- str: frame.str.slice(1),
- });
- }
-
- if (frame.editsRemaining == 0) {
- continue;
- }
-
- // insertion
- if ('*' in frame.node.edges) {
- var insertionNode = frame.node.edges['*'];
- } else {
- var insertionNode = new lunr.TokenSet();
- frame.node.edges['*'] = insertionNode;
- }
-
- if (frame.str.length == 0) {
- insertionNode.final = true;
- }
-
- stack.push({
- node: insertionNode,
- editsRemaining: frame.editsRemaining - 1,
- str: frame.str,
- });
-
- // deletion
- // can only do a deletion if we have enough edits remaining
- // and if there are characters left to delete in the string
- if (frame.str.length > 1) {
- stack.push({
- node: frame.node,
- editsRemaining: frame.editsRemaining - 1,
- str: frame.str.slice(1),
- });
- }
-
- // deletion
- // just removing the last character from the str
- if (frame.str.length == 1) {
- frame.node.final = true;
- }
-
- // substitution
- // can only do a substitution if we have enough edits remaining
- // and if there are characters left to substitute
- if (frame.str.length >= 1) {
- if ('*' in frame.node.edges) {
- var substitutionNode = frame.node.edges['*'];
- } else {
- var substitutionNode = new lunr.TokenSet();
- frame.node.edges['*'] = substitutionNode;
- }
-
- if (frame.str.length == 1) {
- substitutionNode.final = true;
- }
-
- stack.push({
- node: substitutionNode,
- editsRemaining: frame.editsRemaining - 1,
- str: frame.str.slice(1),
- });
- }
-
- // transposition
- // can only do a transposition if there are edits remaining
- // and there are enough characters to transpose
- if (frame.str.length > 1) {
- var charA = frame.str.charAt(0),
- charB = frame.str.charAt(1),
- transposeNode;
-
- if (charB in frame.node.edges) {
- transposeNode = frame.node.edges[charB];
- } else {
- transposeNode = new lunr.TokenSet();
- frame.node.edges[charB] = transposeNode;
- }
-
- if (frame.str.length == 1) {
- transposeNode.final = true;
- }
-
- stack.push({
- node: transposeNode,
- editsRemaining: frame.editsRemaining - 1,
- str: charA + frame.str.slice(2),
- });
- }
- }
-
- return root;
- };
-
- /**
- * Creates a TokenSet from a string.
- *
- * The string may contain one or more wildcard characters (*)
- * that will allow wildcard matching when intersecting with
- * another TokenSet.
- *
- * @param {string} str - The string to create a TokenSet from.
- * @returns {lunr.TokenSet}
- */
- lunr.TokenSet.fromString = function (str) {
- var node = new lunr.TokenSet(),
- root = node;
-
- /*
- * Iterates through all characters within the passed string
- * appending a node for each character.
- *
- * When a wildcard character is found then a self
- * referencing edge is introduced to continually match
- * any number of any characters.
- */
- for (var i = 0, len = str.length; i < len; i++) {
- var char = str[i],
- final = i == len - 1;
-
- if (char == '*') {
- node.edges[char] = node;
- node.final = final;
- } else {
- var next = new lunr.TokenSet();
- next.final = final;
-
- node.edges[char] = next;
- node = next;
- }
- }
-
- return root;
- };
-
- /**
- * Converts this TokenSet into an array of strings
- * contained within the TokenSet.
- *
- * This is not intended to be used on a TokenSet that
- * contains wildcards, in these cases the results are
- * undefined and are likely to cause an infinite loop.
- *
- * @returns {string[]}
- */
- lunr.TokenSet.prototype.toArray = function () {
- var words = [];
-
- var stack = [
- {
- prefix: '',
- node: this,
- },
- ];
-
- while (stack.length) {
- var frame = stack.pop(),
- edges = Object.keys(frame.node.edges),
- len = edges.length;
-
- if (frame.node.final) {
- /* In Safari, at this point the prefix is sometimes corrupted, see:
- * https://github.com/olivernn/lunr.js/issues/279 Calling any
- * String.prototype method forces Safari to "cast" this string to what
- * it's supposed to be, fixing the bug. */
- frame.prefix.charAt(0);
- words.push(frame.prefix);
- }
-
- for (var i = 0; i < len; i++) {
- var edge = edges[i];
-
- stack.push({
- prefix: frame.prefix.concat(edge),
- node: frame.node.edges[edge],
- });
- }
- }
-
- return words;
- };
-
- /**
- * Generates a string representation of a TokenSet.
- *
- * This is intended to allow TokenSets to be used as keys
- * in objects, largely to aid the construction and minimisation
- * of a TokenSet. As such it is not designed to be a human
- * friendly representation of the TokenSet.
- *
- * @returns {string}
- */
- lunr.TokenSet.prototype.toString = function () {
- // NOTE: Using Object.keys here as this.edges is very likely
- // to enter 'hash-mode' with many keys being added
- //
- // avoiding a for-in loop here as it leads to the function
- // being de-optimised (at least in V8). From some simple
- // benchmarks the performance is comparable, but allowing
- // V8 to optimize may mean easy performance wins in the future.
-
- if (this._str) {
- return this._str;
- }
-
- var str = this.final ? '1' : '0',
- labels = Object.keys(this.edges).sort(),
- len = labels.length;
-
- for (var i = 0; i < len; i++) {
- var label = labels[i],
- node = this.edges[label];
-
- str = str + label + node.id;
- }
-
- return str;
- };
-
- /**
- * Returns a new TokenSet that is the intersection of
- * this TokenSet and the passed TokenSet.
- *
- * This intersection will take into account any wildcards
- * contained within the TokenSet.
- *
- * @param {lunr.TokenSet} b - An other TokenSet to intersect with.
- * @returns {lunr.TokenSet}
- */
- lunr.TokenSet.prototype.intersect = function (b) {
- var output = new lunr.TokenSet(),
- frame = undefined;
-
- var stack = [
- {
- qNode: b,
- output: output,
- node: this,
- },
- ];
-
- while (stack.length) {
- frame = stack.pop();
-
- // NOTE: As with the #toString method, we are using
- // Object.keys and a for loop instead of a for-in loop
- // as both of these objects enter 'hash' mode, causing
- // the function to be de-optimised in V8
- var qEdges = Object.keys(frame.qNode.edges),
- qLen = qEdges.length,
- nEdges = Object.keys(frame.node.edges),
- nLen = nEdges.length;
-
- for (var q = 0; q < qLen; q++) {
- var qEdge = qEdges[q];
-
- for (var n = 0; n < nLen; n++) {
- var nEdge = nEdges[n];
-
- if (nEdge == qEdge || qEdge == '*') {
- var node = frame.node.edges[nEdge],
- qNode = frame.qNode.edges[qEdge],
- final = node.final && qNode.final,
- next = undefined;
-
- if (nEdge in frame.output.edges) {
- // an edge already exists for this character
- // no need to create a new node, just set the finality
- // bit unless this node is already final
- next = frame.output.edges[nEdge];
- next.final = next.final || final;
- } else {
- // no edge exists yet, must create one
- // set the finality bit and insert it
- // into the output
- next = new lunr.TokenSet();
- next.final = final;
- frame.output.edges[nEdge] = next;
- }
-
- stack.push({
- qNode: qNode,
- output: next,
- node: node,
- });
- }
- }
- }
- }
-
- return output;
- };
- lunr.TokenSet.Builder = function () {
- this.previousWord = '';
- this.root = new lunr.TokenSet();
- this.uncheckedNodes = [];
- this.minimizedNodes = {};
- };
-
- lunr.TokenSet.Builder.prototype.insert = function (word) {
- var node,
- commonPrefix = 0;
-
- if (word < this.previousWord) {
- throw new Error('Out of order word insertion');
- }
-
- for (var i = 0; i < word.length && i < this.previousWord.length; i++) {
- if (word[i] != this.previousWord[i]) break;
- commonPrefix++;
- }
-
- this.minimize(commonPrefix);
-
- if (this.uncheckedNodes.length == 0) {
- node = this.root;
- } else {
- node = this.uncheckedNodes[this.uncheckedNodes.length - 1].child;
- }
-
- for (var i = commonPrefix; i < word.length; i++) {
- var nextNode = new lunr.TokenSet(),
- char = word[i];
-
- node.edges[char] = nextNode;
-
- this.uncheckedNodes.push({
- parent: node,
- char: char,
- child: nextNode,
- });
-
- node = nextNode;
- }
-
- node.final = true;
- this.previousWord = word;
- };
-
- lunr.TokenSet.Builder.prototype.finish = function () {
- this.minimize(0);
- };
-
- lunr.TokenSet.Builder.prototype.minimize = function (downTo) {
- for (var i = this.uncheckedNodes.length - 1; i >= downTo; i--) {
- var node = this.uncheckedNodes[i],
- childKey = node.child.toString();
-
- if (childKey in this.minimizedNodes) {
- node.parent.edges[node.char] = this.minimizedNodes[childKey];
- } else {
- // Cache the key for this node since
- // we know it can't change anymore
- node.child._str = childKey;
-
- this.minimizedNodes[childKey] = node.child;
- }
-
- this.uncheckedNodes.pop();
- }
- };
- /*!
- * lunr.Index
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * An index contains the built index of all documents and provides a query interface
- * to the index.
- *
- * Usually instances of lunr.Index will not be created using this constructor, instead
- * lunr.Builder should be used to construct new indexes, or lunr.Index.load should be
- * used to load previously built and serialized indexes.
- *
- * @constructor
- * @param {Object} attrs - The attributes of the built search index.
- * @param {Object} attrs.invertedIndex - An index of term/field to document reference.
- * @param {Object} attrs.fieldVectors - Field vectors
- * @param {lunr.TokenSet} attrs.tokenSet - An set of all corpus tokens.
- * @param {string[]} attrs.fields - The names of indexed document fields.
- * @param {lunr.Pipeline} attrs.pipeline - The pipeline to use for search terms.
- */
- lunr.Index = function (attrs) {
- this.invertedIndex = attrs.invertedIndex;
- this.fieldVectors = attrs.fieldVectors;
- this.tokenSet = attrs.tokenSet;
- this.fields = attrs.fields;
- this.pipeline = attrs.pipeline;
- };
-
- /**
- * A result contains details of a document matching a search query.
- * @typedef {Object} lunr.Index~Result
- * @property {string} ref - The reference of the document this result represents.
- * @property {number} score - A number between 0 and 1 representing how similar this document is to the query.
- * @property {lunr.MatchData} matchData - Contains metadata about this match including which term(s) caused the match.
- */
-
- /**
- * Although lunr provides the ability to create queries using lunr.Query, it also provides a simple
- * query language which itself is parsed into an instance of lunr.Query.
- *
- * For programmatically building queries it is advised to directly use lunr.Query, the query language
- * is best used for human entered text rather than program generated text.
- *
- * At its simplest queries can just be a single term, e.g. `hello`, multiple terms are also supported
- * and will be combined with OR, e.g `hello world` will match documents that contain either 'hello'
- * or 'world', though those that contain both will rank higher in the results.
- *
- * Wildcards can be included in terms to match one or more unspecified characters, these wildcards can
- * be inserted anywhere within the term, and more than one wildcard can exist in a single term. Adding
- * wildcards will increase the number of documents that will be found but can also have a negative
- * impact on query performance, especially with wildcards at the beginning of a term.
- *
- * Terms can be restricted to specific fields, e.g. `title:hello`, only documents with the term
- * hello in the title field will match this query. Using a field not present in the index will lead
- * to an error being thrown.
- *
- * Modifiers can also be added to terms, lunr supports edit distance and boost modifiers on terms. A term
- * boost will make documents matching that term score higher, e.g. `foo^5`. Edit distance is also supported
- * to provide fuzzy matching, e.g. 'hello~2' will match documents with hello with an edit distance of 2.
- * Avoid large values for edit distance to improve query performance.
- *
- * Each term also supports a presence modifier. By default a term's presence in document is optional, however
- * this can be changed to either required or prohibited. For a term's presence to be required in a document the
- * term should be prefixed with a '+', e.g. `+foo bar` is a search for documents that must contain 'foo' and
- * optionally contain 'bar'. Conversely a leading '-' sets the terms presence to prohibited, i.e. it must not
- * appear in a document, e.g. `-foo bar` is a search for documents that do not contain 'foo' but may contain 'bar'.
- *
- * To escape special characters the backslash character '\' can be used, this allows searches to include
- * characters that would normally be considered modifiers, e.g. `foo\~2` will search for a term "foo~2" instead
- * of attempting to apply a boost of 2 to the search term "foo".
- *
- * @typedef {string} lunr.Index~QueryString
- * @example
Simple single term query
- * hello
- * @example
Multiple term query
- * hello world
- * @example
term scoped to a field
- * title:hello
- * @example
term with a boost of 10
- * hello^10
- * @example
term with an edit distance of 2
- * hello~2
- * @example
terms with presence modifiers
- * -foo +bar baz
- */
-
- /**
- * Performs a search against the index using lunr query syntax.
- *
- * Results will be returned sorted by their score, the most relevant results
- * will be returned first. For details on how the score is calculated, please see
- * the {@link https://lunrjs.com/guides/searching.html#scoring|guide}.
- *
- * For more programmatic querying use lunr.Index#query.
- *
- * @param {lunr.Index~QueryString} queryString - A string containing a lunr query.
- * @throws {lunr.QueryParseError} If the passed query string cannot be parsed.
- * @returns {lunr.Index~Result[]}
- */
- lunr.Index.prototype.search = function (queryString) {
- return this.query(function (query) {
- var parser = new lunr.QueryParser(queryString, query);
- parser.parse();
- });
- };
-
- /**
- * A query builder callback provides a query object to be used to express
- * the query to perform on the index.
- *
- * @callback lunr.Index~queryBuilder
- * @param {lunr.Query} query - The query object to build up.
- * @this lunr.Query
- */
-
- /**
- * Performs a query against the index using the yielded lunr.Query object.
- *
- * If performing programmatic queries against the index, this method is preferred
- * over lunr.Index#search so as to avoid the additional query parsing overhead.
- *
- * A query object is yielded to the supplied function which should be used to
- * express the query to be run against the index.
- *
- * Note that although this function takes a callback parameter it is _not_ an
- * asynchronous operation, the callback is just yielded a query object to be
- * customized.
- *
- * @param {lunr.Index~queryBuilder} fn - A function that is used to build the query.
- * @returns {lunr.Index~Result[]}
- */
- lunr.Index.prototype.query = function (fn) {
- // for each query clause
- // * process terms
- // * expand terms from token set
- // * find matching documents and metadata
- // * get document vectors
- // * score documents
-
- var query = new lunr.Query(this.fields),
- matchingFields = Object.create(null),
- queryVectors = Object.create(null),
- termFieldCache = Object.create(null),
- requiredMatches = Object.create(null),
- prohibitedMatches = Object.create(null);
-
- /*
- * To support field level boosts a query vector is created per
- * field. An empty vector is eagerly created to support negated
- * queries.
- */
- for (var i = 0; i < this.fields.length; i++) {
- queryVectors[this.fields[i]] = new lunr.Vector();
- }
-
- fn.call(query, query);
-
- for (var i = 0; i < query.clauses.length; i++) {
- /*
- * Unless the pipeline has been disabled for this term, which is
- * the case for terms with wildcards, we need to pass the clause
- * term through the search pipeline. A pipeline returns an array
- * of processed terms. Pipeline functions may expand the passed
- * term, which means we may end up performing multiple index lookups
- * for a single query term.
- */
- var clause = query.clauses[i],
- terms = null,
- clauseMatches = lunr.Set.complete;
-
- if (clause.usePipeline) {
- terms = this.pipeline.runString(clause.term, {
- fields: clause.fields,
- });
- } else {
- terms = [clause.term];
- }
-
- for (var m = 0; m < terms.length; m++) {
- var term = terms[m];
-
- /*
- * Each term returned from the pipeline needs to use the same query
- * clause object, e.g. the same boost and or edit distance. The
- * simplest way to do this is to re-use the clause object but mutate
- * its term property.
- */
- clause.term = term;
-
- /*
- * From the term in the clause we create a token set which will then
- * be used to intersect the indexes token set to get a list of terms
- * to lookup in the inverted index
- */
- var termTokenSet = lunr.TokenSet.fromClause(clause),
- expandedTerms = this.tokenSet.intersect(termTokenSet).toArray();
-
- /*
- * If a term marked as required does not exist in the tokenSet it is
- * impossible for the search to return any matches. We set all the field
- * scoped required matches set to empty and stop examining any further
- * clauses.
- */
- if (expandedTerms.length === 0 && clause.presence === lunr.Query.presence.REQUIRED) {
- for (var k = 0; k < clause.fields.length; k++) {
- var field = clause.fields[k];
- requiredMatches[field] = lunr.Set.empty;
- }
-
- break;
- }
-
- for (var j = 0; j < expandedTerms.length; j++) {
- /*
- * For each term get the posting and termIndex, this is required for
- * building the query vector.
- */
- var expandedTerm = expandedTerms[j],
- posting = this.invertedIndex[expandedTerm],
- termIndex = posting._index;
-
- for (var k = 0; k < clause.fields.length; k++) {
- /*
- * For each field that this query term is scoped by (by default
- * all fields are in scope) we need to get all the document refs
- * that have this term in that field.
- *
- * The posting is the entry in the invertedIndex for the matching
- * term from above.
- */
- var field = clause.fields[k],
- fieldPosting = posting[field],
- matchingDocumentRefs = Object.keys(fieldPosting),
- termField = expandedTerm + '/' + field,
- matchingDocumentsSet = new lunr.Set(matchingDocumentRefs);
-
- /*
- * if the presence of this term is required ensure that the matching
- * documents are added to the set of required matches for this clause.
- *
- */
- if (clause.presence == lunr.Query.presence.REQUIRED) {
- clauseMatches = clauseMatches.union(matchingDocumentsSet);
-
- if (requiredMatches[field] === undefined) {
- requiredMatches[field] = lunr.Set.complete;
- }
- }
-
- /*
- * if the presence of this term is prohibited ensure that the matching
- * documents are added to the set of prohibited matches for this field,
- * creating that set if it does not yet exist.
- */
- if (clause.presence == lunr.Query.presence.PROHIBITED) {
- if (prohibitedMatches[field] === undefined) {
- prohibitedMatches[field] = lunr.Set.empty;
- }
-
- prohibitedMatches[field] = prohibitedMatches[field].union(matchingDocumentsSet);
-
- /*
- * Prohibited matches should not be part of the query vector used for
- * similarity scoring and no metadata should be extracted so we continue
- * to the next field
- */
- continue;
- }
-
- /*
- * The query field vector is populated using the termIndex found for
- * the term and a unit value with the appropriate boost applied.
- * Using upsert because there could already be an entry in the vector
- * for the term we are working with. In that case we just add the scores
- * together.
- */
- queryVectors[field].upsert(termIndex, clause.boost, function (a, b) {
- return a + b;
- });
-
- /**
- * If we've already seen this term, field combo then we've already collected
- * the matching documents and metadata, no need to go through all that again
- */
- if (termFieldCache[termField]) {
- continue;
- }
-
- for (var l = 0; l < matchingDocumentRefs.length; l++) {
- /*
- * All metadata for this term/field/document triple
- * are then extracted and collected into an instance
- * of lunr.MatchData ready to be returned in the query
- * results
- */
- var matchingDocumentRef = matchingDocumentRefs[l],
- matchingFieldRef = new lunr.FieldRef(matchingDocumentRef, field),
- metadata = fieldPosting[matchingDocumentRef],
- fieldMatch;
-
- if ((fieldMatch = matchingFields[matchingFieldRef]) === undefined) {
- matchingFields[matchingFieldRef] = new lunr.MatchData(expandedTerm, field, metadata);
- } else {
- fieldMatch.add(expandedTerm, field, metadata);
- }
- }
-
- termFieldCache[termField] = true;
- }
- }
- }
-
- /**
- * If the presence was required we need to update the requiredMatches field sets.
- * We do this after all fields for the term have collected their matches because
- * the clause terms presence is required in _any_ of the fields not _all_ of the
- * fields.
- */
- if (clause.presence === lunr.Query.presence.REQUIRED) {
- for (var k = 0; k < clause.fields.length; k++) {
- var field = clause.fields[k];
- requiredMatches[field] = requiredMatches[field].intersect(clauseMatches);
- }
- }
- }
-
- /**
- * Need to combine the field scoped required and prohibited
- * matching documents into a global set of required and prohibited
- * matches
- */
- var allRequiredMatches = lunr.Set.complete,
- allProhibitedMatches = lunr.Set.empty;
-
- for (var i = 0; i < this.fields.length; i++) {
- var field = this.fields[i];
-
- if (requiredMatches[field]) {
- allRequiredMatches = allRequiredMatches.intersect(requiredMatches[field]);
- }
-
- if (prohibitedMatches[field]) {
- allProhibitedMatches = allProhibitedMatches.union(prohibitedMatches[field]);
- }
- }
-
- var matchingFieldRefs = Object.keys(matchingFields),
- results = [],
- matches = Object.create(null);
-
- /*
- * If the query is negated (contains only prohibited terms)
- * we need to get _all_ fieldRefs currently existing in the
- * index. This is only done when we know that the query is
- * entirely prohibited terms to avoid any cost of getting all
- * fieldRefs unnecessarily.
- *
- * Additionally, blank MatchData must be created to correctly
- * populate the results.
- */
- if (query.isNegated()) {
- matchingFieldRefs = Object.keys(this.fieldVectors);
-
- for (var i = 0; i < matchingFieldRefs.length; i++) {
- var matchingFieldRef = matchingFieldRefs[i];
- var fieldRef = lunr.FieldRef.fromString(matchingFieldRef);
- matchingFields[matchingFieldRef] = new lunr.MatchData();
- }
- }
-
- for (var i = 0; i < matchingFieldRefs.length; i++) {
- /*
- * Currently we have document fields that match the query, but we
- * need to return documents. The matchData and scores are combined
- * from multiple fields belonging to the same document.
- *
- * Scores are calculated by field, using the query vectors created
- * above, and combined into a final document score using addition.
- */
- var fieldRef = lunr.FieldRef.fromString(matchingFieldRefs[i]),
- docRef = fieldRef.docRef;
-
- if (!allRequiredMatches.contains(docRef)) {
- continue;
- }
-
- if (allProhibitedMatches.contains(docRef)) {
- continue;
- }
-
- var fieldVector = this.fieldVectors[fieldRef],
- score = queryVectors[fieldRef.fieldName].similarity(fieldVector),
- docMatch;
-
- if ((docMatch = matches[docRef]) !== undefined) {
- docMatch.score += score;
- docMatch.matchData.combine(matchingFields[fieldRef]);
- } else {
- var match = {
- ref: docRef,
- score: score,
- matchData: matchingFields[fieldRef],
- };
- matches[docRef] = match;
- results.push(match);
- }
- }
-
- /*
- * Sort the results objects by score, highest first.
- */
- return results.sort(function (a, b) {
- return b.score - a.score;
- });
- };
-
- /**
- * Prepares the index for JSON serialization.
- *
- * The schema for this JSON blob will be described in a
- * separate JSON schema file.
- *
- * @returns {Object}
- */
- lunr.Index.prototype.toJSON = function () {
- var invertedIndex = Object.keys(this.invertedIndex)
- .sort()
- .map(function (term) {
- return [term, this.invertedIndex[term]];
- }, this);
-
- var fieldVectors = Object.keys(this.fieldVectors).map(function (ref) {
- return [ref, this.fieldVectors[ref].toJSON()];
- }, this);
-
- return {
- version: lunr.version,
- fields: this.fields,
- fieldVectors: fieldVectors,
- invertedIndex: invertedIndex,
- pipeline: this.pipeline.toJSON(),
- };
- };
-
- /**
- * Loads a previously serialized lunr.Index
- *
- * @param {Object} serializedIndex - A previously serialized lunr.Index
- * @returns {lunr.Index}
- */
- lunr.Index.load = function (serializedIndex) {
- var attrs = {},
- fieldVectors = {},
- serializedVectors = serializedIndex.fieldVectors,
- invertedIndex = Object.create(null),
- serializedInvertedIndex = serializedIndex.invertedIndex,
- tokenSetBuilder = new lunr.TokenSet.Builder(),
- pipeline = lunr.Pipeline.load(serializedIndex.pipeline);
-
- if (serializedIndex.version != lunr.version) {
- lunr.utils.warn(
- "Version mismatch when loading serialised index. Current version of lunr '" +
- lunr.version +
- "' does not match serialized index '" +
- serializedIndex.version +
- "'"
- );
- }
-
- for (var i = 0; i < serializedVectors.length; i++) {
- var tuple = serializedVectors[i],
- ref = tuple[0],
- elements = tuple[1];
-
- fieldVectors[ref] = new lunr.Vector(elements);
- }
-
- for (var i = 0; i < serializedInvertedIndex.length; i++) {
- var tuple = serializedInvertedIndex[i],
- term = tuple[0],
- posting = tuple[1];
-
- tokenSetBuilder.insert(term);
- invertedIndex[term] = posting;
- }
-
- tokenSetBuilder.finish();
-
- attrs.fields = serializedIndex.fields;
-
- attrs.fieldVectors = fieldVectors;
- attrs.invertedIndex = invertedIndex;
- attrs.tokenSet = tokenSetBuilder.root;
- attrs.pipeline = pipeline;
-
- return new lunr.Index(attrs);
- };
- /*!
- * lunr.Builder
- * Copyright (C) 2019 Oliver Nightingale
- */
-
- /**
- * lunr.Builder performs indexing on a set of documents and
- * returns instances of lunr.Index ready for querying.
- *
- * All configuration of the index is done via the builder, the
- * fields to index, the document reference, the text processing
- * pipeline and document scoring parameters are all set on the
- * builder before indexing.
- *
- * @constructor
- * @property {string} _ref - Internal reference to the document reference field.
- * @property {string[]} _fields - Internal reference to the document fields to index.
- * @property {object} invertedIndex - The inverted index maps terms to document fields.
- * @property {object} documentTermFrequencies - Keeps track of document term frequencies.
- * @property {object} documentLengths - Keeps track of the length of documents added to the index.
- * @property {lunr.tokenizer} tokenizer - Function for splitting strings into tokens for indexing.
- * @property {lunr.Pipeline} pipeline - The pipeline performs text processing on tokens before indexing.
- * @property {lunr.Pipeline} searchPipeline - A pipeline for processing search terms before querying the index.
- * @property {number} documentCount - Keeps track of the total number of documents indexed.
- * @property {number} _b - A parameter to control field length normalization, setting this to 0 disabled normalization, 1 fully normalizes field lengths, the default value is 0.75.
- * @property {number} _k1 - A parameter to control how quickly an increase in term frequency results in term frequency saturation, the default value is 1.2.
- * @property {number} termIndex - A counter incremented for each unique term, used to identify a terms position in the vector space.
- * @property {array} metadataWhitelist - A list of metadata keys that have been whitelisted for entry in the index.
- */
- lunr.Builder = function () {
- this._ref = 'id';
- this._fields = Object.create(null);
- this._documents = Object.create(null);
- this.invertedIndex = Object.create(null);
- this.fieldTermFrequencies = {};
- this.fieldLengths = {};
- this.tokenizer = lunr.tokenizer;
- this.pipeline = new lunr.Pipeline();
- this.searchPipeline = new lunr.Pipeline();
- this.documentCount = 0;
- this._b = 0.75;
- this._k1 = 1.2;
- this.termIndex = 0;
- this.metadataWhitelist = [];
- };
-
- /**
- * Sets the document field used as the document reference. Every document must have this field.
- * The type of this field in the document should be a string, if it is not a string it will be
- * coerced into a string by calling toString.
- *
- * The default ref is 'id'.
- *
- * The ref should _not_ be changed during indexing, it should be set before any documents are
- * added to the index. Changing it during indexing can lead to inconsistent results.
- *
- * @param {string} ref - The name of the reference field in the document.
- */
- lunr.Builder.prototype.ref = function (ref) {
- this._ref = ref;
- };
-
- /**
- * A function that is used to extract a field from a document.
- *
- * Lunr expects a field to be at the top level of a document, if however the field
- * is deeply nested within a document an extractor function can be used to extract
- * the right field for indexing.
- *
- * @callback fieldExtractor
- * @param {object} doc - The document being added to the index.
- * @returns {?(string|object|object[])} obj - The object that will be indexed for this field.
- * @example
Extracting a nested field
- * function (doc) { return doc.nested.field }
- */
-
- /**
- * Adds a field to the list of document fields that will be indexed. Every document being
- * indexed should have this field. Null values for this field in indexed documents will
- * not cause errors but will limit the chance of that document being retrieved by searches.
- *
- * All fields should be added before adding documents to the index. Adding fields after
- * a document has been indexed will have no effect on already indexed documents.
- *
- * Fields can be boosted at build time. This allows terms within that field to have more
- * importance when ranking search results. Use a field boost to specify that matches within
- * one field are more important than other fields.
- *
- * @param {string} fieldName - The name of a field to index in all documents.
- * @param {object} attributes - Optional attributes associated with this field.
- * @param {number} [attributes.boost=1] - Boost applied to all terms within this field.
- * @param {fieldExtractor} [attributes.extractor] - Function to extract a field from a document.
- * @throws {RangeError} fieldName cannot contain unsupported characters '/'
- */
- lunr.Builder.prototype.field = function (fieldName, attributes) {
- if (/\//.test(fieldName)) {
- throw new RangeError("Field '" + fieldName + "' contains illegal character '/'");
- }
-
- this._fields[fieldName] = attributes || {};
- };
-
- /**
- * A parameter to tune the amount of field length normalisation that is applied when
- * calculating relevance scores. A value of 0 will completely disable any normalisation
- * and a value of 1 will fully normalise field lengths. The default is 0.75. Values of b
- * will be clamped to the range 0 - 1.
- *
- * @param {number} number - The value to set for this tuning parameter.
- */
- lunr.Builder.prototype.b = function (number) {
- if (number < 0) {
- this._b = 0;
- } else if (number > 1) {
- this._b = 1;
- } else {
- this._b = number;
- }
- };
-
- /**
- * A parameter that controls the speed at which a rise in term frequency results in term
- * frequency saturation. The default value is 1.2. Setting this to a higher value will give
- * slower saturation levels, a lower value will result in quicker saturation.
- *
- * @param {number} number - The value to set for this tuning parameter.
- */
- lunr.Builder.prototype.k1 = function (number) {
- this._k1 = number;
- };
-
- /**
- * Adds a document to the index.
- *
- * Before adding fields to the index the index should have been fully setup, with the document
- * ref and all fields to index already having been specified.
- *
- * The document must have a field name as specified by the ref (by default this is 'id') and
- * it should have all fields defined for indexing, though null or undefined values will not
- * cause errors.
- *
- * Entire documents can be boosted at build time. Applying a boost to a document indicates that
- * this document should rank higher in search results than other documents.
- *
- * @param {object} doc - The document to add to the index.
- * @param {object} attributes - Optional attributes associated with this document.
- * @param {number} [attributes.boost=1] - Boost applied to all terms within this document.
- */
- lunr.Builder.prototype.add = function (doc, attributes) {
- var docRef = doc[this._ref],
- fields = Object.keys(this._fields);
-
- this._documents[docRef] = attributes || {};
- this.documentCount += 1;
-
- for (var i = 0; i < fields.length; i++) {
- var fieldName = fields[i],
- extractor = this._fields[fieldName].extractor,
- field = extractor ? extractor(doc) : doc[fieldName],
- tokens = this.tokenizer(field, {
- fields: [fieldName],
- }),
- terms = this.pipeline.run(tokens),
- fieldRef = new lunr.FieldRef(docRef, fieldName),
- fieldTerms = Object.create(null);
-
- this.fieldTermFrequencies[fieldRef] = fieldTerms;
- this.fieldLengths[fieldRef] = 0;
-
- // store the length of this field for this document
- this.fieldLengths[fieldRef] += terms.length;
-
- // calculate term frequencies for this field
- for (var j = 0; j < terms.length; j++) {
- var term = terms[j];
-
- if (fieldTerms[term] == undefined) {
- fieldTerms[term] = 0;
- }
-
- fieldTerms[term] += 1;
-
- // add to inverted index
- // create an initial posting if one doesn't exist
- if (this.invertedIndex[term] == undefined) {
- var posting = Object.create(null);
- posting['_index'] = this.termIndex;
- this.termIndex += 1;
-
- for (var k = 0; k < fields.length; k++) {
- posting[fields[k]] = Object.create(null);
- }
-
- this.invertedIndex[term] = posting;
- }
-
- // add an entry for this term/fieldName/docRef to the invertedIndex
- if (this.invertedIndex[term][fieldName][docRef] == undefined) {
- this.invertedIndex[term][fieldName][docRef] = Object.create(null);
- }
-
- // store all whitelisted metadata about this token in the
- // inverted index
- for (var l = 0; l < this.metadataWhitelist.length; l++) {
- var metadataKey = this.metadataWhitelist[l],
- metadata = term.metadata[metadataKey];
-
- if (this.invertedIndex[term][fieldName][docRef][metadataKey] == undefined) {
- this.invertedIndex[term][fieldName][docRef][metadataKey] = [];
- }
-
- this.invertedIndex[term][fieldName][docRef][metadataKey].push(metadata);
- }
- }
- }
- };
-
- /**
- * Calculates the average document length for this index
- *
- * @private
- */
- lunr.Builder.prototype.calculateAverageFieldLengths = function () {
- var fieldRefs = Object.keys(this.fieldLengths),
- numberOfFields = fieldRefs.length,
- accumulator = {},
- documentsWithField = {};
-
- for (var i = 0; i < numberOfFields; i++) {
- var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),
- field = fieldRef.fieldName;
-
- documentsWithField[field] || (documentsWithField[field] = 0);
- documentsWithField[field] += 1;
-
- accumulator[field] || (accumulator[field] = 0);
- accumulator[field] += this.fieldLengths[fieldRef];
- }
-
- var fields = Object.keys(this._fields);
-
- for (var i = 0; i < fields.length; i++) {
- var fieldName = fields[i];
- accumulator[fieldName] = accumulator[fieldName] / documentsWithField[fieldName];
- }
-
- this.averageFieldLength = accumulator;
- };
-
- /**
- * Builds a vector space model of every document using lunr.Vector
- *
- * @private
- */
- lunr.Builder.prototype.createFieldVectors = function () {
- var fieldVectors = {},
- fieldRefs = Object.keys(this.fieldTermFrequencies),
- fieldRefsLength = fieldRefs.length,
- termIdfCache = Object.create(null);
-
- for (var i = 0; i < fieldRefsLength; i++) {
- var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),
- fieldName = fieldRef.fieldName,
- fieldLength = this.fieldLengths[fieldRef],
- fieldVector = new lunr.Vector(),
- termFrequencies = this.fieldTermFrequencies[fieldRef],
- terms = Object.keys(termFrequencies),
- termsLength = terms.length;
-
- var fieldBoost = this._fields[fieldName].boost || 1,
- docBoost = this._documents[fieldRef.docRef].boost || 1;
-
- for (var j = 0; j < termsLength; j++) {
- var term = terms[j],
- tf = termFrequencies[term],
- termIndex = this.invertedIndex[term]._index,
- idf,
- score,
- scoreWithPrecision;
-
- if (termIdfCache[term] === undefined) {
- idf = lunr.idf(this.invertedIndex[term], this.documentCount);
- termIdfCache[term] = idf;
- } else {
- idf = termIdfCache[term];
- }
-
- score =
- (idf * ((this._k1 + 1) * tf)) /
- (this._k1 * (1 - this._b + this._b * (fieldLength / this.averageFieldLength[fieldName])) + tf);
- score *= fieldBoost;
- score *= docBoost;
- scoreWithPrecision = Math.round(score * 1000) / 1000;
- // Converts 1.23456789 to 1.234.
- // Reducing the precision so that the vectors take up less
- // space when serialised. Doing it now so that they behave
- // the same before and after serialisation. Also, this is
- // the fastest approach to reducing a number's precision in
- // JavaScript.
-
- fieldVector.insert(termIndex, scoreWithPrecision);
- }
-
- fieldVectors[fieldRef] = fieldVector;
- }
-
- this.fieldVectors = fieldVectors;
- };
-
- /**
- * Creates a token set of all tokens in the index using lunr.TokenSet
- *
- * @private
- */
- lunr.Builder.prototype.createTokenSet = function () {
- this.tokenSet = lunr.TokenSet.fromArray(Object.keys(this.invertedIndex).sort());
- };
-
- /**
- * Builds the index, creating an instance of lunr.Index.
- *
- * This completes the indexing process and should only be called
- * once all documents have been added to the index.
- *
- * @returns {lunr.Index}
- */
- lunr.Builder.prototype.build = function () {
- this.calculateAverageFieldLengths();
- this.createFieldVectors();
- this.createTokenSet();
-
- return new lunr.Index({
- invertedIndex: this.invertedIndex,
- fieldVectors: this.fieldVectors,
- tokenSet: this.tokenSet,
- fields: Object.keys(this._fields),
- pipeline: this.searchPipeline,
- });
- };
-
- /**
- * Applies a plugin to the index builder.
- *
- * A plugin is a function that is called with the index builder as its context.
- * Plugins can be used to customise or extend the behaviour of the index
- * in some way. A plugin is just a function, that encapsulated the custom
- * behaviour that should be applied when building the index.
- *
- * The plugin function will be called with the index builder as its argument, additional
- * arguments can also be passed when calling use. The function will be called
- * with the index builder as its context.
- *
- * @param {Function} plugin The plugin to apply.
- */
- lunr.Builder.prototype.use = function (fn) {
- var args = Array.prototype.slice.call(arguments, 1);
- args.unshift(this);
- fn.apply(this, args);
- };
- /**
- * Contains and collects metadata about a matching document.
- * A single instance of lunr.MatchData is returned as part of every
- * lunr.Index~Result.
- *
- * @constructor
- * @param {string} term - The term this match data is associated with
- * @param {string} field - The field in which the term was found
- * @param {object} metadata - The metadata recorded about this term in this field
- * @property {object} metadata - A cloned collection of metadata associated with this document.
- * @see {@link lunr.Index~Result}
- */
- lunr.MatchData = function (term, field, metadata) {
- var clonedMetadata = Object.create(null),
- metadataKeys = Object.keys(metadata || {});
-
- // Cloning the metadata to prevent the original
- // being mutated during match data combination.
- // Metadata is kept in an array within the inverted
- // index so cloning the data can be done with
- // Array#slice
- for (var i = 0; i < metadataKeys.length; i++) {
- var key = metadataKeys[i];
- clonedMetadata[key] = metadata[key].slice();
- }
-
- this.metadata = Object.create(null);
-
- if (term !== undefined) {
- this.metadata[term] = Object.create(null);
- this.metadata[term][field] = clonedMetadata;
- }
- };
-
- /**
- * An instance of lunr.MatchData will be created for every term that matches a
- * document. However only one instance is required in a lunr.Index~Result. This
- * method combines metadata from another instance of lunr.MatchData with this
- * objects metadata.
- *
- * @param {lunr.MatchData} otherMatchData - Another instance of match data to merge with this one.
- * @see {@link lunr.Index~Result}
- */
- lunr.MatchData.prototype.combine = function (otherMatchData) {
- var terms = Object.keys(otherMatchData.metadata);
-
- for (var i = 0; i < terms.length; i++) {
- var term = terms[i],
- fields = Object.keys(otherMatchData.metadata[term]);
-
- if (this.metadata[term] == undefined) {
- this.metadata[term] = Object.create(null);
- }
-
- for (var j = 0; j < fields.length; j++) {
- var field = fields[j],
- keys = Object.keys(otherMatchData.metadata[term][field]);
-
- if (this.metadata[term][field] == undefined) {
- this.metadata[term][field] = Object.create(null);
- }
-
- for (var k = 0; k < keys.length; k++) {
- var key = keys[k];
-
- if (this.metadata[term][field][key] == undefined) {
- this.metadata[term][field][key] = otherMatchData.metadata[term][field][key];
- } else {
- this.metadata[term][field][key] = this.metadata[term][field][key].concat(
- otherMatchData.metadata[term][field][key]
- );
- }
- }
- }
- }
- };
-
- /**
- * Add metadata for a term/field pair to this instance of match data.
- *
- * @param {string} term - The term this match data is associated with
- * @param {string} field - The field in which the term was found
- * @param {object} metadata - The metadata recorded about this term in this field
- */
- lunr.MatchData.prototype.add = function (term, field, metadata) {
- if (!(term in this.metadata)) {
- this.metadata[term] = Object.create(null);
- this.metadata[term][field] = metadata;
- return;
- }
-
- if (!(field in this.metadata[term])) {
- this.metadata[term][field] = metadata;
- return;
- }
-
- var metadataKeys = Object.keys(metadata);
-
- for (var i = 0; i < metadataKeys.length; i++) {
- var key = metadataKeys[i];
-
- if (key in this.metadata[term][field]) {
- this.metadata[term][field][key] = this.metadata[term][field][key].concat(metadata[key]);
- } else {
- this.metadata[term][field][key] = metadata[key];
- }
- }
- };
- /**
- * A lunr.Query provides a programmatic way of defining queries to be performed
- * against a {@link lunr.Index}.
- *
- * Prefer constructing a lunr.Query using the {@link lunr.Index#query} method
- * so the query object is pre-initialized with the right index fields.
- *
- * @constructor
- * @property {lunr.Query~Clause[]} clauses - An array of query clauses.
- * @property {string[]} allFields - An array of all available fields in a lunr.Index.
- */
- lunr.Query = function (allFields) {
- this.clauses = [];
- this.allFields = allFields;
- };
-
- /**
- * Constants for indicating what kind of automatic wildcard insertion will be used when constructing a query clause.
- *
- * This allows wildcards to be added to the beginning and end of a term without having to manually do any string
- * concatenation.
- *
- * The wildcard constants can be bitwise combined to select both leading and trailing wildcards.
- *
- * @constant
- * @default
- * @property {number} wildcard.NONE - The term will have no wildcards inserted, this is the default behaviour
- * @property {number} wildcard.LEADING - Prepend the term with a wildcard, unless a leading wildcard already exists
- * @property {number} wildcard.TRAILING - Append a wildcard to the term, unless a trailing wildcard already exists
- * @see lunr.Query~Clause
- * @see lunr.Query#clause
- * @see lunr.Query#term
- * @example
- * query.term('foo', {
- * wildcard: lunr.Query.wildcard.LEADING | lunr.Query.wildcard.TRAILING
- * })
- */
-
- lunr.Query.wildcard = new String('*');
- lunr.Query.wildcard.NONE = 0;
- lunr.Query.wildcard.LEADING = 1;
- lunr.Query.wildcard.TRAILING = 2;
-
- /**
- * Constants for indicating what kind of presence a term must have in matching documents.
- *
- * @constant
- * @enum {number}
- * @see lunr.Query~Clause
- * @see lunr.Query#clause
- * @see lunr.Query#term
- * @example
query term with required presence
- * query.term('foo', { presence: lunr.Query.presence.REQUIRED })
- */
- lunr.Query.presence = {
- /**
- * Term's presence in a document is optional, this is the default value.
- */
- OPTIONAL: 1,
-
- /**
- * Term's presence in a document is required, documents that do not contain
- * this term will not be returned.
- */
- REQUIRED: 2,
-
- /**
- * Term's presence in a document is prohibited, documents that do contain
- * this term will not be returned.
- */
- PROHIBITED: 3,
- };
-
- /**
- * A single clause in a {@link lunr.Query} contains a term and details on how to
- * match that term against a {@link lunr.Index}.
- *
- * @typedef {Object} lunr.Query~Clause
- * @property {string[]} fields - The fields in an index this clause should be matched against.
- * @property {number} [boost=1] - Any boost that should be applied when matching this clause.
- * @property {number} [editDistance] - Whether the term should have fuzzy matching applied, and how fuzzy the match should be.
- * @property {boolean} [usePipeline] - Whether the term should be passed through the search pipeline.
- * @property {number} [wildcard=lunr.Query.wildcard.NONE] - Whether the term should have wildcards appended or prepended.
- * @property {number} [presence=lunr.Query.presence.OPTIONAL] - The terms presence in any matching documents.
- */
-
- /**
- * Adds a {@link lunr.Query~Clause} to this query.
- *
- * Unless the clause contains the fields to be matched all fields will be matched. In addition
- * a default boost of 1 is applied to the clause.
- *
- * @param {lunr.Query~Clause} clause - The clause to add to this query.
- * @see lunr.Query~Clause
- * @returns {lunr.Query}
- */
- lunr.Query.prototype.clause = function (clause) {
- if (!('fields' in clause)) {
- clause.fields = this.allFields;
- }
-
- if (!('boost' in clause)) {
- clause.boost = 1;
- }
-
- if (!('usePipeline' in clause)) {
- clause.usePipeline = true;
- }
-
- if (!('wildcard' in clause)) {
- clause.wildcard = lunr.Query.wildcard.NONE;
- }
-
- if (clause.wildcard & lunr.Query.wildcard.LEADING && clause.term.charAt(0) != lunr.Query.wildcard) {
- clause.term = '*' + clause.term;
- }
-
- if (clause.wildcard & lunr.Query.wildcard.TRAILING && clause.term.slice(-1) != lunr.Query.wildcard) {
- clause.term = '' + clause.term + '*';
- }
-
- if (!('presence' in clause)) {
- clause.presence = lunr.Query.presence.OPTIONAL;
- }
-
- this.clauses.push(clause);
-
- return this;
- };
-
- /**
- * A negated query is one in which every clause has a presence of
- * prohibited. These queries require some special processing to return
- * the expected results.
- *
- * @returns boolean
- */
- lunr.Query.prototype.isNegated = function () {
- for (var i = 0; i < this.clauses.length; i++) {
- if (this.clauses[i].presence != lunr.Query.presence.PROHIBITED) {
- return false;
- }
- }
-
- return true;
- };
-
- /**
- * Adds a term to the current query, under the covers this will create a {@link lunr.Query~Clause}
- * to the list of clauses that make up this query.
- *
- * The term is used as is, i.e. no tokenization will be performed by this method. Instead conversion
- * to a token or token-like string should be done before calling this method.
- *
- * The term will be converted to a string by calling `toString`. Multiple terms can be passed as an
- * array, each term in the array will share the same options.
- *
- * @param {object|object[]} term - The term(s) to add to the query.
- * @param {object} [options] - Any additional properties to add to the query clause.
- * @returns {lunr.Query}
- * @see lunr.Query#clause
- * @see lunr.Query~Clause
- * @example
adding a single term to a query
- * query.term("foo")
- * @example
adding a single term to a query and specifying search fields, term boost and automatic trailing wildcard
'
- );
-}
-
-function displayResults(results) {
- var search_results = document.getElementById('mkdocs-search-results');
- while (search_results.firstChild) {
- search_results.removeChild(search_results.firstChild);
- }
- if (results.length > 0) {
- for (var i = 0; i < results.length; i++) {
- var result = results[i];
- var html = formatResult(result.location, result.title, result.summary);
- search_results.insertAdjacentHTML('beforeend', html);
- }
- } else {
- search_results.insertAdjacentHTML('beforeend', '
No results found
');
- }
-}
-
-function doSearch() {
- var query = document.getElementById('mkdocs-search-query').value;
- if (query.length > min_search_length) {
- if (!window.Worker) {
- displayResults(search(query));
- } else {
- searchWorker.postMessage({ query: query });
- }
- } else {
- // Clear results for short queries
- displayResults([]);
- }
-}
-
-function initSearch() {
- var search_input = document.getElementById('mkdocs-search-query');
- if (search_input) {
- search_input.addEventListener('keyup', doSearch);
- }
- var term = getSearchTermFromLocation();
- if (term) {
- search_input.value = term;
- doSearch();
- }
-}
-
-function onWorkerMessage(e) {
- if (e.data.allowSearch) {
- initSearch();
- } else if (e.data.results) {
- var results = e.data.results;
- displayResults(results);
- } else if (e.data.config) {
- min_search_length = e.data.config.min_search_length - 1;
- }
-}
-
-if (!window.Worker) {
- console.log('Web Worker API not supported');
- // load index in main thread
- $.getScript(joinUrl(base_url, 'search/worker.js'))
- .done(function () {
- console.log('Loaded worker');
- init();
- window.postMessage = function (msg) {
- onWorkerMessage({ data: msg });
- };
- })
- .fail(function (jqxhr, settings, exception) {
- console.error('Could not load worker.js');
- });
-} else {
- // Wrap search in a web worker
- var searchWorker = new Worker(joinUrl(base_url, 'search/worker.js'));
- searchWorker.postMessage({ init: true });
- searchWorker.onmessage = onWorkerMessage;
-}
diff --git a/site/search/search_index.json b/site/search/search_index.json
deleted file mode 100644
index cafa3255..00000000
--- a/site/search/search_index.json
+++ /dev/null
@@ -1 +0,0 @@
-{"config":{"lang":["en"],"min_search_length":3,"prebuild_index":false,"separator":"[\\s\\-]+"},"docs":[{"location":"","text":"English Framadate - funky version FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend. EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API.ntributeurs de l'association Framasoft, avec une API backend. Index Meeting notes Getting Started (yarn start / npm start) How to contribute Architecture Translation i18n Accesibility Licence GNU affero V3 Framadate - funky version FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend. EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API. Pour d\u00e9buter - getting started lire la doc pour d\u00e9buter votre Funky Framadate Documentation voil\u00e0 voil\u00e0","title":"Framadate - funky version"},{"location":"#framadate-funky-version","text":"FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend. EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API.ntributeurs de l'association Framasoft, avec une API backend.","title":"Framadate - funky version"},{"location":"#index","text":"Meeting notes Getting Started (yarn start / npm start) How to contribute Architecture Translation i18n Accesibility Licence GNU affero V3","title":"Index"},{"location":"#framadate-funky-version_1","text":"FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend. EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API.","title":"Framadate - funky version"},{"location":"#pour-debuter-getting-started","text":"lire la doc pour d\u00e9buter votre Funky Framadate","title":"Pour d\u00e9buter - getting started"},{"location":"#documentation","text":"voil\u00e0 voil\u00e0","title":"Documentation"},{"location":"GETTING_STARTED/","text":"English: This page isn't translated to English. Pour d\u00e9buter - getting started Clonez le d\u00e9pot, installez les d\u00e9pendances, et lancez le serveur local qui se recharge lorsque vous sauvegardez des fichiers dans le d\u00e9pot. Les fois suivantes vous n'aurez qu'a lancer yarn start. # clone the repo git clone https://framagit.org/framasoft/framadate/funky-framadate-front.git cd funky-framadate-front # install yarn curl -sS https://dl.yarnpkg.com/debian/pubkey.gpg | sudo apt-key add - echo \"deb https://dl.yarnpkg.com/debian/ stable main\" | sudo tee /etc/apt/sources.list.d/yarn.list sudo apt-get update && sudo apt-get install yarn yarn install --pure-lockfile yarn start # and now check your browser http://localhost:4200 Pour interagir avec la base de donn\u00e9es, il vous faudra \u00e9galement faire d\u00e9marrer l'API Symfony de backend dans l'autre d\u00e9pot, qui se lance par d\u00e9faut sur le port 8000. Pas de config docker Nous n'avons pas actuellement de config docker qui solutionnerait tout \u00e7a, les merge request sont les bienvenues! :)","title":"D\u00e9marrer"},{"location":"GETTING_STARTED/#pour-debuter-getting-started","text":"Clonez le d\u00e9pot, installez les d\u00e9pendances, et lancez le serveur local qui se recharge lorsque vous sauvegardez des fichiers dans le d\u00e9pot. Les fois suivantes vous n'aurez qu'a lancer yarn start. # clone the repo git clone https://framagit.org/framasoft/framadate/funky-framadate-front.git cd funky-framadate-front # install yarn curl -sS https://dl.yarnpkg.com/debian/pubkey.gpg | sudo apt-key add - echo \"deb https://dl.yarnpkg.com/debian/ stable main\" | sudo tee /etc/apt/sources.list.d/yarn.list sudo apt-get update && sudo apt-get install yarn yarn install --pure-lockfile yarn start # and now check your browser http://localhost:4200 Pour interagir avec la base de donn\u00e9es, il vous faudra \u00e9galement faire d\u00e9marrer l'API Symfony de backend dans l'autre d\u00e9pot, qui se lance par d\u00e9faut sur le port 8000.","title":"Pour d\u00e9buter - getting started"},{"location":"GETTING_STARTED/#pas-de-config-docker","text":"Nous n'avons pas actuellement de config docker qui solutionnerait tout \u00e7a, les merge request sont les bienvenues! :)","title":"Pas de config docker"},{"location":"LICENSE.en/","text":"Fran\u00e7ais: Cette page n'est pas traduite en Fran\u00e7ais. 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. Copyright (C) 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 . 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/ .","title":"LICENSE.en"},{"location":"LICENSE.en/#gnu-affero-general-public-license","text":"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.","title":"GNU AFFERO GENERAL PUBLIC LICENSE"},{"location":"LICENSE.en/#preamble","text":"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.","title":"Preamble"},{"location":"LICENSE.en/#terms-and-conditions","text":"","title":"TERMS AND CONDITIONS"},{"location":"LICENSE.en/#0-definitions","text":"\"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.","title":"0. Definitions."},{"location":"LICENSE.en/#1-source-code","text":"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.","title":"1. Source Code."},{"location":"LICENSE.en/#2-basic-permissions","text":"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.","title":"2. Basic Permissions."},{"location":"LICENSE.en/#3-protecting-users-legal-rights-from-anti-circumvention-law","text":"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.","title":"3. Protecting Users' Legal Rights From Anti-Circumvention Law."},{"location":"LICENSE.en/#4-conveying-verbatim-copies","text":"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.","title":"4. Conveying Verbatim Copies."},{"location":"LICENSE.en/#5-conveying-modified-source-versions","text":"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.","title":"5. Conveying Modified Source Versions."},{"location":"LICENSE.en/#6-conveying-non-source-forms","text":"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.","title":"6. Conveying Non-Source Forms."},{"location":"LICENSE.en/#7-additional-terms","text":"\"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.","title":"7. Additional Terms."},{"location":"LICENSE.en/#8-termination","text":"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.","title":"8. Termination."},{"location":"LICENSE.en/#9-acceptance-not-required-for-having-copies","text":"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.","title":"9. Acceptance Not Required for Having Copies."},{"location":"LICENSE.en/#10-automatic-licensing-of-downstream-recipients","text":"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.","title":"10. Automatic Licensing of Downstream Recipients."},{"location":"LICENSE.en/#11-patents","text":"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.","title":"11. Patents."},{"location":"LICENSE.en/#12-no-surrender-of-others-freedom","text":"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.","title":"12. No Surrender of Others' Freedom."},{"location":"LICENSE.en/#13-remote-network-interaction-use-with-the-gnu-general-public-license","text":"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.","title":"13. Remote Network Interaction; Use with the GNU General Public License."},{"location":"LICENSE.en/#14-revised-versions-of-this-license","text":"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.","title":"14. Revised Versions of this License."},{"location":"LICENSE.en/#15-disclaimer-of-warranty","text":"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.","title":"15. Disclaimer of Warranty."},{"location":"LICENSE.en/#16-limitation-of-liability","text":"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.","title":"16. Limitation of Liability."},{"location":"LICENSE.en/#17-interpretation-of-sections-15-and-16","text":"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","title":"17. Interpretation of Sections 15 and 16."},{"location":"LICENSE.en/#how-to-apply-these-terms-to-your-new-programs","text":"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. Copyright (C) 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 . 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/ .","title":"How to Apply These Terms to Your New Programs"},{"location":"TODO/","text":"English: This page isn't translated to English. Todo - liste des choses \u00e0 faire Id\u00e9es pour de futures am\u00e9liorations (pertinence \u00e0 v\u00e9rifier) Gagner en vie priv\u00e9e en chiffrant certaines informations ? Stockage z\u00e9ro knowledge avec un chiffrement robuste \u00e0 courbe elliptique. \u00c0 r\u00e9fl\u00e9chir : permettre \u00e0 Framadate de faire entrer \u00e0 des gens plusieurs plages de temps de disponibilit\u00e9 et le service d\u00e9duit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait \u00eatre avec divers niveaux de d\u00e9tail. Comme https://omnipointment.com/ (qui est un logiciel privateur) SSO du f\u00e9diverse ? Tableau des avancements https://framagit.org/framasoft/framadate/funky-framadate-front/-/boards Choses faites voir le [changelog.md] Les id\u00e9es et rapports de bugs sont disponibles dans le tableau des Issues sur la forge logicielle. principales Accessibilit\u00e9 renforc\u00e9e. Adapt\u00e9 aussi bien sur mobile que grands \u00e9crans \u00e0 haute ou faible densit\u00e9 de pixels. Tests unitaires et end-to-end. Couverture de test. Choix de r\u00e9ponses possibles. Proposer de ne r\u00e9pondre que \u00ab oui \u00bb ou rien, ou aller dans la nuance en proposant \u00ab oui \u00bb, \u00ab peut-\u00eatre \u00bb, \u00ab non \u00bb, \u00ab ? \u00bb. # Redondance ou le choix de r\u00e9ponses possibles de la premi\u00e8re phrase concerne un autre choix ? Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien. Th\u00e8me sombre. Duplication de sondage \u00e0 partir d'un autre. Limiter le nombre de participants maximum","title":"en cours (Fran\u00e7ais)"},{"location":"TODO/#todo-liste-des-choses-a-faire","text":"","title":"Todo - liste des choses \u00e0 faire"},{"location":"TODO/#idees-pour-de-futures-ameliorations-pertinence-a-verifier","text":"Gagner en vie priv\u00e9e en chiffrant certaines informations ? Stockage z\u00e9ro knowledge avec un chiffrement robuste \u00e0 courbe elliptique. \u00c0 r\u00e9fl\u00e9chir : permettre \u00e0 Framadate de faire entrer \u00e0 des gens plusieurs plages de temps de disponibilit\u00e9 et le service d\u00e9duit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait \u00eatre avec divers niveaux de d\u00e9tail. Comme https://omnipointment.com/ (qui est un logiciel privateur) SSO du f\u00e9diverse ?","title":"Id\u00e9es pour de futures am\u00e9liorations (pertinence \u00e0 v\u00e9rifier)"},{"location":"TODO/#tableau-des-avancements","text":"https://framagit.org/framasoft/framadate/funky-framadate-front/-/boards","title":"Tableau des avancements"},{"location":"TODO/#choses-faites","text":"voir le [changelog.md] Les id\u00e9es et rapports de bugs sont disponibles dans le tableau des Issues sur la forge logicielle.","title":"Choses faites"},{"location":"TODO/#principales","text":"Accessibilit\u00e9 renforc\u00e9e. Adapt\u00e9 aussi bien sur mobile que grands \u00e9crans \u00e0 haute ou faible densit\u00e9 de pixels. Tests unitaires et end-to-end. Couverture de test. Choix de r\u00e9ponses possibles. Proposer de ne r\u00e9pondre que \u00ab oui \u00bb ou rien, ou aller dans la nuance en proposant \u00ab oui \u00bb, \u00ab peut-\u00eatre \u00bb, \u00ab non \u00bb, \u00ab ? \u00bb. # Redondance ou le choix de r\u00e9ponses possibles de la premi\u00e8re phrase concerne un autre choix ? Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien. Th\u00e8me sombre. Duplication de sondage \u00e0 partir d'un autre. Limiter le nombre de participants maximum","title":"principales"},{"location":"angular/","text":"English: This page isn't translated to English. Angular All doc for Angular is available under https://www.angular.io Code scaffolding Run ng generate component component-choice_label to generate a new component. You can also use ng generate directive|pipe|service|class|guard|interface|enum|module . Build Run ng build to build the project. The build artifacts will be stored in the dist/ directory. Use the --prod flag for a production build. Running unit tests Run ng test to execute the unit tests via Karma . Running end-to-end tests Run ng e2e to execute the end-to-end tests via Protractor . Further help Before using ng for the first time in this project, use npm i to install needed npm modules. To get more help on the Angular CLI use ng help or go check out the Angular CLI README .","title":"Angular"},{"location":"angular/#angular","text":"All doc for Angular is available under https://www.angular.io","title":"Angular"},{"location":"angular/#code-scaffolding","text":"Run ng generate component component-choice_label to generate a new component. You can also use ng generate directive|pipe|service|class|guard|interface|enum|module .","title":"Code scaffolding"},{"location":"angular/#build","text":"Run ng build to build the project. The build artifacts will be stored in the dist/ directory. Use the --prod flag for a production build.","title":"Build"},{"location":"angular/#running-unit-tests","text":"Run ng test to execute the unit tests via Karma .","title":"Running unit tests"},{"location":"angular/#running-end-to-end-tests","text":"Run ng e2e to execute the end-to-end tests via Protractor .","title":"Running end-to-end tests"},{"location":"angular/#further-help","text":"Before using ng for the first time in this project, use npm i to install needed npm modules. To get more help on the Angular CLI use ng help or go check out the Angular CLI README .","title":"Further help"},{"location":"changelog/","text":"English: This page isn't translated to English. Change log 2021-05-17 Documentation g\u00e9n\u00e9r\u00e9e avec mkdocs","title":"Changelog"},{"location":"changelog/#change-log","text":"","title":"Change log"},{"location":"changelog/#2021-05-17","text":"Documentation g\u00e9n\u00e9r\u00e9e avec mkdocs","title":"2021-05-17"},{"location":"customisation/","text":"English: This page isn't translated to English. Personnalisation Vous pouvez modifier les variables d'environnement afin de modifier le logo et le titre de votre installation. Ce logiciel \u00e9tant libre et sous la licence GNU Affero V3 vous pouvez bien entendu le modifier \u00e0 volont\u00e9. Voici donc un guide concernant le titre et le logo. Modifiez le fichier src/environment.prod.ts , et remplacez le contenu des variables appTitle (un texte, pas forc\u00e9ment un seul mot) et appLogo (une URL absolue ou relative d'image) Et voil\u00e0! Quand vous builderez votre app, vous verrez ces valeurs dans la barre titre, incluses par le composant HeaderComponent automatiquement. Vous pouvez modifier les valeurs dans le fichier src/environment.ts pour voir ce que cela donne en environnement de d\u00e9veloppement en lancant l'app avec npm start ou yarn start . Customization Change the content of the file src/environment.prod.ts , and the content of the vars appTitle (any text) and appLogo (any picture URL, relative or absolute) . And voil\u00e0!","title":"Personnaliser"},{"location":"customisation/#personnalisation","text":"Vous pouvez modifier les variables d'environnement afin de modifier le logo et le titre de votre installation. Ce logiciel \u00e9tant libre et sous la licence GNU Affero V3 vous pouvez bien entendu le modifier \u00e0 volont\u00e9. Voici donc un guide concernant le titre et le logo. Modifiez le fichier src/environment.prod.ts , et remplacez le contenu des variables appTitle (un texte, pas forc\u00e9ment un seul mot) et appLogo (une URL absolue ou relative d'image) Et voil\u00e0! Quand vous builderez votre app, vous verrez ces valeurs dans la barre titre, incluses par le composant HeaderComponent automatiquement. Vous pouvez modifier les valeurs dans le fichier src/environment.ts pour voir ce que cela donne en environnement de d\u00e9veloppement en lancant l'app avec npm start ou yarn start .","title":"Personnalisation"},{"location":"customisation/#customization","text":"Change the content of the file src/environment.prod.ts , and the content of the vars appTitle (any text) and appLogo (any picture URL, relative or absolute) . And voil\u00e0!","title":"Customization"},{"location":"index.en/","text":"Fran\u00e7ais Framadate - funky version EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API.ntributeurs de l'association Framasoft, avec une API backend.","title":"Framadate - funky version"},{"location":"index.en/#framadate-funky-version","text":"EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API.ntributeurs de l'association Framasoft, avec une API backend.","title":"Framadate - funky version"},{"location":"index.fr/","text":"English Framadate - funky version FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend. Index Meeting notes Getting Started (yarn start / npm start) How to contribute Architecture Translation i18n Accesibility Licence GNU affero V3 Framadate - funky version FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend. EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API. Pour d\u00e9buter - getting started lire la doc pour d\u00e9buter votre Funky Framadate Documentation FR: Toute la documentation est disponible dans le dossier \"doc\" , principalement en Fran\u00e7ais. EN: All documentation is available in the \"doc\" folder, mainly in French because reasons. Version funky framadate Sp\u00e9cifications maquettes par @maiwann : https://scene.zeplin.io/project/5d4d83d68866d6522ff2ff10 vid\u00e9o de d\u00e9mo des maquettes par @maiwann : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7 discussions sur framateam canal g\u00e9n\u00e9ral : https://framateam.org/ux-framatrucs/channaels/framadate discussions techniques c\u00f4t\u00e9 d\u00e9veloppeurs : https://framateam.org/ux-framatrucs/channels/framadate-dev notes de r\u00e9union traductions Documentations sur Angular {- sur sass -} (on va utiliser CSS, si angular permet d'avoir des variables CSS, @newick) Exemple de maquette de la nouvelle version voir le sch\u00e9ma UML -- This project was generated with Angular CLI version 8.2.1. For full documentation on mkdocs visit mkdocs.org . notes-de-reunion) * traductions Documentations sur Angular {- sur sass -} (on va utiliser CSS, si angular permet d'avoir des variables CSS, @newick) Exemple de maquette de la nouvelle version This project was generated with Angular CLI version 8.2.1. For full documentation on mkdocs visit mkdocs.org .","title":"Framadate - funky version"},{"location":"index.fr/#framadate-funky-version","text":"FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend.","title":"Framadate - funky version"},{"location":"index.fr/#index","text":"Meeting notes Getting Started (yarn start / npm start) How to contribute Architecture Translation i18n Accesibility Licence GNU affero V3","title":"Index"},{"location":"index.fr/#framadate-funky-version_1","text":"FR: Un logiciel libre de sondage fait par les contributeurs de l'association Framasoft, avec une API backend. EN: A libre polling software made by contributors around the French association Framasoft. This version uses a brand new backend API.","title":"Framadate - funky version"},{"location":"index.fr/#pour-debuter-getting-started","text":"lire la doc pour d\u00e9buter votre Funky Framadate","title":"Pour d\u00e9buter - getting started"},{"location":"index.fr/#documentation","text":"FR: Toute la documentation est disponible dans le dossier \"doc\" , principalement en Fran\u00e7ais. EN: All documentation is available in the \"doc\" folder, mainly in French because reasons.","title":"Documentation"},{"location":"index.fr/#version-funky-framadate","text":"Sp\u00e9cifications maquettes par @maiwann : https://scene.zeplin.io/project/5d4d83d68866d6522ff2ff10 vid\u00e9o de d\u00e9mo des maquettes par @maiwann : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7 discussions sur framateam canal g\u00e9n\u00e9ral : https://framateam.org/ux-framatrucs/channaels/framadate discussions techniques c\u00f4t\u00e9 d\u00e9veloppeurs : https://framateam.org/ux-framatrucs/channels/framadate-dev notes de r\u00e9union traductions","title":"Version funky framadate"},{"location":"index.fr/#documentations-sur-angular","text":"{- sur sass -} (on va utiliser CSS, si angular permet d'avoir des variables CSS, @newick)","title":"Documentations sur Angular"},{"location":"index.fr/#exemple-de-maquette-de-la-nouvelle-version","text":"voir le sch\u00e9ma UML -- This project was generated with Angular CLI version 8.2.1. For full documentation on mkdocs visit mkdocs.org . notes-de-reunion) * traductions","title":"Exemple de maquette de la nouvelle version"},{"location":"index.fr/#documentations-sur-angular_1","text":"{- sur sass -} (on va utiliser CSS, si angular permet d'avoir des variables CSS, @newick)","title":"Documentations sur Angular"},{"location":"index.fr/#exemple-de-maquette-de-la-nouvelle-version_1","text":"This project was generated with Angular CLI version 8.2.1. For full documentation on mkdocs visit mkdocs.org .","title":"Exemple de maquette de la nouvelle version"},{"location":"libs/","text":"English: This page isn't translated to English. LIBRARIES USED status lib choice_label usage axios http client bulma CSS framework chart.js PrimeNG solution for graphs. (Chart.js installs MomentJS) compodoc Generate technic documentation ESlint, Prettier, Lint-staged Format & lint code fork-awesome Icons collection fullcalendar PrimeNG solution to manage & display calendars husky Hook actions on commit jest test engine json-server local server for mocking data backend removed locale-enum enum of all locales momentJS manipulate dates. (chartJS\u2019s dependency) to be installed ng2-charts Manipulate graphs along with chart.js ngx-clipboard Handle clipboard ngx-markdown markdown parser ngx-webstorage handle localStorage & webStorage primeNG UI components collection quill powerful rich text editor. WYSIWYG. to be installed short-uuid generate uuid removed storybook StyleGuide UI ts-mockito Mocks for testing. to be removed uuid generate uuid","title":"LIBRARIES USED"},{"location":"libs/#libraries-used","text":"status lib choice_label usage axios http client bulma CSS framework chart.js PrimeNG solution for graphs. (Chart.js installs MomentJS) compodoc Generate technic documentation ESlint, Prettier, Lint-staged Format & lint code fork-awesome Icons collection fullcalendar PrimeNG solution to manage & display calendars husky Hook actions on commit jest test engine json-server local server for mocking data backend removed locale-enum enum of all locales momentJS manipulate dates. (chartJS\u2019s dependency) to be installed ng2-charts Manipulate graphs along with chart.js ngx-clipboard Handle clipboard ngx-markdown markdown parser ngx-webstorage handle localStorage & webStorage primeNG UI components collection quill powerful rich text editor. WYSIWYG. to be installed short-uuid generate uuid removed storybook StyleGuide UI ts-mockito Mocks for testing. to be removed uuid generate uuid","title":"LIBRARIES USED"},{"location":"cadrage/accessibility/","text":"English: This page isn't translated to English. Accessibilit\u00e9 V\u00e9rifiez toujours que ce que vous d\u00e9veloppez est Accessible pour des personnes aux handicaps divers tels que le pr\u00e9conise le WECAG. https://www.w3.org/Translations/WCAG20-fr/ Quelques lignes \u00e0 v\u00e9rifier: * Couleurs contrast\u00e9es * ordre des liens coh\u00e9rent * textes des liens \u00e9loquents * textes alternatifs aux images les d\u00e9crivant * possibilit\u00e9 de changer la taille des textes et le th\u00e8me visuel * couleurs lisibles pour les personnes daltoniennes * raccourcis claviers. alt+t pour passer a un autre th\u00e8me visuel par exemple. * attributs aria pour les lecteurs d'\u00e9cran * performance de chargement pour les petits d\u00e9bits * server side rendering * pas d'\u00e9l\u00e9ments perdus en dehors de l'\u00e9cran, faites du mobile first * parcimonie: si un \u00e9l\u00e9ment n'est pas pr\u00e9vu pour \u00eatre montr\u00e9 sur petit \u00e9cran, ne le mettez pas sur grand \u00e9cran sous pr\u00e9texte qu'il y a plus de place. * less is more * syst\u00e8me de recherche basique N'ayez pas peur de demander de l'aide","title":"Accessibilit\u00e9"},{"location":"cadrage/accessibility/#accessibilite","text":"V\u00e9rifiez toujours que ce que vous d\u00e9veloppez est Accessible pour des personnes aux handicaps divers tels que le pr\u00e9conise le WECAG. https://www.w3.org/Translations/WCAG20-fr/ Quelques lignes \u00e0 v\u00e9rifier: * Couleurs contrast\u00e9es * ordre des liens coh\u00e9rent * textes des liens \u00e9loquents * textes alternatifs aux images les d\u00e9crivant * possibilit\u00e9 de changer la taille des textes et le th\u00e8me visuel * couleurs lisibles pour les personnes daltoniennes * raccourcis claviers. alt+t pour passer a un autre th\u00e8me visuel par exemple. * attributs aria pour les lecteurs d'\u00e9cran * performance de chargement pour les petits d\u00e9bits * server side rendering * pas d'\u00e9l\u00e9ments perdus en dehors de l'\u00e9cran, faites du mobile first * parcimonie: si un \u00e9l\u00e9ment n'est pas pr\u00e9vu pour \u00eatre montr\u00e9 sur petit \u00e9cran, ne le mettez pas sur grand \u00e9cran sous pr\u00e9texte qu'il y a plus de place. * less is more * syst\u00e8me de recherche basique N'ayez pas peur de demander de l'aide","title":"Accessibilit\u00e9"},{"location":"cadrage/architecture/","text":"English: This page isn't translated to English. Architecture de Framadate Documentation de r\u00e9f\u00e9rence dans le dossier \"doc\" de ce d\u00e9pot. Frontend g\u00e9n\u00e9r\u00e9 avec Angular CLI chaque commit sur ce d\u00e9pot passe les contr\u00f4les de format de Husky avant de pouvoir \u00eatre envoy\u00e9. Doc sur l'api du nouveau backend \u00e0 utiliser pour les appels REST du front funky : https://framagit.org/tykayn/date-poll-api/wikis/home toujours se r\u00e9f\u00e9rer \u00e0 la sortie de la commande de symfony bin/console debug:router du d\u00e9pot back. ancien backend en PHP sans framework ici pour m\u00e9moire : https://framagit.org/framasoft/framadate/framadate Sch\u00e9ma de base de donn\u00e9es du backend https://framagit.org/framasoft/framadate/funky-framadate-front/-/wikis/uploads/9d9a82cc6d7c6efea073b64d3667dc9b/framadate-api.png png cr\u00e9\u00e9 avec sqlfairy https://www.cipherbliss.com/exporter-une-visualisation-de-son-schma-sql/","title":"Architecture"},{"location":"cadrage/architecture/#architecture-de-framadate","text":"Documentation de r\u00e9f\u00e9rence dans le dossier \"doc\" de ce d\u00e9pot. Frontend g\u00e9n\u00e9r\u00e9 avec Angular CLI chaque commit sur ce d\u00e9pot passe les contr\u00f4les de format de Husky avant de pouvoir \u00eatre envoy\u00e9. Doc sur l'api du nouveau backend \u00e0 utiliser pour les appels REST du front funky : https://framagit.org/tykayn/date-poll-api/wikis/home toujours se r\u00e9f\u00e9rer \u00e0 la sortie de la commande de symfony bin/console debug:router du d\u00e9pot back. ancien backend en PHP sans framework ici pour m\u00e9moire : https://framagit.org/framasoft/framadate/framadate","title":"Architecture de Framadate"},{"location":"cadrage/architecture/#schema-de-base-de-donnees-du-backend","text":"https://framagit.org/framasoft/framadate/funky-framadate-front/-/wikis/uploads/9d9a82cc6d7c6efea073b64d3667dc9b/framadate-api.png png cr\u00e9\u00e9 avec sqlfairy https://www.cipherbliss.com/exporter-une-visualisation-de-son-schma-sql/","title":"Sch\u00e9ma de base de donn\u00e9es du backend"},{"location":"cadrage/i18n/","text":"English: This page isn't translated to English. Internationalisation - i18n Toutes les cha\u00eenes de texte doivent \u00eatre disponible en minimum deux langues: Fran\u00e7ais et Anglais. La documentation a \u00e9t\u00e9 pens\u00e9e pour \u00eatre compr\u00e9hensible en premier lieu par des personnes francophones, le projet \u00e9tant issu de Framasoft et de personnes uniquement Francophones, nous avons jug\u00e9 que c'\u00e9tait le moyen le plus efficace pour le faire grandir. Voir les fichiers src/assets/i18n EN.json et FR.json La traduction se base sur un syst\u00e8me de cl\u00e9s-valeur. Les cl\u00e9s sont entr\u00e9es dans les templates html, et c'est la config d'Angular qui les traduit selon la langue demand\u00e9e par le visiteur du site. Chaque fichier de traduction est d\u00e9clar\u00e9 dans le AppModule avec le module @ngx-translate. Examinez l'exemple pour rajouter votre propre traduction. Utilisez des sous groupes dans vos traductions afin de mieux segmenter les chaines de caract\u00e8re par page et selon le sens qu'elles sous tendent. Traduction de la documentation mkdocs voir ici https://www.mkdocs.org/user-guide/configuration/#lang","title":"Traduction"},{"location":"cadrage/i18n/#internationalisation-i18n","text":"Toutes les cha\u00eenes de texte doivent \u00eatre disponible en minimum deux langues: Fran\u00e7ais et Anglais. La documentation a \u00e9t\u00e9 pens\u00e9e pour \u00eatre compr\u00e9hensible en premier lieu par des personnes francophones, le projet \u00e9tant issu de Framasoft et de personnes uniquement Francophones, nous avons jug\u00e9 que c'\u00e9tait le moyen le plus efficace pour le faire grandir. Voir les fichiers src/assets/i18n EN.json et FR.json La traduction se base sur un syst\u00e8me de cl\u00e9s-valeur. Les cl\u00e9s sont entr\u00e9es dans les templates html, et c'est la config d'Angular qui les traduit selon la langue demand\u00e9e par le visiteur du site. Chaque fichier de traduction est d\u00e9clar\u00e9 dans le AppModule avec le module @ngx-translate. Examinez l'exemple pour rajouter votre propre traduction. Utilisez des sous groupes dans vos traductions afin de mieux segmenter les chaines de caract\u00e8re par page et selon le sens qu'elles sous tendent.","title":"Internationalisation - i18n"},{"location":"cadrage/i18n/#traduction-de-la-documentation-mkdocs","text":"voir ici https://www.mkdocs.org/user-guide/configuration/#lang","title":"Traduction de la documentation mkdocs"},{"location":"cadrage/specifications-fonctionnelles/","text":"English: This page isn't translated to English. Sp\u00e9cifications fonctionnelles de Framadate [[ TOC ]] Glossaire Terme Signification Cr\u00e9ateur Personne ayant cr\u00e9\u00e9 le sondage Participant Personne invit\u00e9e \u00e0 participer ou ayant particip\u00e9 Archivage Emp\u00eacher votes et commentaires mais conserver les r\u00e9sultats Slug Partie le l'URL identifiant un sondage de mani\u00e8re unique Fonctionnalit\u00e9s actuellement dans framadate legacy et \u00e0 conserver G\u00e9n\u00e9ralit\u00e9s Il existe deux types de sondage. Le type \u00ab\u202fdates\u202f\u00bb est adapt\u00e9 \u00e0 la proposition de dates (voir \u00a7plages horaires ) et le type \u00ab\u202ftexte\u202f\u00bb, plus g\u00e9n\u00e9raliste, ne contient que du texte. Ce choix est l'un des premiers choix effectu\u00e9s lors de la cr\u00e9ation d'un nouveau sondage. Deux types d'acteurs sont distingu\u00e9s : la personne ayant cr\u00e9\u00e9 le sondage et les personnes qui r\u00e9pondent au sondage. Ces deux types d'acteurs n'ont pas les m\u00eames droits sur le sondage : la personne ayant cr\u00e9\u00e9 le sondage est la seule ayant des droits d'administration sur celui-ci, en plus des droits des participants. En particulier, les droits d'administration permettent d'ajuster les droits des participants. Cr\u00e9ation d'un sondage Il est n\u00e9cessaire de fournir un email lors de la cr\u00e9ation du sondage. Cela permet aux cr\u00e9ateurs de sondages de pouvoir obtenir via email la liste des sondages qu'ils ont cr\u00e9\u00e9s. Il est possible de choisir le slug dans l'URL du sondage, \u00e0 condition que ce slug soit disponible. Le sondage reste modifiable apr\u00e8s sa cr\u00e9ation. Plages horaires Les sondages de type \u00ab\u202fdates\u202f\u00bb permettent de proposer des jours et des plages horaires pour chaque journ\u00e9e. Pour faciliter la saisie des dates propos\u00e9es, il est demand\u00e9 si les plages horaires sont les m\u00eames chaque jour ou si elles sont diff\u00e9rentes selon les jours. Dans le premier cas, les plages horaires sont demand\u00e9es uniquement pour le premier jour et sont automatiquement reproduites sur les autres jours. Toujours pour faciliter la saisie des propositions, il est possible d'ajouter plusieurs jours cons\u00e9cutifs en s\u00e9lectionnant le premier et le dernier jour plut\u00f4t qu'en s\u00e9lectionnant chaque jour un \u00e0 un. Participation \u00e0 un sondage Votes Les participants n'ont pas besoin de cr\u00e9er un compte ou de fournir leur email pour participer \u00e0 un sondage. Le cr\u00e9ateur du sondage peut prot\u00e9ger le sondage par un mot de passe. Sans ce mot de passe, il est impossible de voir le sondage, donc impossible d'y voter. Attention cependant, le sondage est stock\u00e9 en clair dans la base de donn\u00e9es et ne b\u00e9n\u00e9ficie donc d'aucun chiffrement. # Le mot de passe, lui, est-il chiffr\u00e9\u202f? Le cr\u00e9ateur du sondage choisit de permettre ou non les modifications des votes sur le sondage. Il a le choix entre les trois formules suivantes : ne pas permettre de modifier de r\u00e9ponse\u202f; permettre de modifier uniquement sa propre r\u00e9ponse a un sondage (modalit\u00e9s d'identification encore non d\u00e9termin\u00e9es)\u202f; permettre de modifier toute r\u00e9ponse \u00e0 un sondage (y compris celles des autres). Commentaires Les participants au sondage ont la possibilit\u00e9 de cr\u00e9er des commentaires sur le sondage. Seule la personne ayant les droits d'administration sur le sondage peut modifier les commentaires. R\u00e9sultats Selon la configuration du sondage, les r\u00e9sultats peuvent n'\u00eatre accessibles qu'\u00e0 la personne ayant un acc\u00e8s d'administration ou bien \u00eatre publics. Les personnes pouvant acc\u00e9der aux r\u00e9sultats du sondage peuvent exporter ces r\u00e9sultats au format CSV. Emails Lorsqu'une personne cr\u00e9e un sondage, un email reprenant les informations du sondage ainsi que les URL uniques servant \u00e0 le modifier (lien d'administration) et \u00e0 y participer (lien \u00e0 transmettre aux participants) lui est envoy\u00e9. De plus, elle peut choisir de recevoir des emails lors d'un nouveau vote ou commentaire sur le sondage. Une personne ayant cr\u00e9\u00e9 au moins un sondage peut demander \u00e0 recevoir par email la liste des sondages qu'elle a cr\u00e9\u00e9s en utilisant cette adresse email. Stockage et export de donn\u00e9es Les donn\u00e9es sont stock\u00e9es en clair sur le serveur. L'archivage (resp. suppression) automatique des sondages est effectu\u00e9 via cronjob 90 (resp. 120) jours apr\u00e8s sa cr\u00e9ation. Il est possible pour l'administrateur d'un sondage de modifier la dur\u00e9e avant archivage et la suppression automatique suit toujours de 30 jours la date d'archivage. L'export d'un sondage et des r\u00e9sultats d'un sondage est possible au format CSV. Nouveaut\u00e9s principales Accessibilit\u00e9 renforc\u00e9e. Traduction dynamique de toutes les phrases en choisissant la langue dans le menu. Adapt\u00e9 aussi bien sur mobile que grands \u00e9crans \u00e0 haute ou faible densit\u00e9 de pixels. Anti-spam de commentaires. Anti-spam de vote. Tests unitaires et end-to-end. Couverture de test. Nouveaut\u00e9s secondaires Choix de r\u00e9ponses possibles. Proposer de ne r\u00e9pondre que \u00ab\u202foui\u202f\u00bb ou rien, ou aller dans la nuance en proposant \u00ab\u202foui\u202f\u00bb, \u00ab\u202fpeut-\u00eatre\u202f\u00bb, \u00ab\u202fnon\u202f\u00bb, \u00ab\u202f?\u202f\u00bb. # Redondance ou le choix de r\u00e9ponses possibles de la premi\u00e8re phrase concerne un autre choix\u202f? Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien. Th\u00e8me sombre. Boutons pour copier dans le presse-papier les liens publics et priv\u00e9s / admin des sondages. Limiter le nombre de participants maximum Id\u00e9es pour de futures am\u00e9liorations (pertinence \u00e0 v\u00e9rifier) Gagner en vie priv\u00e9e en chiffrant certaines informations\u202f? \u00c0 r\u00e9fl\u00e9chir : permettre \u00e0 Framadate de faire entrer \u00e0 des gens plusieurs plages de temps de disponibilit\u00e9 et le service d\u00e9duit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait \u00eatre avec divers niveaux de d\u00e9tail. Comme https://omnipointment.com/ (qui est un logiciel privateur) SSO du f\u00e9diverse\u202f?","title":"Sp\u00e9cifications"},{"location":"cadrage/specifications-fonctionnelles/#specifications-fonctionnelles-de-framadate","text":"[[ TOC ]]","title":"Sp\u00e9cifications fonctionnelles de Framadate"},{"location":"cadrage/specifications-fonctionnelles/#glossaire","text":"Terme Signification Cr\u00e9ateur Personne ayant cr\u00e9\u00e9 le sondage Participant Personne invit\u00e9e \u00e0 participer ou ayant particip\u00e9 Archivage Emp\u00eacher votes et commentaires mais conserver les r\u00e9sultats Slug Partie le l'URL identifiant un sondage de mani\u00e8re unique","title":"Glossaire"},{"location":"cadrage/specifications-fonctionnelles/#fonctionnalites-actuellement-dans-framadate-legacy-et-a-conserver","text":"","title":"Fonctionnalit\u00e9s actuellement dans framadate legacy et \u00e0 conserver"},{"location":"cadrage/specifications-fonctionnelles/#generalites","text":"Il existe deux types de sondage. Le type \u00ab\u202fdates\u202f\u00bb est adapt\u00e9 \u00e0 la proposition de dates (voir \u00a7plages horaires ) et le type \u00ab\u202ftexte\u202f\u00bb, plus g\u00e9n\u00e9raliste, ne contient que du texte. Ce choix est l'un des premiers choix effectu\u00e9s lors de la cr\u00e9ation d'un nouveau sondage. Deux types d'acteurs sont distingu\u00e9s : la personne ayant cr\u00e9\u00e9 le sondage et les personnes qui r\u00e9pondent au sondage. Ces deux types d'acteurs n'ont pas les m\u00eames droits sur le sondage : la personne ayant cr\u00e9\u00e9 le sondage est la seule ayant des droits d'administration sur celui-ci, en plus des droits des participants. En particulier, les droits d'administration permettent d'ajuster les droits des participants.","title":"G\u00e9n\u00e9ralit\u00e9s"},{"location":"cadrage/specifications-fonctionnelles/#creation-dun-sondage","text":"Il est n\u00e9cessaire de fournir un email lors de la cr\u00e9ation du sondage. Cela permet aux cr\u00e9ateurs de sondages de pouvoir obtenir via email la liste des sondages qu'ils ont cr\u00e9\u00e9s. Il est possible de choisir le slug dans l'URL du sondage, \u00e0 condition que ce slug soit disponible. Le sondage reste modifiable apr\u00e8s sa cr\u00e9ation.","title":"Cr\u00e9ation d'un sondage"},{"location":"cadrage/specifications-fonctionnelles/#plages-horaires","text":"Les sondages de type \u00ab\u202fdates\u202f\u00bb permettent de proposer des jours et des plages horaires pour chaque journ\u00e9e. Pour faciliter la saisie des dates propos\u00e9es, il est demand\u00e9 si les plages horaires sont les m\u00eames chaque jour ou si elles sont diff\u00e9rentes selon les jours. Dans le premier cas, les plages horaires sont demand\u00e9es uniquement pour le premier jour et sont automatiquement reproduites sur les autres jours. Toujours pour faciliter la saisie des propositions, il est possible d'ajouter plusieurs jours cons\u00e9cutifs en s\u00e9lectionnant le premier et le dernier jour plut\u00f4t qu'en s\u00e9lectionnant chaque jour un \u00e0 un.","title":"Plages horaires"},{"location":"cadrage/specifications-fonctionnelles/#participation-a-un-sondage","text":"","title":"Participation \u00e0 un sondage"},{"location":"cadrage/specifications-fonctionnelles/#votes","text":"Les participants n'ont pas besoin de cr\u00e9er un compte ou de fournir leur email pour participer \u00e0 un sondage. Le cr\u00e9ateur du sondage peut prot\u00e9ger le sondage par un mot de passe. Sans ce mot de passe, il est impossible de voir le sondage, donc impossible d'y voter. Attention cependant, le sondage est stock\u00e9 en clair dans la base de donn\u00e9es et ne b\u00e9n\u00e9ficie donc d'aucun chiffrement. # Le mot de passe, lui, est-il chiffr\u00e9\u202f? Le cr\u00e9ateur du sondage choisit de permettre ou non les modifications des votes sur le sondage. Il a le choix entre les trois formules suivantes : ne pas permettre de modifier de r\u00e9ponse\u202f; permettre de modifier uniquement sa propre r\u00e9ponse a un sondage (modalit\u00e9s d'identification encore non d\u00e9termin\u00e9es)\u202f; permettre de modifier toute r\u00e9ponse \u00e0 un sondage (y compris celles des autres).","title":"Votes"},{"location":"cadrage/specifications-fonctionnelles/#commentaires","text":"Les participants au sondage ont la possibilit\u00e9 de cr\u00e9er des commentaires sur le sondage. Seule la personne ayant les droits d'administration sur le sondage peut modifier les commentaires.","title":"Commentaires"},{"location":"cadrage/specifications-fonctionnelles/#resultats","text":"Selon la configuration du sondage, les r\u00e9sultats peuvent n'\u00eatre accessibles qu'\u00e0 la personne ayant un acc\u00e8s d'administration ou bien \u00eatre publics. Les personnes pouvant acc\u00e9der aux r\u00e9sultats du sondage peuvent exporter ces r\u00e9sultats au format CSV.","title":"R\u00e9sultats"},{"location":"cadrage/specifications-fonctionnelles/#emails","text":"Lorsqu'une personne cr\u00e9e un sondage, un email reprenant les informations du sondage ainsi que les URL uniques servant \u00e0 le modifier (lien d'administration) et \u00e0 y participer (lien \u00e0 transmettre aux participants) lui est envoy\u00e9. De plus, elle peut choisir de recevoir des emails lors d'un nouveau vote ou commentaire sur le sondage. Une personne ayant cr\u00e9\u00e9 au moins un sondage peut demander \u00e0 recevoir par email la liste des sondages qu'elle a cr\u00e9\u00e9s en utilisant cette adresse email.","title":"Emails"},{"location":"cadrage/specifications-fonctionnelles/#stockage-et-export-de-donnees","text":"Les donn\u00e9es sont stock\u00e9es en clair sur le serveur. L'archivage (resp. suppression) automatique des sondages est effectu\u00e9 via cronjob 90 (resp. 120) jours apr\u00e8s sa cr\u00e9ation. Il est possible pour l'administrateur d'un sondage de modifier la dur\u00e9e avant archivage et la suppression automatique suit toujours de 30 jours la date d'archivage. L'export d'un sondage et des r\u00e9sultats d'un sondage est possible au format CSV.","title":"Stockage et export de donn\u00e9es"},{"location":"cadrage/specifications-fonctionnelles/#nouveautes-principales","text":"Accessibilit\u00e9 renforc\u00e9e. Traduction dynamique de toutes les phrases en choisissant la langue dans le menu. Adapt\u00e9 aussi bien sur mobile que grands \u00e9crans \u00e0 haute ou faible densit\u00e9 de pixels. Anti-spam de commentaires. Anti-spam de vote. Tests unitaires et end-to-end. Couverture de test.","title":"Nouveaut\u00e9s principales"},{"location":"cadrage/specifications-fonctionnelles/#nouveautes-secondaires","text":"Choix de r\u00e9ponses possibles. Proposer de ne r\u00e9pondre que \u00ab\u202foui\u202f\u00bb ou rien, ou aller dans la nuance en proposant \u00ab\u202foui\u202f\u00bb, \u00ab\u202fpeut-\u00eatre\u202f\u00bb, \u00ab\u202fnon\u202f\u00bb, \u00ab\u202f?\u202f\u00bb. # Redondance ou le choix de r\u00e9ponses possibles de la premi\u00e8re phrase concerne un autre choix\u202f? Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien. Th\u00e8me sombre. Boutons pour copier dans le presse-papier les liens publics et priv\u00e9s / admin des sondages. Limiter le nombre de participants maximum","title":"Nouveaut\u00e9s secondaires"},{"location":"cadrage/specifications-fonctionnelles/#idees-pour-de-futures-ameliorations-pertinence-a-verifier","text":"Gagner en vie priv\u00e9e en chiffrant certaines informations\u202f? \u00c0 r\u00e9fl\u00e9chir : permettre \u00e0 Framadate de faire entrer \u00e0 des gens plusieurs plages de temps de disponibilit\u00e9 et le service d\u00e9duit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait \u00eatre avec divers niveaux de d\u00e9tail. Comme https://omnipointment.com/ (qui est un logiciel privateur) SSO du f\u00e9diverse\u202f?","title":"Id\u00e9es pour de futures am\u00e9liorations (pertinence \u00e0 v\u00e9rifier)"},{"location":"dev-guide/CONTRIBUTE/","text":"English: This page isn't translated to English. Comment contribuer \u00e0 Framadate funky ? Il existe des tas de fa\u00e7ons de contribuer \u00e0 un logiciel libre comme Framadate. Vous pouvez discuter avec d'autres personnes de ce que vous souhaiteriez voir na\u00eetre dans le logiciel, essayer de l'utiliser dans sa version exp\u00e9rimentale, mettre en place une d\u00e9mo ou un service publiquement utilisable, \u00e9crire des modifications de code, proposer de l'aide de toute sorte, traduire les textes , v\u00e9rifier l'accessibilit\u00e9, lire la documentation d'architecture etc... Avoir un compte Framateam, et Framagit si vous souhaitez contribuer au code Examiner les tickets Discuter avec les autres membres participant, sur un ticket en particulier et aussi dans les canaux de framateam Nous avons cr\u00e9\u00e9 deux canaux: un pour les discussions g\u00e9n\u00e9rales, et un autre pour les discussions techniques de dev. Prenez soin de bien cibler le canal dans lequel vous communiquez afin de ne pas faire peur aux gens qui ne codent pas et qui souhaitent contribuer de toutes les autres fa\u00e7ons. Une fois d'accord avec les autres, mettre \u00e0 jour votre d\u00e9pot de travail local. Voir la doc d'installation / getting started \u00e0 ce sujet. Utiliser la branche develop git checkout develop git fetch choisir un ticket gitlab consacr\u00e9 \u00e0 votre branche, si il n'en existe pas, le cr\u00e9er. Un ticket doit avoir un sujet suffisament petit pour pouvoir le r\u00e9aliser dans un temps raisonnable. Faites des sous-tickets reli\u00e9s pour les longues fonctionnalit\u00e9s. Le but des tickets n'\u00e9tant pas de rester ad vitam dans la backlog, mais bien de montrer un avancement d\u00e9taill\u00e9, avec un titre \u00e9vocateur. \"exit donc les tickets du genre '\u00e7a ne marche pas' ou 'finir framadate'\" Faire une branche d\u00e9di\u00e9e \u00e0 vos modifications en lui mettant un nom \u00e9loquent. git checkout -b ma-description-de-fonctionnalite lisez les logs des commits les plus r\u00e9cents pour comprendre ce qui se passe. Faites des petits commits, avec un titre d\u00e9signant pr\u00e9cis\u00e9ment ce sur quoi vous progressez. Faire une merge request sur framagit qui sera soumise \u00e0 la revue de code par les pairs du projet. Continuer \u00e0 interagir avec les autres membres pour utiliser au mieux les savoir-faire de chacun et ne pas se marcher sur les pieds. Mettez toujours en avant la politesse et l'empathie, la collaboration n'en sera que meilleure. N'h\u00e9sitez pas \u00e0 contacter en direct les personnes avec lesquelles vous souhaitez avancer. Qui veut faire quoi ? maiwann : maquettes, UX tykayn : d\u00e9veloppeur front end, JS & styles newick : int\u00e9grateur dans la vraie vie llaq : plut\u00f4t HTML / css et un peu de d\u00e9veloppement en php talone : plut\u00f4t cot\u00e9 JS tcit : dev tout qui connait bien le backend de Framadate actuel pouhiou : soutien moral come_744 : git, d\u00e9couverte d'angular arnaldo : php, d\u00e9couverte du libre elbuffeto : l'int\u00e9gration HTML/CSS, accessibilit\u00e9 l4pin : un peu de front JS, beaucoup de back wadouk : dev compil\u00e9 (elm, haskell, scala) cbossard : dev (plut\u00f4t backend), java/javascript, avec un peu de temps en ce moment seraf : dev fullstack (plut\u00f4t front), JS (Angular, VueJS, Svelte), PHP (Symfony, ApiPlatform), Java (Spring) Liens utiles: Discussion : https://framateam.org/ux-framatrucs/channels/framadate Repo front/dev : https://framagit.org/framasoft/framadate/funky-framadate-front/tree/dev Repo back : https://framagit.org/framasoft/framadate/framadate Maquettes Zeplin : demander l'acc\u00e8s \u00e0 maiwann La d\u00e9mo : https://framadate-api.cipherbliss.com/ Vid\u00e9o de pr\u00e9sentation au lancement de la refonte : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7","title":"Contribuer"},{"location":"dev-guide/CONTRIBUTE/#comment-contribuer-a-framadate-funky","text":"Il existe des tas de fa\u00e7ons de contribuer \u00e0 un logiciel libre comme Framadate. Vous pouvez discuter avec d'autres personnes de ce que vous souhaiteriez voir na\u00eetre dans le logiciel, essayer de l'utiliser dans sa version exp\u00e9rimentale, mettre en place une d\u00e9mo ou un service publiquement utilisable, \u00e9crire des modifications de code, proposer de l'aide de toute sorte, traduire les textes , v\u00e9rifier l'accessibilit\u00e9, lire la documentation d'architecture etc... Avoir un compte Framateam, et Framagit si vous souhaitez contribuer au code Examiner les tickets Discuter avec les autres membres participant, sur un ticket en particulier et aussi dans les canaux de framateam Nous avons cr\u00e9\u00e9 deux canaux: un pour les discussions g\u00e9n\u00e9rales, et un autre pour les discussions techniques de dev. Prenez soin de bien cibler le canal dans lequel vous communiquez afin de ne pas faire peur aux gens qui ne codent pas et qui souhaitent contribuer de toutes les autres fa\u00e7ons. Une fois d'accord avec les autres, mettre \u00e0 jour votre d\u00e9pot de travail local. Voir la doc d'installation / getting started \u00e0 ce sujet. Utiliser la branche develop git checkout develop git fetch choisir un ticket gitlab consacr\u00e9 \u00e0 votre branche, si il n'en existe pas, le cr\u00e9er. Un ticket doit avoir un sujet suffisament petit pour pouvoir le r\u00e9aliser dans un temps raisonnable. Faites des sous-tickets reli\u00e9s pour les longues fonctionnalit\u00e9s. Le but des tickets n'\u00e9tant pas de rester ad vitam dans la backlog, mais bien de montrer un avancement d\u00e9taill\u00e9, avec un titre \u00e9vocateur. \"exit donc les tickets du genre '\u00e7a ne marche pas' ou 'finir framadate'\" Faire une branche d\u00e9di\u00e9e \u00e0 vos modifications en lui mettant un nom \u00e9loquent. git checkout -b ma-description-de-fonctionnalite lisez les logs des commits les plus r\u00e9cents pour comprendre ce qui se passe. Faites des petits commits, avec un titre d\u00e9signant pr\u00e9cis\u00e9ment ce sur quoi vous progressez. Faire une merge request sur framagit qui sera soumise \u00e0 la revue de code par les pairs du projet. Continuer \u00e0 interagir avec les autres membres pour utiliser au mieux les savoir-faire de chacun et ne pas se marcher sur les pieds. Mettez toujours en avant la politesse et l'empathie, la collaboration n'en sera que meilleure. N'h\u00e9sitez pas \u00e0 contacter en direct les personnes avec lesquelles vous souhaitez avancer.","title":"Comment contribuer \u00e0 Framadate funky ?"},{"location":"dev-guide/CONTRIBUTE/#qui-veut-faire-quoi","text":"maiwann : maquettes, UX tykayn : d\u00e9veloppeur front end, JS & styles newick : int\u00e9grateur dans la vraie vie llaq : plut\u00f4t HTML / css et un peu de d\u00e9veloppement en php talone : plut\u00f4t cot\u00e9 JS tcit : dev tout qui connait bien le backend de Framadate actuel pouhiou : soutien moral come_744 : git, d\u00e9couverte d'angular arnaldo : php, d\u00e9couverte du libre elbuffeto : l'int\u00e9gration HTML/CSS, accessibilit\u00e9 l4pin : un peu de front JS, beaucoup de back wadouk : dev compil\u00e9 (elm, haskell, scala) cbossard : dev (plut\u00f4t backend), java/javascript, avec un peu de temps en ce moment seraf : dev fullstack (plut\u00f4t front), JS (Angular, VueJS, Svelte), PHP (Symfony, ApiPlatform), Java (Spring)","title":"Qui veut faire quoi ?"},{"location":"dev-guide/CONTRIBUTE/#liens-utiles","text":"Discussion : https://framateam.org/ux-framatrucs/channels/framadate Repo front/dev : https://framagit.org/framasoft/framadate/funky-framadate-front/tree/dev Repo back : https://framagit.org/framasoft/framadate/framadate Maquettes Zeplin : demander l'acc\u00e8s \u00e0 maiwann La d\u00e9mo : https://framadate-api.cipherbliss.com/ Vid\u00e9o de pr\u00e9sentation au lancement de la refonte : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7","title":"Liens utiles:"},{"location":"dev-guide/Issue_template/","text":"English: This page isn't translated to English. R\u00e9sum\u00e9 (Summarize the bug encountered concisely) Steps to reproduce (How one can reproduce the issue - this is very important) Example Project (If possible, please create an example project here on GitLab.com that exhibits the problematic behavior, and link to it here in the bug report. If you are using an older version of GitLab, this will also determine whether the bug has been fixed in a more recent version) What is the current bug behavior? (What actually happens) What is the expected correct behavior? (What you should see instead) Relevant logs and/or screenshots (Paste any relevant logs - please use code blocks (```) to format console output, logs, and code, as it's very hard to read otherwise.) Possible fixes (If you can, link to the line of code that might be responsible for the problem) /label ~bug ~reproduced ~needs-investigation /cc @project-manager /assign @qa-tester","title":"Issue template"},{"location":"dev-guide/Issue_template/#resume","text":"(Summarize the bug encountered concisely)","title":"R\u00e9sum\u00e9"},{"location":"dev-guide/Issue_template/#steps-to-reproduce","text":"(How one can reproduce the issue - this is very important)","title":"Steps to reproduce"},{"location":"dev-guide/Issue_template/#example-project","text":"(If possible, please create an example project here on GitLab.com that exhibits the problematic behavior, and link to it here in the bug report. If you are using an older version of GitLab, this will also determine whether the bug has been fixed in a more recent version)","title":"Example Project"},{"location":"dev-guide/Issue_template/#what-is-the-current-bug-behavior","text":"(What actually happens)","title":"What is the current bug behavior?"},{"location":"dev-guide/Issue_template/#what-is-the-expected-correct-behavior","text":"(What you should see instead)","title":"What is the expected correct behavior?"},{"location":"dev-guide/Issue_template/#relevant-logs-andor-screenshots","text":"(Paste any relevant logs - please use code blocks (```) to format console output, logs, and code, as it's very hard to read otherwise.)","title":"Relevant logs and/or screenshots"},{"location":"dev-guide/Issue_template/#possible-fixes","text":"(If you can, link to the line of code that might be responsible for the problem) /label ~bug ~reproduced ~needs-investigation /cc @project-manager /assign @qa-tester","title":"Possible fixes"},{"location":"reunions/0_blank_notes/","text":"English: This page isn't translated to English. Framadate suivi - ( date de r\u00e9union ) tags: #framadate, #suivi Participants \u00e0 la r\u00e9union: * * * \u00c9tat des lieux > O\u00f9 on en est https://framagit.org/framasoft/framadate/funky-framadate-front/-/boards Quel est le projet ? Quels sont les enjeux ? Quelles m\u00e9thodes de travail ? Quel niveau de qualit\u00e9 ? standards et de bonnes pratiques ? * Quelles priorit\u00e9s ? * Qui veut faire quoi ? * Notes de r\u00e9union Trucs \u00e0 faire D\u00e9cisions prises Ressources Discussion : https://framateam.org/ux-framatrucs/channels/framadate Repo front/dev : https://framagit.org/framasoft/framadate/funky-framadate-front/tree/dev Repo back : https://framagit.org/framasoft/framadate/framadate Maquettes Zeplin : demander l'acc\u00e8s \u00e0 maiwann La d\u00e9mo : https://framadate-api.cipherbliss.com/ Vid\u00e9o de pr\u00e9sentation : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7","title":"Mod\u00e8le vierge"},{"location":"reunions/0_blank_notes/#framadate-suivi-date-de-reunion","text":"","title":"Framadate suivi - (date de r\u00e9union)"},{"location":"reunions/0_blank_notes/#tags-framadate-suivi","text":"Participants \u00e0 la r\u00e9union: * * *","title":"tags: #framadate, #suivi"},{"location":"reunions/0_blank_notes/#etat-des-lieux","text":"","title":"\u00c9tat des lieux"},{"location":"reunions/0_blank_notes/#ou-on-en-est","text":"https://framagit.org/framasoft/framadate/funky-framadate-front/-/boards Quel est le projet ? Quels sont les enjeux ? Quelles m\u00e9thodes de travail ? Quel niveau de qualit\u00e9 ? standards et de bonnes pratiques ? * Quelles priorit\u00e9s ? * Qui veut faire quoi ? *","title":"> O\u00f9 on en est"},{"location":"reunions/0_blank_notes/#notes-de-reunion","text":"","title":"Notes de r\u00e9union"},{"location":"reunions/0_blank_notes/#trucs-a-faire","text":"","title":"Trucs \u00e0 faire"},{"location":"reunions/0_blank_notes/#decisions-prises","text":"","title":"D\u00e9cisions prises"},{"location":"reunions/0_blank_notes/#ressources","text":"Discussion : https://framateam.org/ux-framatrucs/channels/framadate Repo front/dev : https://framagit.org/framasoft/framadate/funky-framadate-front/tree/dev Repo back : https://framagit.org/framasoft/framadate/framadate Maquettes Zeplin : demander l'acc\u00e8s \u00e0 maiwann La d\u00e9mo : https://framadate-api.cipherbliss.com/ Vid\u00e9o de pr\u00e9sentation : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7","title":"Ressources"},{"location":"reunions/2019_08_09/","text":"English: This page isn't translated to English. notes du 9/8/2019 avec Mumble \u00c0 discuter : discussion via framatalk ? plut\u00f4t mumble ! Se connecter \u00e0 mumble.tcit.fr. Il n'a pas de mot de passe et il y a un salon Framadate ouvert. qui peut/veut faire quoi ? tykayn: dev front end, JS & styles newick : int\u00e9grateur dans la vraie vie llaq : plut\u00f4t HTML talone : plut\u00f4t cot\u00e9 JS on ne s'occupe toujours que du front ? [newick] Est-ce que tout le monde est ok sur le fait de faire que le front et pas tout ? llaq : pas de souci avec le back, donc pourquoi le changer ? Ok on y touche pas repartir de 0 ? Je parle de funky framadate llaq : Pourquoi pas recommencer car c'est bien diff\u00e9rent des maquettes newick : On est toujours en mode \"MVP\", on fait \u00e7a pour tester les maquettes et ensuite seulement on le connecte au back-end ? maiwann : Ouip tant que \u00e7a reste coh\u00e9rent niveau exp\u00e9rience de l'utilisateur newick : C'est plutot cot\u00e9 JS qu'il faut voir\u2026 talone ? Talone : on peut faire des choses, je maitrise pas php llaq : moi non plus talone : il y a des contributeurices de framadate ici ? maiwann : nope :x newick : on peut avancer comme \u00e7a, surtout sur le front et ensuite on verra le back ? talone & llaq : oui on peut faire \u00e7a [tentative de tykayn de nous rejoindre] pourquoi y'a des pages php dans le dossier front end ? newick : C'est dans le dossier principal, pas dans funky maiwann : donc a priori rien d'obligatoire ? API de backend existe t elle? llaq : nope ^_^ Sass, css, autre ? https://css2sass.herokuapp.com/ pour convertir le css actuel vers du sass int\u00e9r\u00eat de Bootstrap / frameworks ? Angular cli pour se concentrer sur des composants front end Boostrap a priori c'est pas forc\u00e9ment n\u00e9cessaire, newick assez \u00e0 l'aise pour ne pas en avoir besoin dans HTML / CSS Composants <3 Atomic design <3 tykayn : propose de faire une d\u00e9mo (Beaucoup de discussion sur les framework front, j'ai pas tout compris ce qu'il se passait donc mes notes sont tr\u00e8s limit\u00e9es !) En gros, on fait du Angular et chacun int\u00e8gre son truc ind\u00e9pendamment Invitation sur funkyframadate, on repart de 0 ! La suite remplissons le wiki et les board d'issues on zieute la d\u00e9mo et on voit ce qu'on fait ensuite Questions not\u00e9es par Come. Suite au visionnage de la vid\u00e9o de pr\u00e9sentation de maiwann (Framadate_Presentation_maquettes.flv), des questions ont \u00e9t\u00e9 lev\u00e9es : Quel est l'int\u00e9r\u00eat de diff\u00e9rentier les dates limites de modification et vote\u202f? Pourquoi appelle-t-on cela archivage\u202f? Peut-on \u00e9crire plus explicitement que le nom du cr\u00e9ateur, s'il est renseign\u00e9, est affich\u00e9 \u00e0 ceux qui r\u00e9pondent\u202f? Lors de la validation du vote, peut-on mettre davantage en avant l'importance de l'URL d'\u00e9dition afin d'\u00e9viter la fermeture machinale (par r\u00e9flexe) du popup\u202f? Pour la vue des r\u00e9ponses, pourquoi ne pas mettre pour tous les utilisateurs les petites ic\u00f4nes actuellement r\u00e9serv\u00e9es aux daltoniens\u202f? On \u00e9conomiserait alors un champ. Quitte \u00e0 faire la chasse aux clics, pour les menus d\u00e9roulants \u00e0 deux options (du type \u00ab\u202fje veux\u202f\u00bb / \u00ab\u202fje ne veux pas\u202f\u00bb) qui n\u00e9cessitent deux clics pour commuter, pourquoi pas une commutation en un clic\u202f; comme une check-box mais avec du texte \u00e0 la place du check\u202f? Bien-s\u00fbr, ceci \u00e0 condition que les champs conditionnels ne soient pas vid\u00e9s lorsqu'ils disparaissent. Y a-t-il des champs obligatoires\u202f? Si oui, comment les mat\u00e9rialiser\u202f? En cas d'erreur \u00e0 la validation du formulaire (pour cause de champ vide ou format incorrect par exemple), on affiche syst\u00e9matiquement le message d'erreur en orange (cf. \u00e9cran sondage_date_intervalle) en dessous du champ concern\u00e9\u202f? Quel est l'\u00e9tat de focus sur les champs\u202f? Celui par d\u00e9faut du navigateur\u202f? \u00c9tant donn\u00e9 qu'il y a plusieurs \u00e9tapes dans la cr\u00e9ation du sondage, ne faudrait-il pas les indiquer au d\u00e9but de la page\u202f? Ex : 1/3, 2/3, 3/3 (je tire \u00e7a des bonnes pratiques opquast) Dans le r\u00e9capitulatif \u00e0 la fin, pourquoi ne rappelle-t-on pas \u00e9galement le titre et la description du sondage cr\u00e9\u00e9\u202f? Les boutons\u202f: Quel est l'\u00e9tat de focus sur les boutons\u202f? Sur l'\u00e9cran \u00ab\u202fMot de passe\u202f\u00bb, le bouton \u00ab\u202fVoir\u202f\u00bb est-il imm\u00e9diatement actif ou on attend d'avoir tap\u00e9 la premi\u00e8re lettre\u202f? Une fois qu'on a cliqu\u00e9 sur \u00ab\u202fVoir\u202f\u00bb, est-ce que le contenu du bouton devient \u00ab\u202fMasquer\u202f\u00bb\u202f? Dans ta vid\u00e9o tu pr\u00e9cises que le popup pour ajouter l'intervalle de dates se situe en dessous du calendrier pour qu'on puisse voir les dates pr\u00e9alablement s\u00e9lectionn\u00e9es, mais je pense que sur mobile \u00e7a va \u00eatre compliqu\u00e9 : \u00e7a signifierait que le popup se situe tr\u00e8s bas dans l'\u00e9cran, il n'y aurait que le titre visible sur les t\u00e9l\u00e9phones de petite taille. Dans les \u00e9crans de r\u00e9ponse au sondage date, quelle est la r\u00e8gle pour l'abbr\u00e9viation des dates\u202f? Des fois c'est le jour qui est abr\u00e9g\u00e9, des fois le mois. On part sur une version desktop \u00e0 partir de 768px\u202f? Je demande, car tes maquettes desktop font 602 px de large et je ne sais pas si c'est d\u00e9lib\u00e9r\u00e9 ou non.","title":20190809},{"location":"reunions/2019_08_09/#notes-du-982019-avec-mumble","text":"\u00c0 discuter : discussion via framatalk ? plut\u00f4t mumble ! Se connecter \u00e0 mumble.tcit.fr. Il n'a pas de mot de passe et il y a un salon Framadate ouvert. qui peut/veut faire quoi ? tykayn: dev front end, JS & styles newick : int\u00e9grateur dans la vraie vie llaq : plut\u00f4t HTML talone : plut\u00f4t cot\u00e9 JS on ne s'occupe toujours que du front ? [newick] Est-ce que tout le monde est ok sur le fait de faire que le front et pas tout ? llaq : pas de souci avec le back, donc pourquoi le changer ? Ok on y touche pas repartir de 0 ? Je parle de funky framadate llaq : Pourquoi pas recommencer car c'est bien diff\u00e9rent des maquettes newick : On est toujours en mode \"MVP\", on fait \u00e7a pour tester les maquettes et ensuite seulement on le connecte au back-end ? maiwann : Ouip tant que \u00e7a reste coh\u00e9rent niveau exp\u00e9rience de l'utilisateur newick : C'est plutot cot\u00e9 JS qu'il faut voir\u2026 talone ? Talone : on peut faire des choses, je maitrise pas php llaq : moi non plus talone : il y a des contributeurices de framadate ici ? maiwann : nope :x newick : on peut avancer comme \u00e7a, surtout sur le front et ensuite on verra le back ? talone & llaq : oui on peut faire \u00e7a [tentative de tykayn de nous rejoindre] pourquoi y'a des pages php dans le dossier front end ? newick : C'est dans le dossier principal, pas dans funky maiwann : donc a priori rien d'obligatoire ? API de backend existe t elle? llaq : nope ^_^ Sass, css, autre ? https://css2sass.herokuapp.com/ pour convertir le css actuel vers du sass int\u00e9r\u00eat de Bootstrap / frameworks ? Angular cli pour se concentrer sur des composants front end Boostrap a priori c'est pas forc\u00e9ment n\u00e9cessaire, newick assez \u00e0 l'aise pour ne pas en avoir besoin dans HTML / CSS Composants <3 Atomic design <3 tykayn : propose de faire une d\u00e9mo (Beaucoup de discussion sur les framework front, j'ai pas tout compris ce qu'il se passait donc mes notes sont tr\u00e8s limit\u00e9es !) En gros, on fait du Angular et chacun int\u00e8gre son truc ind\u00e9pendamment Invitation sur funkyframadate, on repart de 0 ! La suite remplissons le wiki et les board d'issues on zieute la d\u00e9mo et on voit ce qu'on fait ensuite","title":"notes du 9/8/2019 avec Mumble"},{"location":"reunions/2019_08_09/#questions-notees-par-come","text":"Suite au visionnage de la vid\u00e9o de pr\u00e9sentation de maiwann (Framadate_Presentation_maquettes.flv), des questions ont \u00e9t\u00e9 lev\u00e9es : Quel est l'int\u00e9r\u00eat de diff\u00e9rentier les dates limites de modification et vote\u202f? Pourquoi appelle-t-on cela archivage\u202f? Peut-on \u00e9crire plus explicitement que le nom du cr\u00e9ateur, s'il est renseign\u00e9, est affich\u00e9 \u00e0 ceux qui r\u00e9pondent\u202f? Lors de la validation du vote, peut-on mettre davantage en avant l'importance de l'URL d'\u00e9dition afin d'\u00e9viter la fermeture machinale (par r\u00e9flexe) du popup\u202f? Pour la vue des r\u00e9ponses, pourquoi ne pas mettre pour tous les utilisateurs les petites ic\u00f4nes actuellement r\u00e9serv\u00e9es aux daltoniens\u202f? On \u00e9conomiserait alors un champ. Quitte \u00e0 faire la chasse aux clics, pour les menus d\u00e9roulants \u00e0 deux options (du type \u00ab\u202fje veux\u202f\u00bb / \u00ab\u202fje ne veux pas\u202f\u00bb) qui n\u00e9cessitent deux clics pour commuter, pourquoi pas une commutation en un clic\u202f; comme une check-box mais avec du texte \u00e0 la place du check\u202f? Bien-s\u00fbr, ceci \u00e0 condition que les champs conditionnels ne soient pas vid\u00e9s lorsqu'ils disparaissent. Y a-t-il des champs obligatoires\u202f? Si oui, comment les mat\u00e9rialiser\u202f? En cas d'erreur \u00e0 la validation du formulaire (pour cause de champ vide ou format incorrect par exemple), on affiche syst\u00e9matiquement le message d'erreur en orange (cf. \u00e9cran sondage_date_intervalle) en dessous du champ concern\u00e9\u202f? Quel est l'\u00e9tat de focus sur les champs\u202f? Celui par d\u00e9faut du navigateur\u202f? \u00c9tant donn\u00e9 qu'il y a plusieurs \u00e9tapes dans la cr\u00e9ation du sondage, ne faudrait-il pas les indiquer au d\u00e9but de la page\u202f? Ex : 1/3, 2/3, 3/3 (je tire \u00e7a des bonnes pratiques opquast) Dans le r\u00e9capitulatif \u00e0 la fin, pourquoi ne rappelle-t-on pas \u00e9galement le titre et la description du sondage cr\u00e9\u00e9\u202f? Les boutons\u202f: Quel est l'\u00e9tat de focus sur les boutons\u202f? Sur l'\u00e9cran \u00ab\u202fMot de passe\u202f\u00bb, le bouton \u00ab\u202fVoir\u202f\u00bb est-il imm\u00e9diatement actif ou on attend d'avoir tap\u00e9 la premi\u00e8re lettre\u202f? Une fois qu'on a cliqu\u00e9 sur \u00ab\u202fVoir\u202f\u00bb, est-ce que le contenu du bouton devient \u00ab\u202fMasquer\u202f\u00bb\u202f? Dans ta vid\u00e9o tu pr\u00e9cises que le popup pour ajouter l'intervalle de dates se situe en dessous du calendrier pour qu'on puisse voir les dates pr\u00e9alablement s\u00e9lectionn\u00e9es, mais je pense que sur mobile \u00e7a va \u00eatre compliqu\u00e9 : \u00e7a signifierait que le popup se situe tr\u00e8s bas dans l'\u00e9cran, il n'y aurait que le titre visible sur les t\u00e9l\u00e9phones de petite taille. Dans les \u00e9crans de r\u00e9ponse au sondage date, quelle est la r\u00e8gle pour l'abbr\u00e9viation des dates\u202f? Des fois c'est le jour qui est abr\u00e9g\u00e9, des fois le mois. On part sur une version desktop \u00e0 partir de 768px\u202f? Je demande, car tes maquettes desktop font 602 px de large et je ne sais pas si c'est d\u00e9lib\u00e9r\u00e9 ou non.","title":"Questions not\u00e9es par Come."},{"location":"reunions/2020_08_09/","text":"English: This page isn't translated to English. Framadate suivi - Avril 2020 tags: framadate suivi Participants \u00e0 la r\u00e9union: Maiwann / Tykain / C\u00f4me / Seraf \u00c9tat des lieux O\u00f9 on en est sur la version funky ? https://framagit.org/framasoft/framadate/funky-framadate-front/-/boards Quel est le projet ? Quels sont les enjeux ? - Avoir un truc utilisable (sur t\u00e9l\u00e9phone !) - Graphiquement plus \u00e9l\u00e9gant Quelles m\u00e9thodes de travail ? - Une refonte ergonomique avant de faire des tests utilisateurs pour v\u00e9rifier que la nouvelle interface est chouette Quel niveau de qualit\u00e9 ? standards et de bonnes pratiques ? - Une refonte graphique, utilisable sur mobile - De l'internationalisation - Un logiciel accessible Quelles priorit\u00e9s ? - Cycle de vote \u00e0 finir Qui veut faire quoi ? Notes de r\u00e9union Le nom semble peu appropri\u00e9 depuis l'apparition des nouvelles fonctionnalit\u00e9s. Suggestions : - Framapool - FramEnqu\u00eate - Framasondage Id\u00e9e de nouvelle fonctionnalit\u00e9 (pour plus tard hein :D ) Chaque utilisateur indique ses disponibilit\u00e9s et le service renvoie les plages pour lesquelles le plus de personnes sont disponibles. Trucs \u00e0 faire Gitlab CI : ex\u00e9cuter les tests automatiquement envoi de mail au cr\u00e9ateur du sondage cafouillage entre front & back quand \u00e9dition d'un sondage (\u00e0 pr\u00e9ciser par tykain) v\u00e9rifier l'accesibilit\u00e9 du formulaire prompt de modale pour acc\u00e8s par mot de passe a un sondage priv\u00e9 Remarques Il est difficile d'entrer dans le projet en absence de sp\u00e9cifications \u00e9crites. (seraf) D\u00e9cisions prises V\u00e9rifier que chacun.e arrive \u00e0 faire tourner le projet Chacune choisit des issues / tickets adapt\u00e9s \u00e0 ce qu'il a envie de faire Ressources Discussion : https://framateam.org/ux-framatrucs/channels/framadate Repo front/dev : https://framagit.org/framasoft/framadate/funky-framadate-front/tree/dev Repo back : https://framagit.org/tykayn/date-poll-api Maquettes Zeplin : https://scene.zeplin.io/project/5d4d83d68866d6522ff2ff10 La d\u00e9mo : https://framadate-api.cipherbliss.com/ Vid\u00e9o de pr\u00e9sentation : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7","title":20200809},{"location":"reunions/2020_08_09/#framadate-suivi-avril-2020","text":"","title":"Framadate suivi - Avril 2020"},{"location":"reunions/2020_08_09/#tags-framadate-suivi","text":"Participants \u00e0 la r\u00e9union: Maiwann / Tykain / C\u00f4me / Seraf","title":"tags: framadate suivi"},{"location":"reunions/2020_08_09/#etat-des-lieux","text":"O\u00f9 on en est sur la version funky ? https://framagit.org/framasoft/framadate/funky-framadate-front/-/boards Quel est le projet ? Quels sont les enjeux ? - Avoir un truc utilisable (sur t\u00e9l\u00e9phone !) - Graphiquement plus \u00e9l\u00e9gant Quelles m\u00e9thodes de travail ? - Une refonte ergonomique avant de faire des tests utilisateurs pour v\u00e9rifier que la nouvelle interface est chouette Quel niveau de qualit\u00e9 ? standards et de bonnes pratiques ? - Une refonte graphique, utilisable sur mobile - De l'internationalisation - Un logiciel accessible Quelles priorit\u00e9s ? - Cycle de vote \u00e0 finir Qui veut faire quoi ?","title":"\u00c9tat des lieux"},{"location":"reunions/2020_08_09/#notes-de-reunion","text":"Le nom semble peu appropri\u00e9 depuis l'apparition des nouvelles fonctionnalit\u00e9s. Suggestions : - Framapool - FramEnqu\u00eate - Framasondage Id\u00e9e de nouvelle fonctionnalit\u00e9 (pour plus tard hein :D ) Chaque utilisateur indique ses disponibilit\u00e9s et le service renvoie les plages pour lesquelles le plus de personnes sont disponibles.","title":"Notes de r\u00e9union"},{"location":"reunions/2020_08_09/#trucs-a-faire","text":"Gitlab CI : ex\u00e9cuter les tests automatiquement envoi de mail au cr\u00e9ateur du sondage cafouillage entre front & back quand \u00e9dition d'un sondage (\u00e0 pr\u00e9ciser par tykain) v\u00e9rifier l'accesibilit\u00e9 du formulaire prompt de modale pour acc\u00e8s par mot de passe a un sondage priv\u00e9","title":"Trucs \u00e0 faire"},{"location":"reunions/2020_08_09/#remarques","text":"Il est difficile d'entrer dans le projet en absence de sp\u00e9cifications \u00e9crites. (seraf)","title":"Remarques"},{"location":"reunions/2020_08_09/#decisions-prises","text":"V\u00e9rifier que chacun.e arrive \u00e0 faire tourner le projet Chacune choisit des issues / tickets adapt\u00e9s \u00e0 ce qu'il a envie de faire","title":"D\u00e9cisions prises"},{"location":"reunions/2020_08_09/#ressources","text":"Discussion : https://framateam.org/ux-framatrucs/channels/framadate Repo front/dev : https://framagit.org/framasoft/framadate/funky-framadate-front/tree/dev Repo back : https://framagit.org/tykayn/date-poll-api Maquettes Zeplin : https://scene.zeplin.io/project/5d4d83d68866d6522ff2ff10 La d\u00e9mo : https://framadate-api.cipherbliss.com/ Vid\u00e9o de pr\u00e9sentation : https://nuage.maiwann.net/s/JRRHTR9D2akMAa7","title":"Ressources"},{"location":"user-guide/","text":"English: This page isn't translated to English. Guide utilisateur Principe Framadate permet de cr\u00e9er et r\u00e9pondre \u00e0 des sondages demandant des disponibilit\u00e9 dans le temps \u00e0 plusieurs personnes afin de d\u00e9termnier un consensus pour organiser des rendez-vous. Il faut donc qu'une personne cr\u00e9e un sondage et publie un lien aux personnes qu'elle souhaite r\u00e9unir. Glossaire Terme Signification Cr\u00e9ateur Personne ayant cr\u00e9\u00e9 le sondage Participant Personne invit\u00e9e \u00e0 participer ou ayant particip\u00e9 Archivage Emp\u00eacher votes et commentaires mais conserver les r\u00e9sultats Slug Partie le l'URL identifiant un sondage de mani\u00e8re unique Fonctionnalit\u00e9s actuellement dans framadate legacy et \u00e0 conserver G\u00e9n\u00e9ralit\u00e9s Il existe deux types de sondage. Le type \u00ab\u202fdates\u202f\u00bb est adapt\u00e9 \u00e0 la proposition de dates (voir \u00a7plages horaires ) et le type \u00ab\u202ftexte\u202f\u00bb, plus g\u00e9n\u00e9raliste, ne contient que du texte. Ce choix est l'un des premiers choix effectu\u00e9s lors de la cr\u00e9ation d'un nouveau sondage. Deux types d'acteurs sont distingu\u00e9s : la personne ayant cr\u00e9\u00e9 le sondage et les personnes qui r\u00e9pondent au sondage. Ces deux types d'acteurs n'ont pas les m\u00eames droits sur le sondage : la personne ayant cr\u00e9\u00e9 le sondage est la seule ayant des droits d'administration sur celui-ci, en plus des droits des participants. En particulier, les droits d'administration permettent d'ajuster les droits des participants. Cr\u00e9ation d'un sondage Il est n\u00e9cessaire de fournir un email lors de la cr\u00e9ation du sondage. Cela permet aux cr\u00e9ateurs de sondages de pouvoir obtenir via email la liste des sondages qu'ils ont cr\u00e9\u00e9s. Il est possible de choisir le slug dans l'URL du sondage, \u00e0 condition que ce slug soit disponible. Le sondage reste modifiable apr\u00e8s sa cr\u00e9ation. Plages horaires Les sondages de type \u00ab\u202fdates\u202f\u00bb permettent de proposer des jours et des plages horaires pour chaque journ\u00e9e. Pour faciliter la saisie des dates propos\u00e9es, il est demand\u00e9 si les plages horaires sont les m\u00eames chaque jour ou si elles sont diff\u00e9rentes selon les jours. Dans le premier cas, les plages horaires sont demand\u00e9es uniquement pour le premier jour et sont automatiquement reproduites sur les autres jours. Toujours pour faciliter la saisie des propositions, il est possible d'ajouter plusieurs jours cons\u00e9cutifs en s\u00e9lectionnant le premier et le dernier jour plut\u00f4t qu'en s\u00e9lectionnant chaque jour un \u00e0 un. Participation \u00e0 un sondage Votes Les participants n'ont pas besoin de cr\u00e9er un compte ou de fournir leur email pour participer \u00e0 un sondage. Le cr\u00e9ateur du sondage peut prot\u00e9ger le sondage par un mot de passe. Sans ce mot de passe, il est impossible de voir le sondage, donc impossible d'y voter. Attention cependant, le sondage est stock\u00e9 en clair dans la base de donn\u00e9es et ne b\u00e9n\u00e9ficie donc d'aucun chiffrement. # Le mot de passe, lui, est-il chiffr\u00e9\u202f? Le cr\u00e9ateur du sondage choisit de permettre ou non les modifications des votes sur le sondage. Il a le choix entre les trois formules suivantes : ne pas permettre de modifier de r\u00e9ponse\u202f; permettre de modifier uniquement sa propre r\u00e9ponse a un sondage (modalit\u00e9s d'identification encore non d\u00e9termin\u00e9es)\u202f; permettre de modifier toute r\u00e9ponse \u00e0 un sondage (y compris celles des autres). Commentaires Les participants au sondage ont la possibilit\u00e9 de cr\u00e9er des commentaires sur le sondage. Seule la personne ayant les droits d'administration sur le sondage peut modifier les commentaires. R\u00e9sultats Selon la configuration du sondage, les r\u00e9sultats peuvent n'\u00eatre accessibles qu'\u00e0 la personne ayant un acc\u00e8s d'administration ou bien \u00eatre publics. Les personnes pouvant acc\u00e9der aux r\u00e9sultats du sondage peuvent exporter ces r\u00e9sultats au format CSV. Emails Lorsqu'une personne cr\u00e9e un sondage, un email reprenant les informations du sondage ainsi que les URL uniques servant \u00e0 le modifier (lien d'administration) et \u00e0 y participer (lien \u00e0 transmettre aux participants) lui est envoy\u00e9. De plus, elle peut choisir de recevoir des emails lors d'un nouveau vote ou commentaire sur le sondage. Une personne ayant cr\u00e9\u00e9 au moins un sondage peut demander \u00e0 recevoir par email la liste des sondages qu'elle a cr\u00e9\u00e9s en utilisant cette adresse email. Stockage et export de donn\u00e9es Les donn\u00e9es sont stock\u00e9es en clair sur le serveur. L'archivage (resp. suppression) automatique des sondages est effectu\u00e9 via cronjob 90 (resp. 120) jours apr\u00e8s sa cr\u00e9ation. Il est possible pour l'administrateur d'un sondage de modifier la dur\u00e9e avant archivage et la suppression automatique suit toujours de 30 jours la date d'archivage. L'export d'un sondage et des r\u00e9sultats d'un sondage est possible au format CSV ainsi que JSON. Nouveaut\u00e9s dans Framadate Funky Plus de d\u00e9tails dans la section Historique pour conna\u00eetre le cheminement des versions pr\u00e9c\u00e9dentes. Les id\u00e9es et rapports de bugs sont disponibles dans le tableau des Issues sur la forge logicielle. principales Accessibilit\u00e9 renforc\u00e9e. Traduction dynamique de toutes les phrases en choisissant la langue dans le menu. Adapt\u00e9 aussi bien sur mobile que grands \u00e9crans \u00e0 haute ou faible densit\u00e9 de pixels. Anti-spam de commentaires. Anti-spam de vote. Tests unitaires et end-to-end. Couverture de test. Nouveaut\u00e9s secondaires Choix de r\u00e9ponses possibles. Proposer de ne r\u00e9pondre que \u00ab\u202foui\u202f\u00bb ou rien, ou aller dans la nuance en proposant \u00ab\u202foui\u202f\u00bb, \u00ab\u202fpeut-\u00eatre\u202f\u00bb, \u00ab\u202fnon\u202f\u00bb, \u00ab\u202f?\u202f\u00bb. # Redondance ou le choix de r\u00e9ponses possibles de la premi\u00e8re phrase concerne un autre choix\u202f? Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien. Th\u00e8me sombre. Duplication de sondage \u00e0 partir d'un autre. Boutons pour copier dans le presse-papier les liens publics et priv\u00e9s / admin des sondages. Limiter le nombre de participants maximum Id\u00e9es pour de futures am\u00e9liorations (pertinence \u00e0 v\u00e9rifier) Gagner en vie priv\u00e9e en chiffrant certaines informations\u202f? Stockage z\u00e9ro knowledge avec un chiffrement robuste \u00e0 courbe elliptique. \u00c0 r\u00e9fl\u00e9chir : permettre \u00e0 Framadate de faire entrer \u00e0 des gens plusieurs plages de temps de disponibilit\u00e9 et le service d\u00e9duit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait \u00eatre avec divers niveaux de d\u00e9tail. Comme https://omnipointment.com/ (qui est un logiciel privateur) SSO du f\u00e9diverse\u202f?","title":"Guide utilisateur"},{"location":"user-guide/#guide-utilisateur","text":"","title":"Guide utilisateur"},{"location":"user-guide/#principe","text":"Framadate permet de cr\u00e9er et r\u00e9pondre \u00e0 des sondages demandant des disponibilit\u00e9 dans le temps \u00e0 plusieurs personnes afin de d\u00e9termnier un consensus pour organiser des rendez-vous. Il faut donc qu'une personne cr\u00e9e un sondage et publie un lien aux personnes qu'elle souhaite r\u00e9unir.","title":"Principe"},{"location":"user-guide/#glossaire","text":"Terme Signification Cr\u00e9ateur Personne ayant cr\u00e9\u00e9 le sondage Participant Personne invit\u00e9e \u00e0 participer ou ayant particip\u00e9 Archivage Emp\u00eacher votes et commentaires mais conserver les r\u00e9sultats Slug Partie le l'URL identifiant un sondage de mani\u00e8re unique","title":"Glossaire"},{"location":"user-guide/#fonctionnalites-actuellement-dans-framadate-legacy-et-a-conserver","text":"","title":"Fonctionnalit\u00e9s actuellement dans framadate legacy et \u00e0 conserver"},{"location":"user-guide/#generalites","text":"Il existe deux types de sondage. Le type \u00ab\u202fdates\u202f\u00bb est adapt\u00e9 \u00e0 la proposition de dates (voir \u00a7plages horaires ) et le type \u00ab\u202ftexte\u202f\u00bb, plus g\u00e9n\u00e9raliste, ne contient que du texte. Ce choix est l'un des premiers choix effectu\u00e9s lors de la cr\u00e9ation d'un nouveau sondage. Deux types d'acteurs sont distingu\u00e9s : la personne ayant cr\u00e9\u00e9 le sondage et les personnes qui r\u00e9pondent au sondage. Ces deux types d'acteurs n'ont pas les m\u00eames droits sur le sondage : la personne ayant cr\u00e9\u00e9 le sondage est la seule ayant des droits d'administration sur celui-ci, en plus des droits des participants. En particulier, les droits d'administration permettent d'ajuster les droits des participants.","title":"G\u00e9n\u00e9ralit\u00e9s"},{"location":"user-guide/#creation-dun-sondage","text":"Il est n\u00e9cessaire de fournir un email lors de la cr\u00e9ation du sondage. Cela permet aux cr\u00e9ateurs de sondages de pouvoir obtenir via email la liste des sondages qu'ils ont cr\u00e9\u00e9s. Il est possible de choisir le slug dans l'URL du sondage, \u00e0 condition que ce slug soit disponible. Le sondage reste modifiable apr\u00e8s sa cr\u00e9ation.","title":"Cr\u00e9ation d'un sondage"},{"location":"user-guide/#plages-horaires","text":"Les sondages de type \u00ab\u202fdates\u202f\u00bb permettent de proposer des jours et des plages horaires pour chaque journ\u00e9e. Pour faciliter la saisie des dates propos\u00e9es, il est demand\u00e9 si les plages horaires sont les m\u00eames chaque jour ou si elles sont diff\u00e9rentes selon les jours. Dans le premier cas, les plages horaires sont demand\u00e9es uniquement pour le premier jour et sont automatiquement reproduites sur les autres jours. Toujours pour faciliter la saisie des propositions, il est possible d'ajouter plusieurs jours cons\u00e9cutifs en s\u00e9lectionnant le premier et le dernier jour plut\u00f4t qu'en s\u00e9lectionnant chaque jour un \u00e0 un.","title":"Plages horaires"},{"location":"user-guide/#participation-a-un-sondage","text":"","title":"Participation \u00e0 un sondage"},{"location":"user-guide/#votes","text":"Les participants n'ont pas besoin de cr\u00e9er un compte ou de fournir leur email pour participer \u00e0 un sondage. Le cr\u00e9ateur du sondage peut prot\u00e9ger le sondage par un mot de passe. Sans ce mot de passe, il est impossible de voir le sondage, donc impossible d'y voter. Attention cependant, le sondage est stock\u00e9 en clair dans la base de donn\u00e9es et ne b\u00e9n\u00e9ficie donc d'aucun chiffrement. # Le mot de passe, lui, est-il chiffr\u00e9\u202f? Le cr\u00e9ateur du sondage choisit de permettre ou non les modifications des votes sur le sondage. Il a le choix entre les trois formules suivantes : ne pas permettre de modifier de r\u00e9ponse\u202f; permettre de modifier uniquement sa propre r\u00e9ponse a un sondage (modalit\u00e9s d'identification encore non d\u00e9termin\u00e9es)\u202f; permettre de modifier toute r\u00e9ponse \u00e0 un sondage (y compris celles des autres).","title":"Votes"},{"location":"user-guide/#commentaires","text":"Les participants au sondage ont la possibilit\u00e9 de cr\u00e9er des commentaires sur le sondage. Seule la personne ayant les droits d'administration sur le sondage peut modifier les commentaires.","title":"Commentaires"},{"location":"user-guide/#resultats","text":"Selon la configuration du sondage, les r\u00e9sultats peuvent n'\u00eatre accessibles qu'\u00e0 la personne ayant un acc\u00e8s d'administration ou bien \u00eatre publics. Les personnes pouvant acc\u00e9der aux r\u00e9sultats du sondage peuvent exporter ces r\u00e9sultats au format CSV.","title":"R\u00e9sultats"},{"location":"user-guide/#emails","text":"Lorsqu'une personne cr\u00e9e un sondage, un email reprenant les informations du sondage ainsi que les URL uniques servant \u00e0 le modifier (lien d'administration) et \u00e0 y participer (lien \u00e0 transmettre aux participants) lui est envoy\u00e9. De plus, elle peut choisir de recevoir des emails lors d'un nouveau vote ou commentaire sur le sondage. Une personne ayant cr\u00e9\u00e9 au moins un sondage peut demander \u00e0 recevoir par email la liste des sondages qu'elle a cr\u00e9\u00e9s en utilisant cette adresse email.","title":"Emails"},{"location":"user-guide/#stockage-et-export-de-donnees","text":"Les donn\u00e9es sont stock\u00e9es en clair sur le serveur. L'archivage (resp. suppression) automatique des sondages est effectu\u00e9 via cronjob 90 (resp. 120) jours apr\u00e8s sa cr\u00e9ation. Il est possible pour l'administrateur d'un sondage de modifier la dur\u00e9e avant archivage et la suppression automatique suit toujours de 30 jours la date d'archivage. L'export d'un sondage et des r\u00e9sultats d'un sondage est possible au format CSV ainsi que JSON.","title":"Stockage et export de donn\u00e9es"},{"location":"user-guide/#nouveautes-dans-framadate-funky","text":"Plus de d\u00e9tails dans la section Historique pour conna\u00eetre le cheminement des versions pr\u00e9c\u00e9dentes. Les id\u00e9es et rapports de bugs sont disponibles dans le tableau des Issues sur la forge logicielle.","title":"Nouveaut\u00e9s dans Framadate Funky"},{"location":"user-guide/#principales","text":"Accessibilit\u00e9 renforc\u00e9e. Traduction dynamique de toutes les phrases en choisissant la langue dans le menu. Adapt\u00e9 aussi bien sur mobile que grands \u00e9crans \u00e0 haute ou faible densit\u00e9 de pixels. Anti-spam de commentaires. Anti-spam de vote. Tests unitaires et end-to-end. Couverture de test.","title":"principales"},{"location":"user-guide/#nouveautes-secondaires","text":"Choix de r\u00e9ponses possibles. Proposer de ne r\u00e9pondre que \u00ab\u202foui\u202f\u00bb ou rien, ou aller dans la nuance en proposant \u00ab\u202foui\u202f\u00bb, \u00ab\u202fpeut-\u00eatre\u202f\u00bb, \u00ab\u202fnon\u202f\u00bb, \u00ab\u202f?\u202f\u00bb. # Redondance ou le choix de r\u00e9ponses possibles de la premi\u00e8re phrase concerne un autre choix\u202f? Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien. Th\u00e8me sombre. Duplication de sondage \u00e0 partir d'un autre. Boutons pour copier dans le presse-papier les liens publics et priv\u00e9s / admin des sondages. Limiter le nombre de participants maximum","title":"Nouveaut\u00e9s secondaires"},{"location":"user-guide/#idees-pour-de-futures-ameliorations-pertinence-a-verifier","text":"Gagner en vie priv\u00e9e en chiffrant certaines informations\u202f? Stockage z\u00e9ro knowledge avec un chiffrement robuste \u00e0 courbe elliptique. \u00c0 r\u00e9fl\u00e9chir : permettre \u00e0 Framadate de faire entrer \u00e0 des gens plusieurs plages de temps de disponibilit\u00e9 et le service d\u00e9duit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait \u00eatre avec divers niveaux de d\u00e9tail. Comme https://omnipointment.com/ (qui est un logiciel privateur) SSO du f\u00e9diverse\u202f?","title":"Id\u00e9es pour de futures am\u00e9liorations (pertinence \u00e0 v\u00e9rifier)"},{"location":"user-guide/history/","text":"English: This page isn't translated to English. What about Framadate v1? source: https://framagit.org/framasoft/framadate/framadate/-/issues/545 TL;DR: The project is now in maintenance mode. Follow https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api So I'm going to give a quick update on the status of this project. History 2009/2010: The university of Strasbourg develops STUdS May 2011: a Framasoft member forks STUdS into \"opensondage\" and cleans the code. They installs it for our own internal usage. June 2011: Framasoft works again on STUdS/Opensondage, make it more \"sexy\" (mostly frontend work), the service is accessible publicly at https://framadate.org 2014: the project is transferred to an employee of Framasoft There was a lot of work on the a11y front https://framablog.org/2014/11/26/framadate-nouvelle-version-accessible/ (in french) 2015: the project is handed to volunteers version 1.0 came out https://framablog.org/2016/10/17/framadate-passage-en-v1-happy-hour-pour-tout-le-monde/ (in french) 2016: these volunteers are no longer active 2018: It's the beginning of multiple tentatives to rethink Framadate, including some work by a volunteer designer who produced some mockups. 2019: A physical reunion with myself and some volunteers (https://www.codeursenlibert\u00e9.fr/entreprise/contribution_au_libre/ in french) produces what's now the 1.2.0 alpha release, but without further work, it's left abandoned (this is now the develop branch). Around the same time, the poll table gets a UI improvement, which is hotpatched on framadate.org but still not merged here: !412 2016-2021: small contributions from Framasoft/myself and from some volunteers, including some students, bring a few minor versions. A few UX improvements are added, but mostly frontend stuff. The one thing that seems to survive from the multiple tentatives to reboot Framadate is a rewrite in Angular and Symfony: https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api 2021: A french organization (not sure if I can say who) wants to support Framadate and seems to plan to work on the project I've just mentioned above. Current status What important here is that we lie on a huge pile of technical dept (more or less well written PHP from ten years ago), because no one - including Framasoft and myself - can find time for Framadate. Framasoft has currently a lot of ongoing projects, and does not wish to try to maintain this one any longer (not that it was done). I could give maintainer rights to some people like @sbernhard who seems to have sent a number of MRs and seems interested in Framadate, but given the state of the project, it's probably better to fork it (it would also remove the frama part in the project name, which we would like to get rid of anyway). If you do, please inform us so that we may link to your own project. Or you can also follow and maybe contribute to this rewrite https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api :) If it become usable and stable enough, we'll consider it to replace the service at https://framadate.org I'm putting the project in maintenance mode for now, meaning we only commit to release security fixes in the foreseeable future. I hope you can understand our position. Thomas, for Framasoft.","title":"What about Framadate v1?"},{"location":"user-guide/history/#what-about-framadate-v1","text":"source: https://framagit.org/framasoft/framadate/framadate/-/issues/545 TL;DR: The project is now in maintenance mode. Follow https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api So I'm going to give a quick update on the status of this project. History 2009/2010: The university of Strasbourg develops STUdS May 2011: a Framasoft member forks STUdS into \"opensondage\" and cleans the code. They installs it for our own internal usage. June 2011: Framasoft works again on STUdS/Opensondage, make it more \"sexy\" (mostly frontend work), the service is accessible publicly at https://framadate.org 2014: the project is transferred to an employee of Framasoft There was a lot of work on the a11y front https://framablog.org/2014/11/26/framadate-nouvelle-version-accessible/ (in french) 2015: the project is handed to volunteers version 1.0 came out https://framablog.org/2016/10/17/framadate-passage-en-v1-happy-hour-pour-tout-le-monde/ (in french) 2016: these volunteers are no longer active 2018: It's the beginning of multiple tentatives to rethink Framadate, including some work by a volunteer designer who produced some mockups. 2019: A physical reunion with myself and some volunteers (https://www.codeursenlibert\u00e9.fr/entreprise/contribution_au_libre/ in french) produces what's now the 1.2.0 alpha release, but without further work, it's left abandoned (this is now the develop branch). Around the same time, the poll table gets a UI improvement, which is hotpatched on framadate.org but still not merged here: !412 2016-2021: small contributions from Framasoft/myself and from some volunteers, including some students, bring a few minor versions. A few UX improvements are added, but mostly frontend stuff. The one thing that seems to survive from the multiple tentatives to reboot Framadate is a rewrite in Angular and Symfony: https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api 2021: A french organization (not sure if I can say who) wants to support Framadate and seems to plan to work on the project I've just mentioned above. Current status What important here is that we lie on a huge pile of technical dept (more or less well written PHP from ten years ago), because no one - including Framasoft and myself - can find time for Framadate. Framasoft has currently a lot of ongoing projects, and does not wish to try to maintain this one any longer (not that it was done). I could give maintainer rights to some people like @sbernhard who seems to have sent a number of MRs and seems interested in Framadate, but given the state of the project, it's probably better to fork it (it would also remove the frama part in the project name, which we would like to get rid of anyway). If you do, please inform us so that we may link to your own project. Or you can also follow and maybe contribute to this rewrite https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api :) If it become usable and stable enough, we'll consider it to replace the service at https://framadate.org I'm putting the project in maintenance mode for now, meaning we only commit to release security fixes in the foreseeable future. I hope you can understand our position. Thomas, for Framasoft.","title":"What about Framadate v1?"}]}
\ No newline at end of file
diff --git a/site/search/worker.js b/site/search/worker.js
deleted file mode 100644
index 1191ffd9..00000000
--- a/site/search/worker.js
+++ /dev/null
@@ -1,132 +0,0 @@
-var base_path = 'function' === typeof importScripts ? '.' : '/search/';
-var allowSearch = false;
-var index;
-var documents = {};
-var lang = ['en'];
-var data;
-
-function getScript(script, callback) {
- console.log('Loading script: ' + script);
- $.getScript(base_path + script)
- .done(function () {
- callback();
- })
- .fail(function (jqxhr, settings, exception) {
- console.log('Error: ' + exception);
- });
-}
-
-function getScriptsInOrder(scripts, callback) {
- if (scripts.length === 0) {
- callback();
- return;
- }
- getScript(scripts[0], function () {
- getScriptsInOrder(scripts.slice(1), callback);
- });
-}
-
-function loadScripts(urls, callback) {
- if ('function' === typeof importScripts) {
- importScripts.apply(null, urls);
- callback();
- } else {
- getScriptsInOrder(urls, callback);
- }
-}
-
-function onJSONLoaded() {
- data = JSON.parse(this.responseText);
- var scriptsToLoad = ['lunr.js'];
- if (data.config && data.config.lang && data.config.lang.length) {
- lang = data.config.lang;
- }
- if (lang.length > 1 || lang[0] !== 'en') {
- scriptsToLoad.push('lunr.stemmer.support.js');
- if (lang.length > 1) {
- scriptsToLoad.push('lunr.multi.js');
- }
- for (var i = 0; i < lang.length; i++) {
- if (lang[i] != 'en') {
- scriptsToLoad.push(['lunr', lang[i], 'js'].join('.'));
- }
- }
- }
- loadScripts(scriptsToLoad, onScriptsLoaded);
-}
-
-function onScriptsLoaded() {
- console.log('All search scripts loaded, building Lunr index...');
- if (data.config && data.config.separator && data.config.separator.length) {
- lunr.tokenizer.separator = new RegExp(data.config.separator);
- }
-
- if (data.index) {
- index = lunr.Index.load(data.index);
- data.docs.forEach(function (doc) {
- documents[doc.location] = doc;
- });
- console.log('Lunr pre-built index loaded, search ready');
- } else {
- index = lunr(function () {
- if (lang.length === 1 && lang[0] !== 'en' && lunr[lang[0]]) {
- this.use(lunr[lang[0]]);
- } else if (lang.length > 1) {
- this.use(lunr.multiLanguage.apply(null, lang)); // spread operator not supported in all browsers: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_operator#Browser_compatibility
- }
- this.field('title');
- this.field('text');
- this.ref('location');
-
- for (var i = 0; i < data.docs.length; i++) {
- var doc = data.docs[i];
- this.add(doc);
- documents[doc.location] = doc;
- }
- });
- console.log('Lunr index built, search ready');
- }
- allowSearch = true;
- postMessage({ config: data.config });
- postMessage({ allowSearch: allowSearch });
-}
-
-function init() {
- var oReq = new XMLHttpRequest();
- oReq.addEventListener('load', onJSONLoaded);
- var index_path = base_path + '/search_index.json';
- if ('function' === typeof importScripts) {
- index_path = 'search_index.json';
- }
- oReq.open('GET', index_path);
- oReq.send();
-}
-
-function search(query) {
- if (!allowSearch) {
- console.error('Assets for search still loading');
- return;
- }
-
- var resultDocuments = [];
- var results = index.search(query);
- for (var i = 0; i < results.length; i++) {
- var result = results[i];
- doc = documents[result.ref];
- doc.summary = doc.text.substring(0, 200);
- resultDocuments.push(doc);
- }
- return resultDocuments;
-}
-
-if ('function' === typeof importScripts) {
- onmessage = function (e) {
- if (e.data.init) {
- init();
- } else if (e.data.query) {
- postMessage({ results: search(e.data.query) });
- } else {
- console.error('Worker - Unrecognized message: ' + e);
- }
- };
-}
diff --git a/site/sitemap.xml b/site/sitemap.xml
deleted file mode 100644
index 586e6d10..00000000
--- a/site/sitemap.xml
+++ /dev/null
@@ -1,67 +0,0 @@
-
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/index.en/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/index.fr/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/TODO/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/user-guide/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/changelog/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/GETTING_STARTED/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/customisation/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/cadrage/accessibility/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/cadrage/architecture/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/dev-guide/CONTRIBUTE/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/angular/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/cadrage/i18n/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/cadrage/specifications-fonctionnelles/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/reunions/0_blank_notes/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/reunions/2020_08_09/
- 2021-05-18
- daily
-
- https://framagit.org/framasoft/framadate/funky-framadate-front/reunions/2019_08_09/
- 2021-05-18
- daily
-
-
\ No newline at end of file
diff --git a/site/sitemap.xml.gz b/site/sitemap.xml.gz
deleted file mode 100644
index 97aa0e89..00000000
Binary files a/site/sitemap.xml.gz and /dev/null differ
diff --git a/site/user-guide/history/index.html b/site/user-guide/history/index.html
deleted file mode 100644
index cde0ab66..00000000
--- a/site/user-guide/history/index.html
+++ /dev/null
@@ -1,281 +0,0 @@
-
-
-
-
-
-
-
-
-
-
- What about Framadate v1? - Funky Framadate Front end
-
-
-
-
-
-
-
-
-
-
-
-
-
source: https://framagit.org/framasoft/framadate/framadate/-/issues/545
-TL;DR: The project is now in maintenance mode. Follow https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api
-So I'm going to give a quick update on the status of this project.
-History
-
2009/2010: The university of Strasbourg develops STUdS
-
May 2011: a Framasoft member forks STUdS into "opensondage" and cleans the code. They installs it for our own internal usage.
-
June 2011: Framasoft works again on STUdS/Opensondage, make it more "sexy" (mostly frontend work), the service is accessible publicly at https://framadate.org
-
2014: the project is transferred to an employee of Framasoft
-There was a lot of work on the a11y front https://framablog.org/2014/11/26/framadate-nouvelle-version-accessible/ (in french)
-
2015: the project is handed to volunteers
-version 1.0 came out https://framablog.org/2016/10/17/framadate-passage-en-v1-happy-hour-pour-tout-le-monde/ (in french)
-
2016: these volunteers are no longer active
-
2018: It's the beginning of multiple tentatives to rethink Framadate, including some work by a volunteer designer who produced some mockups.
-
2019: A physical reunion with myself and some volunteers (https://www.codeursenliberté.fr/entreprise/contribution_au_libre/ in french) produces what's now the 1.2.0 alpha release, but without further work, it's left abandoned (this is now the develop branch).
-Around the same time, the poll table gets a UI improvement, which is hotpatched on framadate.org but still not merged here: !412
-
2016-2021: small contributions from Framasoft/myself and from some volunteers, including some students, bring a few minor versions.
-A few UX improvements are added, but mostly frontend stuff.
-The one thing that seems to survive from the multiple tentatives to reboot Framadate is a rewrite in Angular and Symfony: https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api
-
2021: A french organization (not sure if I can say who) wants to support Framadate and seems to plan to work on the project I've just mentioned above.
-
Current status
-What important here is that we lie on a huge pile of technical dept (more or less well written PHP from ten years ago), because no one - including Framasoft and myself - can find time for Framadate.
-Framasoft has currently a lot of ongoing projects, and does not wish to try to maintain this one any longer (not that it was done).
-I could give maintainer rights to some people like @sbernhard who seems to have sent a number of MRs and seems interested in Framadate, but given the state of the project, it's probably better to fork it (it would also remove the frama part in the project name, which we would like to get rid of anyway). If you do, please inform us so that we may link to your own project.
-Or you can also follow and maybe contribute to this rewrite https://framagit.org/framasoft/framadate/funky-framadate-front and https://framagit.org/tykayn/date-poll-api :)
-If it become usable and stable enough, we'll consider it to replace the service at https://framadate.org
-I'm putting the project in maintenance mode for now, meaning we only commit to release security fixes in the foreseeable future.
-I hope you can understand our position.
-Thomas, for Framasoft.
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
Framadate permet de créer et répondre à des sondages demandant des disponibilité dans le temps à plusieurs personnes afin de détermnier un consensus pour organiser des rendez-vous.
-Il faut donc qu'une personne crée un sondage et publie un lien aux personnes qu'elle souhaite réunir.
-
Glossaire
-
-
-
-
Terme
-
Signification
-
-
-
-
-
Créateur
-
Personne ayant créé le sondage
-
-
-
Participant
-
Personne invitée à participer ou ayant participé
-
-
-
Archivage
-
Empêcher votes et commentaires mais conserver les résultats
-
-
-
Slug
-
Partie le l'URL identifiant un sondage de manière unique
-
-
-
-
Fonctionnalités actuellement dans framadate legacy et à conserver
-
Généralités
-
Il existe deux types de sondage. Le type « dates » est adapté à la proposition de dates (voir §plages horaires) et le type « texte », plus généraliste, ne contient que du texte. Ce choix est l'un des premiers choix effectués lors de la création d'un nouveau sondage.
-
Deux types d'acteurs sont distingués : la personne ayant créé le sondage et les personnes qui répondent au sondage. Ces deux types d'acteurs n'ont pas les mêmes droits sur le sondage : la personne ayant créé le sondage est la seule ayant des droits d'administration sur celui-ci, en plus des droits des participants. En particulier, les droits d'administration permettent d'ajuster les droits des participants.
-
Création d'un sondage
-
Il est nécessaire de fournir un email lors de la création du sondage. Cela permet aux créateurs de sondages de pouvoir obtenir via email la liste des sondages qu'ils ont créés.
-
Il est possible de choisir le slug dans l'URL du sondage, à condition que ce slug soit disponible.
-
Le sondage reste modifiable après sa création.
-
Plages horaires
-
Les sondages de type « dates » permettent de proposer des jours et des plages horaires pour chaque journée.
-
Pour faciliter la saisie des dates proposées, il est demandé si les plages horaires sont les mêmes chaque jour ou si elles sont différentes selon les jours. Dans le premier cas, les plages horaires sont demandées uniquement pour le premier jour et sont automatiquement reproduites sur les autres jours.
-
Toujours pour faciliter la saisie des propositions, il est possible d'ajouter plusieurs jours consécutifs en sélectionnant le premier et le dernier jour plutôt qu'en sélectionnant chaque jour un à un.
-
Participation à un sondage
-
Votes
-
Les participants n'ont pas besoin de créer un compte ou de fournir leur email pour participer à un sondage.
-
Le créateur du sondage peut protéger le sondage par un mot de passe. Sans ce mot de passe, il est impossible de voir le sondage, donc impossible d'y voter. Attention cependant, le sondage est stocké en clair dans la base de données et ne bénéficie donc d'aucun chiffrement. # Le mot de passe, lui, est-il chiffré ?
-
Le créateur du sondage choisit de permettre ou non les modifications des votes sur le sondage. Il a le choix entre les trois formules suivantes :
-
-
ne pas permettre de modifier de réponse ;
-
permettre de modifier uniquement sa propre réponse a un sondage (modalités d'identification encore non déterminées) ;
-
permettre de modifier toute réponse à un sondage (y compris celles des autres).
-
-
Commentaires
-
Les participants au sondage ont la possibilité de créer des commentaires sur le sondage. Seule la personne ayant les droits d'administration sur le sondage peut modifier les commentaires.
-
Résultats
-
Selon la configuration du sondage, les résultats peuvent n'être accessibles qu'à la personne ayant un accès d'administration ou bien être publics. Les personnes pouvant accéder aux résultats du sondage peuvent exporter ces résultats au format CSV.
-
Emails
-
Lorsqu'une personne crée un sondage, un email reprenant les informations du sondage ainsi que les URL uniques servant à le modifier (lien d'administration) et à y participer (lien à transmettre aux participants) lui est envoyé. De plus, elle peut choisir de recevoir des emails lors d'un nouveau vote ou commentaire sur le sondage.
-
Une personne ayant créé au moins un sondage peut demander à recevoir par email la liste des sondages qu'elle a créés en utilisant cette adresse email.
-
Stockage et export de données
-
Les données sont stockées en clair sur le serveur. L'archivage (resp. suppression) automatique des sondages est effectué via cronjob 90 (resp. 120) jours après sa création. Il est possible pour l'administrateur d'un sondage de modifier la durée avant archivage et la suppression automatique suit toujours de 30 jours la date d'archivage.
-
L'export d'un sondage et des résultats d'un sondage est possible au format CSV ainsi que JSON.
-
Nouveautés dans Framadate Funky
-
Plus de détails dans la section Historique pour connaître le cheminement des versions précédentes.
-Les idées et rapports de bugs sont disponibles dans le tableau des Issues sur la forge logicielle.
-
principales
-
-
Accessibilité renforcée.
-
Traduction dynamique de toutes les phrases en choisissant la langue dans le menu.
-
Adapté aussi bien sur mobile que grands écrans à haute ou faible densité de pixels.
-
Anti-spam de commentaires.
-
Anti-spam de vote.
-
Tests unitaires et end-to-end.
-
Couverture de test.
-
-
Nouveautés secondaires
-
-
Choix de réponses possibles. Proposer de ne répondre que « oui » ou rien, ou aller dans la nuance en proposant « oui », « peut-être », « non », « ? ». # Redondance ou le choix de réponses possibles de la première phrase concerne un autre choix ?
-
Insertion d'images dans le sondage de type texte, avec des URL uniquement. Une seule image par title possible ou rien.
-
Thème sombre.
-
Duplication de sondage à partir d'un autre.
-
Boutons pour copier dans le presse-papier les liens publics et privés / admin des sondages.
-
Limiter le nombre de participants maximum
-
-
Idées pour de futures améliorations (pertinence à vérifier)
-
-
Gagner en vie privée en chiffrant certaines informations ? Stockage zéro knowledge avec un chiffrement robuste à courbe elliptique.
-
À réfléchir : permettre à Framadate de faire entrer à des gens plusieurs plages de temps de disponibilité et le service déduit quelles sont les plages de temps favorables (calcul d'intersection sur des lignes discontinues). Cela pourrait être avec divers niveaux de détail. Comme https://omnipointment.com/ (qui est un logiciel privateur)
-
SSO du fédiverse ?
-
-
-
-
-
-
-
-
-
-
-
-
-
-
Search
-
-
-
-
- From here you can search these documents. Enter
- your search terms below.
-
-