├── .gitignore ├── .travis.yml ├── Gruntfile.js ├── LICENSE ├── README.md ├── demo ├── demo.css ├── demo.js └── index.html ├── package.json ├── resources ├── blanket-1.1.5.min.js ├── grunt-reporter.min.js ├── jquery-1.10.2.min.js ├── jquery-ui.css ├── jquery-ui.min.js ├── jquery.simulate.min.js ├── qunit-1.12.0.min.css ├── qunit-1.12.0.min.js ├── qunit-1.13.0.css └── qunit-1.13.0.js ├── src ├── .jshintrc └── jquery-fsortable.js └── tests ├── .jshintrc ├── index.html ├── test_connected.js ├── test_core.js ├── test_draggable.js ├── test_sort.js ├── tests.css └── utils.js /.gitignore: -------------------------------------------------------------------------------- 1 | *.swp 2 | build/ 3 | node_modules/ 4 | .sizecache.json 5 | 6 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: node_js 2 | before_script: 3 | - npm install -g grunt-cli 4 | -------------------------------------------------------------------------------- /Gruntfile.js: -------------------------------------------------------------------------------- 1 | module.exports = function(grunt) { 2 | grunt.initConfig({ 3 | pkg: grunt.file.readJSON('package.json'), 4 | 5 | uglify: { 6 | options: { 7 | banner: '/* <%= pkg.name %> v<%= pkg.version %>\n' + 8 | '(c) 2014, Andrei Picus\n' + 9 | 'License: GPL */\n' 10 | }, 11 | 12 | build: { 13 | src: 'src/<%= pkg.name %>.js', 14 | dest: 'build/<%= pkg.name %>.min.js' 15 | }, 16 | }, 17 | 18 | jshint: { 19 | src: { 20 | src: [ "src/**/*.js" ], 21 | options: { 22 | jshintrc: "src/.jshintrc" 23 | } 24 | }, 25 | grunt: { 26 | src: [ "Gruntfile.js"], 27 | }, 28 | tests: { 29 | src: [ "tests/**/*.js" ], 30 | options: { 31 | jshintrc: "tests/.jshintrc" 32 | } 33 | } 34 | }, 35 | 36 | connect: { 37 | server: { 38 | options: { 39 | port: 8000, 40 | base: '.' 41 | } 42 | } 43 | }, 44 | 45 | blanket_qunit: { 46 | all: { 47 | options: { 48 | urls: ['http://localhost:8000/tests/index.html?coverage=true&gruntReport'], 49 | threshold: 90 50 | } 51 | } 52 | }, 53 | 54 | compare_size: { 55 | files: [ 56 | 'src/<%= pkg.name %>.js', 57 | 'build/<%= pkg.name %>.min.js' 58 | ] 59 | } 60 | }); 61 | 62 | // Grunt plugins. 63 | grunt.loadNpmTasks('grunt-contrib-uglify'); 64 | grunt.loadNpmTasks('grunt-contrib-jshint'); 65 | grunt.loadNpmTasks('grunt-contrib-qunit'); 66 | grunt.loadNpmTasks('grunt-contrib-connect'); 67 | grunt.loadNpmTasks('grunt-blanket-qunit'); 68 | grunt.loadNpmTasks('grunt-compare-size'); 69 | 70 | // Tasks. 71 | grunt.registerTask('test', ['connect', 'blanket_qunit']); 72 | grunt.registerTask('lint', ['jshint']); 73 | grunt.registerTask('default', ['lint', 'test', 'uglify', 'compare_size']); 74 | }; 75 | 76 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 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 | jquery-fsortable [![Build Status](https://travis-ci.org/NiGhTTraX/jquery-fsortable.svg?branch=master)](https://travis-ci.org/NiGhTTraX/jquery-fsortable) 2 | ================ 3 | 4 | A fixed layout sortable plugin for jQuery UI. 5 | 6 | 7 | Demo 8 | ---- 9 | 10 | Check http://nighttrax.github.io/jquery-fsortable/ for a demo. 11 | 12 | 13 | #### IMPORTANT NOTE 14 | 15 | The [jQuery UI sortable](http://jqueryui.com/sortable/) plugin (which fsortable 16 | builds upon) currently has 2 bugs that affect fsortable when working 17 | with connected sortables. 18 | 19 | The first bug causes over and out events to not be triggered properly when 20 | using connected sortables. See http://bugs.jqueryui.com/ticket/9335 for more 21 | details. 22 | 23 | The second bug causes change events to trigger on the sender list, rather 24 | than on the current list, when dragging an item from a connected sortable. 25 | See http://bugs.jqueryui.com/ticket/9760 for more details. 26 | 27 | If you don't need connected sortables then you can use this plugin as is. 28 | However, if you do require that functionality, then please use the following 29 | repo until the fixes land upstream. 30 | https://github.com/NiGhTTraX/jquery-ui/tree/experimental 31 | 32 | 33 | Usage 34 | ----- 35 | 36 | Include ```jquery-fsortable.js``` in your project and call 37 | ```$("#my-div").fsortable()```. fsortable creates a ```sortable``` 38 | instance for you. You can call it on an existing instance by passing 39 | ```existingSortable: true``` in the options at creation time. 40 | 41 | After you create the fsortable instance you can call methods on the 42 | underlying sortable instance by passing them through the ```.sortable()``` 43 | wrapper. The plugin will still fire ```sort``` instance just like a normal 44 | ```sortable``` plugin. 45 | 46 | 47 | Creating a fixed layout 48 | ----------------------- 49 | 50 | There's some necessary markup you need to use to let fsortable know about 51 | your layout. Since it assumes your sortable has a ```fixed capacity``` you 52 | need to tell it how many items it can hold. It takes that information from 53 | the HTML itself by counting the number of items in your sortable and the 54 | number of empty positions. 55 | 56 | Any item that matches the ```items``` option of the sortable plugin will be 57 | counted as being part of the layout. Any item that has the ```emptyClass``` 58 | class will be counted as being a free slot. The sum of both will be the 59 | total capacity of the sortable. 60 | 61 | Let's take an example. 62 | 63 | ```html 64 |
65 |
Item 1
66 |
Item 2
67 |
68 |
Item 3
69 |
70 | ``` 71 | 72 | We've defined a layout with a total capacity of ```4```, that contains ```3``` 73 | items and ```1``` free slot. Once that free slot will be occupied (i.e. dragging 74 | a ```draggable``` over it) the fsortable will become full and it will be marked 75 | as being so by having the ```full``` class set on it. 76 | 77 | If you need to change the size of the fsortable you can do so, but remember to 78 | call the ```refresh``` method on it so it recalculates the items and free slots. 79 | 80 | To connect draggables with your fsortable you need to do the following. 81 | 82 | ```javascript 83 | $(".my-draggable").draggable({ 84 | connectToSortable: ".fsortable:not(.full)" 85 | }); 86 | ``` 87 | 88 | Note the ```:not(.full)``` selector. That tells the draggables to not connect with 89 | full fsortables. 90 | 91 | 92 | Building 93 | -------- 94 | 95 | Fsortable uses the [Grunt](https://github.com/gruntjs/grunt) build system. 96 | To build Fsortable, you must have [node.js](https://github.com/joyent/node) 97 | installed and then run the following commands: 98 | 99 | ```bash 100 | # Install the Grunt CLI. 101 | npm install -g grunt-cli 102 | 103 | # Clone the repository. 104 | git clone git@github.com:NiGhTTraX/jquery-fsortable.git 105 | cd jquery-fsortable 106 | 107 | # Install node module dependencies. 108 | npm install 109 | 110 | # Run the build task. 111 | grunt 112 | ``` 113 | 114 | If all went well, you will find a minified version of the plugin in the ```build/``` folder. 115 | 116 | 117 | Testing 118 | ------- 119 | 120 | Run ```grunt test``` to run the tests in 121 | [PhantomJS](https://github.com/ariya/phantomjs) or open ```tests/index.html``` 122 | to run them in your browser. Tests are written using the 123 | [QUnit](http://www.qunitjs.com/) framework and the [jQuery Event Unit Testing 124 | Helpers](https://github.com/jquery/jquery-simulate). 125 | 126 | To enable coverage, place the ```resources/``` and ```tests/``` folders in your 127 | webserver and run the tests from there with the coverage option in QUnit checked 128 | (running coverage locally will throw a cross-domain error). Coverage is done 129 | using [blanket.js](http://www.blanketjs.org). 130 | -------------------------------------------------------------------------------- /demo/demo.css: -------------------------------------------------------------------------------- 1 | * { 2 | margin: 0; 3 | padding: 0; 4 | } 5 | 6 | .demo { 7 | position: relative; 8 | width: 500px; 9 | height: 100px; 10 | float: left; 11 | margin-right: 15px; 12 | } 13 | 14 | .bg { 15 | position: absolute; 16 | left: 20px; 17 | top: 20px; 18 | width: 500px; 19 | height: 100px; 20 | z-index: -1; 21 | } 22 | .bg div { 23 | float: left; 24 | height: 20px; 25 | width: 20px; 26 | border: 1px solid #aaa; 27 | padding: 20px; 28 | margin: 10px; 29 | text-align: center; 30 | opacity: 0.4; 31 | } 32 | .fs { 33 | position: absolute; 34 | left: 20px; 35 | top: 20px; 36 | height: 20px; 37 | width: 500px; 38 | height: 100px; 39 | border: 1px solid #aaa; 40 | } 41 | .fsortable-empty { 42 | float: left; 43 | height: 20px; 44 | width: 20px; 45 | padding: 20px; 46 | margin: 10px; 47 | border: 1px solid #999; 48 | } 49 | #content { 50 | position: absolute; 51 | top: 150px; 52 | left: 20px; 53 | } 54 | .item { 55 | height: 20px; 56 | width: 20px; 57 | padding: 20px; 58 | margin: 10px; 59 | border: 1px solid #000; 60 | text-align: center; 61 | float: left; 62 | background-color: #fff; 63 | } 64 | /* 65 | .ui-sortable-placeholder { 66 | visibility: visible !important; 67 | border: 1px solid #999; 68 | } 69 | */ 70 | 71 | -------------------------------------------------------------------------------- /demo/demo.js: -------------------------------------------------------------------------------- 1 | $(document).ready(function() { 2 | $(".fs").fsortable({ 3 | connectWith: ".fs", 4 | tolerance: "pointer", 5 | size: 5 6 | }).disableSelection(); 7 | 8 | $("#content .item").draggable({ 9 | connectToSortable: ".fs:not(.full)", 10 | revert: "invalid", 11 | helper: "clone" 12 | }); 13 | }); 14 | 15 | -------------------------------------------------------------------------------- /demo/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | Demo fsortable 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 |
14 |
1
15 |
2
16 |
3
17 |
4
18 |
5
19 |
20 | 21 |
22 |
23 |
24 |
25 |
26 |
27 |
28 |
29 | 30 |
31 |
32 |
1
33 |
2
34 |
3
35 |
36 |
37 |
38 |
10
39 |
40 |
41 |
42 | 43 |
44 |
a
45 |
b
46 |
c
47 |
d
48 |
e
49 |
50 | 51 | 52 | 53 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "jquery-fsortable", 3 | "version": "1.0.1", 4 | "description": "Fixed layout sortable plugin", 5 | "main": "jquery-fsortable.js", 6 | "directories": { 7 | "test": "tests" 8 | }, 9 | "scripts": { 10 | "test": "grunt" 11 | }, 12 | "repository": { 13 | "type": "git", 14 | "url": "git://github.com/NiGhTTraX/jquery-fsortable.git" 15 | }, 16 | "author": "Andrei Picus", 17 | "license": "GPL", 18 | "bugs": { 19 | "url": "https://github.com/NiGhTTraX/jquery-fsortable/issues" 20 | }, 21 | "devDependencies": { 22 | "grunt": "~0.4.1", 23 | "grunt-contrib-jshint": "~0.7.0", 24 | "grunt-contrib-qunit": "~0.3.0", 25 | "grunt-contrib-connect": "~0.5.0", 26 | "grunt-contrib-uglify": "~0.2.5", 27 | "grunt-blanket-qunit": "~0.2.0", 28 | "grunt-compare-size": "^0.4.0" 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /resources/grunt-reporter.min.js: -------------------------------------------------------------------------------- 1 | // grunt-reporter.js 2 | // 3 | // A communication bridge between blanket.js and the grunt-blanket-qunit plugin 4 | // Distributed as part of the grunt-blanket-qunit library 5 | // 6 | // Copyright (C) 2013 Model N, Inc. 7 | // Distributed under the MIT License 8 | // 9 | // Documentation and full license available at: 10 | // https://github.com/ModelN/grunt-blanket-qunit 11 | // 12 | (function(){var c=function c(){var 13 | d=[].slice.call(arguments);alert(JSON.stringify(d))};var a=function(h){var 14 | f={coverage:0,hits:0,misses:0,sloc:0};for(var g=0;g0?r.charCode:r.keyCode,i.charCode=t;return i},dispatchEvent:function(e,t,n){e.dispatchEvent?e.dispatchEvent(n):e.fireEvent&&e.fireEvent("on"+t,n)},simulateFocus:function(){function i(){n=!0}var t,n=!1,r=e(this.target);r.bind("focus",i),r[0].focus(),n||(t=e.Event("focusin"),t.preventDefault(),r.trigger(t),r.triggerHandler("focus")),r.unbind("focus",i)},simulateBlur:function(){function i(){n=!0}var t,n=!1,r=e(this.target);r.bind("blur",i),r[0].blur(),setTimeout(function(){r[0].ownerDocument.activeElement===r[0]&&r[0].ownerDocument.body.focus(),n||(t=e.Event("focusout"),t.preventDefault(),r.trigger(t),r.triggerHandler("blur")),r.unbind("blur",i)},1)}}),e.extend(e.simulate.prototype,{simulateDrag:function(){var e=0,t=this.target,n=this.options,r=i(t),s=Math.floor(r.x),o=Math.floor(r.y),u=n.dx||0,a=n.dy||0,f=n.moves||3,l={clientX:s,clientY:o};this.simulateEvent(t,"mousedown",l);for(;eli:last-child{border-radius:0 0 5px 5px;-moz-border-radius:0 0 5px 5px;-webkit-border-bottom-right-radius:5px;-webkit-border-bottom-left-radius:5px}#qunit-tests .fail{color:#000;background-color:#ee5757}#qunit-tests .fail .test-name,#qunit-tests .fail .module-name{color:#000}#qunit-tests .fail .test-actual{color:#ee5757}#qunit-tests .fail .test-expected{color:green}#qunit-banner.qunit-fail{background-color:#ee5757}#qunit-testresult{padding:.5em .5em .5em 2.5em;color:#2b81af;background-color:#d2e0e6;border-bottom:1px solid white}#qunit-testresult .module-name{font-weight:bold}#qunit-fixture{position:absolute;top:-10000px;left:-10000px;width:1000px;height:1000px} 11 | -------------------------------------------------------------------------------- /resources/qunit-1.12.0.min.js: -------------------------------------------------------------------------------- 1 | /** 2 | * QUnit v1.12.0 - A JavaScript Unit Testing Framework 3 | * 4 | * http://qunitjs.com 5 | * 6 | * Copyright 2013 jQuery Foundation and other contributors 7 | * Released under the MIT license. 8 | * https://jquery.org/license/ 9 | */ 10 | (function(j){var D,f,G,i,u=0,H=(g(0)||"").replace(/(:\d+)+\)?/,"").replace(/.+\//,""),A=Object.prototype.toString,q=Object.prototype.hasOwnProperty,e=j.Date,c=j.setTimeout,d={setTimeout:typeof j.setTimeout!=="undefined",sessionStorage:(function(){var J="qunit-test-string";try{sessionStorage.setItem(J,J);sessionStorage.removeItem(J);return true}catch(K){return false}}())},I=function(K){var J,M,L=K.toString();if(L.substring(0,7)==="[object"){J=K.name?K.name.toString():"Error";M=K.message?K.message.toString():"";if(J&&M){return J+": "+M}else{if(J){return J}else{if(M){return M}else{return"Error"}}}}else{return L}},k=function(L){var J,M,K=D.is("array",L)?[]:{};for(J in L){if(q.call(L,J)){M=L[J];K[J]=M===Object(M)?k(M):M}}return K};function b(J){F(this,J);this.assertions=[];this.testNumber=++b.count}b.count=0;b.prototype={init:function(){var L,K,J,M=v("qunit-tests");if(M){K=document.createElement("strong");K.innerHTML=this.nameHtml;L=document.createElement("a");L.innerHTML="Rerun";L.href=D.url({testNumber:this.testNumber});J=document.createElement("li");J.appendChild(K);J.appendChild(L);J.className="running";J.id=this.id="qunit-test-output"+u++;M.appendChild(J)}},setup:function(){if(this.module!==G.previousModule||!q.call(G,"previousModule")){if(q.call(G,"previousModule")){B("moduleDone",D,{name:G.previousModule,failed:G.moduleStats.bad,passed:G.moduleStats.all-G.moduleStats.bad,total:G.moduleStats.all})}G.previousModule=this.module;G.moduleStats={all:0,bad:0};B("moduleStart",D,{name:this.module})}G.current=this;this.testEnvironment=F({setup:function(){},teardown:function(){}},this.moduleTestEnvironment);this.started=+new e();B("testStart",D,{name:this.testName,module:this.module});D.current_testEnvironment=this.testEnvironment;if(!G.pollution){C()}if(G.notrycatch){this.testEnvironment.setup.call(this.testEnvironment,D.assert);return}try{this.testEnvironment.setup.call(this.testEnvironment,D.assert)}catch(J){D.pushFailure("Setup failed on "+this.testName+": "+(J.message||J),s(J,1))}},run:function(){G.current=this;var J=v("qunit-testresult");if(J){J.innerHTML="Running:
"+this.nameHtml}if(this.async){D.stop()}this.callbackStarted=+new e();if(G.notrycatch){this.callback.call(this.testEnvironment,D.assert);this.callbackRuntime=+new e()-this.callbackStarted;return}try{this.callback.call(this.testEnvironment,D.assert);this.callbackRuntime=+new e()-this.callbackStarted}catch(K){this.callbackRuntime=+new e()-this.callbackStarted;D.pushFailure("Died on test #"+(this.assertions.length+1)+" "+this.stack+": "+(K.message||K),s(K,0));C();if(G.blocking){D.start()}}},teardown:function(){G.current=this;if(G.notrycatch){if(typeof this.callbackRuntime==="undefined"){this.callbackRuntime=+new e()-this.callbackStarted}this.testEnvironment.teardown.call(this.testEnvironment,D.assert);return}else{try{this.testEnvironment.teardown.call(this.testEnvironment,D.assert)}catch(J){D.pushFailure("Teardown failed on "+this.testName+": "+(J.message||J),s(J,1))}}p()},finish:function(){G.current=this;if(G.requireExpects&&this.expected===null){D.pushFailure("Expected number of assertions to be defined, but expect() was not called.",this.stack)}else{if(this.expected!==null&&this.expected!==this.assertions.length){D.pushFailure("Expected "+this.expected+" assertions, but "+this.assertions.length+" were run",this.stack)}else{if(this.expected===null&&!this.assertions.length){D.pushFailure("Expected at least one assertion, but none were run - call expect(0) to accept zero assertions.",this.stack)}}}var N,T,R,Q,L,S,P,O=this,M=0,K=0,J=v("qunit-tests");this.runtime=+new e()-this.started;G.stats.all+=this.assertions.length;G.moduleStats.all+=this.assertions.length;if(J){P=document.createElement("ol");P.className="qunit-assert-list";for(N=0;N("+K+", "+M+", "+this.assertions.length+")";z(Q,"click",function(){var U=Q.parentNode.lastChild,V=a(U,"qunit-collapsed");(V?o:m)(U,"qunit-collapsed")});z(Q,"dblclick",function(V){var U=V&&V.target?V.target:j.event.srcElement;if(U.nodeName.toLowerCase()==="span"||U.nodeName.toLowerCase()==="b"){U=U.parentNode}if(j.location&&U.nodeName.toLowerCase()==="strong"){j.location=D.url({testNumber:O.testNumber})}});L=document.createElement("span");L.className="runtime";L.innerHTML=this.runtime+" ms";S=v(this.id);S.className=K?"fail":"pass";S.removeChild(S.firstChild);R=S.firstChild;S.appendChild(Q);S.appendChild(R);S.appendChild(L);S.appendChild(P)}else{for(N=0;N";if(arguments.length===2){O=M;M=null}if(G.currentModule){L=""+w(G.currentModule)+": "+L}N=new b({nameHtml:L,testName:J,expected:M,async:K,callback:O,module:G.currentModule,moduleTestEnvironment:G.currentModuleTestEnvironment,stack:g(2)});if(!h(N)){return}N.queue()},expect:function(J){if(arguments.length===1){G.current.expected=J}else{return G.current.expected}},start:function(J){if(G.semaphore===undefined){D.begin(function(){c(function(){D.start(J)})});return}G.semaphore-=J||1;if(G.semaphore>0){return}if(G.semaphore<0){G.semaphore=0;D.pushFailure("Called start() while already started (QUnit.config.semaphore was 0 already)",null,g(2));return}if(d.setTimeout){c(function(){if(G.semaphore>0){return}if(G.timeout){clearTimeout(G.timeout)}G.blocking=false;r(true)},13)}else{G.blocking=false;r(true)}},stop:function(J){G.semaphore+=J||1;G.blocking=true;if(G.testTimeout&&d.setTimeout){clearTimeout(G.timeout);G.timeout=c(function(){D.ok(false,"Test timed out");G.semaphore=1;D.start()},G.testTimeout)}}};f={ok:function(J,M){if(!G.current){throw new Error("ok() assertion outside test context, was "+g(2))}J=!!J;M=M||(J?"okay":"failed");var L,K={module:G.current.module,name:G.current.testName,result:J,message:M};M=""+w(M)+"";if(!J){L=g(2);if(L){K.source=L;M+="
Source: 
"+w(L)+"
"}}B("log",D,K);G.current.assertions.push({result:J,message:M})},equal:function(L,K,J){D.push(K==L,L,K,J)},notEqual:function(L,K,J){D.push(K!=L,L,K,J)},propEqual:function(L,K,J){L=k(L);K=k(K);D.push(D.equiv(L,K),L,K,J)},notPropEqual:function(L,K,J){L=k(L);K=k(K);D.push(!D.equiv(L,K),L,K,J)},deepEqual:function(L,K,J){D.push(D.equiv(L,K),L,K,J)},notDeepEqual:function(L,K,J){D.push(!D.equiv(L,K),L,K,J)},strictEqual:function(L,K,J){D.push(K===L,L,K,J)},notStrictEqual:function(L,K,J){D.push(K!==L,L,K,J)},"throws":function(N,L,K){var P,O=L,J=false;if(typeof L==="string"){K=L;L=null}G.current.ignoreGlobalErrors=true;try{N.call(G.current.testEnvironment)}catch(M){P=M}G.current.ignoreGlobalErrors=false;if(P){if(!L){J=true;O=null}else{if(D.objectType(L)==="regexp"){J=L.test(I(P))}else{if(P instanceof L){J=true}else{if(L.call({},P)===true){O=null;J=true}}}}D.push(J,P,O,K)}else{D.pushFailure(K,null,"No exception was thrown.")}}};F(D,f);D.raises=f["throws"];D.equals=function(){D.push(false,false,false,"QUnit.equals has been deprecated since 2009 (e88049a0), use QUnit.equal instead")};D.same=function(){D.push(false,false,false,"QUnit.same has been deprecated since 2009 (e88049a0), use QUnit.deepEqual instead")};(function(){function J(){}J.prototype=D;D=new J();D.constructor=J}());G={queue:[],blocking:true,hidepassed:false,reorder:true,altertitle:true,requireExpects:false,urlConfig:[{id:"noglobals",label:"Check for Globals",tooltip:"Enabling this will test if any test introduces new properties on the `window` object. Stored as query-strings."},{id:"notrycatch",label:"No try-catch",tooltip:"Enabling this will run tests outside of a try-catch block. Makes debugging exceptions in IE reasonable. Stored as query-strings."}],modules:{},begin:[],done:[],log:[],testStart:[],testDone:[],moduleStart:[],moduleDone:[]};if(typeof exports==="undefined"){F(j,D.constructor.prototype);j.QUnit=D}(function(){var L,J=j.location||{search:"",protocol:"file:"},O=J.search.slice(1).split("&"),M=O.length,K={},N;if(O[0]){for(L=0;L"+w(document.title)+"

    "}M=v("qunit-tests");K=v("qunit-banner");J=v("qunit-testresult");if(M){M.innerHTML=""}if(K){K.className=""}if(J){J.parentNode.removeChild(J)}if(M){J=document.createElement("p");J.id="qunit-testresult";J.className="result";M.parentNode.insertBefore(J,M);J.innerHTML="Running...
     "}},reset:function(){var J=v("qunit-fixture");if(J){J.innerHTML=G.fixture}},triggerEvent:function(L,J,K){if(document.createEvent){K=document.createEvent("MouseEvents");K.initMouseEvent(J,true,true,L.ownerDocument.defaultView,0,0,0,0,0,false,false,false,false,0,null);L.dispatchEvent(K)}else{if(L.fireEvent){L.fireEvent("on"+J)}}},is:function(J,K){return D.objectType(K)===J},objectType:function(L){if(typeof L==="undefined"){return"undefined"}if(L===null){return"null"}var J=A.call(L).match(/^\[object\s(.*)\]$/),K=J&&J[1]||"";switch(K){case"Number":if(isNaN(L)){return"nan"}return"number";case"String":case"Boolean":case"Array":case"Date":case"RegExp":case"Function":return K.toLowerCase()}if(typeof L==="object"){return"object"}return undefined},push:function(J,P,N,M){if(!G.current){throw new Error("assertion outside test context, was "+g())}var K,O,L={module:G.current.module,name:G.current.testName,result:J,message:M,actual:P,expected:N};M=w(M)||(J?"okay":"failed");M=""+M+"";K=M;if(!J){N=w(D.jsDump.parse(N));P=w(D.jsDump.parse(P));K+="";if(P!==N){K+="";K+=""}O=g();if(O){L.source=O;K+=""}K+="
    Expected: 
    "+N+"
    Result: 
    "+P+"
    Diff: 
    "+D.diff(N,P)+"
    Source: 
    "+w(O)+"
    "}B("log",D,L);G.current.assertions.push({result:!!J,message:K})},pushFailure:function(L,M,N){if(!G.current){throw new Error("pushFailure() assertion outside test context, was "+g(2))}var J,K={module:G.current.module,name:G.current.testName,result:false,message:L};L=w(L)||"error";L=""+L+"";J=L;J+="";if(N){J+=""}if(M){K.source=M;J+=""}J+="
    Result: 
    "+w(N)+"
    Source: 
    "+w(M)+"
    ";B("log",D,K);G.current.assertions.push({result:false,message:J})},url:function(L){L=F(F({},D.urlParams),L);var K,J="?";for(K in L){if(q.call(L,K)){J+=encodeURIComponent(K)+"="+encodeURIComponent(L[K])+"&"}}return j.location.protocol+"//"+j.location.host+j.location.pathname+J.slice(0,-1)},extend:F,id:v,addEvent:z,addClass:m,hasClass:a,removeClass:o});F(D.constructor.prototype,{begin:x("begin"),done:x("done"),log:x("log"),testStart:x("testStart"),testDone:x("testDone"),moduleStart:x("moduleStart"),moduleDone:x("moduleDone")});if(typeof document==="undefined"||document.readyState==="complete"){G.autorun=true}D.load=function(){B("begin",D,{});var Z,P,U,O,V,M,Q,R,X,aa,K,S,Y,L=0,J=[],T="",N="",W=F({},G);D.init();F(G,W);G.blocking=false;V=G.urlConfig.length;for(U=0;U"}for(U in G.modules){if(G.modules.hasOwnProperty(U)){J.push(U)}}L=J.length;J.sort(function(ac,ab){return ac.localeCompare(ab)});T+="";X=v("qunit-userAgent");if(X){X.innerHTML=navigator.userAgent}Z=v("qunit-header");if(Z){Z.innerHTML=""+Z.innerHTML+" "}R=v("qunit-testrunner-toolbar");if(R){P=document.createElement("input");P.type="checkbox";P.id="qunit-filter-pass";z(P,"click",function(){var ac,ab=document.getElementById("qunit-tests");if(P.checked){ab.className=ab.className+" hidepass"}else{ac=" "+ab.className.replace(/[\n\t\r]/g," ")+" ";ab.className=ac.replace(/ hidepass /," ")}if(d.sessionStorage){if(P.checked){sessionStorage.setItem("qunit-filter-passed-tests","true")}else{sessionStorage.removeItem("qunit-filter-passed-tests")}}});if(G.hidepassed||d.sessionStorage&&sessionStorage.getItem("qunit-filter-passed-tests")){P.checked=true;Q=document.getElementById("qunit-tests");Q.className=Q.className+" hidepass"}R.appendChild(P);O=document.createElement("label");O.setAttribute("for","qunit-filter-pass");O.setAttribute("title","Only show tests and assertions that fail. Stored in sessionStorage.");O.innerHTML="Hide passed tests";R.appendChild(O);K=document.createElement("span");K.innerHTML=N;S=K.getElementsByTagName("input");y(S,"click",function(ab){var ad={},ac=ab.target||ab.srcElement;ad[ac.name]=ac.checked?true:undefined;j.location=D.url(ad)});R.appendChild(K);if(L>1){Y=document.createElement("span");Y.setAttribute("id","qunit-modulefilter-container");Y.innerHTML=T;z(Y.lastChild,"change",function(){var ac=Y.getElementsByTagName("select")[0],ab=decodeURIComponent(ac.options[ac.selectedIndex].value);j.location=D.url({module:(ab==="")?undefined:ab,filter:undefined,testNumber:undefined})});R.appendChild(Y)}}M=v("qunit-fixture");if(M){G.fixture=M.innerHTML}if(G.autostart){D.start()}};z(j,"load",D.load);i=j.onerror;j.onerror=function(L,M,J){var K=false;if(i){K=i(L,M,J)}if(K!==true){if(D.config.current){if(D.config.current.ignoreGlobalErrors){return true}D.pushFailure(L,M+":"+J)}else{D.test("global failure",F(function(){D.pushFailure(L,M+":"+J)},{validTest:h}))}return false}return K};function t(){G.autorun=true;if(G.currentModule){B("moduleDone",D,{name:G.currentModule,failed:G.moduleStats.bad,passed:G.moduleStats.all-G.moduleStats.bad,total:G.moduleStats.all})}delete G.previousModule;var M,L,J=v("qunit-banner"),N=v("qunit-tests"),O=+new e()-G.started,P=G.stats.all-G.stats.bad,K=["Tests completed in ",O," milliseconds.
    ","",P," assertions of ",G.stats.all," passed, ",G.stats.bad," failed."].join("");if(J){J.className=(G.stats.bad?"qunit-fail":"qunit-pass")}if(N){v("qunit-testresult").innerHTML=K}if(G.altertitle&&typeof document!=="undefined"&&document.title){document.title=[(G.stats.bad?"\u2716":"\u2714"),document.title.replace(/^[\u2714\u2716] /i,"")].join(" ")}if(G.reorder&&d.sessionStorage&&G.stats.bad===0){for(M=0;M&]/g,function(K){switch(K){case"'":return"'";case'"':return""";case"<":return"<";case">":return">";case"&":return"&"}})}function l(K,J){G.queue.push(K);if(G.autorun&&!G.blocking){r(J)}}function r(K){function J(){r(K)}var L=new e().getTime();G.depth=G.depth?G.depth+1:1;while(G.queue.length&&!G.blocking){if(!d.setTimeout||G.updateRate<=0||((new e().getTime()-L)0){D.pushFailure("Introduced global variable(s): "+K.join(", "))}L=n(J,G.pollution);if(L.length>0){D.pushFailure("Deleted global variable(s): "+L.join(", "))}}function n(L,K){var N,M,J=L.slice();for(N=0;N-1}function m(K,J){if(!a(K,J)){K.className+=(K.className?" ":"")+J}}function o(K,J){var L=" "+K.className+" ";while(L.indexOf(" "+J+" ")>-1){L=L.replace(" "+J+" "," ")}K.className=typeof L.trim==="function"?L.trim():L.replace(/^\s+|\s+$/g,"")}function v(J){return !!(typeof document!=="undefined"&&document&&document.getElementById)&&document.getElementById(J)}function x(J){return function(K){G[J].push(K)}}function B(L,M,J){var K,N;if(D.hasOwnProperty(L)){D[L].call(M,J)}else{N=G[L];for(K=0;K":"\n":this.HTML?" ":" "},indent:function(P){if(!this.multiline){return""}var Q=this.indentChar;if(this.HTML){Q=Q.replace(/\t/g," ").replace(/ /g," ")}return new Array(this.depth+(P||0)).join(Q)},up:function(P){this.depth+=P||1},down:function(P){this.depth-=P||1},setParser:function(P,Q){this.parsers[P]=Q},quote:J,literal:K,join:M,depth:1,parsers:{window:"[Window]",document:"[Document]",error:function(P){return'Error("'+P.message+'")'},unknown:"[Unknown]","null":"null","undefined":"undefined","function":function(R){var Q="function",P="name" in R?R.name:(N.exec(R)||[])[1];if(P){Q+=" "+P}Q+="( ";Q=[Q,D.jsDump.parse(R,"functionArgs"),"){"].join("");return M(Q,D.jsDump.parse(R,"functionCode"),"}")},array:O,nodelist:O,"arguments":O,object:function(U,P){var Q=[],T,S,V,R;D.jsDump.up();T=[];for(S in U){T.push(S)}T.sort();for(R=0;R",X=Q.nodeName.toLowerCase(),U=S+X,V=Q.attributes;if(V){for(R=0,T=V.length;R0;K--){if(O[K].text!=null&&O[K-1].text==null&&O[K].row>0&&N[O[K].row-1].text==null&&O[K-1]==N[O[K].row-1]){O[K-1]={text:O[K-1],row:O[K].row-1};N[O[K].row-1]={text:N[O[K].row-1],row:K-1}}}return{o:N,n:O}}return function(Q,R){Q=Q.replace(/\s+$/,"");R=R.replace(/\s+$/,"");var N,O,P="",L=J(Q===""?[]:Q.split(/\s+/),R===""?[]:R.split(/\s+/)),K=Q.match(/\s+/g),M=R.match(/\s+/g);if(K==null){K=[" "]}else{K.push(" ")}if(M==null){M=[" "]}else{M.push(" ")}if(L.n.length===0){for(N=0;N"+L.o[N]+K[N]+""}}else{if(L.n[0].text==null){for(R=0;R"+L.o[R]+K[R]+""}}for(N=0;N"+L.n[N]+M[N]+""}else{O="";for(R=L.n[N].row+1;R"+L.o[R]+K[R]+""}P+=" "+L.n[N].text+M[N]+O}}}return P}}());if(typeof exports!=="undefined"){F(exports,D.constructor.prototype)}}((function(){return this}.call()))); 11 | -------------------------------------------------------------------------------- /resources/qunit-1.13.0.css: -------------------------------------------------------------------------------- 1 | /*! 2 | * QUnit 1.13.0 3 | * http://qunitjs.com/ 4 | * 5 | * Copyright 2013 jQuery Foundation and other contributors 6 | * Released under the MIT license 7 | * http://jquery.org/license 8 | * 9 | * Date: 2014-01-04T17:09Z 10 | */ 11 | 12 | /** Font Family and Sizes */ 13 | 14 | #qunit-tests, #qunit-header, #qunit-banner, #qunit-testrunner-toolbar, #qunit-userAgent, #qunit-testresult { 15 | font-family: "Helvetica Neue Light", "HelveticaNeue-Light", "Helvetica Neue", Calibri, Helvetica, Arial, sans-serif; 16 | } 17 | 18 | #qunit-testrunner-toolbar, #qunit-userAgent, #qunit-testresult, #qunit-tests li { font-size: small; } 19 | #qunit-tests { font-size: smaller; } 20 | 21 | 22 | /** Resets */ 23 | 24 | #qunit-tests, #qunit-header, #qunit-banner, #qunit-userAgent, #qunit-testresult, #qunit-modulefilter { 25 | margin: 0; 26 | padding: 0; 27 | } 28 | 29 | 30 | /** Header */ 31 | 32 | #qunit-header { 33 | padding: 0.5em 0 0.5em 1em; 34 | 35 | color: #8699a4; 36 | background-color: #0d3349; 37 | 38 | font-size: 1.5em; 39 | line-height: 1em; 40 | font-weight: normal; 41 | 42 | border-radius: 5px 5px 0 0; 43 | -moz-border-radius: 5px 5px 0 0; 44 | -webkit-border-top-right-radius: 5px; 45 | -webkit-border-top-left-radius: 5px; 46 | } 47 | 48 | #qunit-header a { 49 | text-decoration: none; 50 | color: #c2ccd1; 51 | } 52 | 53 | #qunit-header a:hover, 54 | #qunit-header a:focus { 55 | color: #fff; 56 | } 57 | 58 | #qunit-testrunner-toolbar label { 59 | display: inline-block; 60 | padding: 0 .5em 0 .1em; 61 | } 62 | 63 | #qunit-banner { 64 | height: 5px; 65 | } 66 | 67 | #qunit-testrunner-toolbar { 68 | padding: 0.5em 0 0.5em 2em; 69 | color: #5E740B; 70 | background-color: #eee; 71 | overflow: hidden; 72 | } 73 | 74 | #qunit-userAgent { 75 | padding: 0.5em 0 0.5em 2.5em; 76 | background-color: #2b81af; 77 | color: #fff; 78 | text-shadow: rgba(0, 0, 0, 0.5) 2px 2px 1px; 79 | } 80 | 81 | #qunit-modulefilter-container { 82 | float: right; 83 | } 84 | 85 | /** Tests: Pass/Fail */ 86 | 87 | #qunit-tests { 88 | list-style-position: inside; 89 | } 90 | 91 | #qunit-tests li { 92 | padding: 0.4em 0.5em 0.4em 2.5em; 93 | border-bottom: 1px solid #fff; 94 | list-style-position: inside; 95 | } 96 | 97 | #qunit-tests.hidepass li.pass, #qunit-tests.hidepass li.running { 98 | display: none; 99 | } 100 | 101 | #qunit-tests li strong { 102 | cursor: pointer; 103 | } 104 | 105 | #qunit-tests li a { 106 | padding: 0.5em; 107 | color: #c2ccd1; 108 | text-decoration: none; 109 | } 110 | #qunit-tests li a:hover, 111 | #qunit-tests li a:focus { 112 | color: #000; 113 | } 114 | 115 | #qunit-tests li .runtime { 116 | float: right; 117 | font-size: smaller; 118 | } 119 | 120 | .qunit-assert-list { 121 | margin-top: 0.5em; 122 | padding: 0.5em; 123 | 124 | background-color: #fff; 125 | 126 | border-radius: 5px; 127 | -moz-border-radius: 5px; 128 | -webkit-border-radius: 5px; 129 | } 130 | 131 | .qunit-collapsed { 132 | display: none; 133 | } 134 | 135 | #qunit-tests table { 136 | border-collapse: collapse; 137 | margin-top: .2em; 138 | } 139 | 140 | #qunit-tests th { 141 | text-align: right; 142 | vertical-align: top; 143 | padding: 0 .5em 0 0; 144 | } 145 | 146 | #qunit-tests td { 147 | vertical-align: top; 148 | } 149 | 150 | #qunit-tests pre { 151 | margin: 0; 152 | white-space: pre-wrap; 153 | word-wrap: break-word; 154 | } 155 | 156 | #qunit-tests del { 157 | background-color: #e0f2be; 158 | color: #374e0c; 159 | text-decoration: none; 160 | } 161 | 162 | #qunit-tests ins { 163 | background-color: #ffcaca; 164 | color: #500; 165 | text-decoration: none; 166 | } 167 | 168 | /*** Test Counts */ 169 | 170 | #qunit-tests b.counts { color: black; } 171 | #qunit-tests b.passed { color: #5E740B; } 172 | #qunit-tests b.failed { color: #710909; } 173 | 174 | #qunit-tests li li { 175 | padding: 5px; 176 | background-color: #fff; 177 | border-bottom: none; 178 | list-style-position: inside; 179 | } 180 | 181 | /*** Passing Styles */ 182 | 183 | #qunit-tests li li.pass { 184 | color: #3c510c; 185 | background-color: #fff; 186 | border-left: 10px solid #C6E746; 187 | } 188 | 189 | #qunit-tests .pass { color: #528CE0; background-color: #D2E0E6; } 190 | #qunit-tests .pass .test-name { color: #366097; } 191 | 192 | #qunit-tests .pass .test-actual, 193 | #qunit-tests .pass .test-expected { color: #999999; } 194 | 195 | #qunit-banner.qunit-pass { background-color: #C6E746; } 196 | 197 | /*** Failing Styles */ 198 | 199 | #qunit-tests li li.fail { 200 | color: #710909; 201 | background-color: #fff; 202 | border-left: 10px solid #EE5757; 203 | white-space: pre; 204 | } 205 | 206 | #qunit-tests > li:last-child { 207 | border-radius: 0 0 5px 5px; 208 | -moz-border-radius: 0 0 5px 5px; 209 | -webkit-border-bottom-right-radius: 5px; 210 | -webkit-border-bottom-left-radius: 5px; 211 | } 212 | 213 | #qunit-tests .fail { color: #000000; background-color: #EE5757; } 214 | #qunit-tests .fail .test-name, 215 | #qunit-tests .fail .module-name { color: #000000; } 216 | 217 | #qunit-tests .fail .test-actual { color: #EE5757; } 218 | #qunit-tests .fail .test-expected { color: green; } 219 | 220 | #qunit-banner.qunit-fail { background-color: #EE5757; } 221 | 222 | 223 | /** Result */ 224 | 225 | #qunit-testresult { 226 | padding: 0.5em 0.5em 0.5em 2.5em; 227 | 228 | color: #2b81af; 229 | background-color: #D2E0E6; 230 | 231 | border-bottom: 1px solid white; 232 | } 233 | #qunit-testresult .module-name { 234 | font-weight: bold; 235 | } 236 | 237 | /** Fixture */ 238 | 239 | #qunit-fixture { 240 | position: absolute; 241 | top: -10000px; 242 | left: -10000px; 243 | width: 1000px; 244 | height: 1000px; 245 | } 246 | -------------------------------------------------------------------------------- /resources/qunit-1.13.0.js: -------------------------------------------------------------------------------- 1 | /*! 2 | * QUnit 1.13.0 3 | * http://qunitjs.com/ 4 | * 5 | * Copyright 2013 jQuery Foundation and other contributors 6 | * Released under the MIT license 7 | * http://jquery.org/license 8 | * 9 | * Date: 2014-01-04T17:09Z 10 | */ 11 | 12 | (function( window ) { 13 | 14 | var QUnit, 15 | assert, 16 | config, 17 | onErrorFnPrev, 18 | testId = 0, 19 | fileName = (sourceFromStacktrace( 0 ) || "" ).replace(/(:\d+)+\)?/, "").replace(/.+\//, ""), 20 | toString = Object.prototype.toString, 21 | hasOwn = Object.prototype.hasOwnProperty, 22 | // Keep a local reference to Date (GH-283) 23 | Date = window.Date, 24 | setTimeout = window.setTimeout, 25 | defined = { 26 | document: typeof window.document !== "undefined", 27 | setTimeout: typeof window.setTimeout !== "undefined", 28 | sessionStorage: (function() { 29 | var x = "qunit-test-string"; 30 | try { 31 | sessionStorage.setItem( x, x ); 32 | sessionStorage.removeItem( x ); 33 | return true; 34 | } catch( e ) { 35 | return false; 36 | } 37 | }()) 38 | }, 39 | /** 40 | * Provides a normalized error string, correcting an issue 41 | * with IE 7 (and prior) where Error.prototype.toString is 42 | * not properly implemented 43 | * 44 | * Based on http://es5.github.com/#x15.11.4.4 45 | * 46 | * @param {String|Error} error 47 | * @return {String} error message 48 | */ 49 | errorString = function( error ) { 50 | var name, message, 51 | errorString = error.toString(); 52 | if ( errorString.substring( 0, 7 ) === "[object" ) { 53 | name = error.name ? error.name.toString() : "Error"; 54 | message = error.message ? error.message.toString() : ""; 55 | if ( name && message ) { 56 | return name + ": " + message; 57 | } else if ( name ) { 58 | return name; 59 | } else if ( message ) { 60 | return message; 61 | } else { 62 | return "Error"; 63 | } 64 | } else { 65 | return errorString; 66 | } 67 | }, 68 | /** 69 | * Makes a clone of an object using only Array or Object as base, 70 | * and copies over the own enumerable properties. 71 | * 72 | * @param {Object} obj 73 | * @return {Object} New object with only the own properties (recursively). 74 | */ 75 | objectValues = function( obj ) { 76 | // Grunt 0.3.x uses an older version of jshint that still has jshint/jshint#392. 77 | /*jshint newcap: false */ 78 | var key, val, 79 | vals = QUnit.is( "array", obj ) ? [] : {}; 80 | for ( key in obj ) { 81 | if ( hasOwn.call( obj, key ) ) { 82 | val = obj[key]; 83 | vals[key] = val === Object(val) ? objectValues(val) : val; 84 | } 85 | } 86 | return vals; 87 | }; 88 | 89 | 90 | // Root QUnit object. 91 | // `QUnit` initialized at top of scope 92 | QUnit = { 93 | 94 | // call on start of module test to prepend name to all tests 95 | module: function( name, testEnvironment ) { 96 | config.currentModule = name; 97 | config.currentModuleTestEnvironment = testEnvironment; 98 | config.modules[name] = true; 99 | }, 100 | 101 | asyncTest: function( testName, expected, callback ) { 102 | if ( arguments.length === 2 ) { 103 | callback = expected; 104 | expected = null; 105 | } 106 | 107 | QUnit.test( testName, expected, callback, true ); 108 | }, 109 | 110 | test: function( testName, expected, callback, async ) { 111 | var test, 112 | nameHtml = "" + escapeText( testName ) + ""; 113 | 114 | if ( arguments.length === 2 ) { 115 | callback = expected; 116 | expected = null; 117 | } 118 | 119 | if ( config.currentModule ) { 120 | nameHtml = "" + escapeText( config.currentModule ) + ": " + nameHtml; 121 | } 122 | 123 | test = new Test({ 124 | nameHtml: nameHtml, 125 | testName: testName, 126 | expected: expected, 127 | async: async, 128 | callback: callback, 129 | module: config.currentModule, 130 | moduleTestEnvironment: config.currentModuleTestEnvironment, 131 | stack: sourceFromStacktrace( 2 ) 132 | }); 133 | 134 | if ( !validTest( test ) ) { 135 | return; 136 | } 137 | 138 | test.queue(); 139 | }, 140 | 141 | // Specify the number of expected assertions to guarantee that failed test (no assertions are run at all) don't slip through. 142 | expect: function( asserts ) { 143 | if (arguments.length === 1) { 144 | config.current.expected = asserts; 145 | } else { 146 | return config.current.expected; 147 | } 148 | }, 149 | 150 | start: function( count ) { 151 | // QUnit hasn't been initialized yet. 152 | // Note: RequireJS (et al) may delay onLoad 153 | if ( config.semaphore === undefined ) { 154 | QUnit.begin(function() { 155 | // This is triggered at the top of QUnit.load, push start() to the event loop, to allow QUnit.load to finish first 156 | setTimeout(function() { 157 | QUnit.start( count ); 158 | }); 159 | }); 160 | return; 161 | } 162 | 163 | config.semaphore -= count || 1; 164 | // don't start until equal number of stop-calls 165 | if ( config.semaphore > 0 ) { 166 | return; 167 | } 168 | // ignore if start is called more often then stop 169 | if ( config.semaphore < 0 ) { 170 | config.semaphore = 0; 171 | QUnit.pushFailure( "Called start() while already started (QUnit.config.semaphore was 0 already)", null, sourceFromStacktrace(2) ); 172 | return; 173 | } 174 | // A slight delay, to avoid any current callbacks 175 | if ( defined.setTimeout ) { 176 | setTimeout(function() { 177 | if ( config.semaphore > 0 ) { 178 | return; 179 | } 180 | if ( config.timeout ) { 181 | clearTimeout( config.timeout ); 182 | } 183 | 184 | config.blocking = false; 185 | process( true ); 186 | }, 13); 187 | } else { 188 | config.blocking = false; 189 | process( true ); 190 | } 191 | }, 192 | 193 | stop: function( count ) { 194 | config.semaphore += count || 1; 195 | config.blocking = true; 196 | 197 | if ( config.testTimeout && defined.setTimeout ) { 198 | clearTimeout( config.timeout ); 199 | config.timeout = setTimeout(function() { 200 | QUnit.ok( false, "Test timed out" ); 201 | config.semaphore = 1; 202 | QUnit.start(); 203 | }, config.testTimeout ); 204 | } 205 | } 206 | }; 207 | 208 | // We use the prototype to distinguish between properties that should 209 | // be exposed as globals (and in exports) and those that shouldn't 210 | (function() { 211 | function F() {} 212 | F.prototype = QUnit; 213 | QUnit = new F(); 214 | // Make F QUnit's constructor so that we can add to the prototype later 215 | QUnit.constructor = F; 216 | }()); 217 | 218 | /** 219 | * Config object: Maintain internal state 220 | * Later exposed as QUnit.config 221 | * `config` initialized at top of scope 222 | */ 223 | config = { 224 | // The queue of tests to run 225 | queue: [], 226 | 227 | // block until document ready 228 | blocking: true, 229 | 230 | // when enabled, show only failing tests 231 | // gets persisted through sessionStorage and can be changed in UI via checkbox 232 | hidepassed: false, 233 | 234 | // by default, run previously failed tests first 235 | // very useful in combination with "Hide passed tests" checked 236 | reorder: true, 237 | 238 | // by default, modify document.title when suite is done 239 | altertitle: true, 240 | 241 | // when enabled, all tests must call expect() 242 | requireExpects: false, 243 | 244 | // add checkboxes that are persisted in the query-string 245 | // when enabled, the id is set to `true` as a `QUnit.config` property 246 | urlConfig: [ 247 | { 248 | id: "noglobals", 249 | label: "Check for Globals", 250 | tooltip: "Enabling this will test if any test introduces new properties on the `window` object. Stored as query-strings." 251 | }, 252 | { 253 | id: "notrycatch", 254 | label: "No try-catch", 255 | tooltip: "Enabling this will run tests outside of a try-catch block. Makes debugging exceptions in IE reasonable. Stored as query-strings." 256 | } 257 | ], 258 | 259 | // Set of all modules. 260 | modules: {}, 261 | 262 | // logging callback queues 263 | begin: [], 264 | done: [], 265 | log: [], 266 | testStart: [], 267 | testDone: [], 268 | moduleStart: [], 269 | moduleDone: [] 270 | }; 271 | 272 | // Initialize more QUnit.config and QUnit.urlParams 273 | (function() { 274 | var i, 275 | location = window.location || { search: "", protocol: "file:" }, 276 | params = location.search.slice( 1 ).split( "&" ), 277 | length = params.length, 278 | urlParams = {}, 279 | current; 280 | 281 | if ( params[ 0 ] ) { 282 | for ( i = 0; i < length; i++ ) { 283 | current = params[ i ].split( "=" ); 284 | current[ 0 ] = decodeURIComponent( current[ 0 ] ); 285 | // allow just a key to turn on a flag, e.g., test.html?noglobals 286 | current[ 1 ] = current[ 1 ] ? decodeURIComponent( current[ 1 ] ) : true; 287 | urlParams[ current[ 0 ] ] = current[ 1 ]; 288 | } 289 | } 290 | 291 | QUnit.urlParams = urlParams; 292 | 293 | // String search anywhere in moduleName+testName 294 | config.filter = urlParams.filter; 295 | 296 | // Exact match of the module name 297 | config.module = urlParams.module; 298 | 299 | config.testNumber = parseInt( urlParams.testNumber, 10 ) || null; 300 | 301 | // Figure out if we're running the tests from a server or not 302 | QUnit.isLocal = location.protocol === "file:"; 303 | }()); 304 | 305 | extend( QUnit, { 306 | 307 | config: config, 308 | 309 | // Initialize the configuration options 310 | init: function() { 311 | extend( config, { 312 | stats: { all: 0, bad: 0 }, 313 | moduleStats: { all: 0, bad: 0 }, 314 | started: +new Date(), 315 | updateRate: 1000, 316 | blocking: false, 317 | autostart: true, 318 | autorun: false, 319 | filter: "", 320 | queue: [], 321 | semaphore: 1 322 | }); 323 | 324 | var tests, banner, result, 325 | qunit = id( "qunit" ); 326 | 327 | if ( qunit ) { 328 | qunit.innerHTML = 329 | "

    " + escapeText( document.title ) + "

    " + 330 | "

    " + 331 | "
    " + 332 | "

    " + 333 | "
      "; 334 | } 335 | 336 | tests = id( "qunit-tests" ); 337 | banner = id( "qunit-banner" ); 338 | result = id( "qunit-testresult" ); 339 | 340 | if ( tests ) { 341 | tests.innerHTML = ""; 342 | } 343 | 344 | if ( banner ) { 345 | banner.className = ""; 346 | } 347 | 348 | if ( result ) { 349 | result.parentNode.removeChild( result ); 350 | } 351 | 352 | if ( tests ) { 353 | result = document.createElement( "p" ); 354 | result.id = "qunit-testresult"; 355 | result.className = "result"; 356 | tests.parentNode.insertBefore( result, tests ); 357 | result.innerHTML = "Running...
       "; 358 | } 359 | }, 360 | 361 | // Resets the test setup. Useful for tests that modify the DOM. 362 | /* 363 | DEPRECATED: Use multiple tests instead of resetting inside a test. 364 | Use testStart or testDone for custom cleanup. 365 | This method will throw an error in 2.0, and will be removed in 2.1 366 | */ 367 | reset: function() { 368 | var fixture = id( "qunit-fixture" ); 369 | if ( fixture ) { 370 | fixture.innerHTML = config.fixture; 371 | } 372 | }, 373 | 374 | // Safe object type checking 375 | is: function( type, obj ) { 376 | return QUnit.objectType( obj ) === type; 377 | }, 378 | 379 | objectType: function( obj ) { 380 | if ( typeof obj === "undefined" ) { 381 | return "undefined"; 382 | } 383 | 384 | // Consider: typeof null === object 385 | if ( obj === null ) { 386 | return "null"; 387 | } 388 | 389 | var match = toString.call( obj ).match(/^\[object\s(.*)\]$/), 390 | type = match && match[1] || ""; 391 | 392 | switch ( type ) { 393 | case "Number": 394 | if ( isNaN(obj) ) { 395 | return "nan"; 396 | } 397 | return "number"; 398 | case "String": 399 | case "Boolean": 400 | case "Array": 401 | case "Date": 402 | case "RegExp": 403 | case "Function": 404 | return type.toLowerCase(); 405 | } 406 | if ( typeof obj === "object" ) { 407 | return "object"; 408 | } 409 | return undefined; 410 | }, 411 | 412 | push: function( result, actual, expected, message ) { 413 | if ( !config.current ) { 414 | throw new Error( "assertion outside test context, was " + sourceFromStacktrace() ); 415 | } 416 | 417 | var output, source, 418 | details = { 419 | module: config.current.module, 420 | name: config.current.testName, 421 | result: result, 422 | message: message, 423 | actual: actual, 424 | expected: expected 425 | }; 426 | 427 | message = escapeText( message ) || ( result ? "okay" : "failed" ); 428 | message = "" + message + ""; 429 | output = message; 430 | 431 | if ( !result ) { 432 | expected = escapeText( QUnit.jsDump.parse(expected) ); 433 | actual = escapeText( QUnit.jsDump.parse(actual) ); 434 | output += ""; 435 | 436 | if ( actual !== expected ) { 437 | output += ""; 438 | output += ""; 439 | } 440 | 441 | source = sourceFromStacktrace(); 442 | 443 | if ( source ) { 444 | details.source = source; 445 | output += ""; 446 | } 447 | 448 | output += "
      Expected: 
      " + expected + "
      Result: 
      " + actual + "
      Diff: 
      " + QUnit.diff( expected, actual ) + "
      Source: 
      " + escapeText( source ) + "
      "; 449 | } 450 | 451 | runLoggingCallbacks( "log", QUnit, details ); 452 | 453 | config.current.assertions.push({ 454 | result: !!result, 455 | message: output 456 | }); 457 | }, 458 | 459 | pushFailure: function( message, source, actual ) { 460 | if ( !config.current ) { 461 | throw new Error( "pushFailure() assertion outside test context, was " + sourceFromStacktrace(2) ); 462 | } 463 | 464 | var output, 465 | details = { 466 | module: config.current.module, 467 | name: config.current.testName, 468 | result: false, 469 | message: message 470 | }; 471 | 472 | message = escapeText( message ) || "error"; 473 | message = "" + message + ""; 474 | output = message; 475 | 476 | output += ""; 477 | 478 | if ( actual ) { 479 | output += ""; 480 | } 481 | 482 | if ( source ) { 483 | details.source = source; 484 | output += ""; 485 | } 486 | 487 | output += "
      Result: 
      " + escapeText( actual ) + "
      Source: 
      " + escapeText( source ) + "
      "; 488 | 489 | runLoggingCallbacks( "log", QUnit, details ); 490 | 491 | config.current.assertions.push({ 492 | result: false, 493 | message: output 494 | }); 495 | }, 496 | 497 | url: function( params ) { 498 | params = extend( extend( {}, QUnit.urlParams ), params ); 499 | var key, 500 | querystring = "?"; 501 | 502 | for ( key in params ) { 503 | if ( hasOwn.call( params, key ) ) { 504 | querystring += encodeURIComponent( key ) + "=" + 505 | encodeURIComponent( params[ key ] ) + "&"; 506 | } 507 | } 508 | return window.location.protocol + "//" + window.location.host + 509 | window.location.pathname + querystring.slice( 0, -1 ); 510 | }, 511 | 512 | extend: extend, 513 | id: id, 514 | addEvent: addEvent, 515 | addClass: addClass, 516 | hasClass: hasClass, 517 | removeClass: removeClass 518 | // load, equiv, jsDump, diff: Attached later 519 | }); 520 | 521 | /** 522 | * @deprecated: Created for backwards compatibility with test runner that set the hook function 523 | * into QUnit.{hook}, instead of invoking it and passing the hook function. 524 | * QUnit.constructor is set to the empty F() above so that we can add to it's prototype here. 525 | * Doing this allows us to tell if the following methods have been overwritten on the actual 526 | * QUnit object. 527 | */ 528 | extend( QUnit.constructor.prototype, { 529 | 530 | // Logging callbacks; all receive a single argument with the listed properties 531 | // run test/logs.html for any related changes 532 | begin: registerLoggingCallback( "begin" ), 533 | 534 | // done: { failed, passed, total, runtime } 535 | done: registerLoggingCallback( "done" ), 536 | 537 | // log: { result, actual, expected, message } 538 | log: registerLoggingCallback( "log" ), 539 | 540 | // testStart: { name } 541 | testStart: registerLoggingCallback( "testStart" ), 542 | 543 | // testDone: { name, failed, passed, total, runtime } 544 | testDone: registerLoggingCallback( "testDone" ), 545 | 546 | // moduleStart: { name } 547 | moduleStart: registerLoggingCallback( "moduleStart" ), 548 | 549 | // moduleDone: { name, failed, passed, total } 550 | moduleDone: registerLoggingCallback( "moduleDone" ) 551 | }); 552 | 553 | if ( !defined.document || document.readyState === "complete" ) { 554 | config.autorun = true; 555 | } 556 | 557 | QUnit.load = function() { 558 | runLoggingCallbacks( "begin", QUnit, {} ); 559 | 560 | // Initialize the config, saving the execution queue 561 | var banner, filter, i, label, len, main, ol, toolbar, userAgent, val, 562 | urlConfigCheckboxesContainer, urlConfigCheckboxes, moduleFilter, 563 | numModules = 0, 564 | moduleNames = [], 565 | moduleFilterHtml = "", 566 | urlConfigHtml = "", 567 | oldconfig = extend( {}, config ); 568 | 569 | QUnit.init(); 570 | extend(config, oldconfig); 571 | 572 | config.blocking = false; 573 | 574 | len = config.urlConfig.length; 575 | 576 | for ( i = 0; i < len; i++ ) { 577 | val = config.urlConfig[i]; 578 | if ( typeof val === "string" ) { 579 | val = { 580 | id: val, 581 | label: val, 582 | tooltip: "[no tooltip available]" 583 | }; 584 | } 585 | config[ val.id ] = QUnit.urlParams[ val.id ]; 586 | urlConfigHtml += ""; 592 | } 593 | for ( i in config.modules ) { 594 | if ( config.modules.hasOwnProperty( i ) ) { 595 | moduleNames.push(i); 596 | } 597 | } 598 | numModules = moduleNames.length; 599 | moduleNames.sort( function( a, b ) { 600 | return a.localeCompare( b ); 601 | }); 602 | moduleFilterHtml += ""; 613 | 614 | // `userAgent` initialized at top of scope 615 | userAgent = id( "qunit-userAgent" ); 616 | if ( userAgent ) { 617 | userAgent.innerHTML = navigator.userAgent; 618 | } 619 | 620 | // `banner` initialized at top of scope 621 | banner = id( "qunit-header" ); 622 | if ( banner ) { 623 | banner.innerHTML = "" + banner.innerHTML + " "; 624 | } 625 | 626 | // `toolbar` initialized at top of scope 627 | toolbar = id( "qunit-testrunner-toolbar" ); 628 | if ( toolbar ) { 629 | // `filter` initialized at top of scope 630 | filter = document.createElement( "input" ); 631 | filter.type = "checkbox"; 632 | filter.id = "qunit-filter-pass"; 633 | 634 | addEvent( filter, "click", function() { 635 | var tmp, 636 | ol = id( "qunit-tests" ); 637 | 638 | if ( filter.checked ) { 639 | ol.className = ol.className + " hidepass"; 640 | } else { 641 | tmp = " " + ol.className.replace( /[\n\t\r]/g, " " ) + " "; 642 | ol.className = tmp.replace( / hidepass /, " " ); 643 | } 644 | if ( defined.sessionStorage ) { 645 | if (filter.checked) { 646 | sessionStorage.setItem( "qunit-filter-passed-tests", "true" ); 647 | } else { 648 | sessionStorage.removeItem( "qunit-filter-passed-tests" ); 649 | } 650 | } 651 | }); 652 | 653 | if ( config.hidepassed || defined.sessionStorage && sessionStorage.getItem( "qunit-filter-passed-tests" ) ) { 654 | filter.checked = true; 655 | // `ol` initialized at top of scope 656 | ol = id( "qunit-tests" ); 657 | ol.className = ol.className + " hidepass"; 658 | } 659 | toolbar.appendChild( filter ); 660 | 661 | // `label` initialized at top of scope 662 | label = document.createElement( "label" ); 663 | label.setAttribute( "for", "qunit-filter-pass" ); 664 | label.setAttribute( "title", "Only show tests and assertions that fail. Stored in sessionStorage." ); 665 | label.innerHTML = "Hide passed tests"; 666 | toolbar.appendChild( label ); 667 | 668 | urlConfigCheckboxesContainer = document.createElement("span"); 669 | urlConfigCheckboxesContainer.innerHTML = urlConfigHtml; 670 | urlConfigCheckboxes = urlConfigCheckboxesContainer.getElementsByTagName("input"); 671 | // For oldIE support: 672 | // * Add handlers to the individual elements instead of the container 673 | // * Use "click" instead of "change" 674 | // * Fallback from event.target to event.srcElement 675 | addEvents( urlConfigCheckboxes, "click", function( event ) { 676 | var params = {}, 677 | target = event.target || event.srcElement; 678 | params[ target.name ] = target.checked ? true : undefined; 679 | window.location = QUnit.url( params ); 680 | }); 681 | toolbar.appendChild( urlConfigCheckboxesContainer ); 682 | 683 | if (numModules > 1) { 684 | moduleFilter = document.createElement( "span" ); 685 | moduleFilter.setAttribute( "id", "qunit-modulefilter-container" ); 686 | moduleFilter.innerHTML = moduleFilterHtml; 687 | addEvent( moduleFilter.lastChild, "change", function() { 688 | var selectBox = moduleFilter.getElementsByTagName("select")[0], 689 | selectedModule = decodeURIComponent(selectBox.options[selectBox.selectedIndex].value); 690 | 691 | window.location = QUnit.url({ 692 | module: ( selectedModule === "" ) ? undefined : selectedModule, 693 | // Remove any existing filters 694 | filter: undefined, 695 | testNumber: undefined 696 | }); 697 | }); 698 | toolbar.appendChild(moduleFilter); 699 | } 700 | } 701 | 702 | // `main` initialized at top of scope 703 | main = id( "qunit-fixture" ); 704 | if ( main ) { 705 | config.fixture = main.innerHTML; 706 | } 707 | 708 | if ( config.autostart ) { 709 | QUnit.start(); 710 | } 711 | }; 712 | 713 | if ( defined.document ) { 714 | addEvent( window, "load", QUnit.load ); 715 | } 716 | 717 | // `onErrorFnPrev` initialized at top of scope 718 | // Preserve other handlers 719 | onErrorFnPrev = window.onerror; 720 | 721 | // Cover uncaught exceptions 722 | // Returning true will suppress the default browser handler, 723 | // returning false will let it run. 724 | window.onerror = function ( error, filePath, linerNr ) { 725 | var ret = false; 726 | if ( onErrorFnPrev ) { 727 | ret = onErrorFnPrev( error, filePath, linerNr ); 728 | } 729 | 730 | // Treat return value as window.onerror itself does, 731 | // Only do our handling if not suppressed. 732 | if ( ret !== true ) { 733 | if ( QUnit.config.current ) { 734 | if ( QUnit.config.current.ignoreGlobalErrors ) { 735 | return true; 736 | } 737 | QUnit.pushFailure( error, filePath + ":" + linerNr ); 738 | } else { 739 | QUnit.test( "global failure", extend( function() { 740 | QUnit.pushFailure( error, filePath + ":" + linerNr ); 741 | }, { validTest: validTest } ) ); 742 | } 743 | return false; 744 | } 745 | 746 | return ret; 747 | }; 748 | 749 | function done() { 750 | config.autorun = true; 751 | 752 | // Log the last module results 753 | if ( config.previousModule ) { 754 | runLoggingCallbacks( "moduleDone", QUnit, { 755 | name: config.previousModule, 756 | failed: config.moduleStats.bad, 757 | passed: config.moduleStats.all - config.moduleStats.bad, 758 | total: config.moduleStats.all 759 | }); 760 | } 761 | delete config.previousModule; 762 | 763 | var i, key, 764 | banner = id( "qunit-banner" ), 765 | tests = id( "qunit-tests" ), 766 | runtime = +new Date() - config.started, 767 | passed = config.stats.all - config.stats.bad, 768 | html = [ 769 | "Tests completed in ", 770 | runtime, 771 | " milliseconds.
      ", 772 | "", 773 | passed, 774 | " assertions of ", 775 | config.stats.all, 776 | " passed, ", 777 | config.stats.bad, 778 | " failed." 779 | ].join( "" ); 780 | 781 | if ( banner ) { 782 | banner.className = ( config.stats.bad ? "qunit-fail" : "qunit-pass" ); 783 | } 784 | 785 | if ( tests ) { 786 | id( "qunit-testresult" ).innerHTML = html; 787 | } 788 | 789 | if ( config.altertitle && defined.document && document.title ) { 790 | // show ✖ for good, ✔ for bad suite result in title 791 | // use escape sequences in case file gets loaded with non-utf-8-charset 792 | document.title = [ 793 | ( config.stats.bad ? "\u2716" : "\u2714" ), 794 | document.title.replace( /^[\u2714\u2716] /i, "" ) 795 | ].join( " " ); 796 | } 797 | 798 | // clear own sessionStorage items if all tests passed 799 | if ( config.reorder && defined.sessionStorage && config.stats.bad === 0 ) { 800 | // `key` & `i` initialized at top of scope 801 | for ( i = 0; i < sessionStorage.length; i++ ) { 802 | key = sessionStorage.key( i++ ); 803 | if ( key.indexOf( "qunit-test-" ) === 0 ) { 804 | sessionStorage.removeItem( key ); 805 | } 806 | } 807 | } 808 | 809 | // scroll back to top to show results 810 | if ( window.scrollTo ) { 811 | window.scrollTo(0, 0); 812 | } 813 | 814 | runLoggingCallbacks( "done", QUnit, { 815 | failed: config.stats.bad, 816 | passed: passed, 817 | total: config.stats.all, 818 | runtime: runtime 819 | }); 820 | } 821 | 822 | /** @return Boolean: true if this test should be ran */ 823 | function validTest( test ) { 824 | var include, 825 | filter = config.filter && config.filter.toLowerCase(), 826 | module = config.module && config.module.toLowerCase(), 827 | fullName = (test.module + ": " + test.testName).toLowerCase(); 828 | 829 | // Internally-generated tests are always valid 830 | if ( test.callback && test.callback.validTest === validTest ) { 831 | delete test.callback.validTest; 832 | return true; 833 | } 834 | 835 | if ( config.testNumber ) { 836 | return test.testNumber === config.testNumber; 837 | } 838 | 839 | if ( module && ( !test.module || test.module.toLowerCase() !== module ) ) { 840 | return false; 841 | } 842 | 843 | if ( !filter ) { 844 | return true; 845 | } 846 | 847 | include = filter.charAt( 0 ) !== "!"; 848 | if ( !include ) { 849 | filter = filter.slice( 1 ); 850 | } 851 | 852 | // If the filter matches, we need to honour include 853 | if ( fullName.indexOf( filter ) !== -1 ) { 854 | return include; 855 | } 856 | 857 | // Otherwise, do the opposite 858 | return !include; 859 | } 860 | 861 | // so far supports only Firefox, Chrome and Opera (buggy), Safari (for real exceptions) 862 | // Later Safari and IE10 are supposed to support error.stack as well 863 | // See also https://developer.mozilla.org/en/JavaScript/Reference/Global_Objects/Error/Stack 864 | function extractStacktrace( e, offset ) { 865 | offset = offset === undefined ? 3 : offset; 866 | 867 | var stack, include, i; 868 | 869 | if ( e.stacktrace ) { 870 | // Opera 871 | return e.stacktrace.split( "\n" )[ offset + 3 ]; 872 | } else if ( e.stack ) { 873 | // Firefox, Chrome 874 | stack = e.stack.split( "\n" ); 875 | if (/^error$/i.test( stack[0] ) ) { 876 | stack.shift(); 877 | } 878 | if ( fileName ) { 879 | include = []; 880 | for ( i = offset; i < stack.length; i++ ) { 881 | if ( stack[ i ].indexOf( fileName ) !== -1 ) { 882 | break; 883 | } 884 | include.push( stack[ i ] ); 885 | } 886 | if ( include.length ) { 887 | return include.join( "\n" ); 888 | } 889 | } 890 | return stack[ offset ]; 891 | } else if ( e.sourceURL ) { 892 | // Safari, PhantomJS 893 | // hopefully one day Safari provides actual stacktraces 894 | // exclude useless self-reference for generated Error objects 895 | if ( /qunit.js$/.test( e.sourceURL ) ) { 896 | return; 897 | } 898 | // for actual exceptions, this is useful 899 | return e.sourceURL + ":" + e.line; 900 | } 901 | } 902 | function sourceFromStacktrace( offset ) { 903 | try { 904 | throw new Error(); 905 | } catch ( e ) { 906 | return extractStacktrace( e, offset ); 907 | } 908 | } 909 | 910 | /** 911 | * Escape text for attribute or text content. 912 | */ 913 | function escapeText( s ) { 914 | if ( !s ) { 915 | return ""; 916 | } 917 | s = s + ""; 918 | // Both single quotes and double quotes (for attributes) 919 | return s.replace( /['"<>&]/g, function( s ) { 920 | switch( s ) { 921 | case "'": 922 | return "'"; 923 | case "\"": 924 | return """; 925 | case "<": 926 | return "<"; 927 | case ">": 928 | return ">"; 929 | case "&": 930 | return "&"; 931 | } 932 | }); 933 | } 934 | 935 | function synchronize( callback, last ) { 936 | config.queue.push( callback ); 937 | 938 | if ( config.autorun && !config.blocking ) { 939 | process( last ); 940 | } 941 | } 942 | 943 | function process( last ) { 944 | function next() { 945 | process( last ); 946 | } 947 | var start = new Date().getTime(); 948 | config.depth = config.depth ? config.depth + 1 : 1; 949 | 950 | while ( config.queue.length && !config.blocking ) { 951 | if ( !defined.setTimeout || config.updateRate <= 0 || ( ( new Date().getTime() - start ) < config.updateRate ) ) { 952 | config.queue.shift()(); 953 | } else { 954 | setTimeout( next, 13 ); 955 | break; 956 | } 957 | } 958 | config.depth--; 959 | if ( last && !config.blocking && !config.queue.length && config.depth === 0 ) { 960 | done(); 961 | } 962 | } 963 | 964 | function saveGlobal() { 965 | config.pollution = []; 966 | 967 | if ( config.noglobals ) { 968 | for ( var key in window ) { 969 | if ( hasOwn.call( window, key ) ) { 970 | // in Opera sometimes DOM element ids show up here, ignore them 971 | if ( /^qunit-test-output/.test( key ) ) { 972 | continue; 973 | } 974 | config.pollution.push( key ); 975 | } 976 | } 977 | } 978 | } 979 | 980 | function checkPollution() { 981 | var newGlobals, 982 | deletedGlobals, 983 | old = config.pollution; 984 | 985 | saveGlobal(); 986 | 987 | newGlobals = diff( config.pollution, old ); 988 | if ( newGlobals.length > 0 ) { 989 | QUnit.pushFailure( "Introduced global variable(s): " + newGlobals.join(", ") ); 990 | } 991 | 992 | deletedGlobals = diff( old, config.pollution ); 993 | if ( deletedGlobals.length > 0 ) { 994 | QUnit.pushFailure( "Deleted global variable(s): " + deletedGlobals.join(", ") ); 995 | } 996 | } 997 | 998 | // returns a new Array with the elements that are in a but not in b 999 | function diff( a, b ) { 1000 | var i, j, 1001 | result = a.slice(); 1002 | 1003 | for ( i = 0; i < result.length; i++ ) { 1004 | for ( j = 0; j < b.length; j++ ) { 1005 | if ( result[i] === b[j] ) { 1006 | result.splice( i, 1 ); 1007 | i--; 1008 | break; 1009 | } 1010 | } 1011 | } 1012 | return result; 1013 | } 1014 | 1015 | function extend( a, b ) { 1016 | for ( var prop in b ) { 1017 | if ( hasOwn.call( b, prop ) ) { 1018 | // Avoid "Member not found" error in IE8 caused by messing with window.constructor 1019 | if ( !( prop === "constructor" && a === window ) ) { 1020 | if ( b[ prop ] === undefined ) { 1021 | delete a[ prop ]; 1022 | } else { 1023 | a[ prop ] = b[ prop ]; 1024 | } 1025 | } 1026 | } 1027 | } 1028 | 1029 | return a; 1030 | } 1031 | 1032 | /** 1033 | * @param {HTMLElement} elem 1034 | * @param {string} type 1035 | * @param {Function} fn 1036 | */ 1037 | function addEvent( elem, type, fn ) { 1038 | if ( elem.addEventListener ) { 1039 | 1040 | // Standards-based browsers 1041 | elem.addEventListener( type, fn, false ); 1042 | } else if ( elem.attachEvent ) { 1043 | 1044 | // support: IE <9 1045 | elem.attachEvent( "on" + type, fn ); 1046 | } else { 1047 | 1048 | // Caller must ensure support for event listeners is present 1049 | throw new Error( "addEvent() was called in a context without event listener support" ); 1050 | } 1051 | } 1052 | 1053 | /** 1054 | * @param {Array|NodeList} elems 1055 | * @param {string} type 1056 | * @param {Function} fn 1057 | */ 1058 | function addEvents( elems, type, fn ) { 1059 | var i = elems.length; 1060 | while ( i-- ) { 1061 | addEvent( elems[i], type, fn ); 1062 | } 1063 | } 1064 | 1065 | function hasClass( elem, name ) { 1066 | return (" " + elem.className + " ").indexOf(" " + name + " ") > -1; 1067 | } 1068 | 1069 | function addClass( elem, name ) { 1070 | if ( !hasClass( elem, name ) ) { 1071 | elem.className += (elem.className ? " " : "") + name; 1072 | } 1073 | } 1074 | 1075 | function removeClass( elem, name ) { 1076 | var set = " " + elem.className + " "; 1077 | // Class name may appear multiple times 1078 | while ( set.indexOf(" " + name + " ") > -1 ) { 1079 | set = set.replace(" " + name + " " , " "); 1080 | } 1081 | // If possible, trim it for prettiness, but not necessarily 1082 | elem.className = typeof set.trim === "function" ? set.trim() : set.replace(/^\s+|\s+$/g, ""); 1083 | } 1084 | 1085 | function id( name ) { 1086 | return defined.document && document.getElementById && document.getElementById( name ); 1087 | } 1088 | 1089 | function registerLoggingCallback( key ) { 1090 | return function( callback ) { 1091 | config[key].push( callback ); 1092 | }; 1093 | } 1094 | 1095 | // Supports deprecated method of completely overwriting logging callbacks 1096 | function runLoggingCallbacks( key, scope, args ) { 1097 | var i, callbacks; 1098 | if ( QUnit.hasOwnProperty( key ) ) { 1099 | QUnit[ key ].call(scope, args ); 1100 | } else { 1101 | callbacks = config[ key ]; 1102 | for ( i = 0; i < callbacks.length; i++ ) { 1103 | callbacks[ i ].call( scope, args ); 1104 | } 1105 | } 1106 | } 1107 | 1108 | // from jquery.js 1109 | function inArray( elem, array ) { 1110 | if ( array.indexOf ) { 1111 | return array.indexOf( elem ); 1112 | } 1113 | 1114 | for ( var i = 0, length = array.length; i < length; i++ ) { 1115 | if ( array[ i ] === elem ) { 1116 | return i; 1117 | } 1118 | } 1119 | 1120 | return -1; 1121 | } 1122 | 1123 | function Test( settings ) { 1124 | extend( this, settings ); 1125 | this.assertions = []; 1126 | this.testNumber = ++Test.count; 1127 | } 1128 | 1129 | Test.count = 0; 1130 | 1131 | Test.prototype = { 1132 | init: function() { 1133 | var a, b, li, 1134 | tests = id( "qunit-tests" ); 1135 | 1136 | if ( tests ) { 1137 | b = document.createElement( "strong" ); 1138 | b.innerHTML = this.nameHtml; 1139 | 1140 | // `a` initialized at top of scope 1141 | a = document.createElement( "a" ); 1142 | a.innerHTML = "Rerun"; 1143 | a.href = QUnit.url({ testNumber: this.testNumber }); 1144 | 1145 | li = document.createElement( "li" ); 1146 | li.appendChild( b ); 1147 | li.appendChild( a ); 1148 | li.className = "running"; 1149 | li.id = this.id = "qunit-test-output" + testId++; 1150 | 1151 | tests.appendChild( li ); 1152 | } 1153 | }, 1154 | setup: function() { 1155 | if ( 1156 | // Emit moduleStart when we're switching from one module to another 1157 | this.module !== config.previousModule || 1158 | // They could be equal (both undefined) but if the previousModule property doesn't 1159 | // yet exist it means this is the first test in a suite that isn't wrapped in a 1160 | // module, in which case we'll just emit a moduleStart event for 'undefined'. 1161 | // Without this, reporters can get testStart before moduleStart which is a problem. 1162 | !hasOwn.call( config, "previousModule" ) 1163 | ) { 1164 | if ( hasOwn.call( config, "previousModule" ) ) { 1165 | runLoggingCallbacks( "moduleDone", QUnit, { 1166 | name: config.previousModule, 1167 | failed: config.moduleStats.bad, 1168 | passed: config.moduleStats.all - config.moduleStats.bad, 1169 | total: config.moduleStats.all 1170 | }); 1171 | } 1172 | config.previousModule = this.module; 1173 | config.moduleStats = { all: 0, bad: 0 }; 1174 | runLoggingCallbacks( "moduleStart", QUnit, { 1175 | name: this.module 1176 | }); 1177 | } 1178 | 1179 | config.current = this; 1180 | 1181 | this.testEnvironment = extend({ 1182 | setup: function() {}, 1183 | teardown: function() {} 1184 | }, this.moduleTestEnvironment ); 1185 | 1186 | this.started = +new Date(); 1187 | runLoggingCallbacks( "testStart", QUnit, { 1188 | name: this.testName, 1189 | module: this.module 1190 | }); 1191 | 1192 | /*jshint camelcase:false */ 1193 | 1194 | 1195 | /** 1196 | * Expose the current test environment. 1197 | * 1198 | * @deprecated since 1.12.0: Use QUnit.config.current.testEnvironment instead. 1199 | */ 1200 | QUnit.current_testEnvironment = this.testEnvironment; 1201 | 1202 | /*jshint camelcase:true */ 1203 | 1204 | if ( !config.pollution ) { 1205 | saveGlobal(); 1206 | } 1207 | if ( config.notrycatch ) { 1208 | this.testEnvironment.setup.call( this.testEnvironment, QUnit.assert ); 1209 | return; 1210 | } 1211 | try { 1212 | this.testEnvironment.setup.call( this.testEnvironment, QUnit.assert ); 1213 | } catch( e ) { 1214 | QUnit.pushFailure( "Setup failed on " + this.testName + ": " + ( e.message || e ), extractStacktrace( e, 1 ) ); 1215 | } 1216 | }, 1217 | run: function() { 1218 | config.current = this; 1219 | 1220 | var running = id( "qunit-testresult" ); 1221 | 1222 | if ( running ) { 1223 | running.innerHTML = "Running:
      " + this.nameHtml; 1224 | } 1225 | 1226 | if ( this.async ) { 1227 | QUnit.stop(); 1228 | } 1229 | 1230 | this.callbackStarted = +new Date(); 1231 | 1232 | if ( config.notrycatch ) { 1233 | this.callback.call( this.testEnvironment, QUnit.assert ); 1234 | this.callbackRuntime = +new Date() - this.callbackStarted; 1235 | return; 1236 | } 1237 | 1238 | try { 1239 | this.callback.call( this.testEnvironment, QUnit.assert ); 1240 | this.callbackRuntime = +new Date() - this.callbackStarted; 1241 | } catch( e ) { 1242 | this.callbackRuntime = +new Date() - this.callbackStarted; 1243 | 1244 | QUnit.pushFailure( "Died on test #" + (this.assertions.length + 1) + " " + this.stack + ": " + ( e.message || e ), extractStacktrace( e, 0 ) ); 1245 | // else next test will carry the responsibility 1246 | saveGlobal(); 1247 | 1248 | // Restart the tests if they're blocking 1249 | if ( config.blocking ) { 1250 | QUnit.start(); 1251 | } 1252 | } 1253 | }, 1254 | teardown: function() { 1255 | config.current = this; 1256 | if ( config.notrycatch ) { 1257 | if ( typeof this.callbackRuntime === "undefined" ) { 1258 | this.callbackRuntime = +new Date() - this.callbackStarted; 1259 | } 1260 | this.testEnvironment.teardown.call( this.testEnvironment, QUnit.assert ); 1261 | return; 1262 | } else { 1263 | try { 1264 | this.testEnvironment.teardown.call( this.testEnvironment, QUnit.assert ); 1265 | } catch( e ) { 1266 | QUnit.pushFailure( "Teardown failed on " + this.testName + ": " + ( e.message || e ), extractStacktrace( e, 1 ) ); 1267 | } 1268 | } 1269 | checkPollution(); 1270 | }, 1271 | finish: function() { 1272 | config.current = this; 1273 | if ( config.requireExpects && this.expected === null ) { 1274 | QUnit.pushFailure( "Expected number of assertions to be defined, but expect() was not called.", this.stack ); 1275 | } else if ( this.expected !== null && this.expected !== this.assertions.length ) { 1276 | QUnit.pushFailure( "Expected " + this.expected + " assertions, but " + this.assertions.length + " were run", this.stack ); 1277 | } else if ( this.expected === null && !this.assertions.length ) { 1278 | QUnit.pushFailure( "Expected at least one assertion, but none were run - call expect(0) to accept zero assertions.", this.stack ); 1279 | } 1280 | 1281 | var i, assertion, a, b, time, li, ol, 1282 | test = this, 1283 | good = 0, 1284 | bad = 0, 1285 | tests = id( "qunit-tests" ); 1286 | 1287 | this.runtime = +new Date() - this.started; 1288 | config.stats.all += this.assertions.length; 1289 | config.moduleStats.all += this.assertions.length; 1290 | 1291 | if ( tests ) { 1292 | ol = document.createElement( "ol" ); 1293 | ol.className = "qunit-assert-list"; 1294 | 1295 | for ( i = 0; i < this.assertions.length; i++ ) { 1296 | assertion = this.assertions[i]; 1297 | 1298 | li = document.createElement( "li" ); 1299 | li.className = assertion.result ? "pass" : "fail"; 1300 | li.innerHTML = assertion.message || ( assertion.result ? "okay" : "failed" ); 1301 | ol.appendChild( li ); 1302 | 1303 | if ( assertion.result ) { 1304 | good++; 1305 | } else { 1306 | bad++; 1307 | config.stats.bad++; 1308 | config.moduleStats.bad++; 1309 | } 1310 | } 1311 | 1312 | // store result when possible 1313 | if ( QUnit.config.reorder && defined.sessionStorage ) { 1314 | if ( bad ) { 1315 | sessionStorage.setItem( "qunit-test-" + this.module + "-" + this.testName, bad ); 1316 | } else { 1317 | sessionStorage.removeItem( "qunit-test-" + this.module + "-" + this.testName ); 1318 | } 1319 | } 1320 | 1321 | if ( bad === 0 ) { 1322 | addClass( ol, "qunit-collapsed" ); 1323 | } 1324 | 1325 | // `b` initialized at top of scope 1326 | b = document.createElement( "strong" ); 1327 | b.innerHTML = this.nameHtml + " (" + bad + ", " + good + ", " + this.assertions.length + ")"; 1328 | 1329 | addEvent(b, "click", function() { 1330 | var next = b.parentNode.lastChild, 1331 | collapsed = hasClass( next, "qunit-collapsed" ); 1332 | ( collapsed ? removeClass : addClass )( next, "qunit-collapsed" ); 1333 | }); 1334 | 1335 | addEvent(b, "dblclick", function( e ) { 1336 | var target = e && e.target ? e.target : window.event.srcElement; 1337 | if ( target.nodeName.toLowerCase() === "span" || target.nodeName.toLowerCase() === "b" ) { 1338 | target = target.parentNode; 1339 | } 1340 | if ( window.location && target.nodeName.toLowerCase() === "strong" ) { 1341 | window.location = QUnit.url({ testNumber: test.testNumber }); 1342 | } 1343 | }); 1344 | 1345 | // `time` initialized at top of scope 1346 | time = document.createElement( "span" ); 1347 | time.className = "runtime"; 1348 | time.innerHTML = this.runtime + " ms"; 1349 | 1350 | // `li` initialized at top of scope 1351 | li = id( this.id ); 1352 | li.className = bad ? "fail" : "pass"; 1353 | li.removeChild( li.firstChild ); 1354 | a = li.firstChild; 1355 | li.appendChild( b ); 1356 | li.appendChild( a ); 1357 | li.appendChild( time ); 1358 | li.appendChild( ol ); 1359 | 1360 | } else { 1361 | for ( i = 0; i < this.assertions.length; i++ ) { 1362 | if ( !this.assertions[i].result ) { 1363 | bad++; 1364 | config.stats.bad++; 1365 | config.moduleStats.bad++; 1366 | } 1367 | } 1368 | } 1369 | 1370 | runLoggingCallbacks( "testDone", QUnit, { 1371 | name: this.testName, 1372 | module: this.module, 1373 | failed: bad, 1374 | passed: this.assertions.length - bad, 1375 | total: this.assertions.length, 1376 | runtime: this.runtime, 1377 | // DEPRECATED: this property will be removed in 2.0.0, use runtime instead 1378 | duration: this.runtime, 1379 | }); 1380 | 1381 | QUnit.reset(); 1382 | 1383 | config.current = undefined; 1384 | }, 1385 | 1386 | queue: function() { 1387 | var bad, 1388 | test = this; 1389 | 1390 | synchronize(function() { 1391 | test.init(); 1392 | }); 1393 | function run() { 1394 | // each of these can by async 1395 | synchronize(function() { 1396 | test.setup(); 1397 | }); 1398 | synchronize(function() { 1399 | test.run(); 1400 | }); 1401 | synchronize(function() { 1402 | test.teardown(); 1403 | }); 1404 | synchronize(function() { 1405 | test.finish(); 1406 | }); 1407 | } 1408 | 1409 | // `bad` initialized at top of scope 1410 | // defer when previous test run passed, if storage is available 1411 | bad = QUnit.config.reorder && defined.sessionStorage && 1412 | +sessionStorage.getItem( "qunit-test-" + this.module + "-" + this.testName ); 1413 | 1414 | if ( bad ) { 1415 | run(); 1416 | } else { 1417 | synchronize( run, true ); 1418 | } 1419 | } 1420 | }; 1421 | 1422 | // `assert` initialized at top of scope 1423 | // Assert helpers 1424 | // All of these must either call QUnit.push() or manually do: 1425 | // - runLoggingCallbacks( "log", .. ); 1426 | // - config.current.assertions.push({ .. }); 1427 | assert = QUnit.assert = { 1428 | /** 1429 | * Asserts rough true-ish result. 1430 | * @name ok 1431 | * @function 1432 | * @example ok( "asdfasdf".length > 5, "There must be at least 5 chars" ); 1433 | */ 1434 | ok: function( result, msg ) { 1435 | if ( !config.current ) { 1436 | throw new Error( "ok() assertion outside test context, was " + sourceFromStacktrace(2) ); 1437 | } 1438 | result = !!result; 1439 | msg = msg || ( result ? "okay" : "failed" ); 1440 | 1441 | var source, 1442 | details = { 1443 | module: config.current.module, 1444 | name: config.current.testName, 1445 | result: result, 1446 | message: msg 1447 | }; 1448 | 1449 | msg = "" + escapeText( msg ) + ""; 1450 | 1451 | if ( !result ) { 1452 | source = sourceFromStacktrace( 2 ); 1453 | if ( source ) { 1454 | details.source = source; 1455 | msg += "
      Source: 
      " +
1456 | 					escapeText( source ) +
1457 | 					"
      "; 1458 | } 1459 | } 1460 | runLoggingCallbacks( "log", QUnit, details ); 1461 | config.current.assertions.push({ 1462 | result: result, 1463 | message: msg 1464 | }); 1465 | }, 1466 | 1467 | /** 1468 | * Assert that the first two arguments are equal, with an optional message. 1469 | * Prints out both actual and expected values. 1470 | * @name equal 1471 | * @function 1472 | * @example equal( format( "Received {0} bytes.", 2), "Received 2 bytes.", "format() replaces {0} with next argument" ); 1473 | */ 1474 | equal: function( actual, expected, message ) { 1475 | /*jshint eqeqeq:false */ 1476 | QUnit.push( expected == actual, actual, expected, message ); 1477 | }, 1478 | 1479 | /** 1480 | * @name notEqual 1481 | * @function 1482 | */ 1483 | notEqual: function( actual, expected, message ) { 1484 | /*jshint eqeqeq:false */ 1485 | QUnit.push( expected != actual, actual, expected, message ); 1486 | }, 1487 | 1488 | /** 1489 | * @name propEqual 1490 | * @function 1491 | */ 1492 | propEqual: function( actual, expected, message ) { 1493 | actual = objectValues(actual); 1494 | expected = objectValues(expected); 1495 | QUnit.push( QUnit.equiv(actual, expected), actual, expected, message ); 1496 | }, 1497 | 1498 | /** 1499 | * @name notPropEqual 1500 | * @function 1501 | */ 1502 | notPropEqual: function( actual, expected, message ) { 1503 | actual = objectValues(actual); 1504 | expected = objectValues(expected); 1505 | QUnit.push( !QUnit.equiv(actual, expected), actual, expected, message ); 1506 | }, 1507 | 1508 | /** 1509 | * @name deepEqual 1510 | * @function 1511 | */ 1512 | deepEqual: function( actual, expected, message ) { 1513 | QUnit.push( QUnit.equiv(actual, expected), actual, expected, message ); 1514 | }, 1515 | 1516 | /** 1517 | * @name notDeepEqual 1518 | * @function 1519 | */ 1520 | notDeepEqual: function( actual, expected, message ) { 1521 | QUnit.push( !QUnit.equiv(actual, expected), actual, expected, message ); 1522 | }, 1523 | 1524 | /** 1525 | * @name strictEqual 1526 | * @function 1527 | */ 1528 | strictEqual: function( actual, expected, message ) { 1529 | QUnit.push( expected === actual, actual, expected, message ); 1530 | }, 1531 | 1532 | /** 1533 | * @name notStrictEqual 1534 | * @function 1535 | */ 1536 | notStrictEqual: function( actual, expected, message ) { 1537 | QUnit.push( expected !== actual, actual, expected, message ); 1538 | }, 1539 | 1540 | "throws": function( block, expected, message ) { 1541 | var actual, 1542 | expectedOutput = expected, 1543 | ok = false; 1544 | 1545 | // 'expected' is optional 1546 | if ( typeof expected === "string" ) { 1547 | message = expected; 1548 | expected = null; 1549 | } 1550 | 1551 | config.current.ignoreGlobalErrors = true; 1552 | try { 1553 | block.call( config.current.testEnvironment ); 1554 | } catch (e) { 1555 | actual = e; 1556 | } 1557 | config.current.ignoreGlobalErrors = false; 1558 | 1559 | if ( actual ) { 1560 | // we don't want to validate thrown error 1561 | if ( !expected ) { 1562 | ok = true; 1563 | expectedOutput = null; 1564 | // expected is a regexp 1565 | } else if ( QUnit.objectType( expected ) === "regexp" ) { 1566 | ok = expected.test( errorString( actual ) ); 1567 | // expected is a constructor 1568 | } else if ( actual instanceof expected ) { 1569 | ok = true; 1570 | // expected is a validation function which returns true is validation passed 1571 | } else if ( expected.call( {}, actual ) === true ) { 1572 | expectedOutput = null; 1573 | ok = true; 1574 | } 1575 | 1576 | QUnit.push( ok, actual, expectedOutput, message ); 1577 | } else { 1578 | QUnit.pushFailure( message, null, "No exception was thrown." ); 1579 | } 1580 | } 1581 | }; 1582 | 1583 | /** 1584 | * @deprecated since 1.8.0 1585 | * Kept assertion helpers in root for backwards compatibility. 1586 | */ 1587 | extend( QUnit.constructor.prototype, assert ); 1588 | 1589 | /** 1590 | * @deprecated since 1.9.0 1591 | * Kept to avoid TypeErrors for undefined methods. 1592 | */ 1593 | QUnit.constructor.prototype.raises = function() { 1594 | QUnit.push( false, false, false, "QUnit.raises has been deprecated since 2012 (fad3c1ea), use QUnit.throws instead" ); 1595 | }; 1596 | 1597 | /** 1598 | * @deprecated since 1.0.0, replaced with error pushes since 1.3.0 1599 | * Kept to avoid TypeErrors for undefined methods. 1600 | */ 1601 | QUnit.constructor.prototype.equals = function() { 1602 | QUnit.push( false, false, false, "QUnit.equals has been deprecated since 2009 (e88049a0), use QUnit.equal instead" ); 1603 | }; 1604 | QUnit.constructor.prototype.same = function() { 1605 | QUnit.push( false, false, false, "QUnit.same has been deprecated since 2009 (e88049a0), use QUnit.deepEqual instead" ); 1606 | }; 1607 | 1608 | // Test for equality any JavaScript type. 1609 | // Author: Philippe Rathé 1610 | QUnit.equiv = (function() { 1611 | 1612 | // Call the o related callback with the given arguments. 1613 | function bindCallbacks( o, callbacks, args ) { 1614 | var prop = QUnit.objectType( o ); 1615 | if ( prop ) { 1616 | if ( QUnit.objectType( callbacks[ prop ] ) === "function" ) { 1617 | return callbacks[ prop ].apply( callbacks, args ); 1618 | } else { 1619 | return callbacks[ prop ]; // or undefined 1620 | } 1621 | } 1622 | } 1623 | 1624 | // the real equiv function 1625 | var innerEquiv, 1626 | // stack to decide between skip/abort functions 1627 | callers = [], 1628 | // stack to avoiding loops from circular referencing 1629 | parents = [], 1630 | parentsB = [], 1631 | 1632 | getProto = Object.getPrototypeOf || function ( obj ) { 1633 | /*jshint camelcase:false */ 1634 | return obj.__proto__; 1635 | }, 1636 | callbacks = (function () { 1637 | 1638 | // for string, boolean, number and null 1639 | function useStrictEquality( b, a ) { 1640 | /*jshint eqeqeq:false */ 1641 | if ( b instanceof a.constructor || a instanceof b.constructor ) { 1642 | // to catch short annotation VS 'new' annotation of a 1643 | // declaration 1644 | // e.g. var i = 1; 1645 | // var j = new Number(1); 1646 | return a == b; 1647 | } else { 1648 | return a === b; 1649 | } 1650 | } 1651 | 1652 | return { 1653 | "string": useStrictEquality, 1654 | "boolean": useStrictEquality, 1655 | "number": useStrictEquality, 1656 | "null": useStrictEquality, 1657 | "undefined": useStrictEquality, 1658 | 1659 | "nan": function( b ) { 1660 | return isNaN( b ); 1661 | }, 1662 | 1663 | "date": function( b, a ) { 1664 | return QUnit.objectType( b ) === "date" && a.valueOf() === b.valueOf(); 1665 | }, 1666 | 1667 | "regexp": function( b, a ) { 1668 | return QUnit.objectType( b ) === "regexp" && 1669 | // the regex itself 1670 | a.source === b.source && 1671 | // and its modifiers 1672 | a.global === b.global && 1673 | // (gmi) ... 1674 | a.ignoreCase === b.ignoreCase && 1675 | a.multiline === b.multiline && 1676 | a.sticky === b.sticky; 1677 | }, 1678 | 1679 | // - skip when the property is a method of an instance (OOP) 1680 | // - abort otherwise, 1681 | // initial === would have catch identical references anyway 1682 | "function": function() { 1683 | var caller = callers[callers.length - 1]; 1684 | return caller !== Object && typeof caller !== "undefined"; 1685 | }, 1686 | 1687 | "array": function( b, a ) { 1688 | var i, j, len, loop, aCircular, bCircular; 1689 | 1690 | // b could be an object literal here 1691 | if ( QUnit.objectType( b ) !== "array" ) { 1692 | return false; 1693 | } 1694 | 1695 | len = a.length; 1696 | if ( len !== b.length ) { 1697 | // safe and faster 1698 | return false; 1699 | } 1700 | 1701 | // track reference to avoid circular references 1702 | parents.push( a ); 1703 | parentsB.push( b ); 1704 | for ( i = 0; i < len; i++ ) { 1705 | loop = false; 1706 | for ( j = 0; j < parents.length; j++ ) { 1707 | aCircular = parents[j] === a[i]; 1708 | bCircular = parentsB[j] === b[i]; 1709 | if ( aCircular || bCircular ) { 1710 | if ( a[i] === b[i] || aCircular && bCircular ) { 1711 | loop = true; 1712 | } else { 1713 | parents.pop(); 1714 | parentsB.pop(); 1715 | return false; 1716 | } 1717 | } 1718 | } 1719 | if ( !loop && !innerEquiv(a[i], b[i]) ) { 1720 | parents.pop(); 1721 | parentsB.pop(); 1722 | return false; 1723 | } 1724 | } 1725 | parents.pop(); 1726 | parentsB.pop(); 1727 | return true; 1728 | }, 1729 | 1730 | "object": function( b, a ) { 1731 | /*jshint forin:false */ 1732 | var i, j, loop, aCircular, bCircular, 1733 | // Default to true 1734 | eq = true, 1735 | aProperties = [], 1736 | bProperties = []; 1737 | 1738 | // comparing constructors is more strict than using 1739 | // instanceof 1740 | if ( a.constructor !== b.constructor ) { 1741 | // Allow objects with no prototype to be equivalent to 1742 | // objects with Object as their constructor. 1743 | if ( !(( getProto(a) === null && getProto(b) === Object.prototype ) || 1744 | ( getProto(b) === null && getProto(a) === Object.prototype ) ) ) { 1745 | return false; 1746 | } 1747 | } 1748 | 1749 | // stack constructor before traversing properties 1750 | callers.push( a.constructor ); 1751 | 1752 | // track reference to avoid circular references 1753 | parents.push( a ); 1754 | parentsB.push( b ); 1755 | 1756 | // be strict: don't ensure hasOwnProperty and go deep 1757 | for ( i in a ) { 1758 | loop = false; 1759 | for ( j = 0; j < parents.length; j++ ) { 1760 | aCircular = parents[j] === a[i]; 1761 | bCircular = parentsB[j] === b[i]; 1762 | if ( aCircular || bCircular ) { 1763 | if ( a[i] === b[i] || aCircular && bCircular ) { 1764 | loop = true; 1765 | } else { 1766 | eq = false; 1767 | break; 1768 | } 1769 | } 1770 | } 1771 | aProperties.push(i); 1772 | if ( !loop && !innerEquiv(a[i], b[i]) ) { 1773 | eq = false; 1774 | break; 1775 | } 1776 | } 1777 | 1778 | parents.pop(); 1779 | parentsB.pop(); 1780 | callers.pop(); // unstack, we are done 1781 | 1782 | for ( i in b ) { 1783 | bProperties.push( i ); // collect b's properties 1784 | } 1785 | 1786 | // Ensures identical properties name 1787 | return eq && innerEquiv( aProperties.sort(), bProperties.sort() ); 1788 | } 1789 | }; 1790 | }()); 1791 | 1792 | innerEquiv = function() { // can take multiple arguments 1793 | var args = [].slice.apply( arguments ); 1794 | if ( args.length < 2 ) { 1795 | return true; // end transition 1796 | } 1797 | 1798 | return (function( a, b ) { 1799 | if ( a === b ) { 1800 | return true; // catch the most you can 1801 | } else if ( a === null || b === null || typeof a === "undefined" || 1802 | typeof b === "undefined" || 1803 | QUnit.objectType(a) !== QUnit.objectType(b) ) { 1804 | return false; // don't lose time with error prone cases 1805 | } else { 1806 | return bindCallbacks(a, callbacks, [ b, a ]); 1807 | } 1808 | 1809 | // apply transition with (1..n) arguments 1810 | }( args[0], args[1] ) && innerEquiv.apply( this, args.splice(1, args.length - 1 )) ); 1811 | }; 1812 | 1813 | return innerEquiv; 1814 | }()); 1815 | 1816 | /** 1817 | * jsDump Copyright (c) 2008 Ariel Flesler - aflesler(at)gmail(dot)com | 1818 | * http://flesler.blogspot.com Licensed under BSD 1819 | * (http://www.opensource.org/licenses/bsd-license.php) Date: 5/15/2008 1820 | * 1821 | * @projectDescription Advanced and extensible data dumping for Javascript. 1822 | * @version 1.0.0 1823 | * @author Ariel Flesler 1824 | * @link {http://flesler.blogspot.com/2008/05/jsdump-pretty-dump-of-any-javascript.html} 1825 | */ 1826 | QUnit.jsDump = (function() { 1827 | function quote( str ) { 1828 | return "\"" + str.toString().replace( /"/g, "\\\"" ) + "\""; 1829 | } 1830 | function literal( o ) { 1831 | return o + ""; 1832 | } 1833 | function join( pre, arr, post ) { 1834 | var s = jsDump.separator(), 1835 | base = jsDump.indent(), 1836 | inner = jsDump.indent(1); 1837 | if ( arr.join ) { 1838 | arr = arr.join( "," + s + inner ); 1839 | } 1840 | if ( !arr ) { 1841 | return pre + post; 1842 | } 1843 | return [ pre, inner + arr, base + post ].join(s); 1844 | } 1845 | function array( arr, stack ) { 1846 | var i = arr.length, ret = new Array(i); 1847 | this.up(); 1848 | while ( i-- ) { 1849 | ret[i] = this.parse( arr[i] , undefined , stack); 1850 | } 1851 | this.down(); 1852 | return join( "[", ret, "]" ); 1853 | } 1854 | 1855 | var reName = /^function (\w+)/, 1856 | jsDump = { 1857 | // type is used mostly internally, you can fix a (custom)type in advance 1858 | parse: function( obj, type, stack ) { 1859 | stack = stack || [ ]; 1860 | var inStack, res, 1861 | parser = this.parsers[ type || this.typeOf(obj) ]; 1862 | 1863 | type = typeof parser; 1864 | inStack = inArray( obj, stack ); 1865 | 1866 | if ( inStack !== -1 ) { 1867 | return "recursion(" + (inStack - stack.length) + ")"; 1868 | } 1869 | if ( type === "function" ) { 1870 | stack.push( obj ); 1871 | res = parser.call( this, obj, stack ); 1872 | stack.pop(); 1873 | return res; 1874 | } 1875 | return ( type === "string" ) ? parser : this.parsers.error; 1876 | }, 1877 | typeOf: function( obj ) { 1878 | var type; 1879 | if ( obj === null ) { 1880 | type = "null"; 1881 | } else if ( typeof obj === "undefined" ) { 1882 | type = "undefined"; 1883 | } else if ( QUnit.is( "regexp", obj) ) { 1884 | type = "regexp"; 1885 | } else if ( QUnit.is( "date", obj) ) { 1886 | type = "date"; 1887 | } else if ( QUnit.is( "function", obj) ) { 1888 | type = "function"; 1889 | } else if ( typeof obj.setInterval !== undefined && typeof obj.document !== "undefined" && typeof obj.nodeType === "undefined" ) { 1890 | type = "window"; 1891 | } else if ( obj.nodeType === 9 ) { 1892 | type = "document"; 1893 | } else if ( obj.nodeType ) { 1894 | type = "node"; 1895 | } else if ( 1896 | // native arrays 1897 | toString.call( obj ) === "[object Array]" || 1898 | // NodeList objects 1899 | ( typeof obj.length === "number" && typeof obj.item !== "undefined" && ( obj.length ? obj.item(0) === obj[0] : ( obj.item( 0 ) === null && typeof obj[0] === "undefined" ) ) ) 1900 | ) { 1901 | type = "array"; 1902 | } else if ( obj.constructor === Error.prototype.constructor ) { 1903 | type = "error"; 1904 | } else { 1905 | type = typeof obj; 1906 | } 1907 | return type; 1908 | }, 1909 | separator: function() { 1910 | return this.multiline ? this.HTML ? "
      " : "\n" : this.HTML ? " " : " "; 1911 | }, 1912 | // extra can be a number, shortcut for increasing-calling-decreasing 1913 | indent: function( extra ) { 1914 | if ( !this.multiline ) { 1915 | return ""; 1916 | } 1917 | var chr = this.indentChar; 1918 | if ( this.HTML ) { 1919 | chr = chr.replace( /\t/g, " " ).replace( / /g, " " ); 1920 | } 1921 | return new Array( this.depth + ( extra || 0 ) ).join(chr); 1922 | }, 1923 | up: function( a ) { 1924 | this.depth += a || 1; 1925 | }, 1926 | down: function( a ) { 1927 | this.depth -= a || 1; 1928 | }, 1929 | setParser: function( name, parser ) { 1930 | this.parsers[name] = parser; 1931 | }, 1932 | // The next 3 are exposed so you can use them 1933 | quote: quote, 1934 | literal: literal, 1935 | join: join, 1936 | // 1937 | depth: 1, 1938 | // This is the list of parsers, to modify them, use jsDump.setParser 1939 | parsers: { 1940 | window: "[Window]", 1941 | document: "[Document]", 1942 | error: function(error) { 1943 | return "Error(\"" + error.message + "\")"; 1944 | }, 1945 | unknown: "[Unknown]", 1946 | "null": "null", 1947 | "undefined": "undefined", 1948 | "function": function( fn ) { 1949 | var ret = "function", 1950 | // functions never have name in IE 1951 | name = "name" in fn ? fn.name : (reName.exec(fn) || [])[1]; 1952 | 1953 | if ( name ) { 1954 | ret += " " + name; 1955 | } 1956 | ret += "( "; 1957 | 1958 | ret = [ ret, QUnit.jsDump.parse( fn, "functionArgs" ), "){" ].join( "" ); 1959 | return join( ret, QUnit.jsDump.parse(fn,"functionCode" ), "}" ); 1960 | }, 1961 | array: array, 1962 | nodelist: array, 1963 | "arguments": array, 1964 | object: function( map, stack ) { 1965 | /*jshint forin:false */ 1966 | var ret = [ ], keys, key, val, i; 1967 | QUnit.jsDump.up(); 1968 | keys = []; 1969 | for ( key in map ) { 1970 | keys.push( key ); 1971 | } 1972 | keys.sort(); 1973 | for ( i = 0; i < keys.length; i++ ) { 1974 | key = keys[ i ]; 1975 | val = map[ key ]; 1976 | ret.push( QUnit.jsDump.parse( key, "key" ) + ": " + QUnit.jsDump.parse( val, undefined, stack ) ); 1977 | } 1978 | QUnit.jsDump.down(); 1979 | return join( "{", ret, "}" ); 1980 | }, 1981 | node: function( node ) { 1982 | var len, i, val, 1983 | open = QUnit.jsDump.HTML ? "<" : "<", 1984 | close = QUnit.jsDump.HTML ? ">" : ">", 1985 | tag = node.nodeName.toLowerCase(), 1986 | ret = open + tag, 1987 | attrs = node.attributes; 1988 | 1989 | if ( attrs ) { 1990 | for ( i = 0, len = attrs.length; i < len; i++ ) { 1991 | val = attrs[i].nodeValue; 1992 | // IE6 includes all attributes in .attributes, even ones not explicitly set. 1993 | // Those have values like undefined, null, 0, false, "" or "inherit". 1994 | if ( val && val !== "inherit" ) { 1995 | ret += " " + attrs[i].nodeName + "=" + QUnit.jsDump.parse( val, "attribute" ); 1996 | } 1997 | } 1998 | } 1999 | ret += close; 2000 | 2001 | // Show content of TextNode or CDATASection 2002 | if ( node.nodeType === 3 || node.nodeType === 4 ) { 2003 | ret += node.nodeValue; 2004 | } 2005 | 2006 | return ret + open + "/" + tag + close; 2007 | }, 2008 | // function calls it internally, it's the arguments part of the function 2009 | functionArgs: function( fn ) { 2010 | var args, 2011 | l = fn.length; 2012 | 2013 | if ( !l ) { 2014 | return ""; 2015 | } 2016 | 2017 | args = new Array(l); 2018 | while ( l-- ) { 2019 | // 97 is 'a' 2020 | args[l] = String.fromCharCode(97+l); 2021 | } 2022 | return " " + args.join( ", " ) + " "; 2023 | }, 2024 | // object calls it internally, the key part of an item in a map 2025 | key: quote, 2026 | // function calls it internally, it's the content of the function 2027 | functionCode: "[code]", 2028 | // node calls it internally, it's an html attribute value 2029 | attribute: quote, 2030 | string: quote, 2031 | date: quote, 2032 | regexp: literal, 2033 | number: literal, 2034 | "boolean": literal 2035 | }, 2036 | // if true, entities are escaped ( <, >, \t, space and \n ) 2037 | HTML: false, 2038 | // indentation unit 2039 | indentChar: " ", 2040 | // if true, items in a collection, are separated by a \n, else just a space. 2041 | multiline: true 2042 | }; 2043 | 2044 | return jsDump; 2045 | }()); 2046 | 2047 | /* 2048 | * Javascript Diff Algorithm 2049 | * By John Resig (http://ejohn.org/) 2050 | * Modified by Chu Alan "sprite" 2051 | * 2052 | * Released under the MIT license. 2053 | * 2054 | * More Info: 2055 | * http://ejohn.org/projects/javascript-diff-algorithm/ 2056 | * 2057 | * Usage: QUnit.diff(expected, actual) 2058 | * 2059 | * QUnit.diff( "the quick brown fox jumped over", "the quick fox jumps over" ) == "the quick brown fox jumped jumps over" 2060 | */ 2061 | QUnit.diff = (function() { 2062 | /*jshint eqeqeq:false, eqnull:true */ 2063 | function diff( o, n ) { 2064 | var i, 2065 | ns = {}, 2066 | os = {}; 2067 | 2068 | for ( i = 0; i < n.length; i++ ) { 2069 | if ( !hasOwn.call( ns, n[i] ) ) { 2070 | ns[ n[i] ] = { 2071 | rows: [], 2072 | o: null 2073 | }; 2074 | } 2075 | ns[ n[i] ].rows.push( i ); 2076 | } 2077 | 2078 | for ( i = 0; i < o.length; i++ ) { 2079 | if ( !hasOwn.call( os, o[i] ) ) { 2080 | os[ o[i] ] = { 2081 | rows: [], 2082 | n: null 2083 | }; 2084 | } 2085 | os[ o[i] ].rows.push( i ); 2086 | } 2087 | 2088 | for ( i in ns ) { 2089 | if ( hasOwn.call( ns, i ) ) { 2090 | if ( ns[i].rows.length === 1 && hasOwn.call( os, i ) && os[i].rows.length === 1 ) { 2091 | n[ ns[i].rows[0] ] = { 2092 | text: n[ ns[i].rows[0] ], 2093 | row: os[i].rows[0] 2094 | }; 2095 | o[ os[i].rows[0] ] = { 2096 | text: o[ os[i].rows[0] ], 2097 | row: ns[i].rows[0] 2098 | }; 2099 | } 2100 | } 2101 | } 2102 | 2103 | for ( i = 0; i < n.length - 1; i++ ) { 2104 | if ( n[i].text != null && n[ i + 1 ].text == null && n[i].row + 1 < o.length && o[ n[i].row + 1 ].text == null && 2105 | n[ i + 1 ] == o[ n[i].row + 1 ] ) { 2106 | 2107 | n[ i + 1 ] = { 2108 | text: n[ i + 1 ], 2109 | row: n[i].row + 1 2110 | }; 2111 | o[ n[i].row + 1 ] = { 2112 | text: o[ n[i].row + 1 ], 2113 | row: i + 1 2114 | }; 2115 | } 2116 | } 2117 | 2118 | for ( i = n.length - 1; i > 0; i-- ) { 2119 | if ( n[i].text != null && n[ i - 1 ].text == null && n[i].row > 0 && o[ n[i].row - 1 ].text == null && 2120 | n[ i - 1 ] == o[ n[i].row - 1 ]) { 2121 | 2122 | n[ i - 1 ] = { 2123 | text: n[ i - 1 ], 2124 | row: n[i].row - 1 2125 | }; 2126 | o[ n[i].row - 1 ] = { 2127 | text: o[ n[i].row - 1 ], 2128 | row: i - 1 2129 | }; 2130 | } 2131 | } 2132 | 2133 | return { 2134 | o: o, 2135 | n: n 2136 | }; 2137 | } 2138 | 2139 | return function( o, n ) { 2140 | o = o.replace( /\s+$/, "" ); 2141 | n = n.replace( /\s+$/, "" ); 2142 | 2143 | var i, pre, 2144 | str = "", 2145 | out = diff( o === "" ? [] : o.split(/\s+/), n === "" ? [] : n.split(/\s+/) ), 2146 | oSpace = o.match(/\s+/g), 2147 | nSpace = n.match(/\s+/g); 2148 | 2149 | if ( oSpace == null ) { 2150 | oSpace = [ " " ]; 2151 | } 2152 | else { 2153 | oSpace.push( " " ); 2154 | } 2155 | 2156 | if ( nSpace == null ) { 2157 | nSpace = [ " " ]; 2158 | } 2159 | else { 2160 | nSpace.push( " " ); 2161 | } 2162 | 2163 | if ( out.n.length === 0 ) { 2164 | for ( i = 0; i < out.o.length; i++ ) { 2165 | str += "" + out.o[i] + oSpace[i] + ""; 2166 | } 2167 | } 2168 | else { 2169 | if ( out.n[0].text == null ) { 2170 | for ( n = 0; n < out.o.length && out.o[n].text == null; n++ ) { 2171 | str += "" + out.o[n] + oSpace[n] + ""; 2172 | } 2173 | } 2174 | 2175 | for ( i = 0; i < out.n.length; i++ ) { 2176 | if (out.n[i].text == null) { 2177 | str += "" + out.n[i] + nSpace[i] + ""; 2178 | } 2179 | else { 2180 | // `pre` initialized at top of scope 2181 | pre = ""; 2182 | 2183 | for ( n = out.n[i].row + 1; n < out.o.length && out.o[n].text == null; n++ ) { 2184 | pre += "" + out.o[n] + oSpace[n] + ""; 2185 | } 2186 | str += " " + out.n[i].text + nSpace[i] + pre; 2187 | } 2188 | } 2189 | } 2190 | 2191 | return str; 2192 | }; 2193 | }()); 2194 | 2195 | // For browser, export only select globals 2196 | if ( typeof window !== "undefined" ) { 2197 | extend( window, QUnit.constructor.prototype ); 2198 | window.QUnit = QUnit; 2199 | } 2200 | 2201 | // For CommonJS environments, export everything 2202 | if ( typeof module !== "undefined" && module.exports ) { 2203 | module.exports = QUnit; 2204 | } 2205 | 2206 | 2207 | // Get a reference to the global object, like window in browsers 2208 | }( (function() { 2209 | return this; 2210 | })() )); 2211 | -------------------------------------------------------------------------------- /src/.jshintrc: -------------------------------------------------------------------------------- 1 | { 2 | "eqeqeq": true, 3 | "eqnull": true, 4 | "noarg": true, 5 | "quotmark": "double", 6 | "smarttabs": true, 7 | "trailing": true, 8 | "undef": true, 9 | "unused": true, 10 | "browser": true, 11 | "jquery": true 12 | } 13 | -------------------------------------------------------------------------------- /src/jquery-fsortable.js: -------------------------------------------------------------------------------- 1 | /** 2 | * Copyright (c) 2014 Andrei Picus 3 | * 4 | * This program is free software: you can redistribute it and/or modify 5 | * it under the terms of the GNU General Public License as published by 6 | * the Free Software Foundation, either version 3 of the License, or 7 | * (at your option) any later version. 8 | 9 | * This program is distributed in the hope that it will be useful, 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 12 | * GNU General Public License for more details. 13 | 14 | * You should have received a copy of the GNU General Public License 15 | * along with this program. If not, see . 16 | */ 17 | 18 | 19 | $.widget("ntx.fsortable", $.ui.sortable, { 20 | options: { 21 | emptyClass: "fsortable-empty", 22 | existingSortable: false 23 | }, 24 | 25 | _refresh: function() { 26 | /** 27 | * Get the total size of the fsortable and the number of occupied 28 | * and free slots. 29 | */ 30 | 31 | var freeSlots = $("." + this.options.emptyClass, this.element), 32 | items = $(this.options.items, this.element).not(freeSlots); 33 | 34 | this._occupied = items.length; 35 | this._capacity = freeSlots.length; 36 | this._size = this._occupied + this._capacity; 37 | 38 | if (!this._capacity) { 39 | this.element.addClass("full"); 40 | } else { 41 | this.element.removeClass("full"); 42 | } 43 | }, 44 | 45 | _getFreeSpot: function(ui) { 46 | /** 47 | * Return the free spot closest to the placeholder, or the last free spot in 48 | * case there is no placeholder 49 | * 50 | * Returns: 51 | * a jQuery object representing the free spot, if there is one. 52 | * null if there is no free slot. 53 | */ 54 | 55 | var closest; 56 | 57 | if (!ui || !ui.placeholder[0]) { 58 | // If we have no placeholder, get the last empty slot. 59 | closest = $("." + this.options.emptyClass + ":last", this.element); 60 | } else { 61 | // Get the empty slot closest to the placeholder. 62 | closest = ui.placeholder.nextAll("." + this.options.emptyClass + ":first"); 63 | if (!closest.length) { 64 | closest = ui.placeholder.prevAll("." + this.options.emptyClass + ":first"); 65 | } 66 | } 67 | 68 | if (closest.length) { 69 | return closest; 70 | } 71 | 72 | // No empty slots. 73 | return null; 74 | }, 75 | 76 | _removeFreeSpot: function(_inst) { 77 | var inst = _inst || this; 78 | inst._spot.remove(); 79 | inst._spot = null; 80 | inst.element.sortable("refresh"); 81 | 82 | // Update the capacities. 83 | inst._capacity--; 84 | inst._occupied++; 85 | 86 | if (inst._capacity === 0) { 87 | inst.element.addClass("full"); 88 | } 89 | }, 90 | 91 | _create: function() { 92 | var that = this; 93 | 94 | this.element.addClass("fsortable"); 95 | 96 | // Prevent sorting on empty slots. 97 | // Make sure to not overwrite existing options. 98 | if (!this.options.existingSortable) { 99 | this.options.cancel += ", ." + this.options.emptyClass; 100 | 101 | // Initialize new sortable plugin passing in all options. 102 | this.element.sortable(this.options); 103 | } else { 104 | this.options.cancel = this.element.sortable("option", "cancel"); 105 | this.options.cancel += ", ." + this.options.emptyClass; 106 | 107 | // Pass our options to existing sortable. 108 | this.element.sortable("option", this.options); 109 | } 110 | 111 | this._refresh(); 112 | 113 | this._outside = false; 114 | this._connected = false; 115 | 116 | // Bind special listeners. 117 | this.element.on("sortactivate", function(e, ui) { 118 | /** 119 | * This event is triggered on all connected sortables when dragging starts 120 | * in one of them (this includes connected draggables). 121 | * 122 | * We're only interested if the event fired on anything other than us. 123 | */ 124 | 125 | if (!ui.sender || ui.sender[0] !== this) { 126 | that._outside = true; 127 | } 128 | }); 129 | 130 | this.element.on("sortdeactivate", function() { 131 | that._outside = false; 132 | 133 | /** 134 | * If we got the deactivate signal and didn't remove the free spot, 135 | * it means the item dropped outside of us so we have to restore the 136 | * spot that we've hidden earlier. 137 | * 138 | * Now, because the sortable plugin is so well written, there's 2 139 | * situations when this can happen: 140 | * 1. A draggable came over us then left and dropped. 141 | * 2. An item that we owned went over a connected sortable then 142 | * came back to us and dropped. 143 | * 144 | * In the first case, we must restore the spot. In the second case, 145 | * we must remove the spot. 146 | */ 147 | if (that._spot) { 148 | if (that._connected) { 149 | // The item bame back to us, remove the spot. 150 | that._spot.remove(); 151 | 152 | // Don't forget to update capacities. 153 | that._capacity--; 154 | that._occupied++; 155 | } else { 156 | // The item dropped outside, show the spot. 157 | that._spot.show(); 158 | } 159 | 160 | that._spot = null; 161 | } 162 | 163 | that._connected = false; 164 | }); 165 | 166 | this.element.on("sortover", function(e, ui) { 167 | /** 168 | * If we're receiving a new item we need to remove a free spot. We 169 | * don't actually remove it now because we'd have to call 170 | * 'refresh' on the sortable and that messes things up during 171 | * sorting. 172 | * 173 | * Instead, we hide the spot and remove it when sorting stops. 174 | * We only hide it when the sortable actually changes, so as 175 | * to not hide slots needlessly. 176 | */ 177 | 178 | // If we've already hidden a free spot, don't do it again. 179 | if (that._spot) { 180 | return; 181 | } 182 | 183 | if (that._outside === true) { 184 | that._spot = that._getFreeSpot(ui); 185 | 186 | // TODO: if _spot is null, bad stuff has happened, throw an error? 187 | // or figure out how to gracefully cancel a sort 188 | 189 | $(this).one("sortchange.fs", function() { 190 | that._spot.hide(); 191 | }); 192 | } 193 | }); 194 | 195 | this.element.on("sortreceive", function() { 196 | // If we need to remove a free spot, do it now and refresh the sortable. 197 | if (that._spot) { 198 | that._removeFreeSpot(); 199 | } 200 | }); 201 | 202 | this.element.on("sortout", function(e, ui) { 203 | /** 204 | * If preparing to exit the sortable, remember the last position of the 205 | * placeholder so we know where to create the empty spot, if necessary. 206 | */ 207 | // Deactivate some listeners because they're not needed anymore. 208 | // Use namespaces so we don't unbind every listener. 209 | $(this).off("sortchange.fs"); 210 | 211 | that.previous = ui.placeholder.next(); 212 | if (!that.previous.length) { 213 | that.previous = null; 214 | } 215 | }); 216 | 217 | $(document).on("sortover", ".ui-sortable", function(e, ui) { 218 | /** 219 | * We need to know when an item leaves our list and enters another so we 220 | * can replace it with an empty slot. To do this we listen for the 221 | * sortover event which fires whenever an item is dragged over a sortable. 222 | * The ui argument will contain the sortable list from which it came so we 223 | * check if it's equal to us. 224 | * 225 | * The over event is also fired right after the start event, when picking 226 | * up an item to drag, in which case the sender is equal to the list. In 227 | * this case we check if the event triggered on us. 228 | * 229 | * Checking only one of the above is not enough. 230 | */ 231 | 232 | // Ignore if the event triggered on us. 233 | if (this === that.element[0]) return; 234 | 235 | // Ignore if the item didn't come from us. 236 | if (!ui.sender || ui.sender[0] !== that.element[0]) return; 237 | 238 | var inst = ui.sender.data(that.widgetFullName), 239 | o = $("
      ").addClass(that.options.emptyClass); 240 | 241 | if (!inst.previous) { 242 | o.appendTo(inst.element); 243 | } else { 244 | o.insertBefore(inst.previous); 245 | } 246 | 247 | // Refresh the sortable. 248 | //inst.refresh(); 249 | ui.sender.sortable("refresh"); 250 | 251 | // Update capacities. 252 | if (!inst._connected) { 253 | inst._capacity++; 254 | inst._occupied--; 255 | } 256 | 257 | // Prepare the sender in case the item returns to them. 258 | inst._outside = true; 259 | inst._connected = true; 260 | if (inst._spot) { 261 | inst._spot.remove(); 262 | inst._spot = null; 263 | } 264 | 265 | inst.element.removeClass("full"); 266 | }); 267 | }, 268 | 269 | _destroy: function() { 270 | this.element.removeClass("fsortable full"); 271 | if (!this.options.existingSortable) { 272 | this.element.sortable("destroy"); 273 | } 274 | }, 275 | 276 | refresh: function() { 277 | this._refresh(); 278 | this.element.sortable("refresh"); 279 | }, 280 | 281 | size: function() { 282 | return this._size; 283 | }, 284 | 285 | capacity: function() { 286 | return this._capacity; 287 | }, 288 | 289 | occupied: function() { 290 | return this._occupied; 291 | } 292 | }); 293 | 294 | -------------------------------------------------------------------------------- /tests/.jshintrc: -------------------------------------------------------------------------------- 1 | { 2 | "eqeqeq": true, 3 | "eqnull": true, 4 | "noarg": true, 5 | "quotmark": "double", 6 | "smarttabs": true, 7 | "trailing": true, 8 | "undef": true, 9 | "unused": true, 10 | 11 | "browser": true, 12 | "jquery": true, 13 | 14 | "globals": { 15 | "QUnit": false, 16 | "ok": false, 17 | "equal": false, 18 | "asyncTest": false, 19 | "notEqual": false, 20 | "deepEqual": false, 21 | "strictEqual": false, 22 | "notStrictEqual": false, 23 | "start": false, 24 | "stop": false, 25 | "expect": false, 26 | "throws": false, 27 | 28 | "findCenter": false, 29 | "dd": false, 30 | "testfsortable": false, 31 | 32 | "module": true, 33 | "test": true 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /tests/index.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | Test fsortable 4 | 5 | 6 | 7 | 8 | 9 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 |
      28 |
      29 |
      30 |
      31 |
      32 |
      33 |
      34 |
      35 |
      36 | 37 |
      38 |
      1
      39 |
      40 |
      41 |
      42 |
      2
      43 |
      44 | 45 |
      46 |
      1
      47 |
      2
      48 |
      3
      49 |
      4
      50 |
      5
      51 |
      52 | 53 |
       
      54 | 55 |
      56 |
      6
      57 |
      7
      58 |
      8
      59 |
      9
      60 |
      10
      61 |
      11
      62 |
      63 |
      64 |
      65 | 66 | 67 | 68 | -------------------------------------------------------------------------------- /tests/test_connected.js: -------------------------------------------------------------------------------- 1 | module("connected", { 2 | setup: function() { 3 | $("#fsortable, #fsortable2").fsortable({ 4 | connectWith: "#fsortable, #fsortable2" 5 | }); 6 | $("#items .item").draggable({ 7 | connectToSortable: "#fsortable, #fsortable2", 8 | helper: "clone" 9 | }); 10 | } 11 | }); 12 | test("test_first_to_first", function() { 13 | dd("#fsortable2 .item:first", "#fsortable .fsortable-empty:first"); 14 | testfsortable("#fsortable", [1, null, null, null, null]); 15 | testfsortable("#fsortable2", [null, null, null, null, 2]); 16 | }); 17 | 18 | test("test_first_to_last", function() { 19 | // Use drag offset because of sortable bug. 20 | dd("#fsortable2 .item:first", "#fsortable .fsortable-empty:last", 60, 0); 21 | testfsortable("#fsortable", [null, null, null, null, 1]); 22 | testfsortable("#fsortable2", [null, null, null, null, 2]); 23 | }); 24 | 25 | test("test_last_to_first", function() { 26 | dd("#fsortable2 .item:last", "#fsortable .fsortable-empty:first"); 27 | testfsortable("#fsortable", [2, null, null, null, null]); 28 | testfsortable("#fsortable2", [1, null, null, null, null]); 29 | }); 30 | 31 | test("test_last_to_last", function() { 32 | dd("#fsortable2 .item:last", "#fsortable .fsortable-empty:last"); 33 | testfsortable("#fsortable", [null, null, null, null, 2]); 34 | testfsortable("#fsortable2", [1, null, null, null, null]); 35 | }); 36 | 37 | test("test_over_connected_then_out_then_back_over", function() { 38 | var from = "#fsortable2 .item:first", 39 | to = "#fsortable .fsortable-empty:first"; 40 | 41 | var fromOffset = findCenter($(from)), 42 | toOffset = findCenter($(to)); 43 | 44 | $(from).simulate("mousedown", fromOffset); 45 | $(document).simulate("mousemove", toOffset); 46 | toOffset.clientY += 500; 47 | $(document).simulate("mousemove", toOffset); 48 | toOffset.clientY -= 501; 49 | $(document).simulate("mousemove", toOffset); 50 | $(from).simulate("mouseup", toOffset); 51 | $(from).simulate("click", toOffset); 52 | 53 | testfsortable("#fsortable", [1, null, null, null, null]); 54 | testfsortable("#fsortable2", [null, null, null, null, 2]); 55 | }); 56 | 57 | test("test_over_connected_then_back", function() { 58 | var from = "#fsortable2 .item:first", 59 | to = "#fsortable .fsortable-empty:first"; 60 | 61 | var fromOffset = findCenter($(from)), 62 | toOffset = findCenter($(to)); 63 | 64 | $(from).simulate("mousedown", fromOffset); 65 | $(document).simulate("mousemove", toOffset); 66 | // Use offset due to sortable bug. 67 | fromOffset.clientX += 10; 68 | $(document).simulate("mousemove", fromOffset); 69 | $(from).simulate("mouseup", fromOffset); 70 | $(from).simulate("click", fromOffset); 71 | 72 | testfsortable("#fsortable", [null, null, null, null, null]); 73 | testfsortable("#fsortable2", [1, null, null, null, 2]); 74 | }); 75 | 76 | test("test_stress_drag_connected", function() { 77 | var from = "#fsortable2 .item:first", 78 | to = "#fsortable .fsortable-empty:first"; 79 | 80 | var fromOffset = findCenter($(from)), 81 | toOffset = findCenter($(to)); 82 | 83 | var steps = 20; 84 | 85 | $(from).simulate("mousedown", fromOffset); 86 | $(document).simulate("mousemove", toOffset); 87 | 88 | for (var i = 0; i < steps; i++) { 89 | $(document).simulate("mousemove", fromOffset); 90 | $(document).simulate("mousemove", toOffset); 91 | } 92 | 93 | $(from).simulate("mouseup", toOffset); 94 | $(from).simulate("click", toOffset); 95 | testfsortable("#fsortable", [1, null, null, null, null]); 96 | testfsortable("#fsortable2", [null, null, null, null, 2]); 97 | }); 98 | 99 | -------------------------------------------------------------------------------- /tests/test_core.js: -------------------------------------------------------------------------------- 1 | module("core"); 2 | test("test_create", function() { 3 | ok($("#fsortable").fsortable().hasClass("fsortable")); 4 | ok($("#fsortable").sortable("instance")); 5 | ok(!$("#fsortable").hasClass("full"), "doesn't have full class"); 6 | }); 7 | 8 | test("test_destroy", function() { 9 | ok(!$("#fsortable").fsortable().fsortable("destroy").hasClass("fsortable")); 10 | ok(!$("#fsortable").fsortable("instance")); 11 | ok(!$("#fsortable").sortable("instance")); 12 | ok(!$("#fsortable").hasClass("full"), "doesn't have full class"); 13 | }); 14 | 15 | test("test_destroy_full", function() { 16 | ok(!$("#fsortable3").fsortable().fsortable("destroy").hasClass("fsortable")); 17 | ok(!$("#fsortable3").hasClass("full"), "doesn't have full class"); 18 | }); 19 | 20 | test("test_size_empty", function() { 21 | $("#fsortable").fsortable(); 22 | equal($("#fsortable").fsortable("size"), 5, "size is correct"); 23 | equal($("#fsortable").fsortable("capacity"), 5, "capacity is correct"); 24 | equal($("#fsortable").fsortable("occupied"), 0, "occupied is correct"); 25 | ok(!$("#fsortable").hasClass("full"), "doesn't have full class"); 26 | }); 27 | 28 | test("test_size_full", function() { 29 | $("#fsortable3").fsortable(); 30 | equal($("#fsortable3").fsortable("size"), 5, "size is correct"); 31 | equal($("#fsortable3").fsortable("capacity"), 0, "capacity is correct"); 32 | equal($("#fsortable3").fsortable("occupied"), 5, "occupied is correct"); 33 | ok($("#fsortable3").hasClass("full"), "has full class"); 34 | }); 35 | 36 | test("test_size_partial", function() { 37 | $("#fsortable div").slice(3).remove(); 38 | var i = $("
      ").text("test"); 39 | i.clone().appendTo("#fsortable"); 40 | i.clone().appendTo("#fsortable"); 41 | 42 | $("#fsortable").fsortable(); 43 | equal($("#fsortable").fsortable("size"), 5, "size is correct"); 44 | equal($("#fsortable").fsortable("capacity"), 3, "capacity is correct"); 45 | equal($("#fsortable").fsortable("occupied"), 2, "occupied is correct"); 46 | ok(!$("#fsortable").hasClass("full"), "doesn't have full class"); 47 | }); 48 | 49 | test("test_drag_empty_slot", function() { 50 | var startCount = 0; 51 | 52 | $("#fsortable").fsortable(); 53 | $("#fsortable").on("sortstart", function() { 54 | startCount++; 55 | }); 56 | 57 | $("#fsortable .fsortable-empty:first").simulate("drag", {dx: 50}); 58 | equal(startCount, 0, "nothing dragged"); 59 | }); 60 | 61 | test("test_existing_sortable", function() { 62 | $("#fsortable").sortable({cancel: ".test"}).fsortable({existingSortable: true}); 63 | equal($("#fsortable").sortable("option", "cancel"), ".test, .fsortable-empty"); 64 | }); 65 | 66 | test("test_existing_sortable_destroy", function() { 67 | $("#fsortable").sortable({cancel: ".test"}).fsortable({existingSortable: true}); 68 | $("#fsortable").fsortable("destroy"); 69 | 70 | ok(!$("#fsortable").fsortable("instance")); 71 | ok($("#fsortable").sortable("instance")); 72 | }); 73 | 74 | -------------------------------------------------------------------------------- /tests/test_draggable.js: -------------------------------------------------------------------------------- 1 | module("draggable", { 2 | setup: function() { 3 | $("#fsortable").fsortable(); 4 | $("#items .item").draggable({ 5 | connectToSortable: "#fsortable", 6 | helper: "clone" 7 | }); 8 | } 9 | }); 10 | test("test_drag_item_to_first_slot", function() { 11 | dd("#items .item:first", "#fsortable .fsortable-empty:first"); 12 | testfsortable("#fsortable", [6, null, null, null, null]); 13 | }); 14 | 15 | test("test_drag_item_to_last_slot", function() { 16 | dd("#items .item:first", "#fsortable .fsortable-empty:last"); 17 | testfsortable("#fsortable", [null, null, null, null, 6]); 18 | }); 19 | 20 | test("test_drag_item_to_first_slot_and_drop_outside", function() { 21 | var from = "#items .item:first", 22 | to = "#fsortable .fsortable-empty:first"; 23 | 24 | var fromOffset = findCenter($(from)), 25 | toOffset = findCenter($(to)); 26 | 27 | $(from).simulate("mousedown", fromOffset); 28 | $(document).simulate("mousemove", toOffset); 29 | toOffset.clientY += 50; 30 | $(document).simulate("mousemove", toOffset); 31 | $(from).simulate("mouseup", toOffset); 32 | $(from).simulate("click", toOffset); 33 | testfsortable("#fsortable", [null, null, null, null, null]); 34 | }); 35 | 36 | test("test_drag_item_to_last_slot_and_drop_outside", function() { 37 | var from = "#items .item:first", 38 | to = "#fsortable .fsortable-empty:last"; 39 | 40 | var fromOffset = findCenter($(from)), 41 | toOffset = findCenter($(to)); 42 | 43 | $(from).simulate("mousedown", fromOffset); 44 | $(document).simulate("mousemove", toOffset); 45 | toOffset.clientY += 50; 46 | $(document).simulate("mousemove", toOffset); 47 | $(from).simulate("mouseup", toOffset); 48 | $(from).simulate("click", toOffset); 49 | testfsortable("#fsortable", [null, null, null, null, null]); 50 | }); 51 | 52 | test("test_drag_item_to_first_slot_then_outside_then_back_to_first", function() { 53 | var from = "#items .item:first", 54 | to = "#fsortable .fsortable-empty:first"; 55 | 56 | var fromOffset = findCenter($(from)), 57 | toOffset = findCenter($(to)); 58 | 59 | $(from).simulate("mousedown", fromOffset); 60 | $(document).simulate("mousemove", toOffset); 61 | toOffset.clientY += 50; 62 | $(document).simulate("mousemove", toOffset); 63 | toOffset.clientY -= 51; 64 | $(document).simulate("mousemove", toOffset); 65 | $(from).simulate("mouseup", toOffset); 66 | $(from).simulate("click", toOffset); 67 | testfsortable("#fsortable", [6, null, null, null, null]); 68 | }); 69 | 70 | test("test_drag_over_first_occupied_slot", function() { 71 | dd("#items .item:first", "#fsortable .fsortable-empty:first"); 72 | dd("#items .item:first", "#fsortable .fsortable-empty:first"); 73 | testfsortable("#fsortable", [6, 6, null, null, null]); 74 | }); 75 | 76 | test("test_drag_over_last_occupied_slot", function() { 77 | dd("#items .item:first", "#fsortable .fsortable-empty:last"); 78 | dd("#items .item:first", "#fsortable .fsortable-empty:last"); 79 | testfsortable("#fsortable", [null, null, null, 6, 6]); 80 | }); 81 | 82 | test("test_drag_till_full", function() { 83 | for (var i = 0; i < 5; i++) { 84 | dd("#items .item:first", "#fsortable .fsortable-empty:first"); 85 | } 86 | testfsortable("#fsortable", [6, 6, 6, 6, 6]); 87 | }); 88 | 89 | -------------------------------------------------------------------------------- /tests/test_sort.js: -------------------------------------------------------------------------------- 1 | module("sort"); 2 | test("test_sort_first_to_last", function() { 3 | $("#fsortable3").fsortable(); 4 | 5 | dd("#fsortable3 .item:first", "#fsortable3 .item:last", 1, 1); 6 | testfsortable("#fsortable3", [2, 3, 4, 5, 1]); 7 | }); 8 | 9 | test("test_sort_last_to_first", function() { 10 | $("#fsortable3").fsortable(); 11 | 12 | dd("#fsortable3 .item:last", "#fsortable3 .item:first", -1, -1); 13 | testfsortable("#fsortable3", [5, 1, 2, 3, 4]); 14 | }); 15 | 16 | -------------------------------------------------------------------------------- /tests/tests.css: -------------------------------------------------------------------------------- 1 | .fs { 2 | /*float: left;*/ 3 | height: 25px; 4 | width: 125px; 5 | margin-right: 5px; 6 | } 7 | 8 | .fsortable-empty, .fs div { 9 | float: left; 10 | height: 20px; 11 | width: 20px; 12 | margin: 2px; 13 | } 14 | 15 | #items { 16 | height: 25px; 17 | width: 150px; 18 | } 19 | 20 | .item { 21 | float: left; 22 | height: 20px; 23 | width: 20px; 24 | margin: 2px; 25 | } 26 | 27 | #qunit-fixture { 28 | /*position: static !important;*/ 29 | } 30 | -------------------------------------------------------------------------------- /tests/utils.js: -------------------------------------------------------------------------------- 1 | /* jslint unused: false */ 2 | function findCenter(elem) { 3 | var offset, 4 | document = $(elem[0].ownerDocument); 5 | offset = elem.offset(); 6 | 7 | return { 8 | clientX: offset.left + elem.outerWidth() / 2 - document.scrollLeft(), 9 | clientY: offset.top + elem.outerHeight() / 2 - document.scrollTop() 10 | }; 11 | } 12 | 13 | function dd(from, to, _dx, _dy, _moves) { 14 | // Drag and drop from -> to. 15 | var fromOffset = findCenter($(from)), 16 | toOffset = findCenter($(to)), 17 | dx = toOffset.clientX - fromOffset.clientX + (_dx || 0), 18 | dy = toOffset.clientY - fromOffset.clientY + (_dy || 0), 19 | moves = _moves || 50; 20 | 21 | $(from).simulate("drag", { 22 | dx: dx - 1, 23 | dy: dy - 1, 24 | moves: moves 25 | }); 26 | } 27 | 28 | function testfsortable(fs, els) { 29 | var size = els.length, 30 | capacity = 0, 31 | occupied = 0; 32 | 33 | equal($(fs).children().length, els.length, "correct number of elements"); 34 | 35 | $(fs).children().each(function(i) { 36 | if (els[i]) { 37 | occupied++; 38 | ok(!$(this).hasClass("fsortable-empty"), "slot " + i + " is not empty"); 39 | equal($(this).text(), els[i], "slot " + i + " has correct content"); 40 | } else { 41 | capacity++; 42 | ok($(this).hasClass("fsortable-empty"), "slot " + i + " is empty"); 43 | } 44 | }); 45 | 46 | equal($(fs).fsortable("size"), size, "size is corrrect"); 47 | equal($(fs).fsortable("capacity"), capacity, "capacity is correct"); 48 | equal($(fs).fsortable("occupied"), occupied, "occupied is correct"); 49 | if (!capacity) { 50 | ok($(fs).hasClass("full"), "is full"); 51 | } else { 52 | ok(!$(fs).hasClass("full"), "is not full"); 53 | } 54 | } 55 | /* jslint unused: true */ 56 | 57 | --------------------------------------------------------------------------------