Browse files

massive refactor ;) - converting to Alloy project

  • Loading branch information...
1 parent b94618b commit 98c37a12dba3d3264374ab84a1846d2370e94fc2 @kwhinnery kwhinnery committed Sep 8, 2012
Showing with 2,991 additions and 859 deletions.
  1. +2 −2 .gitignore
  2. +219 −0 LICENSE
  3. +1 −675 LICENSE.txt
  4. +7 −36 README
  5. +58 −0 Resources/alloy.js
  6. +1 −0 Resources/alloy/CFG.js
  7. +531 −0 Resources/alloy/backbone.js
  8. +34 −0 Resources/alloy/controllers/BaseController.js
  9. +20 −0 Resources/alloy/controllers/DashboardView.js
  10. +22 −0 Resources/alloy/controllers/LoginView.js
  11. +156 −0 Resources/alloy/controllers/SocialLoginView.js
  12. +25 −0 Resources/alloy/controllers/index.js
  13. +564 −0 Resources/alloy/social.js
  14. +23 −0 Resources/alloy/string.js
  15. +44 −0 Resources/alloy/sync/localStorage.js
  16. +26 −0 Resources/alloy/sync/properties.js
  17. +133 −0 Resources/alloy/sync/sql.js
  18. +451 −0 Resources/alloy/underscore.js
  19. BIN Resources/android/appicon.png
  20. BIN Resources/android/default.png
  21. BIN Resources/android/images/res-long-land-hdpi/default.png
  22. BIN Resources/android/images/res-long-land-ldpi/default.png
  23. BIN Resources/android/images/res-long-port-hdpi/default.png
  24. BIN Resources/android/images/res-long-port-ldpi/default.png
  25. BIN Resources/android/images/res-notlong-land-hdpi/default.png
  26. BIN Resources/android/images/res-notlong-land-ldpi/default.png
  27. BIN Resources/android/images/res-notlong-land-mdpi/default.png
  28. BIN Resources/android/images/res-notlong-port-hdpi/default.png
  29. BIN Resources/android/images/res-notlong-port-ldpi/default.png
  30. BIN Resources/android/images/res-notlong-port-mdpi/default.png
  31. +2 −95 Resources/app.js
  32. BIN Resources/img/bg.png
  33. BIN Resources/img/codestrong-logo.png
  34. BIN Resources/img/facebook_down.png
  35. BIN Resources/img/facebook_up.png
  36. BIN Resources/img/linkedin_down.png
  37. BIN Resources/img/linkedin_up.png
  38. BIN Resources/img/space-man.png
  39. BIN Resources/img/spaceship.png
  40. BIN Resources/img/twitter_down.png
  41. BIN Resources/img/twitter_up.png
  42. BIN Resources/iphone/Default-Landscape.png
  43. BIN Resources/iphone/Default-Portrait.png
  44. BIN Resources/iphone/Default.png
  45. BIN Resources/iphone/Default@2x.png
  46. BIN Resources/iphone/appicon.png
  47. BIN Resources/mobileweb/appicon.png
  48. BIN Resources/mobileweb/apple_startup_images/Default-Landscape.jpg
  49. BIN Resources/mobileweb/apple_startup_images/Default-Landscape.png
  50. BIN Resources/mobileweb/apple_startup_images/Default-Portrait.jpg
  51. BIN Resources/mobileweb/apple_startup_images/Default-Portrait.png
  52. BIN Resources/mobileweb/apple_startup_images/Default.jpg
  53. BIN Resources/mobileweb/apple_startup_images/Default.png
  54. +8 −0 Resources/mobileweb/apple_startup_images/README
  55. +49 −0 Resources/mobileweb/splash/README
  56. BIN Resources/mobileweb/splash/appc.png
  57. +60 −0 Resources/mobileweb/splash/splash.css
  58. 0 Resources/mobileweb/splash/splash.html
  59. BIN Resources/mobileweb/splash/titanium.png
  60. +29 −0 app/README
  61. +5 −0 app/alloy.jmk
  62. BIN app/assets/img/bg.png
  63. BIN app/assets/img/codestrong-logo.png
  64. BIN app/assets/img/facebook_down.png
  65. BIN app/assets/img/facebook_up.png
  66. BIN app/assets/img/linkedin_down.png
  67. BIN app/assets/img/linkedin_up.png
  68. BIN app/assets/img/space-man.png
  69. BIN app/assets/img/spaceship.png
  70. BIN app/assets/img/twitter_down.png
  71. BIN app/assets/img/twitter_up.png
  72. +9 −0 app/config.json
  73. +1 −0 app/config/alloy.json
  74. +8 −0 app/config/config.json
  75. +14 −0 app/controllers/DashboardView.js
  76. 0 app/controllers/LoginView.js
  77. +91 −0 app/controllers/SocialLoginView.js
  78. +37 −0 app/controllers/index.js
  79. 0 app/styles/DashboardView.tss
  80. +11 −0 app/styles/LoginView.tss
  81. +69 −0 app/styles/SocialLoginView.tss
  82. +12 −0 app/styles/app.tss
  83. +3 −0 app/styles/index.tss
  84. +5 −0 app/views/DashboardView.xml
  85. +6 −0 app/views/LoginView.xml
  86. +25 −0 app/views/SocialLoginView.xml
  87. +6 −0 app/views/index.xml
  88. +15 −0 i18n/en/strings.xml
  89. +8 −8 manifest
  90. +1 −0 modules/android/ti.physicalsizecategory/1.0/LICENSE
  91. +40 −0 modules/android/ti.physicalsizecategory/1.0/documentation/index.html
  92. +19 −0 modules/android/ti.physicalsizecategory/1.0/example/app.js
  93. BIN modules/android/ti.physicalsizecategory/1.0/libs/armeabi-v7a/libti.physicalSizeCategory.so
  94. BIN modules/android/ti.physicalsizecategory/1.0/libs/armeabi/libti.physicalSizeCategory.so
  95. BIN modules/android/ti.physicalsizecategory/1.0/libs/x86/libti.physicalSizeCategory.so
  96. +18 −0 modules/android/ti.physicalsizecategory/1.0/manifest
  97. BIN modules/android/ti.physicalsizecategory/1.0/physicalsizecategory.jar
  98. +13 −0 modules/android/ti.physicalsizecategory/1.0/timodule.xml
  99. +44 −0 plugins/ti.alloy/plugin.py
  100. BIN plugins/ti.alloy/plugin.pyc
  101. +66 −0 tiapp.sample.xml
  102. +0 −43 tiapp.xml
