Primer Commit
This commit is contained in:
LuisAngelSalinasl
@@ -0,0 +1,661 @@
|
||||
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||
Version 3, 19 November 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 Affero General Public License is a free, copyleft license for
|
||||
software and other kinds of works, specifically designed to ensure
|
||||
cooperation with the community in the case of network server software.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
our General Public Licenses are 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.
|
||||
|
||||
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.
|
||||
|
||||
Developers that use our General Public Licenses protect your rights
|
||||
with two steps: (1) assert copyright on the software, and (2) offer
|
||||
you this License which gives you legal permission to copy, distribute
|
||||
and/or modify the software.
|
||||
|
||||
A secondary benefit of defending all users' freedom is that
|
||||
improvements made in alternate versions of the program, if they
|
||||
receive widespread use, become available for other developers to
|
||||
incorporate. Many developers of free software are heartened and
|
||||
encouraged by the resulting cooperation. However, in the case of
|
||||
software used on network servers, this result may fail to come about.
|
||||
The GNU General Public License permits making a modified version and
|
||||
letting the public access it on a server without ever releasing its
|
||||
source code to the public.
|
||||
|
||||
The GNU Affero General Public License is designed specifically to
|
||||
ensure that, in such cases, the modified source code becomes available
|
||||
to the community. It requires the operator of a network server to
|
||||
provide the source code of the modified version running there to the
|
||||
users of that server. Therefore, public use of a modified version, on
|
||||
a publicly accessible server, gives the public access to the source
|
||||
code of the modified version.
|
||||
|
||||
An older license, called the Affero General Public License and
|
||||
published by Affero, was designed to accomplish similar goals. This is
|
||||
a different license, not a version of the Affero GPL, but Affero has
|
||||
released a new version of the Affero GPL which permits relicensing under
|
||||
this license.
|
||||
|
||||
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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, if you modify the
|
||||
Program, your modified version must prominently offer all users
|
||||
interacting with it remotely through a computer network (if your version
|
||||
supports such interaction) an opportunity to receive the Corresponding
|
||||
Source of your version by providing access to the Corresponding Source
|
||||
from a network server at no charge, through some standard or customary
|
||||
means of facilitating copying of software. This Corresponding Source
|
||||
shall include the Corresponding Source for any work covered by version 3
|
||||
of the GNU General Public License that is incorporated pursuant to the
|
||||
following paragraph.
|
||||
|
||||
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 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 work with which it is combined will remain governed by version
|
||||
3 of the GNU General Public License.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU Affero 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 Affero 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 Affero 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 Affero 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 Affero 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 Affero General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Affero 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 your software can interact with users remotely through a computer
|
||||
network, you should also make sure that it provides a way for users to
|
||||
get its source. For example, if your program is a web application, its
|
||||
interface could display a "Source" link that leads users to an archive
|
||||
of the code. There are many ways you could offer source, and different
|
||||
solutions will be better for different programs; see section 13 for the
|
||||
specific requirements.
|
||||
|
||||
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 AGPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
||||
@@ -0,0 +1,16 @@
|
||||
Commercial license:
|
||||
- License does not expire.
|
||||
- Can be used on 1 site, unlimited servers
|
||||
- Source-code or binary products cannot be resold or distributed
|
||||
- Commercial use allowed
|
||||
- Can modify source-code but cannot distribute modifications (derivative works)
|
||||
Full licensing terms are avaialble at http://www.binpress.com/license/read/id/3085/app/2122
|
||||
|
||||
|
||||
Developer license:
|
||||
- License does not expire.
|
||||
- Can be distributed in unlimited projects
|
||||
- Can be distributed and / or packaged as a code or binary product (sublicensed)
|
||||
- Commercial use allowed
|
||||
- Can modify source-code but cannot distribute modifications (derivative works)
|
||||
Full licensing terms are avaialble at http://www.binpress.com/license/read/id/3086/app/2122
|
||||
@@ -0,0 +1,61 @@
|
||||
#!/bin/bash
|
||||
|
||||
files=( \
|
||||
jquery-jvectormap.js \
|
||||
lib/jquery-mousewheel.js \
|
||||
src/jvectormap.js \
|
||||
src/abstract-element.js \
|
||||
src/abstract-canvas-element.js \
|
||||
src/abstract-shape-element.js \
|
||||
src/svg-element.js \
|
||||
src/svg-group-element.js \
|
||||
src/svg-canvas-element.js \
|
||||
src/svg-shape-element.js \
|
||||
src/svg-path-element.js \
|
||||
src/svg-circle-element.js \
|
||||
src/svg-image-element.js \
|
||||
src/svg-text-element.js \
|
||||
src/vml-element.js \
|
||||
src/vml-group-element.js \
|
||||
src/vml-canvas-element.js \
|
||||
src/vml-shape-element.js \
|
||||
src/vml-path-element.js \
|
||||
src/vml-circle-element.js \
|
||||
src/vector-canvas.js \
|
||||
src/simple-scale.js \
|
||||
src/ordinal-scale.js \
|
||||
src/numeric-scale.js \
|
||||
src/color-scale.js \
|
||||
src/legend.js \
|
||||
src/data-series.js \
|
||||
src/proj.js \
|
||||
src/map-object.js \
|
||||
src/region.js \
|
||||
src/marker.js \
|
||||
src/map.js \
|
||||
src/multimap.js \
|
||||
)
|
||||
|
||||
baseDir=`dirname $0`
|
||||
|
||||
counter=0
|
||||
while [ $counter -lt ${#files[@]} ]; do
|
||||
files[$counter]="$baseDir/${files[$counter]}"
|
||||
let counter=counter+1
|
||||
done
|
||||
|
||||
if [ -z "$1" ]
|
||||
then
|
||||
minified=jquery-jvectormap.min.js
|
||||
else
|
||||
minified=$1
|
||||
fi
|
||||
|
||||
if [ -a $minified ]
|
||||
then
|
||||
rm $minified
|
||||
fi
|
||||
|
||||
cat ${files[*]} >> $minified
|
||||
|
||||
uglifyjs $minified -o $minified -c
|
||||
@@ -0,0 +1,299 @@
|
||||
#
|
||||
# jVectorMap version 2.0.4
|
||||
#
|
||||
# Copyright 2011-2013, Kirill Lebedev
|
||||
#
|
||||
|
||||
import sys
|
||||
import shapely.geometry
|
||||
import shapely.wkb
|
||||
import shapely.affinity
|
||||
from osgeo import ogr
|
||||
from osgeo import osr
|
||||
import json
|
||||
import codecs
|
||||
import copy
|
||||
|
||||
class Map:
|
||||
def __init__(self, name, language):
|
||||
self.paths = {}
|
||||
self.name = name
|
||||
self.language = language
|
||||
self.width = 0
|
||||
self.height = 0
|
||||
self.bbox = []
|
||||
|
||||
def addPath(self, path, code, name):
|
||||
self.paths[code] = {"path": path, "name": name}
|
||||
|
||||
def getJSCode(self):
|
||||
map = {"paths": self.paths, "width": self.width, "height": self.height, "insets": self.insets, "projection": self.projection}
|
||||
return "jQuery.fn.vectorMap('addMap', '"+self.name+"_"+self.projection['type']+"_"+self.language+"',"+json.dumps(map)+');'
|
||||
|
||||
|
||||
class Converter:
|
||||
def __init__(self, config):
|
||||
args = {
|
||||
'buffer_distance': -0.4,
|
||||
'simplify_tolerance': 0.2,
|
||||
'longitude0': 0,
|
||||
'projection': 'mill',
|
||||
'name': 'world',
|
||||
'width': 900,
|
||||
'language': 'en',
|
||||
'precision': 2,
|
||||
'insets': []
|
||||
}
|
||||
args.update(config)
|
||||
|
||||
self.map = Map(args['name'], args.get('language'))
|
||||
|
||||
if args.get('sources'):
|
||||
self.sources = args['sources']
|
||||
else:
|
||||
self.sources = [{
|
||||
'input_file': args.get('input_file'),
|
||||
'where': args.get('where'),
|
||||
'name_field': args.get('name_field'),
|
||||
'code_field': args.get('code_field'),
|
||||
'input_file_encoding': args.get('input_file_encoding')
|
||||
}]
|
||||
|
||||
default_source = {
|
||||
'where': '',
|
||||
'name_field': 0,
|
||||
'code_field': 1,
|
||||
'input_file_encoding': 'iso-8859-1'
|
||||
}
|
||||
|
||||
for index in range(len(self.sources)):
|
||||
for key in default_source:
|
||||
if self.sources[index].get(key) is None:
|
||||
self.sources[index][key] = default_source[key]
|
||||
|
||||
self.features = {}
|
||||
self.width = args.get('width')
|
||||
self.minimal_area = args.get('minimal_area')
|
||||
self.longitude0 = float(args.get('longitude0'))
|
||||
self.projection = args.get('projection')
|
||||
self.precision = args.get('precision')
|
||||
self.buffer_distance = args.get('buffer_distance')
|
||||
self.simplify_tolerance = args.get('simplify_tolerance')
|
||||
self.for_each = args.get('for_each')
|
||||
self.emulate_longitude0 = args.get('emulate_longitude0')
|
||||
if args.get('emulate_longitude0') is None and (self.projection == 'merc' or self.projection =='mill') and self.longitude0 != 0:
|
||||
self.emulate_longitude0 = True
|
||||
|
||||
if args.get('viewport'):
|
||||
self.viewport = map(lambda s: float(s), args.get('viewport').split(' '))
|
||||
else:
|
||||
self.viewport = False
|
||||
|
||||
# spatial reference to convert to
|
||||
self.spatialRef = osr.SpatialReference()
|
||||
projString = '+proj='+str(self.projection)+' +a=6381372 +b=6381372 +lat_0=0'
|
||||
if not self.emulate_longitude0:
|
||||
projString += ' +lon_0='+str(self.longitude0)
|
||||
self.spatialRef.ImportFromProj4(projString)
|
||||
|
||||
# handle map insets
|
||||
if args.get('insets'):
|
||||
self.insets = args.get('insets')
|
||||
else:
|
||||
self.insets = []
|
||||
|
||||
def loadData(self):
|
||||
for sourceConfig in self.sources:
|
||||
self.loadDataSource( sourceConfig )
|
||||
|
||||
def loadDataSource(self, sourceConfig):
|
||||
source = ogr.Open( sourceConfig['input_file'] )
|
||||
layer = source.GetLayer(0)
|
||||
layer.SetAttributeFilter( sourceConfig['where'].encode('ascii') )
|
||||
self.viewportRect = False
|
||||
|
||||
transformation = osr.CoordinateTransformation( layer.GetSpatialRef(), self.spatialRef )
|
||||
if self.viewport:
|
||||
layer.SetSpatialFilterRect( *self.viewport )
|
||||
point1 = transformation.TransformPoint(self.viewport[0], self.viewport[1])
|
||||
point2 = transformation.TransformPoint(self.viewport[2], self.viewport[3])
|
||||
self.viewportRect = shapely.geometry.box(point1[0], point1[1], point2[0], point2[1])
|
||||
|
||||
layer.ResetReading()
|
||||
|
||||
codes = {}
|
||||
|
||||
if self.emulate_longitude0:
|
||||
meridian = -180 + self.longitude0
|
||||
p1 = transformation.TransformPoint(-180, 89)
|
||||
p2 = transformation.TransformPoint(meridian, -89)
|
||||
left = shapely.geometry.box(p1[0], p1[1], p2[0], p2[1])
|
||||
p3 = transformation.TransformPoint(meridian, 89)
|
||||
p4 = transformation.TransformPoint(180, -89)
|
||||
right = shapely.geometry.box(p3[0], p3[1], p4[0], p4[1])
|
||||
|
||||
# load features
|
||||
nextCode = 0
|
||||
for feature in layer:
|
||||
geometry = feature.GetGeometryRef()
|
||||
geometryType = geometry.GetGeometryType()
|
||||
|
||||
if geometryType == ogr.wkbPolygon or geometryType == ogr.wkbMultiPolygon:
|
||||
geometry.TransformTo( self.spatialRef )
|
||||
shapelyGeometry = shapely.wkb.loads( geometry.ExportToWkb() )
|
||||
if not shapelyGeometry.is_valid:
|
||||
shapelyGeometry = shapelyGeometry.buffer(0, 1)
|
||||
|
||||
if self.emulate_longitude0:
|
||||
leftPart = shapely.affinity.translate(shapelyGeometry.intersection(left), p4[0] - p3[0])
|
||||
rightPart = shapely.affinity.translate(shapelyGeometry.intersection(right), p1[0] - p2[0])
|
||||
shapelyGeometry = leftPart.buffer(0.1, 1).union(rightPart.buffer(0.1, 1)).buffer(-0.1, 1)
|
||||
|
||||
if not shapelyGeometry.is_valid:
|
||||
shapelyGeometry = shapelyGeometry.buffer(0, 1)
|
||||
shapelyGeometry = self.applyFilters(shapelyGeometry)
|
||||
if shapelyGeometry:
|
||||
name = feature.GetFieldAsString(str(sourceConfig.get('name_field'))).decode(sourceConfig.get('input_file_encoding'))
|
||||
code = feature.GetFieldAsString(str(sourceConfig.get('code_field'))).decode(sourceConfig.get('input_file_encoding'))
|
||||
if code in codes:
|
||||
code = '_' + str(nextCode)
|
||||
nextCode += 1
|
||||
codes[code] = name
|
||||
self.features[code] = {"geometry": shapelyGeometry, "name": name, "code": code}
|
||||
else:
|
||||
raise Exception, "Wrong geometry type: "+geometryType
|
||||
|
||||
|
||||
def convert(self, outputFile):
|
||||
print 'Generating '+outputFile
|
||||
|
||||
self.loadData()
|
||||
|
||||
codes = self.features.keys()
|
||||
main_codes = copy.copy(codes)
|
||||
self.map.insets = []
|
||||
envelope = []
|
||||
for inset in self.insets:
|
||||
insetBbox = self.renderMapInset(inset['codes'], inset['left'], inset['top'], inset['width'])
|
||||
insetHeight = (insetBbox[3] - insetBbox[1]) * (inset['width'] / (insetBbox[2] - insetBbox[0]))
|
||||
self.map.insets.append({
|
||||
"bbox": [{"x": insetBbox[0], "y": -insetBbox[3]}, {"x": insetBbox[2], "y": -insetBbox[1]}],
|
||||
"left": inset['left'],
|
||||
"top": inset['top'],
|
||||
"width": inset['width'],
|
||||
"height": insetHeight
|
||||
})
|
||||
envelope.append(
|
||||
shapely.geometry.box(
|
||||
inset['left'], inset['top'], inset['left'] + inset['width'], inset['top'] + insetHeight
|
||||
)
|
||||
)
|
||||
for code in inset['codes']:
|
||||
main_codes.remove(code)
|
||||
|
||||
insetBbox = self.renderMapInset(main_codes, 0, 0, self.width)
|
||||
insetHeight = (insetBbox[3] - insetBbox[1]) * (self.width / (insetBbox[2] - insetBbox[0]))
|
||||
|
||||
envelope.append( shapely.geometry.box( 0, 0, self.width, insetHeight ) )
|
||||
mapBbox = shapely.geometry.MultiPolygon( envelope ).bounds
|
||||
|
||||
self.map.width = mapBbox[2] - mapBbox[0]
|
||||
self.map.height = mapBbox[3] - mapBbox[1]
|
||||
self.map.insets.append({
|
||||
"bbox": [{"x": insetBbox[0], "y": -insetBbox[3]}, {"x": insetBbox[2], "y": -insetBbox[1]}],
|
||||
"left": 0,
|
||||
"top": 0,
|
||||
"width": self.width,
|
||||
"height": insetHeight
|
||||
})
|
||||
self.map.projection = {"type": self.projection, "centralMeridian": float(self.longitude0)}
|
||||
|
||||
open(outputFile, 'w').write( self.map.getJSCode() )
|
||||
|
||||
if self.for_each is not None:
|
||||
for code in codes:
|
||||
childConfig = copy.deepcopy(self.for_each)
|
||||
for param in ('input_file', 'output_file', 'where', 'name'):
|
||||
childConfig[param] = childConfig[param].replace('{{code}}', code.lower())
|
||||
converter = Converter(childConfig)
|
||||
converter.convert(childConfig['output_file'])
|
||||
|
||||
def renderMapInset(self, codes, left, top, width):
|
||||
envelope = []
|
||||
for code in codes:
|
||||
envelope.append( self.features[code]['geometry'].envelope )
|
||||
|
||||
bbox = shapely.geometry.MultiPolygon( envelope ).bounds
|
||||
|
||||
scale = (bbox[2]-bbox[0]) / width
|
||||
|
||||
# generate SVG paths
|
||||
for code in codes:
|
||||
feature = self.features[code]
|
||||
geometry = feature['geometry']
|
||||
if self.buffer_distance:
|
||||
geometry = geometry.buffer(self.buffer_distance*scale, 1)
|
||||
if geometry.is_empty:
|
||||
continue
|
||||
if self.simplify_tolerance:
|
||||
geometry = geometry.simplify(self.simplify_tolerance*scale, preserve_topology=True)
|
||||
if isinstance(geometry, shapely.geometry.multipolygon.MultiPolygon):
|
||||
polygons = geometry.geoms
|
||||
else:
|
||||
polygons = [geometry]
|
||||
path = ''
|
||||
for polygon in polygons:
|
||||
rings = []
|
||||
rings.append(polygon.exterior)
|
||||
rings.extend(polygon.interiors)
|
||||
for ring in rings:
|
||||
for pointIndex in range( len(ring.coords) ):
|
||||
point = ring.coords[pointIndex]
|
||||
if pointIndex == 0:
|
||||
path += 'M'+str( round( (point[0]-bbox[0]) / scale + left, self.precision) )
|
||||
path += ','+str( round( (bbox[3] - point[1]) / scale + top, self.precision) )
|
||||
else:
|
||||
path += 'l' + str( round(point[0]/scale - ring.coords[pointIndex-1][0]/scale, self.precision) )
|
||||
path += ',' + str( round(ring.coords[pointIndex-1][1]/scale - point[1]/scale, self.precision) )
|
||||
path += 'Z'
|
||||
self.map.addPath(path, feature['code'], feature['name'])
|
||||
return bbox
|
||||
|
||||
|
||||
def applyFilters(self, geometry):
|
||||
if self.viewportRect:
|
||||
geometry = self.filterByViewport(geometry)
|
||||
if not geometry:
|
||||
return False
|
||||
if self.minimal_area:
|
||||
geometry = self.filterByMinimalArea(geometry)
|
||||
if not geometry:
|
||||
return False
|
||||
return geometry
|
||||
|
||||
|
||||
def filterByViewport(self, geometry):
|
||||
try:
|
||||
return geometry.intersection(self.viewportRect)
|
||||
except shapely.geos.TopologicalError:
|
||||
return False
|
||||
|
||||
|
||||
def filterByMinimalArea(self, geometry):
|
||||
if isinstance(geometry, shapely.geometry.multipolygon.MultiPolygon):
|
||||
polygons = geometry.geoms
|
||||
else:
|
||||
polygons = [geometry]
|
||||
polygons = filter(lambda p: p.area > self.minimal_area, polygons)
|
||||
return shapely.geometry.multipolygon.MultiPolygon(polygons)
|
||||
|
||||
|
||||
args = {}
|
||||
if len(sys.argv) > 1:
|
||||
paramsJson = open(sys.argv[1], 'r').read()
|
||||
else:
|
||||
paramsJson = sys.stdin.read()
|
||||
paramsJson = json.loads(paramsJson)
|
||||
|
||||
converter = Converter(paramsJson)
|
||||
converter.convert(paramsJson['output_file'])
|
||||
@@ -0,0 +1,573 @@
|
||||
import sys
|
||||
import json
|
||||
import csv
|
||||
import shapely.wkb
|
||||
import shapely.geometry
|
||||
import shapely.ops
|
||||
import codecs
|
||||
import os
|
||||
import inspect
|
||||
import copy
|
||||
from osgeo import ogr
|
||||
from osgeo import osr
|
||||
from booleano.parser import Grammar, EvaluableParseManager, SymbolTable, Bind
|
||||
from booleano.operations import Variable
|
||||
|
||||
|
||||
class Map:
|
||||
def __init__(self, name, language):
|
||||
self.paths = {}
|
||||
self.name = name
|
||||
self.language = language
|
||||
self.width = 0
|
||||
self.height = 0
|
||||
self.bbox = []
|
||||
|
||||
def addPath(self, path, code, name):
|
||||
self.paths[code] = {"path": path, "name": name}
|
||||
|
||||
def getJSCode(self):
|
||||
map = {"paths": self.paths, "width": self.width, "height": self.height, "insets": self.insets, "projection": self.projection}
|
||||
return "jQuery.fn.vectorMap('addMap', '"+self.name+"_"+self.projection['type']+"',"+json.dumps(map)+');'
|
||||
|
||||
|
||||
class Converter:
|
||||
def __init__(self, config):
|
||||
args = {
|
||||
'buffer_distance': -0.4,
|
||||
'simplify_tolerance': 0.2,
|
||||
'longitude0': 0,
|
||||
'projection': 'mill',
|
||||
'name': 'world',
|
||||
'width': 900,
|
||||
'left': 0,
|
||||
'top': 0,
|
||||
'language': 'en',
|
||||
'precision': 2,
|
||||
'insets': []
|
||||
}
|
||||
args.update(config)
|
||||
|
||||
self.config = args
|
||||
|
||||
self.map = Map(args['name'], args.get('language'))
|
||||
|
||||
if args.get('sources'):
|
||||
self.sources = args['sources']
|
||||
else:
|
||||
self.sources = [{
|
||||
'input_file': args.get('input_file'),
|
||||
'where': args.get('where'),
|
||||
'name_field': args.get('name_field'),
|
||||
'code_field': args.get('code_field'),
|
||||
'input_file_encoding': args.get('input_file_encoding')
|
||||
}]
|
||||
|
||||
default_source = {
|
||||
'where': '',
|
||||
'name_field': 0,
|
||||
'code_field': 1,
|
||||
'input_file_encoding': 'iso-8859-1'
|
||||
}
|
||||
|
||||
for index in range(len(self.sources)):
|
||||
for key in default_source:
|
||||
if self.sources[index].get(key) is None:
|
||||
self.sources[index][key] = default_source[key]
|
||||
|
||||
self.features = {}
|
||||
self.width = args.get('width')
|
||||
self.left = args.get('left')
|
||||
self.top = args.get('top')
|
||||
self.minimal_area = args.get('minimal_area')
|
||||
self.longitude0 = float(args.get('longitude0'))
|
||||
self.projection = args.get('projection')
|
||||
self.precision = args.get('precision')
|
||||
self.buffer_distance = args.get('buffer_distance')
|
||||
self.simplify_tolerance = args.get('simplify_tolerance')
|
||||
self.for_each = args.get('for_each')
|
||||
self.emulate_longitude0 = args.get('emulate_longitude0')
|
||||
if args.get('emulate_longitude0') is None and (self.projection == 'merc' or self.projection =='mill') and self.longitude0 != 0:
|
||||
self.emulate_longitude0 = True
|
||||
|
||||
if args.get('viewport'):
|
||||
self.viewport = map(lambda s: float(s), args.get('viewport').split(' '))
|
||||
else:
|
||||
self.viewport = False
|
||||
|
||||
# spatial reference to convert to
|
||||
self.spatialRef = osr.SpatialReference()
|
||||
projString = '+proj='+str(self.projection)+' +a=6381372 +b=6381372 +lat_0=0'
|
||||
if not self.emulate_longitude0:
|
||||
projString += ' +lon_0='+str(self.longitude0)
|
||||
self.spatialRef.ImportFromProj4(projString)
|
||||
|
||||
# handle map insets
|
||||
if args.get('insets'):
|
||||
self.insets = args.get('insets')
|
||||
else:
|
||||
self.insets = []
|
||||
|
||||
|
||||
def convert(self, data_source, output_file):
|
||||
codes = map(lambda g: g.properties[self.config['code_field']], data_source.geometries)
|
||||
main_codes = copy.copy(codes)
|
||||
self.map.insets = []
|
||||
envelope = []
|
||||
for inset in self.insets:
|
||||
insetBbox = self.renderMapInset(data_source, inset['codes'], inset['left'], inset['top'], inset['width'])
|
||||
insetHeight = (insetBbox[3] - insetBbox[1]) * (inset['width'] / (insetBbox[2] - insetBbox[0]))
|
||||
self.map.insets.append({
|
||||
"bbox": [{"x": insetBbox[0], "y": -insetBbox[3]}, {"x": insetBbox[2], "y": -insetBbox[1]}],
|
||||
"left": inset['left'],
|
||||
"top": inset['top'],
|
||||
"width": inset['width'],
|
||||
"height": insetHeight
|
||||
})
|
||||
envelope.append(
|
||||
shapely.geometry.box(
|
||||
inset['left'], inset['top'], inset['left'] + inset['width'], inset['top'] + insetHeight
|
||||
)
|
||||
)
|
||||
for code in inset['codes']:
|
||||
main_codes.remove(code)
|
||||
|
||||
insetBbox = self.renderMapInset(data_source, main_codes, self.left, self.top, self.width)
|
||||
insetHeight = (insetBbox[3] - insetBbox[1]) * (self.width / (insetBbox[2] - insetBbox[0]))
|
||||
envelope.append( shapely.geometry.box( self.left, self.top, self.left + self.width, self.top + insetHeight ) )
|
||||
mapBbox = shapely.geometry.MultiPolygon( envelope ).bounds
|
||||
|
||||
self.map.width = mapBbox[2] + mapBbox[0]
|
||||
self.map.height = mapBbox[3] + mapBbox[1]
|
||||
self.map.insets.append({
|
||||
"bbox": [{"x": insetBbox[0], "y": -insetBbox[3]}, {"x": insetBbox[2], "y": -insetBbox[1]}],
|
||||
"left": self.left,
|
||||
"top": self.top,
|
||||
"width": self.width,
|
||||
"height": insetHeight
|
||||
})
|
||||
self.map.projection = {"type": self.projection, "centralMeridian": float(self.longitude0)}
|
||||
|
||||
open(output_file, 'w').write( self.map.getJSCode() )
|
||||
|
||||
if self.for_each is not None:
|
||||
for code in codes:
|
||||
childConfig = copy.deepcopy(self.for_each)
|
||||
for param in ('input_file', 'output_file', 'where', 'name'):
|
||||
childConfig[param] = childConfig[param].replace('{{code}}', code.lower())
|
||||
converter = Converter(childConfig)
|
||||
converter.convert(childConfig['output_file'])
|
||||
|
||||
def renderMapInset(self, data_source, codes, left, top, width):
|
||||
envelope = []
|
||||
geometries = filter(lambda g: g.properties[self.config['code_field']] in codes, data_source.geometries)
|
||||
for geometry in geometries:
|
||||
envelope.append( geometry.geom.envelope )
|
||||
|
||||
bbox = shapely.geometry.MultiPolygon( envelope ).bounds
|
||||
|
||||
scale = (bbox[2]-bbox[0]) / width
|
||||
|
||||
# generate SVG paths
|
||||
for geometry in geometries:
|
||||
geom = geometry.geom
|
||||
if self.buffer_distance:
|
||||
geom = geom.buffer(self.buffer_distance*scale, 1)
|
||||
if geom.is_empty:
|
||||
continue
|
||||
if self.simplify_tolerance:
|
||||
geom = geom.simplify(self.simplify_tolerance*scale, preserve_topology=True)
|
||||
if isinstance(geom, shapely.geometry.multipolygon.MultiPolygon):
|
||||
polygons = geom.geoms
|
||||
else:
|
||||
polygons = [geom]
|
||||
path = ''
|
||||
for polygon in polygons:
|
||||
rings = []
|
||||
rings.append(polygon.exterior)
|
||||
rings.extend(polygon.interiors)
|
||||
for ring in rings:
|
||||
for pointIndex in range( len(ring.coords) ):
|
||||
point = ring.coords[pointIndex]
|
||||
if pointIndex == 0:
|
||||
path += 'M'+str( round( (point[0]-bbox[0]) / scale + left, self.precision) )
|
||||
path += ','+str( round( (bbox[3] - point[1]) / scale + top, self.precision) )
|
||||
else:
|
||||
path += 'l' + str( round(point[0]/scale - ring.coords[pointIndex-1][0]/scale, self.precision) )
|
||||
path += ',' + str( round(ring.coords[pointIndex-1][1]/scale - point[1]/scale, self.precision) )
|
||||
path += 'Z'
|
||||
self.map.addPath(path, geometry.properties[self.config['code_field']], geometry.properties[self.config['name_field']])
|
||||
return bbox
|
||||
|
||||
|
||||
class Geometry:
|
||||
def __init__(self, geometry, properties):
|
||||
self.geom = geometry
|
||||
self.properties = properties
|
||||
|
||||
|
||||
class GeometryProperty(Variable):
|
||||
operations = set(["equality", "membership"])
|
||||
|
||||
def __init__(self, name):
|
||||
self.name = name
|
||||
|
||||
def equals(self, value, context):
|
||||
return context[self.name] == value
|
||||
|
||||
def belongs_to(self, value, context):
|
||||
return value in context[self.name]
|
||||
|
||||
def is_subset(self, value, context):
|
||||
return set(value).issubset(set(context[self.name]))
|
||||
|
||||
def to_python(self, value):
|
||||
return unicode(value[self.name])
|
||||
|
||||
|
||||
class DataSource:
|
||||
def __init__(self, config):
|
||||
default_config = {
|
||||
"projection": "merc",
|
||||
"longitude0": 0
|
||||
}
|
||||
default_config.update(config)
|
||||
self.config = default_config
|
||||
|
||||
self.spatialRef = osr.SpatialReference()
|
||||
projString = '+proj='+str(self.config['projection'])+' +a=6381372 +b=6381372 +lat_0=0'
|
||||
#if 'emulate_longitude0' in self.config and not self.config['emulate_longitude0']:
|
||||
projString += ' +lon_0='+str(self.config['longitude0'])
|
||||
self.spatialRef.ImportFromProj4(projString)
|
||||
|
||||
def load_data(self):
|
||||
self.source = ogr.Open( self.config['file_name'], update = 0 )
|
||||
self.layer = self.source.GetLayer(0)
|
||||
if 'filter' in self.config and self.config['filter'] is not None:
|
||||
self.layer.SetAttributeFilter( self.config['filter'].encode('ascii') )
|
||||
self.layer_dfn = self.layer.GetLayerDefn()
|
||||
|
||||
self.fields = []
|
||||
field_count = self.layer_dfn.GetFieldCount()
|
||||
for field_index in range(field_count):
|
||||
field = self.layer_dfn.GetFieldDefn( field_index )
|
||||
self.fields.append({
|
||||
'name': field.GetName(),
|
||||
'type': field.GetType(),
|
||||
'width': field.GetWidth(),
|
||||
'precision': field.GetPrecision()
|
||||
})
|
||||
|
||||
self.geometries = []
|
||||
|
||||
for feature in self.layer:
|
||||
geometry = feature.GetGeometryRef()
|
||||
geometry.TransformTo( self.spatialRef )
|
||||
geometry = shapely.wkb.loads( geometry.ExportToWkb() )
|
||||
if not geometry.is_valid:
|
||||
geometry = geometry.buffer(0)
|
||||
properties = {}
|
||||
for field in self.fields:
|
||||
properties[field['name']] = feature.GetFieldAsString(field['name']).decode('utf-8')
|
||||
self.geometries.append( Geometry(geometry, properties) )
|
||||
|
||||
self.layer.ResetReading()
|
||||
|
||||
self.create_grammar()
|
||||
|
||||
def create_grammar(self):
|
||||
root_table = SymbolTable("root",
|
||||
map( lambda f: Bind(f['name'], GeometryProperty(f['name'])), self.fields )
|
||||
)
|
||||
|
||||
tokens = {
|
||||
'not': 'not',
|
||||
'eq': '==',
|
||||
'ne': '!=',
|
||||
'belongs_to': 'in',
|
||||
'is_subset': 'are included in',
|
||||
'or': "or",
|
||||
'and': 'and'
|
||||
}
|
||||
grammar = Grammar(**tokens)
|
||||
self.parse_manager = EvaluableParseManager(root_table, grammar)
|
||||
|
||||
def output(self, output):
|
||||
if output.get('format') == 'jvectormap':
|
||||
self.output_jvm(output)
|
||||
else:
|
||||
self.output_ogr(output)
|
||||
|
||||
def output_ogr(self, output):
|
||||
driver = ogr.GetDriverByName( 'ESRI Shapefile' )
|
||||
if os.path.exists( output['file_name'] ):
|
||||
driver.DeleteDataSource( output['file_name'] )
|
||||
source = driver.CreateDataSource( output['file_name'] )
|
||||
layer = source.CreateLayer( self.layer_dfn.GetName(),
|
||||
geom_type = self.layer_dfn.GetGeomType(),
|
||||
srs = self.layer.GetSpatialRef() )
|
||||
|
||||
for field in self.fields:
|
||||
fd = ogr.FieldDefn( str(field['name']), field['type'] )
|
||||
fd.SetWidth( field['width'] )
|
||||
if 'precision' in field:
|
||||
fd.SetPrecision( field['precision'] )
|
||||
layer.CreateField( fd )
|
||||
|
||||
for geometry in self.geometries:
|
||||
if geometry.geom is not None:
|
||||
feature = ogr.Feature( feature_def = layer.GetLayerDefn() )
|
||||
for index, field in enumerate(self.fields):
|
||||
if field['name'] in geometry.properties:
|
||||
feature.SetField( index, geometry.properties[field['name']].encode('utf-8') )
|
||||
else:
|
||||
feature.SetField( index, '' )
|
||||
feature.SetGeometryDirectly(
|
||||
ogr.CreateGeometryFromWkb(
|
||||
shapely.wkb.dumps(
|
||||
geometry.geom
|
||||
)
|
||||
)
|
||||
)
|
||||
layer.CreateFeature( feature )
|
||||
feature.Destroy()
|
||||
|
||||
source.Destroy()
|
||||
|
||||
def output_jvm(self, output):
|
||||
params = copy.deepcopy(output['params'])
|
||||
params.update({
|
||||
"projection": self.config["projection"],
|
||||
"longitude0": self.config["longitude0"]
|
||||
})
|
||||
converter = Converter(params)
|
||||
converter.convert(self, output['file_name'])
|
||||
|
||||
class PolygonSimplifier:
|
||||
def __init__(self, geometries):
|
||||
self.format = '%.8f %.8f'
|
||||
self.tolerance = 0.05
|
||||
self.geometries = geometries
|
||||
|
||||
connections = {}
|
||||
counter = 0
|
||||
for geom in geometries:
|
||||
counter += 1
|
||||
polygons = []
|
||||
|
||||
if isinstance(geom, shapely.geometry.Polygon):
|
||||
polygons.append(geom)
|
||||
else:
|
||||
for polygon in geom:
|
||||
polygons.append(polygon)
|
||||
|
||||
for polygon in polygons:
|
||||
if polygon.area > 0:
|
||||
lines = []
|
||||
lines.append(polygon.exterior)
|
||||
for line in polygon.interiors:
|
||||
lines.append(line)
|
||||
|
||||
for line in lines:
|
||||
for i in range(len(line.coords)-1):
|
||||
indexFrom = i
|
||||
indexTo = i+1
|
||||
pointFrom = self.format % line.coords[indexFrom]
|
||||
pointTo = self.format % line.coords[indexTo]
|
||||
if pointFrom == pointTo:
|
||||
continue
|
||||
if not (pointFrom in connections):
|
||||
connections[pointFrom] = {}
|
||||
connections[pointFrom][pointTo] = 1
|
||||
if not (pointTo in connections):
|
||||
connections[pointTo] = {}
|
||||
connections[pointTo][pointFrom] = 1
|
||||
self.connections = connections
|
||||
self.simplifiedLines = {}
|
||||
self.pivotPoints = {}
|
||||
|
||||
def simplifyRing(self, ring):
|
||||
coords = list(ring.coords)[0:-1]
|
||||
simpleCoords = []
|
||||
|
||||
isPivot = False
|
||||
pointIndex = 0
|
||||
while not isPivot and pointIndex < len(coords):
|
||||
pointStr = self.format % coords[pointIndex]
|
||||
pointIndex += 1
|
||||
isPivot = ((len(self.connections[pointStr]) > 2) or (pointStr in self.pivotPoints))
|
||||
pointIndex = pointIndex - 1
|
||||
|
||||
if not isPivot:
|
||||
simpleRing = shapely.geometry.LineString(coords).simplify(self.tolerance)
|
||||
if len(simpleRing.coords) <= 2:
|
||||
return None
|
||||
else:
|
||||
self.pivotPoints[self.format % coords[0]] = True
|
||||
self.pivotPoints[self.format % coords[-1]] = True
|
||||
simpleLineKey = self.format % coords[0]+':'+self.format % coords[1]+':'+self.format % coords[-1]
|
||||
self.simplifiedLines[simpleLineKey] = simpleRing.coords
|
||||
return simpleRing
|
||||
else:
|
||||
points = coords[pointIndex:len(coords)]
|
||||
points.extend(coords[0:pointIndex+1])
|
||||
iFrom = 0
|
||||
for i in range(1, len(points)):
|
||||
pointStr = self.format % points[i]
|
||||
if ((len(self.connections[pointStr]) > 2) or (pointStr in self.pivotPoints)):
|
||||
line = points[iFrom:i+1]
|
||||
lineKey = self.format % line[-1]+':'+self.format % line[-2]+':'+self.format % line[0]
|
||||
if lineKey in self.simplifiedLines:
|
||||
simpleLine = self.simplifiedLines[lineKey]
|
||||
simpleLine = list(reversed(simpleLine))
|
||||
else:
|
||||
simpleLine = shapely.geometry.LineString(line).simplify(self.tolerance).coords
|
||||
lineKey = self.format % line[0]+':'+self.format % line[1]+':'+self.format % line[-1]
|
||||
self.simplifiedLines[lineKey] = simpleLine
|
||||
simpleCoords.extend( simpleLine[0:-1] )
|
||||
iFrom = i
|
||||
if len(simpleCoords) <= 2:
|
||||
return None
|
||||
else:
|
||||
return shapely.geometry.LineString(simpleCoords)
|
||||
|
||||
def simplifyPolygon(self, polygon):
|
||||
simpleExtRing = self.simplifyRing(polygon.exterior)
|
||||
if simpleExtRing is None:
|
||||
return None
|
||||
simpleIntRings = []
|
||||
for ring in polygon.interiors:
|
||||
simpleIntRing = self.simplifyRing(ring)
|
||||
if simpleIntRing is not None:
|
||||
simpleIntRings.append(simpleIntRing)
|
||||
return shapely.geometry.Polygon(simpleExtRing, simpleIntRings)
|
||||
|
||||
def simplify(self):
|
||||
results = []
|
||||
for geom in self.geometries:
|
||||
polygons = []
|
||||
simplePolygons = []
|
||||
|
||||
if isinstance(geom, shapely.geometry.Polygon):
|
||||
polygons.append(geom)
|
||||
else:
|
||||
for polygon in geom:
|
||||
polygons.append(polygon)
|
||||
|
||||
for polygon in polygons:
|
||||
simplePolygon = self.simplifyPolygon(polygon)
|
||||
if not (simplePolygon is None or simplePolygon._geom is None):
|
||||
simplePolygons.append(simplePolygon)
|
||||
|
||||
if len(simplePolygons) > 0:
|
||||
results.append(shapely.geometry.MultiPolygon(simplePolygons))
|
||||
else:
|
||||
results.append(None)
|
||||
return results
|
||||
|
||||
|
||||
class Processor:
|
||||
def __init__(self, config):
|
||||
self.config = config
|
||||
|
||||
def process(self):
|
||||
self.data_sources = {}
|
||||
for action in self.config:
|
||||
getattr(self, action['name'])( action, self.data_sources.get(".") )
|
||||
|
||||
def read_data(self, config, data_source):
|
||||
self.data_sources["."] = DataSource( config )
|
||||
self.data_sources["."].load_data()
|
||||
|
||||
def write_data(self, config, data_source):
|
||||
data_source.output( config )
|
||||
|
||||
def union(self, config, data_source):
|
||||
groups = {}
|
||||
geometries = []
|
||||
for geometry in data_source.geometries:
|
||||
if geometry.properties[config['by']] in groups:
|
||||
groups[geometry.properties[config['by']]]['geoms'].append(geometry.geom)
|
||||
else:
|
||||
groups[geometry.properties[config['by']]] = {
|
||||
'geoms': [geometry.geom],
|
||||
'properties': geometry.properties
|
||||
}
|
||||
for key in groups:
|
||||
geometries.append( Geometry(shapely.ops.cascaded_union( groups[key]['geoms'] ), groups[key]['properties']) )
|
||||
data_source.geometries = geometries
|
||||
|
||||
def merge(self, config, data_source):
|
||||
new_geometries = []
|
||||
for rule in config['rules']:
|
||||
expression = data_source.parse_manager.parse( rule['where'] )
|
||||
geometries = filter(lambda g: expression(g.properties), data_source.geometries)
|
||||
geometries = map(lambda g: g.geom, geometries)
|
||||
new_geometries.append( Geometry(shapely.ops.cascaded_union( geometries ), rule['fields']) )
|
||||
data_source.fields = config['fields']
|
||||
data_source.geometries = new_geometries
|
||||
|
||||
def join_data(self, config, data_source):
|
||||
field_names = [f['name'] for f in config['fields']]
|
||||
if 'data' in config:
|
||||
data_col = config['data']
|
||||
else:
|
||||
data_file = open(config['file_name'], 'rb')
|
||||
data_col = csv.reader(data_file, delimiter='\t', quotechar='"')
|
||||
data = {}
|
||||
for row in data_col:
|
||||
row_dict = dict(zip(field_names, row))
|
||||
data[row_dict.pop(config['on'])] = row_dict
|
||||
for geometry in data_source.geometries:
|
||||
if geometry.properties[config['on']] in data:
|
||||
geometry.properties.update( data[geometry.properties[config['on']]] )
|
||||
field_names = map(lambda f: f['name'], data_source.fields)
|
||||
data_source.fields = data_source.fields + filter(lambda f: f['name'] not in field_names, config['fields'])
|
||||
|
||||
def remove(self, config, data_source):
|
||||
expression = data_source.parse_manager.parse( config['where'] )
|
||||
data_source.geometries = filter(lambda g: not expression(g.properties), data_source.geometries)
|
||||
|
||||
def remove_fields(self, config, data_source):
|
||||
data_source.fields = filter(lambda f: f.name not in config['fields'], data_source.fields)
|
||||
|
||||
def remove_other_fields(self, config, data_source):
|
||||
data_source.fields = filter(lambda f: f['name'] in config['fields'], data_source.fields)
|
||||
|
||||
def buffer(self, config, data_source):
|
||||
for geometry in data_source.geometries:
|
||||
geometry.geom = geometry.geom.buffer(config['distance'], config['resolution'])
|
||||
|
||||
def simplify_adjancent_polygons(self, config, data_source):
|
||||
simple_geometries = PolygonSimplifier( map( lambda g: g.geom, data_source.geometries ) ).simplify()
|
||||
for i in range(len(data_source.geometries)):
|
||||
data_source.geometries[i].geom = simple_geometries[i]
|
||||
|
||||
def intersect_rect(self, config, data_source):
|
||||
transform = osr.CoordinateTransformation( data_source.layer.GetSpatialRef(), data_source.spatialRef )
|
||||
point1 = transform.TransformPoint(config['rect'][0], config['rect'][1])
|
||||
point2 = transform.TransformPoint(config['rect'][2], config['rect'][3])
|
||||
rect = shapely.geometry.box(point1[0], point1[1], point2[0], point2[1])
|
||||
for geometry in data_source.geometries:
|
||||
geometry.geom = geometry.geom.intersection(rect)
|
||||
|
||||
def remove_small_polygons(self, config, data_source):
|
||||
for geometry in data_source.geometries:
|
||||
if isinstance(geometry.geom, shapely.geometry.multipolygon.MultiPolygon):
|
||||
polygons = geometry.geom.geoms
|
||||
else:
|
||||
polygons = [geometry.geom]
|
||||
polygons = filter(lambda p: p.area > config['minimal_area'], polygons)
|
||||
if len(polygons) > 0:
|
||||
geometry.geom = shapely.geometry.multipolygon.MultiPolygon(polygons)
|
||||
|
||||
|
||||
args = {}
|
||||
if len(sys.argv) > 1:
|
||||
paramsJson = open(sys.argv[1], 'r').read()
|
||||
else:
|
||||
paramsJson = sys.stdin.read()
|
||||
paramsJson = json.loads(paramsJson)
|
||||
|
||||
processor = Processor(paramsJson)
|
||||
processor.process()
|
||||
@@ -0,0 +1,205 @@
|
||||
import argparse
|
||||
import sys
|
||||
import os
|
||||
from osgeo import ogr
|
||||
from osgeo import osr
|
||||
import anyjson
|
||||
import shapely.geometry
|
||||
import shapely.ops
|
||||
import codecs
|
||||
import time
|
||||
|
||||
|
||||
format = '%.8f %.8f'
|
||||
tolerance = 0.01
|
||||
infile = '/Users/kirilllebedev/Maps/50m-admin-0-countries/ne_50m_admin_0_countries.shp'
|
||||
outfile = 'map.shp'
|
||||
|
||||
# Open the datasource to operate on.
|
||||
in_ds = ogr.Open( infile, update = 0 )
|
||||
in_layer = in_ds.GetLayer( 0 )
|
||||
in_defn = in_layer.GetLayerDefn()
|
||||
|
||||
|
||||
# Create output file with similar information.
|
||||
shp_driver = ogr.GetDriverByName( 'ESRI Shapefile' )
|
||||
if os.path.exists('map.shp'):
|
||||
shp_driver.DeleteDataSource( outfile )
|
||||
shp_ds = shp_driver.CreateDataSource( outfile )
|
||||
shp_layer = shp_ds.CreateLayer( in_defn.GetName(),
|
||||
geom_type = in_defn.GetGeomType(),
|
||||
srs = in_layer.GetSpatialRef() )
|
||||
|
||||
in_field_count = in_defn.GetFieldCount()
|
||||
for fld_index in range(in_field_count):
|
||||
src_fd = in_defn.GetFieldDefn( fld_index )
|
||||
fd = ogr.FieldDefn( src_fd.GetName(), src_fd.GetType() )
|
||||
fd.SetWidth( src_fd.GetWidth() )
|
||||
fd.SetPrecision( src_fd.GetPrecision() )
|
||||
shp_layer.CreateField( fd )
|
||||
|
||||
|
||||
# Load geometries
|
||||
geometries = []
|
||||
for feature in in_layer:
|
||||
geometry = feature.GetGeometryRef()
|
||||
geometryType = geometry.GetGeometryType()
|
||||
|
||||
if geometryType == ogr.wkbPolygon or geometryType == ogr.wkbMultiPolygon:
|
||||
shapelyGeometry = shapely.wkb.loads( geometry.ExportToWkb() )
|
||||
#if not shapelyGeometry.is_valid:
|
||||
#buffer to fix selfcrosses
|
||||
#shapelyGeometry = shapelyGeometry.buffer(0)
|
||||
if shapelyGeometry:
|
||||
geometries.append(shapelyGeometry)
|
||||
in_layer.ResetReading()
|
||||
|
||||
start = int(round(time.time() * 1000))
|
||||
# Simplification
|
||||
points = []
|
||||
connections = {}
|
||||
counter = 0
|
||||
for geom in geometries:
|
||||
counter += 1
|
||||
polygons = []
|
||||
|
||||
if isinstance(geom, shapely.geometry.Polygon):
|
||||
polygons.append(geom)
|
||||
else:
|
||||
for polygon in geom:
|
||||
polygons.append(polygon)
|
||||
|
||||
for polygon in polygons:
|
||||
if polygon.area > 0:
|
||||
lines = []
|
||||
lines.append(polygon.exterior)
|
||||
for line in polygon.interiors:
|
||||
lines.append(line)
|
||||
|
||||
for line in lines:
|
||||
for i in range(len(line.coords)-1):
|
||||
indexFrom = i
|
||||
indexTo = i+1
|
||||
pointFrom = format % line.coords[indexFrom]
|
||||
pointTo = format % line.coords[indexTo]
|
||||
if pointFrom == pointTo:
|
||||
continue
|
||||
if not (pointFrom in connections):
|
||||
connections[pointFrom] = {}
|
||||
connections[pointFrom][pointTo] = 1
|
||||
if not (pointTo in connections):
|
||||
connections[pointTo] = {}
|
||||
connections[pointTo][pointFrom] = 1
|
||||
print int(round(time.time() * 1000)) - start
|
||||
|
||||
simplifiedLines = {}
|
||||
pivotPoints = {}
|
||||
def simplifyRing(ring):
|
||||
coords = list(ring.coords)[0:-1]
|
||||
simpleCoords = []
|
||||
|
||||
isPivot = False
|
||||
pointIndex = 0
|
||||
while not isPivot and pointIndex < len(coords):
|
||||
pointStr = format % coords[pointIndex]
|
||||
pointIndex += 1
|
||||
isPivot = ((len(connections[pointStr]) > 2) or (pointStr in pivotPoints))
|
||||
pointIndex = pointIndex - 1
|
||||
|
||||
if not isPivot:
|
||||
simpleRing = shapely.geometry.LineString(coords).simplify(tolerance)
|
||||
if len(simpleRing.coords) <= 2:
|
||||
return None
|
||||
else:
|
||||
pivotPoints[format % coords[0]] = True
|
||||
pivotPoints[format % coords[-1]] = True
|
||||
simpleLineKey = format % coords[0]+':'+format % coords[1]+':'+format % coords[-1]
|
||||
simplifiedLines[simpleLineKey] = simpleRing.coords
|
||||
return simpleRing
|
||||
else:
|
||||
points = coords[pointIndex:len(coords)]
|
||||
points.extend(coords[0:pointIndex+1])
|
||||
iFrom = 0
|
||||
for i in range(1, len(points)):
|
||||
pointStr = format % points[i]
|
||||
if ((len(connections[pointStr]) > 2) or (pointStr in pivotPoints)):
|
||||
line = points[iFrom:i+1]
|
||||
lineKey = format % line[-1]+':'+format % line[-2]+':'+format % line[0]
|
||||
if lineKey in simplifiedLines:
|
||||
simpleLine = simplifiedLines[lineKey]
|
||||
simpleLine = list(reversed(simpleLine))
|
||||
else:
|
||||
simpleLine = shapely.geometry.LineString(line).simplify(tolerance).coords
|
||||
lineKey = format % line[0]+':'+format % line[1]+':'+format % line[-1]
|
||||
simplifiedLines[lineKey] = simpleLine
|
||||
simpleCoords.extend( simpleLine[0:-1] )
|
||||
iFrom = i
|
||||
if len(simpleCoords) <= 2:
|
||||
return None
|
||||
else:
|
||||
return shapely.geometry.LineString(simpleCoords)
|
||||
|
||||
|
||||
def simplifyPolygon(polygon):
|
||||
simpleExtRing = simplifyRing(polygon.exterior)
|
||||
if simpleExtRing is None:
|
||||
return None
|
||||
simpleIntRings = []
|
||||
for ring in polygon.interiors:
|
||||
simpleIntRing = simplifyRing(ring)
|
||||
if simpleIntRing is not None:
|
||||
simpleIntRings.append(simpleIntRing)
|
||||
return shapely.geometry.Polygon(simpleExtRing, simpleIntRings)
|
||||
|
||||
|
||||
results = []
|
||||
for geom in geometries:
|
||||
polygons = []
|
||||
simplePolygons = []
|
||||
|
||||
if isinstance(geom, shapely.geometry.Polygon):
|
||||
polygons.append(geom)
|
||||
else:
|
||||
for polygon in geom:
|
||||
polygons.append(polygon)
|
||||
|
||||
for polygon in polygons:
|
||||
simplePolygon = simplifyPolygon(polygon)
|
||||
if not (simplePolygon is None or simplePolygon._geom is None):
|
||||
simplePolygons.append(simplePolygon)
|
||||
|
||||
if len(simplePolygons) > 0:
|
||||
results.append(shapely.geometry.MultiPolygon(simplePolygons))
|
||||
else:
|
||||
results.append(None)
|
||||
|
||||
|
||||
# Process all features in input layer.
|
||||
in_feat = in_layer.GetNextFeature()
|
||||
counter = 0
|
||||
while in_feat is not None:
|
||||
if results[counter] is not None:
|
||||
out_feat = ogr.Feature( feature_def = shp_layer.GetLayerDefn() )
|
||||
out_feat.SetFrom( in_feat )
|
||||
out_feat.SetGeometryDirectly(
|
||||
ogr.CreateGeometryFromWkb(
|
||||
shapely.wkb.dumps(
|
||||
results[counter]
|
||||
)
|
||||
)
|
||||
)
|
||||
shp_layer.CreateFeature( out_feat )
|
||||
out_feat.Destroy()
|
||||
else:
|
||||
print 'geometry is too small: '+in_feat.GetField(16)
|
||||
|
||||
in_feat.Destroy()
|
||||
in_feat = in_layer.GetNextFeature()
|
||||
counter += 1
|
||||
|
||||
|
||||
# Cleanup
|
||||
shp_ds.Destroy()
|
||||
in_ds.Destroy()
|
||||
|
||||
print int(round(time.time() * 1000)) - start
|
||||
@@ -0,0 +1,135 @@
|
||||
svg {
|
||||
touch-action: none;
|
||||
}
|
||||
|
||||
.jvectormap-container {
|
||||
width: 100%;
|
||||
height: 100%;
|
||||
position: relative;
|
||||
overflow: hidden;
|
||||
touch-action: none;
|
||||
}
|
||||
|
||||
.jvectormap-tip {
|
||||
position: absolute;
|
||||
display: none;
|
||||
border: solid 1px #CDCDCD;
|
||||
border-radius: 3px;
|
||||
background: #292929;
|
||||
color: white;
|
||||
font-family: sans-serif, Verdana;
|
||||
font-size: smaller;
|
||||
padding: 3px;
|
||||
}
|
||||
|
||||
.jvectormap-zoomin, .jvectormap-zoomout, .jvectormap-goback {
|
||||
position: absolute;
|
||||
left: 10px;
|
||||
border-radius: 3px;
|
||||
background: #292929;
|
||||
padding: 3px;
|
||||
color: white;
|
||||
cursor: pointer;
|
||||
line-height: 10px;
|
||||
text-align: center;
|
||||
box-sizing: content-box;
|
||||
}
|
||||
|
||||
.jvectormap-zoomin, .jvectormap-zoomout {
|
||||
width: 10px;
|
||||
height: 10px;
|
||||
}
|
||||
|
||||
.jvectormap-zoomin {
|
||||
top: 10px;
|
||||
}
|
||||
|
||||
.jvectormap-zoomout {
|
||||
top: 30px;
|
||||
}
|
||||
|
||||
.jvectormap-goback {
|
||||
bottom: 10px;
|
||||
z-index: 1000;
|
||||
padding: 6px;
|
||||
}
|
||||
|
||||
.jvectormap-spinner {
|
||||
position: absolute;
|
||||
left: 0;
|
||||
top: 0;
|
||||
right: 0;
|
||||
bottom: 0;
|
||||
background: center no-repeat url(data:image/gif;base64,R0lGODlhIAAgAPMAAP///wAAAMbGxoSEhLa2tpqamjY2NlZWVtjY2OTk5Ly8vB4eHgQEBAAAAAAAAAAAACH/C05FVFNDQVBFMi4wAwEAAAAh/hpDcmVhdGVkIHdpdGggYWpheGxvYWQuaW5mbwAh+QQJCgAAACwAAAAAIAAgAAAE5xDISWlhperN52JLhSSdRgwVo1ICQZRUsiwHpTJT4iowNS8vyW2icCF6k8HMMBkCEDskxTBDAZwuAkkqIfxIQyhBQBFvAQSDITM5VDW6XNE4KagNh6Bgwe60smQUB3d4Rz1ZBApnFASDd0hihh12BkE9kjAJVlycXIg7CQIFA6SlnJ87paqbSKiKoqusnbMdmDC2tXQlkUhziYtyWTxIfy6BE8WJt5YJvpJivxNaGmLHT0VnOgSYf0dZXS7APdpB309RnHOG5gDqXGLDaC457D1zZ/V/nmOM82XiHRLYKhKP1oZmADdEAAAh+QQJCgAAACwAAAAAIAAgAAAE6hDISWlZpOrNp1lGNRSdRpDUolIGw5RUYhhHukqFu8DsrEyqnWThGvAmhVlteBvojpTDDBUEIFwMFBRAmBkSgOrBFZogCASwBDEY/CZSg7GSE0gSCjQBMVG023xWBhklAnoEdhQEfyNqMIcKjhRsjEdnezB+A4k8gTwJhFuiW4dokXiloUepBAp5qaKpp6+Ho7aWW54wl7obvEe0kRuoplCGepwSx2jJvqHEmGt6whJpGpfJCHmOoNHKaHx61WiSR92E4lbFoq+B6QDtuetcaBPnW6+O7wDHpIiK9SaVK5GgV543tzjgGcghAgAh+QQJCgAAACwAAAAAIAAgAAAE7hDISSkxpOrN5zFHNWRdhSiVoVLHspRUMoyUakyEe8PTPCATW9A14E0UvuAKMNAZKYUZCiBMuBakSQKG8G2FzUWox2AUtAQFcBKlVQoLgQReZhQlCIJesQXI5B0CBnUMOxMCenoCfTCEWBsJColTMANldx15BGs8B5wlCZ9Po6OJkwmRpnqkqnuSrayqfKmqpLajoiW5HJq7FL1Gr2mMMcKUMIiJgIemy7xZtJsTmsM4xHiKv5KMCXqfyUCJEonXPN2rAOIAmsfB3uPoAK++G+w48edZPK+M6hLJpQg484enXIdQFSS1u6UhksENEQAAIfkECQoAAAAsAAAAACAAIAAABOcQyEmpGKLqzWcZRVUQnZYg1aBSh2GUVEIQ2aQOE+G+cD4ntpWkZQj1JIiZIogDFFyHI0UxQwFugMSOFIPJftfVAEoZLBbcLEFhlQiqGp1Vd140AUklUN3eCA51C1EWMzMCezCBBmkxVIVHBWd3HHl9JQOIJSdSnJ0TDKChCwUJjoWMPaGqDKannasMo6WnM562R5YluZRwur0wpgqZE7NKUm+FNRPIhjBJxKZteWuIBMN4zRMIVIhffcgojwCF117i4nlLnY5ztRLsnOk+aV+oJY7V7m76PdkS4trKcdg0Zc0tTcKkRAAAIfkECQoAAAAsAAAAACAAIAAABO4QyEkpKqjqzScpRaVkXZWQEximw1BSCUEIlDohrft6cpKCk5xid5MNJTaAIkekKGQkWyKHkvhKsR7ARmitkAYDYRIbUQRQjWBwJRzChi9CRlBcY1UN4g0/VNB0AlcvcAYHRyZPdEQFYV8ccwR5HWxEJ02YmRMLnJ1xCYp0Y5idpQuhopmmC2KgojKasUQDk5BNAwwMOh2RtRq5uQuPZKGIJQIGwAwGf6I0JXMpC8C7kXWDBINFMxS4DKMAWVWAGYsAdNqW5uaRxkSKJOZKaU3tPOBZ4DuK2LATgJhkPJMgTwKCdFjyPHEnKxFCDhEAACH5BAkKAAAALAAAAAAgACAAAATzEMhJaVKp6s2nIkolIJ2WkBShpkVRWqqQrhLSEu9MZJKK9y1ZrqYK9WiClmvoUaF8gIQSNeF1Er4MNFn4SRSDARWroAIETg1iVwuHjYB1kYc1mwruwXKC9gmsJXliGxc+XiUCby9ydh1sOSdMkpMTBpaXBzsfhoc5l58Gm5yToAaZhaOUqjkDgCWNHAULCwOLaTmzswadEqggQwgHuQsHIoZCHQMMQgQGubVEcxOPFAcMDAYUA85eWARmfSRQCdcMe0zeP1AAygwLlJtPNAAL19DARdPzBOWSm1brJBi45soRAWQAAkrQIykShQ9wVhHCwCQCACH5BAkKAAAALAAAAAAgACAAAATrEMhJaVKp6s2nIkqFZF2VIBWhUsJaTokqUCoBq+E71SRQeyqUToLA7VxF0JDyIQh/MVVPMt1ECZlfcjZJ9mIKoaTl1MRIl5o4CUKXOwmyrCInCKqcWtvadL2SYhyASyNDJ0uIiRMDjI0Fd30/iI2UA5GSS5UDj2l6NoqgOgN4gksEBgYFf0FDqKgHnyZ9OX8HrgYHdHpcHQULXAS2qKpENRg7eAMLC7kTBaixUYFkKAzWAAnLC7FLVxLWDBLKCwaKTULgEwbLA4hJtOkSBNqITT3xEgfLpBtzE/jiuL04RGEBgwWhShRgQExHBAAh+QQJCgAAACwAAAAAIAAgAAAE7xDISWlSqerNpyJKhWRdlSAVoVLCWk6JKlAqAavhO9UkUHsqlE6CwO1cRdCQ8iEIfzFVTzLdRAmZX3I2SfZiCqGk5dTESJeaOAlClzsJsqwiJwiqnFrb2nS9kmIcgEsjQydLiIlHehhpejaIjzh9eomSjZR+ipslWIRLAgMDOR2DOqKogTB9pCUJBagDBXR6XB0EBkIIsaRsGGMMAxoDBgYHTKJiUYEGDAzHC9EACcUGkIgFzgwZ0QsSBcXHiQvOwgDdEwfFs0sDzt4S6BK4xYjkDOzn0unFeBzOBijIm1Dgmg5YFQwsCMjp1oJ8LyIAACH5BAkKAAAALAAAAAAgACAAAATwEMhJaVKp6s2nIkqFZF2VIBWhUsJaTokqUCoBq+E71SRQeyqUToLA7VxF0JDyIQh/MVVPMt1ECZlfcjZJ9mIKoaTl1MRIl5o4CUKXOwmyrCInCKqcWtvadL2SYhyASyNDJ0uIiUd6GGl6NoiPOH16iZKNlH6KmyWFOggHhEEvAwwMA0N9GBsEC6amhnVcEwavDAazGwIDaH1ipaYLBUTCGgQDA8NdHz0FpqgTBwsLqAbWAAnIA4FWKdMLGdYGEgraigbT0OITBcg5QwPT4xLrROZL6AuQAPUS7bxLpoWidY0JtxLHKhwwMJBTHgPKdEQAACH5BAkKAAAALAAAAAAgACAAAATrEMhJaVKp6s2nIkqFZF2VIBWhUsJaTokqUCoBq+E71SRQeyqUToLA7VxF0JDyIQh/MVVPMt1ECZlfcjZJ9mIKoaTl1MRIl5o4CUKXOwmyrCInCKqcWtvadL2SYhyASyNDJ0uIiUd6GAULDJCRiXo1CpGXDJOUjY+Yip9DhToJA4RBLwMLCwVDfRgbBAaqqoZ1XBMHswsHtxtFaH1iqaoGNgAIxRpbFAgfPQSqpbgGBqUD1wBXeCYp1AYZ19JJOYgH1KwA4UBvQwXUBxPqVD9L3sbp2BNk2xvvFPJd+MFCN6HAAIKgNggY0KtEBAAh+QQJCgAAACwAAAAAIAAgAAAE6BDISWlSqerNpyJKhWRdlSAVoVLCWk6JKlAqAavhO9UkUHsqlE6CwO1cRdCQ8iEIfzFVTzLdRAmZX3I2SfYIDMaAFdTESJeaEDAIMxYFqrOUaNW4E4ObYcCXaiBVEgULe0NJaxxtYksjh2NLkZISgDgJhHthkpU4mW6blRiYmZOlh4JWkDqILwUGBnE6TYEbCgevr0N1gH4At7gHiRpFaLNrrq8HNgAJA70AWxQIH1+vsYMDAzZQPC9VCNkDWUhGkuE5PxJNwiUK4UfLzOlD4WvzAHaoG9nxPi5d+jYUqfAhhykOFwJWiAAAIfkECQoAAAAsAAAAACAAIAAABPAQyElpUqnqzaciSoVkXVUMFaFSwlpOCcMYlErAavhOMnNLNo8KsZsMZItJEIDIFSkLGQoQTNhIsFehRww2CQLKF0tYGKYSg+ygsZIuNqJksKgbfgIGepNo2cIUB3V1B3IvNiBYNQaDSTtfhhx0CwVPI0UJe0+bm4g5VgcGoqOcnjmjqDSdnhgEoamcsZuXO1aWQy8KAwOAuTYYGwi7w5h+Kr0SJ8MFihpNbx+4Erq7BYBuzsdiH1jCAzoSfl0rVirNbRXlBBlLX+BP0XJLAPGzTkAuAOqb0WT5AH7OcdCm5B8TgRwSRKIHQtaLCwg1RAAAOwAAAAAAAAAAAA==);
|
||||
}
|
||||
|
||||
.jvectormap-legend-title {
|
||||
font-weight: bold;
|
||||
font-size: 14px;
|
||||
text-align: center;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt {
|
||||
position: absolute;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-h {
|
||||
bottom: 0;
|
||||
right: 0;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-v {
|
||||
top: 0;
|
||||
right: 0;
|
||||
}
|
||||
|
||||
.jvectormap-legend {
|
||||
background: black;
|
||||
color: white;
|
||||
border-radius: 3px;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-h .jvectormap-legend {
|
||||
float: left;
|
||||
margin: 0 10px 10px 0;
|
||||
padding: 3px 3px 1px 3px;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-h .jvectormap-legend .jvectormap-legend-tick {
|
||||
float: left;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-v .jvectormap-legend {
|
||||
margin: 10px 10px 0 0;
|
||||
padding: 3px;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-h .jvectormap-legend-tick {
|
||||
width: 40px;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-h .jvectormap-legend-tick-sample {
|
||||
height: 15px;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-v .jvectormap-legend-tick-sample {
|
||||
height: 20px;
|
||||
width: 20px;
|
||||
display: inline-block;
|
||||
vertical-align: middle;
|
||||
}
|
||||
|
||||
.jvectormap-legend-tick-text {
|
||||
font-size: 12px;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-h .jvectormap-legend-tick-text {
|
||||
text-align: center;
|
||||
}
|
||||
|
||||
.jvectormap-legend-cnt-v .jvectormap-legend-tick-text {
|
||||
display: inline-block;
|
||||
vertical-align: middle;
|
||||
line-height: 20px;
|
||||
padding-left: 3px;
|
||||
}
|
||||
File diff suppressed because one or more lines are too long
+201
@@ -0,0 +1,201 @@
|
||||
/*! Copyright (c) 2013 Brandon Aaron (http://brandon.aaron.sh)
|
||||
* Licensed under the MIT License (LICENSE.txt).
|
||||
*
|
||||
* Version: 3.1.9
|
||||
*
|
||||
* Requires: jQuery 1.2.2+
|
||||
*/
|
||||
|
||||
(function (factory) {
|
||||
if ( typeof define === 'function' && define.amd ) {
|
||||
// AMD. Register as an anonymous module.
|
||||
define(['jquery'], factory);
|
||||
} else if (typeof exports === 'object') {
|
||||
// Node/CommonJS style for Browserify
|
||||
module.exports = factory;
|
||||
} else {
|
||||
// Browser globals
|
||||
factory(jQuery);
|
||||
}
|
||||
}(function ($) {
|
||||
|
||||
var toFix = ['wheel', 'mousewheel', 'DOMMouseScroll', 'MozMousePixelScroll'],
|
||||
toBind = ( 'onwheel' in document || document.documentMode >= 9 ) ?
|
||||
['wheel'] : ['mousewheel', 'DomMouseScroll', 'MozMousePixelScroll'],
|
||||
slice = Array.prototype.slice,
|
||||
nullLowestDeltaTimeout, lowestDelta;
|
||||
|
||||
if ( $.event.fixHooks ) {
|
||||
for ( var i = toFix.length; i; ) {
|
||||
$.event.fixHooks[ toFix[--i] ] = $.event.mouseHooks;
|
||||
}
|
||||
}
|
||||
|
||||
var special = $.event.special.mousewheel = {
|
||||
version: '3.1.9',
|
||||
|
||||
setup: function() {
|
||||
if ( this.addEventListener ) {
|
||||
for ( var i = toBind.length; i; ) {
|
||||
this.addEventListener( toBind[--i], handler, false );
|
||||
}
|
||||
} else {
|
||||
this.onmousewheel = handler;
|
||||
}
|
||||
// Store the line height and page height for this particular element
|
||||
$.data(this, 'mousewheel-line-height', special.getLineHeight(this));
|
||||
$.data(this, 'mousewheel-page-height', special.getPageHeight(this));
|
||||
},
|
||||
|
||||
teardown: function() {
|
||||
if ( this.removeEventListener ) {
|
||||
for ( var i = toBind.length; i; ) {
|
||||
this.removeEventListener( toBind[--i], handler, false );
|
||||
}
|
||||
} else {
|
||||
this.onmousewheel = null;
|
||||
}
|
||||
},
|
||||
|
||||
getLineHeight: function(elem) {
|
||||
return parseInt($(elem)['offsetParent' in $.fn ? 'offsetParent' : 'parent']().css('fontSize'), 10);
|
||||
},
|
||||
|
||||
getPageHeight: function(elem) {
|
||||
return $(elem).height();
|
||||
},
|
||||
|
||||
settings: {
|
||||
adjustOldDeltas: true
|
||||
}
|
||||
};
|
||||
|
||||
$.fn.extend({
|
||||
mousewheel: function(fn) {
|
||||
return fn ? this.bind('mousewheel', fn) : this.trigger('mousewheel');
|
||||
},
|
||||
|
||||
unmousewheel: function(fn) {
|
||||
return this.unbind('mousewheel', fn);
|
||||
}
|
||||
});
|
||||
|
||||
|
||||
function handler(event) {
|
||||
var orgEvent = event || window.event,
|
||||
args = slice.call(arguments, 1),
|
||||
delta = 0,
|
||||
deltaX = 0,
|
||||
deltaY = 0,
|
||||
absDelta = 0;
|
||||
event = $.event.fix(orgEvent);
|
||||
event.type = 'mousewheel';
|
||||
|
||||
// Old school scrollwheel delta
|
||||
if ( 'detail' in orgEvent ) { deltaY = orgEvent.detail * -1; }
|
||||
if ( 'wheelDelta' in orgEvent ) { deltaY = orgEvent.wheelDelta; }
|
||||
if ( 'wheelDeltaY' in orgEvent ) { deltaY = orgEvent.wheelDeltaY; }
|
||||
if ( 'wheelDeltaX' in orgEvent ) { deltaX = orgEvent.wheelDeltaX * -1; }
|
||||
|
||||
// Firefox < 17 horizontal scrolling related to DOMMouseScroll event
|
||||
if ( 'axis' in orgEvent && orgEvent.axis === orgEvent.HORIZONTAL_AXIS ) {
|
||||
deltaX = deltaY * -1;
|
||||
deltaY = 0;
|
||||
}
|
||||
|
||||
// Set delta to be deltaY or deltaX if deltaY is 0 for backwards compatabilitiy
|
||||
delta = deltaY === 0 ? deltaX : deltaY;
|
||||
|
||||
// New school wheel delta (wheel event)
|
||||
if ( 'deltaY' in orgEvent ) {
|
||||
deltaY = orgEvent.deltaY * -1;
|
||||
delta = deltaY;
|
||||
}
|
||||
if ( 'deltaX' in orgEvent ) {
|
||||
deltaX = orgEvent.deltaX;
|
||||
if ( deltaY === 0 ) { delta = deltaX * -1; }
|
||||
}
|
||||
|
||||
// No change actually happened, no reason to go any further
|
||||
if ( deltaY === 0 && deltaX === 0 ) { return; }
|
||||
|
||||
// Need to convert lines and pages to pixels if we aren't already in pixels
|
||||
// There are three delta modes:
|
||||
// * deltaMode 0 is by pixels, nothing to do
|
||||
// * deltaMode 1 is by lines
|
||||
// * deltaMode 2 is by pages
|
||||
if ( orgEvent.deltaMode === 1 ) {
|
||||
var lineHeight = $.data(this, 'mousewheel-line-height');
|
||||
delta *= lineHeight;
|
||||
deltaY *= lineHeight;
|
||||
deltaX *= lineHeight;
|
||||
} else if ( orgEvent.deltaMode === 2 ) {
|
||||
var pageHeight = $.data(this, 'mousewheel-page-height');
|
||||
delta *= pageHeight;
|
||||
deltaY *= pageHeight;
|
||||
deltaX *= pageHeight;
|
||||
}
|
||||
|
||||
// Store lowest absolute delta to normalize the delta values
|
||||
absDelta = Math.max( Math.abs(deltaY), Math.abs(deltaX) );
|
||||
|
||||
if ( !lowestDelta || absDelta < lowestDelta ) {
|
||||
lowestDelta = absDelta;
|
||||
|
||||
// Adjust older deltas if necessary
|
||||
if ( shouldAdjustOldDeltas(orgEvent, absDelta) ) {
|
||||
lowestDelta /= 40;
|
||||
}
|
||||
}
|
||||
|
||||
// Adjust older deltas if necessary
|
||||
if ( shouldAdjustOldDeltas(orgEvent, absDelta) ) {
|
||||
// Divide all the things by 40!
|
||||
delta /= 40;
|
||||
deltaX /= 40;
|
||||
deltaY /= 40;
|
||||
}
|
||||
|
||||
// Get a whole, normalized value for the deltas
|
||||
delta = Math[ delta >= 1 ? 'floor' : 'ceil' ](delta / lowestDelta);
|
||||
deltaX = Math[ deltaX >= 1 ? 'floor' : 'ceil' ](deltaX / lowestDelta);
|
||||
deltaY = Math[ deltaY >= 1 ? 'floor' : 'ceil' ](deltaY / lowestDelta);
|
||||
|
||||
// Add information to the event object
|
||||
event.deltaX = deltaX;
|
||||
event.deltaY = deltaY;
|
||||
event.deltaFactor = lowestDelta;
|
||||
// Go ahead and set deltaMode to 0 since we converted to pixels
|
||||
// Although this is a little odd since we overwrite the deltaX/Y
|
||||
// properties with normalized deltas.
|
||||
event.deltaMode = 0;
|
||||
|
||||
// Add event and delta to the front of the arguments
|
||||
args.unshift(event, delta, deltaX, deltaY);
|
||||
|
||||
// Clearout lowestDelta after sometime to better
|
||||
// handle multiple device types that give different
|
||||
// a different lowestDelta
|
||||
// Ex: trackpad = 3 and mouse wheel = 120
|
||||
if (nullLowestDeltaTimeout) { clearTimeout(nullLowestDeltaTimeout); }
|
||||
nullLowestDeltaTimeout = setTimeout(nullLowestDelta, 200);
|
||||
|
||||
return ($.event.dispatch || $.event.handle).apply(this, args);
|
||||
}
|
||||
|
||||
function nullLowestDelta() {
|
||||
lowestDelta = null;
|
||||
}
|
||||
|
||||
function shouldAdjustOldDeltas(orgEvent, absDelta) {
|
||||
// If this is an older event and the delta is divisable by 120,
|
||||
// then we are assuming that the browser is treating this as an
|
||||
// older mouse wheel event and that we should divide the deltas
|
||||
// by 40 to try and get a more usable deltaFactor.
|
||||
// Side note, this actually impacts the reported scroll distance
|
||||
// in older browsers and can cause scrolling to be slower than native.
|
||||
// Turn this off by setting $.event.special.mousewheel.settings.adjustOldDeltas to false.
|
||||
return special.settings.adjustOldDeltas && orgEvent.type === 'mousewheel' && absDelta % 120 === 0;
|
||||
}
|
||||
|
||||
}));
|
||||
Reference in New Issue
Block a user