├── .babelrc ├── .editorconfig ├── .eslintrc ├── .gitignore ├── LICENSE.txt ├── README.md ├── demo.gif ├── dist ├── flickity-transformer.js ├── flickity-transformer.pkgd.js └── flickity-transformer.pkgd.min.js ├── package-lock.json ├── package.json ├── rollup.js ├── src └── index.js └── test ├── functional ├── flickity-transformer.js ├── index.html └── multiple-instances.html └── index.js /.babelrc: -------------------------------------------------------------------------------- 1 | { 2 | "presets": ["es2015"] 3 | } 4 | -------------------------------------------------------------------------------- /.editorconfig: -------------------------------------------------------------------------------- 1 | root = true 2 | 3 | [*] 4 | charset = utf-8 5 | indent_style = space 6 | indent_size = 2 7 | end_of_line = lf 8 | insert_final_newline = true 9 | trim_trailing_whitespace = true 10 | -------------------------------------------------------------------------------- /.eslintrc: -------------------------------------------------------------------------------- 1 | { 2 | "extends": "standard", 3 | "env": { 4 | "node": true 5 | } 6 | } 7 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | node_modules 2 | npm-debug.log 3 | -------------------------------------------------------------------------------- /LICENSE.txt: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 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 . 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 | . 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 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Flickity Transformer 2 | 3 | 4 | 5 | 6 | 7 | :robot: **I'm no longer supporting this project, please feel free to use my work to make something neat.** :robot: 8 | 9 | 10 | An interface for declaring granular transform effects for [Flickity](http://flickity.metafizzy.co/). 11 | 12 | [![Demo image](demo.gif)](http://codepen.io/elcontraption/full/RGPboR/) 13 | 14 | - [Installation](#installation) 15 | - [Usage](#usage) 16 | - [Transforms](#transforms) 17 | - [Default units](#default-units) 18 | - [Examples](#examples) 19 | - [Contributing](#contributing) 20 | 21 | ## Installation 22 | Via NPM: 23 | ```bash 24 | yarn add flickity-transformer 25 | # or 26 | npm i --save flickity-transformer 27 | ``` 28 | 29 | Via download: 30 | - Minified: [flickity-transformer.pkgd.min.js](https://unpkg.com/flickity-transformer/dist/flickity-transformer.pkgd.min.js) 31 | - Un-minified: [flickity-transformer.pkgd.js](https://unpkg.com/flickity-transformer/dist/flickity-transformer.pkgd.js) 32 | 33 | CDN: 34 | ```html 35 | 36 | 37 | 38 | 39 | 40 | ``` 41 | 42 | ## Usage 43 | Create a new FlickityTransformer, passing in your Flickity instance and an array of [transform objects](#transforms). Transforms will be applied to each Flickity cell in the order they are declared. 44 | 45 | ```js 46 | var Flickity = require('flickity') 47 | var FlickityTransformer = require('flickity-transformer') 48 | 49 | var flkty = new Flickity('.carousel', { 50 | // options 51 | }) 52 | 53 | var transformer = new FlickityTransformer(flkty, [ 54 | { 55 | name: 'scale', // Let's scale your cells... 56 | stops: [ 57 | [-300, 0.5], // at -300px, slides will be scaled to 0.5 58 | [0, 1], // at the home position, slides will be full size 59 | [300, 0.5] // at 300px, slides will be half size again 60 | ] 61 | }, 62 | { 63 | name: 'rotate', // and add a little rotation... 64 | unit: 'rad' // use a unit other than the default 65 | stops: [ 66 | [-300, -1], // rotate slides to the left by 1 radian 67 | [0, 0], // they'll be straight at center 68 | [300, 1] // and rotated to the right 69 | // Add as many stops as you need 70 | ] 71 | } 72 | ]) 73 | ``` 74 | 75 | ### Transforms 76 | Each object in the transforms array requires at least two properties: `name` and `stops`. Each stop in `stops` is an array with two values: x position in pixels relative to the home position of your carousel, and the transform value to apply at that position. 77 | 78 | | property | type | value | 79 | | ------------- | --------- | ----------------- | 80 | | `name` | `String` | (required) The [transform function name](https://developer.mozilla.org/en-US/docs/Web/CSS/transform-function) 81 | | `stops` | `Array` | (required) An array of at least two transform stops. | 82 | | `unit` | `String` | (optional) Override the [default unit](#default-units). | 83 | 84 | ```js 85 | // Example: rotate cells between -1rad at -300px, and 1rad at 300px: 86 | { 87 | name: 'rotate', 88 | unit: 'rad', 89 | stops: [ 90 | [-300, -1], 91 | [300, 1] 92 | ] 93 | } 94 | ``` 95 | 96 | ### Default units 97 | ```js 98 | const units = { 99 | perspective: 'px', 100 | rotate: 'deg', 101 | rotateX: 'deg', 102 | rotateY: 'deg', 103 | rotateZ: 'deg', 104 | skew: 'deg', 105 | skewX: 'deg', 106 | skewY: 'deg', 107 | translateX: 'px', 108 | translateY: 'px', 109 | translateZ: 'px' 110 | } 111 | ``` 112 | 113 | ## Examples 114 | - [Basic CodePen demo](http://codepen.io/elcontraption/pen/RGPboR) 115 | - [Simple cover-flow example](http://codepen.io/elcontraption/pen/jrdOqr) 116 | 117 | ## Contributing 118 | Contributions are welcome. Top priorities are to support `wrapAround: true` and units other than pixels for stop positions. See [issues](https://github.com/elcontraption/flickity-transformer/issues) for details. To get up and running: 119 | 120 | ```bash 121 | # Install dependencies 122 | $ npm install 123 | 124 | # Lint, test & build 125 | $ npm run build 126 | 127 | # Run functional test in the browser 128 | $ npm run functional 129 | 130 | # See various scripts in package.json 131 | ``` 132 | Uses [JavaScript Standard Style](http://standardjs.com/). 133 | -------------------------------------------------------------------------------- /demo.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/elcontraption/flickity-transformer/74ecd18258fac5749191537f3cb7dc7308503d5c/demo.gif -------------------------------------------------------------------------------- /dist/flickity-transformer.js: -------------------------------------------------------------------------------- 1 | 'use strict'; 2 | 3 | function _interopDefault (ex) { return (ex && (typeof ex === 'object') && 'default' in ex) ? ex['default'] : ex; } 4 | 5 | var polylinearScale = _interopDefault(require('polylinear-scale')); 6 | 7 | var asyncGenerator = function () { 8 | function AwaitValue(value) { 9 | this.value = value; 10 | } 11 | 12 | function AsyncGenerator(gen) { 13 | var front, back; 14 | 15 | function send(key, arg) { 16 | return new Promise(function (resolve, reject) { 17 | var request = { 18 | key: key, 19 | arg: arg, 20 | resolve: resolve, 21 | reject: reject, 22 | next: null 23 | }; 24 | 25 | if (back) { 26 | back = back.next = request; 27 | } else { 28 | front = back = request; 29 | resume(key, arg); 30 | } 31 | }); 32 | } 33 | 34 | function resume(key, arg) { 35 | try { 36 | var result = gen[key](arg); 37 | var value = result.value; 38 | 39 | if (value instanceof AwaitValue) { 40 | Promise.resolve(value.value).then(function (arg) { 41 | resume("next", arg); 42 | }, function (arg) { 43 | resume("throw", arg); 44 | }); 45 | } else { 46 | settle(result.done ? "return" : "normal", result.value); 47 | } 48 | } catch (err) { 49 | settle("throw", err); 50 | } 51 | } 52 | 53 | function settle(type, value) { 54 | switch (type) { 55 | case "return": 56 | front.resolve({ 57 | value: value, 58 | done: true 59 | }); 60 | break; 61 | 62 | case "throw": 63 | front.reject(value); 64 | break; 65 | 66 | default: 67 | front.resolve({ 68 | value: value, 69 | done: false 70 | }); 71 | break; 72 | } 73 | 74 | front = front.next; 75 | 76 | if (front) { 77 | resume(front.key, front.arg); 78 | } else { 79 | back = null; 80 | } 81 | } 82 | 83 | this._invoke = send; 84 | 85 | if (typeof gen.return !== "function") { 86 | this.return = undefined; 87 | } 88 | } 89 | 90 | if (typeof Symbol === "function" && Symbol.asyncIterator) { 91 | AsyncGenerator.prototype[Symbol.asyncIterator] = function () { 92 | return this; 93 | }; 94 | } 95 | 96 | AsyncGenerator.prototype.next = function (arg) { 97 | return this._invoke("next", arg); 98 | }; 99 | 100 | AsyncGenerator.prototype.throw = function (arg) { 101 | return this._invoke("throw", arg); 102 | }; 103 | 104 | AsyncGenerator.prototype.return = function (arg) { 105 | return this._invoke("return", arg); 106 | }; 107 | 108 | return { 109 | wrap: function (fn) { 110 | return function () { 111 | return new AsyncGenerator(fn.apply(this, arguments)); 112 | }; 113 | }, 114 | await: function (value) { 115 | return new AwaitValue(value); 116 | } 117 | }; 118 | }(); 119 | 120 | var classCallCheck = function (instance, Constructor) { 121 | if (!(instance instanceof Constructor)) { 122 | throw new TypeError("Cannot call a class as a function"); 123 | } 124 | }; 125 | 126 | var createClass = function () { 127 | function defineProperties(target, props) { 128 | for (var i = 0; i < props.length; i++) { 129 | var descriptor = props[i]; 130 | descriptor.enumerable = descriptor.enumerable || false; 131 | descriptor.configurable = true; 132 | if ("value" in descriptor) descriptor.writable = true; 133 | Object.defineProperty(target, descriptor.key, descriptor); 134 | } 135 | } 136 | 137 | return function (Constructor, protoProps, staticProps) { 138 | if (protoProps) defineProperties(Constructor.prototype, protoProps); 139 | if (staticProps) defineProperties(Constructor, staticProps); 140 | return Constructor; 141 | }; 142 | }(); 143 | 144 | /** 145 | * Module name 146 | * 147 | * @type {String} 148 | */ 149 | var name = 'FlickityTransformer'; 150 | 151 | /** 152 | * Set default units 153 | * 154 | * @type {Object} 155 | */ 156 | var units = { 157 | perspective: 'px', 158 | rotate: 'deg', 159 | rotateX: 'deg', 160 | rotateY: 'deg', 161 | rotateZ: 'deg', 162 | skew: 'deg', 163 | skewX: 'deg', 164 | skewY: 'deg', 165 | translateX: 'px', 166 | translateY: 'px', 167 | translateZ: 'px' 168 | }; 169 | 170 | var FlickityTransformer = function () { 171 | function FlickityTransformer(flickity, transforms) { 172 | classCallCheck(this, FlickityTransformer); 173 | 174 | this.flickity = flickity; 175 | this.transforms = transforms; 176 | this.cellElements = flickity.getCellElements(); 177 | 178 | this.init(); 179 | } 180 | 181 | /** 182 | * Initialize 183 | */ 184 | 185 | 186 | createClass(FlickityTransformer, [{ 187 | key: 'init', 188 | value: function init() { 189 | var _this = this; 190 | 191 | this.createScaleFunctions(); 192 | 193 | // Apply initial transforms 194 | this.flickity.slides.forEach(this.applyTransforms.bind(this)); 195 | 196 | // Apply again on scroll 197 | this.flickity.on('scroll', function () { 198 | _this.flickity.slides.forEach(_this.applyTransforms.bind(_this)); 199 | }); 200 | 201 | // Require a version of Flickity supporting `scroll` event 202 | if (this.flickity._events.scroll === undefined) { 203 | throw new Error(name + ' requires the first parameter to be a instance of Flickity that supports the `scroll` event (version 2+)'); 204 | } 205 | 206 | // Apply again on resize 207 | window.addEventListener('resize', function () { 208 | _this.flickity.slides.forEach(_this.applyTransforms.bind(_this)); 209 | }); 210 | } 211 | 212 | /** 213 | * Create scale functions for each transform 214 | */ 215 | 216 | }, { 217 | key: 'createScaleFunctions', 218 | value: function createScaleFunctions() { 219 | this.transforms.forEach(function (transform) { 220 | var domain = []; 221 | var range = []; 222 | 223 | transform.stops.forEach(function (stop) { 224 | domain.push(stop[0]); 225 | range.push(stop[1]); 226 | }); 227 | 228 | // Create unique scale function 229 | transform.scale = function (value) { 230 | return polylinearScale(domain, range, true)(value); 231 | }; 232 | }); 233 | } 234 | 235 | /** 236 | * Apply transforms to an element 237 | * 238 | * @param {Object} el Flickity element 239 | * @param {Integer} i Element index 240 | */ 241 | 242 | }, { 243 | key: 'applyTransforms', 244 | value: function applyTransforms(slide, i) { 245 | var _this2 = this; 246 | 247 | var el = this.cellElements[i]; 248 | var txs = []; 249 | var xPos = void 0; 250 | 251 | // Get proximity to carousel home 252 | xPos = slide.parent.x < 0 ? slide.target - Math.abs(slide.parent.x) : slide.target + slide.parent.x; 253 | 254 | // Make transforms 255 | this.transforms.forEach(function (transform) { 256 | txs.push(_this2.makeTransform(transform, xPos)); 257 | }); 258 | 259 | // Apply transforms 260 | el.style.transform = txs.join(' '); 261 | } 262 | 263 | /** 264 | * Make an individual transform rule 265 | * 266 | * @param {Object} transform The transform declaration 267 | * @param {Number} xPos Element's proximity to carousel home 268 | * @return {String} 269 | */ 270 | 271 | }, { 272 | key: 'makeTransform', 273 | value: function makeTransform(transform, xPos) { 274 | var name = transform.name; 275 | // const unit = units[name] || '' 276 | var unit = transform.unit || units[name] || ''; 277 | var tx = transform.scale(xPos); 278 | 279 | return name + '(' + tx + unit + ')'; 280 | } 281 | }]); 282 | return FlickityTransformer; 283 | }(); 284 | 285 | module.exports = FlickityTransformer; -------------------------------------------------------------------------------- /dist/flickity-transformer.pkgd.js: -------------------------------------------------------------------------------- 1 | var FlickityTransformer = (function () { 2 | 'use strict'; 3 | 4 | function createCommonjsModule(fn, module) { 5 | return module = { exports: {} }, fn(module, module.exports), module.exports; 6 | } 7 | 8 | var index = createCommonjsModule(function (module) { 9 | var config = {}; 10 | 11 | /** 12 | * The compiled scale to return 13 | * 14 | * @param {Number} value The number to scale 15 | * @return {Number} The result 16 | */ 17 | function scale(value) { 18 | var domains = config.domain; 19 | var ranges = config.range; 20 | var rangeMin; 21 | var rangeMax; 22 | var domain; 23 | var range; 24 | var ratio; 25 | var result; 26 | var i = 0; 27 | 28 | /* eslint-disable no-sequences */ 29 | while (i < domains.length - 1) { 30 | if (value >= domains[i] && value <= domains[i + 1]) { 31 | domain = [domains[i], domains[i + 1]], range = [ranges[i], ranges[i + 1]]; 32 | break; 33 | } 34 | i++; 35 | } 36 | 37 | // Value is outside given domain 38 | if (domain === undefined) { 39 | if (value < domains[0]) { 40 | domain = [domains[0], domains[1]]; 41 | range = [ranges[0], ranges[1]]; 42 | } else { 43 | domain = [domains[domains.length - 2], domains[domains.length - 1]]; 44 | range = [ranges[ranges.length - 2], ranges[ranges.length - 1]]; 45 | } 46 | } 47 | 48 | ratio = (range[1] - range[0]) / (domain[1] - domain[0]); 49 | result = range[0] + ratio * (value - domain[0]); 50 | 51 | if (config.clamp) { 52 | rangeMin = Math.min(range[0], range[1]); 53 | rangeMax = Math.max(range[0], range[1]); 54 | result = Math.min(rangeMax, Math.max(rangeMin, result)); 55 | } 56 | 57 | return result; 58 | } 59 | 60 | /** 61 | * A polylinear scale 62 | * 63 | * Supports multiple piecewise linear scales that divide a continuous domain and range. 64 | * 65 | * @param {Array} domain Two or more numbers 66 | * @param {Array} range Numbers equivalent to number in `domain` 67 | * @param {Boolean} clamp Enables or disables clamping 68 | * @return {Function} Scale function 69 | */ 70 | function polylinearScale(domain, range, clamp) { 71 | domain = domain || [0, 1]; 72 | range = range || [0, 1]; 73 | clamp = clamp || false; 74 | 75 | if (domain.length !== range.length) { 76 | throw new Error('polylinearScale requires domain and range to have an equivalent number of values'); 77 | } 78 | 79 | config.domain = domain; 80 | config.range = range; 81 | config.clamp = clamp; 82 | 83 | return scale; 84 | } 85 | 86 | module.exports = polylinearScale; 87 | }); 88 | 89 | var asyncGenerator = function () { 90 | function AwaitValue(value) { 91 | this.value = value; 92 | } 93 | 94 | function AsyncGenerator(gen) { 95 | var front, back; 96 | 97 | function send(key, arg) { 98 | return new Promise(function (resolve, reject) { 99 | var request = { 100 | key: key, 101 | arg: arg, 102 | resolve: resolve, 103 | reject: reject, 104 | next: null 105 | }; 106 | 107 | if (back) { 108 | back = back.next = request; 109 | } else { 110 | front = back = request; 111 | resume(key, arg); 112 | } 113 | }); 114 | } 115 | 116 | function resume(key, arg) { 117 | try { 118 | var result = gen[key](arg); 119 | var value = result.value; 120 | 121 | if (value instanceof AwaitValue) { 122 | Promise.resolve(value.value).then(function (arg) { 123 | resume("next", arg); 124 | }, function (arg) { 125 | resume("throw", arg); 126 | }); 127 | } else { 128 | settle(result.done ? "return" : "normal", result.value); 129 | } 130 | } catch (err) { 131 | settle("throw", err); 132 | } 133 | } 134 | 135 | function settle(type, value) { 136 | switch (type) { 137 | case "return": 138 | front.resolve({ 139 | value: value, 140 | done: true 141 | }); 142 | break; 143 | 144 | case "throw": 145 | front.reject(value); 146 | break; 147 | 148 | default: 149 | front.resolve({ 150 | value: value, 151 | done: false 152 | }); 153 | break; 154 | } 155 | 156 | front = front.next; 157 | 158 | if (front) { 159 | resume(front.key, front.arg); 160 | } else { 161 | back = null; 162 | } 163 | } 164 | 165 | this._invoke = send; 166 | 167 | if (typeof gen.return !== "function") { 168 | this.return = undefined; 169 | } 170 | } 171 | 172 | if (typeof Symbol === "function" && Symbol.asyncIterator) { 173 | AsyncGenerator.prototype[Symbol.asyncIterator] = function () { 174 | return this; 175 | }; 176 | } 177 | 178 | AsyncGenerator.prototype.next = function (arg) { 179 | return this._invoke("next", arg); 180 | }; 181 | 182 | AsyncGenerator.prototype.throw = function (arg) { 183 | return this._invoke("throw", arg); 184 | }; 185 | 186 | AsyncGenerator.prototype.return = function (arg) { 187 | return this._invoke("return", arg); 188 | }; 189 | 190 | return { 191 | wrap: function (fn) { 192 | return function () { 193 | return new AsyncGenerator(fn.apply(this, arguments)); 194 | }; 195 | }, 196 | await: function (value) { 197 | return new AwaitValue(value); 198 | } 199 | }; 200 | }(); 201 | 202 | var classCallCheck = function (instance, Constructor) { 203 | if (!(instance instanceof Constructor)) { 204 | throw new TypeError("Cannot call a class as a function"); 205 | } 206 | }; 207 | 208 | var createClass = function () { 209 | function defineProperties(target, props) { 210 | for (var i = 0; i < props.length; i++) { 211 | var descriptor = props[i]; 212 | descriptor.enumerable = descriptor.enumerable || false; 213 | descriptor.configurable = true; 214 | if ("value" in descriptor) descriptor.writable = true; 215 | Object.defineProperty(target, descriptor.key, descriptor); 216 | } 217 | } 218 | 219 | return function (Constructor, protoProps, staticProps) { 220 | if (protoProps) defineProperties(Constructor.prototype, protoProps); 221 | if (staticProps) defineProperties(Constructor, staticProps); 222 | return Constructor; 223 | }; 224 | }(); 225 | 226 | /** 227 | * Module name 228 | * 229 | * @type {String} 230 | */ 231 | var name = 'FlickityTransformer'; 232 | 233 | /** 234 | * Set default units 235 | * 236 | * @type {Object} 237 | */ 238 | var units = { 239 | perspective: 'px', 240 | rotate: 'deg', 241 | rotateX: 'deg', 242 | rotateY: 'deg', 243 | rotateZ: 'deg', 244 | skew: 'deg', 245 | skewX: 'deg', 246 | skewY: 'deg', 247 | translateX: 'px', 248 | translateY: 'px', 249 | translateZ: 'px' 250 | }; 251 | 252 | var FlickityTransformer = function () { 253 | function FlickityTransformer(flickity, transforms) { 254 | classCallCheck(this, FlickityTransformer); 255 | 256 | this.flickity = flickity; 257 | this.transforms = transforms; 258 | this.cellElements = flickity.getCellElements(); 259 | 260 | this.init(); 261 | } 262 | 263 | /** 264 | * Initialize 265 | */ 266 | 267 | 268 | createClass(FlickityTransformer, [{ 269 | key: 'init', 270 | value: function init() { 271 | var _this = this; 272 | 273 | this.createScaleFunctions(); 274 | 275 | // Apply initial transforms 276 | this.flickity.slides.forEach(this.applyTransforms.bind(this)); 277 | 278 | // Apply again on scroll 279 | this.flickity.on('scroll', function () { 280 | _this.flickity.slides.forEach(_this.applyTransforms.bind(_this)); 281 | }); 282 | 283 | // Require a version of Flickity supporting `scroll` event 284 | if (this.flickity._events.scroll === undefined) { 285 | throw new Error(name + ' requires the first parameter to be a instance of Flickity that supports the `scroll` event (version 2+)'); 286 | } 287 | 288 | // Apply again on resize 289 | window.addEventListener('resize', function () { 290 | _this.flickity.slides.forEach(_this.applyTransforms.bind(_this)); 291 | }); 292 | } 293 | 294 | /** 295 | * Create scale functions for each transform 296 | */ 297 | 298 | }, { 299 | key: 'createScaleFunctions', 300 | value: function createScaleFunctions() { 301 | this.transforms.forEach(function (transform) { 302 | var domain = []; 303 | var range = []; 304 | 305 | transform.stops.forEach(function (stop) { 306 | domain.push(stop[0]); 307 | range.push(stop[1]); 308 | }); 309 | 310 | // Create unique scale function 311 | transform.scale = function (value) { 312 | return index(domain, range, true)(value); 313 | }; 314 | }); 315 | } 316 | 317 | /** 318 | * Apply transforms to an element 319 | * 320 | * @param {Object} el Flickity element 321 | * @param {Integer} i Element index 322 | */ 323 | 324 | }, { 325 | key: 'applyTransforms', 326 | value: function applyTransforms(slide, i) { 327 | var _this2 = this; 328 | 329 | var el = this.cellElements[i]; 330 | var txs = []; 331 | var xPos = void 0; 332 | 333 | // Get proximity to carousel home 334 | xPos = slide.parent.x < 0 ? slide.target - Math.abs(slide.parent.x) : slide.target + slide.parent.x; 335 | 336 | // Make transforms 337 | this.transforms.forEach(function (transform) { 338 | txs.push(_this2.makeTransform(transform, xPos)); 339 | }); 340 | 341 | // Apply transforms 342 | el.style.transform = txs.join(' '); 343 | } 344 | 345 | /** 346 | * Make an individual transform rule 347 | * 348 | * @param {Object} transform The transform declaration 349 | * @param {Number} xPos Element's proximity to carousel home 350 | * @return {String} 351 | */ 352 | 353 | }, { 354 | key: 'makeTransform', 355 | value: function makeTransform(transform, xPos) { 356 | var name = transform.name; 357 | // const unit = units[name] || '' 358 | var unit = transform.unit || units[name] || ''; 359 | var tx = transform.scale(xPos); 360 | 361 | return name + '(' + tx + unit + ')'; 362 | } 363 | }]); 364 | return FlickityTransformer; 365 | }(); 366 | 367 | return FlickityTransformer; 368 | 369 | }()); -------------------------------------------------------------------------------- /dist/flickity-transformer.pkgd.min.js: -------------------------------------------------------------------------------- 1 | var FlickityTransformer=function(){"use strict";function createCommonjsModule(fn,module){return module={exports:{}},fn(module,module.exports),module.exports}var index=createCommonjsModule(function(module){var config={};function scale(value){var domains=config.domain;var ranges=config.range;var rangeMin;var rangeMax;var domain;var range;var ratio;var result;var i=0;while(i=domains[i]&&value<=domains[i+1]){domain=[domains[i],domains[i+1]],range=[ranges[i],ranges[i+1]];break}i++}if(domain===undefined){if(value", 26 | "license": "GPL-3.0", 27 | "bugs": { 28 | "url": "https://github.com/elcontraption/flickity-transformer/issues" 29 | }, 30 | "homepage": "https://github.com/elcontraption/flickity-transformer#readme", 31 | "dependencies": { 32 | "polylinear-scale": "1.0.10" 33 | }, 34 | "devDependencies": { 35 | "babel-cli": "6.14.0", 36 | "babel-preset-es2015": "6.14.0", 37 | "babel-preset-es2015-rollup": "^1.2.0", 38 | "chai": "3.5.0", 39 | "eslint": "3.4.0", 40 | "eslint-config-standard": "6.0.0", 41 | "eslint-plugin-promise": "2.0.1", 42 | "eslint-plugin-standard": "2.0.0", 43 | "flickity": "^2.0.3", 44 | "http-server": "0.9.0", 45 | "mocha": "3.0.2", 46 | "rollup": "^0.34.13", 47 | "rollup-plugin-babel": "^2.6.1", 48 | "rollup-plugin-commonjs": "^4.1.0", 49 | "rollup-plugin-node-resolve": "^2.0.0", 50 | "uglify-js": "^2.7.3" 51 | } 52 | } 53 | -------------------------------------------------------------------------------- /rollup.js: -------------------------------------------------------------------------------- 1 | const babel = require('rollup-plugin-babel') 2 | const commonjs = require('rollup-plugin-commonjs') 3 | const resolve = require('rollup-plugin-node-resolve') 4 | const rollup = require('rollup') 5 | 6 | let config = { 7 | entry: 'src/index.js', 8 | plugins: [ 9 | babel({ 10 | presets: ['es2015-rollup'], 11 | babelrc: false 12 | }) 13 | ] 14 | } 15 | 16 | rollup.rollup(config).then(bundle => { 17 | bundle.write({ 18 | format: 'cjs', 19 | moduleName: 'FlickityTransformer', 20 | dest: 'dist/flickity-transformer.js' 21 | }) 22 | }) 23 | 24 | config.plugins.push(resolve({ 25 | jsnext: true, 26 | main: true 27 | })) 28 | 29 | config.plugins.push(commonjs()) 30 | 31 | rollup.rollup(config).then(bundle => { 32 | bundle.write({ 33 | format: 'iife', 34 | moduleName: 'FlickityTransformer', 35 | dest: 'dist/flickity-transformer.pkgd.js' 36 | }) 37 | 38 | bundle.write({ 39 | format: 'iife', 40 | moduleName: 'FlickityTransformer', 41 | dest: 'test/functional/flickity-transformer.js' 42 | }) 43 | }).catch(err => console.log(err.stack)) 44 | -------------------------------------------------------------------------------- /src/index.js: -------------------------------------------------------------------------------- 1 | import polylinearScale from 'polylinear-scale' 2 | 3 | /** 4 | * Module name 5 | * 6 | * @type {String} 7 | */ 8 | const name = 'FlickityTransformer' 9 | 10 | /** 11 | * Set default units 12 | * 13 | * @type {Object} 14 | */ 15 | const units = { 16 | perspective: 'px', 17 | rotate: 'deg', 18 | rotateX: 'deg', 19 | rotateY: 'deg', 20 | rotateZ: 'deg', 21 | skew: 'deg', 22 | skewX: 'deg', 23 | skewY: 'deg', 24 | translateX: 'px', 25 | translateY: 'px', 26 | translateZ: 'px' 27 | } 28 | 29 | class FlickityTransformer { 30 | constructor (flickity, transforms) { 31 | this.flickity = flickity 32 | this.transforms = transforms 33 | this.cellElements = flickity.getCellElements() 34 | 35 | this.init() 36 | } 37 | 38 | /** 39 | * Initialize 40 | */ 41 | init () { 42 | this.createScaleFunctions() 43 | 44 | // Apply initial transforms 45 | this.flickity.slides.forEach(this.applyTransforms.bind(this)) 46 | 47 | // Apply again on scroll 48 | this.flickity.on('scroll', () => { 49 | this.flickity.slides.forEach(this.applyTransforms.bind(this)) 50 | }) 51 | 52 | // Require a version of Flickity supporting `scroll` event 53 | if (this.flickity._events.scroll === undefined) { 54 | throw new Error(`${name} requires the first parameter to be a instance of Flickity that supports the \`scroll\` event (version 2+)`) 55 | } 56 | 57 | // Apply again on resize 58 | window.addEventListener('resize', () => { 59 | this.flickity.slides.forEach(this.applyTransforms.bind(this)) 60 | }) 61 | } 62 | 63 | /** 64 | * Create scale functions for each transform 65 | */ 66 | createScaleFunctions () { 67 | this.transforms.forEach(transform => { 68 | const domain = [] 69 | const range = [] 70 | 71 | transform.stops.forEach(stop => { 72 | domain.push(stop[0]) 73 | range.push(stop[1]) 74 | }) 75 | 76 | // Create unique scale function 77 | transform.scale = function (value) { 78 | return polylinearScale(domain, range, true)(value) 79 | } 80 | }) 81 | } 82 | 83 | /** 84 | * Apply transforms to an element 85 | * 86 | * @param {Object} el Flickity element 87 | * @param {Integer} i Element index 88 | */ 89 | applyTransforms (slide, i) { 90 | const el = this.cellElements[i] 91 | const txs = [] 92 | let xPos 93 | 94 | // Get proximity to carousel home 95 | xPos = slide.parent.x < 0 ? slide.target - Math.abs(slide.parent.x) : slide.target + slide.parent.x 96 | 97 | // Make transforms 98 | this.transforms.forEach(transform => { 99 | txs.push(this.makeTransform(transform, xPos)) 100 | }) 101 | 102 | // Apply transforms 103 | el.style.transform = txs.join(' ') 104 | } 105 | 106 | /** 107 | * Make an individual transform rule 108 | * 109 | * @param {Object} transform The transform declaration 110 | * @param {Number} xPos Element's proximity to carousel home 111 | * @return {String} 112 | */ 113 | makeTransform (transform, xPos) { 114 | const name = transform.name 115 | // const unit = units[name] || '' 116 | const unit = transform.unit || units[name] || '' 117 | const tx = transform.scale(xPos) 118 | 119 | return `${name}(${tx}${unit})` 120 | } 121 | } 122 | 123 | /** 124 | * Exporter 125 | */ 126 | export default FlickityTransformer 127 | -------------------------------------------------------------------------------- /test/functional/flickity-transformer.js: -------------------------------------------------------------------------------- 1 | var FlickityTransformer = (function () { 2 | 'use strict'; 3 | 4 | function createCommonjsModule(fn, module) { 5 | return module = { exports: {} }, fn(module, module.exports), module.exports; 6 | } 7 | 8 | var index = createCommonjsModule(function (module) { 9 | var config = {}; 10 | 11 | /** 12 | * The compiled scale to return 13 | * 14 | * @param {Number} value The number to scale 15 | * @return {Number} The result 16 | */ 17 | function scale(value) { 18 | var domains = config.domain; 19 | var ranges = config.range; 20 | var rangeMin; 21 | var rangeMax; 22 | var domain; 23 | var range; 24 | var ratio; 25 | var result; 26 | var i = 0; 27 | 28 | /* eslint-disable no-sequences */ 29 | while (i < domains.length - 1) { 30 | if (value >= domains[i] && value <= domains[i + 1]) { 31 | domain = [domains[i], domains[i + 1]], range = [ranges[i], ranges[i + 1]]; 32 | break; 33 | } 34 | i++; 35 | } 36 | 37 | // Value is outside given domain 38 | if (domain === undefined) { 39 | if (value < domains[0]) { 40 | domain = [domains[0], domains[1]]; 41 | range = [ranges[0], ranges[1]]; 42 | } else { 43 | domain = [domains[domains.length - 2], domains[domains.length - 1]]; 44 | range = [ranges[ranges.length - 2], ranges[ranges.length - 1]]; 45 | } 46 | } 47 | 48 | ratio = (range[1] - range[0]) / (domain[1] - domain[0]); 49 | result = range[0] + ratio * (value - domain[0]); 50 | 51 | if (config.clamp) { 52 | rangeMin = Math.min(range[0], range[1]); 53 | rangeMax = Math.max(range[0], range[1]); 54 | result = Math.min(rangeMax, Math.max(rangeMin, result)); 55 | } 56 | 57 | return result; 58 | } 59 | 60 | /** 61 | * A polylinear scale 62 | * 63 | * Supports multiple piecewise linear scales that divide a continuous domain and range. 64 | * 65 | * @param {Array} domain Two or more numbers 66 | * @param {Array} range Numbers equivalent to number in `domain` 67 | * @param {Boolean} clamp Enables or disables clamping 68 | * @return {Function} Scale function 69 | */ 70 | function polylinearScale(domain, range, clamp) { 71 | domain = domain || [0, 1]; 72 | range = range || [0, 1]; 73 | clamp = clamp || false; 74 | 75 | if (domain.length !== range.length) { 76 | throw new Error('polylinearScale requires domain and range to have an equivalent number of values'); 77 | } 78 | 79 | config.domain = domain; 80 | config.range = range; 81 | config.clamp = clamp; 82 | 83 | return scale; 84 | } 85 | 86 | module.exports = polylinearScale; 87 | }); 88 | 89 | var asyncGenerator = function () { 90 | function AwaitValue(value) { 91 | this.value = value; 92 | } 93 | 94 | function AsyncGenerator(gen) { 95 | var front, back; 96 | 97 | function send(key, arg) { 98 | return new Promise(function (resolve, reject) { 99 | var request = { 100 | key: key, 101 | arg: arg, 102 | resolve: resolve, 103 | reject: reject, 104 | next: null 105 | }; 106 | 107 | if (back) { 108 | back = back.next = request; 109 | } else { 110 | front = back = request; 111 | resume(key, arg); 112 | } 113 | }); 114 | } 115 | 116 | function resume(key, arg) { 117 | try { 118 | var result = gen[key](arg); 119 | var value = result.value; 120 | 121 | if (value instanceof AwaitValue) { 122 | Promise.resolve(value.value).then(function (arg) { 123 | resume("next", arg); 124 | }, function (arg) { 125 | resume("throw", arg); 126 | }); 127 | } else { 128 | settle(result.done ? "return" : "normal", result.value); 129 | } 130 | } catch (err) { 131 | settle("throw", err); 132 | } 133 | } 134 | 135 | function settle(type, value) { 136 | switch (type) { 137 | case "return": 138 | front.resolve({ 139 | value: value, 140 | done: true 141 | }); 142 | break; 143 | 144 | case "throw": 145 | front.reject(value); 146 | break; 147 | 148 | default: 149 | front.resolve({ 150 | value: value, 151 | done: false 152 | }); 153 | break; 154 | } 155 | 156 | front = front.next; 157 | 158 | if (front) { 159 | resume(front.key, front.arg); 160 | } else { 161 | back = null; 162 | } 163 | } 164 | 165 | this._invoke = send; 166 | 167 | if (typeof gen.return !== "function") { 168 | this.return = undefined; 169 | } 170 | } 171 | 172 | if (typeof Symbol === "function" && Symbol.asyncIterator) { 173 | AsyncGenerator.prototype[Symbol.asyncIterator] = function () { 174 | return this; 175 | }; 176 | } 177 | 178 | AsyncGenerator.prototype.next = function (arg) { 179 | return this._invoke("next", arg); 180 | }; 181 | 182 | AsyncGenerator.prototype.throw = function (arg) { 183 | return this._invoke("throw", arg); 184 | }; 185 | 186 | AsyncGenerator.prototype.return = function (arg) { 187 | return this._invoke("return", arg); 188 | }; 189 | 190 | return { 191 | wrap: function (fn) { 192 | return function () { 193 | return new AsyncGenerator(fn.apply(this, arguments)); 194 | }; 195 | }, 196 | await: function (value) { 197 | return new AwaitValue(value); 198 | } 199 | }; 200 | }(); 201 | 202 | var classCallCheck = function (instance, Constructor) { 203 | if (!(instance instanceof Constructor)) { 204 | throw new TypeError("Cannot call a class as a function"); 205 | } 206 | }; 207 | 208 | var createClass = function () { 209 | function defineProperties(target, props) { 210 | for (var i = 0; i < props.length; i++) { 211 | var descriptor = props[i]; 212 | descriptor.enumerable = descriptor.enumerable || false; 213 | descriptor.configurable = true; 214 | if ("value" in descriptor) descriptor.writable = true; 215 | Object.defineProperty(target, descriptor.key, descriptor); 216 | } 217 | } 218 | 219 | return function (Constructor, protoProps, staticProps) { 220 | if (protoProps) defineProperties(Constructor.prototype, protoProps); 221 | if (staticProps) defineProperties(Constructor, staticProps); 222 | return Constructor; 223 | }; 224 | }(); 225 | 226 | /** 227 | * Module name 228 | * 229 | * @type {String} 230 | */ 231 | var name = 'FlickityTransformer'; 232 | 233 | /** 234 | * Set default units 235 | * 236 | * @type {Object} 237 | */ 238 | var units = { 239 | perspective: 'px', 240 | rotate: 'deg', 241 | rotateX: 'deg', 242 | rotateY: 'deg', 243 | rotateZ: 'deg', 244 | skew: 'deg', 245 | skewX: 'deg', 246 | skewY: 'deg', 247 | translateX: 'px', 248 | translateY: 'px', 249 | translateZ: 'px' 250 | }; 251 | 252 | var FlickityTransformer = function () { 253 | function FlickityTransformer(flickity, transforms) { 254 | classCallCheck(this, FlickityTransformer); 255 | 256 | this.flickity = flickity; 257 | this.transforms = transforms; 258 | this.cellElements = flickity.getCellElements(); 259 | 260 | this.init(); 261 | } 262 | 263 | /** 264 | * Initialize 265 | */ 266 | 267 | 268 | createClass(FlickityTransformer, [{ 269 | key: 'init', 270 | value: function init() { 271 | var _this = this; 272 | 273 | this.createScaleFunctions(); 274 | 275 | // Apply initial transforms 276 | this.flickity.slides.forEach(this.applyTransforms.bind(this)); 277 | 278 | // Apply again on scroll 279 | this.flickity.on('scroll', function () { 280 | _this.flickity.slides.forEach(_this.applyTransforms.bind(_this)); 281 | }); 282 | 283 | // Require a version of Flickity supporting `scroll` event 284 | if (this.flickity._events.scroll === undefined) { 285 | throw new Error(name + ' requires the first parameter to be a instance of Flickity that supports the `scroll` event (version 2+)'); 286 | } 287 | 288 | // Apply again on resize 289 | window.addEventListener('resize', function () { 290 | _this.flickity.slides.forEach(_this.applyTransforms.bind(_this)); 291 | }); 292 | } 293 | 294 | /** 295 | * Create scale functions for each transform 296 | */ 297 | 298 | }, { 299 | key: 'createScaleFunctions', 300 | value: function createScaleFunctions() { 301 | this.transforms.forEach(function (transform) { 302 | var domain = []; 303 | var range = []; 304 | 305 | transform.stops.forEach(function (stop) { 306 | domain.push(stop[0]); 307 | range.push(stop[1]); 308 | }); 309 | 310 | // Create unique scale function 311 | transform.scale = function (value) { 312 | return index(domain, range, true)(value); 313 | }; 314 | }); 315 | } 316 | 317 | /** 318 | * Apply transforms to an element 319 | * 320 | * @param {Object} el Flickity element 321 | * @param {Integer} i Element index 322 | */ 323 | 324 | }, { 325 | key: 'applyTransforms', 326 | value: function applyTransforms(slide, i) { 327 | var _this2 = this; 328 | 329 | var el = this.cellElements[i]; 330 | var txs = []; 331 | var xPos = void 0; 332 | 333 | // Get proximity to carousel home 334 | xPos = slide.parent.x < 0 ? slide.target - Math.abs(slide.parent.x) : slide.target + slide.parent.x; 335 | 336 | // Make transforms 337 | this.transforms.forEach(function (transform) { 338 | txs.push(_this2.makeTransform(transform, xPos)); 339 | }); 340 | 341 | // Apply transforms 342 | el.style.transform = txs.join(' '); 343 | } 344 | 345 | /** 346 | * Make an individual transform rule 347 | * 348 | * @param {Object} transform The transform declaration 349 | * @param {Number} xPos Element's proximity to carousel home 350 | * @return {String} 351 | */ 352 | 353 | }, { 354 | key: 'makeTransform', 355 | value: function makeTransform(transform, xPos) { 356 | var name = transform.name; 357 | // const unit = units[name] || '' 358 | var unit = transform.unit || units[name] || ''; 359 | var tx = transform.scale(xPos); 360 | 361 | return name + '(' + tx + unit + ')'; 362 | } 363 | }]); 364 | return FlickityTransformer; 365 | }(); 366 | 367 | return FlickityTransformer; 368 | 369 | }()); -------------------------------------------------------------------------------- /test/functional/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | FlickityTransformer Test 6 | 7 | 8 | 9 | 10 | 11 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 47 | 48 | 96 | 97 | 98 | 99 | -------------------------------------------------------------------------------- /test/functional/multiple-instances.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | FlickityTransformer Test 6 | 7 | 8 | 9 | 10 | 11 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 47 | 48 | 56 | 57 | 111 | 112 | 113 | 114 | -------------------------------------------------------------------------------- /test/index.js: -------------------------------------------------------------------------------- 1 | import * as chai from 'chai' 2 | import FlickityTransformer from '../src' 3 | 4 | global.chai = chai 5 | global.expect = global.chai.expect 6 | 7 | const name = 'FlickityTransformer' 8 | 9 | describe('FlickityTransformer', () => { 10 | it('should export a constructor', () => { 11 | expect(FlickityTransformer).to.be.a('function') 12 | }) 13 | }) 14 | --------------------------------------------------------------------------------