first commit

doc/qxorm_fr/resource/license.gpl3.txt

@@ -0,0 +1,630 @@
+QxOrm library - Copyright (C) 2021 XDL Team (ic-east.com)
+
+You may use, distribute and copy QxOrm library under the terms of the
+GNU General Public License version 3, which is displayed below
+
+-------------------------------------------------------------------------
+
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+-------------------------------------------------------------------------

doc/qxorm_fr/resource/quick_sample.export_drugs.xml.txt

@@ -0,0 +1,25 @@
+<std.vector-boost.shared_ptr-drug-- class_id="0" tracking_level="0" version="0">
+	<count>3</count>
+	<item_version>1</item_version>
+	<item class_id="1" tracking_level="0" version="1">
+		<px class_id="2" tracking_level="1" version="1" object_id="_0">
+			<id>1</id>
+			<name class_id="3" tracking_level="0" version="0">name1</name>
+			<desc>desc1</desc>
+		</px>
+	</item>
+	<item>
+		<px class_id_reference="2" object_id="_1">
+			<id>2</id>
+			<name>name2 modified</name>
+			<desc>desc2 modified</desc>
+		</px>
+	</item>
+	<item>
+		<px class_id_reference="2" object_id="_2">
+			<id>3</id>
+			<name>name3</name>
+			<desc>desc3</desc>
+		</px>
+	</item>
+</std.vector-boost.shared_ptr-drug-->

doc/qxorm_fr/resource/qxBlog.main.exec.result.txt

@@ -0,0 +1,162 @@
+[QxOrm] qx::QxSqlDatabase : create new database connection in thread '4456' with key '{e986c95d-1cb0-4368-ad9c-3dd4ccd20b84}'
+[QxOrm] sql query (93 ms) : DELETE FROM author
+[QxOrm] sql query (63 ms) : DELETE FROM comment
+[QxOrm] sql query (94 ms) : DELETE FROM category
+[QxOrm] sql query (78 ms) : DELETE FROM blog
+[QxOrm] sql query (62 ms) : INSERT INTO author (author_id, name, birthdate, sex) VALUES (:author_id, :name, :birthdate, :sex)
+[QxOrm] sql query (0 ms) : SELECT COUNT(*) FROM author
+[QxOrm] sql query (0 ms) : SELECT author.author_id AS author_author_id_0, author.name AS author_name_0, author.birthdate AS author_birthdate_0, author.sex AS author_sex_0 FROM author WHERE author.sex = :sex
+[QxOrm] start dump 'qx::QxCollection<QString, boost::shared_ptr<author>>'
+<qx.QxCollection-QString_boost.shared_ptr-author-- class_id="0" tracking_level="0" version="0">
+	<count>2</count>
+	<item class_id="1" tracking_level="0" version="0">
+		<first class_id="2" tracking_level="0" version="0">author_id_2</first>
+		<second class_id="3" tracking_level="0" version="1">
+			<px class_id="4" tracking_level="1" version="0" object_id="_0">
+				<author_id>author_id_2</author_id>
+				<name>author_2</name>
+				<birthdate class_id="5" tracking_level="0" version="0">20100409</birthdate>
+				<sex>1</sex>
+				<list_blog class_id="6" tracking_level="0" version="0">
+					<count>0</count>
+					<item_version>1</item_version>
+				</list_blog>
+			</px>
+		</second>
+	</item>
+	<item>
+		<first>author_id_3</first>
+		<second>
+			<px class_id_reference="4" object_id="_1">
+				<author_id>author_id_3</author_id>
+				<name>author_3</name>
+				<birthdate>20100409</birthdate>
+				<sex>1</sex>
+				<list_blog>
+					<count>0</count>
+					<item_version>1</item_version>
+				</list_blog>
+			</px>
+		</second>
+	</item>
+</qx.QxCollection-QString_boost.shared_ptr-author-->
+
+[QxOrm] end dump 'qx::QxCollection<QString, boost::shared_ptr<author>>'
+[QxOrm] sql query (0 ms) : INSERT INTO category (name, description) VALUES (:name, :description)
+[QxOrm] sql query (0 ms) : INSERT INTO category (name, description) VALUES (:name, :description)
+[QxOrm] sql query (0 ms) : INSERT INTO category (name, description) VALUES (:name, :description)
+[QxOrm] sql query (0 ms) : INSERT INTO blog (blog_text, date_creation, author_id) VALUES (:blog_text, :date_creation, :author_id)
+[QxOrm] sql query (0 ms) : SELECT blog.blog_id AS blog_blog_id_0 FROM blog WHERE blog_blog_id_0 = :blog_id
+[QxOrm] sql query (0 ms) : UPDATE blog SET blog_id = :blog_id, blog_text = :blog_text, date_creation = :date_creation, author_id = :author_id WHERE blog_id = :blog_id_bis
+[QxOrm] sql query (78 ms) : INSERT INTO comment (comment_text, date_creation, blog_id) VALUES (:comment_text, :date_creation, :blog_id)
+[QxOrm] sql query (78 ms) : INSERT INTO comment (comment_text, date_creation, blog_id) VALUES (:comment_text, :date_creation, :blog_id)
+[QxOrm] sql query (0 ms) : SELECT COUNT(*) FROM comment
+[QxOrm] sql query (0 ms) : SELECT blog.blog_id AS blog_blog_id_0 FROM blog WHERE blog_blog_id_0 = :blog_id
+[QxOrm] sql query (0 ms) : UPDATE blog SET blog_id = :blog_id, blog_text = :blog_text, date_creation = :date_creation, author_id = :author_id WHERE blog_id = :blog_id_bis
+[QxOrm] sql query (0 ms) : SELECT category.category_id AS category_category_id_0 FROM category WHERE category_category_id_0 = :category_id
+[QxOrm] sql query (0 ms) : UPDATE category SET category_id = :category_id, name = :name, description = :description WHERE category_id = :category_id_bis
+[QxOrm] sql query (0 ms) : SELECT category.category_id AS category_category_id_0 FROM category WHERE category_category_id_0 = :category_id
+[QxOrm] sql query (0 ms) : UPDATE category SET category_id = :category_id, name = :name, description = :description WHERE category_id = :category_id_bis
+[QxOrm] sql query (extra-table) : DELETE FROM category_blog WHERE category_blog.blog_id = :blog_id
+[QxOrm] sql query (extra-table) : INSERT INTO category_blog (blog_id, category_id) VALUES (:blog_id, :category_id)
+[QxOrm] sql query (0 ms) : SELECT blog.blog_id AS blog_blog_id_0, blog.blog_text AS blog_blog_text_0, blog.date_creation AS blog_date_creation_0, blog.author_id AS blog_author_id_0, author_1.author_id AS author_1_author_id_0, author_1.name AS author_1_name_0, author_1.birthdate AS author_1_birthdate_0, author_1.sex AS author_1_sex_0, comment_2.comment_id AS comment_2_comment_id_0, comment_2.blog_id AS comment_2_blog_id_0, comment_2.comment_text AS comment_2_comment_text_0, comment_2.date_creation AS comment_2_date_creation_0, category_3.category_id AS category_3_category_id_0, category_3.name AS category_3_name_0, category_3.description AS category_3_description_0 FROM blog LEFT OUTER JOIN author author_1 ON author_1_author_id_0 = blog_author_id_0 LEFT OUTER JOIN comment comment_2 ON comment_2_blog_id_0 = blog_blog_id_0 LEFT OUTER JOIN category_blog ON blog_blog_id_0 = category_blog.blog_id LEFT OUTER JOIN category category_3 ON category_blog.category_id = category_3_category_id_0 WHERE blog_blog_id_0 = :blog_id
+[QxOrm] start dump 'boost::shared_ptr<blog>'
+<boost.shared_ptr-blog- class_id="0" tracking_level="0" version="1">
+	<px class_id="1" tracking_level="1" version="0" object_id="_0">
+		<blog_id>113</blog_id>
+		<blog_text class_id="2" tracking_level="0" version="0">update blog_text_1</blog_text>
+		<date_creation class_id="3" tracking_level="0" version="0">20100409162612000</date_creation>
+		<author_id class_id="4" tracking_level="0" version="1">
+			<px class_id="5" tracking_level="1" version="0" object_id="_1">
+				<author_id>author_id_2</author_id>
+				<name>author_2</name>
+				<birthdate class_id="6" tracking_level="0" version="0">20100409</birthdate>
+				<sex>1</sex>
+				<list_blog class_id="7" tracking_level="0" version="0">
+					<count>0</count>
+					<item_version>1</item_version>
+				</list_blog>
+			</px>
+		</author_id>
+		<list_comment class_id="8" tracking_level="0" version="0">
+			<count>2</count>
+			<item class_id="9" tracking_level="0" version="1">
+				<px class_id="10" tracking_level="1" version="0" object_id="_2">
+					<comment_id>209</comment_id>
+					<comment_text>comment_1 text</comment_text>
+					<date_creation>20100409162612000</date_creation>
+					<blog_id>
+						<px class_id_reference="1" object_id="_3">
+							<blog_id>113</blog_id>
+							<blog_text></blog_text>
+							<date_creation></date_creation>
+							<author_id>
+								<px class_id="-1"></px>
+							</author_id>
+							<list_comment>
+								<count>0</count>
+							</list_comment>
+							<list_category class_id="11" tracking_level="0" version="0">
+								<count>0</count>
+							</list_category>
+						</px>
+					</blog_id>
+				</px>
+			</item>
+			<item>
+				<px class_id_reference="10" object_id="_4">
+					<comment_id>210</comment_id>
+					<comment_text>comment_2 text</comment_text>
+					<date_creation>20100409162612000</date_creation>
+					<blog_id>
+						<px class_id_reference="1" object_id="_5">
+							<blog_id>113</blog_id>
+							<blog_text></blog_text>
+							<date_creation></date_creation>
+							<author_id>
+								<px class_id="-1"></px>
+							</author_id>
+							<list_comment>
+								<count>0</count>
+							</list_comment>
+							<list_category>
+								<count>0</count>
+							</list_category>
+						</px>
+					</blog_id>
+				</px>
+			</item>
+		</list_comment>
+		<list_category>
+			<count>2</count>
+			<item class_id="12" tracking_level="0" version="0">
+				<first>355</first>
+				<second class_id="13" tracking_level="0" version="0">
+					<qt_shared_ptr class_id="14" tracking_level="1" version="0" object_id="_6">
+						<category_id>355</category_id>
+						<name>category_1</name>
+						<description>desc_1</description>
+						<list_blog class_id="15" tracking_level="0" version="0">
+							<count>0</count>
+						</list_blog>
+					</qt_shared_ptr>
+				</second>
+			</item>
+			<item>
+				<first>357</first>
+				<second>
+					<qt_shared_ptr class_id_reference="14" object_id="_7">
+						<category_id>357</category_id>
+						<name>category_3</name>
+						<description>desc_3</description>
+						<list_blog>
+							<count>0</count>
+						</list_blog>
+					</qt_shared_ptr>
+				</second>
+			</item>
+		</list_category>
+	</px>
+</boost.shared_ptr-blog->
+
+[QxOrm] end dump 'boost::shared_ptr<blog>'

