From eaf52ce2c7876d4acdf8758941ad151a7a998634 Mon Sep 17 00:00:00 2001 From: Tony Garnock-Jones Date: Thu, 1 Nov 2018 15:32:29 +0000 Subject: [PATCH] Extracted into https://github.com/syndicate-lang/syndicate-js-core --- ijs/.gitignore | 4 - ijs/Makefile | 13 - ijs/README.md | 22 - ijs/examples/box-and-client.js | 84 -- ijs/gpl-3.0.txt | 674 ------------- ijs/package-lock.json | 1614 -------------------------------- ijs/package.json | 26 - ijs/src/assertions.js | 29 - ijs/src/bag.js | 123 --- ijs/src/dataflow.js | 125 --- ijs/src/dataspace.js | 538 ----------- ijs/src/index.js | 41 - ijs/src/mapset.js | 44 - ijs/src/skeleton.js | 342 ------- ijs/src/special.js | 26 - ijs/src/struct.js | 169 ---- ijs/test/test-bag.js | 131 --- ijs/test/test-dataflow.js | 209 ----- ijs/test/test-dataspace.js | 65 -- ijs/test/test-skeleton.js | 252 ----- 20 files changed, 4531 deletions(-) delete mode 100644 ijs/.gitignore delete mode 100644 ijs/Makefile delete mode 100644 ijs/README.md delete mode 100644 ijs/examples/box-and-client.js delete mode 100644 ijs/gpl-3.0.txt delete mode 100644 ijs/package-lock.json delete mode 100644 ijs/package.json delete mode 100644 ijs/src/assertions.js delete mode 100644 ijs/src/bag.js delete mode 100644 ijs/src/dataflow.js delete mode 100644 ijs/src/dataspace.js delete mode 100644 ijs/src/index.js delete mode 100644 ijs/src/mapset.js delete mode 100644 ijs/src/skeleton.js delete mode 100644 ijs/src/special.js delete mode 100644 ijs/src/struct.js delete mode 100644 ijs/test/test-bag.js delete mode 100644 ijs/test/test-dataflow.js delete mode 100644 ijs/test/test-dataspace.js delete mode 100644 ijs/test/test-skeleton.js diff --git a/ijs/.gitignore b/ijs/.gitignore deleted file mode 100644 index da86d7b..0000000 --- a/ijs/.gitignore +++ /dev/null @@ -1,4 +0,0 @@ -scratch/ -node_modules/ -.nyc_output/ -coverage/ \ No newline at end of file diff --git a/ijs/Makefile b/ijs/Makefile deleted file mode 100644 index 5f73abd..0000000 --- a/ijs/Makefile +++ /dev/null @@ -1,13 +0,0 @@ -.PHONY: all clean veryclean test - -all: - npm install . - -clean: - rm -f dist/*.js - -veryclean: clean - rm -rf node_modules/ - -test: - npm test diff --git a/ijs/README.md b/ijs/README.md deleted file mode 100644 index b06d521..0000000 --- a/ijs/README.md +++ /dev/null @@ -1,22 +0,0 @@ -# @syndicate-lang/core - -An implementation of the *Dataspace* model that underpins the -[Syndicate](https://syndicate-lang.org/) language design. - -## Licence - -@syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -Copyright (C) 2016-2018 Tony Garnock-Jones - -This program is free software: you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation, either version 3 of the License, or -(at your option) any later version. - -This program is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. - -You should have received a copy of the GNU General Public License -along with this program. If not, see . diff --git a/ijs/examples/box-and-client.js b/ijs/examples/box-and-client.js deleted file mode 100644 index eb494c9..0000000 --- a/ijs/examples/box-and-client.js +++ /dev/null @@ -1,84 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -const Immutable = require('immutable'); -const Syndicate = require('../src/index.js'); -const Skeleton = Syndicate.Skeleton; -const Dataspace = Syndicate.Dataspace; -const Struct = Syndicate.Struct; -const __ = Syndicate.__; -const _$ = Syndicate._$; - -const BoxState = Struct.makeConstructor('BoxState', ['value']); -const SetBox = Struct.makeConstructor('SetBox', ['newValue']); - -const N = 100000; - -console.time('box-and-client-' + N.toString()); - -let ds = new Dataspace(() => { - Dataspace.spawn('box', function () { - Dataspace.declareField(this, 'value', 0); - Dataspace.currentFacet().addEndpoint(() => { - return [BoxState(this.value), null]; - }); - Dataspace.currentFacet().addDataflow(() => { - if (this.value === N) { - Dataspace.currentFacet().stop(() => { - console.log('terminated box root facet'); - }); - } - }); - Dataspace.currentFacet().addEndpoint(() => { - let handler = Skeleton.analyzeAssertion(SetBox(_$)); - handler.callback = Dataspace.wrap((evt, vs) => { - if (evt === Skeleton.EVENT_MESSAGE) { - Dataspace.currentFacet().actor.scheduleScript(() => { - this.value = vs.get(0); - // console.log('box updated value', vs.get(0)); - }); - } - }); - return [Syndicate.Observe(SetBox(_$)), handler]; - }); - }); - - Dataspace.spawn('client', () => { - Dataspace.currentFacet().addEndpoint(() => { - let handler = Skeleton.analyzeAssertion(BoxState(_$)); - handler.callback = Dataspace.wrap((evt, vs) => { - if (evt === Skeleton.EVENT_ADDED) { - Dataspace.currentFacet().actor.scheduleScript(() => { - // console.log('client sending SetBox', vs.get(0) + 1); - Dataspace.send(SetBox(vs.get(0) + 1)); - }); - } - }); - return [Syndicate.Observe(BoxState(_$)), handler]; - }); - }); -}); - -// console.log('--- starting ---'); -while (ds.runScripts()) { - // console.log('--- runScripts boundary ---'); -} -// console.log('--- done ---'); - -console.timeEnd('box-and-client-' + N.toString()); diff --git a/ijs/gpl-3.0.txt b/ijs/gpl-3.0.txt deleted file mode 100644 index f288702..0000000 --- a/ijs/gpl-3.0.txt +++ /dev/null @@ -1,674 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 3, 29 June 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 General Public License is a free, copyleft license for -software and other kinds of works. - - The licenses for most software and other practical works are designed -to take away your freedom to share and change the works. By contrast, -the GNU General Public License is intended to guarantee your freedom to -share and change all versions of a program--to make sure it remains free -software for all its users. We, the Free Software Foundation, use the -GNU General Public License for most of our software; it applies also to -any other work released this way by its authors. You can apply it to -your programs, too. - - When we speak of free software, we are referring to freedom, not -price. Our General Public Licenses are designed to make sure that you -have the freedom to distribute copies of free software (and charge for -them if you wish), that you receive source code or can get it if you -want it, that you can change the software or use pieces of it in new -free programs, and that you know you can do these things. - - To protect your rights, we need to prevent others from denying you -these rights or asking you to surrender the rights. Therefore, you have -certain responsibilities if you distribute copies of the software, or if -you modify it: responsibilities to respect the freedom of others. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must pass on to the recipients the same -freedoms that you received. You must make sure that they, too, receive -or can get the source code. And you must show them these terms so they -know their rights. - - Developers that use the GNU GPL protect your rights with two steps: -(1) assert copyright on the software, and (2) offer you this License -giving you legal permission to copy, distribute and/or modify it. - - For the developers' and authors' protection, the GPL clearly explains -that there is no warranty for this free software. For both users' and -authors' sake, the GPL requires that modified versions be marked as -changed, so that their problems will not be attributed erroneously to -authors of previous versions. - - Some devices are designed to deny users access to install or run -modified versions of the software inside them, although the manufacturer -can do so. This is fundamentally incompatible with the aim of -protecting users' freedom to change the software. The systematic -pattern of such abuse occurs in the area of products for individuals to -use, which is precisely where it is most unacceptable. Therefore, we -have designed this version of the GPL to prohibit the practice for those -products. If such problems arise substantially in other domains, we -stand ready to extend this provision to those domains in future versions -of the GPL, as needed to protect the freedom of users. - - Finally, every program is threatened constantly by software patents. -States should not allow patents to restrict development and use of -software on general-purpose computers, but in those that do, we wish to -avoid the special danger that patents applied to a free program could -make it effectively proprietary. To prevent this, the GPL assures that -patents cannot be used to render the program non-free. - - The precise terms and conditions for copying, distribution and -modification follow. - - TERMS AND CONDITIONS - - 0. Definitions. - - "This License" refers to version 3 of the GNU General Public License. - - "Copyright" also means copyright-like laws that apply to other kinds of -works, such as semiconductor masks. - - "The Program" refers to any copyrightable work licensed under this -License. Each licensee is addressed as "you". "Licensees" and -"recipients" may be individuals or organizations. - - To "modify" a work means to copy from or adapt all or part of the work -in a fashion requiring copyright permission, other than the making of an -exact copy. The resulting work is called a "modified version" of the -earlier work or a work "based on" the earlier work. - - A "covered work" means either the unmodified Program or a work based -on the Program. - - To "propagate" a work means to do anything with it that, without -permission, would make you directly or secondarily liable for -infringement under applicable copyright law, except executing it on a -computer or modifying a private copy. Propagation includes copying, -distribution (with or without modification), making available to the -public, and in some countries other activities as well. - - To "convey" a work means any kind of propagation that enables other -parties to make or receive copies. Mere interaction with a user through -a computer network, with no transfer of a copy, is not conveying. - - An interactive user interface displays "Appropriate Legal Notices" -to the extent that it includes a convenient and prominently visible -feature that (1) displays an appropriate copyright notice, and (2) -tells the user that there is no warranty for the work (except to the -extent that warranties are provided), that licensees may convey the -work under this License, and how to view a copy of this License. If -the interface presents a list of user commands or options, such as a -menu, a prominent item in the list meets this criterion. - - 1. Source Code. - - The "source code" for a work means the preferred form of the work -for making modifications to it. "Object code" means any non-source -form of a work. - - A "Standard Interface" means an interface that either is an official -standard defined by a recognized standards body, or, in the case of -interfaces specified for a particular programming language, one that -is widely used among developers working in that language. - - The "System Libraries" of an executable work include anything, other -than the work as a whole, that (a) is included in the normal form of -packaging a Major Component, but which is not part of that Major -Component, and (b) serves only to enable use of the work with that -Major Component, or to implement a Standard Interface for which an -implementation is available to the public in source code form. A -"Major Component", in this context, means a major essential component -(kernel, window system, and so on) of the specific operating system -(if any) on which the executable work runs, or a compiler used to -produce the work, or an object code interpreter used to run it. - - The "Corresponding Source" for a work in object code form means all -the source code needed to generate, install, and (for an executable -work) run the object code and to modify the work, including scripts to -control those activities. However, it does not include the work's -System Libraries, or general-purpose tools or generally available free -programs which are used unmodified in performing those activities but -which are not part of the work. For example, Corresponding Source -includes interface definition files associated with source files for -the work, and the source code for shared libraries and dynamically -linked subprograms that the work is specifically designed to require, -such as by intimate data communication or control flow between those -subprograms and other parts of the work. - - The Corresponding Source need not include anything that users -can regenerate automatically from other parts of the Corresponding -Source. - - The Corresponding Source for a work in source code form is that -same work. - - 2. Basic Permissions. - - All rights granted under this License are granted for the term of -copyright on the Program, and are irrevocable provided the stated -conditions are met. This License explicitly affirms your unlimited -permission to run the unmodified Program. The output from running a -covered work is covered by this License only if the output, given its -content, constitutes a covered work. This License acknowledges your -rights of fair use or other equivalent, as provided by copyright law. - - You may make, run and propagate covered works that you do not -convey, without conditions so long as your license otherwise remains -in force. You may convey covered works to others for the sole purpose -of having them make modifications exclusively for you, or provide you -with facilities for running those works, provided that you comply with -the terms of this License in conveying all material for which you do -not control copyright. Those thus making or running the covered works -for you must do so exclusively on your behalf, under your direction -and control, on terms that prohibit them from making any copies of -your copyrighted material outside their relationship with you. - - Conveying under any other circumstances is permitted solely under -the conditions stated below. Sublicensing is not allowed; section 10 -makes it unnecessary. - - 3. Protecting Users' Legal Rights From Anti-Circumvention Law. - - No covered work shall be deemed part of an effective technological -measure under any applicable law fulfilling obligations under article -11 of the WIPO copyright treaty adopted on 20 December 1996, or -similar laws prohibiting or restricting circumvention of such -measures. - - When you convey a covered work, you waive any legal power to forbid -circumvention of technological measures to the extent such circumvention -is effected by exercising rights under this License with respect to -the covered work, and you disclaim any intention to limit operation or -modification of the work as a means of enforcing, against the work's -users, your or third parties' legal rights to forbid circumvention of -technological measures. - - 4. Conveying Verbatim Copies. - - You may convey verbatim copies of the Program's source code as you -receive it, in any medium, provided that you conspicuously and -appropriately publish on each copy an appropriate copyright notice; -keep intact all notices stating that this License and any -non-permissive terms added in accord with section 7 apply to the code; -keep intact all notices of the absence of any warranty; and give all -recipients a copy of this License along with the Program. - - You may charge any price or no price for each copy that you convey, -and you may offer support or warranty protection for a fee. - - 5. Conveying Modified Source Versions. - - You may convey a work based on the Program, or the modifications to -produce it from the Program, in the form of source code under the -terms of section 4, provided that you also meet all of these conditions: - - a) The work must carry prominent notices stating that you modified - it, and giving a relevant date. - - b) The work must carry prominent notices stating that it is - released under this License and any conditions added under section - 7. This requirement modifies the requirement in section 4 to - "keep intact all notices". - - c) You must license the entire work, as a whole, under this - License to anyone who comes into possession of a copy. This - License will therefore apply, along with any applicable section 7 - additional terms, to the whole of the work, and all its parts, - regardless of how they are packaged. This License gives no - permission to license the work in any other way, but it does not - invalidate such permission if you have separately received it. - - d) If the work has interactive user interfaces, each must display - Appropriate Legal Notices; however, if the Program has interactive - interfaces that do not display Appropriate Legal Notices, your - work need not make them do so. - - A compilation of a covered work with other separate and independent -works, which are not by their nature extensions of the covered work, -and which are not combined with it such as to form a larger program, -in or on a volume of a storage or distribution medium, is called an -"aggregate" if the compilation and its resulting copyright are not -used to limit the access or legal rights of the compilation's users -beyond what the individual works permit. Inclusion of a covered work -in an aggregate does not cause this License to apply to the other -parts of the aggregate. - - 6. Conveying Non-Source Forms. - - You may convey a covered work in object code form under the terms -of sections 4 and 5, provided that you also convey the -machine-readable Corresponding Source under the terms of this License, -in one of these ways: - - a) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by the - Corresponding Source fixed on a durable physical medium - customarily used for software interchange. - - b) Convey the object code in, or embodied in, a physical product - (including a physical distribution medium), accompanied by a - written offer, valid for at least three years and valid for as - long as you offer spare parts or customer support for that product - model, to give anyone who possesses the object code either (1) a - copy of the Corresponding Source for all the software in the - product that is covered by this License, on a durable physical - medium customarily used for software interchange, for a price no - more than your reasonable cost of physically performing this - conveying of source, or (2) access to copy the - Corresponding Source from a network server at no charge. - - c) Convey individual copies of the object code with a copy of the - written offer to provide the Corresponding Source. This - alternative is allowed only occasionally and noncommercially, and - only if you received the object code with such an offer, in accord - with subsection 6b. - - d) Convey the object code by offering access from a designated - place (gratis or for a charge), and offer equivalent access to the - Corresponding Source in the same way through the same place at no - further charge. You need not require recipients to copy the - Corresponding Source along with the object code. If the place to - copy the object code is a network server, the Corresponding Source - may be on a different server (operated by you or a third party) - that supports equivalent copying facilities, provided you maintain - clear directions next to the object code saying where to find the - Corresponding Source. Regardless of what server hosts the - Corresponding Source, you remain obligated to ensure that it is - available for as long as needed to satisfy these requirements. - - e) Convey the object code using peer-to-peer transmission, provided - you inform other peers where the object code and Corresponding - Source of the work are being offered to the general public at no - charge under subsection 6d. - - A separable portion of the object code, whose source code is excluded -from the Corresponding Source as a System Library, need not be -included in conveying the object code work. - - A "User Product" is either (1) a "consumer product", which means any -tangible personal property which is normally used for personal, family, -or household purposes, or (2) anything designed or sold for incorporation -into a dwelling. In determining whether a product is a consumer product, -doubtful cases shall be resolved in favor of coverage. For a particular -product received by a particular user, "normally used" refers to a -typical or common use of that class of product, regardless of the status -of the particular user or of the way in which the particular user -actually uses, or expects or is expected to use, the product. A product -is a consumer product regardless of whether the product has substantial -commercial, industrial or non-consumer uses, unless such uses represent -the only significant mode of use of the product. - - "Installation Information" for a User Product means any methods, -procedures, authorization keys, or other information required to install -and execute modified versions of a covered work in that User Product from -a modified version of its Corresponding Source. The information must -suffice to ensure that the continued functioning of the modified object -code is in no case prevented or interfered with solely because -modification has been made. - - If you convey an object code work under this section in, or with, or -specifically for use in, a User Product, and the conveying occurs as -part of a transaction in which the right of possession and use of the -User Product is transferred to the recipient in perpetuity or for a -fixed term (regardless of how the transaction is characterized), the -Corresponding Source conveyed under this section must be accompanied -by the Installation Information. But this requirement does not apply -if neither you nor any third party retains the ability to install -modified object code on the User Product (for example, the work has -been installed in ROM). - - The requirement to provide Installation Information does not include a -requirement to continue to provide support service, warranty, or updates -for a work that has been modified or installed by the recipient, or for -the User Product in which it has been modified or installed. Access to a -network may be denied when the modification itself materially and -adversely affects the operation of the network or violates the rules and -protocols for communication across the network. - - Corresponding Source conveyed, and Installation Information provided, -in accord with this section must be in a format that is publicly -documented (and with an implementation available to the public in -source code form), and must require no special password or key for -unpacking, reading or copying. - - 7. Additional Terms. - - "Additional permissions" are terms that supplement the terms of this -License by making exceptions from one or more of its conditions. -Additional permissions that are applicable to the entire Program shall -be treated as though they were included in this License, to the extent -that they are valid under applicable law. If additional permissions -apply only to part of the Program, that part may be used separately -under those permissions, but the entire Program remains governed by -this License without regard to the additional permissions. - - When you convey a copy of a covered work, you may at your option -remove any additional permissions from that copy, or from any part of -it. (Additional permissions may be written to require their own -removal in certain cases when you modify the work.) You may place -additional permissions on material, added by you to a covered work, -for which you have or can give appropriate copyright permission. - - Notwithstanding any other provision of this License, for material you -add to a covered work, you may (if authorized by the copyright holders of -that material) supplement the terms of this License with terms: - - a) Disclaiming warranty or limiting liability differently from the - terms of sections 15 and 16 of this License; or - - b) Requiring preservation of specified reasonable legal notices or - author attributions in that material or in the Appropriate Legal - Notices displayed by works containing it; or - - c) Prohibiting misrepresentation of the origin of that material, or - requiring that modified versions of such material be marked in - reasonable ways as different from the original version; or - - d) Limiting the use for publicity purposes of names of licensors or - authors of the material; or - - e) Declining to grant rights under trademark law for use of some - trade names, trademarks, or service marks; or - - f) Requiring indemnification of licensors and authors of that - material by anyone who conveys the material (or modified versions of - it) with contractual assumptions of liability to the recipient, for - any liability that these contractual assumptions directly impose on - those licensors and authors. - - All other non-permissive additional terms are considered "further -restrictions" within the meaning of section 10. If the Program as you -received it, or any part of it, contains a notice stating that it is -governed by this License along with a term that is a further -restriction, you may remove that term. If a license document contains -a further restriction but permits relicensing or conveying under this -License, you may add to a covered work material governed by the terms -of that license document, provided that the further restriction does -not survive such relicensing or conveying. - - If you add terms to a covered work in accord with this section, you -must place, in the relevant source files, a statement of the -additional terms that apply to those files, or a notice indicating -where to find the applicable terms. - - Additional terms, permissive or non-permissive, may be stated in the -form of a separately written license, or stated as exceptions; -the above requirements apply either way. - - 8. Termination. - - You may not propagate or modify a covered work except as expressly -provided under this License. Any attempt otherwise to propagate or -modify it is void, and will automatically terminate your rights under -this License (including any patent licenses granted under the third -paragraph of section 11). - - However, if you cease all violation of this License, then your -license from a particular copyright holder is reinstated (a) -provisionally, unless and until the copyright holder explicitly and -finally terminates your license, and (b) permanently, if the copyright -holder fails to notify you of the violation by some reasonable means -prior to 60 days after the cessation. - - Moreover, your license from a particular copyright holder is -reinstated permanently if the copyright holder notifies you of the -violation by some reasonable means, this is the first time you have -received notice of violation of this License (for any work) from that -copyright holder, and you cure the violation prior to 30 days after -your receipt of the notice. - - Termination of your rights under this section does not terminate the -licenses of parties who have received copies or rights from you under -this License. If your rights have been terminated and not permanently -reinstated, you do not qualify to receive new licenses for the same -material under section 10. - - 9. Acceptance Not Required for Having Copies. - - You are not required to accept this License in order to receive or -run a copy of the Program. Ancillary propagation of a covered work -occurring solely as a consequence of using peer-to-peer transmission -to receive a copy likewise does not require acceptance. However, -nothing other than this License grants you permission to propagate or -modify any covered work. These actions infringe copyright if you do -not accept this License. Therefore, by modifying or propagating a -covered work, you indicate your acceptance of this License to do so. - - 10. Automatic Licensing of Downstream Recipients. - - Each time you convey a covered work, the recipient automatically -receives a license from the original licensors, to run, modify and -propagate that work, subject to this License. You are not responsible -for enforcing compliance by third parties with this License. - - An "entity transaction" is a transaction transferring control of an -organization, or substantially all assets of one, or subdividing an -organization, or merging organizations. If propagation of a covered -work results from an entity transaction, each party to that -transaction who receives a copy of the work also receives whatever -licenses to the work the party's predecessor in interest had or could -give under the previous paragraph, plus a right to possession of the -Corresponding Source of the work from the predecessor in interest, if -the predecessor has it or can get it with reasonable efforts. - - You may not impose any further restrictions on the exercise of the -rights granted or affirmed under this License. For example, you may -not impose a license fee, royalty, or other charge for exercise of -rights granted under this License, and you may not initiate litigation -(including a cross-claim or counterclaim in a lawsuit) alleging that -any patent claim is infringed by making, using, selling, offering for -sale, or importing the Program or any portion of it. - - 11. Patents. - - A "contributor" is a copyright holder who authorizes use under this -License of the Program or a work on which the Program is based. The -work thus licensed is called the contributor's "contributor version". - - A contributor's "essential patent claims" are all patent claims -owned or controlled by the contributor, whether already acquired or -hereafter acquired, that would be infringed by some manner, permitted -by this License, of making, using, or selling its contributor version, -but do not include claims that would be infringed only as a -consequence of further modification of the contributor version. For -purposes of this definition, "control" includes the right to grant -patent sublicenses in a manner consistent with the requirements of -this License. - - Each contributor grants you a non-exclusive, worldwide, royalty-free -patent license under the contributor's essential patent claims, to -make, use, sell, offer for sale, import and otherwise run, modify and -propagate the contents of its contributor version. - - In the following three paragraphs, a "patent license" is any express -agreement or commitment, however denominated, not to enforce a patent -(such as an express permission to practice a patent or covenant not to -sue for patent infringement). To "grant" such a patent license to a -party means to make such an agreement or commitment not to enforce a -patent against the party. - - If you convey a covered work, knowingly relying on a patent license, -and the Corresponding Source of the work is not available for anyone -to copy, free of charge and under the terms of this License, through a -publicly available network server or other readily accessible means, -then you must either (1) cause the Corresponding Source to be so -available, or (2) arrange to deprive yourself of the benefit of the -patent license for this particular work, or (3) arrange, in a manner -consistent with the requirements of this License, to extend the patent -license to downstream recipients. "Knowingly relying" means you have -actual knowledge that, but for the patent license, your conveying the -covered work in a country, or your recipient's use of the covered work -in a country, would infringe one or more identifiable patents in that -country that you have reason to believe are valid. - - If, pursuant to or in connection with a single transaction or -arrangement, you convey, or propagate by procuring conveyance of, a -covered work, and grant a patent license to some of the parties -receiving the covered work authorizing them to use, propagate, modify -or convey a specific copy of the covered work, then the patent license -you grant is automatically extended to all recipients of the covered -work and works based on it. - - A patent license is "discriminatory" if it does not include within -the scope of its coverage, prohibits the exercise of, or is -conditioned on the non-exercise of one or more of the rights that are -specifically granted under this License. You may not convey a covered -work if you are a party to an arrangement with a third party that is -in the business of distributing software, under which you make payment -to the third party based on the extent of your activity of conveying -the work, and under which the third party grants, to any of the -parties who would receive the covered work from you, a discriminatory -patent license (a) in connection with copies of the covered work -conveyed by you (or copies made from those copies), or (b) primarily -for and in connection with specific products or compilations that -contain the covered work, unless you entered into that arrangement, -or that patent license was granted, prior to 28 March 2007. - - Nothing in this License shall be construed as excluding or limiting -any implied license or other defenses to infringement that may -otherwise be available to you under applicable patent law. - - 12. No Surrender of Others' Freedom. - - If conditions are imposed on you (whether by court order, agreement or -otherwise) that contradict the conditions of this License, they do not -excuse you from the conditions of this License. If you cannot convey a -covered work so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you may -not convey it at all. For example, if you agree to terms that obligate you -to collect a royalty for further conveying from those to whom you convey -the Program, the only way you could satisfy both those terms and this -License would be to refrain entirely from conveying the Program. - - 13. Use with the GNU Affero General Public License. - - Notwithstanding any other provision of this License, you have -permission to link or combine any covered work with a work licensed -under version 3 of the GNU Affero General Public License into a single -combined work, and to convey the resulting work. The terms of this -License will continue to apply to the part which is the covered work, -but the special requirements of the GNU Affero General Public License, -section 13, concerning interaction through a network will apply to the -combination as such. - - 14. Revised Versions of this License. - - The Free Software Foundation may publish revised and/or new versions of -the GNU General Public License from time to time. Such new versions will -be similar in spirit to the present version, but may differ in detail to -address new problems or concerns. - - Each version is given a distinguishing version number. If the -Program specifies that a certain numbered version of the GNU General -Public License "or any later version" applies to it, you have the -option of following the terms and conditions either of that numbered -version or of any later version published by the Free Software -Foundation. If the Program does not specify a version number of the -GNU General Public License, you may choose any version ever published -by the Free Software Foundation. - - If the Program specifies that a proxy can decide which future -versions of the GNU General Public License can be used, that proxy's -public statement of acceptance of a version permanently authorizes you -to choose that version for the Program. - - Later license versions may give you additional or different -permissions. However, no additional obligations are imposed on any -author or copyright holder as a result of your choosing to follow a -later version. - - 15. Disclaimer of Warranty. - - THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY -APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT -HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY -OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, -THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM -IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF -ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. Limitation of Liability. - - IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS -THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY -GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE -USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF -DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD -PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), -EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF -SUCH DAMAGES. - - 17. Interpretation of Sections 15 and 16. - - If the disclaimer of warranty and limitation of liability provided -above cannot be given local legal effect according to their terms, -reviewing courts shall apply local law that most closely approximates -an absolute waiver of all civil liability in connection with the -Program, unless a warranty or assumption of liability accompanies a -copy of the Program in return for a fee. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Programs - - If you develop a new program, and you want it to be of the greatest -possible use to the public, the best way to achieve this is to make it -free software which everyone can redistribute and change under these terms. - - To do so, attach the following notices to the program. It is safest -to attach them to the start of each source file to most effectively -state the exclusion of warranty; and each file should have at least -the "copyright" line and a pointer to where the full notice is found. - - - Copyright (C) - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation, either version 3 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program. If not, see . - -Also add information on how to contact you by electronic and paper mail. - - If the program does terminal interaction, make it output a short -notice like this when it starts in an interactive mode: - - Copyright (C) - This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. - This is free software, and you are welcome to redistribute it - under certain conditions; type `show c' for details. - -The hypothetical commands `show w' and `show c' should show the appropriate -parts of the General Public License. Of course, your program's commands -might be different; for a GUI interface, you would use an "about box". - - You should also get your employer (if you work as a programmer) or school, -if any, to sign a "copyright disclaimer" for the program, if necessary. -For more information on this, and how to apply and follow the GNU GPL, see -. - - The GNU General Public License does not permit incorporating your program -into proprietary programs. If your program is a subroutine library, you -may consider it more useful to permit linking proprietary applications with -the library. If this is what you want to do, use the GNU Lesser General -Public License instead of this License. But first, please read -. diff --git a/ijs/package-lock.json b/ijs/package-lock.json deleted file mode 100644 index 4910850..0000000 --- a/ijs/package-lock.json +++ /dev/null @@ -1,1614 +0,0 @@ -{ - "name": "@syndicate-lang/core", - "version": "0.0.0", - "lockfileVersion": 1, - "requires": true, - "dependencies": { - "@babel/code-frame": { - "version": "7.0.0", - "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.0.0.tgz", - "integrity": "sha512-OfC2uemaknXr87bdLUkWog7nYuliM9Ij5HUcajsVcMCpQrcLmtxRbVFTIqmcSkSeYRBFBRxs2FiUqFJDLdiebA==", - "dev": true, - "requires": { - "@babel/highlight": "^7.0.0" - } - }, - "@babel/generator": { - "version": "7.1.3", - "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.1.3.tgz", - "integrity": "sha512-ZoCZGcfIJFJuZBqxcY9OjC1KW2lWK64qrX1o4UYL3yshVhwKFYgzpWZ0vvtGMNJdTlvkw0W+HR1VnYN8q3QPFQ==", - "dev": true, - "requires": { - "@babel/types": "^7.1.3", - "jsesc": "^2.5.1", - "lodash": "^4.17.10", - "source-map": "^0.5.0", - "trim-right": "^1.0.1" - } - }, - "@babel/helper-function-name": { - "version": "7.1.0", - "resolved": "https://registry.npmjs.org/@babel/helper-function-name/-/helper-function-name-7.1.0.tgz", - "integrity": "sha512-A95XEoCpb3TO+KZzJ4S/5uW5fNe26DjBGqf1o9ucyLyCmi1dXq/B3c8iaWTfBk3VvetUxl16e8tIrd5teOCfGw==", - "dev": true, - "requires": { - "@babel/helper-get-function-arity": "^7.0.0", - "@babel/template": "^7.1.0", - "@babel/types": "^7.0.0" - } - }, - "@babel/helper-get-function-arity": { - "version": "7.0.0", - "resolved": "https://registry.npmjs.org/@babel/helper-get-function-arity/-/helper-get-function-arity-7.0.0.tgz", - "integrity": "sha512-r2DbJeg4svYvt3HOS74U4eWKsUAMRH01Z1ds1zx8KNTPtpTL5JAsdFv8BNyOpVqdFhHkkRDIg5B4AsxmkjAlmQ==", - "dev": true, - "requires": { - "@babel/types": "^7.0.0" - } - }, - "@babel/helper-split-export-declaration": { - "version": "7.0.0", - "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.0.0.tgz", - "integrity": "sha512-MXkOJqva62dfC0w85mEf/LucPPS/1+04nmmRMPEBUB++hiiThQ2zPtX/mEWQ3mtzCEjIJvPY8nuwxXtQeQwUag==", - "dev": true, - "requires": { - "@babel/types": "^7.0.0" - } - }, - "@babel/highlight": { - "version": "7.0.0", - "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.0.0.tgz", - "integrity": "sha512-UFMC4ZeFC48Tpvj7C8UgLvtkaUuovQX+5xNWrsIoMG8o2z+XFKjKaN9iVmS84dPwVN00W4wPmqvYoZF3EGAsfw==", - "dev": true, - "requires": { - "chalk": "^2.0.0", - "esutils": "^2.0.2", - "js-tokens": "^4.0.0" - } - }, - "@babel/parser": { - "version": "7.1.3", - "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.1.3.tgz", - "integrity": "sha512-gqmspPZOMW3MIRb9HlrnbZHXI1/KHTOroBwN1NcLL6pWxzqzEKGvRTq0W/PxS45OtQGbaFikSQpkS5zbnsQm2w==", - "dev": true - }, - "@babel/template": { - "version": "7.1.2", - "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.1.2.tgz", - "integrity": "sha512-SY1MmplssORfFiLDcOETrW7fCLl+PavlwMh92rrGcikQaRq4iWPVH0MpwPpY3etVMx6RnDjXtr6VZYr/IbP/Ag==", - "dev": true, - "requires": { - "@babel/code-frame": "^7.0.0", - "@babel/parser": "^7.1.2", - "@babel/types": "^7.1.2" - } - }, - "@babel/traverse": { - "version": "7.1.4", - "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.1.4.tgz", - "integrity": "sha512-my9mdrAIGdDiSVBuMjpn/oXYpva0/EZwWL3sm3Wcy/AVWO2eXnsoZruOT9jOGNRXU8KbCIu5zsKnXcAJ6PcV6Q==", - "dev": true, - "requires": { - "@babel/code-frame": "^7.0.0", - "@babel/generator": "^7.1.3", - "@babel/helper-function-name": "^7.1.0", - "@babel/helper-split-export-declaration": "^7.0.0", - "@babel/parser": "^7.1.3", - "@babel/types": "^7.1.3", - "debug": "^3.1.0", - "globals": "^11.1.0", - "lodash": "^4.17.10" - }, - "dependencies": { - "debug": { - "version": "3.2.6", - "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.6.tgz", - "integrity": "sha512-mel+jf7nrtEl5Pn1Qx46zARXKDpBbvzezse7p7LqINmdoIk8PYP5SySaxEmYv6TZ0JyEKA1hsCId6DIhgITtWQ==", - "dev": true, - "requires": { - "ms": "^2.1.1" - } - }, - "ms": { - "version": "2.1.1", - "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.1.tgz", - "integrity": "sha512-tgp+dl5cGk28utYktBsrFqA7HKgrhgPsg6Z/EfhWI4gl1Hwq8B/GmY/0oXZ6nF8hDVesS/FpnYaD/kOWhYQvyg==", - "dev": true - } - } - }, - "@babel/types": { - "version": "7.1.3", - "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.1.3.tgz", - "integrity": "sha512-RpPOVfK+yatXyn8n4PB1NW6k9qjinrXrRR8ugBN8fD6hCy5RXI6PSbVqpOJBO9oSaY7Nom4ohj35feb0UR9hSA==", - "dev": true, - "requires": { - "esutils": "^2.0.2", - "lodash": "^4.17.10", - "to-fast-properties": "^2.0.0" - } - }, - "ansi-styles": { - "version": "3.2.1", - "resolved": "https://registry.npmjs.org/ansi-styles/-/ansi-styles-3.2.1.tgz", - "integrity": "sha512-VT0ZI6kZRdTh8YyJw3SMbYm/u+NqfsAxEpWO0Pf9sq8/e94WxxOpPKx9FR1FlyCtOVDNOQ+8ntlqFxiRc+r5qA==", - "dev": true, - "requires": { - "color-convert": "^1.9.0" - } - }, - "assertion-error": { - "version": "1.1.0", - "resolved": "https://registry.npmjs.org/assertion-error/-/assertion-error-1.1.0.tgz", - "integrity": "sha512-jgsaNduz+ndvGyFt3uSuWqvy4lCnIJiovtouQN5JZHOKCS2QuhEdbcQHFhVksz2N2U9hXJo8odG7ETyWlEeuDw==", - "dev": true - }, - "chai": { - "version": "4.2.0", - "resolved": "https://registry.npmjs.org/chai/-/chai-4.2.0.tgz", - "integrity": "sha512-XQU3bhBukrOsQCuwZndwGcCVQHyZi53fQ6Ys1Fym7E4olpIqqZZhhoFJoaKVvV17lWQoXYwgWN2nF5crA8J2jw==", - "dev": true, - "requires": { - "assertion-error": "^1.1.0", - "check-error": "^1.0.2", - "deep-eql": "^3.0.1", - "get-func-name": "^2.0.0", - "pathval": "^1.1.0", - "type-detect": "^4.0.5" - } - }, - "chai-immutable": { - "version": "2.0.0-rc.2", - "resolved": "https://registry.npmjs.org/chai-immutable/-/chai-immutable-2.0.0-rc.2.tgz", - "integrity": "sha512-9DAbH5PsOSZGSJDskYb88GkFj2j5C9EbKMdR6apnF6iC0rIStwXH05EvcyruqHYe5Y1vQYmxOLFXyISS5L2KVw==", - "dev": true - }, - "chalk": { - "version": "2.4.1", - "resolved": "https://registry.npmjs.org/chalk/-/chalk-2.4.1.tgz", - "integrity": "sha512-ObN6h1v2fTJSmUXoS3nMQ92LbDK9be4TV+6G+omQlGJFdcUX5heKi1LZ1YnRMIgwTLEj3E24bT6tYni50rlCfQ==", - "dev": true, - "requires": { - "ansi-styles": "^3.2.1", - "escape-string-regexp": "^1.0.5", - "supports-color": "^5.3.0" - }, - "dependencies": { - "escape-string-regexp": { - "version": "1.0.5", - "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz", - "integrity": "sha1-G2HAViGQqN/2rjuyzwIAyhMLhtQ=", - "dev": true - }, - "supports-color": { - "version": "5.5.0", - "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-5.5.0.tgz", - "integrity": "sha512-QjVjwdXIt408MIiAqCX4oUKsgU2EqAGzs2Ppkm4aQYbjm+ZEWEcW4SfFNTr4uMNZma0ey4f5lgLrkB0aX0QMow==", - "dev": true, - "requires": { - "has-flag": "^3.0.0" - } - } - } - }, - "check-error": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/check-error/-/check-error-1.0.2.tgz", - "integrity": "sha1-V00xLt2Iu13YkS6Sht1sCu1KrII=", - "dev": true - }, - "color-convert": { - "version": "1.9.3", - "resolved": "https://registry.npmjs.org/color-convert/-/color-convert-1.9.3.tgz", - "integrity": "sha512-QfAUtd+vFdAtFQcC8CCyYt1fYWxSqAiK2cSD6zDB8N3cpsEBAvRxp9zOGg6G/SHHJYAT88/az/IuDGALsNVbGg==", - "dev": true, - "requires": { - "color-name": "1.1.3" - } - }, - "color-name": { - "version": "1.1.3", - "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.3.tgz", - "integrity": "sha1-p9BVi9icQveV3UIyj3QIMcpTvCU=", - "dev": true - }, - "commander": { - "version": "2.3.0", - "resolved": "http://registry.npmjs.org/commander/-/commander-2.3.0.tgz", - "integrity": "sha1-/UMOiJgy7DU7ms0d4hfBHLPu+HM=", - "dev": true - }, - "debug": { - "version": "2.2.0", - "resolved": "http://registry.npmjs.org/debug/-/debug-2.2.0.tgz", - "integrity": "sha1-+HBX6ZWxofauaklgZkE3vFbwOdo=", - "dev": true, - "requires": { - "ms": "0.7.1" - } - }, - "deep-eql": { - "version": "3.0.1", - "resolved": "https://registry.npmjs.org/deep-eql/-/deep-eql-3.0.1.tgz", - "integrity": "sha512-+QeIQyN5ZuO+3Uk5DYh6/1eKO0m0YmJFGNmFHGACpf1ClL1nmlV/p4gNgbl2pJGxgXb4faqo6UE+M5ACEMyVcw==", - "dev": true, - "requires": { - "type-detect": "^4.0.0" - } - }, - "diff": { - "version": "1.4.0", - "resolved": "https://registry.npmjs.org/diff/-/diff-1.4.0.tgz", - "integrity": "sha1-fyjS657nsVqX79ic5j3P2qPMur8=", - "dev": true - }, - "escape-string-regexp": { - "version": "1.0.2", - "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-1.0.2.tgz", - "integrity": "sha1-Tbwv5nTnGUnK8/smlc5/LcHZqNE=", - "dev": true - }, - "esutils": { - "version": "2.0.2", - "resolved": "https://registry.npmjs.org/esutils/-/esutils-2.0.2.tgz", - "integrity": "sha1-Cr9PHKpbyx96nYrMbepPqqBLrJs=", - "dev": true - }, - "get-func-name": { - "version": "2.0.0", - "resolved": "https://registry.npmjs.org/get-func-name/-/get-func-name-2.0.0.tgz", - "integrity": "sha1-6td0q+5y4gQJQzoGY2YCPdaIekE=", - "dev": true - }, - "glob": { - "version": "3.2.11", - "resolved": "https://registry.npmjs.org/glob/-/glob-3.2.11.tgz", - "integrity": "sha1-Spc/Y1uRkPcV0QmH1cAP0oFevj0=", - "dev": true, - "requires": { - "inherits": "2", - "minimatch": "0.3" - } - }, - "globals": { - "version": "11.8.0", - "resolved": "https://registry.npmjs.org/globals/-/globals-11.8.0.tgz", - "integrity": "sha512-io6LkyPVuzCHBSQV9fmOwxZkUk6nIaGmxheLDgmuFv89j0fm2aqDbIXKAGfzCMHqz3HLF2Zf8WSG6VqMh2qFmA==", - "dev": true - }, - "growl": { - "version": "1.9.2", - "resolved": "https://registry.npmjs.org/growl/-/growl-1.9.2.tgz", - "integrity": "sha1-Dqd0NxXbjY3ixe3hd14bRayFwC8=", - "dev": true - }, - "has-flag": { - "version": "3.0.0", - "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-3.0.0.tgz", - "integrity": "sha1-tdRU3CGZriJWmfNGfloH87lVuv0=", - "dev": true - }, - "immutable": { - "version": "3.8.2", - "resolved": "https://registry.npmjs.org/immutable/-/immutable-3.8.2.tgz", - "integrity": "sha1-wkOZUUVbs5kT2vKBN28VMOEErfM=" - }, - "inherits": { - "version": "2.0.3", - "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.3.tgz", - "integrity": "sha1-Yzwsg+PaQqUC9SRmAiSA9CCCYd4=", - "dev": true - }, - "istanbul-lib-coverage": { - "version": "2.0.1", - "resolved": "https://registry.npmjs.org/istanbul-lib-coverage/-/istanbul-lib-coverage-2.0.1.tgz", - "integrity": "sha512-nPvSZsVlbG9aLhZYaC3Oi1gT/tpyo3Yt5fNyf6NmcKIayz4VV/txxJFFKAK/gU4dcNn8ehsanBbVHVl0+amOLA==", - "dev": true - }, - "istanbul-lib-instrument": { - "version": "3.0.0", - "resolved": "https://registry.npmjs.org/istanbul-lib-instrument/-/istanbul-lib-instrument-3.0.0.tgz", - "integrity": "sha512-eQY9vN9elYjdgN9Iv6NS/00bptm02EBBk70lRMaVjeA6QYocQgenVrSgC28TJurdnZa80AGO3ASdFN+w/njGiQ==", - "dev": true, - "requires": { - "@babel/generator": "^7.0.0", - "@babel/parser": "^7.0.0", - "@babel/template": "^7.0.0", - "@babel/traverse": "^7.0.0", - "@babel/types": "^7.0.0", - "istanbul-lib-coverage": "^2.0.1", - "semver": "^5.5.0" - } - }, - "jade": { - "version": "0.26.3", - "resolved": "https://registry.npmjs.org/jade/-/jade-0.26.3.tgz", - "integrity": "sha1-jxDXl32NefL2/4YqgbBRPMslaGw=", - "dev": true, - "requires": { - "commander": "0.6.1", - "mkdirp": "0.3.0" - }, - "dependencies": { - "commander": { - "version": "0.6.1", - "resolved": "http://registry.npmjs.org/commander/-/commander-0.6.1.tgz", - "integrity": "sha1-+mihT2qUXVTbvlDYzbMyDp47GgY=", - "dev": true - }, - "mkdirp": { - "version": "0.3.0", - "resolved": "http://registry.npmjs.org/mkdirp/-/mkdirp-0.3.0.tgz", - "integrity": "sha1-G79asbqCevI1dRQ0kEJkVfSB/h4=", - "dev": true - } - } - }, - "js-tokens": { - "version": "4.0.0", - "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-4.0.0.tgz", - "integrity": "sha512-RdJUflcE3cUzKiMqQgsCu06FPu9UdIJO0beYbPhHN4k6apgJtifcoCtT9bcxOpYBtpD2kCM6Sbzg4CausW/PKQ==", - "dev": true - }, - "jsesc": { - "version": "2.5.1", - "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-2.5.1.tgz", - "integrity": "sha1-5CGiqOINawgZ3yiQj3glJrlt0f4=", - "dev": true - }, - "lodash": { - "version": "4.17.11", - "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.11.tgz", - "integrity": "sha512-cQKh8igo5QUhZ7lg38DYWAxMvjSAKG0A8wGSVimP07SIUEK2UO+arSRKbRZWtelMtN5V0Hkwh5ryOto/SshYIg==", - "dev": true - }, - "lru-cache": { - "version": "2.7.3", - "resolved": "https://registry.npmjs.org/lru-cache/-/lru-cache-2.7.3.tgz", - "integrity": "sha1-bUUk6LlV+V1PW1iFHOId1y+06VI=", - "dev": true - }, - "minimatch": { - "version": "0.3.0", - "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-0.3.0.tgz", - "integrity": "sha1-J12O2qxPG7MyZHIInnlJyDlGmd0=", - "dev": true, - "requires": { - "lru-cache": "2", - "sigmund": "~1.0.0" - } - }, - "minimist": { - "version": "0.0.8", - "resolved": "http://registry.npmjs.org/minimist/-/minimist-0.0.8.tgz", - "integrity": "sha1-hX/Kv8M5fSYluCKCYuhqp6ARsF0=", - "dev": true - }, - "mkdirp": { - "version": "0.5.1", - "resolved": "http://registry.npmjs.org/mkdirp/-/mkdirp-0.5.1.tgz", - "integrity": "sha1-MAV0OOrGz3+MR2fzhkjWaX11yQM=", - "dev": true, - "requires": { - "minimist": "0.0.8" - } - }, - "mocha": { - "version": "2.5.3", - "resolved": "http://registry.npmjs.org/mocha/-/mocha-2.5.3.tgz", - "integrity": "sha1-FhvlvetJZ3HrmzV0UFC2IrWu/Fg=", - "dev": true, - "requires": { - "commander": "2.3.0", - "debug": "2.2.0", - "diff": "1.4.0", - "escape-string-regexp": "1.0.2", - "glob": "3.2.11", - "growl": "1.9.2", - "jade": "0.26.3", - "mkdirp": "0.5.1", - "supports-color": "1.2.0", - "to-iso-string": "0.0.2" - } - }, - "ms": { - "version": "0.7.1", - "resolved": "http://registry.npmjs.org/ms/-/ms-0.7.1.tgz", - "integrity": "sha1-nNE8A62/8ltl7/3nzoZO6VIBcJg=", - "dev": true - }, - "nyc": { - "version": "13.1.0", - "resolved": "https://registry.npmjs.org/nyc/-/nyc-13.1.0.tgz", - "integrity": "sha512-3GyY6TpQ58z9Frpv4GMExE1SV2tAgYqC7HSy2omEhNiCT3mhT9NyiOvIE8zkbuJVFzmvvNTnE4h/7/wQae7xLg==", - "dev": true, - "requires": { - "archy": "^1.0.0", - "arrify": "^1.0.1", - "caching-transform": "^2.0.0", - "convert-source-map": "^1.6.0", - "debug-log": "^1.0.1", - "find-cache-dir": "^2.0.0", - "find-up": "^3.0.0", - "foreground-child": "^1.5.6", - "glob": "^7.1.3", - "istanbul-lib-coverage": "^2.0.1", - "istanbul-lib-hook": "^2.0.1", - "istanbul-lib-instrument": "^3.0.0", - "istanbul-lib-report": "^2.0.2", - "istanbul-lib-source-maps": "^2.0.1", - "istanbul-reports": "^2.0.1", - "make-dir": "^1.3.0", - "merge-source-map": "^1.1.0", - "resolve-from": "^4.0.0", - "rimraf": "^2.6.2", - "signal-exit": "^3.0.2", - "spawn-wrap": "^1.4.2", - "test-exclude": "^5.0.0", - "uuid": "^3.3.2", - "yargs": "11.1.0", - "yargs-parser": "^9.0.2" - }, - "dependencies": { - "align-text": { - "version": "0.1.4", - "bundled": true, - "dev": true, - "requires": { - "kind-of": "^3.0.2", - "longest": "^1.0.1", - "repeat-string": "^1.5.2" - } - }, - "amdefine": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "ansi-regex": { - "version": "3.0.0", - "bundled": true, - "dev": true - }, - "append-transform": { - "version": "1.0.0", - "bundled": true, - "dev": true, - "requires": { - "default-require-extensions": "^2.0.0" - } - }, - "archy": { - "version": "1.0.0", - "bundled": true, - "dev": true - }, - "arrify": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "async": { - "version": "1.5.2", - "bundled": true, - "dev": true - }, - "balanced-match": { - "version": "1.0.0", - "bundled": true, - "dev": true - }, - "brace-expansion": { - "version": "1.1.11", - "bundled": true, - "dev": true, - "requires": { - "balanced-match": "^1.0.0", - "concat-map": "0.0.1" - } - }, - "builtin-modules": { - "version": "1.1.1", - "bundled": true, - "dev": true - }, - "caching-transform": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "make-dir": "^1.0.0", - "md5-hex": "^2.0.0", - "package-hash": "^2.0.0", - "write-file-atomic": "^2.0.0" - } - }, - "camelcase": { - "version": "1.2.1", - "bundled": true, - "dev": true, - "optional": true - }, - "center-align": { - "version": "0.1.3", - "bundled": true, - "dev": true, - "optional": true, - "requires": { - "align-text": "^0.1.3", - "lazy-cache": "^1.0.3" - } - }, - "cliui": { - "version": "2.1.0", - "bundled": true, - "dev": true, - "optional": true, - "requires": { - "center-align": "^0.1.1", - "right-align": "^0.1.1", - "wordwrap": "0.0.2" - }, - "dependencies": { - "wordwrap": { - "version": "0.0.2", - "bundled": true, - "dev": true, - "optional": true - } - } - }, - "code-point-at": { - "version": "1.1.0", - "bundled": true, - "dev": true - }, - "commondir": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "concat-map": { - "version": "0.0.1", - "bundled": true, - "dev": true - }, - "convert-source-map": { - "version": "1.6.0", - "bundled": true, - "dev": true, - "requires": { - "safe-buffer": "~5.1.1" - } - }, - "cross-spawn": { - "version": "4.0.2", - "bundled": true, - "dev": true, - "requires": { - "lru-cache": "^4.0.1", - "which": "^1.2.9" - } - }, - "debug": { - "version": "3.1.0", - "bundled": true, - "dev": true, - "requires": { - "ms": "2.0.0" - } - }, - "debug-log": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "decamelize": { - "version": "1.2.0", - "bundled": true, - "dev": true - }, - "default-require-extensions": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "strip-bom": "^3.0.0" - } - }, - "error-ex": { - "version": "1.3.2", - "bundled": true, - "dev": true, - "requires": { - "is-arrayish": "^0.2.1" - } - }, - "es6-error": { - "version": "4.1.1", - "bundled": true, - "dev": true - }, - "execa": { - "version": "0.7.0", - "bundled": true, - "dev": true, - "requires": { - "cross-spawn": "^5.0.1", - "get-stream": "^3.0.0", - "is-stream": "^1.1.0", - "npm-run-path": "^2.0.0", - "p-finally": "^1.0.0", - "signal-exit": "^3.0.0", - "strip-eof": "^1.0.0" - }, - "dependencies": { - "cross-spawn": { - "version": "5.1.0", - "bundled": true, - "dev": true, - "requires": { - "lru-cache": "^4.0.1", - "shebang-command": "^1.2.0", - "which": "^1.2.9" - } - } - } - }, - "find-cache-dir": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "commondir": "^1.0.1", - "make-dir": "^1.0.0", - "pkg-dir": "^3.0.0" - } - }, - "find-up": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "locate-path": "^3.0.0" - } - }, - "foreground-child": { - "version": "1.5.6", - "bundled": true, - "dev": true, - "requires": { - "cross-spawn": "^4", - "signal-exit": "^3.0.0" - } - }, - "fs.realpath": { - "version": "1.0.0", - "bundled": true, - "dev": true - }, - "get-caller-file": { - "version": "1.0.3", - "bundled": true, - "dev": true - }, - "get-stream": { - "version": "3.0.0", - "bundled": true, - "dev": true - }, - "glob": { - "version": "7.1.3", - "bundled": true, - "dev": true, - "requires": { - "fs.realpath": "^1.0.0", - "inflight": "^1.0.4", - "inherits": "2", - "minimatch": "^3.0.4", - "once": "^1.3.0", - "path-is-absolute": "^1.0.0" - } - }, - "graceful-fs": { - "version": "4.1.11", - "bundled": true, - "dev": true - }, - "handlebars": { - "version": "4.0.11", - "bundled": true, - "dev": true, - "requires": { - "async": "^1.4.0", - "optimist": "^0.6.1", - "source-map": "^0.4.4", - "uglify-js": "^2.6" - }, - "dependencies": { - "source-map": { - "version": "0.4.4", - "bundled": true, - "dev": true, - "requires": { - "amdefine": ">=0.0.4" - } - } - } - }, - "has-flag": { - "version": "3.0.0", - "bundled": true, - "dev": true - }, - "hosted-git-info": { - "version": "2.7.1", - "bundled": true, - "dev": true - }, - "imurmurhash": { - "version": "0.1.4", - "bundled": true, - "dev": true - }, - "inflight": { - "version": "1.0.6", - "bundled": true, - "dev": true, - "requires": { - "once": "^1.3.0", - "wrappy": "1" - } - }, - "inherits": { - "version": "2.0.3", - "bundled": true, - "dev": true - }, - "invert-kv": { - "version": "1.0.0", - "bundled": true, - "dev": true - }, - "is-arrayish": { - "version": "0.2.1", - "bundled": true, - "dev": true - }, - "is-buffer": { - "version": "1.1.6", - "bundled": true, - "dev": true - }, - "is-builtin-module": { - "version": "1.0.0", - "bundled": true, - "dev": true, - "requires": { - "builtin-modules": "^1.0.0" - } - }, - "is-fullwidth-code-point": { - "version": "2.0.0", - "bundled": true, - "dev": true - }, - "is-stream": { - "version": "1.1.0", - "bundled": true, - "dev": true - }, - "isexe": { - "version": "2.0.0", - "bundled": true, - "dev": true - }, - "istanbul-lib-coverage": { - "version": "2.0.1", - "bundled": true, - "dev": true - }, - "istanbul-lib-hook": { - "version": "2.0.1", - "bundled": true, - "dev": true, - "requires": { - "append-transform": "^1.0.0" - } - }, - "istanbul-lib-report": { - "version": "2.0.2", - "bundled": true, - "dev": true, - "requires": { - "istanbul-lib-coverage": "^2.0.1", - "make-dir": "^1.3.0", - "supports-color": "^5.4.0" - } - }, - "istanbul-lib-source-maps": { - "version": "2.0.1", - "bundled": true, - "dev": true, - "requires": { - "debug": "^3.1.0", - "istanbul-lib-coverage": "^2.0.1", - "make-dir": "^1.3.0", - "rimraf": "^2.6.2", - "source-map": "^0.6.1" - }, - "dependencies": { - "source-map": { - "version": "0.6.1", - "bundled": true, - "dev": true - } - } - }, - "istanbul-reports": { - "version": "2.0.1", - "bundled": true, - "dev": true, - "requires": { - "handlebars": "^4.0.11" - } - }, - "json-parse-better-errors": { - "version": "1.0.2", - "bundled": true, - "dev": true - }, - "kind-of": { - "version": "3.2.2", - "bundled": true, - "dev": true, - "requires": { - "is-buffer": "^1.1.5" - } - }, - "lazy-cache": { - "version": "1.0.4", - "bundled": true, - "dev": true, - "optional": true - }, - "lcid": { - "version": "1.0.0", - "bundled": true, - "dev": true, - "requires": { - "invert-kv": "^1.0.0" - } - }, - "load-json-file": { - "version": "4.0.0", - "bundled": true, - "dev": true, - "requires": { - "graceful-fs": "^4.1.2", - "parse-json": "^4.0.0", - "pify": "^3.0.0", - "strip-bom": "^3.0.0" - } - }, - "locate-path": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "p-locate": "^3.0.0", - "path-exists": "^3.0.0" - } - }, - "lodash.flattendeep": { - "version": "4.4.0", - "bundled": true, - "dev": true - }, - "longest": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "lru-cache": { - "version": "4.1.3", - "bundled": true, - "dev": true, - "requires": { - "pseudomap": "^1.0.2", - "yallist": "^2.1.2" - } - }, - "make-dir": { - "version": "1.3.0", - "bundled": true, - "dev": true, - "requires": { - "pify": "^3.0.0" - } - }, - "md5-hex": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "md5-o-matic": "^0.1.1" - } - }, - "md5-o-matic": { - "version": "0.1.1", - "bundled": true, - "dev": true - }, - "mem": { - "version": "1.1.0", - "bundled": true, - "dev": true, - "requires": { - "mimic-fn": "^1.0.0" - } - }, - "merge-source-map": { - "version": "1.1.0", - "bundled": true, - "dev": true, - "requires": { - "source-map": "^0.6.1" - }, - "dependencies": { - "source-map": { - "version": "0.6.1", - "bundled": true, - "dev": true - } - } - }, - "mimic-fn": { - "version": "1.2.0", - "bundled": true, - "dev": true - }, - "minimatch": { - "version": "3.0.4", - "bundled": true, - "dev": true, - "requires": { - "brace-expansion": "^1.1.7" - } - }, - "minimist": { - "version": "0.0.10", - "bundled": true, - "dev": true - }, - "mkdirp": { - "version": "0.5.1", - "bundled": true, - "dev": true, - "requires": { - "minimist": "0.0.8" - }, - "dependencies": { - "minimist": { - "version": "0.0.8", - "bundled": true, - "dev": true - } - } - }, - "ms": { - "version": "2.0.0", - "bundled": true, - "dev": true - }, - "normalize-package-data": { - "version": "2.4.0", - "bundled": true, - "dev": true, - "requires": { - "hosted-git-info": "^2.1.4", - "is-builtin-module": "^1.0.0", - "semver": "2 || 3 || 4 || 5", - "validate-npm-package-license": "^3.0.1" - } - }, - "npm-run-path": { - "version": "2.0.2", - "bundled": true, - "dev": true, - "requires": { - "path-key": "^2.0.0" - } - }, - "number-is-nan": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "once": { - "version": "1.4.0", - "bundled": true, - "dev": true, - "requires": { - "wrappy": "1" - } - }, - "optimist": { - "version": "0.6.1", - "bundled": true, - "dev": true, - "requires": { - "minimist": "~0.0.1", - "wordwrap": "~0.0.2" - } - }, - "os-homedir": { - "version": "1.0.2", - "bundled": true, - "dev": true - }, - "os-locale": { - "version": "2.1.0", - "bundled": true, - "dev": true, - "requires": { - "execa": "^0.7.0", - "lcid": "^1.0.0", - "mem": "^1.1.0" - } - }, - "p-finally": { - "version": "1.0.0", - "bundled": true, - "dev": true - }, - "p-limit": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "p-try": "^2.0.0" - } - }, - "p-locate": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "p-limit": "^2.0.0" - } - }, - "p-try": { - "version": "2.0.0", - "bundled": true, - "dev": true - }, - "package-hash": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "graceful-fs": "^4.1.11", - "lodash.flattendeep": "^4.4.0", - "md5-hex": "^2.0.0", - "release-zalgo": "^1.0.0" - } - }, - "parse-json": { - "version": "4.0.0", - "bundled": true, - "dev": true, - "requires": { - "error-ex": "^1.3.1", - "json-parse-better-errors": "^1.0.1" - } - }, - "path-exists": { - "version": "3.0.0", - "bundled": true, - "dev": true - }, - "path-is-absolute": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "path-key": { - "version": "2.0.1", - "bundled": true, - "dev": true - }, - "path-type": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "pify": "^3.0.0" - } - }, - "pify": { - "version": "3.0.0", - "bundled": true, - "dev": true - }, - "pkg-dir": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "find-up": "^3.0.0" - } - }, - "pseudomap": { - "version": "1.0.2", - "bundled": true, - "dev": true - }, - "read-pkg": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "load-json-file": "^4.0.0", - "normalize-package-data": "^2.3.2", - "path-type": "^3.0.0" - } - }, - "read-pkg-up": { - "version": "4.0.0", - "bundled": true, - "dev": true, - "requires": { - "find-up": "^3.0.0", - "read-pkg": "^3.0.0" - } - }, - "release-zalgo": { - "version": "1.0.0", - "bundled": true, - "dev": true, - "requires": { - "es6-error": "^4.0.1" - } - }, - "repeat-string": { - "version": "1.6.1", - "bundled": true, - "dev": true - }, - "require-directory": { - "version": "2.1.1", - "bundled": true, - "dev": true - }, - "require-main-filename": { - "version": "1.0.1", - "bundled": true, - "dev": true - }, - "resolve-from": { - "version": "4.0.0", - "bundled": true, - "dev": true - }, - "right-align": { - "version": "0.1.3", - "bundled": true, - "dev": true, - "optional": true, - "requires": { - "align-text": "^0.1.1" - } - }, - "rimraf": { - "version": "2.6.2", - "bundled": true, - "dev": true, - "requires": { - "glob": "^7.0.5" - } - }, - "safe-buffer": { - "version": "5.1.2", - "bundled": true, - "dev": true - }, - "semver": { - "version": "5.5.0", - "bundled": true, - "dev": true - }, - "set-blocking": { - "version": "2.0.0", - "bundled": true, - "dev": true - }, - "shebang-command": { - "version": "1.2.0", - "bundled": true, - "dev": true, - "requires": { - "shebang-regex": "^1.0.0" - } - }, - "shebang-regex": { - "version": "1.0.0", - "bundled": true, - "dev": true - }, - "signal-exit": { - "version": "3.0.2", - "bundled": true, - "dev": true - }, - "source-map": { - "version": "0.5.7", - "bundled": true, - "dev": true, - "optional": true - }, - "spawn-wrap": { - "version": "1.4.2", - "bundled": true, - "dev": true, - "requires": { - "foreground-child": "^1.5.6", - "mkdirp": "^0.5.0", - "os-homedir": "^1.0.1", - "rimraf": "^2.6.2", - "signal-exit": "^3.0.2", - "which": "^1.3.0" - } - }, - "spdx-correct": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "spdx-expression-parse": "^3.0.0", - "spdx-license-ids": "^3.0.0" - } - }, - "spdx-exceptions": { - "version": "2.1.0", - "bundled": true, - "dev": true - }, - "spdx-expression-parse": { - "version": "3.0.0", - "bundled": true, - "dev": true, - "requires": { - "spdx-exceptions": "^2.1.0", - "spdx-license-ids": "^3.0.0" - } - }, - "spdx-license-ids": { - "version": "3.0.0", - "bundled": true, - "dev": true - }, - "string-width": { - "version": "2.1.1", - "bundled": true, - "dev": true, - "requires": { - "is-fullwidth-code-point": "^2.0.0", - "strip-ansi": "^4.0.0" - } - }, - "strip-ansi": { - "version": "4.0.0", - "bundled": true, - "dev": true, - "requires": { - "ansi-regex": "^3.0.0" - } - }, - "strip-bom": { - "version": "3.0.0", - "bundled": true, - "dev": true - }, - "strip-eof": { - "version": "1.0.0", - "bundled": true, - "dev": true - }, - "supports-color": { - "version": "5.4.0", - "bundled": true, - "dev": true, - "requires": { - "has-flag": "^3.0.0" - } - }, - "test-exclude": { - "version": "5.0.0", - "bundled": true, - "dev": true, - "requires": { - "arrify": "^1.0.1", - "minimatch": "^3.0.4", - "read-pkg-up": "^4.0.0", - "require-main-filename": "^1.0.1" - } - }, - "uglify-js": { - "version": "2.8.29", - "bundled": true, - "dev": true, - "optional": true, - "requires": { - "source-map": "~0.5.1", - "uglify-to-browserify": "~1.0.0", - "yargs": "~3.10.0" - }, - "dependencies": { - "yargs": { - "version": "3.10.0", - "bundled": true, - "dev": true, - "optional": true, - "requires": { - "camelcase": "^1.0.2", - "cliui": "^2.1.0", - "decamelize": "^1.0.0", - "window-size": "0.1.0" - } - } - } - }, - "uglify-to-browserify": { - "version": "1.0.2", - "bundled": true, - "dev": true, - "optional": true - }, - "uuid": { - "version": "3.3.2", - "bundled": true, - "dev": true - }, - "validate-npm-package-license": { - "version": "3.0.3", - "bundled": true, - "dev": true, - "requires": { - "spdx-correct": "^3.0.0", - "spdx-expression-parse": "^3.0.0" - } - }, - "which": { - "version": "1.3.1", - "bundled": true, - "dev": true, - "requires": { - "isexe": "^2.0.0" - } - }, - "which-module": { - "version": "2.0.0", - "bundled": true, - "dev": true - }, - "window-size": { - "version": "0.1.0", - "bundled": true, - "dev": true, - "optional": true - }, - "wordwrap": { - "version": "0.0.3", - "bundled": true, - "dev": true - }, - "wrap-ansi": { - "version": "2.1.0", - "bundled": true, - "dev": true, - "requires": { - "string-width": "^1.0.1", - "strip-ansi": "^3.0.1" - }, - "dependencies": { - "ansi-regex": { - "version": "2.1.1", - "bundled": true, - "dev": true - }, - "is-fullwidth-code-point": { - "version": "1.0.0", - "bundled": true, - "dev": true, - "requires": { - "number-is-nan": "^1.0.0" - } - }, - "string-width": { - "version": "1.0.2", - "bundled": true, - "dev": true, - "requires": { - "code-point-at": "^1.0.0", - "is-fullwidth-code-point": "^1.0.0", - "strip-ansi": "^3.0.0" - } - }, - "strip-ansi": { - "version": "3.0.1", - "bundled": true, - "dev": true, - "requires": { - "ansi-regex": "^2.0.0" - } - } - } - }, - "wrappy": { - "version": "1.0.2", - "bundled": true, - "dev": true - }, - "write-file-atomic": { - "version": "2.3.0", - "bundled": true, - "dev": true, - "requires": { - "graceful-fs": "^4.1.11", - "imurmurhash": "^0.1.4", - "signal-exit": "^3.0.2" - } - }, - "y18n": { - "version": "3.2.1", - "bundled": true, - "dev": true - }, - "yallist": { - "version": "2.1.2", - "bundled": true, - "dev": true - }, - "yargs": { - "version": "11.1.0", - "bundled": true, - "dev": true, - "requires": { - "cliui": "^4.0.0", - "decamelize": "^1.1.1", - "find-up": "^2.1.0", - "get-caller-file": "^1.0.1", - "os-locale": "^2.0.0", - "require-directory": "^2.1.1", - "require-main-filename": "^1.0.1", - "set-blocking": "^2.0.0", - "string-width": "^2.0.0", - "which-module": "^2.0.0", - "y18n": "^3.2.1", - "yargs-parser": "^9.0.2" - }, - "dependencies": { - "cliui": { - "version": "4.1.0", - "bundled": true, - "dev": true, - "requires": { - "string-width": "^2.1.1", - "strip-ansi": "^4.0.0", - "wrap-ansi": "^2.0.0" - } - }, - "find-up": { - "version": "2.1.0", - "bundled": true, - "dev": true, - "requires": { - "locate-path": "^2.0.0" - } - }, - "locate-path": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "p-locate": "^2.0.0", - "path-exists": "^3.0.0" - } - }, - "p-limit": { - "version": "1.3.0", - "bundled": true, - "dev": true, - "requires": { - "p-try": "^1.0.0" - } - }, - "p-locate": { - "version": "2.0.0", - "bundled": true, - "dev": true, - "requires": { - "p-limit": "^1.1.0" - } - }, - "p-try": { - "version": "1.0.0", - "bundled": true, - "dev": true - } - } - }, - "yargs-parser": { - "version": "9.0.2", - "bundled": true, - "dev": true, - "requires": { - "camelcase": "^4.1.0" - }, - "dependencies": { - "camelcase": { - "version": "4.1.0", - "bundled": true, - "dev": true - } - } - } - } - }, - "pathval": { - "version": "1.1.0", - "resolved": "https://registry.npmjs.org/pathval/-/pathval-1.1.0.tgz", - "integrity": "sha1-uULm1L3mUwBe9rcTYd74cn0GReA=", - "dev": true - }, - "semver": { - "version": "5.6.0", - "resolved": "https://registry.npmjs.org/semver/-/semver-5.6.0.tgz", - "integrity": "sha512-RS9R6R35NYgQn++fkDWaOmqGoj4Ek9gGs+DPxNUZKuwE183xjJroKvyo1IzVFeXvUrvmALy6FWD5xrdJT25gMg==", - "dev": true - }, - "sigmund": { - "version": "1.0.1", - "resolved": "https://registry.npmjs.org/sigmund/-/sigmund-1.0.1.tgz", - "integrity": "sha1-P/IfGYytIXX587eBhT/ZTQ0ZtZA=", - "dev": true - }, - "source-map": { - "version": "0.5.7", - "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.5.7.tgz", - "integrity": "sha1-igOdLRAh0i0eoUyA2OpGi6LvP8w=", - "dev": true - }, - "supports-color": { - "version": "1.2.0", - "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-1.2.0.tgz", - "integrity": "sha1-/x7R5hFp0Gs88tWI4YixjYhH4X4=", - "dev": true - }, - "to-fast-properties": { - "version": "2.0.0", - "resolved": "https://registry.npmjs.org/to-fast-properties/-/to-fast-properties-2.0.0.tgz", - "integrity": "sha1-3F5pjL0HkmW8c+A3doGk5Og/YW4=", - "dev": true - }, - "to-iso-string": { - "version": "0.0.2", - "resolved": "https://registry.npmjs.org/to-iso-string/-/to-iso-string-0.0.2.tgz", - "integrity": "sha1-TcGeZk38y+Jb2NtQiwDG2hWCVdE=", - "dev": true - }, - "trim-right": { - "version": "1.0.1", - "resolved": "https://registry.npmjs.org/trim-right/-/trim-right-1.0.1.tgz", - "integrity": "sha1-yy4SAwZ+DI3h9hQJS5/kVwTqYAM=", - "dev": true - }, - "type-detect": { - "version": "4.0.8", - "resolved": "https://registry.npmjs.org/type-detect/-/type-detect-4.0.8.tgz", - "integrity": "sha512-0fr/mIH1dlO+x7TlcMy+bIDqKPsw/70tVyeHW787goQjhmqaZe10uwLujubK9q9Lg6Fiho1KUKDYz0Z7k7g5/g==", - "dev": true - } - } -} diff --git a/ijs/package.json b/ijs/package.json deleted file mode 100644 index 9c52b6d..0000000 --- a/ijs/package.json +++ /dev/null @@ -1,26 +0,0 @@ -{ - "name": "@syndicate-lang/core", - "version": "0.0.0", - "description": "Imperative Syndicate in the browser", - "homepage": "https://github.com/syndicate-lang/syndicate-js-core", - "license": "GPL-3.0+", - "repository": { - "type": "git", - "url": "git://github.com/syndicate-lang/syndicate-js-core" - }, - "scripts": { - "clean": "rm -f dist/*", - "test": "mocha", - "cover": "nyc --reporter=html mocha" - }, - "author": "Tony Garnock-Jones ", - "devDependencies": { - "chai": "^4.2.0", - "chai-immutable": "^2.0.0-rc.2", - "mocha": "^2.5.3", - "nyc": "^13.1.0" - }, - "dependencies": { - "immutable": "^3.8.2" - } -} diff --git a/ijs/src/assertions.js b/ijs/src/assertions.js deleted file mode 100644 index d6f4a47..0000000 --- a/ijs/src/assertions.js +++ /dev/null @@ -1,29 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -var Struct = require('./struct.js'); - -function Seal(contents) { - this.contents = contents; -} - -module.exports.Observe = Struct.makeConstructor('Observe', ['specification']); -module.exports.Seal = Seal; -module.exports.Inbound = Struct.makeConstructor('Inbound', ['assertion']); -module.exports.Outbound = Struct.makeConstructor('Outbound', ['assertion']); diff --git a/ijs/src/bag.js b/ijs/src/bag.js deleted file mode 100644 index 9d7f9d1..0000000 --- a/ijs/src/bag.js +++ /dev/null @@ -1,123 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -// Bags and Deltas (which are Bags where item-counts can be negative). - -const Immutable = require("immutable"); - -const PRESENT_TO_ABSENT = -1; -const ABSENT_TO_ABSENT = 0; -const ABSENT_TO_PRESENT = 1; -const PRESENT_TO_PRESENT = 2; - -/////////////////////////////////////////////////////////////////////////// - -function MutableBag(s) { - this._items = s ? fromSet(s) : Immutable.Map(); -} - -MutableBag.prototype.change = function (key, delta) { - var net; - ({bag: this._items, net: net} = change(this._items, key, delta)); - return net; -}; - -MutableBag.prototype.get = function (key) { - return get(this._items, key); -}; - -MutableBag.prototype.clear = function () { - this._items = Immutable.Map(); -}; - -MutableBag.prototype.includes = function (key) { - return includes(this._items, key); -}; - -MutableBag.prototype.isEmpty = function () { - return this._items.isEmpty(); -}; - -MutableBag.prototype.count = function () { - return this._items.count(); -}; - -MutableBag.prototype.keys = function () { - return this._items.keys(); -}; - -MutableBag.prototype.entries = function () { - return this._items.entries(); -}; - -MutableBag.prototype.snapshot = function () { - return this._items; -}; - -/////////////////////////////////////////////////////////////////////////// - -const Bag = Immutable.Map; - -function fromSet(s) { - return Bag().withMutations(function (b) { - for (let v of Immutable.Set(s)) { - b = b.set(v, 1); - } - }); -} - -function change(bag, key, delta, clamp) { - let oldCount = get(bag, key); - let newCount = oldCount + delta; - if (clamp) { - newCount = Math.max(0, newCount); - } - if (newCount === 0) { - return { - bag: bag.remove(key), - net: (oldCount === 0) ? ABSENT_TO_ABSENT : PRESENT_TO_ABSENT - }; - } else { - return { - bag: bag.set(key, newCount), - net: (oldCount === 0) ? ABSENT_TO_PRESENT : PRESENT_TO_PRESENT - }; - } -} - -function get(bag, key) { - return bag.get(key, 0); -} - -function includes(bag, key) { - return get(bag, key) > 0; -} - -/////////////////////////////////////////////////////////////////////////// - -module.exports.PRESENT_TO_ABSENT = PRESENT_TO_ABSENT; -module.exports.ABSENT_TO_ABSENT = ABSENT_TO_ABSENT; -module.exports.ABSENT_TO_PRESENT = ABSENT_TO_PRESENT; -module.exports.PRESENT_TO_PRESENT = PRESENT_TO_PRESENT; -module.exports.MutableBag = MutableBag; -module.exports.Bag = Bag; -module.exports.fromSet = fromSet; -module.exports.change = change; -module.exports.get = get; -module.exports.includes = includes; diff --git a/ijs/src/dataflow.js b/ijs/src/dataflow.js deleted file mode 100644 index 0b2dc46..0000000 --- a/ijs/src/dataflow.js +++ /dev/null @@ -1,125 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -// Property-based "dataflow" - -var Immutable = require("immutable"); -var MapSet = require("./mapset.js"); - -function Graph() { - this.edgesForward = Immutable.Map(); - this.edgesReverse = Immutable.Map(); - this.damagedNodes = Immutable.Set(); - this.currentSubjectId = null; -} - -Graph.prototype.withSubject = function (subjectId, f) { - var oldSubjectId = this.currentSubjectId; - this.currentSubjectId = subjectId; - var result; - try { - result = f(); - } catch (e) { - this.currentSubjectId = oldSubjectId; - throw e; - } - this.currentSubjectId = oldSubjectId; - return result; -}; - -Graph.prototype.recordObservation = function (objectId) { - if (this.currentSubjectId) { - this.edgesForward = MapSet.add(this.edgesForward, objectId, this.currentSubjectId); - this.edgesReverse = MapSet.add(this.edgesReverse, this.currentSubjectId, objectId); - } -}; - -Graph.prototype.recordDamage = function (objectId) { - this.damagedNodes = this.damagedNodes.add(objectId); -}; - -Graph.prototype.forgetSubject = function (subjectId) { - var self = this; - var subjectObjects = self.edgesReverse.get(subjectId) || Immutable.Set(); - self.edgesReverse = self.edgesReverse.remove(subjectId); - subjectObjects.forEach(function (objectId) { - self.edgesForward = MapSet.remove(self.edgesForward, objectId, subjectId); - }); -}; - -Graph.prototype.repairDamage = function (repairNode) { - var self = this; - var repairedThisRound = Immutable.Set(); - while (true) { - var workSet = self.damagedNodes; - self.damagedNodes = Immutable.Set(); - - var alreadyDamaged = workSet.intersect(repairedThisRound); - if (!alreadyDamaged.isEmpty()) { - console.warn('Cyclic dependencies involving', alreadyDamaged); - } - - workSet = workSet.subtract(repairedThisRound); - repairedThisRound = repairedThisRound.union(workSet); - - if (workSet.isEmpty()) break; - - workSet.forEach(function (objectId) { - var subjects = self.edgesForward.get(objectId) || Immutable.Set(); - subjects.forEach(function (subjectId) { - self.forgetSubject(subjectId); - self.withSubject(subjectId, function () { - repairNode(subjectId); - }); - }); - }); - } -}; - -Graph.prototype.defineObservableProperty = function (obj, prop, value, maybeOptions) { - var graph = this; - var options = maybeOptions === void 0 ? {} : maybeOptions; - var objectId = options.objectId || '__' + prop; - Object.defineProperty(obj, prop, { - configurable: true, - enumerable: true, - get: function () { - graph.recordObservation(objectId); - return value; - }, - set: function (newValue) { - if (!options.noopGuard || !options.noopGuard(value, newValue)) { - graph.recordDamage(objectId); - value = newValue; - } - } - }); - graph.recordDamage(objectId); - return objectId; -}; - -Graph.newScope = function (o) { - function O() {} - O.prototype = o; - return new O(); -}; - -/////////////////////////////////////////////////////////////////////////// - -module.exports.Graph = Graph; diff --git a/ijs/src/dataspace.js b/ijs/src/dataspace.js deleted file mode 100644 index 3e81baa..0000000 --- a/ijs/src/dataspace.js +++ /dev/null @@ -1,538 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -const Immutable = require("immutable"); -const Struct = require('./struct.js'); -const Skeleton = require('./skeleton.js'); -const $Special = require('./special.js'); -const Bag = require('./bag.js'); -const Assertions = require('./assertions.js'); -const Dataflow = require('./dataflow.js'); - -const __ = Struct.__; -const _$ = Struct._$; - -const PRIORITY = Object.freeze({ - QUERY_HIGH: 0, - QUERY: 1, - QUERY_HANDLER: 2, - NORMAL: 3, - GC: 4, - IDLE: 5, - _count: 6 -}); - -function Dataspace(bootProc) { - this.nextId = 0; - this.index = new Skeleton.Index(); - this.dataflow = new Dataflow.Graph(); - this.runnable = Immutable.List(); - this.pendingActions = Immutable.List([ - new ActionGroup(null, Immutable.List([new Spawn(null, bootProc, Immutable.Set())]))]); -} - -// Parameters -Dataspace._currentFacet = null; -Dataspace._inScript = true; - -Dataspace.currentFacet = function () { return Dataspace._currentFacet; }; - -Dataspace.withNonScriptContext = function (thunk) { - let savedInScript = Dataspace._inScript; - Dataspace._inScript = false; - try { - return thunk(); - } finally { - Dataspace._inScript = savedInScript; - } -}; - -Dataspace.withCurrentFacet = function (facet, thunk) { - let savedFacet = Dataspace._currentFacet; - Dataspace._currentFacet = facet; - try { - let result = thunk(); - Dataspace._currentFacet = savedFacet; - return result; - } catch (e) { - let a = facet.actor; - a.abandonQueuedWork(); - a._terminate(); - Dataspace._currentFacet = savedFacet; - throw e; - } -}; - -Dataspace.wrap = function (f) { - let savedFacet = Dataspace._currentFacet; - return function () { - let actuals = arguments; - return Dataspace.withCurrentFacet(savedFacet, function () { - return f.apply(f.fields, actuals); - }); - }; -}; - - -Dataspace.referenceField = function (obj, prop) { - if (!(prop in obj)) { - Dataspace._currentFacet.actor.dataspace.dataflow.recordObservation( - Immutable.List.of(obj, prop)); - } - return obj[prop]; -}; - -Dataspace.declareField = function (obj, prop, init) { - if (prop in obj) { - obj[prop] = init; - } else { - Dataspace._currentFacet.actor.dataspace.dataflow.defineObservableProperty( - obj, - prop, - init, - { objectId: Immutable.List.of(obj, prop) }); - } -}; - -Dataspace.deleteField = function (obj, prop) { - Dataspace._currentFacet.actor.dataspace.dataflow.recordDamage(Immutable.List.of(obj, prop)); - return delete obj[prop]; -}; - -Dataspace.prototype.runScripts = function () { // TODO: rename? - this.runPendingScripts(); - this.performPendingActions(); - return !this.runnable.isEmpty() || !this.pendingActions.isEmpty(); -}; - -Dataspace.prototype.runPendingScripts = function () { - let runnable = this.runnable; - this.runnable = Immutable.List(); - runnable.forEach((ac) => { ac.runPendingScripts(); /* TODO: rename? */ }); -}; - -Dataspace.prototype.performPendingActions = function () { - let groups = this.pendingActions; - this.pendingActions = Immutable.List(); - groups.forEach((group) => { - group.actions.forEach((action) => { - action.perform(this, group.actor); - this.runPendingScripts(); - }); - }); -}; - -Dataspace.prototype.commitActions = function (ac, pending) { - this.pendingActions = this.pendingActions.push(new ActionGroup(ac, pending)); -}; - -Dataspace.prototype.refreshAssertions = function () { - Dataspace.withNonScriptContext(() => { - this.dataflow.repairDamage((subjectId) => { - let [facet, eid] = subjectId; - if (facet.isLive) { // TODO: necessary test, or tautological? - let ac = facet.actor; - Dataspace.withCurrentFacet(facet, () => { - facet.endpoints.get(eid).refresh(this, ac, facet); - }); - } - }); - }); -}; - -Dataspace.prototype.addActor = function (name, bootProc, initialAssertions) { - let ac = new Actor(this, name, initialAssertions); - this.applyPatch(ac, ac.adhocAssertions.snapshot()); - ac.addFacet(null, () => { - // Root facet is a dummy "system" facet that exists to hold - // one-or-more "user" "root" facets. - ac.addFacet(Dataspace.currentFacet(), bootProc); - // ^ The "true root", user-visible facet. - initialAssertions.forEach((a) => { ac.adhocRetract(a); }); - }); -}; - -Dataspace.prototype.applyPatch = function (ac, delta) { - delta.forEach((count, a) => { - if (a !== void 0) { - this.index.adjustAssertion(a, count); - ac.cleanupChanges.change(a, -count); - } - }); -}; - -Dataspace.prototype.subscribe = function (handler) { - this.index.addHandler(handler, handler.callback); -}; - -Dataspace.prototype.unsubscribe = function (handler) { - this.index.removeHandler(handler, handler.callback); -}; - -function Actor(dataspace, name, initialAssertions) { - this.id = dataspace.nextId++; - this.dataspace = dataspace; - this.name = name; - this.rootFacet = null; - this.isRunnable = false; - this.pendingScripts = []; - for (let i = 0; i < PRIORITY._count; i++) { this.pendingScripts.push(Immutable.List()); } - this.pendingActions = Immutable.List(); - this.adhocAssertions = new Bag.MutableBag(initialAssertions); // no negative counts allowed - this.cleanupChanges = new Bag.MutableBag(); // negative counts allowed! -} - -Actor.prototype.runPendingScripts = function () { - while (true) { - let script = this.popNextScript(); - if (!script) break; - script(); - this.dataspace.refreshAssertions(); - } - - this.isRunnable = false; - let pending = this.pendingActions; - if (!pending.isEmpty()) { - this.pendingActions = Immutable.List(); - this.dataspace.commitActions(this, pending); - } -}; - -Actor.prototype.popNextScript = function () { - let scripts = this.pendingScripts; - for (let i = 0; i < PRIORITY._count; i++) { - let q = scripts[i]; - if (!q.isEmpty()) { - scripts[i] = q.shift(); - return q.first(); - } - } - return null; -}; - -Actor.prototype.abandonQueuedWork = function () { - this.pendingActions = Immutable.List(); - for (let i = 0; i < PRIORITY._count; i++) { this.pendingScripts[i] = Immutable.List(); } -}; - -Actor.prototype.scheduleScript = function (unwrappedThunk, priority) { - this.pushScript(Dataspace.wrap(unwrappedThunk), priority); -}; - -Actor.prototype.pushScript = function (wrappedThunk, priority) { - // The wrappedThunk must already have code for ensuring - // _currentFacet is correct inside it. Compare with scheduleScript. - if (priority === void 0) { - priority = PRIORITY.NORMAL; - } - if (!this.isRunnable) { - this.isRunnable = true; - this.dataspace.runnable = this.dataspace.runnable.push(this); - } - this.pendingScripts[priority] = this.pendingScripts[priority].push(wrappedThunk); -}; - -Actor.prototype.addFacet = function (parentFacet, bootProc, checkInScript) { - if (checkInScript === true && !Dataspace._inScript) { - throw new Error("Cannot add facet outside script; are you missing a `react { ... }`?"); - } - let f = new Facet(this, parentFacet); - Dataspace.withCurrentFacet(f, () => { - Dataspace.withNonScriptContext(() => { - bootProc.call(f.fields); - }); - }); - this.pushScript(() => { - if ((parentFacet && !parentFacet.isLive) || f.isInert()) { - f._terminate(); - } - }); -}; - -Actor.prototype._terminate = function () { - // Abruptly terminates an entire actor, without running stop-scripts etc. - this.pushScript(() => { - this.adhocAssertions.snapshot().forEach((_count, a) => { this.retract(a); }); - }); - if (this.rootFacet) { - this.rootFacet._abort(); - } - this.pushScript(() => { this.enqueueScriptAction(new Quit()); }); -}; - -Actor.prototype.enqueueScriptAction = function (action) { - this.pendingActions = this.pendingActions.push(action); -}; - -Actor.prototype.pendingPatch = function () { - if (!this.pendingActions.isEmpty()) { - let p = this.pendingActions.last(); - if (p instanceof Patch) { - return p; - } - } - - let p = new Patch(Bag.Bag()); - this.enqueueScriptAction(p); - return p; -}; - -Actor.prototype.assert = function (a) { this.pendingPatch().adjust(a, +1); }; -Actor.prototype.retract = function (a) { this.pendingPatch().adjust(a, -1); }; - -Actor.prototype.toString = function () { - let s = 'Actor(' + this.id; - if (this.name !== void 0) s = s + ',' + JSON.stringify(this.name); - return s + ')'; -}; - -function Patch(changes) { - this.changes = changes; -} - -Patch.prototype.perform = function (ds, ac) { - ds.applyPatch(ac, this.changes); -}; - -Patch.prototype.adjust = function (a, count) { - var _net; - ({bag: this.changes, net: _net} = Bag.change(this.changes, a, count)); -}; - -function Message(body) { - this.body = body; -} - -Message.prototype.perform = function (ds, ac) { - if (this.body !== void 0) { - ds.index.sendMessage(this.body); - } -}; - -Dataspace.send = function (body) { - Dataspace._currentFacet.actor.enqueueScriptAction(new Message(body)); -}; - -function Spawn(name, bootProc, initialAssertions) { - this.name = name; - this.bootProc = bootProc; - this.initialAssertions = initialAssertions || Immutable.Set(); -} - -Spawn.prototype.perform = function (ds, ac) { - ds.addActor(this.name, this.bootProc, this.initialAssertions); -}; - -Dataspace.spawn = function (name, bootProc, initialAssertions) { - let a = new Spawn(name, bootProc, initialAssertions); - Dataspace._currentFacet.actor.enqueueScriptAction(a); -}; - -function Quit() { // TODO: rename? Perhaps to Cleanup? - // Pseudo-action - not for userland use. -} - -Quit.prototype.perform = function (ds, ac) { - ds.applyPatch(ac, ac.cleanupChanges.snapshot()); -}; - -function DeferredTurn(continuation) { - this.continuation = continuation; -} - -DeferredTurn.prototype.perform = function (ds, ac) { - ac.pushScript(this.continuation); -}; - -Dataspace.deferTurn = function (continuation) { - Dataspace._currentFacet.actor.enqueueScriptAction(new DeferredTurn(Dataspace.wrap(continuation))); -}; - -function ActionGroup(actor, actions) { - this.actor = actor; - this.actions = actions; -} - -function Facet(actor, parent) { - this.id = actor.dataspace.nextId++; - this.isLive = true; - this.actor = actor; - this.parent = parent; - this.endpoints = Immutable.Map(); - this.stopScripts = Immutable.List(); - this.children = Immutable.Set(); - if (parent) { - parent.children = parent.children.add(this); - this.fields = Dataflow.Graph.newScope(parent.fields); - } else { - if (actor.rootFacet) { - throw new Error("INVARIANT VIOLATED: Attempt to add second root facet"); - } - actor.rootFacet = this; - this.fields = Dataflow.Graph.newScope({}); - } -} - -Facet.prototype._abort = function () { - this.isLive = false; - this.children.forEach((child) => { child._abort(); }); - this.retractAssertionsAndSubscriptions(); -}; - -Facet.prototype.retractAssertionsAndSubscriptions = function () { - let ac = this.actor; - let ds = ac.dataspace; - ac.pushScript(() => { - this.endpoints.forEach((ep) => { - ep.destroy(ds, ac, this); - }); - this.endpoints = Immutable.Map(); - }); -}; - -Facet.prototype.isInert = function () { - return this.endpoints.isEmpty() && this.children.isEmpty(); -}; - -Facet.prototype._terminate = function () { - if (this.isLive) { - let ac = this.actor; - let parent = this.parent; - if (parent) { - parent.children = parent.children.remove(this); - } else { - ac.rootFacet = null; - } - this.isLive = false; - - this.children.forEach((child) => { child._terminate(); }); - - // Run stop-scripts after terminating children. This means that - // children's stop-scripts run before ours. - ac.pushScript(() => { - Dataspace.withCurrentFacet(this, () => { - this.stopScripts.forEach((s) => { s.call(this.fields); }); - }); - }); - - this.retractAssertionsAndSubscriptions(); - ac.pushScript(() => { - if (parent) { - if (parent.isInert()) { - parent._terminate(); - } - } else { - ac._terminate(); - } - }, PRIORITY.GC); - } -}; - -Facet.prototype.stop = function (continuation) { - Dataspace.withCurrentFacet(this.parent, () => { - this.actor.scheduleScript(() => { - this._terminate(); - this.actor.scheduleScript(() => { - continuation.call(this.fields); // TODO: is this the correct scope to use?? - }); - }); - }); -}; - -Facet.prototype.addStopScript = function (s) { - this.stopScripts = this.stopScripts.push(s); -}; - -Facet.prototype.addEndpoint = function (updateFun, isDynamic) { - return new Endpoint(this, isDynamic === void 0 ? true : isDynamic, updateFun); -}; - -Facet.prototype.addDataflow = function (subjectFun, priority) { - return this.addEndpoint(() => { - let subjectId = this.actor.dataspace.dataflow.currentSubjectId; - this.actor.scheduleScript(() => { - this.actor.dataspace.dataflow.withSubject(subjectId, () => subjectFun.call(this.fields)); - }, priority); - return [void 0, null]; - }); -}; - -Facet.prototype.toString = function () { - let s = 'Facet(' + this.actor.id; - if (this.actor.name !== void 0) s = s + ',' + JSON.stringify(this.actor.name); - s = s + ',' + this.id; - let f = this.parent; - while (f != null) { - s = s + ':' + f.id; - f = f.parent; - } - return s + ')'; -}; - -function Endpoint(facet, isDynamic, updateFun) { - if (Dataspace._inScript) { - throw new Error("Cannot add endpoint in script; are you missing a `react { ... }`?"); - } - let ac = facet.actor; - let ds = ac.dataspace; - this.id = ds.nextId++; - this.updateFun = updateFun; - let [initialAssertion, initialHandler] = ds.dataflow.withSubject( - isDynamic ? [facet, this.id] : false, - () => updateFun.call(facet.fields)); - this._install(ds, ac, initialAssertion, initialHandler); - facet.endpoints = facet.endpoints.set(this.id, this); -} - -Endpoint.prototype._install = function (ds, ac, assertion, handler) { - this.assertion = assertion; - this.handler = handler; - ac.assert(this.assertion); - if (this.handler) { ds.subscribe(this.handler); } -}; - -Endpoint.prototype._uninstall = function (ds, ac) { - ac.retract(this.assertion); - if (this.handler) { ds.unsubscribe(this.handler); } -}; - -Endpoint.prototype.refresh = function (ds, ac, facet) { - let [newAssertion, newHandler] = this.updateFun.call(facet.fields); - newAssertion = Immutable.fromJS(newAssertion); - if (!Immutable.is(newAssertion, this.assertion)) { - this._uninstall(ds, ac); - this._install(ds, ac, newAssertion, newHandler); - } -}; - -Endpoint.prototype.destroy = function (ds, ac, facet) { - ds.dataflow.forgetSubject([facet, this.id]); - // ^ TODO: this won't work because of object identity problems! Why - // does the Racket implementation do this, when the old JS - // implementation doesn't? - this._uninstall(ds, ac); -}; - -Endpoint.prototype.toString = function () { - return 'Endpoint(' + this.id + ')'; -}; - -/////////////////////////////////////////////////////////////////////////// - -module.exports.Dataspace = Dataspace; diff --git a/ijs/src/index.js b/ijs/src/index.js deleted file mode 100644 index 61a110a..0000000 --- a/ijs/src/index.js +++ /dev/null @@ -1,41 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -const Struct = require('./struct.js'); -const Skeleton = require('./skeleton.js'); -const Dataspace = require('./dataspace.js'); -const Assertions = require('./assertions.js'); - -module.exports.Immutable = require('immutable'); -// ^ for use by import machinery in syntactic extensions - -module.exports.Bag = require("./bag.js"); -module.exports.Struct = Struct; -module.exports.Skeleton = Skeleton; -module.exports.__ = Struct.__; -module.exports._$ = Skeleton._$; - -module.exports._Dataspace = Dataspace; -module.exports.Dataspace = Dataspace.Dataspace; - -module.exports._Assertions = Assertions; -module.exports.Observe = Assertions.Observe; -module.exports.Seal = Assertions.Seal; -module.exports.Inbound = Assertions.Inbound; -module.exports.Outbound = Assertions.Outbound; diff --git a/ijs/src/mapset.js b/ijs/src/mapset.js deleted file mode 100644 index 77c2bf2..0000000 --- a/ijs/src/mapset.js +++ /dev/null @@ -1,44 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -// Utilities for Maps of Sets - -var Immutable = require('immutable'); - -function add(ms, key, val) { - return ms.set(key, (ms.get(key) || Immutable.Set()).add(val)); -} - -function remove(ms, key, val) { - var oldSet = ms.get(key); - if (oldSet) { - var newSet = oldSet.remove(val); - if (newSet.isEmpty()) { - ms = ms.remove(key); - } else { - ms = ms.set(key, newSet); - } - } - return ms; -} - -/////////////////////////////////////////////////////////////////////////// - -module.exports.add = add; -module.exports.remove = remove; diff --git a/ijs/src/skeleton.js b/ijs/src/skeleton.js deleted file mode 100644 index a8f426d..0000000 --- a/ijs/src/skeleton.js +++ /dev/null @@ -1,342 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -const Immutable = require("immutable"); -const Struct = require('./struct.js'); -const $Special = require('./special.js'); -const Bag = require('./bag.js'); -const Assertions = require('./assertions.js'); - -const __ = Struct.__; - -const EVENT_ADDED = +1; -const EVENT_REMOVED = -1; -const EVENT_MESSAGE = 0; - -function Index() { - this.allAssertions = Bag.Bag(); - this.root = new Node(new Continuation(Immutable.Set())); -} - -function Node(continuation) { - this.continuation = continuation; - this.edges = Immutable.Map(); -} - -function Selector(popCount, index) { - this.popCount = popCount; - this.index = index; -} - -Selector.prototype.equals = function (other) { - return (this.popCount === other.popCount) && (this.index === other.index); -}; - -Selector.prototype.hashCode = function () { - return (this.popCount * 5) + this.index; -}; - -function Continuation(cachedAssertions) { - this.cachedAssertions = cachedAssertions; - this.leafMap = Immutable.Map(); -} - -function Leaf(cachedAssertions) { - this.cachedAssertions = cachedAssertions; - this.handlerMap = Immutable.Map(); -} - -function Handler(cachedCaptures) { - this.cachedCaptures = cachedCaptures; - this.callbacks = Immutable.Set(); -} - -function classOf(v) { - if (v instanceof Struct.Structure) { - return v.meta; - } else if (v instanceof Immutable.List) { - return v.size; - } else { - return null; - } -} - -function step(v, index) { - return v.get(index); -} - -function projectPath(v, path) { - path.forEach((index) => { v = step(v, index); return true; }); - return v; -} - -function projectPaths(v, paths) { - return paths.map((path) => projectPath(v, path)); -} - -Node.prototype.extend = function(skeleton) { - function walkNode(path, node, popCount, index, skeleton) { - if (skeleton === null) { - return [popCount, node]; - } else { - let selector = new Selector(popCount, index); - let cls = skeleton[0]; - let table = node.edges.get(selector, false); - if (!table) { - table = Immutable.Map(); - node.edges = node.edges.set(selector, table); - } - let nextNode = table.get(cls, false); - if (!nextNode) { - nextNode = new Node(new Continuation( - node.continuation.cachedAssertions.filter( - (a) => classOf(projectPath(a, path)) === cls))); - table = table.set(cls, nextNode); - node.edges = node.edges.set(selector, table); - } - - popCount = 0; - index = 0; - path = path.push(index); - for (let i = 1; i < skeleton.length; i++) { - [popCount, nextNode] = walkNode(path, nextNode, popCount, index, skeleton[i]); - index++; - path = path.pop().push(index); - } - return [popCount + 1, nextNode]; - } - } - - let [_popCount, finalNode] = walkNode(Immutable.List(), this, 0, 0, skeleton); - return finalNode.continuation; -}; - -Index.prototype.addHandler = function(analysisResults, callback) { - let {skeleton, constPaths, constVals, capturePaths} = analysisResults; - let continuation = this.root.extend(skeleton); - let constValMap = continuation.leafMap.get(constPaths, false); - if (!constValMap) { - constValMap = Immutable.Map(); - continuation.leafMap = continuation.leafMap.set(constPaths, constValMap); - } - let leaf = constValMap.get(constVals, false); - if (!leaf) { - leaf = new Leaf(continuation.cachedAssertions.filter( - (a) => projectPaths(a, constPaths).equals(constVals))); - constValMap = constValMap.set(constVals, leaf); - continuation.leafMap = continuation.leafMap.set(constPaths, constValMap); - } - let handler = leaf.handlerMap.get(capturePaths, false); - if (!handler) { - let cachedCaptures = Bag.Bag().withMutations((mutable) => { - leaf.cachedAssertions.forEach((a) => { - let captures = projectPaths(a, capturePaths); - mutable.set(captures, mutable.get(captures, 0) + 1); - return true; - }) - }); - handler = new Handler(cachedCaptures); - leaf.handlerMap = leaf.handlerMap.set(capturePaths, handler); - } - handler.callbacks = handler.callbacks.add(callback); - handler.cachedCaptures.forEach((_count, captures) => { - callback(EVENT_ADDED, captures); - return true; - }); -}; - -Index.prototype.removeHandler = function(analysisResults, callback) { - let {skeleton, constPaths, constVals, capturePaths} = analysisResults; - let continuation = this.root.extend(skeleton); - let constValMap = continuation.leafMap.get(constPaths, false); - if (!constValMap) return; - let leaf = constValMap.get(constVals, false); - if (!leaf) return; - let handler = leaf.handlerMap.get(capturePaths, false); - if (!handler) return; - handler.callbacks = handler.callbacks.remove(callback); - if (handler.callbacks.isEmpty()) { - leaf.handlerMap = leaf.handlerMap.remove(capturePaths); - } - if (leaf.handlerMap.isEmpty()) { - constValMap = constValMap.remove(constVals); - } - if (constValMap.isEmpty()) { - continuation.leafMap.remove(constPaths); - } else { - continuation.leafMap.set(constPaths, constValMap); - } -}; - -Node.prototype.modify = function(outerValue, m_cont, m_leaf, m_handler) { - function walkNode(node, termStack) { - walkContinuation(node.continuation); - node.edges.forEach((table, selector) => { - let nextStack = termStack.withMutations((mutable) => { - let i = selector.popCount; - while (i--) { mutable.pop(); } - }); - let nextValue = step(nextStack.first(), selector.index); - let cls = classOf(nextValue); - let nextNode = table.get(cls, false); - if (nextNode) { - walkNode(nextNode, nextStack.push(nextValue)); - } - return true; - }); - } - - function walkContinuation(continuation) { - m_cont(continuation, outerValue); - continuation.leafMap.forEach((constValMap, constPaths) => { - let constVals = projectPaths(outerValue, constPaths); - let leaf = constValMap.get(constVals, false); - if (leaf) { - m_leaf(leaf, outerValue); - leaf.handlerMap.forEach((handler, capturePaths) => { - m_handler(handler, projectPaths(outerValue, capturePaths)); - return true; - }); - } - return true; - }); - } - - walkNode(this, Immutable.Stack().push(Immutable.List([outerValue]))); -}; - -function add_to_cont(c, v) { c.cachedAssertions = c.cachedAssertions.add(v); } -function add_to_leaf(l, v) { l.cachedAssertions = l.cachedAssertions.add(v); } -function add_to_handler(h, vs) { - let net; - ({bag: h.cachedCaptures, net: net} = Bag.change(h.cachedCaptures, vs, +1)); - if (net === Bag.ABSENT_TO_PRESENT) { - h.callbacks.forEach((cb) => { - cb(EVENT_ADDED, vs); - return true; - }); - } -} - -function del_from_cont(c, v) { c.cachedAssertions = c.cachedAssertions.remove(v); } -function del_from_leaf(l, v) { l.cachedAssertions = l.cachedAssertions.remove(v); } -function del_from_handler(h, vs) { - let net; - ({bag: h.cachedCaptures, net: net} = Bag.change(h.cachedCaptures, vs, -1)); - if (net === Bag.PRESENT_TO_ABSENT) { - h.callbacks.forEach((cb) => { - cb(EVENT_REMOVED, vs); - return true; - }); - } -} - -Index.prototype.adjustAssertion = function(outerValue, delta) { - let net; - outerValue = Immutable.fromJS(outerValue); - ({bag: this.allAssertions, net: net} = Bag.change(this.allAssertions, outerValue, delta)); - switch (net) { - case Bag.ABSENT_TO_PRESENT: - this.root.modify(outerValue, add_to_cont, add_to_leaf, add_to_handler); - break; - case Bag.PRESENT_TO_ABSENT: - this.root.modify(outerValue, del_from_cont, del_from_leaf, del_from_handler); - break; - } -}; - -Index.prototype.addAssertion = function(v) { this.adjustAssertion(v, +1); }; -Index.prototype.removeAssertion = function (v) { this.adjustAssertion(v, -1); }; - -Index.prototype.sendMessage = function(v) { - this.root.modify(Immutable.fromJS(v), ()=>{}, ()=>{}, (h, vs) => { - h.callbacks.forEach((cb) => { - cb(EVENT_MESSAGE, vs); - return true; - }); - }); -}; - -/////////////////////////////////////////////////////////////////////////// - -// The name argument should be a string or null; it defaults to null. -// The pattern argument defaults to wildcard, __. -function Capture(name, pattern) { - this.name = name; - this.pattern = (pattern === void 0 ? __ : pattern); -} - -// Abbreviation: _$(...) <==> new Capture(...) -function _$(name, pattern) { - return new Capture(name, pattern); -} - -function isCapture(x) { return x instanceof Capture || x === _$; } -function captureName(x) { return x instanceof Capture ? x.name : null; } -function capturePattern(x) { return x instanceof Capture ? x.pattern : __; } - -/////////////////////////////////////////////////////////////////////////// - -function analyzeAssertion(a) { - let constPaths = Immutable.List(); - let constVals = Immutable.List(); - let capturePaths = Immutable.List(); - - function walk(path, a) { - let cls = classOf(a); - if (cls !== null) { - let arity = (typeof cls === 'number') ? cls : cls.arity; - let result = [cls]; - for (let i = 0; i < arity; i++) { - result.push(walk(path.push(i), step(a, i))); - } - return result; - } else { - if (isCapture(a)) { - capturePaths = capturePaths.push(path); - return walk(path, capturePattern(a)); - } else if (a === __) { - return null; - } else { - constPaths = constPaths.push(path); - constVals = constVals.push(a); - return null; - } - } - } - - let skeleton = walk(Immutable.List(), Immutable.fromJS(a)); - - return { skeleton, constPaths, constVals, capturePaths }; -} - -/////////////////////////////////////////////////////////////////////////// - -module.exports.EVENT_ADDED = EVENT_ADDED; -module.exports.EVENT_REMOVED = EVENT_REMOVED; -module.exports.EVENT_MESSAGE = EVENT_MESSAGE; -module.exports.Index = Index; - -module.exports.Capture = Capture; -module.exports._$ = _$; -module.exports.isCapture = isCapture; -module.exports.captureName = captureName; -module.exports.capturePattern = capturePattern; - -module.exports.analyzeAssertion = analyzeAssertion; diff --git a/ijs/src/special.js b/ijs/src/special.js deleted file mode 100644 index 321363a..0000000 --- a/ijs/src/special.js +++ /dev/null @@ -1,26 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -// $Special: Builder of singleton "atoms". - -function $Special(name) { - this.name = name; -} - -module.exports = $Special; diff --git a/ijs/src/struct.js b/ijs/src/struct.js deleted file mode 100644 index 37f5447..0000000 --- a/ijs/src/struct.js +++ /dev/null @@ -1,169 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -// "Structures": Simple named-tuple-like records. - -const Immutable = require("immutable"); -const $Special = require('./special.js'); - -/* Defined here rather than elsewhere because we need it in makeConstructor. */ -const __ = new $Special("wildcard"); /* wildcard marker */ - -function StructureType(label, arity) { - this.label = label; - this.arity = arity; - this.pattern = this.instantiate(Immutable.Repeat(__, arity).toArray()); - - var self = this; - this.ctor = function () { - return self.instantiate(Array.prototype.slice.call(arguments)); - }; - this.ctor.meta = this; - this.ctor.pattern = this.pattern; - this.ctor.isClassOf = function (v) { return self.isClassOf(v); }; -} - -function makeConstructor(label, fieldNames) { - return new StructureType(label, fieldNames.length).ctor; -} - -StructureType.prototype.equals = function (other) { - if (!(other instanceof StructureType)) return false; - return this.arity === other.arity && this.label === other.label; -}; - -StructureType.prototype.hashCode = function () { - return Immutable.List([this.label, this.arity]).hashCode(); -}; - -StructureType.prototype.instantiate = function (fields) { - return new Structure(this, fields); -}; - -StructureType.prototype.isClassOf = function (v) { - return v && (v instanceof Structure) && (v.meta.equals(this)); -}; - -function Structure(meta, fields) { - if (!isStructureType(meta)) { - throw new Error("Structure: requires structure type"); - } - if (fields.length !== meta.arity) { - throw new Error("Structure: cannot instantiate meta "+JSON.stringify(meta.label)+ - " expecting "+meta.arity+" fields with "+fields.length+" fields"); - } - this.meta = meta; - this.length = meta.arity; - this.fields = fields.slice(0); - for (var i = 0; i < fields.length; i++) { - this[i] = fields[i] = Immutable.fromJS(fields[i]); - } -} - -Structure.prototype.clone = function () { - return new Structure(this.meta, this.fields); -}; - -Structure.prototype.get = function (index) { - return this[index]; -}; - -Structure.prototype.set = function (index, value) { - var s = this.clone(); - s[index] = s.fields[index] = value; - return s; -}; - -Structure.prototype.equals = function (other) { - if (!other) return false; - if (!(other instanceof Structure)) return false; - if (!other.meta.equals(this.meta)) return false; - for (let i = 0; i < this.length; i++) { - if (this[i] === other[i]) continue; - if (typeof this[i].equals !== 'function') return false; - if (!this[i].equals(other[i])) return false; - } - return true; -}; - -Structure.prototype.hashCode = function () { - return Immutable.List(this.fields).unshift(this.meta).hashCode(); -}; - -Structure.prototype.toString = function () { - let b = this.meta.label + "("; - let needComma = false; - for (let v of this.fields) { - if (needComma) b = b + ", "; - needComma = true; - b = b + JSON.stringify(v); - } - return b + ")"; -}; - -function reviveStructs(j) { - if (Array.isArray(j)) { - return j.map(reviveStructs); - } - - if ((j !== null) && typeof j === 'object') { - if ((typeof j['@type'] === 'string') && Array.isArray(j['fields'])) { - return (new StructureType(j['@type'], j['fields'].length)).instantiate(j['fields']); - } else { - for (var k in j) { - if (Object.prototype.hasOwnProperty.call(j, k)) { - j[k] = reviveStructs(j[k]); - } - } - return j; - } - } - - return j; -} - -function reviver(k, v) { - if (k === '') { - return reviveStructs(v); - } - return v; -}; - -Structure.prototype.toJSON = function () { - return { '@type': this.meta.label, 'fields': this.fields }; -}; - -function isStructureType(v) { - return v && (v instanceof StructureType); -} - -function isStructure(v) { - return v && (v instanceof Structure); -} - -/////////////////////////////////////////////////////////////////////////// - -module.exports.__ = __; -module.exports.StructureType = StructureType; -module.exports.makeConstructor = makeConstructor; -module.exports.Structure = Structure; -module.exports.reviveStructs = reviveStructs; -module.exports.reviver = reviver; -module.exports.isStructureType = isStructureType; -module.exports.isStructure = isStructure; diff --git a/ijs/test/test-bag.js b/ijs/test/test-bag.js deleted file mode 100644 index 6c461b7..0000000 --- a/ijs/test/test-bag.js +++ /dev/null @@ -1,131 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -const expect = require('chai').expect; -const Immutable = require('immutable'); -const Bag = require('../src/bag.js'); - -describe('immutable bag', function () { - it('should be initializable from a set', function () { - var b = Bag.fromSet(Immutable.Set(['a', 'b', 'c'])); - expect(b.count()).to.equal(3); - expect(Bag.get(b, 'a')).to.equal(1); - expect(Bag.get(b, 'z')).to.equal(0); - }); - - it('should be initializable from an array', function () { - var b = Bag.fromSet(['a', 'b', 'c', 'a']); - expect(b.count()).to.equal(3); - expect(Bag.get(b, 'a')).to.equal(1); - expect(Bag.get(b, 'z')).to.equal(0); - }); - - it('should be immutable', function () { - var b = Bag.Bag(); - Bag.change(b, 'a', 1); - Bag.change(b, 'a', 1); - expect(b).to.equal(Bag.Bag()); - }); - - it('should count up', function () { - var b = Bag.Bag(); - var change1, change2; - ({bag: b, net: change1} = Bag.change(b, 'a', 1)); - ({bag: b, net: change2} = Bag.change(b, 'a', 1)); - expect(change1).to.equal(Bag.ABSENT_TO_PRESENT); - expect(change2).to.equal(Bag.PRESENT_TO_PRESENT); - expect(Bag.get(b, 'a')).to.equal(2); - expect(Bag.get(b, 'z')).to.equal(0); - }); - - it('should count down', function () { - var b = Bag.fromSet(['a']); - var c1, c2, c3, c4; - ({bag: b, net: c1} = Bag.change(b, 'a', 1)); - ({bag: b, net: c2} = Bag.change(b, 'a', -1)); - expect(b.count()).to.equal(1); - expect(c1).to.equal(Bag.PRESENT_TO_PRESENT); - expect(c2).to.equal(Bag.PRESENT_TO_PRESENT); - ({bag: b, net: c3} = Bag.change(b, 'a', -1)); - expect(b.count()).to.equal(0); - expect(c3).to.equal(Bag.PRESENT_TO_ABSENT); - expect(Bag.get(b, 'a')).to.equal(0); - expect(Bag.get(b, 'z')).to.equal(0); - ({bag: b, net: c4} = Bag.change(b, 'a', -1)); - expect(b.count()).to.equal(1); - expect(c4).to.equal(Bag.ABSENT_TO_PRESENT); - expect(Bag.get(b, 'a')).to.equal(-1); - }); - - it('should be clamped', function() { - var b = Bag.fromSet(['a']); - ({bag: b} = Bag.change(b, 'a', -1, true)); - ({bag: b} = Bag.change(b, 'a', -1, true)); - ({bag: b} = Bag.change(b, 'a', -1, true)); - ({bag: b} = Bag.change(b, 'a', -1, true)); - expect(b.count()).to.equal(0); - expect(Bag.get(b, 'a')).to.equal(0); - }); -}); - -describe('mutable bag', function () { - it('should be initializable from a set', function () { - var b = new Bag.MutableBag(Immutable.Set(['a', 'b', 'c'])); - expect(b.count()).to.equal(3); - expect(b.get('a')).to.equal(1); - expect(b.get('z')).to.equal(0); - }); - - it('should be initializable from an array', function () { - var b = new Bag.MutableBag(['a', 'b', 'c', 'a']); - expect(b.count()).to.equal(3); - expect(b.get('a')).to.equal(1); - expect(b.get('z')).to.equal(0); - }); - - it('should be mutable', function () { - var b = new Bag.MutableBag(); - b.change('a', 1); - b.change('a', 1); - expect(b.get('a')).to.equal(2); - expect(b.get('z')).to.equal(0); - }); - - it('should count up', function () { - var b = new Bag.MutableBag(); - expect(b.change('a', 1)).to.equal(Bag.ABSENT_TO_PRESENT); - expect(b.change('a', 1)).to.equal(Bag.PRESENT_TO_PRESENT); - expect(b.get('a')).to.equal(2); - expect(b.get('z')).to.equal(0); - }); - - it('should count down', function () { - var b = new Bag.MutableBag(['a']); - expect(b.change('a', 1)).to.equal(Bag.PRESENT_TO_PRESENT); - expect(b.change('a', -1)).to.equal(Bag.PRESENT_TO_PRESENT); - expect(b.count()).to.equal(1); - expect(b.change('a', -1)).to.equal(Bag.PRESENT_TO_ABSENT); - expect(b.count()).to.equal(0); - expect(b.get('a')).to.equal(0); - expect(b.get('z')).to.equal(0); - expect(b.change('a', -1)).to.equal(Bag.ABSENT_TO_PRESENT); - expect(b.count()).to.equal(1); - expect(b.get('a')).to.equal(-1); - }); -}); diff --git a/ijs/test/test-dataflow.js b/ijs/test/test-dataflow.js deleted file mode 100644 index 94e50b8..0000000 --- a/ijs/test/test-dataflow.js +++ /dev/null @@ -1,209 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -var expect = require('chai').expect; -var Immutable = require('immutable'); - -var Dataflow = require('../src/dataflow.js'); - -function Cell(graph, initialValue, name) { - this.objectId = graph.defineObservableProperty(this, 'value', initialValue, { - objectId: name, - noopGuard: (a, b) => a === b - }); -} - -function DerivedCell(graph, name, valueThunk) { - var c = new Cell(graph, undefined, name); - c.refresh = function () { c.value = valueThunk(); }; - graph.withSubject(c, function () { c.refresh(); }); - return c; -} - -function expectSetsEqual(a, bArray) { - return expect(Immutable.is(a, Immutable.Set(bArray))).to.equal(true); -} - -function checkDamagedNodes(g, expectedObjects) { - return expectSetsEqual(g.damagedNodes, expectedObjects); -} - -describe('dataflow', () => { - describe('edges, damage and subjects', () => { - it('should be recorded', () => { - var g = new Dataflow.Graph(); - var c = new Cell(g, 123); - - g.withSubject('s', () => { c.value; }); - g.withSubject('t', () => { c.value; }); - g.withSubject('s', () => { c.value; }); - - c.value = 234; - expect(g.damagedNodes.size).to.equal(1); - - var subjects = Immutable.Set(); - g.repairDamage(function (subjectId) { subjects = subjects.add(subjectId); }); - expectSetsEqual(subjects, ['s', 't']); - }); - }); - - describe('DerivedCell', () => { - describe('simple case', () => { - var g = new Dataflow.Graph(); - var c = DerivedCell(g, 'c', () => 123); - var d = DerivedCell(g, 'd', () => c.value * 2); - it('should be properly initialized', () => { - expect(c.value).to.equal(123); - expect(d.value).to.equal(246); - }); - it('should lead initially to damaged everything', () => { - expect(g.damagedNodes.size).to.equal(2); - }); - it('should repair idempotently after initialization', () => { - g.repairDamage(function (c) { c.refresh(); }); - expect(c.value).to.equal(123); - expect(d.value).to.equal(246); - }); - it('should be inconsistent after modification but before repair', () => { - c.value = 124; - expect(c.value).to.equal(124); - expect(d.value).to.equal(246); - }); - it('should repair itself properly', () => { - g.repairDamage(function (c) { c.refresh(); }); - expect(c.value).to.equal(124); - expect(d.value).to.equal(248); - }); - }); - - describe('a more complex case', () => { - var g = new Dataflow.Graph(); - - function add(a, b) { return a + b; } - var xs = new Cell(g, Immutable.List.of(1, 2, 3, 4), 'xs'); - var sum = DerivedCell(g, 'sum', () => xs.value.reduce(add, 0)); - var len = DerivedCell(g, 'len', () => xs.value.size); - var avg = DerivedCell(g, 'avg', () => { - if (len.value === 0) return null; - return sum.value / len.value; - }); - var scale = new Cell(g, 1, 'scale'); - var ans = DerivedCell(g, 'ans', () => { - if (scale.value === 0) return null; - return typeof avg.value === 'number' && avg.value / scale.value; - }); - - function expectValues(vs) { - g.repairDamage(function (c) { c.refresh(); }); - expect([xs.value.toJS(), sum.value, len.value, avg.value, scale.value, ans.value]).to.eql(vs); - } - - it('initially', () => { - expectValues([ [1,2,3,4], 10, 4, 2.5, 1, 2.5 ]); - }); - it('at scale zero', () => { - scale.value = 0; - expectValues([ [1,2,3,4], 10, 4, 2.5, 0, null ]); - }); - it('with nine and zero', () => { - xs.value = xs.value.concat([9, 0]); - expectValues([ [1,2,3,4,9,0], 19, 6, 19/6, 0, null ]); - }); - it('with five and four', () => { - xs.value = xs.value.skipLast(2).concat([5, 4]); - expectValues([ [1,2,3,4,5,4], 19, 6, 19/6, 0, null ]); - }); - it('at scale one', () => { - scale.value = 1; - expectValues([ [1,2,3,4,5,4], 19, 6, 19/6, 1, 19/6 ]); - }); - it('empty', () => { - xs.value = Immutable.List(); - expectValues([ [], 0, 0, null, 1, false ]); - }); - it('four, five, and six', () => { - xs.value = Immutable.List.of(4, 5, 6); - expectValues([ [4,5,6], 15, 3, 15/3, 1, 15/3 ]); - }); - }); - }); - - describe('scopes', () => { - var g = new Dataflow.Graph(); - - function buildScopes() { - var rootScope = {}; - var midScope = Dataflow.Graph.newScope(rootScope); - var outerScope = Dataflow.Graph.newScope(midScope); - return {root: rootScope, mid: midScope, outer: outerScope}; - } - - it('should make rootward props visible further out', () => { - var ss = buildScopes(); - g.defineObservableProperty(ss.root, 'p', 123); - expect(ss.root.p).to.equal(123); - expect(ss.mid.p).to.equal(123); - expect(ss.outer.p).to.equal(123); - expect('p' in ss.root).to.equal(true); - expect('p' in ss.mid).to.equal(true); - expect('p' in ss.outer).to.equal(true); - }); - - it('should make changes at root visible at leaves', () => { - var ss = buildScopes(); - g.defineObservableProperty(ss.root, 'p', 123); - expect(ss.outer.p).to.equal(123); - ss.root.p = 234; - expect(ss.root.p).to.equal(234); - expect(ss.outer.p).to.equal(234); - }); - - it('should make changes at leaves visible at root', () => { - var ss = buildScopes(); - g.defineObservableProperty(ss.root, 'p', 123); - expect(ss.outer.p).to.equal(123); - ss.outer.p = 234; - expect(ss.root.p).to.equal(234); - expect(ss.outer.p).to.equal(234); - }); - - it('should hide definitions at leaves from roots', () => { - var ss = buildScopes(); - g.defineObservableProperty(ss.outer, 'p', 123); - expect(ss.outer.p).to.equal(123); - expect(ss.mid.p).to.equal(undefined); - expect(ss.root.p).to.equal(undefined); - expect('p' in ss.root).to.equal(false); - expect('p' in ss.mid).to.equal(false); - expect('p' in ss.outer).to.equal(true); - }); - - it('should hide middle definitions from roots but show to leaves', () => { - var ss = buildScopes(); - g.defineObservableProperty(ss.mid, 'p', 123); - expect(ss.outer.p).to.equal(123); - expect(ss.mid.p).to.equal(123); - expect(ss.root.p).to.equal(undefined); - expect('p' in ss.root).to.equal(false); - expect('p' in ss.mid).to.equal(true); - expect('p' in ss.outer).to.equal(true); - }); - }); - -}); diff --git a/ijs/test/test-dataspace.js b/ijs/test/test-dataspace.js deleted file mode 100644 index b9ddbf0..0000000 --- a/ijs/test/test-dataspace.js +++ /dev/null @@ -1,65 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -const chai = require('chai'); -const expect = chai.expect; -chai.use(require('chai-immutable')); - -const Immutable = require('immutable'); - -const Syndicate = require('../src/index.js'); -const Skeleton = Syndicate.Skeleton; -const Dataspace = Syndicate.Dataspace; -const Struct = Syndicate.Struct; -const __ = Syndicate.__; -const _$ = Syndicate._$; - -describe('dataspace', () => { - it('should boot and run', () => { - // TODO: convert this into even a rudimentary somewhat-real test case - // (change console.log into gathering a trace) - let ds = new Dataspace(() => { - // console.log('boot'); - Dataspace.currentFacet().addEndpoint(() => { - let handler = Skeleton.analyzeAssertion(_$); - handler.callback = (evt, vs) => { - if (Syndicate.Observe.isClassOf(vs.get(0))) { - // console.log('OBSERVATION EVENT', evt, vs, vs.get(0).get(0) === _$); - } else { - // console.log('EVENT', evt, vs); - } - }; - return [Syndicate.Observe(_$), handler]; - }); - Dataspace.deferTurn(() => { - // console.log('after defer'); - Dataspace.send(1234); - // console.log('after send'); - Dataspace.spawn('secondproc', () => { - // console.log('secondproc boot'); - }); - }); - }); - // console.log('--- starting ---'); - while (ds.runScripts()) { - // console.log('--- runScripts boundary ---'); - } - // console.log('--- done ---'); - }); -}); diff --git a/ijs/test/test-skeleton.js b/ijs/test/test-skeleton.js deleted file mode 100644 index cd3b22c..0000000 --- a/ijs/test/test-skeleton.js +++ /dev/null @@ -1,252 +0,0 @@ -"use strict"; -//--------------------------------------------------------------------------- -// @syndicate-lang/core, an implementation of Syndicate dataspaces for JS. -// Copyright (C) 2016-2018 Tony Garnock-Jones -// -// This program is free software: you can redistribute it and/or modify -// it under the terms of the GNU General Public License as published by -// the Free Software Foundation, either version 3 of the License, or -// (at your option) any later version. -// -// This program is distributed in the hope that it will be useful, -// but WITHOUT ANY WARRANTY; without even the implied warranty of -// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -// GNU General Public License for more details. -// -// You should have received a copy of the GNU General Public License -// along with this program. If not, see . -//--------------------------------------------------------------------------- - -const chai = require('chai'); -const expect = chai.expect; -chai.use(require('chai-immutable')); - -const Immutable = require('immutable'); - -const Syndicate = require('../src/index.js'); -const Skeleton = Syndicate.Skeleton; -const Struct = Syndicate.Struct; -const __ = Syndicate.__; -const _$ = Syndicate._$; - -const Event = Struct.makeConstructor('Event', ['label', 'type', 'values']); - -function eventCallback(traceHolder, label) { - return (e, vs) => { traceHolder.push(Event(label, e, vs)) }; -} - -function skeletonTrace(f) { - let traceHolder = { - trace: Immutable.List(), - push: function (e) { this.trace = this.trace.push(e); } - }; - let i = new Skeleton.Index(); - f(i, traceHolder); - return traceHolder.trace; -} - -describe('skeleton', () => { - - const A = Struct.makeConstructor('A', ['x', 'y']); - const B = Struct.makeConstructor('B', ['v']); - const C = Struct.makeConstructor('C', ['v']); - - describe('pattern analysis', () => { - it('should handle leaf captures', () => { - expect(Immutable.fromJS(Skeleton.analyzeAssertion(A(B(_$), _$)))) - .to.equal(Immutable.fromJS({skeleton: [A.meta, [B.meta, null], null], - constPaths: Immutable.fromJS([]), - constVals: Immutable.fromJS([]), - capturePaths: Immutable.fromJS([[0, 0], [1]])})); - }); - it('should handle atomic constants', () => { - expect(Immutable.fromJS(Skeleton.analyzeAssertion(A(B("x"), _$)))) - .to.equal(Immutable.fromJS({skeleton: [A.meta, [B.meta, null], null], - constPaths: Immutable.fromJS([[0, 0]]), - constVals: Immutable.fromJS(["x"]), - capturePaths: Immutable.fromJS([[1]])})); - }); - it('should handle complex constants (1)', () => { - // Marker: (***) - // Really this comes about when compiled code has no static - // visibility into the value of a constant, and that constant - // will end up being complex at runtime. We can't properly test - // that situation without the static analysis half of the code. - // TODO later. - let complexPlaceholder = new Object(); - expect(Immutable.fromJS(Skeleton.analyzeAssertion(A(complexPlaceholder, C(_$))))) - .to.equal(Immutable.fromJS({skeleton: [A.meta, null, [C.meta, null]], - constPaths: Immutable.fromJS([[0]]), - constVals: Immutable.fromJS([complexPlaceholder]), - capturePaths: Immutable.fromJS([[1, 0]])})); - }); - it('should handle complex constants (2)', () => { - // Marker: (***) - // Really this comes about when compiled code has no static - // visibility into the value of a constant, and that constant - // will end up being complex at runtime. We can't properly test - // that situation without the static analysis half of the code. - // TODO later. - expect(Immutable.fromJS(Skeleton.analyzeAssertion(A(B(B("y")), _$("rhs", C(__)))))) - .to.equal(Immutable.fromJS({skeleton: [A.meta, [B.meta, [B.meta, null]], [C.meta, null]], - constPaths: Immutable.fromJS([[0, 0, 0]]), - constVals: Immutable.fromJS(["y"]), - capturePaths: Immutable.fromJS([[1]])})); - }); - it('should handle list patterns with discards', () => { - expect(Immutable.fromJS(Skeleton.analyzeAssertion([__, __]))) - .to.equal(Immutable.fromJS({skeleton: [2, null, null], - constPaths: Immutable.fromJS([]), - constVals: Immutable.fromJS([]), - capturePaths: Immutable.fromJS([])})); - }); - it('should handle list patterns with constants and captures', () => { - expect(Immutable.fromJS(Skeleton.analyzeAssertion(["hi", _$, _$]))) - .to.equal(Immutable.fromJS({skeleton: [3, null, null, null], - constPaths: Immutable.fromJS([[0]]), - constVals: Immutable.fromJS(["hi"]), - capturePaths: Immutable.fromJS([[1],[2]])})); - }); - }); - - describe('nested structs', () => { - let trace = skeletonTrace((i, traceHolder) => { - i.addHandler(Skeleton.analyzeAssertion(A(B(_$), _$)), eventCallback(traceHolder, "AB")); - i.addHandler(Skeleton.analyzeAssertion(A(B("x"), _$)), eventCallback(traceHolder, "ABx")); - let complexConstantPattern1 = {skeleton: [A.meta, null, [C.meta, null]], - constPaths: Immutable.fromJS([[0]]), - constVals: Immutable.fromJS([B("y")]), - capturePaths: Immutable.fromJS([[1, 0]])}; - // ^ See comment in 'should handle complex constants (1)' test above (marked (***)). - i.addHandler(complexConstantPattern1, eventCallback(traceHolder, "AByC")); - let complexConstantPattern2 = {skeleton: [A.meta, [B.meta, null], [C.meta, null]], - constPaths: Immutable.fromJS([[0, 0]]), - constVals: Immutable.fromJS([B("y")]), - capturePaths: Immutable.fromJS([[1]])}; - i.addHandler(complexConstantPattern2, eventCallback(traceHolder, "ABByC")); - - i.addAssertion(A(B("x"),C(1))); - i.addAssertion(A(B("y"),C(2))); - i.addAssertion(A(B(B("y")),C(2))); - i.addAssertion(A(B("z"),C(3))); - }); - - // trace.forEach((e) => { console.log(e.toString()) }); - - expect(trace) - .to.equal(Immutable.List([ - Event("AB", Skeleton.EVENT_ADDED, ["x", C(1)]), - Event("ABx", Skeleton.EVENT_ADDED, [C(1)]), - Event("AB", Skeleton.EVENT_ADDED, ["y", C(2)]), - Event("AByC", Skeleton.EVENT_ADDED, [2]), - Event("AB", Skeleton.EVENT_ADDED, [B("y"), C(2)]), - Event("ABByC", Skeleton.EVENT_ADDED, [C(2)]), - Event("AB", Skeleton.EVENT_ADDED, ["z", C(3)])])); - }); - - describe('simple detail-erasing trace', () => { - let trace = skeletonTrace((i, traceHolder) => { - i.addHandler(Skeleton.analyzeAssertion([__, __]), eventCallback(traceHolder, "2-EVENT")); - - i.addAssertion(["hi", 123]); - i.addAssertion(["hi", 234]); - i.removeAssertion(["hi", 123]); - i.removeAssertion(["hi", 234]); - }); - - it('should have one add and one remove', () => { - expect(trace) - .to.equal(Immutable.List([ - Event("2-EVENT", Skeleton.EVENT_ADDED, []), - Event("2-EVENT", Skeleton.EVENT_REMOVED, [])])); - }); - }); - - describe('handler added after assertion (1)', () => { - let trace = skeletonTrace((i, traceHolder) => { - i.addAssertion(["hi", 123, 234]); - i.addHandler(Skeleton.analyzeAssertion(["hi", _$, _$]), eventCallback(traceHolder, "X")); - i.removeAssertion(["hi", 123, 234]); - }); - - it('should get two events', () => { - expect(trace).to.equal(Immutable.List([ - Event("X", Skeleton.EVENT_ADDED, [123, 234]), - Event("X", Skeleton.EVENT_REMOVED, [123, 234])])); - }); - }); - - describe('handler added after assertion (2)', () => { - let trace = skeletonTrace((i, traceHolder) => { - i.addAssertion(["hi", 123, 234]); - i.addHandler(Skeleton.analyzeAssertion(_$), eventCallback(traceHolder, "X")); - i.removeAssertion(["hi", 123, 234]); - }); - - it('should get two events', () => { - expect(trace).to.equal(Immutable.List([ - Event("X", Skeleton.EVENT_ADDED, [["hi", 123, 234]]), - Event("X", Skeleton.EVENT_REMOVED, [["hi", 123, 234]])])); - }); - }); - - describe('handler removed before assertion removed', () => { - let trace = skeletonTrace((i, traceHolder) => { - i.addAssertion(["hi", 123, 234]); - let h = Skeleton.analyzeAssertion(["hi", _$, _$]); - h.callback = eventCallback(traceHolder, "X") - i.addHandler(h, h.callback); - i.removeHandler(h, h.callback); - i.removeAssertion(["hi", 123, 234]); - }); - - it('should get one event', () => { - expect(trace).to.equal(Immutable.List([ - Event("X", Skeleton.EVENT_ADDED, [123, 234])])); - }); - }); - - describe('simple list assertions trace', () => { - let trace = skeletonTrace((i, traceHolder) => { - i.addHandler(Skeleton.analyzeAssertion(["hi", _$, _$]), eventCallback(traceHolder, "3-EVENT")); - i.addHandler(Skeleton.analyzeAssertion([__, __]), eventCallback(traceHolder, "2-EVENT")); - - i.addAssertion(["hi", 123, 234]); - i.addAssertion(["hi", 999, 999]); - i.addAssertion(["hi", 123]); - i.addAssertion(["hi", 123, 234]); - i.sendMessage(["hi", 303]); - i.sendMessage(["hi", 303, 404]); - i.sendMessage(["hi", 303, 404, 808]); - i.removeAssertion(["hi", 123, 234]); - i.removeAssertion(["hi", 999, 999]); - i.removeAssertion(["hi", 123, 234]); - i.addAssertion(["hi", 123]); - i.addAssertion(["hi", 234]); - i.removeAssertion(["hi", 123]); - i.removeAssertion(["hi", 123]); - i.removeAssertion(["hi", 234]); - }); - - it('should have 8 entries', () => { - expect(trace.size).to.equal(8); - }); - it('should have a correct 3-EVENT subtrace', () => { - expect(trace.filter((e) => { return e[0] === "3-EVENT"; })) - .to.equal(Immutable.List([ - Event("3-EVENT", Skeleton.EVENT_ADDED, [123, 234]), - Event("3-EVENT", Skeleton.EVENT_ADDED, [999, 999]), - Event("3-EVENT", Skeleton.EVENT_MESSAGE, [303, 404]), - Event("3-EVENT", Skeleton.EVENT_REMOVED, [999, 999]), - Event("3-EVENT", Skeleton.EVENT_REMOVED, [123, 234])])); - }); - it('should have a correct 2-EVENT subtrace', () => { - expect(trace.filter((e) => { return e[0] === "2-EVENT"; })) - .to.equal(Immutable.List([ - Event("2-EVENT", Skeleton.EVENT_ADDED, []), - Event("2-EVENT", Skeleton.EVENT_MESSAGE, []), - Event("2-EVENT", Skeleton.EVENT_REMOVED, [])])); - }); - }); - -});