diff --git a/InstallAndRunCoAuthoring.bat b/InstallAndRunCoAuthoring.bat new file mode 100644 index 00000000..b48ab620 --- /dev/null +++ b/InstallAndRunCoAuthoring.bat @@ -0,0 +1,32 @@ +@ECHO OFF + +SET MONGO_DB_SERVICE_NAME=ASC Mongo DB Server +SET CO_AUTHORING_SERVICE_NAME=ASC CoAuthoring Server +SET SPELLCHECK_SERVICE_NAME=ASC Spellcheck Server +SET INSTAL_SCRIPT_FOLDER=install_script +SET DB_FILE_PATH=data\db + +IF NOT EXIST %~dp0%DB_FILE_PATH% MKDIR %~dp0%DB_FILE_PATH% +@IF NOT "%ERRORLEVEL%"=="0" goto ERROR + +call %~dp0\%INSTAL_SCRIPT_FOLDER%\InstallAndRunService.bat "%MONGO_DB_SERVICE_NAME%" "%~dp0mongodb\bin\mongod.exe --journal --dbpath "%~dp0%DB_FILE_PATH%" +@IF NOT "%ERRORLEVEL%"=="0" goto ERROR + +call %~dp0\%INSTAL_SCRIPT_FOLDER%\ConfigMongoDB.bat +@IF NOT "%ERRORLEVEL%"=="0" goto ERROR + +call %~dp0\%INSTAL_SCRIPT_FOLDER%\InstallNodeJSModules.bat +@IF NOT "%ERRORLEVEL%"=="0" goto ERROR + +call %~dp0\%INSTAL_SCRIPT_FOLDER%\InstallAndRunService.bat "%CO_AUTHORING_SERVICE_NAME%" "node.exe %~dp0sources\server.js" +@IF NOT "%ERRORLEVEL%"=="0" goto ERROR + +call %~dp0\%INSTAL_SCRIPT_FOLDER%\InstallAndRunService.bat "%SPELLCHECK_SERVICE_NAME%" "node.exe %~dp0sources\serverSpellCheck.js" +@IF NOT "%ERRORLEVEL%"=="0" goto ERROR + + +:ERROR +:SUCCESS +pause + +exit /b 0 \ No newline at end of file diff --git a/LICENSE.txt b/LICENSE.txt new file mode 100644 index 00000000..2def0e88 --- /dev/null +++ b/LICENSE.txt @@ -0,0 +1,661 @@ + GNU AFFERO GENERAL PUBLIC LICENSE + Version 3, 19 November 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU Affero General Public License is a free, copyleft license for +software and other kinds of works, specifically designed to ensure +cooperation with the community in the case of network server software. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +our General Public Licenses are intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + Developers that use our General Public Licenses protect your rights +with two steps: (1) assert copyright on the software, and (2) offer +you this License which gives you legal permission to copy, distribute +and/or modify the software. + + A secondary benefit of defending all users' freedom is that +improvements made in alternate versions of the program, if they +receive widespread use, become available for other developers to +incorporate. Many developers of free software are heartened and +encouraged by the resulting cooperation. However, in the case of +software used on network servers, this result may fail to come about. +The GNU General Public License permits making a modified version and +letting the public access it on a server without ever releasing its +source code to the public. + + The GNU Affero General Public License is designed specifically to +ensure that, in such cases, the modified source code becomes available +to the community. It requires the operator of a network server to +provide the source code of the modified version running there to the +users of that server. Therefore, public use of a modified version, on +a publicly accessible server, gives the public access to the source +code of the modified version. + + An older license, called the Affero General Public License and +published by Affero, was designed to accomplish similar goals. This is +a different license, not a version of the Affero GPL, but Affero has +released a new version of the Affero GPL which permits relicensing under +this license. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU Affero General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Remote Network Interaction; Use with the GNU General Public License. + + Notwithstanding any other provision of this License, if you modify the +Program, your modified version must prominently offer all users +interacting with it remotely through a computer network (if your version +supports such interaction) an opportunity to receive the Corresponding +Source of your version by providing access to the Corresponding Source +from a network server at no charge, through some standard or customary +means of facilitating copying of software. This Corresponding Source +shall include the Corresponding Source for any work covered by version 3 +of the GNU General Public License that is incorporated pursuant to the +following paragraph. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the work with which it is combined will remain governed by version +3 of the GNU General Public License. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU Affero General Public License from time to time. Such new versions +will be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU Affero General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU Affero General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU Affero General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU Affero General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU Affero General Public License for more details. + + You should have received a copy of the GNU Affero General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If your software can interact with users remotely through a computer +network, you should also make sure that it provides a way for users to +get its source. For example, if your program is a web application, its +interface could display a "Source" link that leads users to an archive +of the code. There are many ways you could offer source, and different +solutions will be better for different programs; see section 13 for the +specific requirements. + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU AGPL, see +. \ No newline at end of file diff --git a/coauthoring.teamlab.com.txt b/coauthoring.teamlab.com.txt new file mode 100644 index 00000000..880bd1fb --- /dev/null +++ b/coauthoring.teamlab.com.txt @@ -0,0 +1,47 @@ +coauthoring.teamlab.com +50.19.108.255 + +-------------------------------------------------------------- +login: ****************** +password: ****************** + +SSH через PyTTY - http://www.chiark.greenend.org.uk/~sgtatham/putty/download.html +вместо FTP - SFTP через Filezilla - http://filezilla.ru/get/ + +-------------------------------------------------------------- +/home/www/nodejs-coauthoring - здесь размещено приложение +Приложение запущенно через supervisord - он запускает при старте и перезапускает при падении - http://supervisord.org +supervisord запущен от root и сама nodejs тоже работает от root +supervisor.conf - (симлинка) на конфиг приложения в супервизоре + +чтоб перезапустить приложение необходимо выплнить в консоли +>sudo supervisorctl restart nodejs-coauthoring + +чтоб посмотреть статусы приложений +>sudo supervisorctl status + +Создать pem файл(на винде) +>openssl pkcs12 -in "C:\Users\Alexey.Golubev\Documents\teamlab.com-2014.pfx" -out "C:\Users\Alexey.Golubev\Documents\teamlab.com-2014.pem" -nodes +В полученом файле хранится и приватный ключ и сертификат, далее необходимо в ручную разделить его на две части. + +Удалить апач +>sudo /etc/init.d/apache2 stop +>sudo apt-get purge apache2* + +Как развернуть сервер + +Устанавливаем апдейт для apt-get +>apt-get update + +Устанавливаем необходимые тулзы +>apt-get install g++ +>apt-get install mongodb +>apt-get install nodejs npm +>apt-get install supervisor + +Устанавливаем расширения для node.js +>npm install express@2.5.8 +>npm install underscore +>npm install sockjs +>npm install mongodb + diff --git a/documentation/helpMongo.txt b/documentation/helpMongo.txt new file mode 100644 index 00000000..09c14edd --- /dev/null +++ b/documentation/helpMongo.txt @@ -0,0 +1,51 @@ +show dbs - +show collections - +db.createCollection("name_collection") - +db."name_collection".remove() - +db."name_collection".find() - +db."name_collection".drop() - +db."name_collection".insert({_element_}) - +db."name_collection".ensureIndex(_index_) - +db."name_collection".update() - + + +: +http://habrahabr.ru/post/74273/ +http://habrahabr.ru/post/103699/ +http://ru.wiki.mongodb.org/display/DOCS/Manual + + mongodb AWS Market Place. + +- . + : https://aws.amazon.com/marketplace/pp/B0087GMEQ2/ref=srh_res_product_title?ie=UTF8&sr=0-3&qid=1362476550209 +MongoDB with EBS RAID +Sold by: 10gen + + MongoDB Security Group : +TCP 22 +TCP 27017 + VPC, security group . + + SSH : +$ sudo chkconfig mongod on +$ sudo /etc/init.d/mongod start + http://docs.mongodb.org/ecosystem/tutorial/install-mongodb-on-amazon-ec2/#starting-mongodb + + +mongo coAuthoring +> db.createCollection("messages") +> db.messages.ensureIndex({"docid":1}) +> db.createCollection("changes") +> db.changes.ensureIndex({"docid":1}) +> exit + + - c VPC. , . . + + SSH Amazon'e + (Key Pair). + ( ) /home/root/cert/key_pair.pem ( SFTP) + : +chmod 600 /home/root/cert/key_pair.pem ( SFTP) + SSH: +ssh internal_ip -i /home/root/cert/key_pair.pem -l ec2-user + diff --git a/install_script/ConfigMongoDB.bat b/install_script/ConfigMongoDB.bat new file mode 100644 index 00000000..c1e1f143 --- /dev/null +++ b/install_script/ConfigMongoDB.bat @@ -0,0 +1,20 @@ +ECHO OFF +SET DB_CONFIG_FILE=config_db.tmp +SET DB_NAME=coAuthoring + +ECHO. +ECHO ---------------------------------------- +ECHO Configure %DB_NAME% database +ECHO ---------------------------------------- + +ECHO db.createCollection("messages") > %DB_CONFIG_FILE% +ECHO db.messages.ensureIndex({"docid":1}) >> %DB_CONFIG_FILE% +ECHO db.createCollection("changes") >> %DB_CONFIG_FILE% +ECHO db.changes.ensureIndex({"docid":1}) >> %DB_CONFIG_FILE% +ECHO exit >> %DB_CONFIG_FILE% + +call %~dp0..\mongodb\bin\mongo.exe %DB_NAME% < %DB_CONFIG_FILE% || exit /b 1 + +DEL /Q %DB_CONFIG_FILE% + +exit /b 0 \ No newline at end of file diff --git a/install_script/InstallAndRunService.bat b/install_script/InstallAndRunService.bat new file mode 100644 index 00000000..de511a17 --- /dev/null +++ b/install_script/InstallAndRunService.bat @@ -0,0 +1,53 @@ +ECHO OFF +SET RUN_FOLDER=%CD% +SET SERVICE_NAME=%1 +SET SERVICE_NAME=%SERVICE_NAME:"=% +SET EXE_PATH=%2 +SET EXE_PATH=%EXE_PATH:"=% + +rem ECHO. +rem ECHO ---------------------------------------- +rem ECHO Check is the script run under administrator %RUN_FOLDER% +rem ECHO ---------------------------------------- + +rem if not "%RUN_FOLDER%"=="%WinDir%\system32" GOTO ERROR + +SET INSTSRV=instsrv.exe +SET WINDOWS_RESOURCE_KIT_SUBPATH=Windows Resource Kits\Tools +SET WINDOWS_RESOURCE_KIT_PATH=%ProgramFiles(x86)%\%WINDOWS_RESOURCE_KIT_SUBPATH% + +SET TMP_REG_FILE=tmp.reg + +if not exist "%WINDOWS_RESOURCE_KIT_PATH%\%INSTSRV%" SET WINDOWS_RESOURCE_KIT_PATH=%ProgramFiles%\%WINDOWS_RESOURCE_KIT_SUBPATH% + +if not exist "%WINDOWS_RESOURCE_KIT_PATH%\%INSTSRV%" goto ERROR + +CD /D "%WINDOWS_RESOURCE_KIT_PATH%" || goto ERROR + +ECHO. +ECHO ---------------------------------------- +ECHO Install %EXE_PATH% as "%SERVICE_NAME%" service +ECHO ---------------------------------------- + +"%WINDOWS_RESOURCE_KIT_PATH%\%INSTSRV%" "%SERVICE_NAME%" "%WINDOWS_RESOURCE_KIT_PATH%\srvany.exe" || goto ERROR + +ECHO Windows Registry Editor Version 5.00 > %TMP_REG_FILE% +ECHO [HKEY_LOCAL_MACHINE\SYSTEM\CurrentControlSet\services\%SERVICE_NAME%\Parameters] >> %TMP_REG_FILE% +ECHO "Application"="%EXE_PATH:\=\\%" >> %TMP_REG_FILE% + +regedit.exe /s %TMP_REG_FILE% || goto ERROR + +ECHO. +ECHO ---------------------------------------- +ECHO Start "%SERVICE_NAME%" service +ECHO ---------------------------------------- +call sc start "%SERVICE_NAME%" || goto ERROR + +DEL %TMP_REG_FILE% +CD /D %RUN_FOLDER% + +:SUCCESS +exit /b 0 + +:ERROR +exit /b 1 diff --git a/install_script/InstallNodeJSDebugModule.bat b/install_script/InstallNodeJSDebugModule.bat new file mode 100644 index 00000000..56d570b3 --- /dev/null +++ b/install_script/InstallNodeJSDebugModule.bat @@ -0,0 +1,16 @@ +ECHO OFF + +SET RUN_FOLDER=%CD% + +CD /D %~dp0..\ || exit /b 1 + +ECHO. +ECHO ---------------------------------------- +ECHO Install node.js module debug +ECHO ---------------------------------------- + +call npm install node-inspector || exit /b 1 + +CD /D %RUN_FOLDER% || exit /b 1 + +exit /b 0 diff --git a/install_script/InstallNodeJSModules.bat b/install_script/InstallNodeJSModules.bat new file mode 100644 index 00000000..bab41a8b --- /dev/null +++ b/install_script/InstallNodeJSModules.bat @@ -0,0 +1,20 @@ +ECHO OFF + +SET RUN_FOLDER=%CD% + +CD /D %~dp0..\ || exit /b 1 + +ECHO. +ECHO ---------------------------------------- +ECHO Install node.js modules +ECHO ---------------------------------------- + +call npm install express@2.5.8 || exit /b 1 +call npm install underscore || exit /b 1 +call npm install sockjs || exit /b 1 +call npm install mongodb@1.1.4 || exit /b 1 +call npm install log4js || exit /b 1 + +CD /D %RUN_FOLDER% || exit /b 1 + +exit /b 0 diff --git a/install_script/InstallNodeJSSpellCheck.bat b/install_script/InstallNodeJSSpellCheck.bat new file mode 100644 index 00000000..14d4de5c --- /dev/null +++ b/install_script/InstallNodeJSSpellCheck.bat @@ -0,0 +1,28 @@ +ECHO OFF + +SET RUN_FOLDER=%CD% + +CD /D %~dp0..\ || exit /b 1 + +ECHO. +ECHO ---------------------------------------- +ECHO Install node.js module spellCheck (nodehun) +ECHO ---------------------------------------- + +call npm install express@2.5.8 || exit /b 1 +call npm install sockjs || exit /b 1 +call npm install log4js || exit /b 1 + +call npm install -g node-gyp || exit /b 1 +call npm install nodehun@0.0.5 || exit /b 1 + +COPY nodehun\nodehun.cpp node_modules\nodehun\src\nodehun.cpp +COPY nodehun\replist.hxx node_modules\nodehun\src\hunspell\src\hunspell\replist.hxx + +cd /D node_modules\nodehun\src || exit /b 1 +call node-gyp configure || exit /b 1 +call node-gyp build || exit /b 1 + +CD /D %RUN_FOLDER% || exit /b 1 + +exit /b 0 diff --git a/install_script/StartMongoDb.bat b/install_script/StartMongoDb.bat new file mode 100644 index 00000000..702d6dbd --- /dev/null +++ b/install_script/StartMongoDb.bat @@ -0,0 +1,5 @@ +SET DB_FILE_PATH=..\data\db +IF NOT EXIST %DB_FILE_PATH% MKDIR %DB_FILE_PATH% + +call ..\mongodb\bin\mongod.exe --journal --dbpath "%DB_FILE_PATH%" +pause \ No newline at end of file diff --git a/install_script/StartNodeInspector.bat b/install_script/StartNodeInspector.bat new file mode 100644 index 00000000..8a6df49d --- /dev/null +++ b/install_script/StartNodeInspector.bat @@ -0,0 +1,2 @@ +call node-inspector --web-port=8080 & +pause \ No newline at end of file diff --git a/install_script/StartServer.bat b/install_script/StartServer.bat new file mode 100644 index 00000000..d9d0038b --- /dev/null +++ b/install_script/StartServer.bat @@ -0,0 +1,2 @@ +call node --debug ../sources/server.js +pause \ No newline at end of file diff --git a/install_script/StartSpellChecker.bat b/install_script/StartSpellChecker.bat new file mode 100644 index 00000000..0d7a6e77 --- /dev/null +++ b/install_script/StartSpellChecker.bat @@ -0,0 +1,2 @@ +call node --debug ../sources/serverSpellCheck.js +pause \ No newline at end of file diff --git a/nodehun/nodehun.cpp b/nodehun/nodehun.cpp new file mode 100644 index 00000000..5adbc57e --- /dev/null +++ b/nodehun/nodehun.cpp @@ -0,0 +1,377 @@ +#include "license.nodehun" +#include "nodehun.hpp" +#include +#include +#include + +using namespace v8; + +bool Nodehun::dictionaryDirectoryExists(const char *file){ + static uv_loop_t* loop = uv_default_loop(); + uv_fs_t open_req; + uv_fs_t close_req; + uv_fs_open(loop, &open_req, file, O_RDONLY, 0, NULL); + if(open_req.result == -1){ + uv_fs_close(loop, &close_req, open_req.result, NULL); + uv_fs_req_cleanup(&open_req); + uv_fs_req_cleanup(&close_req); + return false; + } + uv_fs_close(loop, &close_req, open_req.result, NULL); + if(close_req.result == -1){ + uv_fs_req_cleanup(&open_req); + uv_fs_req_cleanup(&close_req); + return false; + } + uv_fs_req_cleanup(&open_req); + uv_fs_req_cleanup(&close_req); + return true; +} + +Persistent Nodehun::SpellDictionary::constructor; + +void Nodehun::SpellDictionary::Init(Handle target) { + HandleScope scope; + + Local tpl = FunctionTemplate::New(New); + Local name = String::NewSymbol("Dictionary"); + + constructor = Persistent::New(tpl); + constructor->InstanceTemplate()->SetInternalFieldCount(5); + constructor->SetClassName(name); + + NODE_SET_PROTOTYPE_METHOD(constructor, "spellSuggest", spellSuggest); + NODE_SET_PROTOTYPE_METHOD(constructor, "spellSuggestions", spellSuggestions); + NODE_SET_PROTOTYPE_METHOD(constructor,"addDictionary", addDictionary); + NODE_SET_PROTOTYPE_METHOD(constructor,"addWord", addWord); + NODE_SET_PROTOTYPE_METHOD(constructor,"removeWord", removeWord); + + target->Set(name, constructor->GetFunction()); +} + +Nodehun::SpellDictionary::SpellDictionary(const char *language){ + std::string path, affPath, dicPath; + path.append(Nodehun::_dictionariesPath); + path.append(language); + path.append(__SLASH__); + path.append(language); + + affPath.append(path); + dicPath.append(path); + affPath.append(".aff"); + dicPath.append(".dic"); + + pathsExist = Nodehun::dictionaryDirectoryExists(affPath.c_str()) && Nodehun::dictionaryDirectoryExists(dicPath.c_str()); + if(pathsExist) + spellClass = new Hunspell(affPath.c_str(), dicPath.c_str(),NULL,false); +} + +Nodehun::SpellDictionary::SpellDictionary(const char *affbuf, const char *dictbuf){ + pathsExist = true; + spellClass = new Hunspell(affbuf, dictbuf,NULL,false); +} + +Handle Nodehun::SpellDictionary::New(const Arguments& args) { + HandleScope scope; + int argl = args.Length(); + if (!args.IsConstructCall()) + return ThrowException(Exception::TypeError(String::New("Use the new operator to create instances of this object."))); + if(argl < 1 || !args[0]->IsString()) + return ThrowException(Exception::TypeError(String::New("First argument must be a string."))); + + String::Utf8Value arg0(args[0]->ToString()); + Nodehun::SpellDictionary * obj; + if(argl == 1 || argl > 1 && !args[1]->IsString()){ + obj = new Nodehun::SpellDictionary(*arg0); + if(!obj->pathsExist) + return ThrowException(Exception::TypeError(String::New("No such dictionary exists."))); + } + else { + String::Utf8Value arg1(args[1]->ToString()); + obj = new Nodehun::SpellDictionary(*arg0,*arg1); + if(!obj->pathsExist) + return ThrowException(Exception::TypeError(String::New("There was an error compiling either the affix or dictionary file you passed. Perhaps one or both of them is invalid."))); + } + obj->Wrap(args.This()); + return args.This(); +} + +Handle Nodehun::SpellDictionary::spellSuggest(const Arguments& args) { + HandleScope scope; + if (args.Length() < 2) + return ThrowException(Exception::TypeError(String::New("Missing required arguments."))); + if(!args[0]->IsString()) + return ThrowException(Exception::TypeError(String::New("First argument must be a string."))); + if(!args[1]->IsFunction()) + return ThrowException(Exception::TypeError(String::New("Second argument must be a function."))); + + Nodehun::SpellDictionary* obj = ObjectWrap::Unwrap(args.This()); + + String::Utf8Value arg0(args[0]->ToString()); + Local callback = Local::Cast(args[1]); + + Nodehun::SpellData* spellData = new Nodehun::SpellData(); + spellData->request.data = spellData; + spellData->callback = Persistent::New(callback); + spellData->word.append(*arg0); + + spellData->spellClass = obj->spellClass; + spellData->multiple = false; + uv_queue_work(uv_default_loop(), &spellData->request, + Nodehun::SpellDictionary::CheckSuggestions, Nodehun::SpellDictionary::SendSuggestions); + return Undefined(); +} + +Handle Nodehun::SpellDictionary::spellSuggestions(const Arguments& args) { + HandleScope scope; + if (args.Length() < 2) + return ThrowException(Exception::TypeError(String::New("Missing required arguments."))); + if(!args[0]->IsString()) + return ThrowException(Exception::TypeError(String::New("First argument must be a string."))); + if(!args[1]->IsFunction()) + return ThrowException(Exception::TypeError(String::New("Second argument must be a function."))); + + Nodehun::SpellDictionary* obj = ObjectWrap::Unwrap(args.This()); + + String::Utf8Value arg0(args[0]->ToString()); + Local callback = Local::Cast(args[1]); + + Nodehun::SpellData* spellData = new Nodehun::SpellData(); + spellData->request.data = spellData; + spellData->callback = Persistent::New(callback); + spellData->word.append(*arg0); + + spellData->spellClass = obj->spellClass; + spellData->multiple = true; + uv_queue_work(uv_default_loop(), &spellData->request, + Nodehun::SpellDictionary::CheckSuggestions, Nodehun::SpellDictionary::SendSuggestions); + return Undefined(); +} + +void Nodehun::SpellDictionary::CheckSuggestions(uv_work_t* request) { + Nodehun::SpellData* spellData = static_cast(request->data); + spellData->wordCorrect = spellData->spellClass->spell(spellData->word.c_str()); + if (!spellData->wordCorrect && spellData->multiple) + spellData->numSuggest = spellData->spellClass->suggest(&(spellData->suggestions),spellData->word.c_str()); + else + spellData->numSuggest = 0; +} + +void Nodehun::SpellDictionary::SendSuggestions(uv_work_t* request){ + HandleScope scope; + Nodehun::SpellData* spellData = static_cast(request->data); + + const unsigned argc = 2; + Local argv[argc]; + argv[0] = Local::New(Boolean::New(spellData->wordCorrect)); + if(spellData->wordCorrect || spellData->numSuggest == 0){ + if(spellData->multiple) + argv[1] = Array::New(0); + else + argv[1] = Local::New(Null()); + } + else if(spellData->numSuggest > 0){ + if(spellData->multiple){ + Local suglist = Array::New(spellData->numSuggest); + for(int i = 0; i < spellData->numSuggest; i++) + suglist->Set(i,String::New(spellData->suggestions[i])); + argv[1] = suglist; + } + else{ + argv[1] = String::New(spellData->suggestions[0]); + } + spellData->spellClass->free_list(&(spellData->suggestions),spellData->numSuggest); + spellData->suggestions = NULL; + } + + TryCatch try_catch; + spellData->callback->Call(Context::GetCurrent()->Global(), argc, argv); + if (try_catch.HasCaught()) + node::FatalException(try_catch); + spellData->callback.Dispose(); + delete spellData; +} + +Handle Nodehun::SpellDictionary::addDictionary(const Arguments& args) { + HandleScope scope; + int argl = args.Length(); + if (argl < 1 || !args[0]->IsString()) + return ThrowException(Exception::TypeError(String::New("First argument must be a string."))); + + Nodehun::SpellDictionary* obj = ObjectWrap::Unwrap(args.This()); + Nodehun::DictData* dictData = new Nodehun::DictData(); + String::Utf8Value arg0(args[0]->ToString()); + dictData->notpath = false; + dictData->callbackExists = false; + + if(argl > 1 && args[1]->IsFunction()){ + Local callback = Local::Cast(args[1]); + dictData->callback = Persistent::New(callback); + dictData->callbackExists = true; + } + else if(argl > 1 && args[1]->IsBoolean()){ + dictData->notpath = args[1]->BooleanValue(); + } + + if(!dictData->callbackExists && argl > 2 && args[2]->IsFunction()){ + Local callback = Local::Cast(args[2]); + dictData->callback = Persistent::New(callback); + dictData->callbackExists = true; + } + + + + if(!dictData->notpath){ + dictData->path.append(Nodehun::_dictionariesPath); + dictData->path.append(*arg0); + dictData->path.append(__SLASH__); + dictData->path.append(*arg0); + dictData->path.append(".dic"); + } + + dictData->dict = (char*)malloc(strlen(*arg0)+1); + strcpy(dictData->dict,*arg0); + dictData->spellClass = obj->spellClass; + dictData->request.data = dictData; + + uv_queue_work(uv_default_loop(), &dictData->request, + Nodehun::SpellDictionary::addDictionaryWork, Nodehun::SpellDictionary::addDictionaryFinish); + return Undefined(); +} + +void Nodehun::SpellDictionary::addDictionaryWork(uv_work_t* request){ + Nodehun::DictData* dictData = static_cast(request->data); + + if(!dictData->notpath && !Nodehun::dictionaryDirectoryExists(dictData->path.c_str())){ + dictData->success = false; + } + else{ + int status = dictData->spellClass->add_dic(dictData->dict,dictData->notpath); + dictData->success = status == 0; + } +} + +void Nodehun::SpellDictionary::addDictionaryFinish(uv_work_t* request){ + HandleScope scope; + Nodehun::DictData* dictData = static_cast(request->data); + + if(dictData->callbackExists){ + const unsigned argc = 2; + Local argv[argc]; + argv[0] = Local::New(Boolean::New(dictData->success)); + argv[1] = Local::New(String::New(dictData->dict)); + TryCatch try_catch; + dictData->callback->Call(Context::GetCurrent()->Global(), argc, argv); + if (try_catch.HasCaught()) { + node::FatalException(try_catch); + } + dictData->callback.Dispose(); + } + free(dictData->dict); + delete dictData; +} + +Handle Nodehun::SpellDictionary::addWord(const Arguments& args) { + HandleScope scope; + + if (args.Length() < 1 || !args[0]->IsString()) + return ThrowException(Exception::TypeError(String::New("First argument must be a string."))); + + Nodehun::SpellDictionary* obj = ObjectWrap::Unwrap(args.This()); + String::Utf8Value arg0(args[0]->ToString()); + Nodehun::WordData* wordData = new Nodehun::WordData(); + if(args.Length() > 1 && args[1]->IsFunction()){ + Local callback = Local::Cast(args[1]); + wordData->callback = Persistent::New(callback); + wordData->callbackExists = true; + } + else{ + wordData->callbackExists = false; + } + //add word + wordData->removeWord = false; + wordData->word.append(*arg0); + wordData->spellClass = obj->spellClass; + wordData->request.data = wordData; + + uv_queue_work(uv_default_loop(), &wordData->request, + Nodehun::SpellDictionary::addRemoveWordWork, Nodehun::SpellDictionary::addRemoveWordFinish); + return Undefined(); +} + +Handle Nodehun::SpellDictionary::removeWord(const Arguments& args) { + HandleScope scope; + + if (args.Length() < 1 || !args[0]->IsString()) + return ThrowException(Exception::TypeError(String::New("First argument must be a string."))); + + Nodehun::SpellDictionary* obj = ObjectWrap::Unwrap(args.This()); + String::Utf8Value arg0(args[0]->ToString()); + Nodehun::WordData* wordData = new Nodehun::WordData(); + if(args.Length() > 1 && args[1]->IsFunction()){ + Local callback = Local::Cast(args[1]); + wordData->callback = Persistent::New(callback); + wordData->callbackExists = true; + } + else{ + wordData->callbackExists = false; + } + //remove word + wordData->removeWord = true; + wordData->word.append(*arg0); + wordData->spellClass = obj->spellClass; + wordData->request.data = wordData; + + uv_queue_work(uv_default_loop(), &wordData->request, + Nodehun::SpellDictionary::addRemoveWordWork, Nodehun::SpellDictionary::addRemoveWordFinish); + return Undefined(); +} + +void Nodehun::SpellDictionary::addRemoveWordWork(uv_work_t* request){ + Nodehun::WordData* wordData = static_cast(request->data); + int status; + if(wordData->removeWord) + status = wordData->spellClass->remove(wordData->word.c_str()); + else + status = wordData->spellClass->add(wordData->word.c_str()); + wordData->success = status == 0; +} + +void Nodehun::SpellDictionary::addRemoveWordFinish(uv_work_t* request){ + HandleScope scope; + Nodehun::WordData* wordData = static_cast(request->data); + + if(wordData->callbackExists){ + const unsigned argc = 2; + Local argv[argc]; + argv[0] = Local::New(Boolean::New(wordData->success)); + argv[1] = Local::New(String::New(wordData->word.c_str())); + TryCatch try_catch; + wordData->callback->Call(Context::GetCurrent()->Global(), argc, argv); + + if (try_catch.HasCaught()) + node::FatalException(try_catch); + + wordData->callback.Dispose(); + } + delete wordData; +} + +Handle Nodehun::SetDictionariesPath(const Arguments& args) { + HandleScope scope; + if (args.Length() < 1 || !args[0]->IsString()) + return ThrowException(Exception::TypeError(String::New("First argument must be a string."))); + + String::Utf8Value arg0(args[0]->ToString()); + Nodehun::_dictionariesPath = *arg0; + return scope.Close(Undefined()); +} + +void Nodehun::RegisterModule(Handle target) { + HandleScope scope; + SpellDictionary::Init(target); + target->Set(String::NewSymbol("_setDictionariesPath"), + FunctionTemplate::New(Nodehun::SetDictionariesPath)->GetFunction()); +} + +NODE_MODULE(nodehun, Nodehun::RegisterModule); diff --git a/nodehun/replist.hxx b/nodehun/replist.hxx new file mode 100644 index 00000000..da79ea9a --- /dev/null +++ b/nodehun/replist.hxx @@ -0,0 +1,28 @@ +/* string replacement list class */ +#ifndef _REPLIST_HXX_ +#define _REPLIST_HXX_ + +#include "hunvisapi.h" + +#include "w_char.hxx" + +#undef near +class LIBHUNSPELL_DLL_EXPORTED RepList +{ +protected: + replentry ** dat; + int size; + int pos; + +public: + RepList(int n); + ~RepList(); + + int get_pos(); + int add(char * pat1, char * pat2); + replentry * item(int n); + int near(const char * word); + int match(const char * word, int n); + int conv(const char * word, char * dest); +}; +#endif diff --git a/readme.txt b/readme.txt new file mode 100644 index 00000000..bc594cda --- /dev/null +++ b/readme.txt @@ -0,0 +1,27 @@ +1. nodeJS nodejs.org +2. mongoDB mongodb.org mongodb + + : , . + + : +. microsoft Windows Server 2003 Resource Kit Tools +. InstallAndRunCoAuthoring.bat . + : + - , (mongodb). + - , coAuthoring , . + - db.createCollection("messages"). + - db.messages.ensureIndex({"docid":1}). + - db.createCollection("changes"). + - db.changes.ensureIndex({"docid":1}). + - node.js. + + : + . : + - , install_script\ConfigMongoDB.bat + - node.js, install_script\InstallNodeJSModules.bat + . (mongodb), install_script\StartMongoDb.bat + . node.js install_script\StartServer.bat + + : + - Python 2.7.3 http://www.python.org/download/releases/2.7.3/#download + - InstallNodeJSSpellCheck.bat \ No newline at end of file diff --git a/sources/DocsCoServer.js b/sources/DocsCoServer.js new file mode 100644 index 00000000..eed1fab2 --- /dev/null +++ b/sources/DocsCoServer.js @@ -0,0 +1,865 @@ +var sockjs = require('sockjs'), + _ = require('underscore'), + dataBase = null, + http = require('http'), + config = require('./config.json'); +if (config["mongodb"]) + dataBase = require('./database'); + +var logger = require('./logger'); + +var c_oAscRecalcIndexTypes = { + RecalcIndexAdd: 1, + RecalcIndexRemove: 2 +}; + +var c_oAscLockTypeElem = { + Range: 1, + Object: 2, + Sheet: 3 +}; +var c_oAscLockTypeElemSubType = { + DeleteColumns: 1, + InsertColumns: 2, + DeleteRows: 3, + InsertRows: 4, + ChangeProperties: 5 +}; + +function CRecalcIndexElement(recalcType, position, bIsSaveIndex) { + if ( !(this instanceof CRecalcIndexElement) ) { + return new CRecalcIndexElement (recalcType, position, bIsSaveIndex); + } + + this._recalcType = recalcType; // Тип изменений (удаление или добавление) + this._position = position; // Позиция, в которой произошли изменения + this._count = 1; // Считаем все изменения за простейшие + this.m_bIsSaveIndex = !!bIsSaveIndex; // Это индексы из изменений других пользователей (которые мы еще не применили) + + return this; +} + +CRecalcIndexElement.prototype = { + constructor: CRecalcIndexElement, + + // Пересчет для других + getLockOther: function (position, type) { + var inc = (c_oAscRecalcIndexTypes.RecalcIndexAdd === this._recalcType) ? +1 : -1; + if (position === this._position && c_oAscRecalcIndexTypes.RecalcIndexRemove === this._recalcType && + true === this.m_bIsSaveIndex) { + // Мы еще не применили чужие изменения (поэтому для insert не нужно отрисовывать) + // RecalcIndexRemove (потому что перевертываем для правильной отработки, от другого пользователя + // пришло RecalcIndexAdd + return null; + } else if (position === this._position && + c_oAscRecalcIndexTypes.RecalcIndexRemove === this._recalcType && + c_oAscLockTypes.kLockTypeMine === type && false === this.m_bIsSaveIndex) { + // Для пользователя, который удалил столбец, рисовать залоченные ранее в данном столбце ячейки + // не нужно + return null; + } else if (position < this._position) + return position; + else + return (position + inc); + }, + // Пересчет для других (только для сохранения) + getLockSaveOther: function (position, type) { + if (this.m_bIsSaveIndex) + return position; + + var inc = (c_oAscRecalcIndexTypes.RecalcIndexAdd === this._recalcType) ? +1 : -1; + if (position === this._position && c_oAscRecalcIndexTypes.RecalcIndexRemove === this._recalcType && + true === this.m_bIsSaveIndex) { + // Мы еще не применили чужие изменения (поэтому для insert не нужно отрисовывать) + // RecalcIndexRemove (потому что перевертываем для правильной отработки, от другого пользователя + // пришло RecalcIndexAdd + return null; + } else if (position === this._position && + c_oAscRecalcIndexTypes.RecalcIndexRemove === this._recalcType && + c_oAscLockTypes.kLockTypeMine === type && false === this.m_bIsSaveIndex) { + // Для пользователя, который удалил столбец, рисовать залоченные ранее в данном столбце ячейки + // не нужно + return null; + } else if (position < this._position) + return position; + else + return (position + inc); + }, + // Пересчет для себя + getLockMe: function (position) { + var inc = (c_oAscRecalcIndexTypes.RecalcIndexAdd === this._recalcType) ? -1 : +1; + if (position < this._position) + return position; + else + return (position + inc); + }, + // Только когда от других пользователей изменения (для пересчета) + getLockMe2: function (position) { + var inc = (c_oAscRecalcIndexTypes.RecalcIndexAdd === this._recalcType) ? -1 : +1; + if (true !== this.m_bIsSaveIndex || position < this._position) + return position; + else + return (position + inc); + } +}; + +function CRecalcIndex() { + if ( !(this instanceof CRecalcIndex) ) { + return new CRecalcIndex (); + } + + this._arrElements = []; // Массив CRecalcIndexElement + + return this; +} + +CRecalcIndex.prototype = { + constructor: CRecalcIndex, + add: function (recalcType, position, count, bIsSaveIndex) { + for (var i = 0; i < count; ++i) + this._arrElements.push(new CRecalcIndexElement(recalcType, position, bIsSaveIndex)); + }, + clear: function () { + this._arrElements.length = 0; + }, + + // Пересчет для других + getLockOther: function (position, type) { + var newPosition = position; + var count = this._arrElements.length; + for (var i = 0; i < count; ++i) { + newPosition = this._arrElements[i].getLockOther(newPosition, type); + if (null === newPosition) + break; + } + + return newPosition; + }, + // Пересчет для других (только для сохранения) + getLockSaveOther: function (position, type) { + var newPosition = position; + var count = this._arrElements.length; + for (var i = 0; i < count; ++i) { + newPosition = this._arrElements[i].getLockSaveOther(newPosition, type); + if (null === newPosition) + break; + } + + return newPosition; + }, + // Пересчет для себя + getLockMe: function (position) { + var newPosition = position; + var count = this._arrElements.length; + for (var i = count - 1; i >= 0; --i) { + newPosition = this._arrElements[i].getLockMe(newPosition); + if (null === newPosition) + break; + } + + return newPosition; + }, + // Только когда от других пользователей изменения (для пересчета) + getLockMe2: function (position) { + var newPosition = position; + var count = this._arrElements.length; + for (var i = count - 1; i >= 0; --i) { + newPosition = this._arrElements[i].getLockMe2(newPosition); + if (null === newPosition) + break; + } + + return newPosition; + } +}; + +exports.install = function (server, callbackFunction) { + 'use strict'; + var sockjs_opts = {sockjs_url:"http://cdn.sockjs.org/sockjs-0.3.min.js"}, + sockjs_echo = sockjs.createServer(sockjs_opts), + connections = [], + messages = {}, + objchanges = {}, + indexuser = {}, + locks = {}, + arrsavelock = [], + dataHandler, + urlParse = new RegExp("^/doc/([0-9-.a-zA-Z_=]*)/c.+", 'i'), + serverPort = 80; + + sockjs_echo.on('connection', function (conn) { + if (null == conn) { + logger.error ("null == conn"); + return; + } + conn.on('data', function (message) { + try { + var data = JSON.parse(message); + dataHandler[data.type](conn, data); + } catch (e) { + logger.error("error receiving response:" + e); + } + + }); + conn.on('error', function () { + logger.error("On error"); + }); + conn.on('close', function () { + var connection = this, docLock, userLocks, i, participants, reconected; + + logger.info("Connection closed or timed out"); + //Check if it's not already reconnected + + //Notify that participant has gone + connections = _.reject(connections, function (el) { + return el.connection.id === connection.id;//Delete this connection + }); + reconected = _.any(connections, function (el) { + return el.connection.sessionId === connection.sessionId;//This means that client is reconected + }); + + var state = (false == reconected) ? false : undefined; + participants = getParticipants(conn.docId); + sendParticipantsState(participants, state, connection.userId, connection.userName); + + if (!reconected) { + // Для данного пользователя снимаем лок с сохранения + if (undefined != arrsavelock[conn.docId] && connection.userId == arrsavelock[conn.docId].user) { + arrsavelock[conn.docId] = undefined; + } + + participants = getParticipants(conn.docId); + // Если у нас нет пользователей, то удаляем все сообщения + if (0 >= participants.length) { + // remove messages from dataBase + if (dataBase) + dataBase.remove ("messages", {docid:conn.docId}); + // remove messages from memory + delete messages[conn.docId]; + + // ToDo Send changes to save server + if (objchanges[conn.docId] && 0 < objchanges[conn.docId].length) + sendChangesToServer(conn.serverHost, conn.serverPath, conn.docId); + + // remove changes from dataBase + if (dataBase) + dataBase.remove ("changes", {docid:conn.docId}); + // remove changes from memory + delete objchanges[conn.docId]; + + // На всякий случай снимаем lock + arrsavelock[conn.docId] = undefined; + } + + //Давайдосвиданья! + //Release locks + docLock = locks[connection.docId]; + if (docLock) { + userLocks = []; + + if ("array" === typeOf (docLock)) { + for (var nIndex = 0; nIndex < docLock.length; ++nIndex) { + if (docLock[nIndex].sessionId === connection.sessionId) { + userLocks.push(docLock[nIndex]); + docLock.splice(nIndex, 1); + --nIndex; + } + } + } else { + for (var keyLockElem in docLock) { + if (docLock[keyLockElem].sessionId === connection.sessionId) { + userLocks.push(docLock[keyLockElem]); + delete docLock[keyLockElem]; + } + } + } + + _.each(participants, function (participant) { + sendData(participant.connection, {type:"releaselock", locks:_.map(userLocks, function (e) { + return { + block:e.block, + user:e.user, + time:Date.now(), + changes:null + }; + })}); + }); + } + } + }); + }); + + function sendData(conn, data) { + conn.write(JSON.stringify(data)); + } + + function sendParticipantsState(participants, stateConnect, _userId, _userName) { + _.each(participants, function (participant) { + sendData(participant.connection, {type:"participants", + participants:_.chain(connections).filter( + function (el) { + return el.connection.docId === participant.connection.docId && el.connection.userId !== participant.connection.userId; + }).map( + function (conn) { + return {id: conn.connection.userId, username: conn.connection.userName, + isviewermode: conn.connection.isViewerMode}; + }).value() + }); + + sendData(participant.connection, {type:"connectstate", + state: stateConnect, + id: _userId, + username: _userName + }); + }); + } + + function sendParticipantsIsViewerMode(participants, isViewerMode, _userId, _userName) { + _.each(participants, function (participant) { + sendData(participant.connection, {type:"participants", + participants:_.chain(connections).filter( + function (el) { + return el.connection.docId === participant.connection.docId && el.connection.userId !== participant.connection.userId; + }).map( + function (conn) { + return {id: conn.connection.userId, username: conn.connection.userName, + isviewermode: conn.connection.isViewerMode}; + }).value() + }); + + sendData(participant.connection, {type:"isviewermode", + isviewermode: isViewerMode, + id: _userId, + username: _userName + }); + }); + } + + function getParticipants(docId, exludeuserId) { + return _.filter(connections, function (el) { + return el.connection.docId === docId && el.connection.userId !== exludeuserId; + }); + } + + function sendChangesToServer(serverHost, serverPath, docId) { + if (!serverHost || !serverPath) + return; + // Пошлем пока только информацию о том, что нужно сбросить кеш + var options = { + host: serverHost, + port: serverPort, + path: serverPath, + method: 'POST' + }; + + var req = http.request(options, function(res) { + res.setEncoding('utf8'); + }); + + req.on('error', function(e) { + logger.warn('problem with request on server: ' + e.message); + }); + + var sendData = JSON.stringify({"id": docId, "c": "cc", "t": "", "v": ""}); + + // write data to request body + req.write(sendData); + req.end(); + } + + // Пересчет только для чужих Lock при сохранении на клиенте, который добавлял/удалял строки или столбцы + function _recalcLockArray (userId, _locks, oRecalcIndexColumns, oRecalcIndexRows) { + var count = _locks.length; + var element = null, oRangeOrObjectId = null; + var i; + var sheetId = -1; + + for (i = 0; i < count; ++i) { + // Для самого себя не пересчитываем + if (userId === _locks[i].user) + continue; + element = _locks[i].block; + if (c_oAscLockTypeElem.Range !== element["type"] || + c_oAscLockTypeElemSubType.InsertColumns === element["subType"] || + c_oAscLockTypeElemSubType.InsertRows === element["subType"]) + continue; + sheetId = element["sheetId"]; + + oRangeOrObjectId = element["rangeOrObjectId"]; + + if (oRecalcIndexColumns.hasOwnProperty(sheetId)) { + // Пересчет колонок + oRangeOrObjectId["c1"] = oRecalcIndexColumns[sheetId].getLockMe2(oRangeOrObjectId["c1"]); + oRangeOrObjectId["c2"] = oRecalcIndexColumns[sheetId].getLockMe2(oRangeOrObjectId["c2"]); + } + if (oRecalcIndexRows.hasOwnProperty(sheetId)) { + // Пересчет строк + oRangeOrObjectId["r1"] = oRecalcIndexRows[sheetId].getLockMe2(oRangeOrObjectId["r1"]); + oRangeOrObjectId["r2"] = oRecalcIndexRows[sheetId].getLockMe2(oRangeOrObjectId["r2"]); + } + } + } + + function _addRecalcIndex (oRecalcIndex) { + var nIndex = 0; + var nRecalcType = c_oAscRecalcIndexTypes.RecalcIndexAdd; + var oRecalcIndexElement = null; + var oRecalcIndexResult = {}; + + for (var sheetId in oRecalcIndex) { + if (oRecalcIndex.hasOwnProperty(sheetId)) { + if (!oRecalcIndexResult.hasOwnProperty(sheetId)) { + oRecalcIndexResult[sheetId] = new CRecalcIndex(); + } + for (; nIndex < oRecalcIndex[sheetId]._arrElements.length; ++nIndex) { + oRecalcIndexElement = oRecalcIndex[sheetId]._arrElements[nIndex]; + if (true === oRecalcIndexElement.m_bIsSaveIndex) + continue; + nRecalcType = (c_oAscRecalcIndexTypes.RecalcIndexAdd === oRecalcIndexElement._recalcType) ? + c_oAscRecalcIndexTypes.RecalcIndexRemove : c_oAscRecalcIndexTypes.RecalcIndexAdd; + // Дублируем для возврата результата (нам нужно пересчитать только по последнему индексу + oRecalcIndexResult[sheetId].add(nRecalcType, oRecalcIndexElement._position, + oRecalcIndexElement._count, /*bIsSaveIndex*/true); + } + } + } + + return oRecalcIndexResult; + } + + function compareExcelBlock(newBlock, oldBlock) { + // Это lock для удаления или добавления строк/столбцов + if (null !== newBlock.subType && null !== oldBlock.subType) + return true; + + // Не учитываем lock от ChangeProperties (только если это не lock листа) + if (c_oAscLockTypeElemSubType.ChangeProperties === oldBlock.subType + && c_oAscLockTypeElem.Sheet !== newBlock.type) + return false; + + var resultLock = false; + if (newBlock.type === c_oAscLockTypeElem.Range) { + if (oldBlock.type === c_oAscLockTypeElem.Range) { + // Не учитываем lock от Insert + if (c_oAscLockTypeElemSubType.InsertRows === oldBlock.subType || c_oAscLockTypeElemSubType.InsertColumns === oldBlock.subType) { + resultLock = false; + } else if (isInterSection(newBlock.rangeOrObjectId, oldBlock.rangeOrObjectId)) { + resultLock = true; + } + } else if (oldBlock.type === c_oAscLockTypeElem.Sheet) { + resultLock = true; + } + } else if (newBlock.type === c_oAscLockTypeElem.Sheet) { + resultLock = true; + } else if (newBlock.type === c_oAscLockTypeElem.Object) { + if (oldBlock.type === c_oAscLockTypeElem.Sheet) { + resultLock = true; + } else if (oldBlock.type === c_oAscLockTypeElem.Object && oldBlock.rangeOrObjectId === newBlock.rangeOrObjectId) { + resultLock = true; + } + } + return resultLock; + } + + function isInterSection(range1, range2) { + if (range2.c1 > range1.c2 || range2.c2 < range1.c1 || range2.r1 > range1.r2 || range2.r2 < range1.r1) + return false; + return true; + } + + // Тип объекта + function typeOf(obj) { + if (obj === undefined) {return "undefined";} + if (obj === null) {return "null";} + return Object.prototype.toString.call(obj).slice(8, -1).toLowerCase(); + } + + + dataHandler = (function () { + function auth(conn, data) { + //TODO: Do authorization etc. check md5 or query db + if (data.token && data.user) { + + //Parse docId + var parsed = urlParse.exec(conn.url); + if (parsed.length > 1) { + conn.docId = parsed[1]; + } else { + //TODO: Send some shit back + } + + conn.sessionState = 1; + conn.userId = data.user; + conn.userName = data.username; + conn.isViewerMode = data.isviewermode; + conn.serverHost = data.serverHost; + conn.serverPath = data.serverPath; + //Set the unique ID + if (data.sessionId !== null && _.isString(data.sessionId) && data.sessionId !== "") { + logger.info("restored old session id=" + data.sessionId); + + //Kill previous connections + connections = _.reject(connections, function (el) { + return el.connection.sessionId === data.sessionId;//Delete this connection + }); + conn.sessionId = data.sessionId;//restore old + + } else { + conn.sessionId = conn.id; + } + connections.push({connection:conn}); + var participants = getParticipants(data.docid, data.user); + + // Увеличиваем индекс обращения к документу + if (!indexuser.hasOwnProperty(conn.docId)) { + indexuser[conn.docId] = 1; + } else { + indexuser[conn.docId] += 1; + } + + sendData(conn, + { + type:"auth", + result:1, + sessionId:conn.sessionId, + participants:_.map(participants, function (conn) { + return {id: conn.connection.userId, username: conn.connection.userName, + isviewermode: conn.connection.isViewerMode}; + }), + messages:messages[data.docid], + locks:locks[conn.docId], + changes:objchanges[conn.docId], + indexuser:indexuser[conn.docId] + });//Or 0 if fails + sendParticipantsState(participants, true, data.user, data.username); + } + } + + function message(conn, data) { + var participants = getParticipants(conn.docId), + msg = {docid:conn.docId, message:data.message, time:Date.now(), user:conn.userId, username:conn.userName}; + + if (!messages.hasOwnProperty(conn.docId)) { + messages[conn.docId] = [msg]; + } else { + messages[conn.docId].push(msg); + } + + // insert in dataBase + logger.info("database insert message: " + JSON.stringify(msg)); + if (dataBase) + dataBase.insert ("messages", msg); + + _.each(participants, function (participant) { + sendData(participant.connection, {type:"message", messages:[msg]}); + }); + } + + function getlock(conn, data) { + var participants = getParticipants(conn.docId), documentLocks, currentLock; + if (!locks.hasOwnProperty(conn.docId)) { + locks[conn.docId] = {}; + } + documentLocks = locks[conn.docId]; + + // Data is array now + var arrayBlocks = data.block; + var isLock = false; + var i = 0; + var lengthArray = (arrayBlocks) ? arrayBlocks.length : 0; + for (; i < lengthArray; ++i) { + logger.info("getLock id: " + arrayBlocks[i]); + if (documentLocks.hasOwnProperty(arrayBlocks[i]) && documentLocks[arrayBlocks[i]] !== null) { + isLock = true; + break; + } + } + if (0 === lengthArray) + isLock = true; + + if (!isLock) { + //Ok. take lock + for (i = 0; i < lengthArray; ++i) { + documentLocks[arrayBlocks[i]] = {time:Date.now(), user:conn.userId, block:arrayBlocks[i], sessionId:conn.sessionId}; + } + } + + _.each(participants, function (participant) { + sendData(participant.connection, {type:"getlock", locks:locks[conn.docId]}); + }); + } + + // Для Excel block теперь это объект { sheetId, type, rangeOrObjectId, guid } + function getlockrange(conn, data) { + var participants = getParticipants(conn.docId), documentLocks, currentLock; + if (!locks.hasOwnProperty(conn.docId)) { + locks[conn.docId] = []; + } + documentLocks = locks[conn.docId]; + + // Data is array now + var arrayBlocks = data.block; + var isLock = false; + var isExistInArray = false; + var i = 0, blockRange = null; + var lengthArray = (arrayBlocks) ? arrayBlocks.length : 0; + for (; i < lengthArray && false === isLock; ++i) { + blockRange = arrayBlocks[i]; + for (var keyLockInArray in documentLocks) { + if (true === isLock) + break; + // Проверка вхождения объекта в массив (текущий пользователь еще раз прислал lock) + if (documentLocks[keyLockInArray].user === conn.userId && + blockRange.sheetId === documentLocks[keyLockInArray].block.sheetId && + blockRange.type === c_oAscLockTypeElem.Object && + documentLocks[keyLockInArray].block.type === c_oAscLockTypeElem.Object && + documentLocks[keyLockInArray].block.rangeOrObjectId === blockRange.rangeOrObjectId) { + isExistInArray = true; + break; + } + + if (c_oAscLockTypeElem.Sheet === blockRange.type && + c_oAscLockTypeElem.Sheet === documentLocks[keyLockInArray].block.type) { + // Если текущий пользователь прислал lock текущего листа, то не заносим в массив, а если нового, то заносим + if (documentLocks[keyLockInArray].user === conn.userId) { + if (blockRange.sheetId === documentLocks[keyLockInArray].block.sheetId) { + // уже есть в массиве + isExistInArray = true; + break; + } else { + // новый лист + continue; + } + } else { + // Если кто-то залочил sheet, то больше никто не может лочить sheet-ы (иначе можно удалить все листы) + isLock = true; + break; + } + } + + if (documentLocks[keyLockInArray].user === conn.userId || !(documentLocks[keyLockInArray].block) || + blockRange.sheetId !== documentLocks[keyLockInArray].block.sheetId) + continue; + isLock = compareExcelBlock(blockRange, documentLocks[keyLockInArray].block); + } + } + if (0 === lengthArray) + isLock = true; + + if (!isLock && !isExistInArray) { + //Ok. take lock + for (i = 0; i < lengthArray; ++i) { + blockRange = arrayBlocks[i]; + documentLocks.push({time:Date.now(), user:conn.userId, block:blockRange, sessionId:conn.sessionId}); + } + } + + _.each(participants, function (participant) { + sendData(participant.connection, {type:"getlock", locks:locks[conn.docId]}); + }); + } + + // Для Excel необходимо делать пересчет lock-ов при добавлении/удалении строк/столбцов + function savechanges(conn, data) { + var docLock, userLocks, participants; + //Release locks + if (data.endSaveChanges) { + docLock = locks[conn.docId]; + if (docLock) { + if ("array" === typeOf (docLock)) { + userLocks = []; + for (var nIndex = 0; nIndex < docLock.length; ++nIndex) { + if (null !== docLock[nIndex] && docLock[nIndex].sessionId === conn.sessionId) { + userLocks.push(docLock[nIndex]); + docLock.splice(nIndex, 1); + --nIndex; + } + } + } else { + userLocks = _.filter(docLock, function (el) { + return el !== null && el.sessionId === conn.sessionId; + }); + for (var i = 0; i < userLocks.length; i++) { + delete docLock[userLocks[i].block]; + } + } + } + } else { + userLocks = []; + } + + var objchange = {docid:conn.docId, changes:data.changes, time:Date.now(), user:conn.userId}; + if (!objchanges.hasOwnProperty(conn.docId)) { + objchanges[conn.docId] = [objchange]; + } else { + objchanges[conn.docId].push(objchange); + } + // insert in dataBase + logger.info("database insert changes: " + JSON.stringify(objchange)); + if (dataBase) + dataBase.insert ("changes", objchange); + + if (!data.endSaveChanges) { + sendData(conn, {type:"savePartChanges"}); + } else { + if (data.isExcel) { + var oElement = null; + var oRecalcIndexColumns = null, oRecalcIndexRows = null; + var oChanges = JSON.parse(data.changes); + var nCount = oChanges.length; + var nIndexChanges = 0; + for (; nIndexChanges < nCount; ++nIndexChanges) { + oElement = oChanges[nIndexChanges]; + if ("object" === typeof oElement) { + if ("0" === oElement["type"]) { + // Это мы получили recalcIndexColumns + oRecalcIndexColumns = _addRecalcIndex(oElement["index"]); + } else if ("1" === oElement["type"]) { + // Это мы получили recalcIndexRows + oRecalcIndexRows = _addRecalcIndex(oElement["index"]); + } + } + + // Теперь нужно пересчитать индексы для lock-элементов + if (null !== oRecalcIndexColumns && null !== oRecalcIndexRows) { + _recalcLockArray(conn.userId, locks[conn.docId], oRecalcIndexColumns, oRecalcIndexRows); + + oRecalcIndexColumns = null; + oRecalcIndexRows = null; + break; + } + } + } + } + + participants = getParticipants(conn.docId, conn.userId); + _.each(participants, function (participant) { + sendData(participant.connection, {type:"savechanges", changes:data.changes, locks:_.map(userLocks, function (e) { + return { + block:e.block, + user:e.user, + time:Date.now(), + changes:null + }; + })}); + }); + } + + // Можем ли мы сохранять ? + function issavelock(conn, data) { + var _docId = conn.docId; + var _userId = conn.userId; + var _time = Date.now(); + var isSaveLock = (undefined === arrsavelock[conn.docId]) ? false : arrsavelock[conn.docId].savelock; + if (false === isSaveLock) { + arrsavelock[conn.docId] = {docid:conn.docId, savelock:true, time:Date.now(), user:conn.userId}; + var _tmpsavelock = arrsavelock; + // Вдруг не придет unlock, пустим timeout на lock 60 секунд + setTimeout(function () { + if (_tmpsavelock[_docId] && _userId == _tmpsavelock[_docId].user && _time == _tmpsavelock[_docId].time) { + _tmpsavelock[_docId] = undefined; + + var participants = getParticipants(_docId); + _.each(participants, function (participant) { + sendData(participant.connection, {type:"unsavelock"}); + }); + } + }, 60000); + } + + var participants = getParticipants(conn.docId); + _.each(participants, function (participant) { + sendData(participant.connection, {type:"savelock", savelock:isSaveLock}); + }); + } + // Снимаем лок с сохранения + function unsavelock(conn, data) { + if (undefined != arrsavelock[conn.docId] && conn.userId != arrsavelock[conn.docId].user) { + // Не можем удалять не свой лок + return; + } + arrsavelock[conn.docId] = undefined; + + var participants = getParticipants(conn.docId); + _.each(participants, function (participant) { + sendData(participant.connection, {type:"unsavelock"}); + }); + } + // Выставляем режим редактирования или просмотра + function setisviewermode(conn, data) { + if (data && conn.isViewerMode != data.isviewermode) { + conn.isViewerMode = data.isviewermode; + var participants = getParticipants(conn.docId); + sendParticipantsIsViewerMode (participants, conn.isViewerMode, conn.userId, conn.userName); + } + } + // Возвращаем все сообщения для документа + function getmessages(conn, data) { + sendData(conn, {type:"message", messages:messages[conn.docId]}); + } + // Возвращаем всех пользователей для документа + function getusers(conn, data) { + var participants = getParticipants(conn.docId, conn.userId); + + sendData(conn, + { + type:"getusers", + participants:_.map(participants, function (conn) { + return {id: conn.connection.userId, username: conn.connection.userName, + isviewermode: conn.connection.isViewerMode}; + }) + }); + } + + return { + auth:auth, + message:message, + getlock:getlock, + getlockrange:getlockrange, + savechanges:savechanges, + issavelock:issavelock, + unsavelock:unsavelock, + setisviewermode:setisviewermode, + getmessages:getmessages, + getusers:getusers + }; + }()); + + + sockjs_echo.installHandlers(server, {prefix:'/doc/[0-9-.a-zA-Z_=]*/c', log:function (severity, message) { + //TODO: handle severity + logger.info(message); + }}); + + var callbackLoadMessages = (function (arrayElements){ + if (null != arrayElements) + { + messages = arrayElements; + + // remove all messages from dataBase + if (dataBase) + dataBase.remove ("messages", {}); + } + if (dataBase) + dataBase.load ("changes", callbackLoadChanges); + else + callbackLoadChanges(null); + }); + + var callbackLoadChanges = (function (arrayElements){ + if (null != arrayElements) + { + // ToDo Send changes to save server + + // remove all changes from dataBase + if (dataBase) + dataBase.remove ("changes", {}); + } + callbackFunction (); + }); + + if (dataBase) + dataBase.load ("messages", callbackLoadMessages); + else + callbackLoadMessages(null); +}; \ No newline at end of file diff --git a/sources/config.json b/sources/config.json new file mode 100644 index 00000000..d10af14c --- /dev/null +++ b/sources/config.json @@ -0,0 +1,23 @@ +{ + "server": { + "port": 3000, + "mode": "development" + }, + "log": { + "appenders": [ + { + "type": "console" + }, + { + "type": "file", + "filename": "../logs/coauthoring.log" + } + ], + "replaceConsole": "true" + }, + "mongodb": { + "host": "localhost", + "port": 27017, + "database": "coAuthoring" + } +} \ No newline at end of file diff --git a/sources/config.ssl.json b/sources/config.ssl.json new file mode 100644 index 00000000..629ea357 --- /dev/null +++ b/sources/config.ssl.json @@ -0,0 +1,24 @@ +{ + "server": { + "port": 443, + "mode": "production" + }, + "log": { + "appenders": [ + { + "type": "file", + "filename": "../logs/coauthoring.log" + } + ], + "replaceConsole": "true" + }, + "mongodb": { + "host": "10.0.1.102", + "port": 27017, + "database": "coAuthoring" + }, + "ssl":{ + "key": "../cert/privatekey.pem", + "cert": "../cert/certificate.pem" + } +} \ No newline at end of file diff --git a/sources/configSpellCheck.json b/sources/configSpellCheck.json new file mode 100644 index 00000000..ece9cf5c --- /dev/null +++ b/sources/configSpellCheck.json @@ -0,0 +1,18 @@ +{ + "server": { + "port": 4000, + "mode": "development" + }, + "log": { + "appenders": [ + { + "type": "console" + }, + { + "type": "file", + "filename": "../logs/spellCheck.log" + } + ], + "replaceConsole": "true" + } +} \ No newline at end of file diff --git a/sources/database.js b/sources/database.js new file mode 100644 index 00000000..e316586c --- /dev/null +++ b/sources/database.js @@ -0,0 +1 @@ +var mongoDB = require('mongodb'); var config = require('./config.json'); var _errorConnection = true; var logger = require('./logger'); function CreateDbClient(){ return new mongoDB.Db(config['mongodb']['database'], new mongoDB.Server(config['mongodb']['host'], config['mongodb']['port'], {auto_reconnect: true}), {safe:false}); } exports.insert = function (_collectionName, _newElement) { var _db = CreateDbClient(); if (!_db) { logger.error ("Error _db"); return; } // _db.open (function (err, db) { if (!err) { // . , db.collection(_collectionName, function(err, collection) { if (!err) { collection.insert (_newElement); } else { logger.error ("Error collection"); return; } db.close(); }); } else { logger.error ("Error open database"); return; } }); }; exports.remove = function (_collectionName, _removeElements) { var _db = CreateDbClient(); if (!_db) { logger.error ("Error _db"); return; } // _db.open (function (err, db) { if (!err) { // . , db.collection(_collectionName, function(err, collection) { if (!err) { collection.remove (_removeElements, function(err, collection) { // logger.info ("All elements remove"); }); } else { logger.error ("Error collection"); return; } db.close(); }); } else { logger.error ("Error open database"); return; } }); }; exports.load = function (_collectionName, callbackFunction) { var _db = CreateDbClient(); if (!_db) { logger.error ("Error _db"); return callbackFunction (null); } var result = []; // _db.open (function (err, db) { // . , db.collection(_collectionName, function(err, collection) { // find() collection.find(function(err, cursor) { cursor.each(function(err, item) { // Null if (item != null) { if (!result.hasOwnProperty (item.docid)) result[item.docid] = [item]; else result[item.docid].push(item); } else callbackFunction (result); }); db.close(); }); }); }); }; \ No newline at end of file diff --git a/sources/logger.js b/sources/logger.js new file mode 100644 index 00000000..daef5556 --- /dev/null +++ b/sources/logger.js @@ -0,0 +1,25 @@ +var config = require('./config.json'); + +var log4js = require('log4js'); +log4js.configure(config['log']); + +var logger = log4js.getLogger(); + +exports.trace = function (){ + return logger.trace.apply(logger, Array.prototype.slice.call(arguments)); +}; +exports.debug = function (){ + return logger.debug.apply(logger, Array.prototype.slice.call(arguments)); +}; +exports.info = function (){ + return logger.info.apply(logger, Array.prototype.slice.call(arguments)); +}; +exports.warn = function (){ + return logger.warn.apply(logger, Array.prototype.slice.call(arguments)); +}; +exports.error = function (){ + return logger.error.apply(logger, Array.prototype.slice.call(arguments)); +}; +exports.fatal = function (){ + return logger.fatal.apply(logger, Array.prototype.slice.call(arguments)); +}; diff --git a/sources/server.js b/sources/server.js new file mode 100644 index 00000000..56416b2f --- /dev/null +++ b/sources/server.js @@ -0,0 +1,47 @@ +var config = require('./config.json'); + +process.env.NODE_ENV = config['server']['mode']; + +var logger = require('./logger'); + +// 2. Express server +var express = require('express'); +var app = {}; + +if(config['ssl']) +{ + var fs = require("fs"); + var privateKey = fs.readFileSync(config['ssl']['key']).toString(); + var certificate = fs.readFileSync(config['ssl']['cert']).toString(); + app = express.createServer({key: privateKey, cert:certificate}); +} +else +{ + app = express.createServer(); +} + +app.configure(function(){ + app.use(express.bodyParser()); + app.use(express.methodOverride()); + app.use(express.static(__dirname + '/public')); +}); + +app.configure('development', function () { + app.use(express.errorHandler({ dumpExceptions: true, showStack: true })); +}); + +app.configure('production', function(){ + app.use(express.errorHandler()); +}); + +var docsCoServer = require('./DocsCoServer'); + +docsCoServer.install(app, function(){ + app.listen(config['server']['port'], function(){ + logger.info("Express server listening on port %d in %s mode", app.address().port, app.settings.env); + }); + + app.get('/index.html', function(req, res) { + res.send('Server is functioning normally'); + }); +}); diff --git a/sources/serverSpellCheck.js b/sources/serverSpellCheck.js new file mode 100644 index 00000000..aa8b178e --- /dev/null +++ b/sources/serverSpellCheck.js @@ -0,0 +1,47 @@ +var config = require('./configSpellCheck.json'); + +process.env.NODE_ENV = config['server']['mode']; + +var logger = require('./logger'); + +// 2. Express server +var express = require('express'); +var app = {}; + +if(config['ssl']) +{ + var fs = require("fs"); + var privateKey = fs.readFileSync(config['ssl']['key']).toString(); + var certificate = fs.readFileSync(config['ssl']['cert']).toString(); + app = express.createServer({key: privateKey, cert:certificate}); +} +else +{ + app = express.createServer(); +} + +app.configure(function(){ + app.use(express.bodyParser()); + app.use(express.methodOverride()); + app.use(express.static(__dirname + '/public')); +}); + +app.configure('development', function () { + app.use(express.errorHandler({ dumpExceptions: true, showStack: true })); +}); + +app.configure('production', function(){ + app.use(express.errorHandler()); +}); + +var spellCheck = require('./spellCheck'); + +spellCheck.install(app, function(){ + app.listen(config['server']['port'], function(){ + logger.info("Express server listening on port %d in %s mode", app.address().port, app.settings.env); + }); + + app.get('/index.html', function(req, res) { + res.send('Server is functioning normally'); + }); +}); diff --git a/sources/spellCheck.js b/sources/spellCheck.js new file mode 100644 index 00000000..350cadc8 --- /dev/null +++ b/sources/spellCheck.js @@ -0,0 +1,104 @@ +var sockjs = require('sockjs'), + nodehun = require('nodehun'); +var arrDictionaries = {}; + +// Add en_US +arrDictionaries["1033"] = new nodehun.Dictionary(__dirname + '/Dictionaries/en_US/en_US.aff', + __dirname + './Dictionaries/en_US/en_US.dic'); +// Add ru_RU +arrDictionaries["1049"] = new nodehun.Dictionary(__dirname + './Dictionaries/ru_RU/ru_RU.aff', + __dirname + './Dictionaries/ru_RU/ru_RU.dic'); +// Add de_DE_frami +arrDictionaries["1031"] = new nodehun.Dictionary(__dirname + './Dictionaries/de_DE_frami/de_DE_frami.aff', + __dirname + './Dictionaries/de_DE_frami/de_DE_frami.dic'); + +var logger = require('./logger'); + +exports.install = function (server, callbackFunction) { + 'use strict'; + var sockjs_opts = {sockjs_url:"http://cdn.sockjs.org/sockjs-0.3.min.js"}, + sockjs_echo = sockjs.createServer(sockjs_opts), + dataHandler; + + sockjs_echo.on('connection', function (conn) { + if (null == conn) { + logger.error ("null == conn"); + return; + } + conn.on('data', function (message) { + try { + var data = JSON.parse(message); + dataHandler[data.type](conn, data); + } catch (e) { + logger.error("error receiving response:" + e); + } + + }); + conn.on('error', function () { + logger.error("On error"); + }); + conn.on('close', function () { + logger.info("Connection closed or timed out"); + }); + }); + + function sendData(conn, data) { + conn.write(JSON.stringify(data)); + } + + dataHandler = (function () { + function spellCheck(conn, data) { + function checkEnd() { + if (0 === data.usrWordsLength) { + //data.end = new Date(); + //console.log("time - " + (data.end.getTime() - data.start.getTime())); + sendData(conn, { type:"spellCheck", spellCheckData:JSON.stringify(data) }); + } + } + function spellSuggest(index, word, lang) { + var oDictionary = arrDictionaries[lang]; + if (undefined === oDictionary) { + data.usrCorrect[index] = false; + --data.usrWordsLength; + checkEnd(); + } + + if ("spell" === data.type) { + oDictionary.spellSuggest(word, function (a, b) { + data.usrCorrect[index] = a; + --data.usrWordsLength; + checkEnd(); + }); + } else if ("suggest" === data.type) { + oDictionary.spellSuggestions(word, function (a, b) { + data.usrSuggest[index] = b; + --data.usrWordsLength; + checkEnd(); + }); + } + } + + data = JSON.parse(data.spellCheckData); + // Ответ + data.usrCorrect = []; + data.usrSuggest = []; + data.usrWordsLength = data.usrWords.length; + + //data.start = new Date(); + for (var i = 0, length = data.usrWords.length; i < length; ++i) { + spellSuggest(i, data.usrWords[i], data.usrLang[i]); + } + } + + return { + spellCheck:spellCheck + }; + }()); + + sockjs_echo.installHandlers(server, {prefix:'/doc/[0-9-.a-zA-Z_=]*/c', log:function (severity, message) { + //TODO: handle severity + logger.info(message); + }}); + + callbackFunction(); +}; \ No newline at end of file