doc/qxorm_fr/resource/qxBlog.qxBlog.pro

@@ -0,0 +1,32 @@
+include(../../QxOrm.pri)
+
+TEMPLATE = app
+DEFINES += _BUILDING_QX_BLOG
+DESTDIR = ../../../QxOrm/test/_bin/
+INCLUDEPATH += ../../../QxOrm/include/
+LIBS += -L"../../../QxOrm/test/_bin"
+
+!contains(DEFINES, _QX_NO_PRECOMPILED_HEADER) {
+PRECOMPILED_HEADER = ./include/precompiled.h
+} # !contains(DEFINES, _QX_NO_PRECOMPILED_HEADER)
+
+CONFIG(debug, debug|release) {
+TARGET = qxBlogd
+LIBS += -l"QxOrmd"
+} else {
+TARGET = qxBlog
+LIBS += -l"QxOrm"
+} # CONFIG(debug, debug|release)
+
+HEADERS += ./include/precompiled.h
+HEADERS += ./include/export.h
+HEADERS += ./include/author.h
+HEADERS += ./include/blog.h
+HEADERS += ./include/category.h
+HEADERS += ./include/comment.h
+
+SOURCES += ./src/author.cpp
+SOURCES += ./src/blog.cpp
+SOURCES += ./src/category.cpp
+SOURCES += ./src/comment.cpp
+SOURCES += ./src/main.cpp

doc/qxorm_fr/resource/qxService.pri

@@ -0,0 +1,33 @@
+include(../../../QxOrm.pri)
+
+TEMPLATE = lib
+CONFIG += dll
+DEFINES += _BUILDING_QX_SERVICE
+INCLUDEPATH += ../../../../QxOrm/include/
+DESTDIR = ../../../../QxOrm/test/_bin/
+LIBS += -L"../../../../QxOrm/test/_bin"
+
+!contains(DEFINES, _QX_NO_PRECOMPILED_HEADER) {
+PRECOMPILED_HEADER = ./include/precompiled.h
+} # !contains(DEFINES, _QX_NO_PRECOMPILED_HEADER)
+
+CONFIG(debug, debug|release) {
+LIBS += -l"QxOrmd"
+} else {
+LIBS += -l"QxOrm"
+} # CONFIG(debug, debug|release)
+
+HEADERS += ./include/precompiled.h
+HEADERS += ./include/export.h
+HEADERS += ./include/service/server_infos.h
+HEADERS += ./include/service/user_service.h
+HEADERS += ./include/business_object/user.h
+HEADERS += ./include/business_object/user_search.h
+HEADERS += ./include/dao/user_manager.h
+
+SOURCES += ./src/service/server_infos.cpp
+SOURCES += ./src/service/user_service.cpp
+SOURCES += ./src/business_object/user.cpp
+SOURCES += ./src/business_object/user_search.cpp
+SOURCES += ./src/dao/user_manager.cpp
+SOURCES += ./src/main.cpp

doc/qxorm_fr/resource/qxServiceClient.pro

@@ -0,0 +1,11 @@
+include(./qxService.pri)
+
+DEFINES += _QX_SERVICE_MODE_CLIENT
+
+CONFIG(debug, debug|release) {
+OBJECTS_DIR = ./debug/debug_client/
+TARGET = qxServiceClientd
+} else {
+OBJECTS_DIR = ./release/release_client/
+TARGET = qxServiceClient
+} # CONFIG(debug, debug|release)

doc/qxorm_fr/resource/qxServiceServer.pro

@@ -0,0 +1,9 @@
+include(./qxService.pri)
+
+CONFIG(debug, debug|release) {
+OBJECTS_DIR = ./debug/debug_server/
+TARGET = qxServiceServerd
+} else {
+OBJECTS_DIR = ./release/release_server/
+TARGET = qxServiceServer
+} # CONFIG(debug, debug|release)

doc/qxorm_fr/resource/qx_persistable_cpp.html

