├── .gitignore
├── CodeGenUtils.js
├── LICENSE
├── README.md
├── main.js
├── menus
    └── menu.json
├── package-lock.json
├── package.json
├── preferences
    └── preference.json
└── typeScriptCodeGenerator.js


/.gitignore:
--------------------------------------------------------------------------------
1 | node_modules
2 | 
3 | 


--------------------------------------------------------------------------------
/CodeGenUtils.js:
--------------------------------------------------------------------------------
 1 | /*
 2 |  * Copyright (c) 2014 MKLab. All rights reserved.
 3 |  *
 4 |  * Permission is hereby granted, free of charge, to any person obtaining a
 5 |  * copy of this software and associated documentation files (the "Software"),
 6 |  * to deal in the Software without restriction, including without limitation
 7 |  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 8 |  * and/or sell copies of the Software, and to permit persons to whom the
 9 |  * Software is furnished to do so, subject to the following conditions:
10 |  *
11 |  * The above copyright notice and this permission notice shall be included in
12 |  * all copies or substantial portions of the Software.
13 |  *
14 |  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 |  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 |  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17 |  * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 |  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
19 |  * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
20 |  * DEALINGS IN THE SOFTWARE.
21 |  *
22 |  */
23 | class CodeWriter {
24 |     /**
25 |      * CodeWriter
26 |      * @constructor
27 |      */
28 |     constructor(indentString) {
29 | 
30 |         /** @member {Array.<string>} lines */
31 |         this.lines = [];
32 | 
33 |         /** @member {string} indentString */
34 |         this.indentString = (indentString ? indentString : "    "); // default 4 spaces
35 | 
36 |         /** @member {Array.<string>} indentations */
37 |         this.indentations = [];
38 |     }
39 | 
40 |     /**
41 |      * Indent
42 |      */
43 |     indent() {
44 |         this.indentations.push(this.indentString);
45 |     };
46 | 
47 |     /**
48 |      * Outdent
49 |      */
50 |     outdent() {
51 |         this.indentations.splice(this.indentations.length - 1, 1);
52 |     };
53 | 
54 |     /**
55 |      * Write a line
56 |      * @param {string} line
57 |      */
58 |     writeLine(line) {
59 |         if (line) {
60 |             this.lines.push(this.indentations.join("") + line);
61 |         } else {
62 |             this.lines.push("");
63 |         }
64 |     };
65 | 
66 |     /**
67 |      * Return as all string data
68 |      * @return {string}
69 |      */
70 |     getData() {
71 |         return this.lines.join("\n");
72 |     };
73 | }
74 | 
75 | module.exports = CodeWriter;


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     {one line to give the program's name and a brief idea of what it does.}
635 |     Copyright (C) {year}  {name of author}
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <http://www.gnu.org/licenses/>.
649 | 
650 | Also add information on how to contact you by electronic and paper mail.
651 | 
652 |   If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 | 
655 |     {project}  Copyright (C) {year}  {fullname}
656 |     This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 |     This is free software, and you are welcome to redistribute it
658 |     under certain conditions; type `show c' for details.
659 | 
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License.  Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 | 
664 |   You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | <http://www.gnu.org/licenses/>.
668 | 
669 |   The GNU General Public License does not permit incorporating your program
670 | into proprietary programs.  If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library.  If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License.  But first, please read
674 | <http://www.gnu.org/philosophy/why-not-lgpl.html>.
675 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # staruml-typescript
 2 | TypeScript Code Generator for StarUML 3
 3 | 
 4 | # Installation
 5 | You can install from URL with below UML
 6 | ```
 7 | https://github.com/qwin/staruml-typescript
 8 | ```
 9 | 
10 | # License
11 | This extension is released under the terms of GPLv3 License. See the LICENSE file for more details.
12 | 
13 | Copyright © 2019 Thomas Min.
14 | Copyright © 2019 Robert Al-Malak.


--------------------------------------------------------------------------------
/main.js:
--------------------------------------------------------------------------------
 1 | const typeScriptCodeGenerator = require("./typeScriptCodeGenerator")
 2 | 
 3 | function _handleGen(base, path, options) {
 4 |     // window.alert('Hello World!');
 5 |     // If options is not passed, get from preference
 6 |     options = options || getGenOptions()
 7 |     // If base is not assigned, popup ElementPicker
 8 |     if (!base) {
 9 |         app.elementPickerDialog.showDialog('Select a base model to generate codes', null, type.UMLPackage).then(function ({ buttonId, returnValue }) {
10 |             if (buttonId === 'ok') {
11 |                 base = returnValue
12 |                 console.log(base);
13 |                 // If path is not assigned, popup Open Dialog to select a folder
14 |                 if (!path) {
15 |                     var files = app.dialogs.showOpenDialog('Select a folder where generated codes to be located', null, null, { properties: ['openDirectory'] })
16 |                     if (files && files.length > 0) {
17 |                         path = files[0]
18 |                         console.log(path);
19 |                         typeScriptCodeGenerator.generate(base, path, options);
20 |                     }
21 |                 } else {
22 |                     typeScriptCodeGenerator.generate(base, path, options)
23 |                 }
24 |             }
25 |         })
26 |     } else {
27 |         // If path is not assigned, popup Open Dialog to select a folder
28 |         if (!path) {
29 |             var files = app.dialogs.showOpenDialog('Select a folder where generated codes to be located', null, null, { properties: ['openDirectory'] })
30 |             if (files && files.length > 0) {
31 |                 path = files[0]
32 |                 console.log(path);
33 |                 typeScriptCodeGenerator.generate(base, path, options);
34 |             }
35 |         } else {
36 |             console.log(path);
37 |             typeScriptCodeGenerator.generate(base, path, options);
38 |         }
39 |     }
40 | }
41 | 
42 | function getGenOptions() {
43 |     return {
44 |         tsDoc: app.preferences.get("typescript.gen.tsDoc"),
45 |         indentSpaces: app.preferences.get("typescript.gen.indentSpaces"),
46 |         copyright: app.preferences.get("typescript.gen.copyright"),
47 |         comments: app.preferences.get("typescript.gen.comments")
48 |     };
49 | }
50 | 
51 | function init() {
52 |      app.commands.register('typescript:generate', _handleGen)
53 | }
54 | 
55 | exports.init = init


--------------------------------------------------------------------------------
/menus/menu.json:
--------------------------------------------------------------------------------
 1 | {
 2 |     "menu": [
 3 |         {
 4 |             "id": "tools",
 5 |             "submenu": [
 6 |                 {
 7 |                     "label": "Typescript",
 8 |                     "id": "tools.typescript",
 9 |                     "submenu": [
10 |                       { "label": "Generate Code...", "id": "tools.typescript.generate", "command": "typescript:generate" }
11 |                     ]
12 |                   }
13 |             ]
14 |         }
15 |     ]
16 | }


--------------------------------------------------------------------------------
/package-lock.json:
--------------------------------------------------------------------------------
1 | {
2 |   "name": "robertalmalak.staruml-typescript",
3 |   "version": "0.2.0",
4 |   "lockfileVersion": 1
5 | }
6 | 


--------------------------------------------------------------------------------
/package.json:
--------------------------------------------------------------------------------
 1 | {
 2 |   "name": "robertalmalak.staruml-typescript",
 3 |   "title": "TypeScript",
 4 |   "description": "TypeScript code generation",
 5 |   "homepage": "https://github.com/qwin/staruml-typescript",
 6 |   "issues": "https://github.com/qwin/staruml-typescript/issues",
 7 |   "repository": {
 8 |     "type": "git",
 9 |     "url": "https://github.com/qwin/staruml-typescript.git"
10 |   },
11 |   "version": "0.2.0",
12 |   "keywords": [
13 |     "TypeScript",
14 |     "ts",
15 |     "UML",
16 |     "staruml"
17 |   ],
18 |   "author": {
19 |     "name": "Robert Al Malak",
20 |     "email": "robertalmalak7@gmail.com",
21 |     "url": "https://github.com/qwin"
22 |   },
23 |   "license": "GPL-3.0",
24 |   "engines": {
25 |     "staruml": ">=3.0.0"
26 |   },
27 |   "devDependencies": {},
28 |   "dependencies": {}
29 | }


--------------------------------------------------------------------------------
/preferences/preference.json:
--------------------------------------------------------------------------------
 1 | {
 2 |     "id": "typescript",
 3 |     "name": "TS",
 4 |     "schema": {
 5 |         "typescript.gen": {
 6 |             "text": "TypeScript Code Generation",
 7 |             "type": "section"
 8 |         },
 9 |         "typescript.gen.tsDoc": {
10 |             "text": "TypeScript Doc",
11 |             "description": "Generate TypeScript Doc comments.",
12 |             "type": "check",
13 |             "default": true
14 |         },
15 |         "typescript.gen.copyright": {
16 |             "text": "Copyright Text",
17 |             "description": "Copyright Text to use on all files",
18 |             "type": "string",
19 |             "default": "\n/*\n*(C) Copyright MyCompany, Inc. \n*All rights reserved\n*/\n"
20 |         },
21 |         "typescript.gen.indentSpaces": {
22 |             "text": "Indent Spaces",
23 |             "description": "Number of spaces for indentation.",
24 |             "type": "number",
25 |             "default": 4
26 |         },
27 |         "typescript.gen.comments": {
28 |             "text": "Generate Comments",
29 |             "description": "Generate comments in JSDoc style.",
30 |             "type": "check",
31 |             "default": false
32 |         }
33 |     }
34 | }


--------------------------------------------------------------------------------
/typeScriptCodeGenerator.js:
--------------------------------------------------------------------------------
  1 | /*jslint vars: true, plusplus: true, devel: true, nomen: true, indent: 4, maxerr: 50, regexp: true */
  2 | /*global define, $, _, window, app, type, document */
  3 | 
  4 | 
  5 | const CodeWriter = require("./CodeGenUtils")
  6 | var path = require('path');
  7 | var fs = require('fs');
  8 | 
  9 | class TypeScriptCodeGenerator {
 10 |     /**
 11 |      * C# Code Generator
 12 |      * @constructor
 13 |      *
 14 |      * @param {type.UMLPackage} baseModel
 15 |      * @param {string} basePath generated files and directories to be placed
 16 |      */
 17 |     constructor(baseModel, basePath) {
 18 | 
 19 |         /** @member {type.Model} */
 20 |         this.baseModel = baseModel;
 21 | 
 22 |         /** @member {string} */
 23 |         this.basePath = basePath;
 24 | 
 25 |     }
 26 | 
 27 |     /**
 28 |      * Return Indent String based on options
 29 |      * @param {Object} options
 30 |      * @return {string}
 31 |      */
 32 |     getIndentString(options) {
 33 |         if (options.useTab) {
 34 |             return "\t";
 35 |         } else {
 36 |             var i, len, indent = [];
 37 |             for (i = 0, len = options.indentSpaces; i < len; i++) {
 38 |                 indent.push(" ");
 39 |             }
 40 |             return indent.join("");
 41 |         }
 42 |     };
 43 | 
 44 |     /**
 45 |      * Generate codes from a given element
 46 |      * @param {type.Model} elem
 47 |      * @param {string} path
 48 |      * @param {Object} options
 49 |      * @return {$.Promise}
 50 |      */
 51 |     generate(elem, basePath, options) {
 52 | 
 53 |         var fullPath;
 54 |         var codeWriter;
 55 |         var isAnnotationType = (elem.stereotype !== undefined && elem.stereotype === "annotationType");
 56 | 
 57 |         console.log('generate', 'elem', elem);
 58 | 
 59 |         // Package
 60 |         if (elem instanceof type.UMLPackage) {
 61 |             console.log(basePath);
 62 |             fullPath = path.join(basePath, elem.name)
 63 |             fs.mkdirSync(fullPath)
 64 |             if (Array.isArray(elem.ownedElements)) {
 65 |                 elem.ownedElements.forEach(child => {
 66 |                     return this.generate(child, fullPath, options)
 67 |                 })
 68 |             }
 69 |         } else if (elem instanceof type.UMLClass) {
 70 | 
 71 |             // AnnotationType
 72 |             if (isAnnotationType) {
 73 |                 console.log('annotationType generate');
 74 | 
 75 |                 console.log(elem.name.substring(elem.name.length - 9, elem.name.length));
 76 | 
 77 |                 if (elem.name.length < 9) {
 78 |                     elem.name = elem.name + "Attribute";
 79 |                 } else if (elem.name.substring(elem.name.length - 9, elem.name.length) !== "Attribute") {
 80 |                     elem.name = elem.name + "Attribute";
 81 |                 }
 82 | 
 83 |                 fullPath = path.join(basePath, elem.name + '.ts')
 84 |                 codeWriter = new CodeWriter(this.getIndentString(options));
 85 |                 codeWriter.writeLine();
 86 |                 // codeWriter.writeLine("using System;");
 87 |                 // codeWriter.writeLine("using System.Collections.Generic;");
 88 |                 // codeWriter.writeLine("using System.Linq;");
 89 |                 // codeWriter.writeLine("using System.Text;");
 90 |                 // codeWriter.writeLine();
 91 |                 this.writeAnnotationType(codeWriter, elem, options, isAnnotationType);
 92 |                 // this.writeNamespace("writeAnnotationType", codeWriter, elem, options, isAnnotationType);
 93 |                 fs.writeFileSync(fullPath, codeWriter.getData())
 94 |             } else {
 95 |                 // Class
 96 |                 fullPath = path.join(basePath, elem.name + '.ts')
 97 |                 console.log('Class generate' + fullPath);
 98 | 
 99 |                 codeWriter = new CodeWriter(this.getIndentString(options));
100 |                 codeWriter.writeLine();
101 |                 // codeWriter.writeLine("using System;");
102 |                 // codeWriter.writeLine("using System.Collections.Generic;");
103 |                 // codeWriter.writeLine("using System.Linq;");
104 |                 // codeWriter.writeLine("using System.Text;");
105 |                 // codeWriter.writeLine();
106 |                 this.writeClass(codeWriter, elem, options, isAnnotationType);
107 |                 // this.writeNamespace("writeClass", codeWriter, elem, options, isAnnotationType);
108 |                 fs.writeFileSync(fullPath, codeWriter.getData())
109 |             }
110 |         } else if (elem instanceof type.UMLInterface) {
111 |             // Interface
112 |             fullPath = path.join(basePath, elem.name + '.ts')
113 |             console.log('Interface generate' + fullPath);
114 | 
115 |             codeWriter = new CodeWriter(this.getIndentString(options));
116 |             codeWriter.writeLine();
117 |             // codeWriter.writeLine("using System;");
118 |             // codeWriter.writeLine("using System.Collections.Generic;");
119 |             // codeWriter.writeLine("using System.Linq;");
120 |             // codeWriter.writeLine("using System.Text;");
121 |             // codeWriter.writeLine();
122 |             this.writeInterface(codeWriter, elem, options);
123 |             // this.writeNamespace("writeInterface", codeWriter, elem, options, isAnnotationType);
124 |             fs.writeFileSync(fullPath, codeWriter.getData())
125 | 
126 |         } else if (elem instanceof type.UMLEnumeration) {
127 |             // Enum
128 |             fullPath = path.join(basePath, elem.name + '.ts')
129 |             codeWriter = new CodeWriter(this.getIndentString(options));
130 |             codeWriter.writeLine();
131 |             this.writeEnum(codeWriter, elem, options);
132 |             this.writeNamespace("writeEnum", codeWriter, elem, options, isAnnotationType);
133 |             fs.writeFileSync(fullPath, codeWriter.getData())
134 | 
135 |         }
136 |     };
137 | 
138 |     /**
139 |      * Write Namespace
140 |      * @param {functionName} writeFunction
141 |      * @param {StringWriter} codeWriter
142 |      * @param {type.Model} elem
143 |      * @param {Object} options
144 |      */
145 |     writeNamespace(writeFunction, codeWriter, elem, options) {
146 |         var path = null;
147 |         if (elem._parent) {
148 |             path = elem._parent.getPath(this.baseModel).map(function (e) {
149 |                 return e.name;
150 |             }).join(".");
151 |         }
152 |         if (path) {
153 |             codeWriter.writeLine("namespace " + path + "{");
154 |             codeWriter.indent();
155 |         }
156 |         if (writeFunction === "writeAnnotationType") {
157 |             this.writeAnnotationType(codeWriter, elem, options);
158 |         } else if (writeFunction === "writeClass") {
159 |             this.writeClass(codeWriter, elem, options);
160 |         } else if (writeFunction === "writeInterface") {
161 |             this.writeInterface(codeWriter, elem, options);
162 |         } else if (writeFunction === "writeEnum") {
163 |             this.writeEnum(codeWriter, elem, options);
164 |         }
165 | 
166 |         if (path) {
167 |             codeWriter.outdent();
168 |             codeWriter.writeLine("}");
169 |         }
170 |     };
171 | 
172 |     /**
173 |      * Write Enum
174 |      * @param {StringWriter} codeWriter
175 |      * @param {type.Model} elem
176 |      * @param {Object} options
177 |      */
178 |     writeEnum(codeWriter, elem, options) {
179 |         var i, len, terms = [];
180 |         // Doc
181 |         this.writeDoc(codeWriter, elem.documentation, options);
182 | 
183 |         // Modifiers
184 |         var visibility = this.getVisibility(elem);
185 |         if (visibility) {
186 |             terms.push(visibility);
187 |         }
188 |         // Enum
189 |         terms.push("enum");
190 |         terms.push(elem.name);
191 | 
192 |         codeWriter.writeLine(terms.join(" ") + " {");
193 |         codeWriter.indent();
194 | 
195 |         // Literals
196 |         for (i = 0, len = elem.literals.length; i < len; i++) {
197 |             codeWriter.writeLine(elem.literals[i].name + (i < elem.literals.length - 1 ? "," : ""));
198 |         }
199 | 
200 |         codeWriter.outdent();
201 |         codeWriter.writeLine("}");
202 |     };
203 | 
204 |     /**
205 |      * Write Interface
206 |      * @param {StringWriter} codeWriter
207 |      * @param {type.Model} elem
208 |      * @param {Object} options
209 |      */
210 |     writeInterface(codeWriter, elem, options) {
211 |         var i, len, terms = [];
212 | 
213 |         // Doc
214 |         this.writeDoc(codeWriter, elem.documentation, options);
215 | 
216 |         // Modifiers
217 |         // var visibility = this.getVisibility(elem);
218 |         // if (visibility) {
219 |         //     terms.push(visibility);
220 |         // }
221 | 
222 |         // Interface
223 |         terms.push("interface");
224 |         terms.push(elem.name);
225 | 
226 |         // Extends
227 |         var _extends = this.getSuperClasses(elem);
228 |         if (_extends.length > 0) {
229 |             terms.push("extends " + _extends.map(function (e) { return e.name }).join(', '))
230 |         }
231 |         codeWriter.writeLine(terms.join(" ") + " {");
232 |         codeWriter.writeLine();
233 |         codeWriter.indent();
234 | 
235 |         // Member Variables
236 |         // (from attributes)
237 |         for (i = 0, len = elem.attributes.length; i < len; i++) {
238 |             this.writeMemberVariable(codeWriter, elem.attributes[i], options);
239 |             // codeWriter.writeLine();
240 |         }
241 |         // (from associations)
242 |         var associations = app.repository.getRelationshipsOf(elem, function (rel) {
243 |             return (rel instanceof type.UMLAssociation);
244 |         });
245 |         for (i = 0, len = associations.length; i < len; i++) {
246 |             var asso = associations[i];
247 |             if (asso.end1.reference === elem && asso.end2.navigable === true) {
248 |                 this.writeMemberVariable(codeWriter, asso.end2, options);
249 |                 // codeWriter.writeLine();
250 |             } else if (asso.end2.reference === elem && asso.end1.navigable === true) {
251 |                 this.writeMemberVariable(codeWriter, asso.end1, options);
252 |                 // codeWriter.writeLine();
253 |             }
254 |         }
255 | 
256 |         // Methods
257 |         for (i = 0, len = elem.operations.length; i < len; i++) {
258 |             this.writeMethod(codeWriter, elem.operations[i], options, true, false);
259 |             codeWriter.writeLine();
260 |         }
261 | 
262 |         // Inner Definitions
263 |         for (i = 0, len = elem.ownedElements.length; i < len; i++) {
264 |             var def = elem.ownedElements[i];
265 |             if (def instanceof type.UMLClass) {
266 |                 if (def.stereotype === "annotationType") {
267 |                     this.writeAnnotationType(codeWriter, def, options);
268 |                 } else {
269 |                     this.writeClass(codeWriter, def, options);
270 |                 }
271 |                 codeWriter.writeLine();
272 |             } else if (def instanceof type.UMLInterface) {
273 |                 this.writeInterface(codeWriter, def, options);
274 |                 codeWriter.writeLine();
275 |             } else if (def instanceof type.UMLEnumeration) {
276 |                 this.writeEnum(codeWriter, def, options);
277 |                 codeWriter.writeLine();
278 |             }
279 |         }
280 | 
281 |         codeWriter.outdent();
282 |         codeWriter.writeLine("}");
283 | 
284 | 
285 |     };
286 | 
287 | 
288 |     /**
289 |      * Write AnnotationType
290 |      * @param {StringWriter} codeWriter
291 |      * @param {type.Model} elem
292 |      * @param {Object} options
293 |      */
294 |     writeAnnotationType(codeWriter, elem, options) {
295 |         var i, len, terms = [];
296 |         // Doc
297 |         var doc = elem.documentation.trim();
298 |         if (app.project.getProject().author && app.project.getProject().author.length > 0) {
299 |             doc += "\n@author " + app.project.getProject().author;
300 |         }
301 |         this.writeDoc(codeWriter, doc, options);
302 | 
303 |         // Modifiers
304 |         var _modifiers = this.getModifiers(elem);
305 |         if (elem.operations.some(function (op) {
306 |             return op.isAbstract === true;
307 |         })) {
308 |             _modifiers.push("abstract");
309 |         }
310 |         if (_modifiers.length > 0) {
311 |             terms.push(_modifiers.join(" "));
312 |         }
313 | 
314 |         // Class
315 |         terms.push("class");
316 |         terms.push(elem.name);
317 | 
318 |         // AnnotationType => Attribute in C#
319 |         // terms.push(":System.Attribute");
320 | 
321 | 
322 |         // Extends
323 |         var _extends = this.getSuperClasses(elem);
324 |         if (_extends.length > 0) {
325 |             terms.push(": " + _extends[0].name);
326 |         }
327 | 
328 |         // Implements
329 |         var _implements = this.getSuperInterfaces(elem);
330 |         if (_implements.length > 0) {
331 |             if (_extends.length > 0) {
332 |                 terms.push(", " + _implements.map(function (e) {
333 |                     return e.name;
334 |                 }).join(", "));
335 |             } else {
336 |                 terms.push("implements " + _implements.map(function (e) {
337 |                     return e.name;
338 |                 }).join(", "));
339 |             }
340 |         }
341 | 
342 |         codeWriter.writeLine(terms.join(" ") + " {");
343 |         codeWriter.writeLine();
344 |         codeWriter.indent();
345 | 
346 |         // Constructor
347 |         this.writeConstructor(codeWriter, elem, options);
348 |         codeWriter.writeLine();
349 | 
350 |         // Member Variables
351 |         // (from attributes)
352 |         for (i = 0, len = elem.attributes.length; i < len; i++) {
353 |             this.writeMemberVariable(codeWriter, elem.attributes[i], options);
354 |             // codeWriter.writeLine();
355 |         }
356 |         // (from associations)
357 |         var associations = app.repository.getRelationshipsOf(elem, function (rel) {
358 |             return (rel instanceof type.UMLAssociation);
359 |         });
360 | 
361 |         console.log('association length: ' + associations.length);
362 | 
363 |         for (i = 0, len = associations.length; i < len; i++) {
364 |             var asso = associations[i];
365 |             if (asso.end1.reference === elem && asso.end2.navigable === true) {
366 |                 this.writeMemberVariable(codeWriter, asso.end2, options);
367 |                 // codeWriter.writeLine();
368 |                 console.log('assoc end1');
369 |             } else if (asso.end2.reference === elem && asso.end1.navigable === true) {
370 |                 this.writeMemberVariable(codeWriter, asso.end1, options);
371 |                 // codeWriter.writeLine();
372 |                 console.log('assoc end2');
373 |             }
374 |         }
375 | 
376 |         // Methods
377 |         for (i = 0, len = elem.operations.length; i < len; i++) {
378 |             this.writeMethod(codeWriter, elem.operations[i], options, false, false);
379 |             codeWriter.writeLine();
380 |         }
381 | 
382 |         // Inner Definitions
383 |         for (i = 0, len = elem.ownedElements.length; i < len; i++) {
384 |             var def = elem.ownedElements[i];
385 |             if (def instanceof type.UMLClass) {
386 |                 if (def.stereotype === "annotationType") {
387 |                     this.writeAnnotationType(codeWriter, def, options);
388 |                 } else {
389 |                     console.log("class in class");
390 |                     this.writeClass(codeWriter, def, options);
391 |                 }
392 |                 codeWriter.writeLine();
393 |             } else if (def instanceof type.UMLInterface) {
394 |                 this.writeInterface(codeWriter, def, options);
395 |                 codeWriter.writeLine();
396 |             } else if (def instanceof type.UMLEnumeration) {
397 |                 this.writeEnum(codeWriter, def, options);
398 |                 codeWriter.writeLine();
399 |             }
400 |         }
401 | 
402 | 
403 |         codeWriter.outdent();
404 |         codeWriter.writeLine("}");
405 | 
406 | 
407 |     };
408 | 
409 |     /**
410 |      * Write Class
411 |      * @param {StringWriter} codeWriter
412 |      * @param {type.Model} elem
413 |      * @param {Object} options
414 |      */
415 |     writeClass(codeWriter, elem, options) {
416 |         var i, len, terms = [];
417 | 
418 |         // Doc
419 |         var doc = elem.documentation.trim();
420 |         if (app.project.getProject().author && app.project.getProject().author.length > 0) {
421 |             doc += "\n@author " + app.project.getProject().author;
422 |         }
423 |         this.writeDoc(codeWriter, doc, options);
424 | 
425 |         // Modifiers
426 |         // var _modifiers = this.getModifiers(elem);
427 |         // if (elem.operations.some(function(op) {
428 |         //         return op.isAbstract === true;
429 |         //     })) {
430 |         //     _modifiers.push("abstract");
431 |         // }
432 |         // if (_modifiers.length > 0) {
433 |         //     terms.push(_modifiers.join(" "));
434 |         // }
435 | 
436 |         // Class
437 |         terms.push("class");
438 |         terms.push(elem.name);
439 | 
440 |         // Extends
441 |         var _extends = this.getSuperClasses(elem);
442 |         if (_extends.length > 0) {
443 |             terms.push("extends " + _extends[0].name);
444 |         }
445 | 
446 |         // Implements
447 |         var _implements = this.getSuperInterfaces(elem);
448 |         if (_implements.length > 0) {
449 |             if (_extends.length > 0) {
450 |                 terms.push(", " + _implements.map(function (e) {
451 |                     return e.name;
452 |                 }).join(", "));
453 |             } else {
454 |                 terms.push("implements " + _implements.map(function (e) {
455 |                     return e.name;
456 |                 }).join(", "));
457 |             }
458 |         }
459 | 
460 |         codeWriter.writeLine(terms.join(" ") + " {");
461 |         codeWriter.writeLine();
462 |         codeWriter.indent();
463 | 
464 |         // Constructor
465 |         this.writeConstructor(codeWriter, elem, options);
466 |         codeWriter.writeLine();
467 | 
468 |         // Member Variables
469 |         // (from attributes)
470 |         for (i = 0, len = elem.attributes.length; i < len; i++) {
471 |             this.writeMemberVariable(codeWriter, elem.attributes[i], options);
472 |             // codeWriter.writeLine();
473 |         }
474 |         // (from associations)
475 |         var associations = app.repository.getRelationshipsOf(elem, function (rel) {
476 |             return (rel instanceof type.UMLAssociation);
477 |         });
478 | 
479 |         console.log('association length: ' + associations.length);
480 | 
481 |         for (i = 0, len = associations.length; i < len; i++) {
482 |             var asso = associations[i];
483 |             if (asso.end1.reference === elem && asso.end2.navigable === true) {
484 |                 this.writeMemberVariable(codeWriter, asso.end2, options);
485 |                 // codeWriter.writeLine();
486 |                 console.log('assoc end1');
487 |             } else if (asso.end2.reference === elem && asso.end1.navigable === true) {
488 |                 this.writeMemberVariable(codeWriter, asso.end1, options);
489 |                 // codeWriter.writeLine();
490 |                 console.log('assoc end2');
491 |             }
492 |         }
493 | 
494 |         // Methods
495 |         for (i = 0, len = elem.operations.length; i < len; i++) {
496 |             this.writeMethod(codeWriter, elem.operations[i], options, false, false);
497 |             codeWriter.writeLine();
498 |         }
499 | 
500 |         // Inner Definitions
501 |         for (i = 0, len = elem.ownedElements.length; i < len; i++) {
502 |             var def = elem.ownedElements[i];
503 |             if (def instanceof type.UMLClass) {
504 |                 if (def.stereotype === "annotationType") {
505 |                     this.writeAnnotationType(codeWriter, def, options);
506 |                 } else {
507 |                     console.log("class in class");
508 |                     this.writeClass(codeWriter, def, options);
509 |                 }
510 |                 codeWriter.writeLine();
511 |             } else if (def instanceof type.UMLInterface) {
512 |                 this.writeInterface(codeWriter, def, options);
513 |                 codeWriter.writeLine();
514 |             } else if (def instanceof type.UMLEnumeration) {
515 |                 this.writeEnum(codeWriter, def, options);
516 |                 codeWriter.writeLine();
517 |             }
518 |         }
519 | 
520 |         codeWriter.outdent();
521 |         codeWriter.writeLine("}");
522 |     };
523 | 
524 |     /**
525 |      * Write Method
526 |      * @param {StringWriter} codeWriter
527 |      * @param {type.Model} elem
528 |      * @param {Object} options
529 |      * @param {boolean} skipBody
530 |      * @param {boolean} skipParams
531 |      */
532 |     writeMethod(codeWriter, elem, options, skipBody, skipParams) {
533 |         if (elem.name.length > 0) {
534 |             var terms = [];
535 |             var params = elem.getNonReturnParameters();
536 |             var returnParam = elem.getReturnParameter();
537 | 
538 |             // doc
539 |             var doc = elem.documentation.trim();
540 |             params.forEach(function (param) {
541 |                 doc += "\n@param " + param.name + " " + param.documentation;
542 |             });
543 |             if (returnParam) {
544 |                 doc += "\n@return " + returnParam.documentation;
545 |             }
546 |             this.writeDoc(codeWriter, doc, options);
547 | 
548 |             // modifiers
549 |             if (!elem._parent instanceof type.UMLInterface) {
550 |                 var _modifiers = this.getModifiers(elem);
551 |                 if (_modifiers.length > 0) {
552 |                     terms.push(_modifiers.join(" "));
553 |                 }
554 |             }
555 | 
556 |             // name + parameters
557 |             var paramTerms = [];
558 |             if (!skipParams) {
559 |                 var i, len;
560 |                 for (i = 0, len = params.length; i < len; i++) {
561 |                     var p = params[i];
562 |                     var s = p.name + ": " + this.getType(p);
563 |                     // if (p.isReadOnly === true) {
564 |                     //     s = "sealed " + s;
565 |                     // }
566 |                     paramTerms.push(s);
567 |                 }
568 |             }
569 |             terms.push(elem.name + "(" + paramTerms.join(", ") + ")");
570 | 
571 |             // type
572 |             terms.push(": ");
573 |             if (returnParam) {
574 |                 terms.push(this.getType(returnParam));
575 |             } else {
576 |                 terms.push("void");
577 |             }
578 | 
579 |             // body
580 |             if (skipBody === true || _modifiers.includes("abstract")) {
581 |                 codeWriter.writeLine(terms.join(" ") + ";");
582 |             } else {
583 |                 codeWriter.writeLine(terms.join(" ") + " {");
584 |                 codeWriter.indent();
585 |                 codeWriter.writeLine("// TODO implement here");
586 | 
587 |                 // return statement
588 |                 if (returnParam) {
589 |                     var returnType = this.getType(returnParam);
590 |                     if (returnType === "bool") {
591 |                         codeWriter.writeLine("return False;");
592 |                     } else if (returnType === "byte" ||
593 |                         returnType === "int" ||
594 |                         returnType === "sbyte" ||
595 |                         returnType === "short" ||
596 |                         returnType === "uint" ||
597 |                         returnType === "ulong" ||
598 |                         returnType === "ushort") {
599 |                         codeWriter.writeLine("return 0;");
600 |                     } else if (returnType === "float") {
601 |                         codeWriter.writeLine("return 0.0F;");
602 |                     } else if (returnType === "double") {
603 |                         codeWriter.writeLine("return 0.0D;");
604 |                     } else if (returnType === "long") {
605 |                         codeWriter.writeLine("return 0.0L;");
606 |                     } else if (returnType === "decimal") {
607 |                         codeWriter.writeLine("return 0.0M;");
608 |                     } else if (returnType === "char") {
609 |                         codeWriter.writeLine("return '\\0';");
610 |                     } else if (returnType === "string") {
611 |                         codeWriter.writeLine('return "";');
612 |                     } else {
613 |                         codeWriter.writeLine("return null;");
614 |                     }
615 |                 }
616 | 
617 |                 codeWriter.outdent();
618 |                 codeWriter.writeLine("}");
619 |             }
620 |         }
621 |     };
622 | 
623 |     /**
624 |      * Return type expression
625 |      * @param {type.Model} elem
626 |      * @return {string}
627 |      */
628 | 
629 |     getType(elem) {
630 |         var _type = "void";
631 |         // type name
632 |         if (elem instanceof type.UMLAssociationEnd) {
633 |             if (elem.reference instanceof type.UMLModelElement && elem.reference.name.length > 0) {
634 |                 _type = elem.reference.name;
635 |             }
636 |         } else {
637 |             if (elem.type instanceof type.UMLModelElement && elem.type.name.length > 0) {
638 |                 _type = elem.type.name;
639 |             } else if ((typeof elem.type === 'string') && elem.type.length > 0) {
640 |                 _type = elem.type;
641 |             }
642 |         }
643 | 
644 | 
645 |         // multiplicity
646 |         if (elem.multiplicity) {
647 |             if (["0..*", "1..*", "*"].includes(elem.multiplicity.trim())) {
648 |                 if (elem.isOrdered === true) {
649 |                     _type = "List<" + _type + ">";
650 |                 } else {
651 |                     _type = "HashSet<" + _type + ">";
652 |                 }
653 |             } else if (elem.multiplicity !== "1" && elem.multiplicity.match(/^\d+$/)) { // number
654 |                 _type += "[]";
655 |             }
656 |         }
657 |         return _type;
658 |     };
659 | 
660 | 
661 |     /**
662 |      * Write Member Variable
663 |      * @param {StringWriter} codeWriter
664 |      * @param {type.Model} elem
665 |      * @param {Object} options
666 |      */
667 | 
668 |     writeMemberVariable(codeWriter, elem, options) {
669 | 
670 |         if (elem.name.length > 0) {
671 |             var terms = [];
672 |             // doc
673 |             this.writeDoc(codeWriter, elem.documentation, options);
674 | 
675 |             // modifiers
676 |             console.log('writemember', 'elem', elem, elem._parent instanceof type.UMLInterface);
677 |             if (!elem._parent instanceof type.UMLInterface) {
678 |                 var _modifiers = this.getModifiers(elem);
679 |                 if (_modifiers.length > 0) {
680 |                     terms.push(_modifiers.join(" "));
681 |                 }
682 |             }
683 | 
684 |             // name
685 |             terms.push(elem.name);
686 |             terms.push(": ");
687 | 
688 |             // type
689 |             terms.push(this.getType(elem));
690 | 
691 |             // initial value
692 |             if (elem.defaultValue && elem.defaultValue.length > 0) {
693 |                 terms.push("= " + elem.defaultValue);
694 |             }
695 |             codeWriter.writeLine(terms.join("") + ";");
696 |         }
697 |     };
698 | 
699 |     /**
700 |      * Write Constructor
701 |      * @param {StringWriter} codeWriter
702 |      * @param {type.Model} elem
703 |      * @param {Object} options
704 |      */
705 |     writeConstructor(codeWriter, elem, options) {
706 |         if (elem.name.length > 0) {
707 |             var terms = [];
708 |             // Doc
709 |             this.writeDoc(codeWriter, elem.documentation, options);
710 | 
711 |             // Visibility
712 |             var visibility = this.getVisibility(elem);
713 |             if (visibility) {
714 |                 terms.push(visibility);
715 |             }
716 |             terms.push("constructor()");
717 |             codeWriter.writeLine(terms.join(" ") + " {");
718 |             codeWriter.writeLine("}");
719 |         }
720 |     };
721 | 
722 |     /**
723 |      * Write Doc
724 |      * @param {StringWriter} codeWriter
725 |      * @param {string} text
726 |      * @param {Object} options
727 |      */
728 |     writeDoc(codeWriter, text, options) {
729 |         var i, len, lines;
730 |         if (options.tsDoc && (typeof text === 'string')) {
731 |             console.log("write Doc");
732 |             lines = text.trim().split("\n");
733 |             codeWriter.writeLine("/**");
734 |             for (i = 0, len = lines.length; i < len; i++) {
735 |                 codeWriter.writeLine(" * " + lines[i]);
736 |             }
737 |             codeWriter.writeLine(" */");
738 |         }
739 |     };
740 | 
741 |     /**
742 |      * Return visibility
743 |      * @param {type.Model} elem
744 |      * @return {string}
745 |      */
746 |     getVisibility(elem) {
747 |         switch (elem.visibility) {
748 |             case type.UMLModelElement.VK_PUBLIC:
749 |                 return "public";
750 |             case type.UMLModelElement.VK_PROTECTED:
751 |                 return "protected";
752 |             case type.UMLModelElement.VK_PRIVATE:
753 |                 return "private";
754 |         }
755 |         return null;
756 |     };
757 | 
758 |     /**
759 |      * Collect modifiers of a given element.
760 |      * @param {type.Model} elem
761 |      * @return {Array.<string>}
762 |      */
763 |     getModifiers(elem) {
764 |         var modifiers = [];
765 |         var visibility = this.getVisibility(elem);
766 |         if (visibility) {
767 |             modifiers.push(visibility);
768 |         }
769 |         if (elem.isStatic === true) {
770 |             modifiers.push("static");
771 |         }
772 |         if (elem.isAbstract === true) {
773 |             modifiers.push("abstract");
774 |         }
775 |         if (elem.isFinalSpecialization === true || elem.isLeaf === true) {
776 |             modifiers.push("sealed");
777 |         }
778 |         //if (elem.concurrency === UML.CCK_CONCURRENT) {
779 |         //http://msdn.microsoft.com/ko-kr/library/c5kehkcz.aspx
780 |         //modifiers.push("synchronized");
781 |         //}
782 |         // transient
783 |         // volatile
784 |         // strictfp
785 |         // const
786 |         // native
787 |         return modifiers;
788 |     };
789 | 
790 |     /**
791 |      * Collect super classes of a given element
792 |      * @param {type.Model} elem
793 |      * @return {Array.<type.Model>}
794 |      */
795 |     getSuperClasses(elem) {
796 |         var generalizations = app.repository.getRelationshipsOf(elem, function (rel) {
797 |             return (rel instanceof type.UMLGeneralization && rel.source === elem);
798 |         });
799 |         return generalizations.map(function (gen) {
800 |             return gen.target;
801 |         });
802 |     };
803 | 
804 |     /**
805 |      * Collect super interfaces of a given element
806 |      * @param {type.Model} elem
807 |      * @return {Array.<type.Model>}
808 |      */
809 |     getSuperInterfaces(elem) {
810 |         var realizations = app.repository.getRelationshipsOf(elem, function (rel) {
811 |             return (rel instanceof type.UMLInterfaceRealization && rel.source === elem);
812 |         });
813 |         return realizations.map(function (gen) {
814 |             return gen.target;
815 |         });
816 |     };
817 | 
818 | }
819 | 
820 | 
821 | /**
822 |  * Generate
823 |  * @param {type.Model} baseModel
824 |  * @param {string} basePath
825 |  * @param {Object} options
826 |  */
827 | function generate(baseModel, basePath, options) {
828 |     var typeScriptCodeGenerator = new TypeScriptCodeGenerator(baseModel, basePath);
829 |     return typeScriptCodeGenerator.generate(baseModel, basePath, options);
830 | }
831 | 
832 | exports.generate = generate;
833 | 
834 | 


--------------------------------------------------------------------------------