View
4 .gitignore
@@ -1,8 +1,8 @@
tmp
-build/android/*
-build/iphone/*
+build
.settings
.project
.DS_Store
build.log
.fastdev.lock
+tiapp.xml
View
219 LICENSE
@@ -0,0 +1,219 @@
+Copyright 2008-2012 Appcelerator, Inc.
+
+ Licensed under the Apache License, Version 2.0 (the "License");
+ you may not use this file except in compliance with the License.
+ You may obtain a copy of the License at
+
+ http://www.apache.org/licenses/LICENSE-2.0
+
+ (or the full text of the license is below)
+
+ Unless required by applicable law or agreed to in writing, software
+ distributed under the License is distributed on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ See the License for the specific language governing permissions and
+ limitations under the License.
+
+
+
+ Apache License
+ Version 2.0, January 2004
+ http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+ "License" shall mean the terms and conditions for use, reproduction,
+ and distribution as defined by Sections 1 through 9 of this document.
+
+ "Licensor" shall mean the copyright owner or entity authorized by
+ the copyright owner that is granting the License.
+
+ "Legal Entity" shall mean the union of the acting entity and all
+ other entities that control, are controlled by, or are under common
+ control with that entity. For the purposes of this definition,
+ "control" means (i) the power, direct or indirect, to cause the
+ direction or management of such entity, whether by contract or
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
+ outstanding shares, or (iii) beneficial ownership of such entity.
+
+ "You" (or "Your") shall mean an individual or Legal Entity
+ exercising permissions granted by this License.
+
+ "Source" form shall mean the preferred form for making modifications,
+ including but not limited to software source code, documentation
+ source, and configuration files.
+
+ "Object" form shall mean any form resulting from mechanical
+ transformation or translation of a Source form, including but
+ not limited to compiled object code, generated documentation,
+ and conversions to other media types.
+
+ "Work" shall mean the work of authorship, whether in Source or
+ Object form, made available under the License, as indicated by a
+ copyright notice that is included in or attached to the work
+ (an example is provided in the Appendix below).
+
+ "Derivative Works" shall mean any work, whether in Source or Object
+ form, that is based on (or derived from) the Work and for which the
+ editorial revisions, annotations, elaborations, or other modifications
+ represent, as a whole, an original work of authorship. For the purposes
+ of this License, Derivative Works shall not include works that remain
+ separable from, or merely link (or bind by name) to the interfaces of,
+ the Work and Derivative Works thereof.
+
+ "Contribution" shall mean any work of authorship, including
+ the original version of the Work and any modifications or additions
+ to that Work or Derivative Works thereof, that is intentionally
+ submitted to Licensor for inclusion in the Work by the copyright owner
+ or by an individual or Legal Entity authorized to submit on behalf of
+ the copyright owner. For the purposes of this definition, "submitted"
+ means any form of electronic, verbal, or written communication sent
+ to the Licensor or its representatives, including but not limited to
+ communication on electronic mailing lists, source code control systems,
+ and issue tracking systems that are managed by, or on behalf of, the
+ Licensor for the purpose of discussing and improving the Work, but
+ excluding communication that is conspicuously marked or otherwise
+ designated in writing by the copyright owner as "Not a Contribution."
+
+ "Contributor" shall mean Licensor and any individual or Legal Entity
+ on behalf of whom a Contribution has been received by Licensor and
+ subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ copyright license to reproduce, prepare Derivative Works of,
+ publicly display, publicly perform, sublicense, and distribute the
+ Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ (except as stated in this section) patent license to make, have made,
+ use, offer to sell, sell, import, and otherwise transfer the Work,
+ where such license applies only to those patent claims licensable
+ by such Contributor that are necessarily infringed by their
+ Contribution(s) alone or by combination of their Contribution(s)
+ with the Work to which such Contribution(s) was submitted. If You
+ institute patent litigation against any entity (including a
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
+ or a Contribution incorporated within the Work constitutes direct
+ or contributory patent infringement, then any patent licenses
+ granted to You under this License for that Work shall terminate
+ as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+ Work or Derivative Works thereof in any medium, with or without
+ modifications, and in Source or Object form, provided that You
+ meet the following conditions:
+
+ (a) You must give any other recipients of the Work or
+ Derivative Works a copy of this License; and
+
+ (b) You must cause any modified files to carry prominent notices
+ stating that You changed the files; and
+
+ (c) You must retain, in the Source form of any Derivative Works
+ that You distribute, all copyright, patent, trademark, and
+ attribution notices from the Source form of the Work,
+ excluding those notices that do not pertain to any part of
+ the Derivative Works; and
+
+ (d) If the Work includes a "NOTICE" text file as part of its
+ distribution, then any Derivative Works that You distribute must
+ include a readable copy of the attribution notices contained
+ within such NOTICE file, excluding those notices that do not
+ pertain to any part of the Derivative Works, in at least one
+ of the following places: within a NOTICE text file distributed
+ as part of the Derivative Works; within the Source form or
+ documentation, if provided along with the Derivative Works; or,
+ within a display generated by the Derivative Works, if and
+ wherever such third-party notices normally appear. The contents
+ of the NOTICE file are for informational purposes only and
+ do not modify the License. You may add Your own attribution
+ notices within Derivative Works that You distribute, alongside
+ or as an addendum to the NOTICE text from the Work, provided
+ that such additional attribution notices cannot be construed
+ as modifying the License.
+
+ You may add Your own copyright statement to Your modifications and
+ may provide additional or different license terms and conditions
+ for use, reproduction, or distribution of Your modifications, or
+ for any such Derivative Works as a whole, provided Your use,
+ reproduction, and distribution of the Work otherwise complies with
+ the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+ any Contribution intentionally submitted for inclusion in the Work
+ by You to the Licensor shall be under the terms and conditions of
+ this License, without any additional terms or conditions.
+ Notwithstanding the above, nothing herein shall supersede or modify
+ the terms of any separate license agreement you may have executed
+ with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+ names, trademarks, service marks, or product names of the Licensor,
+ except as required for reasonable and customary use in describing the
+ origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+ agreed to in writing, Licensor provides the Work (and each
+ Contributor provides its Contributions) on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+ implied, including, without limitation, any warranties or conditions
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+ PARTICULAR PURPOSE. You are solely responsible for determining the
+ appropriateness of using or redistributing the Work and assume any
+ risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+ whether in tort (including negligence), contract, or otherwise,
+ unless required by applicable law (such as deliberate and grossly
+ negligent acts) or agreed to in writing, shall any Contributor be
+ liable to You for damages, including any direct, indirect, special,
+ incidental, or consequential damages of any character arising as a
+ result of this License or out of the use or inability to use the
+ Work (including but not limited to damages for loss of goodwill,
+ work stoppage, computer failure or malfunction, or any and all
+ other commercial damages or losses), even if such Contributor
+ has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+ the Work or Derivative Works thereof, You may choose to offer,
+ and charge a fee for, acceptance of support, warranty, indemnity,
+ or other liability obligations and/or rights consistent with this
+ License. However, in accepting such obligations, You may act only
+ on Your own behalf and on Your sole responsibility, not on behalf
+ of any other Contributor, and only if You agree to indemnify,
+ defend, and hold each Contributor harmless for any liability
+ incurred by, or claims asserted against, such Contributor by reason
+ of your accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+APPENDIX: How to apply the Apache License to your work.
+
+ To apply the Apache License to your work, attach the following
+ boilerplate notice, with the fields enclosed by brackets "[]"
+ replaced with your own identifying information. (Don't include
+ the brackets!) The text should be enclosed in the appropriate
+ comment syntax for the file format. We also recommend that a
+ file or class name and description of purpose be included on the
+ same "printed page" as the copyright notice for easier
+ identification within third-party archives.
+
+Copyright [yyyy] [name of copyright owner]
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this file except in compliance with the License.
+You may obtain a copy of the License at
+
+ http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software
+distributed under the License is distributed on an "AS IS" BASIS,
+WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+See the License for the specific language governing permissions and
+limitations under the License.
View
676 LICENSE.txt
@@ -1,675 +1 @@
- GNU GENERAL PUBLIC LICENSE
- Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
- Preamble
-
- The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
- The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works. By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users. We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors. You can apply it to
-your programs, too.
-
- When we speak of free software, we are referring to freedom, not
-price. Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
- To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights. Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
- For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received. You must make sure that they, too, receive
-or can get the source code. And you must show them these terms so they
-know their rights.
-
- Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
- For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software. For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
- Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so. This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software. The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable. Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products. If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
- Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary. To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
- The precise terms and conditions for copying, distribution and
-modification follow.
-
- TERMS AND CONDITIONS
-
- 0. Definitions.
-
- "This License" refers to version 3 of the GNU General Public License.
-
- "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
- "The Program" refers to any copyrightable work licensed under this
-License. Each licensee is addressed as "you". "Licensees" and
-"recipients" may be individuals or organizations.
-
- To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy. The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
- A "covered work" means either the unmodified Program or a work based
-on the Program.
-
- To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy. Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
- To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies. Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
- An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License. If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
- 1. Source Code.
-
- The "source code" for a work means the preferred form of the work
-for making modifications to it. "Object code" means any non-source
-form of a work.
-
- A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
- The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form. A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
- The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities. However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work. For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
- The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
- The Corresponding Source for a work in source code form is that
-same work.
-
- 2. Basic Permissions.
-
- All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met. This License explicitly affirms your unlimited
-permission to run the unmodified Program. The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work. This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
- You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force. You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright. Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
- Conveying under any other circumstances is permitted solely under
-the conditions stated below. Sublicensing is not allowed; section 10
-makes it unnecessary.
-
- 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
- No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
- When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
- 4. Conveying Verbatim Copies.
-
- You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
- You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
- 5. Conveying Modified Source Versions.
-
- You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
- a) The work must carry prominent notices stating that you modified
- it, and giving a relevant date.
-
- b) The work must carry prominent notices stating that it is
- released under this License and any conditions added under section
- 7. This requirement modifies the requirement in section 4 to
- "keep intact all notices".
-
- c) You must license the entire work, as a whole, under this
- License to anyone who comes into possession of a copy. This
- License will therefore apply, along with any applicable section 7
- additional terms, to the whole of the work, and all its parts,
- regardless of how they are packaged. This License gives no
- permission to license the work in any other way, but it does not
- invalidate such permission if you have separately received it.
-
- d) If the work has interactive user interfaces, each must display
- Appropriate Legal Notices; however, if the Program has interactive
- interfaces that do not display Appropriate Legal Notices, your
- work need not make them do so.
-
- A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit. Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
- 6. Conveying Non-Source Forms.
-
- You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
- a) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by the
- Corresponding Source fixed on a durable physical medium
- customarily used for software interchange.
-
- b) Convey the object code in, or embodied in, a physical product
- (including a physical distribution medium), accompanied by a
- written offer, valid for at least three years and valid for as
- long as you offer spare parts or customer support for that product
- model, to give anyone who possesses the object code either (1) a
- copy of the Corresponding Source for all the software in the
- product that is covered by this License, on a durable physical
- medium customarily used for software interchange, for a price no
- more than your reasonable cost of physically performing this
- conveying of source, or (2) access to copy the
- Corresponding Source from a network server at no charge.
-
- c) Convey individual copies of the object code with a copy of the
- written offer to provide the Corresponding Source. This
- alternative is allowed only occasionally and noncommercially, and
- only if you received the object code with such an offer, in accord
- with subsection 6b.
-
- d) Convey the object code by offering access from a designated
- place (gratis or for a charge), and offer equivalent access to the
- Corresponding Source in the same way through the same place at no
- further charge. You need not require recipients to copy the
- Corresponding Source along with the object code. If the place to
- copy the object code is a network server, the Corresponding Source
- may be on a different server (operated by you or a third party)
- that supports equivalent copying facilities, provided you maintain
- clear directions next to the object code saying where to find the
- Corresponding Source. Regardless of what server hosts the
- Corresponding Source, you remain obligated to ensure that it is
- available for as long as needed to satisfy these requirements.
-
- e) Convey the object code using peer-to-peer transmission, provided
- you inform other peers where the object code and Corresponding
- Source of the work are being offered to the general public at no
- charge under subsection 6d.
-
- A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
- A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling. In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage. For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product. A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
- "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source. The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
- If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information. But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
- The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed. Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
- Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
- 7. Additional Terms.
-
- "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law. If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
- When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it. (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.) You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
- Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
- a) Disclaiming warranty or limiting liability differently from the
- terms of sections 15 and 16 of this License; or
-
- b) Requiring preservation of specified reasonable legal notices or
- author attributions in that material or in the Appropriate Legal
- Notices displayed by works containing it; or
-
- c) Prohibiting misrepresentation of the origin of that material, or
- requiring that modified versions of such material be marked in
- reasonable ways as different from the original version; or
-
- d) Limiting the use for publicity purposes of names of licensors or
- authors of the material; or
-
- e) Declining to grant rights under trademark law for use of some
- trade names, trademarks, or service marks; or
-
- f) Requiring indemnification of licensors and authors of that
- material by anyone who conveys the material (or modified versions of
- it) with contractual assumptions of liability to the recipient, for
- any liability that these contractual assumptions directly impose on
- those licensors and authors.
-
- All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10. If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term. If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
- If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
- Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
- 8. Termination.
-
- You may not propagate or modify a covered work except as expressly
-provided under this License. Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
- However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
- Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
- Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License. If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
- 9. Acceptance Not Required for Having Copies.
-
- You are not required to accept this License in order to receive or
-run a copy of the Program. Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance. However,
-nothing other than this License grants you permission to propagate or
-modify any covered work. These actions infringe copyright if you do
-not accept this License. Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
- 10. Automatic Licensing of Downstream Recipients.
-
- Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License. You are not responsible
-for enforcing compliance by third parties with this License.
-
- An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations. If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
- You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License. For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
- 11. Patents.
-
- A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based. The
-work thus licensed is called the contributor's "contributor version".
-
- A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version. For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
- Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
- In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement). To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
- If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients. "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
- If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
- A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License. You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
- Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
- 12. No Surrender of Others' Freedom.
-
- If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License. If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all. For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
- 13. Use with the GNU Affero General Public License.
-
- Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work. The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
- 14. Revised Versions of this License.
-
- The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time. Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
- Each version is given a distinguishing version number. If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation. If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
- If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
- Later license versions may give you additional or different
-permissions. However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
- 15. Disclaimer of Warranty.
-
- THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
- 16. Limitation of Liability.
-
- IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
- 17. Interpretation of Sections 15 and 16.
-
- If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
- END OF TERMS AND CONDITIONS
-
- How to Apply These Terms to Your New Programs
-
- If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
- To do so, attach the following notices to the program. It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
- <one line to give the program's name and a brief idea of what it does.>
- Copyright (C) <year> <name of author>
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program. If not, see <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
- If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
- <program> Copyright (C) <year> <name of author>
- This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
- This is free software, and you are welcome to redistribute it
- under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License. Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
- You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
- The GNU General Public License does not permit incorporating your program
-into proprietary programs. If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library. If this is what you want to do, use the GNU Lesser General
-Public License instead of this License. But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.
-
+Place your license text here. This file will be incorporated with your app at package time.
View
43 README
@@ -1,46 +1,17 @@
-/**
- * This file is part of CODESTRONG Mobile.
- *
- * CODESTRONG Mobile is free software: you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation, either version 3 of the License, or
- * (at your option) any later version.
- *
- * CODESTRONG Mobile is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with CODESTRONG Mobile. If not, see <http://www.gnu.org/licenses/>.
- *
- * The CODESTRONG mobile companion app was based off the original work done by the team
- * at palatir.net which included:
- *
- * Larry Garfield
- * Pat Teglia
- * Jen Simmons
- *
- * This code can be located at: https://github.com/palantirnet/drupalcon_mobile
- *
- * The following Appcelerator Employees also spent time answering questions via phone calls, IRC
- * and email and contributed code to the original Drupalcon Mobile application.
- *
- * Tony Guntharp
- * Chad Auld
- * Don Thorp
- * Marshall Culpepper
- * Stephen Tramer
- * Rick Blalock
- */
+Welcome to your Appcelerator Titanium Mobile Project
+
+This is a blank project. Start by editing your application's app.js to
+make your first mobile project using Titanium.
+
+
----------------------------------
Stuff our legal folk make us say:
Appcelerator, Appcelerator Titanium and associated marks and logos are
trademarks of Appcelerator, Inc.
-Titanium is Copyright (c) 2009-2010 by Appcelerator, Inc. All Rights Reserved.
+Titanium is Copyright (c) 2008-2012 by Appcelerator, Inc. All Rights Reserved.
Titanium is licensed under the Apache Public License (Version 2). Please
see the LICENSE file for the full license.
View
58 Resources/alloy.js
@@ -0,0 +1,58 @@
+function isTabletFallback() {
+ return !(Math.min(Ti.Platform.displayCaps.platformHeight, Ti.Platform.displayCaps.platformWidth) < 700);
+}
+
+var _ = require("alloy/underscore")._, Backbone = require("alloy/backbone"), STR = require("alloy/string");
+
+exports._ = _, exports.Backbone = Backbone, Backbone.sync = function(method, model, opts) {
+ var m = model.config || {}, type = (m.adapter ? m.adapter.type : null) || "sql";
+ require("alloy/sync/" + type).sync(model, method, opts);
+}, exports.M = function(name, config, modelFn, migrations) {
+ var type = (config.adapter ? config.adapter.type : null) || "sql", adapter = require("alloy/sync/" + type), extendObj = {
+ defaults: config.defaults,
+ validate: function(attrs) {
+ if (typeof __validate != "undefined" && _.isFunction(__validate)) for (var k in attrs) {
+ var t = __validate(k, attrs[k]);
+ if (!t) return "validation failed for: " + k;
+ }
+ }
+ }, extendClass = {};
+ migrations && (extendClass.migrations = migrations), _.isFunction(adapter.beforeModelCreate) && (config = adapter.beforeModelCreate(config) || config);
+ var Model = Backbone.Model.extend(extendObj, extendClass);
+ return Model.prototype.config = config, _.isFunction(adapter.afterModelCreate) && adapter.afterModelCreate(Model), Model = modelFn(Model) || Model, Model;
+}, exports.A = function(t, type, parent) {
+ return _.extend(t, Backbone.Events), function() {
+ var al = t.addEventListener, rl = t.removeEventListener, oo = t.on, of = t.off, tg = t.trigger, cbs = [], ctx = {};
+ t.on = function(e, cb, context) {
+ var wcb = function(evt) {
+ try {
+ _.bind(tg, ctx, e, evt)();
+ } catch (E) {
+ Ti.API.error("Error triggering '" + e + "' event: " + E);
+ }
+ };
+ cbs[cb] = wcb, al(e, wcb), _.bind(oo, ctx, e, cb, context)();
+ }, t.off = function(e, cb, context) {
+ var f = cbs[cb];
+ f && (_.bind(of, ctx, e, cb, context)(), rl(e, f), delete cbs[cb], f = null);
+ };
+ }(), t;
+}, exports.getWidget = function(id, name, args) {
+ return new (require("alloy/widgets/" + id + "/controllers/" + (name || "widget")))(args);
+}, exports.createWidget = function(id, name, args) {
+ return new (require("alloy/widgets/" + id + "/controllers/" + (name || "widget")))(args);
+}, exports.getController = function(name, args) {
+ return new (require("alloy/controllers/" + name))(args);
+}, exports.createController = function(name, args) {
+ return new (require("alloy/controllers/" + name))(args);
+}, exports.getModel = function(name, args) {
+ return new (require("alloy/models/" + STR.ucfirst(name)).Model)(args);
+}, exports.createModel = function(name, args) {
+ return new (require("alloy/models/" + STR.ucfirst(name)).Model)(args);
+}, exports.getCollection = function(name, args) {
+ return new (require("alloy/models/" + STR.ucfirst(name)).Collection)(args);
+}, exports.createCollection = function(name, args) {
+ return new (require("alloy/models/" + STR.ucfirst(name)).Collection)(args);
+}, exports.isTablet = function() {
+ return Ti.Platform.osname === "ipad";
+}(), exports.isHandheld = !exports.isTablet;
View
1 Resources/alloy/CFG.js
@@ -0,0 +1 @@
+module.exports = {};
View
531 Resources/alloy/backbone.js
@@ -0,0 +1,531 @@
+(function() {
+ var root = this, previousBackbone = root.Backbone, slice = Array.prototype.slice, splice = Array.prototype.splice, Backbone;
+ typeof exports != "undefined" ? Backbone = exports : Backbone = root.Backbone = {}, Backbone.VERSION = "0.9.2";
+ var _ = root._;
+ !_ && typeof require != "undefined" && (_ = require("alloy/underscore"));
+ var $ = root.jQuery || root.Zepto || root.ender;
+ Backbone.setDomLibrary = function(lib) {
+ $ = lib;
+ }, Backbone.noConflict = function() {
+ return root.Backbone = previousBackbone, this;
+ }, Backbone.emulateHTTP = !1, Backbone.emulateJSON = !1;
+ var eventSplitter = /\s+/, Events = Backbone.Events = {
+ on: function(events, callback, context) {
+ var calls, event, node, tail, list;
+ if (!callback) return this;
+ events = events.split(eventSplitter), calls = this._callbacks || (this._callbacks = {});
+ while (event = events.shift()) list = calls[event], node = list ? list.tail : {}, node.next = tail = {}, node.context = context, node.callback = callback, calls[event] = {
+ tail: tail,
+ next: list ? list.next : node
+ };
+ return this;
+ },
+ off: function(events, callback, context) {
+ var event, calls, node, tail, cb, ctx;
+ if (!(calls = this._callbacks)) return;
+ if (!(events || callback || context)) return delete this._callbacks, this;
+ events = events ? events.split(eventSplitter) : _.keys(calls);
+ while (event = events.shift()) {
+ node = calls[event], delete calls[event];
+ if (!node || !callback && !context) continue;
+ tail = node.tail;
+ while ((node = node.next) !== tail) cb = node.callback, ctx = node.context, (callback && cb !== callback || context && ctx !== context) && this.on(event, cb, ctx);
+ }
+ return this;
+ },
+ trigger: function(events) {
+ var event, node, calls, tail, args, all, rest;
+ if (!(calls = this._callbacks)) return this;
+ all = calls.all, events = events.split(eventSplitter), rest = slice.call(arguments, 1);
+ while (event = events.shift()) {
+ if (node = calls[event]) {
+ tail = node.tail;
+ while ((node = node.next) !== tail) node.callback.apply(node.context || this, rest);
+ }
+ if (node = all) {
+ tail = node.tail, args = [ event ].concat(rest);
+ while ((node = node.next) !== tail) node.callback.apply(node.context || this, args);
+ }
+ }
+ return this;
+ }
+ };
+ Events.bind = Events.on, Events.unbind = Events.off;
+ var Model = Backbone.Model = function(attributes, options) {
+ var defaults;
+ attributes || (attributes = {}), options && options.parse && (attributes = this.parse(attributes));
+ if (defaults = getValue(this, "defaults")) attributes = _.extend({}, defaults, attributes);
+ options && options.collection && (this.collection = options.collection), this.attributes = {}, this._escapedAttributes = {}, this.cid = _.uniqueId("c"), this.changed = {}, this._silent = {}, this._pending = {}, this.set(attributes, {
+ silent: !0
+ }), this.changed = {}, this._silent = {}, this._pending = {}, this._previousAttributes = _.clone(this.attributes), this.initialize.apply(this, arguments);
+ };
+ _.extend(Model.prototype, Events, {
+ changed: null,
+ _silent: null,
+ _pending: null,
+ idAttribute: "id",
+ initialize: function() {},
+ toJSON: function(options) {
+ return _.clone(this.attributes);
+ },
+ get: function(attr) {
+ return this.attributes[attr];
+ },
+ escape: function(attr) {
+ var html;
+ if (html = this._escapedAttributes[attr]) return html;
+ var val = this.get(attr);
+ return this._escapedAttributes[attr] = _.escape(val == null ? "" : "" + val);
+ },
+ has: function(attr) {
+ return this.get(attr) != null;
+ },
+ set: function(key, value, options) {
+ var attrs, attr, val;
+ _.isObject(key) || key == null ? (attrs = key, options = value) : (attrs = {}, attrs[key] = value), options || (options = {});
+ if (!attrs) return this;
+ attrs instanceof Model && (attrs = attrs.attributes);
+ if (options.unset) for (attr in attrs) attrs[attr] = void 0;
+ if (!this._validate(attrs, options)) return !1;
+ this.idAttribute in attrs && (this.id = attrs[this.idAttribute]);
+ var changes = options.changes = {}, now = this.attributes, escaped = this._escapedAttributes, prev = this._previousAttributes || {};
+ for (attr in attrs) {
+ val = attrs[attr];
+ if (!_.isEqual(now[attr], val) || options.unset && _.has(now, attr)) delete escaped[attr], (options.silent ? this._silent : changes)[attr] = !0;
+ options.unset ? delete now[attr] : now[attr] = val, !_.isEqual(prev[attr], val) || _.has(now, attr) != _.has(prev, attr) ? (this.changed[attr] = val, options.silent || (this._pending[attr] = !0)) : (delete this.changed[attr], delete this._pending[attr]);
+ }
+ return options.silent || this.change(options), this;
+ },
+ unset: function(attr, options) {
+ return (options || (options = {})).unset = !0, this.set(attr, null, options);
+ },
+ clear: function(options) {
+ return (options || (options = {})).unset = !0, this.set(_.clone(this.attributes), options);
+ },
+ fetch: function(options) {
+ options = options ? _.clone(options) : {};
+ var model = this, success = options.success;
+ return options.success = function(resp, status, xhr) {
+ if (!model.set(model.parse(resp, xhr), options)) return !1;
+ success && success(model, resp);
+ }, options.error = Backbone.wrapError(options.error, model, options), (this.sync || Backbone.sync).call(this, "read", this, options);
+ },
+ save: function(key, value, options) {
+ var attrs, current;
+ _.isObject(key) || key == null ? (attrs = key, options = value) : (attrs = {}, attrs[key] = value), options = options ? _.clone(options) : {};
+ if (options.wait) {
+ if (!this._validate(attrs, options)) return !1;
+ current = _.clone(this.attributes);
+ }
+ var silentOptions = _.extend({}, options, {
+ silent: !0
+ });
+ if (attrs && !this.set(attrs, options.wait ? silentOptions : options)) return !1;
+ var model = this, success = options.success;
+ options.success = function(resp, status, xhr) {
+ var serverAttrs = model.parse(resp, xhr);
+ options.wait && (delete options.wait, serverAttrs = _.extend(attrs || {}, serverAttrs));
+ if (!model.set(serverAttrs, options)) return !1;
+ success ? success(model, resp) : model.trigger("sync", model, resp, options);
+ }, options.error = Backbone.wrapError(options.error, model, options);
+ var method = this.isNew() ? "create" : "update", xhr = (this.sync || Backbone.sync).call(this, method, this, options);
+ return options.wait && this.set(current, silentOptions), xhr;
+ },
+ destroy: function(options) {
+ options = options ? _.clone(options) : {};
+ var model = this, success = options.success, triggerDestroy = function() {
+ model.trigger("destroy", model, model.collection, options);
+ };
+ if (this.isNew()) return triggerDestroy(), !1;
+ options.success = function(resp) {
+ options.wait && triggerDestroy(), success ? success(model, resp) : model.trigger("sync", model, resp, options);
+ }, options.error = Backbone.wrapError(options.error, model, options);
+ var xhr = (this.sync || Backbone.sync).call(this, "delete", this, options);
+ return options.wait || triggerDestroy(), xhr;
+ },
+ url: function() {
+ var base = getValue(this, "urlRoot") || getValue(this.collection, "url") || urlError();
+ return this.isNew() ? base : base + (base.charAt(base.length - 1) == "/" ? "" : "/") + encodeURIComponent(this.id);
+ },
+ parse: function(resp, xhr) {
+ return resp;
+ },
+ clone: function() {
+ return new this.constructor(this.attributes);
+ },
+ isNew: function() {
+ return this.id == null;
+ },
+ change: function(options) {
+ options || (options = {});
+ var changing = this._changing;
+ this._changing = !0;
+ for (var attr in this._silent) this._pending[attr] = !0;
+ var changes = _.extend({}, options.changes, this._silent);
+ this._silent = {};
+ for (var attr in changes) this.trigger("change:" + attr, this, this.get(attr), options);
+ if (changing) return this;
+ while (!_.isEmpty(this._pending)) {
+ this._pending = {}, this.trigger("change", this, options);
+ for (var attr in this.changed) {
+ if (this._pending[attr] || this._silent[attr]) continue;
+ delete this.changed[attr];
+ }
+ this._previousAttributes = _.clone(this.attributes);
+ }
+ return this._changing = !1, this;
+ },
+ hasChanged: function(attr) {
+ return arguments.length ? _.has(this.changed, attr) : !_.isEmpty(this.changed);
+ },
+ changedAttributes: function(diff) {
+ if (!diff) return this.hasChanged() ? _.clone(this.changed) : !1;
+ var val, changed = !1, old = this._previousAttributes;
+ for (var attr in diff) {
+ if (_.isEqual(old[attr], val = diff[attr])) continue;
+ (changed || (changed = {}))[attr] = val;
+ }
+ return changed;
+ },
+ previous: function(attr) {
+ return !arguments.length || !this._previousAttributes ? null : this._previousAttributes[attr];
+ },
+ previousAttributes: function() {
+ return _.clone(this._previousAttributes);
+ },
+ isValid: function() {
+ return !this.validate(this.attributes);
+ },
+ _validate: function(attrs, options) {
+ if (options.silent || !this.validate) return !0;
+ attrs = _.extend({}, this.attributes, attrs);
+ var error = this.validate(attrs, options);
+ return error ? (options && options.error ? options.error(this, error, options) : this.trigger("error", this, error, options), !1) : !0;
+ }
+ });
+ var Collection = Backbone.Collection = function(models, options) {
+ options || (options = {}), options.model && (this.model = options.model), options.comparator && (this.comparator = options.comparator), this._reset(), this.initialize.apply(this, arguments), models && this.reset(models, {
+ silent: !0,
+ parse: options.parse
+ });
+ };
+ _.extend(Collection.prototype, Events, {
+ model: Model,
+ initialize: function() {},
+ toJSON: function(options) {
+ return this.map(function(model) {
+ return model.toJSON(options);
+ });
+ },
+ add: function(models, options) {
+ var i, index, length, model, cid, id, cids = {}, ids = {}, dups = [];
+ options || (options = {}), models = _.isArray(models) ? models.slice() : [ models ];
+ for (i = 0, length = models.length; i < length; i++) {
+ if (!(model = models[i] = this._prepareModel(models[i], options))) throw new Error("Can't add an invalid model to a collection");
+ cid = model.cid, id = model.id;
+ if (cids[cid] || this._byCid[cid] || id != null && (ids[id] || this._byId[id])) {
+ dups.push(i);
+ continue;
+ }
+ cids[cid] = ids[id] = model;
+ }
+ i = dups.length;
+ while (i--) models.splice(dups[i], 1);
+ for (i = 0, length = models.length; i < length; i++) (model = models[i]).on("all", this._onModelEvent, this), this._byCid[model.cid] = model, model.id != null && (this._byId[model.id] = model);
+ this.length += length, index = options.at != null ? options.at : this.models.length, splice.apply(this.models, [ index, 0 ].concat(models)), this.comparator && this.sort({
+ silent: !0
+ });
+ if (options.silent) return this;
+ for (i = 0, length = this.models.length; i < length; i++) {
+ if (!cids[(model = this.models[i]).cid]) continue;
+ options.index = i, model.trigger("add", model, this, options);
+ }
+ return this;
+ },
+ remove: function(models, options) {
+ var i, l, index, model;
+ options || (options = {}), models = _.isArray(models) ? models.slice() : [ models ];
+ for (i = 0, l = models.length; i < l; i++) {
+ model = this.getByCid(models[i]) || this.get(models[i]);
+ if (!model) continue;
+ delete this._byId[model.id], delete this._byCid[model.cid], index = this.indexOf(model), this.models.splice(index, 1), this.length--, options.silent || (options.index = index, model.trigger("remove", model, this, options)), this._removeReference(model);
+ }
+ return this;
+ },
+ push: function(model, options) {
+ return model = this._prepareModel(model, options), this.add(model, options), model;
+ },
+ pop: function(options) {
+ var model = this.at(this.length - 1);
+ return this.remove(model, options), model;
+ },
+ unshift: function(model, options) {
+ return model = this._prepareModel(model, options), this.add(model, _.extend({
+ at: 0
+ }, options)), model;
+ },
+ shift: function(options) {
+ var model = this.at(0);
+ return this.remove(model, options), model;
+ },
+ get: function(id) {
+ return id == null ? void 0 : this._byId[id.id != null ? id.id : id];
+ },
+ getByCid: function(cid) {
+ return cid && this._byCid[cid.cid || cid];
+ },
+ at: function(index) {
+ return this.models[index];
+ },
+ where: function(attrs) {
+ return _.isEmpty(attrs) ? [] : this.filter(function(model) {
+ for (var key in attrs) if (attrs[key] !== model.get(key)) return !1;
+ return !0;
+ });
+ },
+ sort: function(options) {
+ options || (options = {});
+ if (!this.comparator) throw new Error("Cannot sort a set without a comparator");
+ var boundComparator = _.bind(this.comparator, this);
+ return this.comparator.length == 1 ? this.models = this.sortBy(boundComparator) : this.models.sort(boundComparator), options.silent || this.trigger("reset", this, options), this;
+ },
+ pluck: function(attr) {
+ return _.map(this.models, function(model) {
+ return model.get(attr);
+ });
+ },
+ reset: function(models, options) {
+ models || (models = []), options || (options = {});
+ for (var i = 0, l = this.models.length; i < l; i++) this._removeReference(this.models[i]);
+ return this._reset(), this.add(models, _.extend({
+ silent: !0
+ }, options)), options.silent || this.trigger("reset", this, options), this;
+ },
+ fetch: function(options) {
+ options = options ? _.clone(options) : {}, options.parse === undefined && (options.parse = !0);
+ var collection = this, success = options.success;
+ return options.success = function(resp, status, xhr) {
+ collection[options.add ? "add" : "reset"](collection.parse(resp, xhr), options), success && success(collection, resp);
+ }, options.error = Backbone.wrapError(options.error, collection, options), (this.sync || Backbone.sync).call(this, "read", this, options);
+ },
+ create: function(model, options) {
+ var coll = this;
+ options = options ? _.clone(options) : {}, model = this._prepareModel(model, options);
+ if (!model) return !1;
+ options.wait || coll.add(model, options);
+ var success = options.success;
+ return options.success = function(nextModel, resp, xhr) {
+ options.wait && coll.add(nextModel, options), success ? success(nextModel, resp) : nextModel.trigger("sync", model, resp, options);
+ }, model.save(null, options), model;
+ },
+ parse: function(resp, xhr) {
+ return resp;
+ },
+ chain: function() {
+ return _(this.models).chain();
+ },
+ _reset: function(options) {
+ this.length = 0, this.models = [], this._byId = {}, this._byCid = {};
+ },
+ _prepareModel: function(model, options) {
+ options || (options = {});
+ if (model instanceof Model) model.collection || (model.collection = this); else {
+ var attrs = model;
+ options.collection = this, model = new this.model(attrs, options), model._validate(model.attributes, options) || (model = !1);
+ }
+ return model;
+ },
+ _removeReference: function(model) {
+ this == model.collection && delete model.collection, model.off("all", this._onModelEvent, this);
+ },
+ _onModelEvent: function(event, model, collection, options) {
+ if ((event == "add" || event == "remove") && collection != this) return;
+ event == "destroy" && this.remove(model, options), model && event === "change:" + model.idAttribute && (delete this._byId[model.previous(model.idAttribute)], this._byId[model.id] = model), this.trigger.apply(this, arguments);
+ }
+ });
+ var methods = [ "forEach", "each", "map", "reduce", "reduceRight", "find", "detect", "filter", "select", "reject", "every", "all", "some", "any", "include", "contains", "invoke", "max", "min", "sortBy", "sortedIndex", "toArray", "size", "first", "initial", "rest", "last", "without", "indexOf", "shuffle", "lastIndexOf", "isEmpty", "groupBy" ];
+ _.each(methods, function(method) {
+ Collection.prototype[method] = function() {
+ return _[method].apply(_, [ this.models ].concat(_.toArray(arguments)));
+ };
+ });
+ var Router = Backbone.Router = function(options) {
+ options || (options = {}), options.routes && (this.routes = options.routes), this._bindRoutes(), this.initialize.apply(this, arguments);
+ }, namedParam = /:\w+/g, splatParam = /\*\w+/g, escapeRegExp = /[-[\]{}()+?.,\\^$|#\s]/g;
+ _.extend(Router.prototype, Events, {
+ initialize: function() {},
+ route: function(route, name, callback) {
+ return Backbone.history || (Backbone.history = new History), _.isRegExp(route) || (route = this._routeToRegExp(route)), callback || (callback = this[name]), Backbone.history.route(route, _.bind(function(fragment) {
+ var args = this._extractParameters(route, fragment);
+ callback && callback.apply(this, args), this.trigger.apply(this, [ "route:" + name ].concat(args)), Backbone.history.trigger("route", this, name, args);
+ }, this)), this;
+ },
+ navigate: function(fragment, options) {
+ Backbone.history.navigate(fragment, options);
+ },
+ _bindRoutes: function() {
+ if (!this.routes) return;
+ var routes = [];
+ for (var route in this.routes) routes.unshift([ route, this.routes[route] ]);
+ for (var i = 0, l = routes.length; i < l; i++) this.route(routes[i][0], routes[i][1], this[routes[i][1]]);
+ },
+ _routeToRegExp: function(route) {
+ return route = route.replace(escapeRegExp, "\\$&").replace(namedParam, "([^/]+)").replace(splatParam, "(.*?)"), new RegExp("^" + route + "$");
+ },
+ _extractParameters: function(route, fragment) {
+ return route.exec(fragment).slice(1);
+ }
+ });
+ var History = Backbone.History = function() {
+ this.handlers = [], _.bindAll(this, "checkUrl");
+ }, routeStripper = /^[#\/]/, isExplorer = /msie [\w.]+/;
+ History.started = !1, _.extend(History.prototype, Events, {
+ interval: 50,
+ getHash: function(windowOverride) {
+ var loc = windowOverride ? windowOverride.location : window.location, match = loc.href.match(/#(.*)$/);
+ return match ? match[1] : "";
+ },
+ getFragment: function(fragment, forcePushState) {
+ if (fragment == null) if (this._hasPushState || forcePushState) {
+ fragment = window.location.pathname;
+ var search = window.location.search;
+ search && (fragment += search);
+ } else fragment = this.getHash();
+ return fragment.indexOf(this.options.root) || (fragment = fragment.substr(this.options.root.length)), fragment.replace(routeStripper, "");
+ },
+ start: function(options) {
+ if (History.started) throw new Error("Backbone.history has already been started");
+ History.started = !0, this.options = _.extend({}, {
+ root: "/"
+ }, this.options, options), this._wantsHashChange = this.options.hashChange !== !1, this._wantsPushState = !!this.options.pushState, this._hasPushState = !!(this.options.pushState && window.history && window.history.pushState);
+ var fragment = this.getFragment(), docMode = document.documentMode, oldIE = isExplorer.exec(navigator.userAgent.toLowerCase()) && (!docMode || docMode <= 7);
+ oldIE && (this.iframe = $('<iframe src="javascript:0" tabindex="-1" />').hide().appendTo("body")[0].contentWindow, this.navigate(fragment)), this._hasPushState ? $(window).bind("popstate", this.checkUrl) : this._wantsHashChange && "onhashchange" in window && !oldIE ? $(window).bind("hashchange", this.checkUrl) : this._wantsHashChange && (this._checkUrlInterval = setInterval(this.checkUrl, this.interval)), this.fragment = fragment;
+ var loc = window.location, atRoot = loc.pathname == this.options.root;
+ if (this._wantsHashChange && this._wantsPushState && !this._hasPushState && !atRoot) return this.fragment = this.getFragment(null, !0), window.location.replace(this.options.root + "#" + this.fragment), !0;
+ this._wantsPushState && this._hasPushState && atRoot && loc.hash && (this.fragment = this.getHash().replace(routeStripper, ""), window.history.replaceState({}, document.title, loc.protocol + "//" + loc.host + this.options.root + this.fragment));
+ if (!this.options.silent) return this.loadUrl();
+ },
+ stop: function() {
+ $(window).unbind("popstate", this.checkUrl).unbind("hashchange", this.checkUrl), clearInterval(this._checkUrlInterval), History.started = !1;
+ },
+ route: function(route, callback) {
+ this.handlers.unshift({
+ route: route,
+ callback: callback
+ });
+ },
+ checkUrl: function(e) {
+ var current = this.getFragment();
+ current == this.fragment && this.iframe && (current = this.getFragment(this.getHash(this.iframe)));
+ if (current == this.fragment) return !1;
+ this.iframe && this.navigate(current), this.loadUrl() || this.loadUrl(this.getHash());
+ },
+ loadUrl: function(fragmentOverride) {
+ var fragment = this.fragment = this.getFragment(fragmentOverride), matched = _.any(this.handlers, function(handler) {
+ if (handler.route.test(fragment)) return handler.callback(fragment), !0;
+ });
+ return matched;
+ },
+ navigate: function(fragment, options) {
+ if (!History.started) return !1;
+ if (!options || options === !0) options = {
+ trigger: options
+ };
+ var frag = (fragment || "").replace(routeStripper, "");
+ if (this.fragment == frag) return;
+ this._hasPushState ? (frag.indexOf(this.options.root) != 0 && (frag = this.options.root + frag), this.fragment = frag, window.history[options.replace ? "replaceState" : "pushState"]({}, document.title, frag)) : this._wantsHashChange ? (this.fragment = frag, this._updateHash(window.location, frag, options.replace), this.iframe && frag != this.getFragment(this.getHash(this.iframe)) && (options.replace || this.iframe.document.open().close(), this._updateHash(this.iframe.location, frag, options.replace))) : window.location.assign(this.options.root + fragment), options.trigger && this.loadUrl(fragment);
+ },
+ _updateHash: function(location, fragment, replace) {
+ replace ? location.replace(location.toString().replace(/(javascript:|#).*$/, "") + "#" + fragment) : location.hash = fragment;
+ }
+ });
+ var View = Backbone.View = function(options) {
+ this.cid = _.uniqueId("view"), this._configure(options || {}), this._ensureElement(), this.initialize.apply(this, arguments), this.delegateEvents();
+ }, delegateEventSplitter = /^(\S+)\s*(.*)$/, viewOptions = [ "model", "collection", "el", "id", "attributes", "className", "tagName" ];
+ _.extend(View.prototype, Events, {
+ tagName: "div",
+ $: function(selector) {
+ return this.$el.find(selector);
+ },
+ initialize: function() {},
+ render: function() {
+ return this;
+ },
+ remove: function() {
+ return this.$el.remove(), this;
+ },
+ make: function(tagName, attributes, content) {
+ var el = document.createElement(tagName);
+ return attributes && $(el).attr(attributes), content && $(el).html(content), el;
+ },
+ setElement: function(element, delegate) {
+ return this.$el && this.undelegateEvents(), this.$el = element instanceof $ ? element : $(element), this.el = this.$el[0], delegate !== !1 && this.delegateEvents(), this;
+ },
+ delegateEvents: function(events) {
+ if (!events && !(events = getValue(this, "events"))) return;
+ this.undelegateEvents();
+ for (var key in events) {
+ var method = events[key];
+ _.isFunction(method) || (method = this[events[key]]);
+ if (!method) throw new Error('Method "' + events[key] + '" does not exist');
+ var match = key.match(delegateEventSplitter), eventName = match[1], selector = match[2];
+ method = _.bind(method, this), eventName += ".delegateEvents" + this.cid, selector === "" ? this.$el.bind(eventName, method) : this.$el.delegate(selector, eventName, method);
+ }
+ },
+ undelegateEvents: function() {
+ this.$el.unbind(".delegateEvents" + this.cid);
+ },
+ _configure: function(options) {
+ this.options && (options = _.extend({}, this.options, options));
+ for (var i = 0, l = viewOptions.length; i < l; i++) {
+ var attr = viewOptions[i];
+ options[attr] && (this[attr] = options[attr]);
+ }
+ this.options = options;
+ },
+ _ensureElement: function() {
+ if (!this.el) {
+ var attrs = getValue(this, "attributes") || {};
+ this.id && (attrs.id = this.id), this.className && (attrs["class"] = this.className), this.setElement(this.make(this.tagName, attrs), !1);
+ } else this.setElement(this.el, !1);
+ }
+ });
+ var extend = function(protoProps, classProps) {
+ var child = inherits(this, protoProps, classProps);
+ return child.extend = this.extend, child;
+ };
+ Model.extend = Collection.extend = Router.extend = View.extend = extend;
+ var methodMap = {
+ create: "POST",
+ update: "PUT",
+ "delete": "DELETE",
+ read: "GET"
+ };
+ Backbone.sync = function(method, model, options) {
+ var type = methodMap[method];
+ options || (options = {});
+ var params = {
+ type: type,
+ dataType: "json"
+ };
+ return options.url || (params.url = getValue(model, "url") || urlError()), !options.data && model && (method == "create" || method == "update") && (params.contentType = "application/json", params.data = JSON.stringify(model.toJSON())), Backbone.emulateJSON && (params.contentType = "application/x-www-form-urlencoded", params.data = params.data ? {
+ model: params.data
+ } : {}), Backbone.emulateHTTP && (type === "PUT" || type === "DELETE") && (Backbone.emulateJSON && (params.data._method = type), params.type = "POST", params.beforeSend = function(xhr) {
+ xhr.setRequestHeader("X-HTTP-Method-Override", type);
+ }), params.type !== "GET" && !Backbone.emulateJSON && (params.processData = !1), $.ajax(_.extend(params, options));
+ }, Backbone.wrapError = function(onError, originalModel, options) {
+ return function(model, resp) {
+ resp = model === originalModel ? resp : model, onError ? onError(originalModel, resp, options) : originalModel.trigger("error", originalModel, resp, options);
+ };
+ };
+ var ctor = function() {}, inherits = function(parent, protoProps, staticProps) {
+ var child;
+ return protoProps && protoProps.hasOwnProperty("constructor") ? child = protoProps.constructor : child = function() {
+ parent.apply(this, arguments);
+ }, _.extend(child, parent), ctor.prototype = parent.prototype, child.prototype = new ctor, protoProps && _.extend(child.prototype, protoProps), staticProps && _.extend(child, staticProps), child.prototype.constructor = child, child.__super__ = parent.prototype, child;
+ }, getValue = function(object, prop) {
+ return !object || !object[prop] ? null : _.isFunction(object[prop]) ? object[prop]() : object[prop];
+ }, urlError = function() {
+ throw new Error('A "url" property or function must be specified');
+ };
+}).call(this);
View
34 Resources/alloy/controllers/BaseController.js
@@ -0,0 +1,34 @@
+var Alloy = require("alloy"), Backbone = Alloy.Backbone, _ = Alloy._, Controller = function() {
+ var roots = [], controllerEvents = {};
+ this.__iamalloy = !0, _.extend(this, Backbone.Events, {
+ __views: {},
+ setParent: function(parent) {
+ parent.__iamalloy ? this.parent = parent.parent : this.parent = parent;
+ for (var i = 0, l = roots.length; i < l; i++) roots[i].__iamalloy ? roots[i].setParent(this.parent) : this.parent.add(roots[i]);
+ },
+ addTopLevelView: function(view) {
+ roots.push(view);
+ },
+ getTopLevelViews: function() {
+ return roots;
+ },
+ getView: function(id) {
+ return typeof id == "undefined" || id === null ? roots[0] : this.__views[id];
+ },
+ getViews: function() {
+ return this.__views;
+ },
+ getViewEx: function(opts) {
+ var recurse = opts.recurse || !1;
+ if (recurse) {
+ var view = this.getView();
+ return view.__iamalloy ? view.getViewEx({
+ recurse: !0
+ }) : view;
+ }
+ return this.getView();
+ }
+ });
+};
+
+module.exports = Controller;
View
20 Resources/alloy/controllers/DashboardView.js
@@ -0,0 +1,20 @@
+function Controller() {
+ require("alloy/controllers/BaseController").apply(this, Array.prototype.slice.call(arguments));
+ var $ = this, exports = {};
+ $.__views.container = A$(Ti.UI.createView({
+ id: "container"
+ }), "View", null), $.addTopLevelView($.__views.container), $.__views.logout = A$(Ti.UI.createButton({
+ id: "logout",
+ titleid: "logout"
+ }), "Button", $.__views.container), $.__views.container.add($.__views.logout), _.extend($, $.__views);
+ var Cloud = require("ti.cloud");
+ $.logout.on("click", function() {
+ Cloud.Users.logout(function(e) {
+ e.success && (Ti.App.Properties.removeProperty("sessionId"), Ti.App.fireEvent("app:logout"));
+ });
+ }), _.extend($, exports);
+}
+
+var Alloy = require("alloy"), Backbone = Alloy.Backbone, _ = Alloy._, A$ = Alloy.A;
+
+module.exports = Controller;
View
22 Resources/alloy/controllers/LoginView.js
@@ -0,0 +1,22 @@
+function Controller() {
+ require("alloy/controllers/BaseController").apply(this, Array.prototype.slice.call(arguments));
+ var $ = this, exports = {};
+ $.__views.container = A$(Ti.UI.createView({
+ layout: "vertical",
+ width: 310,
+ height: Ti.UI.SIZE,
+ id: "container"
+ }), "View", null), $.addTopLevelView($.__views.container), $.__views.logo = A$(Ti.UI.createImageView({
+ top: 10,
+ left: 10,
+ right: 10,
+ image: "/img/codestrong-logo.png",
+ id: "logo"
+ }), "ImageView", $.__views.container), $.__views.container.add($.__views.logo), $.__views.social = Alloy.createController("SocialLoginView", {
+ id: "social"
+ }), $.__views.social.setParent($.__views.container), _.extend($, $.__views), _.extend($, exports);
+}
+
+var Alloy = require("alloy"), Backbone = Alloy.Backbone, _ = Alloy._, A$ = Alloy.A;
+
+module.exports = Controller;
View
156 Resources/alloy/controllers/SocialLoginView.js
@@ -0,0 +1,156 @@
+function Controller() {
+ function loginHandler(e) {
+ e.success ? ($.scroller.scrollToView(0), Ti.App.Properties.setString("sessionId", Cloud.sessionId), Ti.App.fireEvent("app:login.success")) : alert("Login Error: " + e.message);
+ }
+ function fbLogin() {
+ Ti.Facebook.loggedIn && Cloud.SocialIntegrations.externalAccountLogin({
+ type: "facebook",
+ token: Ti.Facebook.accessToken
+ }, loginHandler);
+ }
+ require("alloy/controllers/BaseController").apply(this, Array.prototype.slice.call(arguments));
+ var $ = this, exports = {};
+ $.__views.wrapper = A$(Ti.UI.createView({
+ height: Ti.UI.SIZE,
+ id: "wrapper"
+ }), "View", null), $.addTopLevelView($.__views.wrapper);
+ var __alloyId1 = [];
+ $.__views.social = A$(Ti.UI.createView({
+ layout: "vertical",
+ height: Ti.UI.SIZE,
+ id: "social"
+ }), "View", null), __alloyId1.push($.__views.social), $.__views.fb = A$(Ti.UI.createButton({
+ top: 20,
+ height: 22,
+ width: 150,
+ backgroundImage: "/img/facebook_up.png",
+ backgroundSelectedImage: "/img/facebook_down.png",
+ id: "fb"
+ }), "Button", $.__views.social), $.__views.social.add($.__views.fb), $.__views.twitter = A$(Ti.UI.createButton({
+ top: 20,
+ height: 22,
+ width: 150,
+ backgroundImage: "/img/twitter_up.png",
+ backgroundSelectedImage: "/img/twitter_down.png",
+ id: "twitter"
+ }), "Button", $.__views.social), $.__views.social.add($.__views.twitter), $.__views.uhwhat = A$(Ti.UI.createLabel({
+ width: Ti.UI.SIZE,
+ height: 44,
+ color: "#0b72b6",
+ textAlign: "center",
+ font: {
+ fontSize: "12dip"
+ },
+ top: 15,
+ id: "uhwhat",
+ textid: "uhwhat"
+ }), "Label", $.__views.social), $.__views.social.add($.__views.uhwhat), $.__views.alreadyDid = A$(Ti.UI.createLabel({
+ width: Ti.UI.SIZE,
+ height: 44,
+ color: "#0b72b6",
+ textAlign: "center",
+ font: {
+ fontSize: "12dip"
+ },
+ top: 0,
+ id: "alreadyDid",
+ textid: "alreadyDid"
+ }), "Label", $.__views.social), $.__views.social.add($.__views.alreadyDid), $.__views.form = A$(Ti.UI.createView({
+ layout: "vertical",
+ height: Ti.UI.SIZE,
+ id: "form"
+ }), "View", null), __alloyId1.push($.__views.form), $.__views.header = A$(Ti.UI.createLabel({
+ width: Ti.UI.SIZE,
+ height: Ti.UI.SIZE,
+ color: "#0b72b6",
+ textAlign: "center",
+ font: {
+ fontSize: "12dip"
+ },
+ id: "header",
+ textid: "thatscool"
+ }), "Label", $.__views.form), $.__views.form.add($.__views.header), $.__views.email = A$(Ti.UI.createTextField({
+ borderStyle: Ti.UI.INPUT_BORDERSTYLE_ROUNDED,
+ top: 10,
+ left: 10,
+ right: 10,
+ height: 44,
+ id: "email"
+ }), "TextField", $.__views.form), $.__views.form.add($.__views.email), $.__views.password = A$(Ti.UI.createTextField({
+ borderStyle: Ti.UI.INPUT_BORDERSTYLE_ROUNDED,
+ top: 10,
+ left: 10,
+ right: 10,
+ height: 44,
+ id: "password",
+ passwordMask: "true"
+ }), "TextField", $.__views.form), $.__views.form.add($.__views.password), $.__views.__alloyId2 = A$(Ti.UI.createView({
+ id: "__alloyId2"
+ }), "View", $.__views.form), $.__views.form.add($.__views.__alloyId2), $.__views.action = A$(Ti.UI.createButton({
+ id: "action",
+ titleid: "signup",
+ width: "130",
+ height: "44",
+ left: "10"
+ }), "Button", $.__views.__alloyId2), $.__views.__alloyId2.add($.__views.action), $.__views.cancel = A$(Ti.UI.createButton({
+ id: "cancel",
+ titleid: "cancel",
+ width: "130",
+ height: "44",
+ right: "10"
+ }), "Button", $.__views.__alloyId2), $.__views.__alloyId2.add($.__views.cancel), $.__views.scroller = A$(Ti.UI.createScrollableView({
+ top: 10,
+ height: 200,
+ views: __alloyId1,
+ id: "scroller",
+ scrollingEnabled: "false"
+ }), "ScrollableView", $.__views.wrapper), $.__views.wrapper.add($.__views.scroller), $.__views.loading = A$(Ti.UI.createView({
+ backgroundColor: "#cdcdcd",
+ visible: !1,
+ height: 80,
+ width: 120,
+ borderRadius: 10,
+ borderColor: "#fff",
+ borderWidth: 5,
+ id: "loading"
+ }), "View", $.__views.wrapper), $.__views.wrapper.add($.__views.loading), $.__views.__alloyId3 = A$(Ti.UI.createLabel({
+ width: Ti.UI.SIZE,
+ height: Ti.UI.SIZE,
+ color: "#0b72b6",
+ textAlign: "center",
+ font: {
+ fontSize: "12dip"
+ },
+ textid: "working",
+ id: "__alloyId3"
+ }), "Label", $.__views.loading), $.__views.loading.add($.__views.__alloyId3), _.extend($, $.__views);
+ var social = require("alloy/social"), Cloud = require("ti.cloud");
+ $.email.hintText = L("email"), $.password.hintText = L("password");
+ var selectedAction = 0;
+ Ti.Facebook.addEventListener("login", fbLogin), $.fb.on("click", function() {
+ Ti.Facebook.authorize();
+ }), $.twitter.on("click", function() {
+ alert("removed twitter login for now");
+ }), $.uhwhat.on("touchend", function() {
+ selectedAction = 0, $.action.title = L("signup"), $.header.text = L("thatscool"), $.scroller.scrollToView(1);
+ }), $.alreadyDid.on("touchend", function() {
+ selectedAction = 1, $.action.title = L("login"), $.header.text = L("ohnice"), $.scroller.scrollToView(1);
+ }), $.cancel.on("touchend", function() {
+ $.scroller.scrollToView(0);
+ }), $.action.on("touchend", function() {
+ $.loading.visible = !0, selectedAction === 0 ? Cloud.Users.create({
+ email: $.email.value,
+ first_name: "Codestrong",
+ last_name: "User",
+ password: $.password.value,
+ password_confirmation: $.password.value
+ }, loginHandler) : Cloud.Users.login({
+ login: $.email.value,
+ password: $.password.value
+ }, loginHandler);
+ }), _.extend($, exports);
+}
+
+var Alloy = require("alloy"), Backbone = Alloy.Backbone, _ = Alloy._, A$ = Alloy.A;
+
+module.exports = Controller;
View
25 Resources/alloy/controllers/index.js
@@ -0,0 +1,25 @@
+function Controller() {
+ require("alloy/controllers/BaseController").apply(this, Array.prototype.slice.call(arguments));
+ var $ = this, exports = {};
+ $.__views.index = A$(Ti.UI.createWindow({
+ backgroundImage: "/img/bg.png",
+ navBarHidden: !0,
+ exitOnClose: "true",
+ id: "index"
+ }), "Window", null), $.addTopLevelView($.__views.index), $.__views.logo = A$(Ti.UI.createImageView({
+ id: "logo",
+ image: "/img/codestrong-logo.png"
+ }), "ImageView", $.__views.index), $.__views.index.add($.__views.logo), _.extend($, $.__views), Ti.Facebook.appid = Ti.App.Properties.getString("ti.facebook.appid"), Ti.Facebook.permissions = [ "publish_stream" ];
+ var Cloud = require("ti.cloud");
+ $.dashboardView = Alloy.createController("DashboardView"), $.loginView = Alloy.createController("LoginView");
+ var sessionId = Ti.App.Properties.getString("sessionId");
+ Ti.API.info("stored:" + sessionId), sessionId ? (Cloud.sessionId = sessionId, $.index.remove($.logo), $.index.add($.dashboardView.getView())) : ($.index.remove($.logo), $.index.add($.loginView.getView())), Ti.App.addEventListener("app:login.success", function(e) {
+ $.index.add($.dashboardView.getView()), $.index.remove($.loginView.getView());
+ }), Ti.App.addEventListener("app:logout", function(e) {
+ $.index.remove($.dashboardView.getView()), $.index.add($.loginView.getView());
+ }), $.index.open(), _.extend($, exports);
+}
+
+var Alloy = require("alloy"), Backbone = Alloy.Backbone, _ = Alloy._, A$ = Alloy.A;
+
+module.exports = Controller;
View
564 Resources/alloy/social.js
@@ -0,0 +1,564 @@
+function hex_sha1(s) {
+ return binb2hex(core_sha1(str2binb(s), s.length * chrsz));
+}
+
+function b64_sha1(s) {
+ return binb2b64(core_sha1(str2binb(s), s.length * chrsz));
+}
+
+function str_sha1(s) {
+ return binb2str(core_sha1(str2binb(s), s.length * chrsz));
+}
+
+function hex_hmac_sha1(key, data) {
+ return binb2hex(core_hmac_sha1(key, data));
+}
+
+function b64_hmac_sha1(key, data) {
+ return binb2b64(core_hmac_sha1(key, data));
+}
+
+function str_hmac_sha1(key, data) {
+ return binb2str(core_hmac_sha1(key, data));
+}
+
+function sha1_vm_test() {
+ return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
+}
+
+function core_sha1(x, len) {
+ x[len >> 5] |= 128 << 24 - len % 32, x[(len + 64 >> 9 << 4) + 15] = len;
+ var w = Array(80), a = 1732584193, b = -271733879, c = -1732584194, d = 271733878, e = -1009589776;
+ for (var i = 0; i < x.length; i += 16) {
+ var olda = a, oldb = b, oldc = c, oldd = d, olde = e;
+ for (var j = 0; j < 80; j++) {
+ j < 16 ? w[j] = x[i + j] : w[j] = rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);
+ var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), sha1_kt(j)));
+ e = d, d = c, c = rol(b, 30), b = a, a = t;
+ }
+ a = safe_add(a, olda), b = safe_add(b, oldb), c = safe_add(c, oldc), d = safe_add(d, oldd), e = safe_add(e, olde);
+ }
+ return Array(a, b, c, d, e);
+}
+
+function sha1_ft(t, b, c, d) {
+ return t < 20 ? b & c | ~b & d : t < 40 ? b ^ c ^ d : t < 60 ? b & c | b & d | c & d : b ^ c ^ d;
+}
+
+function sha1_kt(t) {
+ return t < 20 ? 1518500249 : t < 40 ? 1859775393 : t < 60 ? -1894007588 : -899497514;
+}
+
+function core_hmac_sha1(key, data) {
+ var bkey = str2binb(key);
+ bkey.length > 16 && (bkey = core_sha1(bkey, key.length * chrsz));
+ var ipad = Array(16), opad = Array(16);
+ for (var i = 0; i < 16; i++) ipad[i] = bkey[i] ^ 909522486, opad[i] = bkey[i] ^ 1549556828;
+ var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
+ return core_sha1(opad.concat(hash), 672);
+}
+
+function safe_add(x, y) {
+ var lsw = (x & 65535) + (y & 65535), msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+ return msw << 16 | lsw & 65535;
+}
+
+function rol(num, cnt) {
+ return num << cnt | num >>> 32 - cnt;
+}
+
+function str2binb(str) {
+ var bin = Array(), mask = (1 << chrsz) - 1;
+ for (var i = 0; i < str.length * chrsz; i += chrsz) bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << 32 - chrsz - i % 32;
+ return bin;
+}
+
+function binb2str(bin) {
+ var str = "", mask = (1 << chrsz) - 1;
+ for (var i = 0; i < bin.length * 32; i += chrsz) str += String.fromCharCode(bin[i >> 5] >>> 32 - chrsz - i % 32 & mask);
+ return str;
+}
+
+function binb2hex(binarray) {
+ var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef", str = "";
+ for (var i = 0; i < binarray.length * 4; i++) str += hex_tab.charAt(binarray[i >> 2] >> (3 - i % 4) * 8 + 4 & 15) + hex_tab.charAt(binarray[i >> 2] >> (3 - i % 4) * 8 & 15);
+ return str;
+}
+
+function binb2b64(binarray) {
+ var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", str = "";
+ for (var i = 0; i < binarray.length * 4; i += 3) {
+ var triplet = (binarray[i >> 2] >> 8 * (3 - i % 4) & 255) << 16 | (binarray[i + 1 >> 2] >> 8 * (3 - (i + 1) % 4) & 255) << 8 | binarray[i + 2 >> 2] >> 8 * (3 - (i + 2) % 4) & 255;
+ for (var j = 0; j < 4; j++) i * 8 + j * 6 > binarray.length * 32 ? str += b64pad : str += tab.charAt(triplet >> 6 * (3 - j) & 63);
+ }
+ return str;
+}
+
+var hexcase = 0, b64pad = "", chrsz = 8, OAuth;
+
+OAuth == null && (OAuth = {}), OAuth.setProperties = function(into, from) {
+ if (into != null && from != null) for (var key in from) into[key] = from[key];
+ return into;
+}, OAuth.setProperties(OAuth, {
+ percentEncode: function(s) {
+ if (s == null) return "";
+ if (s instanceof Array) {
+ var e = "";
+ for (var i = 0; i < s.length; ++s) e != "" && (e += "&"), e += OAuth.percentEncode(s[i]);
+ return e;
+ }
+ return s = encodeURIComponent(s), s = s.replace(/\!/g, "%21"), s = s.replace(/\*/g, "%2A"), s = s.replace(/\'/g, "%27"), s = s.replace(/\(/g, "%28"), s = s.replace(/\)/g, "%29"), s;
+ },
+ decodePercent: function(s) {
+ return s != null && (s = s.replace(/\+/g, " ")), decodeURIComponent(s);
+ },
+ getParameterList: function(parameters) {
+ if (parameters == null) return [];
+ if (typeof parameters != "object") return OAuth.decodeForm(parameters + "");
+ if (parameters instanceof Array) return parameters;
+ var list = [];
+ for (var p in parameters) list.push([ p, parameters[p] ]);
+ return list;
+ },
+ getParameterMap: function(parameters) {
+ if (parameters == null) return {};
+ if (typeof parameters != "object") return OAuth.getParameterMap(OAuth.decodeForm(parameters + ""));
+ if (parameters instanceof Array) {
+ var map = {};
+ for (var p = 0; p < parameters.length; ++p) {
+ var key = parameters[p][0];
+ map[key] === undefined && (map[key] = parameters[p][1]);
+ }
+ return map;
+ }
+ return parameters;
+ },
+ getParameter: function(parameters, name) {