@@ -0,0 +1,101 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"><head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8">
+<meta name="generator" content="C++2HTML by Jasper Bedaux">
+<style type="text/css">
+   .comment { color: #008000; font-style: italic; }
+   .pre { color: #000099; }
+   .string { color: #DF0101; }
+   .char { color: #009900; }
+   .float { color: #996600; }
+   .int { color: #999900; }
+   .bool { color: #000000; font-weight: bold; }
+   .type { color: #FF6633; }
+   .flow { color: #FF0000; }
+   .keyword { color: #990000; }
+   .operator { color: #663300; font-weight: bold; }
+   .operator { color: #663300; font-weight: bold; }
+</style>
+</head>
+<body>
+<pre><span class="pre">
+#include "../include/precompiled.h"
+
+#include "../include/QxPersistable.h"
+
+#include &lt;QxOrm_Impl.h&gt;
+</span>
+QX_REGISTER_COMPLEX_CLASS_NAME_CPP_QX_DLL1<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator">,</span> qx_QxPersistable<span class="operator">)</span><span class="keyword">
+
+namespace</span> qx<span class="operator"> {</span><span class="keyword">
+
+template</span><span class="operator"> &lt;&gt;</span><span class="type">
+void</span> register_class<span class="operator">(</span>QxClass<span class="operator">&lt;</span>qx<span class="operator">::</span>QxPersistable<span class="operator">&gt; &amp;</span> t<span class="operator">)
+{</span>
+   t<span class="operator">.</span>setPropertyBag<span class="operator">(</span><span class="string">"QX_NOT_PERSISTABLE"</span><span class="operator">,</span><span class="string"> "1"</span><span class="operator">);</span>
+
+   t<span class="operator">.</span>setSoftDelete<span class="operator">(</span>qx<span class="operator">::</span>QxSoftDelete<span class="operator">(</span><span class="string">"qx_deleted_at"</span><span class="operator">));</span>
+
+   t<span class="operator">.</span>id<span class="operator">(&amp;</span> qx<span class="operator">::</span>QxPersistable<span class="operator">::</span>m_qxId<span class="operator">,</span><span class="string"> "qx_id"</span><span class="operator">);</span>
+
+   t<span class="operator">.</span>data<span class="operator">(&amp;</span> qx<span class="operator">::</span>QxPersistable<span class="operator">::</span>m_qxDateCreation<span class="operator">,</span><span class="string"> "qx_date_creation"</span><span class="operator">);</span>
+   t<span class="operator">.</span>data<span class="operator">(&amp;</span> qx<span class="operator">::</span>QxPersistable<span class="operator">::</span>m_qxDateModification<span class="operator">,</span><span class="string"> "qx_date_modification"</span><span class="operator">);</span>
+
+   QxValidatorX<span class="operator">&lt;</span>qx<span class="operator">::</span>QxPersistable<span class="operator">&gt; *</span> pAllValidator<span class="operator"> =</span> t<span class="operator">.</span>getAllValidator<span class="operator">();</span>
+   pAllValidator<span class="operator">-&gt;</span>add_CustomValidator<span class="operator">(&amp;</span> qx<span class="operator">::</span>QxPersistable<span class="operator">::</span>qxIsValidInternal<span class="operator">);
+}</span>
+
+QX_PERSISTABLE_CPP<span class="operator">(</span>QxPersistable<span class="operator">)</span>
+
+QxPersistable<span class="operator">::</span>QxPersistable<span class="operator">() :</span> QObject<span class="operator">(),</span> qx<span class="operator">::</span>IxPersistable<span class="operator">(),</span> m_qxId<span class="operator">(</span><span class="int">0</span><span class="operator">) { ; }</span>
+
+QxPersistable<span class="operator">::~</span>QxPersistable<span class="operator">() { ; }</span><span class="type">
+
+long</span> QxPersistable<span class="operator">::</span>qxGetId<span class="operator">()</span><span class="keyword"> const</span><span class="operator"> {</span><span class="flow"> return</span> m_qxId<span class="operator">; }</span>
+
+QDateTime QxPersistable<span class="operator">::</span>qxGetDateCreation<span class="operator">()</span><span class="keyword"> const</span><span class="operator"> {</span><span class="flow"> return</span> m_qxDateCreation<span class="operator">.</span>toDateTime<span class="operator">(); }</span>
+
+QDateTime QxPersistable<span class="operator">::</span>qxGetDateModification<span class="operator">()</span><span class="keyword"> const</span><span class="operator"> {</span><span class="flow"> return</span> m_qxDateModification<span class="operator">.</span>toDateTime<span class="operator">(); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxSetId<span class="operator">(</span><span class="type">long</span> l<span class="operator">) {</span> m_qxId<span class="operator"> =</span> l<span class="operator">; }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxSetDateCreation<span class="operator">(</span><span class="keyword">const</span> QDateTime<span class="operator"> &amp;</span> dt<span class="operator">) {</span> m_qxDateCreation<span class="operator">.</span>fromDateTime<span class="operator">(</span>dt<span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxSetDateModification<span class="operator">(</span><span class="keyword">const</span> QDateTime<span class="operator"> &amp;</span> dt<span class="operator">) {</span> m_qxDateModification<span class="operator">.</span>fromDateTime<span class="operator">(</span>dt<span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxIsValidInternal<span class="operator">(</span>qx<span class="operator">::</span>QxInvalidValueX<span class="operator"> &amp;</span> invalidValues<span class="operator">) {</span><span class="keyword"> this</span><span class="operator">-&gt;</span>qxIsValid<span class="operator">(</span>invalidValues<span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxIsValid<span class="operator">(</span>qx<span class="operator">::</span>QxInvalidValueX<span class="operator"> &amp;</span> invalidValues<span class="operator">) {</span> Q_UNUSED<span class="operator">(</span>invalidValues<span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnBeforeInsert<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)
+{</span>
+   Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span>
+   m_qxDateCreation<span class="operator">.</span>fromDateTime<span class="operator">(</span>QDateTime<span class="operator">::</span>currentDateTime<span class="operator">());</span>
+   m_qxDateModification<span class="operator"> =</span> m_qxDateCreation<span class="operator">;</span>
+   Q_EMIT qxOnBeforeInsert<span class="operator">(</span><span class="keyword">this</span><span class="operator">);
+}</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnBeforeUpdate<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)
+{</span>
+   Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span>
+   m_qxDateModification<span class="operator">.</span>fromDateTime<span class="operator">(</span>QDateTime<span class="operator">::</span>currentDateTime<span class="operator">());</span>
+   Q_EMIT qxOnBeforeUpdate<span class="operator">(</span><span class="keyword">this</span><span class="operator">);
+}</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnBeforeDelete<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">) {</span> Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span> Q_EMIT qxOnBeforeDelete<span class="operator">(</span><span class="keyword">this</span><span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnBeforeFetch<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">) {</span> Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span> Q_EMIT qxOnBeforeFetch<span class="operator">(</span><span class="keyword">this</span><span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnAfterInsert<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">) {</span> Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span> Q_EMIT qxOnAfterInsert<span class="operator">(</span><span class="keyword">this</span><span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnAfterUpdate<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">) {</span> Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span> Q_EMIT qxOnAfterUpdate<span class="operator">(</span><span class="keyword">this</span><span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnAfterDelete<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">) {</span> Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span> Q_EMIT qxOnAfterDelete<span class="operator">(</span><span class="keyword">this</span><span class="operator">); }</span><span class="type">
+
+void</span> QxPersistable<span class="operator">::</span>qxOnAfterFetch<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">) {</span> Q_UNUSED<span class="operator">(</span>dao<span class="operator">);</span> Q_EMIT qxOnAfterFetch<span class="operator">(</span><span class="keyword">this</span><span class="operator">); }
+
+}</span><span class="comment"> // namespace qx
+</span></pre>
+
+
+</body></html>

doc/qxorm_fr/resource/qx_persistable_hpp.html

@@ -0,0 +1,165 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"><head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8">
+<meta name="generator" content="C++2HTML by Jasper Bedaux">
+<style type="text/css">
+   .comment { color: #008000; font-style: italic; }
+   .pre { color: #000099; }
+   .string { color: #DF0101; }
+   .char { color: #009900; }
+   .float { color: #996600; }
+   .int { color: #999900; }
+   .bool { color: #000000; font-weight: bold; }
+   .type { color: #FF6633; }
+   .flow { color: #FF0000; }
+   .keyword { color: #990000; }
+   .operator { color: #663300; font-weight: bold; }
+   .operator { color: #663300; font-weight: bold; }
+</style>
+</head>
+<body>
+<pre><span class="pre">
+#ifndef _QX_PERSISTABLE_H_
+#define _QX_PERSISTABLE_H_
+
+#ifdef _MSC_VER
+#pragma once
+#endif
+</span><span class="keyword">
+namespace</span> qx<span class="operator"> {</span><span class="keyword">
+
+class</span> QxPersistable<span class="operator">;</span><span class="keyword">
+
+namespace</span> dao<span class="operator"> {</span><span class="keyword">
+namespace</span> detail<span class="operator"> {</span><span class="keyword">
+
+template</span><span class="operator"> &lt;&gt;</span><span class="keyword">
+struct</span> QxDao_Trigger<span class="operator">&lt;</span>qx<span class="operator">::</span>QxPersistable<span class="operator">&gt;;
+
+}</span><span class="comment"> // namespace detail
+</span><span class="operator">}</span><span class="comment"> // namespace dao
+</span><span class="comment">
+/*!
+ * \brief qx::QxPersistable : super base class for persistent classes with many features and methods to override (be careful, don't forget to use QX_PERSISTABLE_HPP() and QX_PERSISTABLE_CPP() macros for each derived class)
+ */</span><span class="keyword">
+class</span> QX_DLL1_EXPORT QxPersistable<span class="operator"> :</span><span class="keyword"> public</span> QObject<span class="operator">,</span><span class="keyword"> public</span> qx<span class="operator">::</span>IxPersistable<span class="operator">
+{</span>
+
+   Q_OBJECT
+   QX_REGISTER_FRIEND_CLASS<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator">)</span>
+   QX_PERSISTABLE_HPP<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator">)</span>
+
+   Q_PROPERTY<span class="operator">(</span><span class="type"> long</span> qxId READ qxGetId WRITE qxSetId<span class="operator"> )</span>
+   Q_PROPERTY<span class="operator">(</span> QDateTime qxDateCreation READ qxGetDateCreation WRITE qxSetDateCreation<span class="operator"> )</span>
+   Q_PROPERTY<span class="operator">(</span> QDateTime qxDateModification READ qxGetDateModification WRITE qxSetDateModification<span class="operator"> )</span><span class="keyword">
+
+   friend struct</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>QxDao_Trigger<span class="operator">&lt;</span>qx<span class="operator">::</span>QxPersistable<span class="operator">&gt;;</span><span class="keyword">
+
+protected</span><span class="operator">:</span><span class="type">
+
+   long</span>                    m_qxId<span class="operator">;</span><span class="comment">                 //!&lt; Id of current instance stored into database
+</span>   qx<span class="operator">::</span>QxDateTimeNeutral   m_qxDateCreation<span class="operator">;</span><span class="comment">       //!&lt; Creation date-time automatically calculated before INSERT query
+</span>   qx<span class="operator">::</span>QxDateTimeNeutral   m_qxDateModification<span class="operator">;</span><span class="comment">   //!&lt; Modification date-time automatically calculated before INSERT and UPDATE queries
+</span><span class="keyword">
+public</span><span class="operator">:</span>
+
+   QxPersistable<span class="operator">();</span><span class="keyword">
+   virtual</span><span class="operator"> ~</span>QxPersistable<span class="operator">();</span><span class="type">
+
+   long</span> qxGetId<span class="operator">()</span><span class="keyword"> const</span><span class="operator">;</span>
+   QDateTime qxGetDateCreation<span class="operator">()</span><span class="keyword"> const</span><span class="operator">;</span>
+   QDateTime qxGetDateModification<span class="operator">()</span><span class="keyword"> const</span><span class="operator">;</span><span class="type">
+
+   void</span> qxSetId<span class="operator">(</span><span class="type">long</span> l<span class="operator">);</span><span class="type">
+   void</span> qxSetDateCreation<span class="operator">(</span><span class="keyword">const</span> QDateTime<span class="operator"> &amp;</span> dt<span class="operator">);</span><span class="type">
+   void</span> qxSetDateModification<span class="operator">(</span><span class="keyword">const</span> QDateTime<span class="operator"> &amp;</span> dt<span class="operator">);</span><span class="keyword">
+
+protected</span><span class="operator">:</span><span class="comment">
+
+   // -- List of useful protected methods to override into derived class -- //
+</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxIsValid<span class="operator">(</span>qx<span class="operator">::</span>QxInvalidValueX<span class="operator"> &amp;</span> invalidValues<span class="operator">);</span><span class="keyword">
+
+   virtual</span><span class="type"> void</span> qxOnBeforeInsert<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxOnBeforeUpdate<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxOnBeforeDelete<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxOnBeforeFetch<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxOnAfterInsert<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxOnAfterUpdate<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxOnAfterDelete<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+   virtual</span><span class="type"> void</span> qxOnAfterFetch<span class="operator">(</span>qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">);</span><span class="keyword">
+
+private</span><span class="operator">:</span><span class="type">
+
+   void</span> qxIsValidInternal<span class="operator">(</span>qx<span class="operator">::</span>QxInvalidValueX<span class="operator"> &amp;</span> invalidValues<span class="operator">);</span>
+
+Q_SIGNALS<span class="operator">:</span><span class="type">
+
+   void</span> qxOnBeforeInsert<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="type">
+   void</span> qxOnBeforeUpdate<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="type">
+   void</span> qxOnBeforeDelete<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="type">
+   void</span> qxOnBeforeFetch<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="type">
+   void</span> qxOnAfterInsert<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="type">
+   void</span> qxOnAfterUpdate<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="type">
+   void</span> qxOnAfterDelete<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="type">
+   void</span> qxOnAfterFetch<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> p<span class="operator">);</span><span class="keyword">
+
+public</span><span class="operator">:</span><span class="comment">
+
+   // -- List of useful public methods available from 'qx::IxPersistable' interface (using QX_PERSISTABLE_HPP() and QX_PERSISTABLE_CPP() macros) -- //
+</span><span class="comment">
+/*
+   virtual long qxCount(const qx::QxSqlQuery &amp; query = qx::QxSqlQuery(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxFetchById(const QVariant &amp; id = QVariant(), const QStringList &amp; columns = QStringList(), const QStringList &amp; relation = QStringList(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxFetchAll(qx::IxCollection &amp; list, const QStringList &amp; columns = QStringList(), const QStringList &amp; relation = QStringList(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxFetchByQuery(const qx::QxSqlQuery &amp; query, qx::IxCollection &amp; list, const QStringList &amp; columns = QStringList(), const QStringList &amp; relation = QStringList(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxInsert(const QStringList &amp; relation = QStringList(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxUpdate(const qx::QxSqlQuery &amp; query = qx::QxSqlQuery(), const QStringList &amp; columns = QStringList(), const QStringList &amp; relation = QStringList(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxSave(const QStringList &amp; relation = QStringList(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxDeleteById(const QVariant &amp; id = QVariant(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxDeleteAll(QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxDeleteByQuery(const qx::QxSqlQuery &amp; query, QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxDestroyById(const QVariant &amp; id = QVariant(), QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxDestroyAll(QSqlDatabase * pDatabase = NULL);
+   virtual QSqlError qxDestroyByQuery(const qx::QxSqlQuery &amp; query, QSqlDatabase * pDatabase = NULL);
+   virtual qx_bool qxExist(const QVariant &amp; id = QVariant(), QSqlDatabase * pDatabase = NULL);
+   virtual qx::QxInvalidValueX qxValidate(const QStringList &amp; groups = QStringList());
+   virtual qx::IxPersistableCollection_ptr qxNewPersistableCollection() const;
+   virtual qx::IxClass * qxClass() const;
+*/</span><span class="operator">
+
+};</span><span class="keyword">
+
+typedef</span> boost<span class="operator">::</span>shared_ptr<span class="operator">&lt;</span>qx<span class="operator">::</span>QxPersistable<span class="operator">&gt;</span> QxPersistable_ptr<span class="operator">;
+
+}</span><span class="comment"> // namespace qx
+</span>
+QX_REGISTER_COMPLEX_CLASS_NAME_HPP_QX_DLL1<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator">,</span> QObject<span class="operator">,</span><span class="int"> 0</span><span class="operator">,</span> qx_QxPersistable<span class="operator">)</span><span class="keyword">
+
+namespace</span> qx<span class="operator"> {</span><span class="keyword">
+namespace</span> dao<span class="operator"> {</span><span class="keyword">
+namespace</span> detail<span class="operator"> {</span><span class="keyword">
+
+template</span><span class="operator"> &lt;&gt;</span><span class="keyword">
+struct</span> QxDao_Trigger<span class="operator">&lt;</span>qx<span class="operator">::</span>QxPersistable<span class="operator">&gt;
+{</span><span class="keyword">
+
+   static inline</span><span class="type"> void</span> onBeforeInsert<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)   {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnBeforeInsert<span class="operator">(</span>dao<span class="operator">); } }</span><span class="keyword">
+   static inline</span><span class="type"> void</span> onBeforeUpdate<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)   {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnBeforeUpdate<span class="operator">(</span>dao<span class="operator">); } }</span><span class="keyword">
+   static inline</span><span class="type"> void</span> onBeforeDelete<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)   {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnBeforeDelete<span class="operator">(</span>dao<span class="operator">); } }</span><span class="keyword">
+   static inline</span><span class="type"> void</span> onBeforeFetch<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)    {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnBeforeFetch<span class="operator">(</span>dao<span class="operator">); } }</span><span class="keyword">
+   static inline</span><span class="type"> void</span> onAfterInsert<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)    {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnAfterInsert<span class="operator">(</span>dao<span class="operator">); } }</span><span class="keyword">
+   static inline</span><span class="type"> void</span> onAfterUpdate<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)    {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnAfterUpdate<span class="operator">(</span>dao<span class="operator">); } }</span><span class="keyword">
+   static inline</span><span class="type"> void</span> onAfterDelete<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)    {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnAfterDelete<span class="operator">(</span>dao<span class="operator">); } }</span><span class="keyword">
+   static inline</span><span class="type"> void</span> onAfterFetch<span class="operator">(</span>qx<span class="operator">::</span>QxPersistable<span class="operator"> *</span> t<span class="operator">,</span> qx<span class="operator">::</span>dao<span class="operator">::</span>detail<span class="operator">::</span>IxDao_Helper<span class="operator"> *</span> dao<span class="operator">)     {</span><span class="flow"> if</span><span class="operator"> (</span>t<span class="operator">) {</span> t<span class="operator">-&gt;</span>qxOnAfterFetch<span class="operator">(</span>dao<span class="operator">); } }
+
+};
+
+}</span><span class="comment"> // namespace detail
+</span><span class="operator">}</span><span class="comment"> // namespace dao
+</span><span class="operator">}</span><span class="comment"> // namespace qx
+</span><span class="pre">
+#endif // _QX_PERSISTABLE_H_</span></pre>
+
+
+</body></html>

doc/qxorm_fr/resource/qxclassx_dump_sql_schema.html

@@ -0,0 +1,121 @@
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN" "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"><head>
+<meta http-equiv="content-type" content="text/html; charset=UTF-8">
+<meta name="generator" content="C++2HTML by Jasper Bedaux">
+<style type="text/css">
+   .comment { color: #008000; font-style: italic; }
+   .pre { color: #000099; }
+   .string { color: #DF0101; }
+   .char { color: #009900; }
+   .float { color: #996600; }
+   .int { color: #999900; }
+   .bool { color: #000000; font-weight: bold; }
+   .type { color: #FF6633; }
+   .flow { color: #FF0000; }
+   .keyword { color: #990000; }
+   .operator { color: #663300; font-weight: bold; }
+   .operator { color: #663300; font-weight: bold; }
+</style>
+</head>
+<body>
+<pre>QString QxClassX<span class="operator">::</span>dumpSqlSchema<span class="operator">()
+{</span>
+   qDebug<span class="operator">(</span><span class="string">"[QxOrm] qx::QxClassX::dumpSqlSchema() : %s"</span><span class="operator">,</span><span class="string"> "be careful with this function, it's just an example and tested only with SQLite database, so it's strongly recommended to write your own function to create your SQL schema"</span><span class="operator">);</span>
+   QxCollection<span class="operator">&lt;</span>QString<span class="operator">,</span> IxClass<span class="operator"> *&gt; *</span> pAllClasses<span class="operator"> =</span> QxClassX<span class="operator">::</span>getAllClasses<span class="operator">();</span><span class="flow">
+   if</span><span class="operator"> (!</span> pAllClasses<span class="operator">) {</span> qAssert<span class="operator">(</span><span class="bool">false</span><span class="operator">);</span><span class="flow"> return</span><span class="string"> ""</span><span class="operator">; }</span>
+   QString sql<span class="operator">;</span><span class="type"> long</span> lSqlCount<span class="operator"> =</span><span class="int"> 0</span><span class="operator">;</span><span class="flow">
+
+   for</span><span class="operator"> (</span><span class="type">long</span> k<span class="operator"> =</span><span class="int"> 0</span><span class="operator">;</span> k<span class="operator"> &lt;</span> pAllClasses<span class="operator">-&gt;</span>count<span class="operator">();</span> k<span class="operator">++)
+   {</span>
+      IxClass<span class="operator"> *</span> pClass<span class="operator"> =</span> pAllClasses<span class="operator">-&gt;</span>getByIndex<span class="operator">(</span>k<span class="operator">);</span><span class="flow">
+      if</span><span class="operator"> (!</span> pClass<span class="operator">) {</span><span class="flow"> continue</span><span class="operator">; }</span><span class="comment">
+
+      // If the class is a parameter or a service from 'QxService' module, it's not a persistent class
+</span><span class="flow">      if</span><span class="operator"> (</span>pClass<span class="operator">-&gt;</span>isKindOf<span class="operator">(</span><span class="string">"qx::service::IxParameter"</span><span class="operator">) ||</span> pClass<span class="operator">-&gt;</span>isKindOf<span class="operator">(</span><span class="string">"qx::service::IxService"</span><span class="operator">)) {</span><span class="flow"> continue</span><span class="operator">; }</span><span class="comment">
+
+      // ----
+      // Here, you can filter other classes using property bag (meta-data), for example :
+      //    QString sProp = pClass-&gt;getPropertyBag("NOT_A_DATABASE_OBJECT").toString();
+      //    if (sProp == "1") { continue; }
+      // ----
+
+      // Get the version of the class : if (version = 0) then 'CREATE TABLE', else if (version &gt; 0) then 'ALTER TABLE'
+</span><span class="type">      long</span> lVersion<span class="operator"> =</span> pClass<span class="operator">-&gt;</span>getVersion<span class="operator">();</span><span class="type">
+      bool</span> bCreateTable<span class="operator"> = (</span>lVersion<span class="operator"> &lt;=</span><span class="int"> 0</span><span class="operator">);</span>
+      sql<span class="operator"> += (</span>bCreateTable<span class="operator"> ?</span><span class="string"> "CREATE TABLE "</span><span class="operator"> :</span><span class="string"> "ALTER TABLE "</span><span class="operator">);</span>
+      sql<span class="operator"> +=</span> pClass<span class="operator">-&gt;</span>getName<span class="operator">() +</span><span class="string"> " "</span><span class="operator">;</span>
+      sql<span class="operator"> += (</span>bCreateTable<span class="operator"> ?</span><span class="string"> "("</span><span class="operator"> :</span><span class="string"> "ADD ("</span><span class="operator">);</span><span class="comment">
+
+      // Get the primary key (id) of table, all columns into table, and other parameters associated to table
+</span>      IxDataMember<span class="operator"> *</span> pId<span class="operator"> =</span> pClass<span class="operator">-&gt;</span>getId<span class="operator">();</span>
+      IxDataMemberX<span class="operator"> *</span> pDataMemberX<span class="operator"> =</span> pClass<span class="operator">-&gt;</span>getDataMemberX<span class="operator">();</span>
+      QxSoftDelete oSoftDelete<span class="operator"> =</span> pClass<span class="operator">-&gt;</span>getSoftDelete<span class="operator">();</span><span class="comment">
+
+      // Insert primary key (id) to SQL schema
+</span><span class="flow">      if</span><span class="operator"> (</span>pId<span class="operator"> &amp;&amp; (</span>bCreateTable<span class="operator"> || (</span>pId<span class="operator">-&gt;</span>getVersion<span class="operator">() &gt;=</span> lVersion<span class="operator">)))
+      {</span> sql<span class="operator"> +=</span> pId<span class="operator">-&gt;</span>getSqlNameAndTypeAndParams<span class="operator">(</span><span class="string">", "</span><span class="operator">) +</span><span class="string"> ", "</span><span class="operator">;</span> qAssert<span class="operator">(!</span> pId<span class="operator">-&gt;</span>getSqlType<span class="operator">().</span>isEmpty<span class="operator">()); }</span><span class="comment">
+
+      // Insert all columns to SQL schema
+</span><span class="flow">      for</span><span class="operator"> (</span><span class="type">long</span> l<span class="operator"> =</span><span class="int"> 0</span><span class="operator">; (</span>pDataMemberX<span class="operator"> &amp;&amp; (</span>l<span class="operator"> &lt;</span> pDataMemberX<span class="operator">-&gt;</span>count_WithDaoStrategy<span class="operator">()));</span> l<span class="operator">++)
+      {</span>
+         IxDataMember<span class="operator"> *</span> p<span class="operator"> =</span> pDataMemberX<span class="operator">-&gt;</span>get_WithDaoStrategy<span class="operator">(</span>l<span class="operator">);</span><span class="flow">
+         if</span><span class="operator"> (</span>isValid_DataMember<span class="operator">(</span>p<span class="operator">) &amp;&amp; (</span>p<span class="operator"> !=</span> pId<span class="operator">) &amp;&amp; (</span>bCreateTable<span class="operator"> || (</span>p<span class="operator">-&gt;</span>getVersion<span class="operator">() &gt;=</span> lVersion<span class="operator">)))
+         {</span> sql<span class="operator"> +=</span> p<span class="operator">-&gt;</span>getSqlNameAndTypeAndParams<span class="operator">(</span><span class="string">", "</span><span class="operator">) +</span><span class="string"> ", "</span><span class="operator">;</span> qAssert<span class="operator">(!</span> p<span class="operator">-&gt;</span>getSqlType<span class="operator">().</span>isEmpty<span class="operator">()); }</span><span class="comment">
+
+         // ----
+         // Here, you can use property bag (meta-data) to add some SQL features, for example :
+         //    QString sProp = p-&gt;getPropertyBag("INDEX").toString();
+         //    if (sProp == "1") { sql += "CREATE INDEX" + etc...; }
+         // ----
+</span><span class="operator">      }</span><span class="comment">
+
+      // Insert soft delete behaviour to SQL schema
+</span><span class="flow">      if</span><span class="operator"> (</span>bCreateTable<span class="operator"> &amp;&amp; !</span> oSoftDelete<span class="operator">.</span>isEmpty<span class="operator">())
+      {</span> sql<span class="operator"> +=</span> oSoftDelete<span class="operator">.</span>buildSqlQueryToCreateTable<span class="operator">() +</span><span class="string"> ", "</span><span class="operator">; }</span><span class="comment">
+
+      // Insert all relations to SQL schema
+</span><span class="flow">      for</span><span class="operator"> (</span><span class="type">long</span> l<span class="operator"> =</span><span class="int"> 0</span><span class="operator">; (</span>pDataMemberX<span class="operator"> &amp;&amp; (</span>l<span class="operator"> &lt;</span> pDataMemberX<span class="operator">-&gt;</span>count_WithDaoStrategy<span class="operator">()));</span> l<span class="operator">++)
+      {</span>
+         IxDataMember<span class="operator"> *</span> p<span class="operator"> =</span> pDataMemberX<span class="operator">-&gt;</span>get_WithDaoStrategy<span class="operator">(</span>l<span class="operator">);</span>
+         QxSqlRelationParams params<span class="operator">(</span><span class="int">0</span><span class="operator">,</span><span class="int"> 0</span><span class="operator">, (&amp;</span> sql<span class="operator">),</span> NULL<span class="operator">,</span> NULL<span class="operator">,</span> NULL<span class="operator">);</span><span class="flow">
+         if</span><span class="operator"> (</span>isValid_SqlRelation<span class="operator">(</span>p<span class="operator">) &amp;&amp; (</span>p<span class="operator"> !=</span> pId<span class="operator">) &amp;&amp; (</span>bCreateTable<span class="operator"> || (</span>p<span class="operator">-&gt;</span>getVersion<span class="operator">() &gt;=</span> lVersion<span class="operator">)))
+         {</span> p<span class="operator">-&gt;</span>getSqlRelation<span class="operator">()-&gt;</span>createTable<span class="operator">(</span>params<span class="operator">); }
+      }</span><span class="comment">
+
+      // Terminate SQL schema for current class
+</span>      sql<span class="operator"> =</span> sql<span class="operator">.</span>left<span class="operator">(</span>sql<span class="operator">.</span>count<span class="operator">() -</span><span class="int"> 2</span><span class="operator">);</span><span class="comment"> // Remove last ", "
+</span>      sql<span class="operator"> +=</span><span class="string"> ")\n"</span><span class="operator">;</span>
+      lSqlCount<span class="operator">++;</span><span class="comment">
+
+      // Create extra-table from relations (for example, many-to-many relation needs an extra-table)
+</span><span class="flow">      for</span><span class="operator"> (</span><span class="type">long</span> l<span class="operator"> =</span><span class="int"> 0</span><span class="operator">; (</span>pDataMemberX<span class="operator"> &amp;&amp; (</span>l<span class="operator"> &lt;</span> pDataMemberX<span class="operator">-&gt;</span>count_WithDaoStrategy<span class="operator">()));</span> l<span class="operator">++)
+      {</span>
+         IxDataMember<span class="operator"> *</span> p<span class="operator"> =</span> pDataMemberX<span class="operator">-&gt;</span>get_WithDaoStrategy<span class="operator">(</span>l<span class="operator">);</span><span class="flow">
+         if</span><span class="operator"> (</span>isValid_SqlRelation<span class="operator">(</span>p<span class="operator">) &amp;&amp; (</span>p<span class="operator"> !=</span> pId<span class="operator">) &amp;&amp; (</span>bCreateTable<span class="operator"> || (</span>p<span class="operator">-&gt;</span>getVersion<span class="operator">() &gt;=</span> lVersion<span class="operator">)))
+         {</span>
+            QString sqlExtraTable<span class="operator"> =</span> p<span class="operator">-&gt;</span>getSqlRelation<span class="operator">()-&gt;</span>createExtraTable<span class="operator">();</span><span class="flow">
+            if</span><span class="operator"> (</span>sqlExtraTable<span class="operator">.</span>isEmpty<span class="operator">()) {</span><span class="flow"> continue</span><span class="operator">; }</span>
+            sql<span class="operator"> +=</span> sqlExtraTable<span class="operator"> +</span><span class="string"> "\n"</span><span class="operator">;
+         }
+      }
+   }</span>
+
+   qDebug<span class="operator">(</span><span class="string">"[QxOrm] start dump SQL schema (%ld)"</span><span class="operator">,</span> lSqlCount<span class="operator">);</span>
+   qDebug<span class="operator">(</span><span class="string">"%s"</span><span class="operator">,</span> qPrintable<span class="operator">(</span>sql<span class="operator">));</span>
+   qDebug<span class="operator">(</span><span class="string">"[QxOrm] %s"</span><span class="operator">,</span><span class="string"> "end dump SQL schema"</span><span class="operator">);</span><span class="flow">
+
+   return</span> sql<span class="operator">;
+}</span><span class="type">
+
+bool</span> QxClassX<span class="operator">::</span>isValid_DataMember<span class="operator">(</span>IxDataMember<span class="operator"> *</span> p<span class="operator">)
+{</span><span class="flow">
+   return</span><span class="operator"> (</span>p<span class="operator"> &amp;&amp;</span> p<span class="operator">-&gt;</span>getDao<span class="operator">() &amp;&amp; !</span> p<span class="operator">-&gt;</span>hasSqlRelation<span class="operator">());
+}</span><span class="type">
+
+bool</span> QxClassX<span class="operator">::</span>isValid_SqlRelation<span class="operator">(</span>IxDataMember<span class="operator"> *</span> p<span class="operator">)
+{</span><span class="type">
+   bool</span> bIsValid<span class="operator"> = (</span>p<span class="operator"> &amp;&amp;</span> p<span class="operator">-&gt;</span>getDao<span class="operator">() &amp;&amp;</span> p<span class="operator">-&gt;</span>hasSqlRelation<span class="operator">());</span><span class="flow">
+   if</span><span class="operator"> (</span>bIsValid<span class="operator">) {</span> p<span class="operator">-&gt;</span>getSqlRelation<span class="operator">()-&gt;</span>init<span class="operator">(); }</span><span class="flow">
+   return</span> bIsValid<span class="operator">;
+}</span></pre>
+</body></html>

doc/qxorm_fr/resource/qxorm_script.js

@@ -0,0 +1,92 @@
+function showHideElementById(id, show) {
+   var obj = document.getElementById(id);
+   var objParent = (obj ? obj.parentNode : null);
+   if (obj && ! show) { obj.style.display = 'none'; }
+   else if (obj) { obj.style.display = 'block'; }
+   if (objParent && ! show) { objParent.style.display = 'none'; }
+   else if (objParent) { objParent.style.display = 'block'; }
+}
+
+(function() {
+   var cx = '017860332352182638653:t-roc8qak5q';
+   var gcse = document.createElement('script');
+   gcse.type = 'text/javascript';
+   gcse.async = true;
+   gcse.src = ((document.location.protocol == 'https:') ? 'https:' : 'http:') + '//cse.google.com/cse.js?cx=' + cx;
+   var s = document.getElementsByTagName('script')[0];
+   s.parentNode.insertBefore(gcse, s);
+})();
+
+function initQxOrmManualWebPage() {
+   // Put an index on each item of table of contents
+   var currLevel1 = 0; var currLevel2 = 0; var currLevel3 = 0;
+   $('#manual_table_of_contents .manual_li_title_1 a').each(function(index, value) {
+      if ($(this).parent().hasClass('manual_li_title_1')) {
+         currLevel1 = (currLevel1 + 1); currLevel2 = 0; currLevel3 = 0;
+         $(this).text(currLevel1 + '. ' + $(this).text());
+      }
+      else if ($(this).parent().hasClass('manual_li_title_2')) {
+         currLevel2 = (currLevel2 + 1); currLevel3 = 0;
+         $(this).text(currLevel1 + '.' + currLevel2 + '. ' + $(this).text());
+      }
+      else if ($(this).parent().hasClass('manual_li_title_3')) {
+         currLevel3 = (currLevel3 + 1);
+         $(this).text(currLevel1 + '.' + currLevel2 + '.' + currLevel3 + '. ' + $(this).text());
+      }
+      else {
+         alert('QxOrm - Manual - Table of contents - level not implemented !');
+      }
+   });
+
+   // Remove default ol/li style
+   $('.manual_li_title_1').css('list-style-type', 'none');
+   $('.manual_li_title_2').css('list-style-type', 'none');
+   $('.manual_li_title_3').css('list-style-type', 'none');
+
+   // Put an index on each paragraph associated to table of contents
+   var currLevel1 = 0; var currLevel2 = 0; var currLevel3 = 0;
+   $('#manual_content a').each(function(index, value) {
+      if ($(this).hasClass('manual_a_title_1')) {
+         currLevel1 = (currLevel1 + 1); currLevel2 = 0; currLevel3 = 0;
+         $(this).text(currLevel1 + '. ' + $(this).text());
+      }
+      else if ($(this).hasClass('manual_a_title_2')) {
+         currLevel2 = (currLevel2 + 1); currLevel3 = 0;
+         $(this).text(currLevel1 + '.' + currLevel2 + '. ' + $(this).text());
+      }
+      else if ($(this).hasClass('manual_a_title_3')) {
+         currLevel3 = (currLevel3 + 1);
+         $(this).text(currLevel1 + '.' + currLevel2 + '.' + currLevel3 + '. ' + $(this).text());
+      }
+   });
+
+   // Iterate over all 'json_pretty' div
+   $('#manual_content .json_pretty').each(function(index, value) {
+      try {
+         var jsonObj = JSON.parse($(this).text());
+         var jsonPretty = JSON.stringify(jsonObj, null, 2);
+         var jsonHighlighted = jsonSyntaxHighlight(jsonPretty);
+         $(this).html(""); $(this).get(0).appendChild(document.createElement('pre')).innerHTML = jsonHighlighted;
+      }
+      catch(exc) { ; }
+   });
+}
+
+function jsonSyntaxHighlight(json) {
+   json = json.replace(/&/g, '&amp;').replace(/</g, '&lt;').replace(/>/g, '&gt;');
+   return json.replace(/("(\\u[a-zA-Z0-9]{4}|\\[^u]|[^\\"])*"(\s*:)?|\b(true|false|null)\b|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?)/g, function (match) {
+      var cls = 'number';
+      if (/^"/.test(match)) {
+         if (/:$/.test(match)) {
+            cls = 'key';
+         } else {
+            cls = 'string';
+         }
+      } else if (/true|false/.test(match)) {
+         cls = 'boolean';
+      } else if (/null/.test(match)) {
+         cls = 'null';
+      }
+      return '<span class="' + cls + '">' + match + '</span>';
+   });
+}

doc/qxorm_fr/resource/qxorm_style.css

@@ -0,0 +1,427 @@
+/* From reset-meyer.css : http://meyerweb.com/eric/tools/css/reset/ */
+html, body, div, span, applet, object, iframe,
+h1, h2, h3, h4, h5, h6, p, blockquote, pre,
+a, abbr, acronym, address, big, cite, code,
+del, dfn, em, img, ins, kbd, q, s, samp,
+small, strike, strong, sub, sup, tt, var,
+b, u, i, center,
+dl, dt, dd, ol, ul, li,
+fieldset, form, label, legend,
+table, caption, tbody, tfoot, thead, tr, th, td,
+article, aside, canvas, details, embed,
+figure, figcaption, footer, header, hgroup,
+menu, nav, output, ruby, section, summary,
+time, mark, audio, video
+{
+   font-family: "Trebuchet MS", Arial, Helvetica, sans-serif;
+}
+
+body
+{
+   background: #FFFFFF ;
+   background-image: url('./background.jpg') ;
+   background-repeat: no-repeat ;
+   background-position: top left ;
+   background-color: FFFFFF ;
+   background-attachment: fixed ;
+}
+
+.comment { color: #008000; font-style: italic; }
+.pre { color: #000099; }
+.string { color: #DF0101; }
+.char { color: #009900; }
+.float { color: #996600; }
+.int { color: #999900; }
+.bool { color: #000000; font-weight: bold; }
+.type { color: #FF6633; }
+.flow { color: #FF0000; }
+.keyword { color: #990000; }
+.operator { color: #663300; font-weight: bold; }
+.operator { color: #663300; font-weight: bold; }
+
+hr
+{
+   border: 0;
+   height: 1px;
+   background: #333;
+   background-image: -webkit-gradient(linear, left, right, from(#ccc), color-stop(1, #333), to(#ccc));
+   background-image: -webkit-linear-gradient(left, #ccc, #333, #ccc);
+   background-image: -moz-linear-gradient(left, #ccc, #333, #ccc);
+   background-image: -ms-linear-gradient(left, #ccc, #333, #ccc);
+   background-image: -o-linear-gradient(left, #ccc, #333, #ccc);
+   background-image: linear-gradient(left, #ccc, #333, #ccc);
+   box-shadow: 1px 1px 2px #D7D7D7;
+}
+
+.btn_nav
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #8f96c9), color-stop(1, #3e3d7a));
+   background: -webkit-linear-gradient(center top, #8f96c9 5%, #3e3d7a 100%);
+   background: -moz-linear-gradient(center top, #8f96c9 5%, #3e3d7a 100%);
+   background: -ms-linear-gradient(top, #8f96c9 5%, #3e3d7a 100%);
+   background: -o-linear-gradient(center top, #8f96c9 5%, #3e3d7a 100%);
+   background: linear-gradient(center top, #8f96c9 5%, #3e3d7a 100%);
+   background-color: #8f96c9;
+   -webkit-border-top-left-radius: 20px;
+   -moz-border-radius-topleft: 20px;
+   border-top-left-radius: 20px;
+   -webkit-border-top-right-radius: 0px;
+   -moz-border-radius-topright: 0px;
+   border-top-right-radius: 0px;
+   -webkit-border-bottom-right-radius: 20px;
+   -moz-border-radius-bottomright: 20px;
+   border-bottom-right-radius: 20px;
+   -webkit-border-bottom-left-radius: 0px;
+   -moz-border-radius-bottomleft: 0px;
+   border-bottom-left-radius: 0px;
+   text-indent: 0px;
+   border: 1px solid #3d4385;
+   display: inline-block;
+   color: #ffffff;
+   font-weight: bold;
+   font-style: normal;
+   height: 35px;
+   line-height: 35px;
+   width: 140px;
+   text-decoration: none;
+   text-align: center;
+   box-shadow: 2px 2px 2px #B9B9B9;
+}
+
+.btn_nav:hover
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #3e3d7a), color-stop(1, #8f96c9));
+   background: -webkit-linear-gradient(center top, #3e3d7a 5%, #8f96c9 100%);
+   background: -moz-linear-gradient(center top, #3e3d7a 5%, #8f96c9 100%);
+   background: -ms-linear-gradient(top, #3e3d7a 5%, #8f96c9 100%);
+   background: -o-linear-gradient(center top, #3e3d7a 5%, #8f96c9 100%);
+   background: linear-gradient(center top, #3e3d7a 5%, #8f96c9 100%);
+   background-color: #3e3d7a;
+}
+
+.btn_nav:active
+{
+   position: relative;
+   top: 1px;
+}
+
+.btn_tuto
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #c4c5d9), color-stop(1, #efeef4));
+   background: -webkit-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: -moz-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: -ms-linear-gradient(top, #c4c5d9 5%, #efeef4 100%);
+   background: -o-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background-color: #c4c5d9;
+   -webkit-border-top-left-radius: 20px;
+   -moz-border-radius-topleft: 20px;
+   border-top-left-radius: 20px;
+   -webkit-border-top-right-radius: 0px;
+   -moz-border-radius-topright: 0px;
+   border-top-right-radius: 0px;
+   -webkit-border-bottom-right-radius: 20px;
+   -moz-border-radius-bottomright: 20px;
+   border-bottom-right-radius: 20px;
+   -webkit-border-bottom-left-radius: 0px;
+   -moz-border-radius-bottomleft: 0px;
+   border-bottom-left-radius: 0px;
+   text-indent: 0px;
+   border: 0px solid #242448;
+   display: inline-block;
+   color: #242448;
+   font-weight: bold;
+   font-style: normal;
+   height: 35px;
+   line-height: 35px;
+   width: 250px;
+   text-decoration: none;
+   text-align: center;
+   box-shadow: 2px 2px 2px #B9B9B9;
+}
+
+.btn_tuto:hover
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #efeef4), color-stop(1, #c4c5d9));
+   background: -webkit-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: -moz-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: -ms-linear-gradient(top, #efeef4 5%, #c4c5d9 100%);
+   background: -o-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background-color: #efeef4;
+   border: 1px solid #242448;
+}
+
+.btn_tuto:active
+{
+   position: relative;
+   top: 1px;
+}
+
+.btn_tuto_selected
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #c4c5d9), color-stop(1, #efeef4));
+   background: -webkit-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: -moz-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: -ms-linear-gradient(top, #c4c5d9 5%, #efeef4 100%);
+   background: -o-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background-color: #c4c5d9;
+   -webkit-border-top-left-radius: 20px;
+   -moz-border-radius-topleft: 20px;
+   border-top-left-radius: 20px;
+   -webkit-border-top-right-radius: 0px;
+   -moz-border-radius-topright: 0px;
+   border-top-right-radius: 0px;
+   -webkit-border-bottom-right-radius: 20px;
+   -moz-border-radius-bottomright: 20px;
+   border-bottom-right-radius: 20px;
+   -webkit-border-bottom-left-radius: 0px;
+   -moz-border-radius-bottomleft: 0px;
+   border-bottom-left-radius: 0px;
+   text-indent: 0px;
+   border: 2px solid #242448;
+   display: inline-block;
+   color: #242448;
+   font-weight: bold;
+   font-style: normal;
+   height: 35px;
+   line-height: 35px;
+   width: 250px;
+   text-decoration: none;
+   text-align: center;
+}
+
+.btn_tuto_selected:hover
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #efeef4), color-stop(1, #c4c5d9));
+   background: -webkit-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: -moz-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: -ms-linear-gradient(top, #efeef4 5%, #c4c5d9 100%);
+   background: -o-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background-color: #efeef4;
+}
+
+.btn_tuto_selected:active
+{
+   position: relative;
+   top: 1px;
+}
+
+.txt_with_shadow
+{
+   text-shadow: 2px 2px 2px #B9B9B9;
+}
+
+.txt_slogan
+{
+   margin: 0;
+   padding: 0;
+   border: 0;
+   font-size: 120%;
+   vertical-align: baseline;
+   text-shadow: 2px 2px 2px #B9B9B9;
+   color: #0B0B61;
+   font-weight: bold;
+}
+
+.img_with_shadow
+{
+   box-shadow: 3px 3px 3px #B9B9B9;
+}
+
+.table_menu_tuto
+{
+   width: 140px;
+   border-spacing: 0px;
+   padding: 0px;
+}
+
+.table_menu_tuto td
+{
+   display: none;
+}
+
+.div_menu_tuto
+{
+   display: none;
+   position: absolute;
+}
+
+.table_menu_manual
+{
+   width: 140px;
+   border-spacing: 0px;
+   padding: 0px;
+}
+
+.table_menu_manual td
+{
+   display: none;
+}
+
+.div_menu_manual
+{
+   display: none;
+   position: absolute;
+}
+
+.btn_sub_menu
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #c4c5d9), color-stop(1, #efeef4));
+   background: -webkit-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: -moz-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: -ms-linear-gradient(top, #c4c5d9 5%, #efeef4 100%);
+   background: -o-linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background: linear-gradient(center top, #c4c5d9 5%, #efeef4 100%);
+   background-color: #c4c5d9;
+   -webkit-border-top-left-radius: 10px;
+   -moz-border-radius-topleft: 10px;
+   border-top-left-radius: 10px;
+   -webkit-border-top-right-radius: 10px;
+   -moz-border-radius-topright: 10px;
+   border-top-right-radius: 10px;
+   -webkit-border-bottom-right-radius: 10px;
+   -moz-border-radius-bottomright: 10px;
+   border-bottom-right-radius: 10px;
+   -webkit-border-bottom-left-radius: 10px;
+   -moz-border-radius-bottomleft: 10px;
+   border-bottom-left-radius: 10px;
+   text-indent: 0px;
+   border: 0px solid #242448;
+   display: inline-block;
+   color: #242448;
+   font-size: 12px;
+   font-weight: bold;
+   font-style: normal;
+   height: 25px;
+   line-height: 25px;
+   width: 140px;
+   text-decoration: none;
+   text-align: center;
+   box-shadow: 2px 2px 2px #B9B9B9;
+}
+
+.btn_sub_menu:hover
+{
+   background: -webkit-gradient(linear, left top, left bottom, color-stop(0.05, #efeef4), color-stop(1, #c4c5d9));
+   background: -webkit-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: -moz-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: -ms-linear-gradient(top, #efeef4 5%, #c4c5d9 100%);
+   background: -o-linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background: linear-gradient(center top, #efeef4 5%, #c4c5d9 100%);
+   background-color: #efeef4;
+   border: 1px solid #242448;
+}
+
+.btn_sub_menu:active
+{
+   position: relative;
+   top: 1px;
+}
+
+#qx_search .cse .gsc-control-cse, #qx_search .gsc-control-cse
+{
+   background-color: transparent;
+   border: 0px;
+   height: 20px;
+   width: 200px;
+}
+
+#qx_search .gsc-search-box-tools .gsc-search-box .gsc-input
+{
+   padding-right: 0px;
+}
+
+#qx_search .gsc-search-button, #qx_search input.gsc-search-button, #qx_search .gsc-search-button-v2
+{
+   width: 15px;
+   min-width: 15px;
+   margin-top: 0px;
+   margin-left: 0px;
+   padding: 6px;
+   border-radius: 6px;
+}
+
+.manual_li_title_1
+{
+   margin-bottom: 15px;
+}
+
+.manual_li_title_2
+{
+   margin-top: 2px;
+   margin-bottom: 2px;
+}
+
+.manual_li_title_1 > a
+{
+   font-size: 130%;
+}
+
+.manual_li_title_2 > a
+{
+   font-size: 100%;
+}
+
+.manual_li_title_3 > a
+{
+   font-size: 80%;
+}
+
+.manual_a_title_1
+{
+   margin-left: 20px;
+   font-size: 180%;
+   font-weight: bold;
+   vertical-align: baseline;
+   text-shadow: 2px 2px 2px #B9B9B9;
+   color: #0B0B61;
+}
+
+.manual_a_title_2
+{
+   margin-left: 60px;
+   font-size: 140%;
+   font-weight: bold;
+   vertical-align: baseline;
+   text-shadow: 2px 2px 2px #B9B9B9;
+   color: #0B0B61;
+}
+
+.manual_a_title_3
+{
+   margin-left: 100px;
+   font-size: 120%;
+   font-weight: bold;
+   vertical-align: baseline;
+   text-shadow: 2px 2px 2px #B9B9B9;
+   color: #0B0B61;
+}
+
+.manual_p_title_1
+{
+   margin-top: 50px;
+}
+
+.manual_div_content_1
+{
+   margin-left: 20px;
+   margin-right: 20px;
+}
+
+.logo_customer
+{
+   width: 100%;
+   max-width: 200px;
+   border-width: 0px;
+}
+
+.json_pretty { width: 1000px; max-height: 300px; overflow: auto; background-color: white; }
+.json_pretty pre { outline: 1px solid #ccc; padding: 5px; margin: 5px; white-space: pre; }
+.json_pretty .string { color: green; }
+.json_pretty .number { color: darkorange; }
+.json_pretty .boolean { color: blue; }
+.json_pretty .null { color: magenta; }
+.json_pretty .key { color: red; }