├── Create Android VectorDrawable (NO vc_).sketchplugin ├── Create Android VectorDrawable (with vc_).sketchplugin ├── LICENSE ├── README.md ├── img └── screenshot1.png └── library ├── cssjson.js ├── generator.js ├── helpers.js ├── htmlparser.js ├── main.js ├── sandbox.js └── svg_shape_converter.js /Create Android VectorDrawable (NO vc_).sketchplugin: -------------------------------------------------------------------------------- 1 | // (cmd shift ;) 2 | // 3 | // Developer: Jacob Moncur 4 | @import 'library/main.js' 5 | 6 | var home_folder = "/Users/" + NSUserName(); 7 | new AppSandbox().authorize(home_folder, function() { 8 | main.export(false); 9 | }); 10 | -------------------------------------------------------------------------------- /Create Android VectorDrawable (with vc_).sketchplugin: -------------------------------------------------------------------------------- 1 | // (cmd shift ;) 2 | // 3 | // Developer: Jacob Moncur 4 | @import 'library/main.js' 5 | 6 | var home_folder = "/Users/" + NSUserName(); 7 | new AppSandbox().authorize(home_folder, function() { 8 | main.export(true); 9 | }); 10 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | ========================== 3 | 4 | Version 3, 29 June 2007 5 | 6 | Copyright © 2007 Free Software Foundation, Inc. <> 7 | 8 | Everyone is permitted to copy and distribute verbatim copies of this license 9 | document, but changing it is not allowed. 10 | 11 | ## Preamble 12 | 13 | The GNU General Public License is a free, copyleft license for software and other 14 | kinds of works. 15 | 16 | The licenses for most software and other practical works are designed to take away 17 | your freedom to share and change the works. By contrast, the GNU General Public 18 | License is intended to guarantee your freedom to share and change all versions of a 19 | program--to make sure it remains free software for all its users. We, the Free 20 | Software Foundation, use the GNU General Public License for most of our software; it 21 | applies also to any other work released this way by its authors. You can apply it to 22 | your programs, too. 23 | 24 | When we speak of free software, we are referring to freedom, not price. Our General 25 | Public Licenses are designed to make sure that you have the freedom to distribute 26 | copies of free software (and charge for them if you wish), that you receive source 27 | code or can get it if you want it, that you can change the software or use pieces of 28 | it in new free programs, and that you know you can do these things. 29 | 30 | To protect your rights, we need to prevent others from denying you these rights or 31 | asking you to surrender the rights. Therefore, you have certain responsibilities if 32 | you distribute copies of the software, or if you modify it: responsibilities to 33 | respect the freedom of others. 34 | 35 | For example, if you distribute copies of such a program, whether gratis or for a fee, 36 | you must pass on to the recipients the same freedoms that you received. You must make 37 | sure that they, too, receive or can get the source code. And you must show them these 38 | terms so they know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: (1) assert 41 | copyright on the software, and (2) offer you this License giving you legal permission 42 | to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains that there is 45 | no warranty for this free software. For both users' and authors' sake, the GPL 46 | requires that modified versions be marked as changed, so that their problems will not 47 | be attributed erroneously to authors of previous versions. 48 | 49 | Some devices are designed to deny users access to install or run modified versions of 50 | the software inside them, although the manufacturer can do so. This is fundamentally 51 | incompatible with the aim of protecting users' freedom to change the software. The 52 | systematic pattern of such abuse occurs in the area of products for individuals to 53 | use, which is precisely where it is most unacceptable. Therefore, we have designed 54 | this version of the GPL to prohibit the practice for those products. If such problems 55 | arise substantially in other domains, we stand ready to extend this provision to 56 | those domains in future versions of the GPL, as needed to protect the freedom of 57 | users. 58 | 59 | Finally, every program is threatened constantly by software patents. States should 60 | not allow patents to restrict development and use of software on general-purpose 61 | computers, but in those that do, we wish to avoid the special danger that patents 62 | applied to a free program could make it effectively proprietary. To prevent this, the 63 | GPL assures that patents cannot be used to render the program non-free. 64 | 65 | The precise terms and conditions for copying, distribution and modification follow. 66 | 67 | ## TERMS AND CONDITIONS 68 | 69 | ### 0. Definitions. 70 | 71 | “This License” refers to version 3 of the GNU General Public License. 72 | 73 | “Copyright” also means copyright-like laws that apply to other kinds of 74 | works, such as semiconductor masks. 75 | 76 | “The Program” refers to any copyrightable work licensed under this 77 | License. Each licensee is addressed as “you”. “Licensees” and 78 | “recipients” may be individuals or organizations. 79 | 80 | To “modify” a work means to copy from or adapt all or part of the work in 81 | a fashion requiring copyright permission, other than the making of an exact copy. The 82 | resulting work is called a “modified version” of the earlier work or a 83 | work “based on” the earlier work. 84 | 85 | A “covered work” means either the unmodified Program or a work based on 86 | the Program. 87 | 88 | To “propagate” a work means to do anything with it that, without 89 | permission, would make you directly or secondarily liable for infringement under 90 | applicable copyright law, except executing it on a computer or modifying a private 91 | copy. Propagation includes copying, distribution (with or without modification), 92 | making available to the public, and in some countries other activities as well. 93 | 94 | To “convey” a work means any kind of propagation that enables other 95 | parties to make or receive copies. Mere interaction with a user through a computer 96 | network, with no transfer of a copy, is not conveying. 97 | 98 | An interactive user interface displays “Appropriate Legal Notices” to the 99 | extent that it includes a convenient and prominently visible feature that (1) 100 | displays an appropriate copyright notice, and (2) tells the user that there is no 101 | warranty for the work (except to the extent that warranties are provided), that 102 | licensees may convey the work under this License, and how to view a copy of this 103 | License. If the interface presents a list of user commands or options, such as a 104 | menu, a prominent item in the list meets this criterion. 105 | 106 | ### 1. Source Code. 107 | 108 | The “source code” for a work means the preferred form of the work for 109 | making modifications to it. “Object code” means any non-source form of a 110 | work. 111 | 112 | A “Standard Interface” means an interface that either is an official 113 | standard defined by a recognized standards body, or, in the case of interfaces 114 | specified for a particular programming language, one that is widely used among 115 | developers working in that language. 116 | 117 | The “System Libraries” of an executable work include anything, other than 118 | the work as a whole, that (a) is included in the normal form of packaging a Major 119 | Component, but which is not part of that Major Component, and (b) serves only to 120 | enable use of the work with that Major Component, or to implement a Standard 121 | Interface for which an implementation is available to the public in source code form. 122 | A “Major Component”, in this context, means a major essential component 123 | (kernel, window system, and so on) of the specific operating system (if any) on which 124 | the executable work runs, or a compiler used to produce the work, or an object code 125 | interpreter used to run it. 126 | 127 | The “Corresponding Source” for a work in object code form means all the 128 | source code needed to generate, install, and (for an executable work) run the object 129 | code and to modify the work, including scripts to control those activities. However, 130 | it does not include the work's System Libraries, or general-purpose tools or 131 | generally available free programs which are used unmodified in performing those 132 | activities but which are not part of the work. For example, Corresponding Source 133 | includes interface definition files associated with source files for the work, and 134 | the source code for shared libraries and dynamically linked subprograms that the work 135 | is specifically designed to require, such as by intimate data communication or 136 | control flow between those subprograms and other parts of the work. 137 | 138 | The Corresponding Source need not include anything that users can regenerate 139 | automatically from other parts of the Corresponding Source. 140 | 141 | The Corresponding Source for a work in source code form is that same work. 142 | 143 | ### 2. Basic Permissions. 144 | 145 | All rights granted under this License are granted for the term of copyright on the 146 | Program, and are irrevocable provided the stated conditions are met. This License 147 | explicitly affirms your unlimited permission to run the unmodified Program. The 148 | output from running a covered work is covered by this License only if the output, 149 | given its content, constitutes a covered work. This License acknowledges your rights 150 | of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not convey, without 153 | conditions so long as your license otherwise remains in force. You may convey covered 154 | works to others for the sole purpose of having them make modifications exclusively 155 | for you, or provide you with facilities for running those works, provided that you 156 | comply with the terms of this License in conveying all material for which you do not 157 | control copyright. Those thus making or running the covered works for you must do so 158 | exclusively on your behalf, under your direction and control, on terms that prohibit 159 | them from making any copies of your copyrighted material outside their relationship 160 | with you. 161 | 162 | Conveying under any other circumstances is permitted solely under the conditions 163 | stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 164 | 165 | ### 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 166 | 167 | No covered work shall be deemed part of an effective technological measure under any 168 | applicable law fulfilling obligations under article 11 of the WIPO copyright treaty 169 | adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention 170 | of such measures. 171 | 172 | When you convey a covered work, you waive any legal power to forbid circumvention of 173 | technological measures to the extent such circumvention is effected by exercising 174 | rights under this License with respect to the covered work, and you disclaim any 175 | intention to limit operation or modification of the work as a means of enforcing, 176 | against the work's users, your or third parties' legal rights to forbid circumvention 177 | of technological measures. 178 | 179 | ### 4. Conveying Verbatim Copies. 180 | 181 | You may convey verbatim copies of the Program's source code as you receive it, in any 182 | medium, provided that you conspicuously and appropriately publish on each copy an 183 | appropriate copyright notice; keep intact all notices stating that this License and 184 | any non-permissive terms added in accord with section 7 apply to the code; keep 185 | intact all notices of the absence of any warranty; and give all recipients a copy of 186 | this License along with the Program. 187 | 188 | You may charge any price or no price for each copy that you convey, and you may offer 189 | support or warranty protection for a fee. 190 | 191 | ### 5. Conveying Modified Source Versions. 192 | 193 | You may convey a work based on the Program, or the modifications to produce it from 194 | the Program, in the form of source code under the terms of section 4, provided that 195 | you also meet all of these conditions: 196 | 197 | * **a)** The work must carry prominent notices stating that you modified it, and giving a 198 | relevant date. 199 | * **b)** The work must carry prominent notices stating that it is released under this 200 | License and any conditions added under section 7. This requirement modifies the 201 | requirement in section 4 to “keep intact all notices”. 202 | * **c)** You must license the entire work, as a whole, under this License to anyone who 203 | comes into possession of a copy. This License will therefore apply, along with any 204 | applicable section 7 additional terms, to the whole of the work, and all its parts, 205 | regardless of how they are packaged. This License gives no permission to license the 206 | work in any other way, but it does not invalidate such permission if you have 207 | separately received it. 208 | * **d)** If the work has interactive user interfaces, each must display Appropriate Legal 209 | Notices; however, if the Program has interactive interfaces that do not display 210 | Appropriate Legal Notices, your work need not make them do so. 211 | 212 | A compilation of a covered work with other separate and independent works, which are 213 | not by their nature extensions of the covered work, and which are not combined with 214 | it such as to form a larger program, in or on a volume of a storage or distribution 215 | medium, is called an “aggregate” if the compilation and its resulting 216 | copyright are not used to limit the access or legal rights of the compilation's users 217 | beyond what the individual works permit. Inclusion of a covered work in an aggregate 218 | does not cause this License to apply to the other parts of the aggregate. 219 | 220 | ### 6. Conveying Non-Source Forms. 221 | 222 | You may convey a covered work in object code form under the terms of sections 4 and 223 | 5, provided that you also convey the machine-readable Corresponding Source under the 224 | terms of this License, in one of these ways: 225 | 226 | * **a)** Convey the object code in, or embodied in, a physical product (including a 227 | physical distribution medium), accompanied by the Corresponding Source fixed on a 228 | durable physical medium customarily used for software interchange. 229 | * **b)** Convey the object code in, or embodied in, a physical product (including a 230 | physical distribution medium), accompanied by a written offer, valid for at least 231 | three years and valid for as long as you offer spare parts or customer support for 232 | that product model, to give anyone who possesses the object code either (1) a copy of 233 | the Corresponding Source for all the software in the product that is covered by this 234 | License, on a durable physical medium customarily used for software interchange, for 235 | a price no more than your reasonable cost of physically performing this conveying of 236 | source, or (2) access to copy the Corresponding Source from a network server at no 237 | charge. 238 | * **c)** Convey individual copies of the object code with a copy of the written offer to 239 | provide the Corresponding Source. This alternative is allowed only occasionally and 240 | noncommercially, and only if you received the object code with such an offer, in 241 | accord with subsection 6b. 242 | * **d)** Convey the object code by offering access from a designated place (gratis or for 243 | a charge), and offer equivalent access to the Corresponding Source in the same way 244 | through the same place at no further charge. You need not require recipients to copy 245 | the Corresponding Source along with the object code. If the place to copy the object 246 | code is a network server, the Corresponding Source may be on a different server 247 | (operated by you or a third party) that supports equivalent copying facilities, 248 | provided you maintain clear directions next to the object code saying where to find 249 | the Corresponding Source. Regardless of what server hosts the Corresponding Source, 250 | you remain obligated to ensure that it is available for as long as needed to satisfy 251 | these requirements. 252 | * **e)** Convey the object code using peer-to-peer transmission, provided you inform 253 | other peers where the object code and Corresponding Source of the work are being 254 | offered to the general public at no charge under subsection 6d. 255 | 256 | A separable portion of the object code, whose source code is excluded from the 257 | Corresponding Source as a System Library, need not be included in conveying the 258 | object code work. 259 | 260 | A “User Product” is either (1) a “consumer product”, which 261 | means any tangible personal property which is normally used for personal, family, or 262 | household purposes, or (2) anything designed or sold for incorporation into a 263 | dwelling. In determining whether a product is a consumer product, doubtful cases 264 | shall be resolved in favor of coverage. For a particular product received by a 265 | particular user, “normally used” refers to a typical or common use of 266 | that class of product, regardless of the status of the particular user or of the way 267 | in which the particular user actually uses, or expects or is expected to use, the 268 | product. A product is a consumer product regardless of whether the product has 269 | substantial commercial, industrial or non-consumer uses, unless such uses represent 270 | the only significant mode of use of the product. 271 | 272 | “Installation Information” for a User Product means any methods, 273 | procedures, authorization keys, or other information required to install and execute 274 | modified versions of a covered work in that User Product from a modified version of 275 | its Corresponding Source. The information must suffice to ensure that the continued 276 | functioning of the modified object code is in no case prevented or interfered with 277 | solely because modification has been made. 278 | 279 | If you convey an object code work under this section in, or with, or specifically for 280 | use in, a User Product, and the conveying occurs as part of a transaction in which 281 | the right of possession and use of the User Product is transferred to the recipient 282 | in perpetuity or for a fixed term (regardless of how the transaction is 283 | characterized), the Corresponding Source conveyed under this section must be 284 | accompanied by the Installation Information. But this requirement does not apply if 285 | neither you nor any third party retains the ability to install modified object code 286 | on the User Product (for example, the work has been installed in ROM). 287 | 288 | The requirement to provide Installation Information does not include a requirement to 289 | continue to provide support service, warranty, or updates for a work that has been 290 | modified or installed by the recipient, or for the User Product in which it has been 291 | modified or installed. Access to a network may be denied when the modification itself 292 | materially and adversely affects the operation of the network or violates the rules 293 | and protocols for communication across the network. 294 | 295 | Corresponding Source conveyed, and Installation Information provided, in accord with 296 | this section must be in a format that is publicly documented (and with an 297 | implementation available to the public in source code form), and must require no 298 | special password or key for unpacking, reading or copying. 299 | 300 | ### 7. Additional Terms. 301 | 302 | “Additional permissions” are terms that supplement the terms of this 303 | License by making exceptions from one or more of its conditions. Additional 304 | permissions that are applicable to the entire Program shall be treated as though they 305 | were included in this License, to the extent that they are valid under applicable 306 | law. If additional permissions apply only to part of the Program, that part may be 307 | used separately under those permissions, but the entire Program remains governed by 308 | this License without regard to the additional permissions. 309 | 310 | When you convey a copy of a covered work, you may at your option remove any 311 | additional permissions from that copy, or from any part of it. (Additional 312 | permissions may be written to require their own removal in certain cases when you 313 | modify the work.) You may place additional permissions on material, added by you to a 314 | covered work, for which you have or can give appropriate copyright permission. 315 | 316 | Notwithstanding any other provision of this License, for material you add to a 317 | covered work, you may (if authorized by the copyright holders of that material) 318 | supplement the terms of this License with terms: 319 | 320 | * **a)** Disclaiming warranty or limiting liability differently from the terms of 321 | sections 15 and 16 of this License; or 322 | * **b)** Requiring preservation of specified reasonable legal notices or author 323 | attributions in that material or in the Appropriate Legal Notices displayed by works 324 | containing it; or 325 | * **c)** Prohibiting misrepresentation of the origin of that material, or requiring that 326 | modified versions of such material be marked in reasonable ways as different from the 327 | original version; or 328 | * **d)** Limiting the use for publicity purposes of names of licensors or authors of the 329 | material; or 330 | * **e)** Declining to grant rights under trademark law for use of some trade names, 331 | trademarks, or service marks; or 332 | * **f)** Requiring indemnification of licensors and authors of that material by anyone 333 | who conveys the material (or modified versions of it) with contractual assumptions of 334 | liability to the recipient, for any liability that these contractual assumptions 335 | directly impose on those licensors and authors. 336 | 337 | All other non-permissive additional terms are considered “further 338 | restrictions” within the meaning of section 10. If the Program as you received 339 | it, or any part of it, contains a notice stating that it is governed by this License 340 | along with a term that is a further restriction, you may remove that term. If a 341 | license document contains a further restriction but permits relicensing or conveying 342 | under this License, you may add to a covered work material governed by the terms of 343 | that license document, provided that the further restriction does not survive such 344 | relicensing or conveying. 345 | 346 | If you add terms to a covered work in accord with this section, you must place, in 347 | the relevant source files, a statement of the additional terms that apply to those 348 | files, or a notice indicating where to find the applicable terms. 349 | 350 | Additional terms, permissive or non-permissive, may be stated in the form of a 351 | separately written license, or stated as exceptions; the above requirements apply 352 | either way. 353 | 354 | ### 8. Termination. 355 | 356 | You may not propagate or modify a covered work except as expressly provided under 357 | this License. Any attempt otherwise to propagate or modify it is void, and will 358 | automatically terminate your rights under this License (including any patent licenses 359 | granted under the third paragraph of section 11). 360 | 361 | However, if you cease all violation of this License, then your license from a 362 | particular copyright holder is reinstated (a) provisionally, unless and until the 363 | copyright holder explicitly and finally terminates your license, and (b) permanently, 364 | if the copyright holder fails to notify you of the violation by some reasonable means 365 | prior to 60 days after the cessation. 366 | 367 | Moreover, your license from a particular copyright holder is reinstated permanently 368 | if the copyright holder notifies you of the violation by some reasonable means, this 369 | is the first time you have received notice of violation of this License (for any 370 | work) from that copyright holder, and you cure the violation prior to 30 days after 371 | your receipt of the notice. 372 | 373 | Termination of your rights under this section does not terminate the licenses of 374 | parties who have received copies or rights from you under this License. If your 375 | rights have been terminated and not permanently reinstated, you do not qualify to 376 | receive new licenses for the same material under section 10. 377 | 378 | ### 9. Acceptance Not Required for Having Copies. 379 | 380 | You are not required to accept this License in order to receive or run a copy of the 381 | Program. Ancillary propagation of a covered work occurring solely as a consequence of 382 | using peer-to-peer transmission to receive a copy likewise does not require 383 | acceptance. However, nothing other than this License grants you permission to 384 | propagate or modify any covered work. These actions infringe copyright if you do not 385 | accept this License. Therefore, by modifying or propagating a covered work, you 386 | indicate your acceptance of this License to do so. 387 | 388 | ### 10. Automatic Licensing of Downstream Recipients. 389 | 390 | Each time you convey a covered work, the recipient automatically receives a license 391 | from the original licensors, to run, modify and propagate that work, subject to this 392 | License. You are not responsible for enforcing compliance by third parties with this 393 | License. 394 | 395 | An “entity transaction” is a transaction transferring control of an 396 | organization, or substantially all assets of one, or subdividing an organization, or 397 | merging organizations. If propagation of a covered work results from an entity 398 | transaction, each party to that transaction who receives a copy of the work also 399 | receives whatever licenses to the work the party's predecessor in interest had or 400 | could give under the previous paragraph, plus a right to possession of the 401 | Corresponding Source of the work from the predecessor in interest, if the predecessor 402 | has it or can get it with reasonable efforts. 403 | 404 | You may not impose any further restrictions on the exercise of the rights granted or 405 | affirmed under this License. For example, you may not impose a license fee, royalty, 406 | or other charge for exercise of rights granted under this License, and you may not 407 | initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging 408 | that any patent claim is infringed by making, using, selling, offering for sale, or 409 | importing the Program or any portion of it. 410 | 411 | ### 11. Patents. 412 | 413 | A “contributor” is a copyright holder who authorizes use under this 414 | License of the Program or a work on which the Program is based. The work thus 415 | licensed is called the contributor's “contributor version”. 416 | 417 | A contributor's “essential patent claims” are all patent claims owned or 418 | controlled by the contributor, whether already acquired or hereafter acquired, that 419 | would be infringed by some manner, permitted by this License, of making, using, or 420 | selling its contributor version, but do not include claims that would be infringed 421 | only as a consequence of further modification of the contributor version. For 422 | purposes of this definition, “control” includes the right to grant patent 423 | sublicenses in a manner consistent with the requirements of this License. 424 | 425 | Each contributor grants you a non-exclusive, worldwide, royalty-free patent license 426 | under the contributor's essential patent claims, to make, use, sell, offer for sale, 427 | import and otherwise run, modify and propagate the contents of its contributor 428 | version. 429 | 430 | In the following three paragraphs, a “patent license” is any express 431 | agreement or commitment, however denominated, not to enforce a patent (such as an 432 | express permission to practice a patent or covenant not to sue for patent 433 | infringement). To “grant” such a patent license to a party means to make 434 | such an agreement or commitment not to enforce a patent against the party. 435 | 436 | If you convey a covered work, knowingly relying on a patent license, and the 437 | Corresponding Source of the work is not available for anyone to copy, free of charge 438 | and under the terms of this License, through a publicly available network server or 439 | other readily accessible means, then you must either (1) cause the Corresponding 440 | Source to be so available, or (2) arrange to deprive yourself of the benefit of the 441 | patent license for this particular work, or (3) arrange, in a manner consistent with 442 | the requirements of this License, to extend the patent license to downstream 443 | recipients. “Knowingly relying” means you have actual knowledge that, but 444 | for the patent license, your conveying the covered work in a country, or your 445 | recipient's use of the covered work in a country, would infringe one or more 446 | identifiable patents in that country that you have reason to believe are valid. 447 | 448 | If, pursuant to or in connection with a single transaction or arrangement, you 449 | convey, or propagate by procuring conveyance of, a covered work, and grant a patent 450 | license to some of the parties receiving the covered work authorizing them to use, 451 | propagate, modify or convey a specific copy of the covered work, then the patent 452 | license you grant is automatically extended to all recipients of the covered work and 453 | works based on it. 454 | 455 | A patent license is “discriminatory” if it does not include within the 456 | scope of its coverage, prohibits the exercise of, or is conditioned on the 457 | non-exercise of one or more of the rights that are specifically granted under this 458 | License. You may not convey a covered work if you are a party to an arrangement with 459 | a third party that is in the business of distributing software, under which you make 460 | payment to the third party based on the extent of your activity of conveying the 461 | work, and under which the third party grants, to any of the parties who would receive 462 | the covered work from you, a discriminatory patent license (a) in connection with 463 | copies of the covered work conveyed by you (or copies made from those copies), or (b) 464 | primarily for and in connection with specific products or compilations that contain 465 | the covered work, unless you entered into that arrangement, or that patent license 466 | was granted, prior to 28 March 2007. 467 | 468 | Nothing in this License shall be construed as excluding or limiting any implied 469 | license or other defenses to infringement that may otherwise be available to you 470 | under applicable patent law. 471 | 472 | ### 12. No Surrender of Others' Freedom. 473 | 474 | If conditions are imposed on you (whether by court order, agreement or otherwise) 475 | that contradict the conditions of this License, they do not excuse you from the 476 | conditions of this License. If you cannot convey a covered work so as to satisfy 477 | simultaneously your obligations under this License and any other pertinent 478 | obligations, then as a consequence you may not convey it at all. For example, if you 479 | agree to terms that obligate you to collect a royalty for further conveying from 480 | those to whom you convey the Program, the only way you could satisfy both those terms 481 | and this License would be to refrain entirely from conveying the Program. 482 | 483 | ### 13. Use with the GNU Affero General Public License. 484 | 485 | Notwithstanding any other provision of this License, you have permission to link or 486 | combine any covered work with a work licensed under version 3 of the GNU Affero 487 | General Public License into a single combined work, and to convey the resulting work. 488 | The terms of this License will continue to apply to the part which is the covered 489 | work, but the special requirements of the GNU Affero General Public License, section 490 | 13, concerning interaction through a network will apply to the combination as such. 491 | 492 | ### 14. Revised Versions of this License. 493 | 494 | The Free Software Foundation may publish revised and/or new versions of the GNU 495 | General Public License from time to time. Such new versions will be similar in spirit 496 | to the present version, but may differ in detail to address new problems or concerns. 497 | 498 | Each version is given a distinguishing version number. If the Program specifies that 499 | a certain numbered version of the GNU General Public License “or any later 500 | version” applies to it, you have the option of following the terms and 501 | conditions either of that numbered version or of any later version published by the 502 | Free Software Foundation. If the Program does not specify a version number of the GNU 503 | General Public License, you may choose any version ever published by the Free 504 | Software Foundation. 505 | 506 | If the Program specifies that a proxy can decide which future versions of the GNU 507 | General Public License can be used, that proxy's public statement of acceptance of a 508 | version permanently authorizes you to choose that version for the Program. 509 | 510 | Later license versions may give you additional or different permissions. However, no 511 | additional obligations are imposed on any author or copyright holder as a result of 512 | your choosing to follow a later version. 513 | 514 | ### 15. Disclaimer of Warranty. 515 | 516 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. 517 | EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 518 | PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER 519 | EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 520 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE 521 | QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE 522 | DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 523 | 524 | ### 16. Limitation of Liability. 525 | 526 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY 527 | COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS 528 | PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, 529 | INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE 530 | PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE 531 | OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE 532 | WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 533 | POSSIBILITY OF SUCH DAMAGES. 534 | 535 | ### 17. Interpretation of Sections 15 and 16. 536 | 537 | If the disclaimer of warranty and limitation of liability provided above cannot be 538 | given local legal effect according to their terms, reviewing courts shall apply local 539 | law that most closely approximates an absolute waiver of all civil liability in 540 | connection with the Program, unless a warranty or assumption of liability accompanies 541 | a copy of the Program in return for a fee. 542 | 543 | END OF TERMS AND CONDITIONS 544 | 545 | ## How to Apply These Terms to Your New Programs 546 | 547 | If you develop a new program, and you want it to be of the greatest possible use to 548 | the public, the best way to achieve this is to make it free software which everyone 549 | can redistribute and change under these terms. 550 | 551 | To do so, attach the following notices to the program. It is safest to attach them 552 | to the start of each source file to most effectively state the exclusion of warranty; 553 | and each file should have at least the “copyright” line and a pointer to 554 | where the full notice is found. 555 | 556 | 557 | Copyright (C) 558 | 559 | This program is free software: you can redistribute it and/or modify 560 | it under the terms of the GNU General Public License as published by 561 | the Free Software Foundation, either version 3 of the License, or 562 | (at your option) any later version. 563 | 564 | This program is distributed in the hope that it will be useful, 565 | but WITHOUT ANY WARRANTY; without even the implied warranty of 566 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 567 | GNU General Public License for more details. 568 | 569 | You should have received a copy of the GNU General Public License 570 | along with this program. If not, see . 571 | 572 | Also add information on how to contact you by electronic and paper mail. 573 | 574 | If the program does terminal interaction, make it output a short notice like this 575 | when it starts in an interactive mode: 576 | 577 | Copyright (C) 578 | This program comes with ABSOLUTELY NO WARRANTY; for details type 'show w'. 579 | This is free software, and you are welcome to redistribute it 580 | under certain conditions; type 'show c' for details. 581 | 582 | The hypothetical commands 'show w' and 'show c' should show the appropriate parts of 583 | the General Public License. Of course, your program's commands might be different; 584 | for a GUI interface, you would use an “about box”. 585 | 586 | You should also get your employer (if you work as a programmer) or school, if any, to 587 | sign a “copyright disclaimer” for the program, if necessary. For more 588 | information on this, and how to apply and follow the GNU GPL, see 589 | <>. 590 | 591 | The GNU General Public License does not permit incorporating your program into 592 | proprietary programs. If your program is a subroutine library, you may consider it 593 | more useful to permit linking proprietary applications with the library. If this is 594 | what you want to do, use the GNU Lesser General Public License instead of this 595 | License. But first, please read 596 | <>. 597 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Export Android VectorDrawable 2 | 3 | Exports assets as a VectorDrawable for Android. Say goodbye to a bajillion assets. 4 | 5 | ![screenshot](img/screenshot1.png) 6 | 7 | Supports [VectorDrawable] as well as [vector-compat]. 8 | 9 | Added in the option to generate a VectorDrawable without the compat options. 10 | 11 | ## Installing Plugins 12 | ### The conventional way: 13 | 1. [Download the ZIP file with the Measure](https://github.com/jacobmoncur/SketchVectorDrawable/archive/master.zip) 14 | 2. Copy the contents to the plugin folder (Open up Sketch, and go to `Plugins` › `Reveal Plugins Folder…` to open it.) 15 | 16 | ### The quickest way: 17 | 18 | _NOTE: If your Mac has not installed GitHub client, You need to install [GitHub for mac](https://mac.github.com)_ 19 | 20 | 1. Click on the [Clone in Desktop](github-mac://openRepo/https://github.com/jacobmoncur/SketchVectorDrawable) button on GitHub 21 | 2. Press `command` + `shift` + `g` to find plugin folder, then paste plugin folder path 22 | 23 | **Plugin Folder Path** 24 | 25 | * App Store `~/Library/Containers/com.bohemiancoding.sketch3/Data/Library/Application Support/com.bohemiancoding.sketch3/Plugins` 26 | * Beta `~/Library/Application Support/com.bohemiancoding.sketch3/Plugins` 27 | 28 | ## Shortcuts 29 | 30 | * Export: cmd + shift + ; 31 | 32 | ## Props to: 33 | 34 | * [svg2android]. Svg to VectorDrawable webpage (super cool). A lot of the translation is based off this. 35 | * [sketch-export-assets]. What I based this sketch plugin off of. 36 | 37 | [svg2android]:https://github.com/inloop/svg2android 38 | [sketch-export-assets]:https://github.com/geertwille/sketch-export-assets 39 | [VectorDrawable]:https://developer.android.com/reference/android/graphics/drawable/VectorDrawable.html 40 | [vector-compat]:https://github.com/wnafee/vector-compat 41 | -------------------------------------------------------------------------------- /img/screenshot1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/jacobmoncur/SketchVectorDrawable/8e4c7e0a590ffc6a1cdbbe589d4156dc12dac7f8/img/screenshot1.png -------------------------------------------------------------------------------- /library/cssjson.js: -------------------------------------------------------------------------------- 1 | /** 2 | * CSS-JSON Converter for JavaScript 3 | * Converts CSS to JSON and back. 4 | * Version 2.1 5 | * 6 | * Released under the MIT license. 7 | * 8 | * Copyright (c) 2013 Aram Kocharyan, http://aramk.com/ 9 | 10 | Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated 11 | documentation files (the "Software"), to deal in the Software without restriction, including without limitation 12 | the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and 13 | to permit persons to whom the Software is furnished to do so, subject to the following conditions: 14 | 15 | The above copyright notice and this permission notice shall be included in all copies or substantial portions 16 | of the Software. 17 | 18 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO 19 | THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 20 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, 21 | TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 22 | THE SOFTWARE. 23 | */ 24 | 25 | var CSSJSON = new function () { 26 | 27 | var base = this; 28 | 29 | base.init = function () { 30 | // String functions 31 | String.prototype.trim = function () { 32 | return this.replace(/^\s+|\s+$/g, ''); 33 | }; 34 | 35 | String.prototype.repeat = function (n) { 36 | return new Array(1 + n).join(this); 37 | }; 38 | }; 39 | base.init(); 40 | 41 | var selX = /([^\s\;\{\}][^\;\{\}]*)\{/g; 42 | var endX = /\}/g; 43 | var lineX = /([^\;\{\}]*)\;/g; 44 | //var commentX = /\/\*[\s\S]*?\*\//g; 45 | var lineAttrX = /([^\:]+):([^\;]*);/; 46 | 47 | // This is used, a concatenation of all above. We use alternation to 48 | // capture. 49 | var altX = /(\/\*[\s\S]*?\*\/)|([^\s\;\{\}][^\;\{\}]*(?=\{))|(\})|([^\;\{\}]+\;(?!\s*\*\/))/gmi; 50 | 51 | // Capture groups 52 | var capComment = 1; 53 | var capSelector = 2; 54 | var capEnd = 3; 55 | var capAttr = 4; 56 | 57 | var isEmpty = function (x) { 58 | return typeof x == 'undefined' || x.length == 0 || x == null; 59 | }; 60 | 61 | base.toJSON = function (cssString) { 62 | var node = { 63 | children: {}, 64 | attributes: {} 65 | }; 66 | var match = null; 67 | var count = 0; 68 | 69 | if (typeof args == 'undefined') { 70 | var args = { 71 | ordered: false, 72 | comments: false, 73 | stripComments: false, 74 | split: false 75 | }; 76 | } 77 | /*if (args.stripComments) { 78 | args.comments = false; 79 | cssString = cssString.replace(commentX, ''); 80 | }*/ 81 | 82 | while ((match = altX.exec(cssString)) != null) { 83 | if (!isEmpty(match[capComment]) && args.comments) { 84 | // Comment 85 | var add = match[capComment].trim(); 86 | node[count++] = add; 87 | } else if (!isEmpty(match[capSelector])) { 88 | // New node, we recurse 89 | var name = match[capSelector].trim(); 90 | // This will return when we encounter a closing brace 91 | var newNode = base.toJSON(cssString); 92 | if (args.ordered) { 93 | var obj = {}; 94 | obj['name'] = name; 95 | obj['value'] = newNode; 96 | // Since we must use key as index to keep order and not 97 | // name, this will differentiate between a Rule Node and an 98 | // Attribute, since both contain a name and value pair. 99 | obj['type'] = 'rule'; 100 | node[count++] = obj; 101 | } else { 102 | if (args.split) { 103 | var bits = name.split(','); 104 | } else { 105 | var bits = [name]; 106 | } 107 | for (i in bits) { 108 | var sel = bits[i].trim(); 109 | if (sel in node.children) { 110 | for (var att in newNode.attributes) { 111 | node.children[sel].attributes[att] = newNode.attributes[att]; 112 | } 113 | } else { 114 | node.children[sel] = newNode; 115 | } 116 | } 117 | } 118 | } else if (!isEmpty(match[capEnd])) { 119 | // Node has finished 120 | return node; 121 | } else if (!isEmpty(match[capAttr])) { 122 | var line = match[capAttr].trim(); 123 | var attr = lineAttrX.exec(line); 124 | if (attr) { 125 | // Attribute 126 | var name = attr[1].trim(); 127 | var value = attr[2].trim(); 128 | if (args.ordered) { 129 | var obj = {}; 130 | obj['name'] = name; 131 | obj['value'] = value; 132 | obj['type'] = 'attr'; 133 | node[count++] = obj; 134 | } else { 135 | if (name in node.attributes) { 136 | var currVal = node.attributes[name]; 137 | if (!(currVal instanceof Array)) { 138 | node.attributes[name] = [currVal]; 139 | } 140 | node.attributes[name].push(value); 141 | } else { 142 | node.attributes[name] = value; 143 | } 144 | } 145 | } else { 146 | // Semicolon terminated line 147 | node[count++] = line; 148 | } 149 | } 150 | } 151 | 152 | return node; 153 | }; 154 | 155 | base.toCSS = function (node, depth, breaks) { 156 | var cssString = ''; 157 | if (typeof depth == 'undefined') { 158 | depth = 0; 159 | } 160 | if (typeof breaks == 'undefined') { 161 | breaks = false; 162 | } 163 | if (node.attributes) { 164 | for (i in node.attributes) { 165 | var att = node.attributes[i]; 166 | if (att instanceof Array) { 167 | for (var j = 0; j < att.length; j++) { 168 | cssString += strAttr(i, att[j], depth); 169 | } 170 | } else { 171 | cssString += strAttr(i, att, depth); 172 | } 173 | } 174 | } 175 | if (node.children) { 176 | var first = true; 177 | for (i in node.children) { 178 | if (breaks && !first) { 179 | cssString += '\n'; 180 | } else { 181 | first = false; 182 | } 183 | cssString += strNode(i, node.children[i], depth); 184 | } 185 | } 186 | return cssString; 187 | }; 188 | 189 | // Helpers 190 | 191 | var strAttr = function (name, value, depth) { 192 | return '\t'.repeat(depth) + name + ': ' + value + ';\n'; 193 | }; 194 | 195 | var strNode = function (name, value, depth) { 196 | var cssString = '\t'.repeat(depth) + name + ' {\n'; 197 | cssString += base.toCSS(value, depth + 1); 198 | cssString += '\t'.repeat(depth) + '}\n'; 199 | return cssString; 200 | }; 201 | 202 | }; 203 | -------------------------------------------------------------------------------- /library/generator.js: -------------------------------------------------------------------------------- 1 | @import 'library/helpers.js' 2 | @import 'library/svg_shape_converter.js' 3 | @import 'library/cssjson.js' 4 | @import 'library/htmlparser.js' 5 | 6 | var DRAW_LINE = "l"; //used as default parameter when no found in path 7 | var START_PATH = "M"; 8 | var END_PATH = "Z"; 9 | var INDENT = " "; 10 | 11 | var pathsParsedCount = 0; 12 | var generatedOutput = ""; 13 | var lastFileName = ""; 14 | var lastFileData; 15 | var warnings = []; 16 | var error = null 17 | var includeVC = true; 18 | 19 | 20 | Generator = function(){ } 21 | 22 | Generator.prototype.generateVectorDrawableAsync = function(filePath, callback){ 23 | var svgAsString = NSString.stringWithContentsOfFile(filePath); 24 | var parsedVectorDrawable = parseFile(svgAsString); 25 | callback(error, parsedVectorDrawable); 26 | } 27 | 28 | Generator.prototype.generateVectorDrawable = function(filePath, includeVC){ 29 | this.includeVC = includeVC; 30 | var svgAsString = NSString.stringWithContentsOfFile(filePath); 31 | var parsedVectorDrawable = parseFile(svgAsString); 32 | return parsedVectorDrawable 33 | } 34 | 35 | //Main parse & convert logic 36 | function recursiveTreeWalk(parent, groupLevel) { 37 | for ( var i = 0; i < parent.children.length; i++ ) { 38 | var current = parent.children[i]; 39 | if (current["name"] == "g" && current.children.length > 0) { //Group tag, ignore empty groups 40 | var group = parseGroup(current); 41 | var ignoreGroup = group.isSet; 42 | if (ignoreGroup) printGroupStart(group, groupLevel); 43 | 44 | if (ignoreGroup) groupLevel++; 45 | recursiveTreeWalk(current, groupLevel); 46 | if (ignoreGroup) groupLevel--; 47 | 48 | if (ignoreGroup) printGroupEnd(groupLevel); 49 | } else if (current["name"] == "path") { 50 | var pathD = parsePathD(current); 51 | if (pathD != null) { 52 | printPath(pathD, getStyles(current, parent), groupLevel); 53 | } else { 54 | warnings.pushUnique("found path(s) without data (empty or invalid parameter d)"); 55 | } 56 | } else if (current["name"] == "line") { 57 | printPath(ShapeConverter.convertLine(current), getStyles(current, parent), groupLevel); 58 | } else if (current["name"] =="rect") { 59 | printPath(ShapeConverter.convertRect(current), getStyles(current, parent), groupLevel); 60 | } else if (current["name"] == "circle") { 61 | printPath(ShapeConverter.convertCircle(current), getStyles(current, parent), groupLevel); 62 | } else if (current["name"] == "ellipse") { 63 | printPath(ShapeConverter.convertEllipse(current), getStyles(current, parent), groupLevel); 64 | } else if (current["name"] == "polyline") { 65 | printPath(ShapeConverter.convertPolygon(current, true), getStyles(current, parent), groupLevel); 66 | } else if (current["name"] == "polygon") { 67 | printPath(ShapeConverter.convertPolygon(current, false), getStyles(current, parent), groupLevel); 68 | } else if (current["name"] == "text") { 69 | warnings.pushUnique("text element is not supported, export all text into path"); 70 | } 71 | }); 72 | } 73 | 74 | function getStyles(child, parent) { 75 | var styles = parseStyles(child); 76 | var parentStyles = (parent["name"] == "g") ? parseStyles(parent) : null; 77 | return [styles, parentStyles]; 78 | } 79 | 80 | function parseGroup(groupTag) { 81 | var transform = groupTag["attributes"]["transform"] 82 | var transformId = groupTag["attributes"]["id"] 83 | var groupTransform = {transformX: 0, transformY: 0, scaleX: 1, scaleY: 1, rotate:0, rotatePivotX:-1, rotatePivotY:-1, id:"", isSet:false}; 84 | if (transform !== null && typeof transform !== "undefined") { 85 | transform = transform.replace(/[()]/g , "*") 86 | var regex = /([\w|\s]+)\*([^\*]+)+/mg 87 | var result; 88 | while (result = regex.exec(transform)) { 89 | var split = result[2].split(/[,\s]+/); 90 | var transformName = result[1].trim(); 91 | if (transformName == "translate") { 92 | groupTransform.transformX = split[0]; 93 | groupTransform.transformY = split[1] || 0; 94 | groupTransform.isSet = true; 95 | } else if (transformName == "scale") { 96 | groupTransform.scaleX = split[0]; 97 | groupTransform.scaleY = split[1] || 0; 98 | groupTransform.isSet = true; 99 | } else if (transformName == "rotate") { 100 | groupTransform.rotate = split[0]; 101 | groupTransform.rotatePivotX = split[1] || -1; 102 | groupTransform.rotatePivotY = split[2] || -1; 103 | groupTransform.isSet = true; 104 | } else { 105 | warnings.pushUnique("group transform '" + transformName + "' is not supported, use option Bake transforms into path") 106 | } 107 | } 108 | } 109 | if (transformId !== null && typeof transformId !== "undefined") { 110 | groupTransform.id = transformId; 111 | } 112 | return groupTransform 113 | } 114 | 115 | function parsePathD(pathData) { 116 | var path = pathData["attributes"]["d"]; 117 | 118 | if (typeof path === "undefined") { 119 | return null; 120 | } 121 | 122 | path = path.replace(/\s{2,}/g, " "); //replace extra spaces 123 | 124 | if (path.match(/-?\d*\.?\d+e[+-]?\d+/g)) { 125 | warnings.pushUnique("found some numbers with scientific E notation in pathData which Android probably does not support. " + 126 | "Please fix It manually by editing your editor precision or manually by editing pathData"); 127 | } 128 | 129 | //Check path If contains draw otherwise use default l 130 | var pathStart = false, bigM = false, skipMove = false, stop = false; 131 | var pathRebuild = ""; 132 | path.split(" ").forEach(function (t) { 133 | if (stop) { 134 | pathRebuild += t + " "; 135 | return; 136 | } 137 | 138 | if (t.toUpperCase() == START_PATH) { 139 | pathStart = true; 140 | bigM = t == START_PATH; 141 | } else if (skipMove && pathStart) { 142 | if (!(t.indexOf(",") == -1 && isNaN(t))) { 143 | t = (bigM ? DRAW_LINE.toUpperCase() : DRAW_LINE) + " " + t; 144 | } 145 | stop = true; 146 | } else if (pathStart) { 147 | skipMove = true; 148 | } 149 | 150 | pathRebuild += t + " "; 151 | }); 152 | 153 | path = fixPathPositioning(pathRebuild); 154 | path = fixNumberFormatting(path); 155 | 156 | if (!path.endsWith(" ")) { 157 | path += " "; 158 | } 159 | 160 | return wordwrap(path.trim(), 80, "\n"); 161 | } 162 | 163 | 164 | function parseStyles(path) { 165 | //Convert attributes to style 166 | var attributes = path["attributes"]; 167 | var stylesArray = {}; 168 | for (var key in attributes) { 169 | if(attributes.hasOwnProperty(key)){ 170 | var name = key; 171 | var value = attributes[key]; 172 | if (name == "style") { 173 | //Fix CSSJSON bug 174 | if (!value.endsWith(";")) { 175 | value += ";" 176 | } 177 | var cssAttributes = CSSJSON.toJSON(value).attributes; 178 | for (var key in cssAttributes) { 179 | if (cssAttributes.hasOwnProperty(key)) { 180 | stylesArray[key] = cssAttributes[key]; 181 | 182 | if ((key == "fill" || key == "stroke") && cssAttributes[key].startsWith("url")) { 183 | warnings.pushUnique("found fill(s) or stroke(s) which uses url() (gradients and patterns are not supported in Android)"); 184 | } 185 | } 186 | } 187 | } else { 188 | stylesArray[name] = value; 189 | } 190 | } 191 | } 192 | 193 | return stylesArray; 194 | } 195 | 196 | function printGroupStart(groupTransform, groupLevel) { 197 | generatedOutput += INDENT.repeat(groupLevel + 1) + '\n'; 215 | } 216 | 217 | function printPath(pathData, stylesArray, groupLevel) { 218 | var styles = stylesArray[0]; 219 | var parentGroupStyles = stylesArray[1]; 220 | 221 | if (pathData == null) { 222 | return; 223 | } 224 | 225 | if (styles.hasOwnProperty("transform")) { 226 | warnings.pushUnique("transforms on path are not supported, use option Bake transforms into path") 227 | } 228 | 229 | if (parentGroupStyles != null) { 230 | //Inherit styles from group first 231 | for (var styleName in parentGroupStyles) { 232 | if (typeof styles[styleName] === "undefined") { 233 | styles[styleName] = parentGroupStyles[styleName]; 234 | } 235 | } 236 | } 237 | //Parent opacity setting - multiply fill-opacity and stroke-opacity 238 | var opacity = styles["opacity"]; 239 | if (typeof opacity !== "undefined") { 240 | if (typeof styles["fill-opacity"] !== "undefined") { 241 | styles["fill-opacity"] *= opacity; 242 | } else { 243 | styles["fill-opacity"] = opacity; 244 | } 245 | if (typeof styles["stroke-opacity"] !== "undefined") { 246 | styles["stroke-opacity"] *= opacity; 247 | } else { 248 | styles["stroke-opacity"] = opacity; 249 | } 250 | } 251 | 252 | //If fill is omitted use default black 253 | if (typeof styles["fill"] === "undefined") { 254 | styles["fill"] = "#000000"; 255 | } 256 | 257 | 258 | generatedOutput += INDENT.repeat(groupLevel + 1) + ')/,""); 292 | var xml = HTMLtoXML(xmlStripped); 293 | } catch (e) { 294 | setMessage("Error: not valid SVG file.", "alert-danger"); 295 | return null; 296 | } 297 | 298 | //Reset previous 299 | pathsParsedCount = 0; 300 | warnings = []; 301 | 302 | var svg = xml; 303 | 304 | //Parse dimensions 305 | var dimensions = getDimensions(svg); 306 | var width = dimensions.width; 307 | var height = dimensions.height; 308 | 309 | //XML Vector start 310 | generatedOutput = '\n'; 311 | generatedOutput += '\n\n'.f(height); 320 | } else { 321 | generatedOutput += INDENT + '>\n\n'; 322 | } 323 | 324 | //XML Vector content 325 | //Iterate through groups and paths 326 | recursiveTreeWalk(svg, 0); 327 | 328 | //XML Vector end 329 | generatedOutput += ''; 330 | 331 | //SVG must contain path(s) 332 | if (pathsParsedCount == 0) { 333 | setMessage("No shape elements found in svg.", "alert-danger"); 334 | } 335 | 336 | if (warnings.length == 1) { 337 | setMessage("Warning: " + warnings[0], "alert-warning") 338 | } else if (warnings.length > 1) { 339 | var warnText = ""; 340 | warnings.forEach(function (w, i) { 341 | warnText += "Warning #" + (i + 1) + ":" + w + ""; 342 | }); 343 | setMessage("" + warnText + "
", "alert-warning") 344 | } 345 | 346 | return generatedOutput; 347 | } 348 | 349 | function fixPathPositioning(path) { 350 | return path.replace(/^\s*m/, START_PATH).replace(/^\s*z/, END_PATH); 351 | } 352 | 353 | function fixNumberFormatting(path) { 354 | var regex = new RegExp(/([1-9][0-9]*\.?[0-9]*|\.[0-9]+)([e][+-]?[0-9]*[0-9]+?)/g); 355 | path = path.replace(regex, "0") 356 | return path.replace(/(\.\d+)(\.\d+)\s?/g, "\$1 \$2 "); 357 | } 358 | 359 | function getDimensions(svg) { 360 | var widthAttr = svg.attributes["width"]; 361 | var heightAttr = svg.attributes["height"]; 362 | var viewBoxAttr = svg.attributes["viewBox"]; 363 | 364 | if (typeof viewBoxAttr === "undefined") { 365 | if (typeof widthAttr === "undefined" || typeof heightAttr === "undefined") { 366 | warnings.pushUnique("width or height not set for svg (set -1)"); 367 | return {width: -1, height: -1}; 368 | } else { 369 | return {width: convertDimensionToPx(widthAttr), height: convertDimensionToPx(heightAttr)}; 370 | } 371 | } else { 372 | var viewBoxAttrParts = viewBoxAttr.split(/[,\s]+/); 373 | if (viewBoxAttrParts[0] > 0 || viewBoxAttrParts[1] > 0) { 374 | warnings.pushUnique("viewbox minx/miny is other than 0 (not supported)"); 375 | } 376 | return {width: viewBoxAttrParts[2], height: viewBoxAttrParts[3]}; 377 | } 378 | 379 | } 380 | 381 | function removeNonNumeric(input) { 382 | if (typeof input === "undefined") return input; 383 | return input.replace(/[^0-9.]/g, ""); 384 | } 385 | 386 | 387 | function generateAttr(name, val, groupLevel, def, end) { 388 | if (typeof val === "undefined" || val == def) return ""; 389 | return INDENT.repeat(groupLevel + 2) + 'android:{0}="{1}"{2}\n'.f(name, val, end ? ' />' : ''); 390 | } 391 | 392 | function generateCompatAttr(name, val, groupLevel, def, end) { 393 | if (typeof val === "undefined" || val == def) return ""; 394 | return INDENT.repeat(groupLevel + 2) + 'app:{0}="{1}"{2}\n'.f(name, val, end ? ' />' : ''); 395 | } 396 | 397 | function wordwrap(str, width, brk, cut) { 398 | brk = brk || '\n'; 399 | width = width || 75; 400 | cut = cut || false; 401 | 402 | if (!str) { 403 | return str; 404 | } 405 | 406 | var regex = '.{1,' + width + '}(\\s|$)' + (cut ? '|.{' + width + '}|.+$' : '|\\S+?(\\s|$)'); 407 | 408 | var matches = str.match(new RegExp(regex, 'g')); 409 | // trim off leading/trailing spaces from the matched strings 410 | for (i = 0; i < matches.length; i++) { 411 | matches[i] = matches[i].trim(); 412 | } 413 | 414 | return matches.join(brk); 415 | } 416 | 417 | //Parse rgb, named colors to hex 418 | function parseColorToHex(color) { 419 | if (typeof color === "undefined") return color; 420 | color = color.replace(/\s/g, ""); 421 | 422 | //Is hex already 423 | if (color.substr(0, 1) === "#") { 424 | return color; 425 | } else { 426 | if (color.startsWith("rgb(")) { 427 | var match = /rgb\(\s*(\d{1,3})\s*,\s*(\d{1,3})\s*,\s*(\d{1,3})\s*\)$/.exec(color); 428 | return match !== null && match.length >= 4 ? rgb2hex(parseInt(match[1]), parseInt(match[2]), parseInt(match[3])) : color; 429 | } else { 430 | var hexClr = name2hex(color); 431 | return !hexClr.startsWith("Invalid") ? hexClr : color; 432 | } 433 | } 434 | } 435 | 436 | function componentToHex(c) { 437 | var hex = c.toString(16); 438 | return hex.length == 1 ? "0" + hex : hex; 439 | } 440 | 441 | function rgbToHex(r, g, b) { 442 | return "#" + componentToHex(r) + componentToHex(g) + componentToHex(b); 443 | } 444 | 445 | 446 | function convertDimensionToPx(dimen) { 447 | var val = removeNonNumeric(dimen); 448 | var METER_TO_PX = 3543.30709; 449 | var INCH_TO_PX = 90; 450 | var PT_TO_PX = 1.25; 451 | var PC_TO_PX = 15; 452 | var FT_TO_PX = 1080; 453 | 454 | if (dimen.endsWith("mm")) { 455 | return val * (METER_TO_PX / 1000); 456 | } else if (dimen.endsWith("cm")) { 457 | return val * (METER_TO_PX / 100); 458 | } else if (dimen.endsWith("m")) { 459 | return val * METER_TO_PX; 460 | } else if (dimen.endsWith("in")) { 461 | return val * INCH_TO_PX; 462 | } else if (dimen.endsWith("pt")) { 463 | return val * PT_TO_PX; 464 | } else if (dimen.endsWith("pc")) { 465 | return val * PC_TO_PX; 466 | } else if (dimen.endsWith("ft")) { 467 | return val * FT_TO_PX; 468 | } else { 469 | return val; 470 | } 471 | } 472 | 473 | function setMessage(text, type) { 474 | error = text + " " + type 475 | } 476 | 477 | function name2hex(n) { 478 | n = n.toLowerCase(); 479 | var nar = { 480 | "aliceblue": "#f0f8ff", 481 | "antiquewhite": "#faebd7", 482 | "aqua": "#00ffff", 483 | "aquamarine": "#7fffd4", 484 | "azure": "#f0ffff", 485 | "beige": "#f5f5dc", 486 | "bisque": "#ffe4c4", 487 | "black": "#000000", 488 | "blanchedalmond": "#ffebcd", 489 | "blue": "#0000ff", 490 | "blueviolet": "#8a2be2", 491 | "brown": "#a52a2a", 492 | "burlywood": "#deb887", 493 | "cadetblue": "#5f9ea0", 494 | "chartreuse": "#7fff00", 495 | "chocolate": "#d2691e", 496 | "coral": "#ff7f50", 497 | "cornflowerblue": "#6495ed", 498 | "cornsilk": "#fff8dc", 499 | "crimson": "#dc143c", 500 | "cyan": "#00ffff", 501 | "darkblue": "#00008b", 502 | "darkcyan": "#008b8b", 503 | "darkgoldenrod": "#b8860b", 504 | "darkgray": "#a9a9a9", 505 | "darkgrey": "#a9a9a9", 506 | "darkgreen": "#006400", 507 | "darkkhaki": "#bdb76b", 508 | "darkmagenta": "#8b008b", 509 | "darkolivegreen": "#556b2f", 510 | "darkorange": "#ff8c00", 511 | "darkorchid": "#9932cc", 512 | "darkred": "#8b0000", 513 | "darksalmon": "#e9967a", 514 | "darkseagreen": "#8fbc8f", 515 | "darkslateblue": "#483d8b", 516 | "darkslategray": "#2f4f4f", 517 | "darkslategrey": "#2f4f4f", 518 | "darkturquoise": "#00ced1", 519 | "darkviolet": "#9400d3", 520 | "deeppink": "#ff1493", 521 | "deepskyblue": "#00bfff", 522 | "dimgray": "#696969", 523 | "dimgrey": "#696969", 524 | "dodgerblue": "#1e90ff", 525 | "firebrick": "#b22222", 526 | "floralwhite": "#fffaf0", 527 | "forestgreen": "#228b22", 528 | "fuchsia": "#ff00ff", 529 | "gainsboro": "#dcdcdc", 530 | "ghostwhite": "#f8f8ff", 531 | "gold": "#ffd700", 532 | "goldenrod": "#daa520", 533 | "gray": "#808080", 534 | "grey": "#808080", 535 | "green": "#008000", 536 | "greenyellow": "#adff2f", 537 | "honeydew": "#f0fff0", 538 | "hotpink": "#ff69b4", 539 | "indianred": "#cd5c5c", 540 | "indigo": "#4b0082", 541 | "ivory": "#fffff0", 542 | "khaki": "#f0e68c", 543 | "lavender": "#e6e6fa", 544 | "lavenderblush": "#fff0f5", 545 | "lawngreen": "#7cfc00", 546 | "lemonchiffon": "#fffacd", 547 | "lightblue": "#add8e6", 548 | "lightcoral": "#f08080", 549 | "lightcyan": "#e0ffff", 550 | "lightgoldenrodyellow": "#fafad2", 551 | "lightgray": "#d3d3d3", 552 | "lightgrey": "#d3d3d3", 553 | "lightgreen": "#90ee90", 554 | "lightpink": "#ffb6c1", 555 | "lightsalmon": "#ffa07a", 556 | "lightseagreen": "#20b2aa", 557 | "lightskyblue": "#87cefa", 558 | "lightslategray": "#778899", 559 | "lightslategrey": "#778899", 560 | "lightsteelblue": "#b0c4de", 561 | "lightyellow": "#ffffe0", 562 | "lime": "#00ff00", 563 | "limegreen": "#32cd32", 564 | "linen": "#faf0e6", 565 | "magenta": "#ff00ff", 566 | "maroon": "#800000", 567 | "mediumaquamarine": "#66cdaa", 568 | "mediumblue": "#0000cd", 569 | "mediumorchid": "#ba55d3", 570 | "mediumpurple": "#9370d8", 571 | "mediumseagreen": "#3cb371", 572 | "mediumslateblue": "#7b68ee", 573 | "mediumspringgreen": "#00fa9a", 574 | "mediumturquoise": "#48d1cc", 575 | "mediumvioletred": "#c71585", 576 | "midnightblue": "#191970", 577 | "mintcream": "#f5fffa", 578 | "mistyrose": "#ffe4e1", 579 | "moccasin": "#ffe4b5", 580 | "navajowhite": "#ffdead", 581 | "navy": "#000080", 582 | "oldlace": "#fdf5e6", 583 | "olive": "#808000", 584 | "olivedrab": "#6b8e23", 585 | "orange": "#ffa500", 586 | "orangered": "#ff4500", 587 | "orchid": "#da70d6", 588 | "palegoldenrod": "#eee8aa", 589 | "palegreen": "#98fb98", 590 | "paleturquoise": "#afeeee", 591 | "palevioletred": "#d87093", 592 | "papayawhip": "#ffefd5", 593 | "peachpuff": "#ffdab9", 594 | "peru": "#cd853f", 595 | "pink": "#ffc0cb", 596 | "plum": "#dda0dd", 597 | "powderblue": "#b0e0e6", 598 | "purple": "#800080", 599 | "red": "#ff0000", 600 | "rosybrown": "#bc8f8f", 601 | "royalblue": "#4169e1", 602 | "saddlebrown": "#8b4513", 603 | "salmon": "#fa8072", 604 | "sandybrown": "#f4a460", 605 | "seagreen": "#2e8b57", 606 | "seashell": "#fff5ee", 607 | "sienna": "#a0522d", 608 | "silver": "#c0c0c0", 609 | "skyblue": "#87ceeb", 610 | "slateblue": "#6a5acd", 611 | "slategray": "#708090", 612 | "slategrey": "#708090", 613 | "snow": "#fffafa", 614 | "springgreen": "#00ff7f", 615 | "steelblue": "#4682b4", 616 | "tan": "#d2b48c", 617 | "teal": "#008080", 618 | "thistle": "#d8bfd8", 619 | "tomato": "#ff6347", 620 | "turquoise": "#40e0d0", 621 | "violet": "#ee82ee", 622 | "wheat": "#f5deb3", 623 | "white": "#ffffff", 624 | "whitesmoke": "#f5f5f5", 625 | "yellow": "#ffff00", 626 | "yellowgreen": "#9acd32" 627 | }; 628 | r = nar[n]; 629 | if (r === undefined) { 630 | return "#000000"; 631 | } 632 | return r; 633 | }; 634 | -------------------------------------------------------------------------------- /library/helpers.js: -------------------------------------------------------------------------------- 1 | /* Helper methods */ 2 | String.prototype.f = function () { 3 | var s = this, 4 | i = arguments.length; 5 | 6 | while (i--) { 7 | s = s.replace(new RegExp('\\{' + i + '\\}', 'gm'), arguments[i]); 8 | } 9 | return s; 10 | }; 11 | 12 | Array.prototype.pushUnique = function (item) { 13 | if (this.indexOf(item) == -1) { 14 | this.push(item); 15 | return true; 16 | } 17 | return false; 18 | }; 19 | 20 | String.prototype.repeat = function (num) { 21 | return new Array(num + 1).join(this); 22 | }; 23 | 24 | function toBool(s, defValue) { 25 | if (typeof s === "undefined") { 26 | return typeof defValue !== "undefined" ? defValue : false; 27 | } 28 | return "false" !== s; 29 | } 30 | 31 | if (typeof String.prototype.endsWith !== 'function') { 32 | String.prototype.endsWith = function (suffix) { 33 | return this.indexOf(suffix, this.length - suffix.length) !== -1; 34 | }; 35 | } 36 | 37 | if (typeof String.prototype.startsWith !== 'function') { 38 | String.prototype.startsWith = function (str) { 39 | return this.indexOf(str) == 0; 40 | }; 41 | } 42 | -------------------------------------------------------------------------------- /library/htmlparser.js: -------------------------------------------------------------------------------- 1 | (function(){ 2 | 3 | // Regular Expressions for parsing tags and attributes 4 | var startTag = /^<([-A-Za-z0-9_]+)((?:\s+[\w:-]+(?:\s*=\s*(?:(?:\x22[^\x22]*\x22)|[^>\s]+))?)*)\s*(\/?)>/; 5 | //var startTag = /^(<([^>]+)>)/ 6 | var endTag = /^<\/([-A-Za-z0-9_]+)[^>]*>/; 7 | var attr = /([-A-Za-z0-9_:-]+)(?:\s*=\s*(?:(?:\x22((?:\\.|[^\x22])*)\x22)|(?:\x27((?:\\.|[^\x27])*)\x27)|([^>\s]+)))?/g; 8 | 9 | // Empty Elements - HTML 4.01 10 | var empty = makeMap("area,base,basefont,br,col,frame,hr,img,input,isindex,link,meta,param,embed"); 11 | 12 | // Block Elements - HTML 4.01 13 | var block = makeMap("address,applet,blockquote,button,center,dd,del,dir,div,dl,dt,fieldset,form,frameset,hr,iframe,ins,isindex,li,map,menu,noframes,noscript,object,ol,p,pre,script,table,tbody,td,tfoot,th,thead,tr,ul"); 14 | 15 | // Inline Elements - HTML 4.01 16 | var inline = makeMap("a,abbr,acronym,applet,b,basefont,bdo,big,br,button,cite,code,del,dfn,em,font,i,iframe,img,input,ins,kbd,label,map,object,q,s,samp,script,select,small,span,strike,strong,sub,sup,textarea,tt,u,var"); 17 | 18 | // Elements that you can, intentionally, leave open 19 | // (and which close themselves) 20 | var closeSelf = makeMap("colgroup,dd,dt,li,options,p,td,tfoot,th,thead,tr"); 21 | 22 | // Attributes that have their values filled in disabled="disabled" 23 | var fillAttrs = makeMap("checked,compact,declare,defer,disabled,ismap,multiple,nohref,noresize,noshade,nowrap,readonly,selected"); 24 | 25 | // Special Elements (can contain anything) 26 | var special = makeMap("script,style"); 27 | 28 | var HTMLParser = this.HTMLParser = function( html, handler ) { 29 | var index, chars, match, stack = [], last = html; 30 | stack.last = function(){ 31 | return this[ this.length - 1 ]; 32 | }; 33 | 34 | while ( html ) { 35 | chars = true; 36 | 37 | // Make sure we're not in a script or style element 38 | if ( !stack.last() || !special[ stack.last() ] ) { 39 | // Comment 40 | if ( html.indexOf(""); 42 | 43 | if ( index >= 0 ) { 44 | if ( handler.comment ) { 45 | handler.comment( html.substring( 4, index ) ); 46 | } 47 | html = html.substring( index + 3 ); 48 | chars = false; 49 | } 50 | 51 | // end tag 52 | } else if ( html.indexOf("]*>"), function(all, text){ 84 | text = text.replace(//g, "$1") 85 | .replace(//g, "$1"); 86 | 87 | if ( handler.chars ) 88 | handler.chars( text ); 89 | 90 | return ""; 91 | }); 92 | 93 | parseEndTag( "", stack.last() ); 94 | } 95 | 96 | if ( html == last ) 97 | throw "Parse Error: " + html; 98 | last = html; 99 | } 100 | 101 | // Clean up any remaining tags 102 | parseEndTag(); 103 | 104 | function parseStartTag( tag, tagName, rest, unary ) { 105 | tagName = tagName.toLowerCase(); 106 | if ( block[ tagName ] ) { 107 | while ( stack.last() && inline[ stack.last() ] ) { 108 | parseEndTag( "", stack.last() ); 109 | } 110 | } 111 | 112 | if ( closeSelf[ tagName ] && stack.last() == tagName ) { 113 | parseEndTag( "", tagName ); 114 | } 115 | 116 | unary = empty[ tagName ] || !!unary; 117 | 118 | if ( !unary ) 119 | stack.push( tagName ); 120 | 121 | if ( handler.start ) { 122 | var attrs = []; 123 | rest.replace(attr, function(match, name) { 124 | var value = arguments[2] ? arguments[2] : 125 | arguments[3] ? arguments[3] : 126 | arguments[4] ? arguments[4] : 127 | fillAttrs[name] ? name : ""; 128 | 129 | attrs.push({ 130 | name: name, 131 | value: value, 132 | escaped: value.replace("/(^|[^\\])\"/g", "$1\"") 133 | }); 134 | }); 135 | 136 | if ( handler.start ) 137 | handler.start( tagName, attrs, unary ); 138 | } 139 | } 140 | 141 | function parseEndTag( tag, tagName ) { 142 | // If no tag name is provided, clean shop 143 | if ( !tagName ) 144 | var pos = 0; 145 | 146 | // Find the closest opened tag of the same type 147 | else 148 | for ( var pos = stack.length - 1; pos >= 0; pos-- ) 149 | if ( stack[ pos ] == tagName ) 150 | break; 151 | 152 | if ( pos >= 0 ) { 153 | // Close all the open elements, up the stack 154 | for ( var i = stack.length - 1; i >= pos; i-- ) 155 | if ( handler.end ) 156 | handler.end( stack[ i ] ); 157 | 158 | // Remove the open elements from the stack 159 | stack.length = pos; 160 | } 161 | } 162 | }; 163 | 164 | this.HTMLtoXML = function( html ) { 165 | var results = ""; 166 | var stack = []; 167 | HTMLParser(html, { 168 | start: function( tag, attrs, unary ) { 169 | var tagObj = {}; 170 | tagObj["name"] = tag 171 | tagObj["attributes"] = {}; 172 | tagObj["children"] = []; 173 | 174 | results += "<" + tag; 175 | 176 | for ( var i = 0; i < attrs.length; i++ ) { 177 | tagObj["attributes"][attrs[i].name] = attrs[i].escaped 178 | results += " " + attrs[i].name + '="' + attrs[i].escaped + '"'; 179 | } 180 | 181 | stack.push(tagObj) 182 | 183 | results += (unary ? "/" : "") + ">"; 184 | }, 185 | end: function( tag ) { 186 | var top = stack.pop() 187 | if(stack.length > 0){ 188 | var parent = stack.pop() 189 | parent.children.push(top) 190 | stack.push(parent) 191 | } else { 192 | stack.push(top) 193 | } 194 | }, 195 | chars: function( text ) { 196 | results += text; 197 | }, 198 | comment: function( text ) { 199 | results += ""; 200 | } 201 | }); 202 | 203 | return stack.pop(); 204 | }; 205 | 206 | 207 | function makeMap(str){ 208 | var obj = {}, items = str.split(","); 209 | for ( var i = 0; i < items.length; i++ ) 210 | obj[ items[i] ] = true; 211 | return obj; 212 | } 213 | })(); 214 | -------------------------------------------------------------------------------- /library/main.js: -------------------------------------------------------------------------------- 1 | @import 'library/general.js' 2 | @import 'library/messages.js' 3 | @import 'library/sandbox.js' 4 | @import 'library/generator.js' 5 | 6 | main = { 7 | baseDir: '', 8 | layerVisibility: [], 9 | 10 | 11 | export: function(includeVC) { 12 | this.baseDir = this.getDirFromPrompt(); 13 | 14 | if (this.baseDir == null) { 15 | this.alert("Yikes, you gotta select a directory to export to."); 16 | return; 17 | } 18 | 19 | // If nothing is selected tell the user so 20 | if ([selection count] == 0) { 21 | this.alert("Whoooa there partner! No layer(s) selected."); 22 | return; 23 | } 24 | 25 | // Hide all layers except the ones we are slicing 26 | for (var i = 0; i < [selection count]; i++) { 27 | var layer = [selection objectAtIndex:i]; 28 | // Make sure we don't get errors if no artboard exists. 29 | // currentPage inerits from MSLayerGroup so it's basicly the same as an artboard 30 | var artboard = [layer parentArtboard] ? [layer parentArtboard] : [doc currentPage]; 31 | this.layerVisibility = []; 32 | 33 | [artboard deselectAllLayers]; 34 | 35 | var layerArray = [layer]; 36 | [artboard selectLayers:layerArray]; 37 | 38 | var root = artboard; 39 | 40 | this.hideLayers(root, layer); 41 | 42 | // Process the slice 43 | success = this.processSlice(layer, includeVC); 44 | 45 | // Restore layers visibility 46 | for (var m = 0; m < this.layerVisibility.length; m++) { 47 | var dict = this.layerVisibility[m]; 48 | var layer = [dict objectForKey:"layer"]; 49 | var visibility = [dict objectForKey:"visible"]; 50 | 51 | if (visibility == 0) { 52 | [layer setIsVisible:false]; 53 | } else { 54 | [layer setIsVisible:true]; 55 | } 56 | } 57 | 58 | // Restore selection 59 | [artboard selectLayers:selection]; 60 | 61 | if (success === false) 62 | return; 63 | } 64 | 65 | // Open finder window with assets exported 66 | this.openInFinder(this.baseDir + "/" + "android_assets/res"); 67 | }, 68 | 69 | // Return current working directory 70 | // This works better for the designer's workflow, as they mostly want to 71 | // save assets in the current directory 72 | getCwd: function() { 73 | var fileUrl = [doc fileURL], 74 | filePath = [fileUrl path], 75 | baseDir = filePath.split([doc displayName])[0]; 76 | return baseDir; 77 | }, 78 | 79 | // Let the user specify a directory 80 | getDirFromPrompt: function() { 81 | var panel = [NSOpenPanel openPanel]; 82 | [panel setMessage:"Where do you want to place your assets?"]; 83 | [panel setCanChooseDirectories: true]; 84 | [panel setCanChooseFiles: false]; 85 | [panel setCanCreateDirectories: true]; 86 | var defaultDir = [[doc fileURL] URLByDeletingLastPathComponent]; 87 | [panel setDirectoryURL:defaultDir]; 88 | if ([panel runModal] == NSOKButton) { 89 | var message = [panel filename]; 90 | return message; 91 | } 92 | }, 93 | 94 | processSlice: function(slice, includeVC) { 95 | var sliceName = [slice name].trim().toLowerCase().replace(/\s/,'_').replace(/-+/g,'_').replace(/[^0-9a-z_]/,''); 96 | var version = this.copyLayerWithFactor(slice, 1.0); 97 | var absoluteSVGFileName = this.baseDir + "/" + "android_assets/res" + "/drawable/." + sliceName + ".svg"; 98 | var absoluteAndroidFileName = this.baseDir + "/" + "android_assets/res" + "/drawable/" + sliceName + ".xml"; 99 | 100 | [doc saveArtboardOrSlice:version toFile:absoluteSVGFileName]; 101 | 102 | var vectorDrawable = new Generator(includeVC).generateVectorDrawable(absoluteSVGFileName); 103 | var ok = this.writeTextToFile(vectorDrawable, absoluteAndroidFileName); 104 | if (ok === false) { 105 | this.alert("Bummers, something went wrong trying to create the Android VectorDrawable"); 106 | return false; 107 | } else { 108 | return true; 109 | } 110 | var error = null 111 | log([[NSFileManager defaultManager] removeItemAtPath:absoluteSVGFileName error:null]); 112 | log(error) 113 | }, 114 | 115 | copyLayerWithFactor: function(originalSlice, factor) { 116 | var copy = [originalSlice duplicate], 117 | frame = [copy frame], 118 | rect = [[copy absoluteRect] rect]; 119 | slice = [MSExportRequest requestWithRect:rect scale:factor]; 120 | 121 | [copy removeFromParent]; 122 | 123 | return slice; 124 | }, 125 | 126 | // I used this code from https://github.com/nickstamas/Sketch-Better-Android-Export 127 | // and has been written by Nick Stamas 128 | // Cheers to him :) 129 | // Addapted it a bit for my plugin 130 | hideLayers: function(root, target) { 131 | // Hide all layers except for selected and store visibility 132 | for (var k = 0; k < [[root layers] count]; k++) { 133 | var currentLayer = [[root layers] objectAtIndex:k]; 134 | if ([currentLayer containsSelectedItem] && currentLayer != target) { 135 | this.hideLayers(currentLayer, target); 136 | } else if (!(currentLayer == target)) { 137 | var dict = [[NSMutableDictionary alloc] init]; 138 | [dict addObject:currentLayer forKey:"layer"]; 139 | [dict addObject:[currentLayer isVisible] forKey:"visible"]; 140 | 141 | this.layerVisibility.push(dict); 142 | [currentLayer setIsVisible: false]; 143 | } 144 | } 145 | }, 146 | 147 | writeTextToFile: function(text, path) { 148 | var result = false; 149 | if (typeof path !== 'string') 150 | return result; 151 | var nsstring = NSString.stringWithUTF8String(text); 152 | var error = null; 153 | log(path) 154 | result = [nsstring writeToFile:path atomically:1 encoding:NSUTF8StringEncoding error:error]; 155 | if (!result) { 156 | result = false; 157 | } else { 158 | result = true; 159 | } 160 | 161 | return result; 162 | }, 163 | 164 | alert: function(message) { 165 | var app = [NSApplication sharedApplication]; 166 | [app displayDialog:message]; 167 | }, 168 | 169 | openInFinder: function(path) { 170 | var finderTask = [[NSTask alloc] init], 171 | openFinderArgs = [NSArray arrayWithObjects:"-R", path, nil]; 172 | 173 | [finderTask setLaunchPath:"/usr/bin/open"]; 174 | [finderTask setArguments:openFinderArgs]; 175 | [finderTask launch]; 176 | } 177 | 178 | } 179 | -------------------------------------------------------------------------------- /library/sandbox.js: -------------------------------------------------------------------------------- 1 | var environ = [[NSProcessInfo processInfo] environment], 2 | in_sandbox= (nil != [environ objectForKey:"APP_SANDBOX_CONTAINER_ID"]) 3 | 4 | if (in_sandbox) { 5 | print("We’re sandboxed") 6 | } 7 | 8 | AppSandbox = function(){ } 9 | AppSandbox.prototype.authorize = function(path, callback){ 10 | log("AppSandbox.authorize("+path+")") 11 | var success = false 12 | 13 | if (in_sandbox) { 14 | var url = [[[NSURL fileURLWithPath:path] URLByStandardizingPath] URLByResolvingSymlinksInPath], 15 | allowedUrl = false, 16 | // Key for bookmark data: 17 | bd_key = this.key_for_url(url); 18 | 19 | this.clear_key(bd_key); // For debug only, this clears the key we're looking for :P 20 | 21 | // Bookmark 22 | var bookmark = this.get_data_for_key(bd_key) 23 | if (!bookmark) { 24 | var target = this.file_picker(url) 25 | bookmark = [target bookmarkDataWithOptions:NSURLBookmarkCreationWithSecurityScope 26 | includingResourceValuesForKeys:nil 27 | relativeToURL:nil 28 | error:{}] 29 | // Store bookmark 30 | this.set_data_for_key(bookmark,bd_key) 31 | } 32 | 33 | // Thanks to @joethephish for this pointer (pun totally intended) 34 | var bookmarkDataIsStalePtr = MOPointer.alloc().init(), 35 | allowedURL = [NSURL URLByResolvingBookmarkData:bookmark 36 | options:NSURLBookmarkResolutionWithSecurityScope 37 | relativeToURL:nil 38 | bookmarkDataIsStale:bookmarkDataIsStalePtr 39 | error:{}]; 40 | 41 | if (bookmarkDataIsStalePtr.value() != 0) { 42 | 43 | } 44 | 45 | if (allowedURL) { 46 | success = true 47 | } 48 | } else { 49 | success = true 50 | } 51 | 52 | // [allowedUrl startAccessingSecurityScopedResource] 53 | callback.call(this, success) 54 | // [allowedUrl stopAccessingSecurityScopedResource] 55 | } 56 | 57 | AppSandbox.prototype.key_for_url = function(url){ 58 | return "bd_" + [url absoluteString] 59 | } 60 | AppSandbox.prototype.clear_key = function(key){ 61 | var def = [NSUserDefaults standardUserDefaults]; 62 | [def setObject:nil forKey:key]; 63 | } 64 | AppSandbox.prototype.file_picker = function(url){ 65 | // Panel 66 | var openPanel = [NSOpenPanel openPanel] 67 | 68 | [openPanel setTitle:"Sketch Authorization"] 69 | [openPanel setMessage:"Due to Apple's Sandboxing technology, Sketch needs your permission to write to this folder."]; 70 | [openPanel setPrompt:"Authorize"]; 71 | 72 | [openPanel setCanCreateDirectories:false] 73 | [openPanel setCanChooseFiles:true] 74 | [openPanel setCanChooseDirectories:true] 75 | [openPanel setAllowsMultipleSelection:false] 76 | [openPanel setShowsHiddenFiles:false] 77 | [openPanel setExtensionHidden:false] 78 | 79 | [openPanel setDirectoryURL:url] 80 | 81 | var openPanelButtonPressed = [openPanel runModal] 82 | if (openPanelButtonPressed == NSFileHandlingPanelOKButton) { 83 | allowedUrl = [openPanel URL] 84 | } 85 | return allowedUrl 86 | } 87 | 88 | AppSandbox.prototype.get_data_for_key = function(key){ 89 | var def = [NSUserDefaults standardUserDefaults]; 90 | return [def objectForKey:key]; 91 | } 92 | AppSandbox.prototype.set_data_for_key = function(data,key){ 93 | var defaults = [NSUserDefaults standardUserDefaults], 94 | default_values = [NSMutableDictionary dictionary]; 95 | 96 | [default_values setObject:data forKey:key]; 97 | [defaults registerDefaults:default_values]; 98 | } 99 | -------------------------------------------------------------------------------- /library/svg_shape_converter.js: -------------------------------------------------------------------------------- 1 | // Based on 2 | // https://github.com/JFXtras/jfxtras-labs/blob/2.2/src/main/java/jfxtras/labs/util/ShapeConverter.java 3 | 4 | var ShapeConverter = new function () { 5 | var KAPPA = 0.5522847498307935; 6 | 7 | function s(number) { 8 | return (parseFloat(number.toPrecision(12))); 9 | } 10 | 11 | this.convertLine = function (lineTag) { 12 | var x1 = lineTag["attributes"]["x1"]; 13 | var x2 = lineTag["attributes"]["x2"]; 14 | var y1 = lineTag["attributes"]["y1"]; 15 | var y2 = lineTag["attributes"]["y2"]; 16 | 17 | return "M " + x1 + " " + y1 + " " + "L " + x2 + " " + y2; 18 | }; 19 | 20 | this.convertRect = function (rectTag) { 21 | var x = parseFloat(rectTag["attributes"]["x"] || 0); 22 | var y = parseFloat(rectTag["attributes"]["y"] || 0); 23 | var w = parseFloat(rectTag["attributes"]["width"] || 0); 24 | var h = parseFloat(rectTag["attributes"]["height"] || 0); 25 | var rx = parseFloat(rectTag["attributes"]["rx"] || 0); 26 | var ry = parseFloat(rectTag["attributes"]["ry"] || 0); 27 | var r = s(x + w); 28 | var b = s(y + h); 29 | 30 | if (ry == 0) { 31 | ry = rx; 32 | } else if (rx == 0) { 33 | rx = ry; 34 | } 35 | 36 | if (rx == 0 && ry == 0) { 37 | return "M " + x + " " + y + " H " + s(x+w) + " V " + s(y+h) + " H " + x + " V " + y + " Z"; 38 | } else { 39 | return "M " + s(x + rx) + " " + y + " " 40 | + "L " + s(r - rx) + " " + y + " " 41 | + "Q " + r + " " + y + " " + r + " " + s(y + ry) + " " 42 | + "L " + r + " " + s(y + h - ry) + " " 43 | + "Q " + r + " " + b + " " + s(r - rx) + " " + b + " " 44 | + "L " + s(x + rx) + " " + b + " " 45 | + "Q " + x + " " + b + " " + x + " " + s(b - ry) + " " 46 | + "L " + x + " " + s(y + ry) + " " 47 | + "Q " + x + " " + y + " " + s(x + rx) + " " + y + " " 48 | + "Z"; 49 | } 50 | }; 51 | 52 | this.convertCircle = function (circleTag) { 53 | var cx = parseFloat(circleTag["attributes"]["cx"] || 0); 54 | var cy = parseFloat(circleTag["attributes"]["cy"] || 0); 55 | var r = parseFloat(circleTag["attributes"]["r"] || 0); 56 | var controlDistance = r * KAPPA; 57 | 58 | // Move to first point 59 | var output = "M " + cx + " " + s(cy - r) + " "; 60 | // 1. quadrant 61 | output += "C " + s(cx + controlDistance) + " " + s(cy - r) + " " + s(cx + r) + 62 | " " + s(cy - controlDistance) + " " + s(cx + r) + " " + cy + " "; 63 | // 2. quadrant 64 | output += "C " + s(cx + r) + " " + s(cy + controlDistance) + " " + s(cx + controlDistance) + 65 | " " + s(cy + r) + " " + cx + " " + s(cy + r) + " "; 66 | // 3. quadrant 67 | output += "C " + s(cx - controlDistance) + " " + s(cy + r) + " " + s(cx - r) + " " + 68 | s(cy + controlDistance) + " " + s(cx - r) + " " + cy + " "; 69 | // 4. quadrant 70 | output += "C " + s(cx - r) + " " + s(cy - controlDistance) + " " + s(cx - controlDistance) + " " + s(cy - r) + 71 | " " + cx + " " + s(cy - r) + " "; 72 | // Close path 73 | output += "Z"; 74 | 75 | return output; 76 | }; 77 | 78 | this.convertEllipse = function (ellipseTag) { 79 | var cx = parseFloat(ellipseTag["attributes"]["cx"] || 0); 80 | var cy = parseFloat(ellipseTag["attributes"]["cy"] || 0); 81 | var rx = parseFloat(ellipseTag["attributes"]["rx"] || 0); 82 | var ry = parseFloat(ellipseTag["attributes"]["ry"] || 0); 83 | var controlDistanceX = rx * KAPPA; 84 | var controlDistanceY = ry * KAPPA; 85 | 86 | // Move to first point 87 | var output = "M " + cx + " " + s(cy - ry) + " "; 88 | // 1. quadrant 89 | output += "C " + s(cx + controlDistanceX) + " " + s(cy - ry) + " " 90 | + s(cx + rx) + " " + s(cy - controlDistanceY) + " " + s(cx + rx) + " " + cy + " "; 91 | // 2. quadrant 92 | output += "C " + s(cx + rx) + " " + s(cy + controlDistanceY) + " " 93 | + s(cx + controlDistanceX) + " " + s(cy + ry) + " " + cx + " " + s(cy + ry) + " "; 94 | // 3. quadrant 95 | output += "C " + s(cx - controlDistanceX) + " " + s(cy + ry) + " " 96 | + s(cx - rx) + " " + s(cy + controlDistanceY) + " " + s(cx - rx) + " " + cy + " "; 97 | // 4. quadrant 98 | output += "C " + s(cx - rx) + " " + s(cy - controlDistanceY) + " " 99 | + s(cx - controlDistanceX) + " " + s(cy - ry) + " " + cx + " " + s(cy - ry) + " "; 100 | // Close path 101 | output += "Z"; 102 | return output; 103 | }; 104 | 105 | this.convertPolygon = function (polylineTag, isPolyline) { 106 | var points = polylineTag["attributes"]["points"]; 107 | var pointsArrayRaw = typeof points !== "undefined" ? points.split(",") : []; 108 | var pointsArray = []; 109 | for (var i = 0; i < pointsArrayRaw.length; i++) { 110 | var splitted = pointsArrayRaw[i].split(" "); 111 | for (var j = 0; j < splitted.length; j++) { 112 | if (splitted[j].length > 0) { 113 | pointsArray.push(splitted[j]); 114 | } 115 | } 116 | } 117 | 118 | if (pointsArray.length % 2 == 0) { 119 | var output = ""; 120 | for (var i = 0 ; i < pointsArray.length ; i += 2) { 121 | output += (i == 0 ? "M " : "L "); 122 | output += pointsArray[i] + " "+ pointsArray[i+1] + " "; 123 | } 124 | if (!isPolyline) { 125 | output += "Z"; 126 | } 127 | return output; 128 | } else { 129 | return null; 130 | } 131 | }; 132 | }; 133 | --------------------------------------------------------------------------------