SGH / COMPONENTS

Commit 2b9ef0b0fd17d4d0edd7fe7c07b6c469bd315edb

Authored by Renato De Donato
1 parent 4bd2f9c2

JSDarkSide

Inline Side-by-side
Showing 12 changed files with 2019 additions and 0 deletions
bower_components/JSDataChecker/.bower.json 0 → 100644
  View file @2b9ef0b
  1 +{
  2 + "name": "JSDataChecker",
  3 + "version": "0.0.7",
  4 + "homepage": "https://github.com/donpir/JSDataChecker",
  5 + "authors": [
  6 + "'Donato Pirozzi <'donatopirozzi@gmail.com'>"
  7 + ],
  8 + "description": "Javascript library to read dataset content (e.g., Open Data), infer data types, give a data quality indicator and parse content",
  9 + "main": "JSDataChecker/jsdatachecker.min.js",
  10 + "license": "GPL",
  11 + "ignore": [
  12 + "**/.*",
  13 + "node_modules",
  14 + "bower_components",
  15 + "tests"
  16 + ],
  17 + "devDependencies": {
  18 + "paper-progress": "PolymerElements/paper-progress#~1.0.8",
  19 + "polymer": "Polymer/polymer#1.2.0",
  20 + "qunit": "~1.22.0",
  21 + "csvjson": "0.1.1",
  22 + "polywc": "https://github.com/donpir/polywc.git#master"
  23 + },
  24 + "private": false,
  25 + "_release": "0.0.7",
  26 + "_resolution": {
  27 + "type": "version",
  28 + "tag": "v0.0.7",
  29 + "commit": "f6d2d47543510eeefc2e0a9bda86dec09ac4b092"
  30 + },
  31 + "_source": "https://github.com/donpir/JSDataChecker.git",
  32 + "_target": "~0.0.6",
  33 + "_originalSource": "jsdatachecker"
  34 +}
0 \ No newline at end of file 35 \ No newline at end of file
bower_components/JSDataChecker/LICENSE 0 → 100644
  View file @2b9ef0b
  1 + GNU GENERAL PUBLIC LICENSE
  2 + Version 3, 29 June 2007
  3 +
  4 + Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  5 + Everyone is permitted to copy and distribute verbatim copies
  6 + of this license document, but changing it is not allowed.
  7 +
  8 + Preamble
  9 +
  10 + The GNU General Public License is a free, copyleft license for
  11 +software and other kinds of works.
  12 +
  13 + The licenses for most software and other practical works are designed
  14 +to take away your freedom to share and change the works. By contrast,
  15 +the GNU General Public License is intended to guarantee your freedom to
  16 +share and change all versions of a program--to make sure it remains free
  17 +software for all its users. We, the Free Software Foundation, use the
  18 +GNU General Public License for most of our software; it applies also to
  19 +any other work released this way by its authors. You can apply it to
  20 +your programs, too.
  21 +
  22 + When we speak of free software, we are referring to freedom, not
  23 +price. Our General Public Licenses are designed to make sure that you
  24 +have the freedom to distribute copies of free software (and charge for
  25 +them if you wish), that you receive source code or can get it if you
  26 +want it, that you can change the software or use pieces of it in new
  27 +free programs, and that you know you can do these things.
  28 +
  29 + To protect your rights, we need to prevent others from denying you
  30 +these rights or asking you to surrender the rights. Therefore, you have
  31 +certain responsibilities if you distribute copies of the software, or if
  32 +you modify it: responsibilities to respect the freedom of others.
  33 +
  34 + For example, if you distribute copies of such a program, whether
  35 +gratis or for a fee, you must pass on to the recipients the same
  36 +freedoms that you received. You must make sure that they, too, receive
  37 +or can get the source code. And you must show them these terms so they
  38 +know their rights.
  39 +
  40 + Developers that use the GNU GPL protect your rights with two steps:
  41 +(1) assert copyright on the software, and (2) offer you this License
  42 +giving you legal permission to copy, distribute and/or modify it.
  43 +
  44 + For the developers' and authors' protection, the GPL clearly explains
  45 +that there is no warranty for this free software. For both users' and
  46 +authors' sake, the GPL requires that modified versions be marked as
  47 +changed, so that their problems will not be attributed erroneously to
  48 +authors of previous versions.
  49 +
  50 + Some devices are designed to deny users access to install or run
  51 +modified versions of the software inside them, although the manufacturer
  52 +can do so. This is fundamentally incompatible with the aim of
  53 +protecting users' freedom to change the software. The systematic
  54 +pattern of such abuse occurs in the area of products for individuals to
  55 +use, which is precisely where it is most unacceptable. Therefore, we
  56 +have designed this version of the GPL to prohibit the practice for those
  57 +products. If such problems arise substantially in other domains, we
  58 +stand ready to extend this provision to those domains in future versions
  59 +of the GPL, as needed to protect the freedom of users.
  60 +
  61 + Finally, every program is threatened constantly by software patents.
  62 +States should not allow patents to restrict development and use of
  63 +software on general-purpose computers, but in those that do, we wish to
  64 +avoid the special danger that patents applied to a free program could
  65 +make it effectively proprietary. To prevent this, the GPL assures that
  66 +patents cannot be used to render the program non-free.
  67 +
  68 + The precise terms and conditions for copying, distribution and
  69 +modification follow.
  70 +
  71 + TERMS AND CONDITIONS
  72 +
  73 + 0. Definitions.
  74 +
  75 + "This License" refers to version 3 of the GNU General Public License.
  76 +
  77 + "Copyright" also means copyright-like laws that apply to other kinds of
  78 +works, such as semiconductor masks.
  79 +
  80 + "The Program" refers to any copyrightable work licensed under this
  81 +License. Each licensee is addressed as "you". "Licensees" and
  82 +"recipients" may be individuals or organizations.
  83 +
  84 + To "modify" a work means to copy from or adapt all or part of the work
  85 +in a fashion requiring copyright permission, other than the making of an
  86 +exact copy. The resulting work is called a "modified version" of the
  87 +earlier work or a work "based on" the earlier work.
  88 +
  89 + A "covered work" means either the unmodified Program or a work based
  90 +on the Program.
  91 +
  92 + To "propagate" a work means to do anything with it that, without
  93 +permission, would make you directly or secondarily liable for
  94 +infringement under applicable copyright law, except executing it on a
  95 +computer or modifying a private copy. Propagation includes copying,
  96 +distribution (with or without modification), making available to the
  97 +public, and in some countries other activities as well.
  98 +
  99 + To "convey" a work means any kind of propagation that enables other
  100 +parties to make or receive copies. Mere interaction with a user through
  101 +a computer network, with no transfer of a copy, is not conveying.
  102 +
  103 + An interactive user interface displays "Appropriate Legal Notices"
  104 +to the extent that it includes a convenient and prominently visible
  105 +feature that (1) displays an appropriate copyright notice, and (2)
  106 +tells the user that there is no warranty for the work (except to the
  107 +extent that warranties are provided), that licensees may convey the
  108 +work under this License, and how to view a copy of this License. If
  109 +the interface presents a list of user commands or options, such as a
  110 +menu, a prominent item in the list meets this criterion.
  111 +
  112 + 1. Source Code.
  113 +
  114 + The "source code" for a work means the preferred form of the work
  115 +for making modifications to it. "Object code" means any non-source
  116 +form of a work.
  117 +
  118 + A "Standard Interface" means an interface that either is an official
  119 +standard defined by a recognized standards body, or, in the case of
  120 +interfaces specified for a particular programming language, one that
  121 +is widely used among developers working in that language.
  122 +
  123 + The "System Libraries" of an executable work include anything, other
  124 +than the work as a whole, that (a) is included in the normal form of
  125 +packaging a Major Component, but which is not part of that Major
  126 +Component, and (b) serves only to enable use of the work with that
  127 +Major Component, or to implement a Standard Interface for which an
  128 +implementation is available to the public in source code form. A
  129 +"Major Component", in this context, means a major essential component
  130 +(kernel, window system, and so on) of the specific operating system
  131 +(if any) on which the executable work runs, or a compiler used to
  132 +produce the work, or an object code interpreter used to run it.
  133 +
  134 + The "Corresponding Source" for a work in object code form means all
  135 +the source code needed to generate, install, and (for an executable
  136 +work) run the object code and to modify the work, including scripts to
  137 +control those activities. However, it does not include the work's
  138 +System Libraries, or general-purpose tools or generally available free
  139 +programs which are used unmodified in performing those activities but
  140 +which are not part of the work. For example, Corresponding Source
  141 +includes interface definition files associated with source files for
  142 +the work, and the source code for shared libraries and dynamically
  143 +linked subprograms that the work is specifically designed to require,
  144 +such as by intimate data communication or control flow between those
  145 +subprograms and other parts of the work.
  146 +
  147 + The Corresponding Source need not include anything that users
  148 +can regenerate automatically from other parts of the Corresponding
  149 +Source.
  150 +
  151 + The Corresponding Source for a work in source code form is that
  152 +same work.
  153 +
  154 + 2. Basic Permissions.
  155 +
  156 + All rights granted under this License are granted for the term of
  157 +copyright on the Program, and are irrevocable provided the stated
  158 +conditions are met. This License explicitly affirms your unlimited
  159 +permission to run the unmodified Program. The output from running a
  160 +covered work is covered by this License only if the output, given its
  161 +content, constitutes a covered work. This License acknowledges your
  162 +rights of fair use or other equivalent, as provided by copyright law.
  163 +
  164 + You may make, run and propagate covered works that you do not
  165 +convey, without conditions so long as your license otherwise remains
  166 +in force. You may convey covered works to others for the sole purpose
  167 +of having them make modifications exclusively for you, or provide you
  168 +with facilities for running those works, provided that you comply with
  169 +the terms of this License in conveying all material for which you do
  170 +not control copyright. Those thus making or running the covered works
  171 +for you must do so exclusively on your behalf, under your direction
  172 +and control, on terms that prohibit them from making any copies of
  173 +your copyrighted material outside their relationship with you.
  174 +
  175 + Conveying under any other circumstances is permitted solely under
  176 +the conditions stated below. Sublicensing is not allowed; section 10
  177 +makes it unnecessary.
  178 +
  179 + 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
  180 +
  181 + No covered work shall be deemed part of an effective technological
  182 +measure under any applicable law fulfilling obligations under article
  183 +11 of the WIPO copyright treaty adopted on 20 December 1996, or
  184 +similar laws prohibiting or restricting circumvention of such
  185 +measures.
  186 +
  187 + When you convey a covered work, you waive any legal power to forbid
  188 +circumvention of technological measures to the extent such circumvention
  189 +is effected by exercising rights under this License with respect to
  190 +the covered work, and you disclaim any intention to limit operation or
  191 +modification of the work as a means of enforcing, against the work's
  192 +users, your or third parties' legal rights to forbid circumvention of
  193 +technological measures.
  194 +
  195 + 4. Conveying Verbatim Copies.
  196 +
  197 + You may convey verbatim copies of the Program's source code as you
  198 +receive it, in any medium, provided that you conspicuously and
  199 +appropriately publish on each copy an appropriate copyright notice;
  200 +keep intact all notices stating that this License and any
  201 +non-permissive terms added in accord with section 7 apply to the code;
  202 +keep intact all notices of the absence of any warranty; and give all
  203 +recipients a copy of this License along with the Program.
  204 +
  205 + You may charge any price or no price for each copy that you convey,
  206 +and you may offer support or warranty protection for a fee.
  207 +
  208 + 5. Conveying Modified Source Versions.
  209 +
  210 + You may convey a work based on the Program, or the modifications to
  211 +produce it from the Program, in the form of source code under the
  212 +terms of section 4, provided that you also meet all of these conditions:
  213 +
  214 + a) The work must carry prominent notices stating that you modified
  215 + it, and giving a relevant date.
  216 +
  217 + b) The work must carry prominent notices stating that it is
  218 + released under this License and any conditions added under section
  219 + 7. This requirement modifies the requirement in section 4 to
  220 + "keep intact all notices".
  221 +
  222 + c) You must license the entire work, as a whole, under this
  223 + License to anyone who comes into possession of a copy. This
  224 + License will therefore apply, along with any applicable section 7
  225 + additional terms, to the whole of the work, and all its parts,
  226 + regardless of how they are packaged. This License gives no
  227 + permission to license the work in any other way, but it does not
  228 + invalidate such permission if you have separately received it.
  229 +
  230 + d) If the work has interactive user interfaces, each must display
  231 + Appropriate Legal Notices; however, if the Program has interactive
  232 + interfaces that do not display Appropriate Legal Notices, your
  233 + work need not make them do so.
  234 +
  235 + A compilation of a covered work with other separate and independent
  236 +works, which are not by their nature extensions of the covered work,
  237 +and which are not combined with it such as to form a larger program,
  238 +in or on a volume of a storage or distribution medium, is called an
  239 +"aggregate" if the compilation and its resulting copyright are not
  240 +used to limit the access or legal rights of the compilation's users
  241 +beyond what the individual works permit. Inclusion of a covered work
  242 +in an aggregate does not cause this License to apply to the other
  243 +parts of the aggregate.
  244 +
  245 + 6. Conveying Non-Source Forms.
  246 +
  247 + You may convey a covered work in object code form under the terms
  248 +of sections 4 and 5, provided that you also convey the
  249 +machine-readable Corresponding Source under the terms of this License,
  250 +in one of these ways:
  251 +
  252 + a) Convey the object code in, or embodied in, a physical product
  253 + (including a physical distribution medium), accompanied by the
  254 + Corresponding Source fixed on a durable physical medium
  255 + customarily used for software interchange.
  256 +
  257 + b) Convey the object code in, or embodied in, a physical product
  258 + (including a physical distribution medium), accompanied by a
  259 + written offer, valid for at least three years and valid for as
  260 + long as you offer spare parts or customer support for that product
  261 + model, to give anyone who possesses the object code either (1) a
  262 + copy of the Corresponding Source for all the software in the
  263 + product that is covered by this License, on a durable physical
  264 + medium customarily used for software interchange, for a price no
  265 + more than your reasonable cost of physically performing this
  266 + conveying of source, or (2) access to copy the
  267 + Corresponding Source from a network server at no charge.
  268 +
  269 + c) Convey individual copies of the object code with a copy of the
  270 + written offer to provide the Corresponding Source. This
  271 + alternative is allowed only occasionally and noncommercially, and
  272 + only if you received the object code with such an offer, in accord
  273 + with subsection 6b.
  274 +
  275 + d) Convey the object code by offering access from a designated
  276 + place (gratis or for a charge), and offer equivalent access to the
  277 + Corresponding Source in the same way through the same place at no
  278 + further charge. You need not require recipients to copy the
  279 + Corresponding Source along with the object code. If the place to
  280 + copy the object code is a network server, the Corresponding Source
  281 + may be on a different server (operated by you or a third party)
  282 + that supports equivalent copying facilities, provided you maintain
  283 + clear directions next to the object code saying where to find the
  284 + Corresponding Source. Regardless of what server hosts the
  285 + Corresponding Source, you remain obligated to ensure that it is
  286 + available for as long as needed to satisfy these requirements.
  287 +
  288 + e) Convey the object code using peer-to-peer transmission, provided
  289 + you inform other peers where the object code and Corresponding
  290 + Source of the work are being offered to the general public at no
  291 + charge under subsection 6d.
  292 +
  293 + A separable portion of the object code, whose source code is excluded
  294 +from the Corresponding Source as a System Library, need not be
  295 +included in conveying the object code work.
  296 +
  297 + A "User Product" is either (1) a "consumer product", which means any
  298 +tangible personal property which is normally used for personal, family,
  299 +or household purposes, or (2) anything designed or sold for incorporation
  300 +into a dwelling. In determining whether a product is a consumer product,
  301 +doubtful cases shall be resolved in favor of coverage. For a particular
  302 +product received by a particular user, "normally used" refers to a
  303 +typical or common use of that class of product, regardless of the status
  304 +of the particular user or of the way in which the particular user
  305 +actually uses, or expects or is expected to use, the product. A product
  306 +is a consumer product regardless of whether the product has substantial
  307 +commercial, industrial or non-consumer uses, unless such uses represent
  308 +the only significant mode of use of the product.
  309 +
  310 + "Installation Information" for a User Product means any methods,
  311 +procedures, authorization keys, or other information required to install
  312 +and execute modified versions of a covered work in that User Product from
  313 +a modified version of its Corresponding Source. The information must
  314 +suffice to ensure that the continued functioning of the modified object
  315 +code is in no case prevented or interfered with solely because
  316 +modification has been made.
  317 +
  318 + If you convey an object code work under this section in, or with, or
  319 +specifically for use in, a User Product, and the conveying occurs as
  320 +part of a transaction in which the right of possession and use of the
  321 +User Product is transferred to the recipient in perpetuity or for a
  322 +fixed term (regardless of how the transaction is characterized), the
  323 +Corresponding Source conveyed under this section must be accompanied
  324 +by the Installation Information. But this requirement does not apply
  325 +if neither you nor any third party retains the ability to install
  326 +modified object code on the User Product (for example, the work has
  327 +been installed in ROM).
  328 +
  329 + The requirement to provide Installation Information does not include a
  330 +requirement to continue to provide support service, warranty, or updates
  331 +for a work that has been modified or installed by the recipient, or for
  332 +the User Product in which it has been modified or installed. Access to a
  333 +network may be denied when the modification itself materially and
  334 +adversely affects the operation of the network or violates the rules and
  335 +protocols for communication across the network.
  336 +
  337 + Corresponding Source conveyed, and Installation Information provided,
  338 +in accord with this section must be in a format that is publicly
  339 +documented (and with an implementation available to the public in
  340 +source code form), and must require no special password or key for
  341 +unpacking, reading or copying.
  342 +
  343 + 7. Additional Terms.
  344 +
  345 + "Additional permissions" are terms that supplement the terms of this
  346 +License by making exceptions from one or more of its conditions.
  347 +Additional permissions that are applicable to the entire Program shall
  348 +be treated as though they were included in this License, to the extent
  349 +that they are valid under applicable law. If additional permissions
  350 +apply only to part of the Program, that part may be used separately
  351 +under those permissions, but the entire Program remains governed by
  352 +this License without regard to the additional permissions.
  353 +
  354 + When you convey a copy of a covered work, you may at your option
  355 +remove any additional permissions from that copy, or from any part of
  356 +it. (Additional permissions may be written to require their own
  357 +removal in certain cases when you modify the work.) You may place
  358 +additional permissions on material, added by you to a covered work,
  359 +for which you have or can give appropriate copyright permission.
  360 +
  361 + Notwithstanding any other provision of this License, for material you
  362 +add to a covered work, you may (if authorized by the copyright holders of
  363 +that material) supplement the terms of this License with terms:
  364 +
  365 + a) Disclaiming warranty or limiting liability differently from the
  366 + terms of sections 15 and 16 of this License; or
  367 +
  368 + b) Requiring preservation of specified reasonable legal notices or
  369 + author attributions in that material or in the Appropriate Legal
  370 + Notices displayed by works containing it; or
  371 +
  372 + c) Prohibiting misrepresentation of the origin of that material, or
  373 + requiring that modified versions of such material be marked in
  374 + reasonable ways as different from the original version; or
  375 +
  376 + d) Limiting the use for publicity purposes of names of licensors or
  377 + authors of the material; or
  378 +
  379 + e) Declining to grant rights under trademark law for use of some
  380 + trade names, trademarks, or service marks; or
  381 +
  382 + f) Requiring indemnification of licensors and authors of that
  383 + material by anyone who conveys the material (or modified versions of
  384 + it) with contractual assumptions of liability to the recipient, for
  385 + any liability that these contractual assumptions directly impose on
  386 + those licensors and authors.
  387 +
  388 + All other non-permissive additional terms are considered "further
  389 +restrictions" within the meaning of section 10. If the Program as you
  390 +received it, or any part of it, contains a notice stating that it is
  391 +governed by this License along with a term that is a further
  392 +restriction, you may remove that term. If a license document contains
  393 +a further restriction but permits relicensing or conveying under this
  394 +License, you may add to a covered work material governed by the terms
  395 +of that license document, provided that the further restriction does
  396 +not survive such relicensing or conveying.
  397 +
  398 + If you add terms to a covered work in accord with this section, you
  399 +must place, in the relevant source files, a statement of the
  400 +additional terms that apply to those files, or a notice indicating
  401 +where to find the applicable terms.
  402 +
  403 + Additional terms, permissive or non-permissive, may be stated in the
  404 +form of a separately written license, or stated as exceptions;
  405 +the above requirements apply either way.
  406 +
  407 + 8. Termination.
  408 +
  409 + You may not propagate or modify a covered work except as expressly
  410 +provided under this License. Any attempt otherwise to propagate or
  411 +modify it is void, and will automatically terminate your rights under
  412 +this License (including any patent licenses granted under the third
  413 +paragraph of section 11).
  414 +
  415 + However, if you cease all violation of this License, then your
  416 +license from a particular copyright holder is reinstated (a)
  417 +provisionally, unless and until the copyright holder explicitly and
  418 +finally terminates your license, and (b) permanently, if the copyright
  419 +holder fails to notify you of the violation by some reasonable means
  420 +prior to 60 days after the cessation.
  421 +
  422 + Moreover, your license from a particular copyright holder is
  423 +reinstated permanently if the copyright holder notifies you of the
  424 +violation by some reasonable means, this is the first time you have
  425 +received notice of violation of this License (for any work) from that
  426 +copyright holder, and you cure the violation prior to 30 days after
  427 +your receipt of the notice.
  428 +
  429 + Termination of your rights under this section does not terminate the
  430 +licenses of parties who have received copies or rights from you under
  431 +this License. If your rights have been terminated and not permanently
  432 +reinstated, you do not qualify to receive new licenses for the same
  433 +material under section 10.
  434 +
  435 + 9. Acceptance Not Required for Having Copies.
  436 +
  437 + You are not required to accept this License in order to receive or
  438 +run a copy of the Program. Ancillary propagation of a covered work
  439 +occurring solely as a consequence of using peer-to-peer transmission
  440 +to receive a copy likewise does not require acceptance. However,
  441 +nothing other than this License grants you permission to propagate or
  442 +modify any covered work. These actions infringe copyright if you do
  443 +not accept this License. Therefore, by modifying or propagating a
  444 +covered work, you indicate your acceptance of this License to do so.
  445 +
  446 + 10. Automatic Licensing of Downstream Recipients.
  447 +
  448 + Each time you convey a covered work, the recipient automatically
  449 +receives a license from the original licensors, to run, modify and
  450 +propagate that work, subject to this License. You are not responsible
  451 +for enforcing compliance by third parties with this License.
  452 +
  453 + An "entity transaction" is a transaction transferring control of an
  454 +organization, or substantially all assets of one, or subdividing an
  455 +organization, or merging organizations. If propagation of a covered
  456 +work results from an entity transaction, each party to that
  457 +transaction who receives a copy of the work also receives whatever
  458 +licenses to the work the party's predecessor in interest had or could
  459 +give under the previous paragraph, plus a right to possession of the
  460 +Corresponding Source of the work from the predecessor in interest, if
  461 +the predecessor has it or can get it with reasonable efforts.
  462 +
  463 + You may not impose any further restrictions on the exercise of the
  464 +rights granted or affirmed under this License. For example, you may
  465 +not impose a license fee, royalty, or other charge for exercise of
  466 +rights granted under this License, and you may not initiate litigation
  467 +(including a cross-claim or counterclaim in a lawsuit) alleging that
  468 +any patent claim is infringed by making, using, selling, offering for
  469 +sale, or importing the Program or any portion of it.
  470 +
  471 + 11. Patents.
  472 +
  473 + A "contributor" is a copyright holder who authorizes use under this
  474 +License of the Program or a work on which the Program is based. The
  475 +work thus licensed is called the contributor's "contributor version".
  476 +
  477 + A contributor's "essential patent claims" are all patent claims
  478 +owned or controlled by the contributor, whether already acquired or
  479 +hereafter acquired, that would be infringed by some manner, permitted
  480 +by this License, of making, using, or selling its contributor version,
  481 +but do not include claims that would be infringed only as a
  482 +consequence of further modification of the contributor version. For
  483 +purposes of this definition, "control" includes the right to grant
  484 +patent sublicenses in a manner consistent with the requirements of
  485 +this License.
  486 +
  487 + Each contributor grants you a non-exclusive, worldwide, royalty-free
  488 +patent license under the contributor's essential patent claims, to
  489 +make, use, sell, offer for sale, import and otherwise run, modify and
  490 +propagate the contents of its contributor version.
  491 +
  492 + In the following three paragraphs, a "patent license" is any express
  493 +agreement or commitment, however denominated, not to enforce a patent
  494 +(such as an express permission to practice a patent or covenant not to
  495 +sue for patent infringement). To "grant" such a patent license to a
  496 +party means to make such an agreement or commitment not to enforce a
  497 +patent against the party.
  498 +
  499 + If you convey a covered work, knowingly relying on a patent license,
  500 +and the Corresponding Source of the work is not available for anyone
  501 +to copy, free of charge and under the terms of this License, through a
  502 +publicly available network server or other readily accessible means,
  503 +then you must either (1) cause the Corresponding Source to be so
  504 +available, or (2) arrange to deprive yourself of the benefit of the
  505 +patent license for this particular work, or (3) arrange, in a manner
  506 +consistent with the requirements of this License, to extend the patent
  507 +license to downstream recipients. "Knowingly relying" means you have
  508 +actual knowledge that, but for the patent license, your conveying the
  509 +covered work in a country, or your recipient's use of the covered work
  510 +in a country, would infringe one or more identifiable patents in that
  511 +country that you have reason to believe are valid.
  512 +
  513 + If, pursuant to or in connection with a single transaction or
  514 +arrangement, you convey, or propagate by procuring conveyance of, a
  515 +covered work, and grant a patent license to some of the parties
  516 +receiving the covered work authorizing them to use, propagate, modify
  517 +or convey a specific copy of the covered work, then the patent license
  518 +you grant is automatically extended to all recipients of the covered
  519 +work and works based on it.
  520 +
  521 + A patent license is "discriminatory" if it does not include within
  522 +the scope of its coverage, prohibits the exercise of, or is
  523 +conditioned on the non-exercise of one or more of the rights that are
  524 +specifically granted under this License. You may not convey a covered
  525 +work if you are a party to an arrangement with a third party that is
  526 +in the business of distributing software, under which you make payment
  527 +to the third party based on the extent of your activity of conveying
  528 +the work, and under which the third party grants, to any of the
  529 +parties who would receive the covered work from you, a discriminatory
  530 +patent license (a) in connection with copies of the covered work
  531 +conveyed by you (or copies made from those copies), or (b) primarily
  532 +for and in connection with specific products or compilations that
  533 +contain the covered work, unless you entered into that arrangement,
  534 +or that patent license was granted, prior to 28 March 2007.
  535 +
  536 + Nothing in this License shall be construed as excluding or limiting
  537 +any implied license or other defenses to infringement that may
  538 +otherwise be available to you under applicable patent law.
  539 +
  540 + 12. No Surrender of Others' Freedom.
  541 +
  542 + If conditions are imposed on you (whether by court order, agreement or
  543 +otherwise) that contradict the conditions of this License, they do not
  544 +excuse you from the conditions of this License. If you cannot convey a
  545 +covered work so as to satisfy simultaneously your obligations under this
  546 +License and any other pertinent obligations, then as a consequence you may
  547 +not convey it at all. For example, if you agree to terms that obligate you
  548 +to collect a royalty for further conveying from those to whom you convey
  549 +the Program, the only way you could satisfy both those terms and this
  550 +License would be to refrain entirely from conveying the Program.
  551 +
  552 + 13. Use with the GNU Affero General Public License.
  553 +
  554 + Notwithstanding any other provision of this License, you have
  555 +permission to link or combine any covered work with a work licensed
  556 +under version 3 of the GNU Affero General Public License into a single
  557 +combined work, and to convey the resulting work. The terms of this
  558 +License will continue to apply to the part which is the covered work,
  559 +but the special requirements of the GNU Affero General Public License,
  560 +section 13, concerning interaction through a network will apply to the
  561 +combination as such.
  562 +
  563 + 14. Revised Versions of this License.
  564 +
  565 + The Free Software Foundation may publish revised and/or new versions of
  566 +the GNU General Public License from time to time. Such new versions will
  567 +be similar in spirit to the present version, but may differ in detail to
  568 +address new problems or concerns.
  569 +
  570 + Each version is given a distinguishing version number. If the
  571 +Program specifies that a certain numbered version of the GNU General
  572 +Public License "or any later version" applies to it, you have the
  573 +option of following the terms and conditions either of that numbered
  574 +version or of any later version published by the Free Software
  575 +Foundation. If the Program does not specify a version number of the
  576 +GNU General Public License, you may choose any version ever published
  577 +by the Free Software Foundation.
  578 +
  579 + If the Program specifies that a proxy can decide which future
  580 +versions of the GNU General Public License can be used, that proxy's
  581 +public statement of acceptance of a version permanently authorizes you
  582 +to choose that version for the Program.
  583 +
  584 + Later license versions may give you additional or different
  585 +permissions. However, no additional obligations are imposed on any
  586 +author or copyright holder as a result of your choosing to follow a
  587 +later version.
  588 +
  589 + 15. Disclaimer of Warranty.
  590 +
  591 + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
  592 +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
  593 +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
  594 +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
  595 +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  596 +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
  597 +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
  598 +ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
  599 +
  600 + 16. Limitation of Liability.
  601 +
  602 + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
  603 +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
  604 +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
  605 +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
  606 +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
  607 +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
  608 +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
  609 +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
  610 +SUCH DAMAGES.
  611 +
  612 + 17. Interpretation of Sections 15 and 16.
  613 +
  614 + If the disclaimer of warranty and limitation of liability provided
  615 +above cannot be given local legal effect according to their terms,
  616 +reviewing courts shall apply local law that most closely approximates
  617 +an absolute waiver of all civil liability in connection with the
  618 +Program, unless a warranty or assumption of liability accompanies a
  619 +copy of the Program in return for a fee.
  620 +
  621 + END OF TERMS AND CONDITIONS
  622 +
  623 + How to Apply These Terms to Your New Programs
  624 +
  625 + If you develop a new program, and you want it to be of the greatest
  626 +possible use to the public, the best way to achieve this is to make it
  627 +free software which everyone can redistribute and change under these terms.
  628 +
  629 + To do so, attach the following notices to the program. It is safest
  630 +to attach them to the start of each source file to most effectively
  631 +state the exclusion of warranty; and each file should have at least
  632 +the "copyright" line and a pointer to where the full notice is found.
  633 +
  634 + {one line to give the program's name and a brief idea of what it does.}
  635 + Copyright (C) {year} {name of author}
  636 +
  637 + This program is free software: you can redistribute it and/or modify
  638 + it under the terms of the GNU General Public License as published by
  639 + the Free Software Foundation, either version 3 of the License, or
  640 + (at your option) any later version.
  641 +
  642 + This program is distributed in the hope that it will be useful,
  643 + but WITHOUT ANY WARRANTY; without even the implied warranty of
  644 + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  645 + GNU General Public License for more details.
  646 +
  647 + You should have received a copy of the GNU General Public License
  648 + along with this program. If not, see <http://www.gnu.org/licenses/>.
  649 +
  650 +Also add information on how to contact you by electronic and paper mail.
  651 +
  652 + If the program does terminal interaction, make it output a short
  653 +notice like this when it starts in an interactive mode:
  654 +
  655 + {project} Copyright (C) {year} {fullname}
  656 + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
  657 + This is free software, and you are welcome to redistribute it
  658 + under certain conditions; type `show c' for details.
  659 +
  660 +The hypothetical commands `show w' and `show c' should show the appropriate
  661 +parts of the General Public License. Of course, your program's commands
  662 +might be different; for a GUI interface, you would use an "about box".
  663 +
  664 + You should also get your employer (if you work as a programmer) or school,
  665 +if any, to sign a "copyright disclaimer" for the program, if necessary.
  666 +For more information on this, and how to apply and follow the GNU GPL, see
  667 +<http://www.gnu.org/licenses/>.
  668 +
  669 + The GNU General Public License does not permit incorporating your program
  670 +into proprietary programs. If your program is a subroutine library, you
  671 +may consider it more useful to permit linking proprietary applications with
  672 +the library. If this is what you want to do, use the GNU Lesser General
  673 +Public License instead of this License. But first, please read
  674 +<http://www.gnu.org/philosophy/why-not-lgpl.html>.
bower_components/JSDataChecker/README.md 0 → 100644
  View file @2b9ef0b
  1 +# JSDataChecker
  2 +JavaScript Library to read dataset content (e.g., Open Data), infer data types, give a data quality indicator and parse content.
  3 +
  4 +In details, it analysis the json (specified paths) to infer the data type. In addition, when request (via code) the library converts the json data based on the inferred type.
  5 +
  6 +## Documentation
  7 +
  8 +See wiki pages [here](https://github.com/donpir/JSDataChecker/wiki).
  9 +
  10 +## License
  11 +
  12 +The library has released with the LGPL license [link here](http://www.gnu.org/licenses/lgpl.html).
  13 +
  14 +Briefly with this license:
  15 +
  16 + - Freedom to modify and distribute modified copies of POLYWC-DATA-TABLE, distributing the source code and releasing it with the same LGPL license;
  17 + - You can dynamically (not statically) link POLYWC-DATA-TABLE library in a proprietary software, keeping the JS files as they are.
  18 +
  19 +
  20 +
bower_components/JSDataChecker/bower.json 0 → 100644
  View file @2b9ef0b
  1 +{
  2 + "name": "JSDataChecker",
  3 + "version": "v0.0.7",
  4 + "homepage": "https://github.com/donpir/JSDataChecker",
  5 + "authors": [
  6 + "'Donato Pirozzi <'donatopirozzi@gmail.com'>"
  7 + ],
  8 + "description": "Javascript library to read dataset content (e.g., Open Data), infer data types, give a data quality indicator and parse content",
  9 + "main": "JSDataChecker/jsdatachecker.min.js",
  10 + "license": "GPL",
  11 + "ignore": [
  12 + "**/.*",
  13 + "node_modules",
  14 + "bower_components",
  15 + "tests"
  16 + ],
  17 + "devDependencies": {
  18 + "paper-progress": "PolymerElements/paper-progress#~1.0.8",
  19 + "polymer": "Polymer/polymer#1.2.0",
  20 + "qunit": "~1.22.0",
  21 + "csvjson": "0.1.1",
  22 + "polywc": "https://github.com/donpir/polywc.git#master"
  23 + },
  24 + "private": false
  25 +}
bower_components/JSDataChecker/build.cmd 0 → 100644
  View file @2b9ef0b
  1 +del jsdatachecker.min.js
  2 +uglifyjs src\ArrayUtils.js src\DataTypeConverter.js src\DataTypesUtils.js --compress -o jsdatachecker.min.js
0 \ No newline at end of file 3 \ No newline at end of file
bower_components/JSDataChecker/jsdatachecker.min.js 0 → 100644
  View file @2b9ef0b
  1 +function ArrayUtils(){}function DataTypeConverter(){this._fields=[],this._numOfRows=0}function DataTypesUtils(){}ArrayUtils.TestAndSet=function(arr,key,object){return"undefined"==typeof arr?null:0==Array.isArray(arr)?null:("undefined"==typeof arr[key]&&(arr[key]=object),arr[key])},ArrayUtils.TestAndInitializeKey=function(obj,key,value){return"undefined"==typeof obj?null:("undefined"==typeof obj[key]&&(obj[key]=value),obj[key])},ArrayUtils.TestAndIncrement=function(arr,key){var exists=arr[key];return"undefined"==typeof exists&&(arr[key]=0),arr[key]++,arr},ArrayUtils.toFieldsArray=function(obj){var fields=[];return ArrayUtils.IteratorOverKeys(obj,function(field,key){field.key=key,fields.push(field)}),fields},ArrayUtils.IteratorOverKeys=function(arr,callback){for(var property in arr)if(arr.hasOwnProperty(property)){var item=arr[property];callback(item,property)}},ArrayUtils.FindMinMax=function(arr,fncompare){var max1=null,max2=null;for(var key in arr)null==max1||fncompare(arr[key],max1.value)?(max2=max1,max1={index:-1,key:key,value:arr[key]}):(null==max2||fncompare(arr[key],max2.value))&&(max2={index:-1,key:key,value:arr[key]});return{first:max1,second:max2}},ArrayUtils.isArray=function(arr){return Array.isArray(arr)?arr.length>0:!1},DataTypeConverter.TYPES={TEXT:{value:0,name:"TEXT"},CODE:{value:1,name:"CODE"},NUMBER:{value:2,name:"NUMBER"},OBJECT:{value:3,name:"OBJECT"},BOOL:{value:5,name:"BOOL"},CONST:{value:6,name:"CONST"},CATEGORY:{value:7,name:"CATEGORY"},DATETIME:{value:8,name:"DATETIME"},EMPTY:{value:101,name:"NULL"}},DataTypeConverter.SUBTYPES={PERCENTAGE:{value:1e3,name:"PERCENTAGE"},LATITUDE:{value:1001,name:"LATITUDE"},LONGITUDE:{value:1002,name:"LONGITUDE"}},DataTypeConverter.prototype=function(){var _analyseDataTypes=function(fields){ArrayUtils.IteratorOverKeys(fields,function(field){if(field._inferredTypes[DataTypeConverter.TYPES.CODE.name]){var confidence=field._inferredTypes[DataTypeConverter.TYPES.CODE.name]/field.numOfItems,_numericalInferredType=field._inferredTypes[DataTypeConverter.TYPES.NUMBER.name];return"undefined"!=typeof _numericalInferredType&&(confidence+=_numericalInferredType/field.numOfItems),field.type=DataTypeConverter.TYPES.CODE.name,void(field.typeConfidence=confidence)}var max=ArrayUtils.FindMinMax(field._inferredTypes,function(curval,lastval){return curval>lastval}),tkey=max.first.key;tkey===DataTypeConverter.TYPES.EMPTY.name&&null!=max.second&&"undefined"!=typeof max.second&&(tkey=max.second.key),field.type=tkey,field.typeConfidence=field._inferredTypes[max.first.key]/field.numOfItems})},_processInferType=function(value){if(null===value||"undefined"==typeof value)return DataTypeConverter.TYPES.EMPTY;if("object"==typeof value)return DataTypeConverter.TYPES.OBJECT;if(/^0[0-9]+$/.test(value))return DataTypeConverter.TYPES.CODE;var isnumber=DataTypesUtils.FilterFloat(value);if(isNaN(isnumber)!==!0)return DataTypeConverter.TYPES.NUMBER;var _date=DataTypesUtils.FilterDateTime(value);return 0==isNaN(_date)&&null!=_date?DataTypeConverter.TYPES.DATETIME:DataTypeConverter.TYPES.TEXT},jsonTraverse=function(json,fieldKeys,callback){var stack=[],numOfRows=0;for(stack.push({item:json,fieldKeyIndex:0});stack.length>0;){var stackTask=stack.pop(),item=stackTask.item,fieldKeyIndex=stackTask.fieldKeyIndex,fieldKey=fieldKeys[fieldKeyIndex];if("*"!=fieldKey||0!=ArrayUtils.isArray(item))if("*"!=fieldKey||1!=ArrayUtils.isArray(item)){var jsonSubtree=item[fieldKey];if(Array.isArray(jsonSubtree))for(var j=0;j<jsonSubtree.length;j++){var jsonItem=jsonSubtree[j];stack.push({item:jsonItem,fieldKeyIndex:fieldKeyIndex+1})}else stack.push({item:jsonSubtree,fieldKeyIndex:fieldKeyIndex+1})}else for(var cell,j=0;j<item.length&&(cell=item[j]);j++)stack.push({item:cell,fieldKeyIndex:fieldKeyIndex}),numOfRows++;else{var sProcessedKeys=fieldKeys.slice(0,fieldKeyIndex).toString();ArrayUtils.IteratorOverKeys(item,function(value,key){var curKey=sProcessedKeys+(sProcessedKeys.length>0?",":"")+key,_value=callback(value,key,curKey,numOfRows);item[key]=_value}),numOfRows++}}};return{constructor:DataTypeConverter,cast:function(metadata,options){return"undefined"!=typeof options&&null!=options||(options={castThresholdConfidence:1,castIfNull:!1}),this.convert(metadata,options)},convert:function(metadata,options){var lastRowIndex=0,numOfRows=0,numOfValues=0,datasetErrors=0,datasetMissingValues=0;return"undefined"!=typeof options&&null!=options||(options={castThresholdConfidence:1,castIfNull:!1}),jsonTraverse(metadata.dataset,metadata.fieldKeys,function(value,key,traversedKeys,rowIndex){var inferredType=metadata.types[traversedKeys];numOfValues++,lastRowIndex!=rowIndex&&(lastRowIndex=rowIndex,numOfRows++),null==value||"undefined"==typeof value||0==(value+"").length;var isCast=inferredType.typeConfidence>=options.castThresholdConfidence;if(inferredType.type==DataTypeConverter.TYPES.NUMBER.name&&isCast){var number=parseFloat(value);return isNaN(number)?(datasetErrors++,value):number}return value}),metadata.qualityIndex.notNullValues=(numOfValues-datasetMissingValues)/numOfValues,metadata.qualityIndex.errors=(numOfValues-datasetErrors)/numOfValues,metadata},inferJsonDataType:function(json,fieldKeys){var stack=[],fieldsType={},numOfRows=0;if("undefined"==typeof fieldKeys)throw"IllegalArgumentException: undefined json path to analyse.";for(stack.push({item:json,fieldKeyIndex:0});stack.length>0;){var stackTask=stack.pop(),item=stackTask.item,fieldKeyIndex=stackTask.fieldKeyIndex,fieldKey=fieldKeys[fieldKeyIndex];if("*"!=fieldKey||0!=ArrayUtils.isArray(item))if("*"==fieldKey&&ArrayUtils.isArray(item))for(var cell,j=0;j<item.length&&(cell=item[j]);j++)stack.push({item:cell,fieldKeyIndex:fieldKeyIndex}),numOfRows++;else{var jsonSubtree=item[fieldKey];if(Array.isArray(jsonSubtree))for(var j=0;j<jsonSubtree.length;j++){var jsonItem=jsonSubtree[j];stack.push({item:jsonItem,fieldKeyIndex:fieldKeyIndex+1})}else stack.push({item:jsonSubtree,fieldKeyIndex:fieldKeyIndex+1})}else{var sProcessedKeys=fieldKeys.slice(0,fieldKeyIndex).toString();ArrayUtils.IteratorOverKeys(item,function(item,key){var inferredType=_processInferType(item),curKey=sProcessedKeys+(0==sProcessedKeys.length?"":",")+key,fieldType=ArrayUtils.TestAndInitializeKey(fieldsType,curKey,{name:curKey,_inferredTypes:[],_inferredValues:[],numOfItems:0});fieldType.numOfItems++,ArrayUtils.TestAndIncrement(fieldType._inferredTypes,inferredType.name),inferredType===DataTypeConverter.TYPES.TEXT&&ArrayUtils.TestAndIncrement(fieldType._inferredValues,item)}),numOfRows++}}_analyseDataTypes(fieldsType);var quality={homogeneity:1,completeness:1,totalNullValues:0,totalValues:0};ArrayUtils.IteratorOverKeys(fieldsType,function(fieldType){quality.totalValues+=fieldType.numOfItems,quality.homogeneity*=fieldType.typeConfidence,fieldType.totalNullValues=0,fieldType._inferredTypes.hasOwnProperty(DataTypeConverter.TYPES.EMPTY.name)&&(fieldType.totalNullValues=fieldType._inferredTypes[DataTypeConverter.TYPES.EMPTY.name],quality.totalNullValues+=fieldType.totalNullValues)}),quality.homogeneity=Math.round(100*quality.homogeneity)/100;var totFullValues=quality.totalValues-quality.totalNullValues;quality.completeness=Math.round(totFullValues/quality.totalValues*100)/100;var warningsTextual="";return ArrayUtils.IteratorOverKeys(fieldsType,function(fieldType){fieldType.errorsDescription="";var description="";if(fieldType.typeConfidence<1){var incorrect=fieldType.numOfItems-fieldType.totalNullValues-fieldType._inferredTypes[fieldType.type];if(incorrect>0){description+="The column <"+fieldType.name+"> has the type <"+fieldType.type+">";var verb=1==incorrect?" value is":" values are";description+=", but "+incorrect+verb+" not a "+fieldType.type}}fieldType.totalNullValues>0&&(description+="The column <"+fieldType.name+"> has "+fieldType.totalNullValues+" EMPTY value",fieldType.totalNullValues>1&&(description+="s")),description.length>0&&(description+="."),fieldType.errorsDescription=description,warningsTextual+=description}),{dataset:json,fieldKeys:fieldKeys,types:fieldsType,qualityIndex:quality,warningsTextual:warningsTextual}},inferDataTypeOfValue:function(value){return _processInferType(value)}}}(),DataTypesUtils.FilterTime=function(value){var expTime=/^[0-9]{2}:[0-9]{2}(:[0-9]{2})?(\+[0-9]{2}:[0-9]{2})?$/;if(0==expTime.test(value))return null;var splitted=value.split(/[:|\+]/),expNumber=/^[0-9]{2}$/,HH=expNumber.test(splitted[0])?parseInt(splitted[0]):0,MM=expNumber.test(splitted[1])?parseInt(splitted[1]):0,SS=splitted.length>=3&&expNumber.test(splitted[2])?parseInt(splitted[2]):0,dt=new Date;return dt.setHours(HH),dt.setMinutes(MM),dt.setSeconds(SS),dt},DataTypesUtils.FilterDateTime=function(value){var _dtSplitted=value.split(/[T|\s]/);if(2==_dtSplitted.length){var dtTime=DataTypesUtils.FilterTime(_dtSplitted[1]);if(null==dtTime)return null;var dtDateTime=DataTypesUtils.FilterDate(_dtSplitted[0],dtTime);return dtDateTime}var dtDate=DataTypesUtils.FilterDate(value);if(null!=dtDate)return dtDate;var dtTime=DataTypesUtils.FilterTime(value);return dtTime},DataTypesUtils.FilterDate=function(value,dtDate){if(null==dtDate&&(dtDate=new Date),/^[0-9][0-9][0-9][0-9]\-[0-9][0-9]$/.test(value)){var year=parseInt(value.substring(0,4)),month=parseInt(value.substring(5));return dtDate.setYear(year),dtDate.setMonth(month),dtDate}var expDate=/^[0-9]{4}(\-|\/)[0-9]{2}((\-|\/)[0-9]{2})?$/;if(expDate.test(value)){var splitted=value.split(/[\-|\/]/),year=parseInt(splitted[0]),month=parseInt(splitted[1]),day=3==splitted.length?parseInt(splitted[2]):0;return dtDate.setYear(year),dtDate.setMonth(month),dtDate.setDate(day),dtDate}if(expDate=/^[0-9]{2}(\-|\/)[0-9]{2}(\-|\/)[0-9]{4}$/,expDate.test(value)){var splitted=value.split(/[\-|\/]/),year=parseInt(splitted[2]),month=parseInt(splitted[1]),day=parseInt(splitted[0]);return dtDate.setYear(year),dtDate.setMonth(month),dtDate.setDate(day),dtDate}return null},DataTypesUtils.FilterFloat=function(value){return/^(\-|\+)?((0|([1-9][0-9]*))(\.[0-9]+)?|Infinity)$/.test(value)?Number(value):NaN},DataTypesUtils.DecimalPlaces=function(num){var match=(""+num).match(/(?:\.(\d+))?(?:[eE]([+-]?\d+))?$/);return match?Math.max(0,(match[1]?match[1].length:0)-(match[2]?+match[2]:0)):0};
0 \ No newline at end of file 2 \ No newline at end of file
bower_components/JSDataChecker/src/ArrayUtils.js 0 → 100644
  View file @2b9ef0b
  1 +/*
  2 + ** This file is part of JSDataChecker.
  3 + **
  4 + ** JSDataChecker is free software: you can redistribute it and/or modify
  5 + ** it under the terms of the GNU General Public License as published by
  6 + ** the Free Software Foundation, either version 3 of the License, or
  7 + ** (at your option) any later version.
  8 + **
  9 + ** JSDataChecker is distributed in the hope that it will be useful,
  10 + ** but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 + ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12 + ** GNU General Public License for more details.
  13 + **
  14 + ** You should have received a copy of the GNU General Public License
  15 + ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
  16 + **
  17 + ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
  18 + ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
  19 + ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
  20 + **/
  21 +
  22 +function ArrayUtils() {}
  23 +
  24 +/**
  25 + * It tests if the array has an element with the specified key,
  26 + * if does not have the key it initialises it with the object.
  27 + * @param arr
  28 + * @param key
  29 + * @param object
  30 + * @returns {*}
  31 + * @constructor
  32 + */
  33 +ArrayUtils.TestAndSet = function (arr, key, object) {
  34 + if (typeof arr == 'undefined') return null;
  35 + if (Array.isArray(arr) == false) return null;
  36 + if (typeof arr[key] == 'undefined')
  37 + arr[key] = object;
  38 + return arr[key];
  39 +};//EndFunction.
  40 +
  41 +ArrayUtils.TestAndInitializeKey = function (obj, key, value) {
  42 + if (typeof obj == 'undefined') return null;
  43 + if (typeof obj[key] == 'undefined')
  44 + obj[key] = value;
  45 +
  46 + return obj[key];
  47 +};//EndFunction.
  48 +
  49 +/***
  50 + * It tests whether the array has the key, if not it insert it;
  51 + * then increases the value by one unit.
  52 + * @param arr
  53 + * @param key
  54 + * @returns {The array}
  55 + */
  56 +ArrayUtils.TestAndIncrement = function (arr, key) {
  57 + var exists = arr[key];
  58 + if (typeof exists === 'undefined') arr[key] = 0;
  59 + arr[key]++;
  60 + return arr;
  61 +};//EndFunction.
  62 +
  63 +/***
  64 + * It converts the object to an array. It loops through the object
  65 + * keys/properties, retrieves the objects and pushes it in the array.
  66 + * @param obj
  67 + * @returns {Array}
  68 + */
  69 +ArrayUtils.toFieldsArray = function (obj) {
  70 + var fields = [];
  71 +
  72 + ArrayUtils.IteratorOverKeys(obj, function(field, key) {
  73 + field.key = key;
  74 + fields.push(field);
  75 + });
  76 +
  77 + return fields;
  78 +};//EndFunction.
  79 +
  80 +/**
  81 + * Iterate over the key within the array arr. For each array
  82 + * value it calls the callback function.
  83 + * @param arr
  84 + * @param callback
  85 + * @constructor
  86 + */
  87 +ArrayUtils.IteratorOverKeys = function (arr, callback) {
  88 + for (var property in arr) {
  89 + if (arr.hasOwnProperty(property)) {
  90 + var item = arr[property];
  91 + callback(item, property);
  92 + }
  93 + }
  94 +};//EndFunction.
  95 +
  96 +/**
  97 + * Find the item with the max value within the array.
  98 + * @param arr
  99 + * @returns {*} It is an object with index, key, value.
  100 + */
  101 +ArrayUtils.FindMinMax = function (arr, fncompare) {
  102 + var max1 = null;
  103 + var max2 = null;
  104 +
  105 + for (var key in arr) {
  106 + //if (max1 == null) //Only the first time.
  107 + // max1 = {index: -1, key: key, value: arr[key]};
  108 +
  109 + if (max1 == null || fncompare(arr[key], max1.value)) {
  110 + max2 = max1;
  111 + max1 = {index: -1, key: key, value: arr[key]};
  112 + } else if (max2 == null || fncompare(arr[key], max2.value))
  113 + max2 = {index: -1, key: key, value: arr[key]};
  114 +
  115 + }//EndFor.
  116 +
  117 + return { first: max1, second: max2 };
  118 +}//EndFunction.
  119 +
  120 +ArrayUtils.isArray = function (arr) {
  121 + if (Array.isArray(arr))
  122 + return (arr.length > 0);
  123 + return false;
  124 +}//EndFunction.
  125 +
bower_components/JSDataChecker/src/DataTypeConverter.js 0 → 100644
  View file @2b9ef0b
  1 +/*
  2 + ** This file is part of JSDataChecker.
  3 + **
  4 + ** JSDataChecker is free software: you can redistribute it and/or modify
  5 + ** it under the terms of the GNU General Public License as published by
  6 + ** the Free Software Foundation, either version 3 of the License, or
  7 + ** (at your option) any later version.
  8 + **
  9 + ** JSDataChecker is distributed in the hope that it will be useful,
  10 + ** but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 + ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12 + ** GNU General Public License for more details.
  13 + **
  14 + ** You should have received a copy of the GNU General Public License
  15 + ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
  16 + **
  17 + ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
  18 + ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
  19 + ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
  20 + **/
  21 +
  22 +function DataTypeConverter() {
  23 + this._fields = [];
  24 + this._numOfRows = 0;
  25 +};//EndConstructor.
  26 +
  27 +DataTypeConverter.TYPES = {
  28 + TEXT : { value: 0, name: "TEXT" },
  29 + CODE : { value: 1, name: "CODE"},
  30 +
  31 + NUMBER : { value: 2, name: "NUMBER" },
  32 + OBJECT : { value: 3, name: "OBJECT" },
  33 +
  34 +
  35 + BOOL : { value: 5, name: "BOOL"},
  36 + CONST : { value: 6, name: "CONST" },
  37 + CATEGORY : { value: 7, name: "CATEGORY" },
  38 +
  39 + DATETIME : { value: 8, name: "DATETIME" },
  40 +
  41 +
  42 +
  43 + EMPTY : { value: 101, name: "NULL" }
  44 +};
  45 +
  46 +DataTypeConverter.SUBTYPES = {
  47 + PERCENTAGE : { value: 1000, name: "PERCENTAGE" },
  48 + LATITUDE : { value: 1001, name: "LATITUDE" },
  49 + LONGITUDE : { value: 1002, name: "LONGITUDE" }
  50 +};
  51 +
  52 +DataTypeConverter.prototype = (function () {
  53 +
  54 + /***
  55 + * Make an asynchronous call to load the content.
  56 + * @param theUrl
  57 + * @param callback
  58 + * @deprecated
  59 + */
  60 + var httpGetAsync = function(theUrl, callbackOnFinish) {
  61 + console.warn("Calling deprecated function.");
  62 + var xhttp = new XMLHttpRequest();
  63 + xhttp.onreadystatechange = function() {
  64 + if (xhttp.readyState == 4 && xhttp.status == 200)
  65 + _processDataset(xhttp.responseText, callbackOnFinish);
  66 + }
  67 + xhttp.open("GET", theUrl, true); // true for asynchronous
  68 + xhttp.send(null);
  69 + };//EndFunction.
  70 +
  71 + /*var _processDataset = function (jsonRows) {
  72 + //Check if the jsonRow is an array.
  73 + if (Array.isArray(jsonRows) == false) return;
  74 +
  75 + for (var i=0; i<jsonRows.length; i++) {
  76 + var jsonRow = jsonRows[i];
  77 + _processRow(jsonRow);
  78 + }//EndFor.
  79 +
  80 + _analyseDataTypes(this._fields);
  81 +
  82 + return this._fields;
  83 + };//EndFunction.*/
  84 +
  85 + /*var _processRow = function(row) {
  86 + //Avoid empty rows
  87 + if (typeof row === 'undefined') return;
  88 +
  89 + //Get the object keys.
  90 + for (var property in row) {
  91 + if (row.hasOwnProperty(property)) {
  92 + var cellValue = row[property];
  93 +
  94 + //if (property == 'votantspourcentages') debugger;
  95 + //if (property == 'va_no_voie') debugger;
  96 +
  97 + var inferredType = _processInferType(cellValue);
  98 +
  99 + if (typeof this._fields[property] === 'undefined')
  100 + this._fields[property] = { name: property, _inferredTypes: [], _inferredValues: [] };
  101 +
  102 + _arrUtil.testAndIncrement(this._fields[property]._inferredTypes, inferredType.name);
  103 + if (inferredType === DataTypeConverter.TYPES.TEXT)
  104 + _arrUtil.testAndIncrement(this._fields[property]._inferredValues, cellValue);
  105 + if (inferredType === DataTypeConverter.TYPES.LATITUDE || inferredType === DataTypeConverter.TYPES.LONGITUDE)
  106 + _arrUtil.testAndIncrement(this._fields[property]._inferredTypes, DataTypeConverter.TYPES.NUMBER);
  107 + }
  108 + }
  109 +
  110 + this._numOfRows++;
  111 + };//EndFunction.*/
  112 +
  113 + var _analyseDataTypes = function(fields) {
  114 + ArrayUtils.IteratorOverKeys(fields, function(field) {
  115 + if (field._inferredTypes[DataTypeConverter.TYPES.CODE.name]) {
  116 + var confidence = field._inferredTypes[DataTypeConverter.TYPES.CODE.name] / field.numOfItems;
  117 + var _numericalInferredType = field._inferredTypes[DataTypeConverter.TYPES.NUMBER.name];
  118 + if (typeof _numericalInferredType != 'undefined') confidence += _numericalInferredType / field.numOfItems;
  119 +
  120 + field.type = DataTypeConverter.TYPES.CODE.name;
  121 + field.typeConfidence = confidence;
  122 + return;
  123 + }
  124 +
  125 +
  126 + //Infers the field TYPE.
  127 + var max = ArrayUtils.FindMinMax(field._inferredTypes, function (curval, lastval) {
  128 + return curval > lastval;
  129 + });
  130 +
  131 + //When the first key is null, it uses the second one.
  132 + var tkey = max.first.key;
  133 + if (tkey === DataTypeConverter.TYPES.EMPTY.name &&
  134 + max.second != null && typeof max.second !== 'undefined')
  135 + tkey = max.second.key;
  136 +
  137 + field.type = tkey;
  138 + field.typeConfidence = field._inferredTypes[max.first.key] / field.numOfItems;
  139 +
  140 +
  141 + /*//TODO: improve this piece of code.
  142 + //LAT/LNG.
  143 + var fieldName = field.name.toLowerCase();
  144 + var isLatType = (field.type === DataTypeConverter.TYPES.LATITUDE.name);
  145 + var fieldNameContainsLat = fieldName.indexOf('lat') >= 0;
  146 + var fieldNameContainsLon = fieldName.indexOf('ng') >= 0; //It could be 'lng'.
  147 + if (isLatType == true && fieldNameContainsLat == false && fieldNameContainsLon == true) {
  148 + field.type = DataTypeConverter.TYPES.LONGITUDE.name;
  149 + }*/
  150 +
  151 + //BOOLEAN.
  152 + /*var numOfValues = Object.keys(field._inferredValues).length;
  153 + if (field.type === DataTypeConverter.TYPES.TEXT.name) {
  154 + //if (numOfValues == 1) field.type = DataTypeConverter.TYPES.CONST.name;
  155 + //else if (numOfValues == 2) field.type = DataTypeConverter.TYPES.BOOL.name;
  156 + //else
  157 + if (numOfValues < field.numOfItems * 0.20) field.type = DataTypeConverter.TYPES.CATEGORY.name;
  158 + }*/
  159 + });
  160 + };//EndFunction.
  161 +
  162 + /**
  163 + * Given a dataset value, it tries to recognise the data types.
  164 + * This is the central function within the library.
  165 + * @param value
  166 + * @returns {*}
  167 + * @private
  168 + */
  169 + var _processInferType = function(value) {
  170 + //value = value.toLocaleString();
  171 +
  172 + if (value === null || typeof value === 'undefined')
  173 + return DataTypeConverter.TYPES.EMPTY;
  174 +
  175 + if (typeof value === 'object')
  176 + return DataTypeConverter.TYPES.OBJECT;
  177 +
  178 + //If the value starts with a zero and contains all numbers, it is
  179 + //inferred as textual content.
  180 + if (/^0[0-9]+$/.test(value))
  181 + return DataTypeConverter.TYPES.CODE;
  182 +
  183 + //Try to parse the float.
  184 + var isnumber = DataTypesUtils.FilterFloat(value);
  185 + if (isNaN(isnumber) !== true) {//It is a number.
  186 + //If the number ranges from -90.0 to 90.0, the value is marked as Latitude.
  187 + //if (-90.0 <= isnumber && isnumber <= 90.0 && _dataTypesUtils.decimalPlaces(isnumber) >= 5)
  188 + // return DataTypeConverter.TYPES.LATITUDE;
  189 +
  190 + //It the number ranges from -180.0 to 180.0, the value is marked as Longitude.
  191 + //if (-180.0 <= isnumber && isnumber <= 180.0 && _dataTypesUtils.decimalPlaces(isnumber) >= 5)
  192 + // return DataTypeConverter.TYPES.LONGITUDE;
  193 +
  194 + /*if (0.0 <= isnumber && isnumber <= 100.0)
  195 + if(/^(\+)?((0|([1-9][0-9]*))\.([0-9]+))$/ .test(value))
  196 + return DataTypeConverter.TYPES.PERCENTAGE;*/
  197 +
  198 + return DataTypeConverter.TYPES.NUMBER;
  199 + }
  200 +
  201 + var _date = DataTypesUtils.FilterDateTime(value);
  202 + if (isNaN(_date) == false && _date != null)
  203 + return DataTypeConverter.TYPES.DATETIME;
  204 +
  205 +
  206 + return DataTypeConverter.TYPES.TEXT;
  207 + };//EndFunction.
  208 +
  209 + var _processInferSubType = function(value) {
  210 + //Try to parse lat/lng.
  211 +
  212 + };//EndFunction.
  213 +
  214 + var jsonTraverse = function(json, fieldKeys, callback) {
  215 + var stack = [];
  216 + var numOfRows = 0;
  217 + stack.push({ item: json, fieldKeyIndex: 0 });
  218 +
  219 + while (stack.length > 0) {
  220 + var stackTask = stack.pop();
  221 + var item = stackTask.item;
  222 + var fieldKeyIndex = stackTask.fieldKeyIndex;
  223 + var fieldKey = fieldKeys[fieldKeyIndex];
  224 +
  225 + //Test fieldKey Value.
  226 + if (fieldKey == '*' && ArrayUtils.isArray(item) == false) {
  227 + var sProcessedKeys = fieldKeys.slice(0, fieldKeyIndex).toString();
  228 +
  229 + ArrayUtils.IteratorOverKeys(item, function (value, key) {
  230 + var curKey = sProcessedKeys + (sProcessedKeys.length > 0 ? "," : "") + key;
  231 + var _value = callback(value, key, curKey, numOfRows);
  232 + item[key] = _value;
  233 + });
  234 +
  235 + numOfRows++;
  236 + continue;
  237 + }
  238 +
  239 + //It is an array, loops through its cells and pushes items within the stack.
  240 + if (fieldKey == '*' && ArrayUtils.isArray(item) == true) {
  241 + for (var j= 0, cell; j<item.length && (cell = item[j]); j++) {
  242 + stack.push({item: cell, fieldKeyIndex: fieldKeyIndex});
  243 + numOfRows++;
  244 + }
  245 + continue;
  246 + }
  247 +
  248 + var jsonSubtree = item[fieldKey];
  249 + if (Array.isArray(jsonSubtree)) { //It is an array.
  250 + for (var j=0; j<jsonSubtree.length; j++) {
  251 + var jsonItem = jsonSubtree[j];
  252 + stack.push({ item: jsonItem, fieldKeyIndex: fieldKeyIndex+1 });
  253 + }//EndForJ.
  254 + } else {
  255 + stack.push({ item: jsonSubtree, fieldKeyIndex: fieldKeyIndex+1 });
  256 + }
  257 + }//EndWhile.
  258 + };//EndFunction.
  259 +
  260 + return {
  261 + constructor: DataTypeConverter,
  262 +
  263 + /**
  264 + * It parses the json in input and converts the content
  265 + * in according to the inferred data types.
  266 + * @param json
  267 + * @param path Format: field1->field2->field3
  268 + */
  269 + cast: function(metadata, options) {
  270 + if (typeof options === 'undefined' || options == null)
  271 + options = { castThresholdConfidence: 1, castIfNull: false };
  272 + return this.convert(metadata, options);
  273 + },
  274 +
  275 + /**
  276 + * It parses the json in input and converts the content
  277 + * in according to the inferred data types.
  278 + * @param json
  279 + * @param path Format: field1->field2->field3
  280 + * @deprecated
  281 + */
  282 + convert: function (metadata, options) {
  283 + var lastRowIndex = 0;
  284 + var isRowInvalid = false;
  285 + var numOfRowsInvalid = 0;
  286 +
  287 + var numOfRows = 0;
  288 + var numOfValues = 0;
  289 +
  290 + var datasetErrors = 0;
  291 + var datasetMissingValues = 0;
  292 +
  293 + if (typeof options === 'undefined' || options == null)
  294 + options = { castThresholdConfidence: 1, castIfNull: false };
  295 +
  296 + jsonTraverse(metadata.dataset, metadata.fieldKeys, function(value, key, traversedKeys, rowIndex) {
  297 + var inferredType = metadata.types[traversedKeys];
  298 + numOfValues++;
  299 +
  300 + if (lastRowIndex != rowIndex) {
  301 + lastRowIndex = rowIndex;
  302 + numOfRows++;
  303 + //if (isRowInvalid) numOfRowsInvalid++;
  304 + }
  305 +
  306 + if (value == null || typeof value == 'undefined' || (value + "").length == 0) {
  307 + //datasetErrors++;
  308 + } //isRowInvalid = true;
  309 +
  310 + //var isCast = !(options.castIfNull == false && inferredType.totalNullValues > 0);
  311 + var isCast = inferredType.typeConfidence >= options.castThresholdConfidence;
  312 + if (inferredType.type == DataTypeConverter.TYPES.NUMBER.name && isCast) {
  313 + var number = parseFloat(value);
  314 +
  315 + if (isNaN(number)) {
  316 + datasetErrors++;
  317 + return value;
  318 + }
  319 +
  320 + return number;
  321 + }
  322 +
  323 + return value;
  324 + });
  325 +
  326 +
  327 + metadata.qualityIndex.notNullValues = (numOfValues - datasetMissingValues) / numOfValues;
  328 + metadata.qualityIndex.errors = (numOfValues - datasetErrors) / numOfValues;
  329 +
  330 + return metadata;
  331 + },//EndFunction.
  332 +
  333 + /**
  334 + * It parses the json and infers the data types.
  335 + * @param json
  336 + * @param path Array of field keys/names.
  337 + */
  338 + inferJsonDataType: function (json, fieldKeys) {
  339 + var stack = [];
  340 + var fieldsType = {};
  341 + var numOfRows = 0;
  342 +
  343 + if (typeof fieldKeys == 'undefined')
  344 + throw "IllegalArgumentException: undefined json path to analyse.";
  345 +
  346 + //Insert the first item (json root) within the stack.
  347 + stack.push({ item: json, fieldKeyIndex: 0 });
  348 +
  349 + while (stack.length > 0) {
  350 + var stackTask = stack.pop();
  351 + var item = stackTask.item;
  352 + var fieldKeyIndex = stackTask.fieldKeyIndex;
  353 + var fieldKey = fieldKeys[fieldKeyIndex];
  354 +
  355 + //Test fieldKey Value.
  356 + //This if is executed when the fieldKey is * and the dataset it is NOT an ARRAY.
  357 + //Thus, it loops through the javascript object KEYs.
  358 + if (fieldKey == '*' && ArrayUtils.isArray(item) == false) {
  359 + var sProcessedKeys = fieldKeys.slice(0, fieldKeyIndex).toString();
  360 +
  361 + ArrayUtils.IteratorOverKeys(item, function (item, key) {
  362 + var inferredType = _processInferType(item);
  363 + var curKey = sProcessedKeys + ((sProcessedKeys.length == 0) ? "" : ",") + key;
  364 +
  365 + var fieldType = ArrayUtils.TestAndInitializeKey(fieldsType, curKey, { name: curKey, _inferredTypes: [], _inferredValues: [], numOfItems: 0 });
  366 + fieldType.numOfItems++;
  367 + ArrayUtils.TestAndIncrement(fieldType._inferredTypes, inferredType.name);
  368 + if (inferredType === DataTypeConverter.TYPES.TEXT)
  369 + ArrayUtils.TestAndIncrement(fieldType._inferredValues, item);
  370 + //if (inferredType === DataTypeConverter.TYPES.LATITUDE || inferredType === DataTypeConverter.TYPES.LONGITUDE)
  371 + // ArrayUtils.TestAndIncrement(fieldType._inferredTypes, DataTypeConverter.TYPES.NUMBER);
  372 +
  373 + });
  374 +
  375 + numOfRows++;
  376 + continue;
  377 + }
  378 +
  379 + //Loops through the array cells.
  380 + if (fieldKey == '*' && ArrayUtils.isArray(item)) {
  381 + for (var j= 0, cell; j<item.length && (cell = item[j]); j++) {
  382 + stack.push({item: cell, fieldKeyIndex: fieldKeyIndex});
  383 + numOfRows++;
  384 + }
  385 + continue;
  386 + }
  387 +
  388 + //This is executed when the fieldKey is not *
  389 + var jsonSubtree = item[fieldKey];
  390 + if (Array.isArray(jsonSubtree)) { //It is an array.
  391 + for (var j=0; j<jsonSubtree.length; j++) {
  392 + var jsonItem = jsonSubtree[j];
  393 + stack.push({ item: jsonItem, fieldKeyIndex: fieldKeyIndex+1 });
  394 + }//EndForJ.
  395 + } else {
  396 + stack.push({ item: jsonSubtree, fieldKeyIndex: fieldKeyIndex+1 });
  397 + }
  398 + }//EndWhile.
  399 +
  400 + _analyseDataTypes(fieldsType);
  401 +
  402 + //Data quality.
  403 + var quality = { homogeneity: 1, completeness: 1, totalNullValues: 0, totalValues: 0 };
  404 + ArrayUtils.IteratorOverKeys(fieldsType, function(fieldType) {
  405 + quality.totalValues += fieldType.numOfItems;
  406 + quality.homogeneity *= fieldType.typeConfidence;
  407 +
  408 + fieldType.totalNullValues = 0;
  409 + if (fieldType._inferredTypes.hasOwnProperty(DataTypeConverter.TYPES.EMPTY.name)) {
  410 + fieldType.totalNullValues = fieldType._inferredTypes[DataTypeConverter.TYPES.EMPTY.name];
  411 + quality.totalNullValues += fieldType.totalNullValues;
  412 + }
  413 +
  414 + });
  415 + quality.homogeneity = Math.round(quality.homogeneity * 100) / 100;
  416 + var totFullValues = quality.totalValues - quality.totalNullValues;
  417 + quality.completeness = Math.round(totFullValues / quality.totalValues * 100) / 100;
  418 +
  419 + //Converts confidence to description.
  420 + var warningsTextual = "";
  421 + ArrayUtils.IteratorOverKeys(fieldsType, function(fieldType) {
  422 + fieldType.errorsDescription = "";
  423 +
  424 + var description = "";
  425 +
  426 + //if (fieldType.typeConfidence < 1 || fieldType.totalNullValues > 0)
  427 + // description = "The field <" + fieldType.name + "> is a <" + fieldType.type + ">, ";
  428 +
  429 + if (fieldType.typeConfidence < 1) {
  430 + /*if (fieldType._inferredTypes.hasOwnProperty(DataTypeConverter.TYPES.EMPTY.name)) {
  431 + var numNulls = fieldType._inferredTypes[DataTypeConverter.TYPES.EMPTY.name];
  432 + if (typeof numNulls !== 'undefined' && numNulls > 0)
  433 + description += " and has " + numNulls + " EMPTY values, ";
  434 + }*/
  435 +
  436 + var incorrect = fieldType.numOfItems - fieldType.totalNullValues - fieldType._inferredTypes[fieldType.type];
  437 + if (incorrect > 0) {
  438 + description += "The column <" + fieldType.name + "> has the type <" + fieldType.type + ">";
  439 + var verb = (incorrect == 1) ? " value is" : " values are";
  440 + description += ", but " + incorrect + verb + " not a " + fieldType.type;
  441 + }
  442 + }
  443 +
  444 + if (fieldType.totalNullValues > 0) {
  445 + description += "The column <" + fieldType.name + "> has " + fieldType.totalNullValues + " EMPTY value";
  446 + if (fieldType.totalNullValues > 1) description += "s";
  447 + }
  448 +
  449 + if (description.length > 0)
  450 + description += ".";
  451 +
  452 + fieldType.errorsDescription = description;
  453 + warningsTextual += description;
  454 + });
  455 +
  456 + return { dataset: json, fieldKeys: fieldKeys, types: fieldsType, qualityIndex: quality, warningsTextual: warningsTextual };
  457 + },//EndFunction.
  458 +
  459 + /*inferDataTypes: function (jsonRows) {
  460 + this._fields = [];
  461 + this._numOfRows = 0;
  462 + _processDataset(jsonRows);
  463 + return this._fields;
  464 + },//EndFunction.*/
  465 +
  466 + /**
  467 + * Given in input a value, the function infers the data type.
  468 + * @param value
  469 + * @returns {*}
  470 + */
  471 + inferDataTypeOfValue: function (value) {
  472 + return _processInferType(value);
  473 + }//EndFunction.
  474 +
  475 + };
  476 +})();
bower_components/JSDataChecker/src/DataTypesUtils.js 0 → 100644
  View file @2b9ef0b
  1 +/*
  2 + ** This file is part of JSDataChecker.
  3 + **
  4 + ** JSDataChecker is free software: you can redistribute it and/or modify
  5 + ** it under the terms of the GNU General Public License as published by
  6 + ** the Free Software Foundation, either version 3 of the License, or
  7 + ** (at your option) any later version.
  8 + **
  9 + ** JSDataChecker is distributed in the hope that it will be useful,
  10 + ** but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 + ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12 + ** GNU General Public License for more details.
  13 + **
  14 + ** You should have received a copy of the GNU General Public License
  15 + ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
  16 + **
  17 + ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
  18 + ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
  19 + ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
  20 + **/
  21 +
  22 +function DataTypesUtils() {}
  23 +
  24 +DataTypesUtils.FilterTime = function (value) {
  25 + var expTime = /^[0-9]{2}:[0-9]{2}(:[0-9]{2})?(\+[0-9]{2}:[0-9]{2})?$/;
  26 + if (expTime.test(value) == false) return null;
  27 +
  28 + var splitted = value.split(/[:|\+]/);
  29 +
  30 + var expNumber = /^[0-9]{2}$/;
  31 + var HH = expNumber.test(splitted[0]) ? parseInt(splitted[0]) : 0;
  32 + var MM = expNumber.test(splitted[1]) ? parseInt(splitted[1]) : 0;
  33 + var SS = splitted.length >=3 && expNumber.test(splitted[2]) ? parseInt(splitted[2]) : 0;
  34 +
  35 + var dt = new Date();
  36 + dt.setHours(HH);
  37 + dt.setMinutes(MM);
  38 + dt.setSeconds(SS);
  39 + return dt;
  40 +}//EndFunction.
  41 +
  42 +DataTypesUtils.FilterDateTime = function (value) {
  43 + var _dtSplitted = value.split(/[T|\s]/);
  44 + if (_dtSplitted.length == 2) {
  45 + var dtTime = DataTypesUtils.FilterTime(_dtSplitted[1]);
  46 + if (dtTime == null) return null;
  47 +
  48 + var dtDateTime = DataTypesUtils.FilterDate(_dtSplitted[0], dtTime);
  49 + return dtDateTime;
  50 + } else {
  51 + var dtDate = DataTypesUtils.FilterDate(value);
  52 + if (dtDate != null) return dtDate;
  53 +
  54 + var dtTime = DataTypesUtils.FilterTime(value);
  55 + return dtTime;
  56 + }
  57 +}//EndFunction.
  58 +
  59 +DataTypesUtils.FilterDate = function (value, dtDate) {
  60 + if (dtDate == null) dtDate = new Date();
  61 +
  62 + //year-month.
  63 + if (/^[0-9][0-9][0-9][0-9]\-[0-9][0-9]$/.test(value)) {
  64 + var year = parseInt(value.substring(0, 4));
  65 + var month = parseInt(value.substring(5));
  66 + dtDate.setYear(year);
  67 + dtDate.setMonth(month);
  68 + return dtDate;
  69 + }
  70 +
  71 + var expDate = /^[0-9]{4}(\-|\/)[0-9]{2}((\-|\/)[0-9]{2})?$/;
  72 + if (expDate.test(value)) {
  73 + var splitted = value.split(/[\-|\/]/);
  74 + var year = parseInt(splitted[0]);
  75 + var month = parseInt(splitted[1]);
  76 + var day = splitted.length == 3 ? parseInt(splitted[2]) : 0;
  77 + dtDate.setYear(year);
  78 + dtDate.setMonth(month);
  79 + dtDate.setDate(day);
  80 + return dtDate;
  81 + }
  82 +
  83 + expDate = /^[0-9]{2}(\-|\/)[0-9]{2}(\-|\/)[0-9]{4}$/;
  84 + if (expDate.test(value)) {
  85 + var splitted = value.split(/[\-|\/]/);
  86 + var year = parseInt(splitted[2]);
  87 + var month = parseInt(splitted[1]);
  88 + var day = parseInt(splitted[0]);
  89 + dtDate.setYear(year);
  90 + dtDate.setMonth(month);
  91 + dtDate.setDate(day);
  92 + return dtDate;
  93 + }
  94 +
  95 + return null;
  96 +};//EndFunction.
  97 +
  98 +/**
  99 + * Converts the value in a number, NaN if it is not a number.
  100 + * @param value
  101 + * @returns {*}
  102 + */
  103 +DataTypesUtils.FilterFloat = function (value) {
  104 + if(/^(\-|\+)?((0|([1-9][0-9]*))(\.[0-9]+)?|Infinity)$/
  105 + .test(value))
  106 + return Number(value);
  107 + return NaN;
  108 +};//EndFunction.
  109 +
  110 +/**
  111 + * Solution from here:
  112 + * http://stackoverflow.com/questions/10454518/javascript-how-to-retrieve-the-number-of-decimals-of-a-string-number
  113 + * @param num
  114 + * @returns {number}
  115 + */
  116 +DataTypesUtils.DecimalPlaces = function (num) {
  117 + var match = (''+num).match(/(?:\.(\d+))?(?:[eE]([+-]?\d+))?$/);
  118 + if (!match) { return 0; }
  119 + return Math.max(
  120 + 0,
  121 + // Number of digits right of decimal point.
  122 + (match[1] ? match[1].length : 0)
  123 + // Adjust for scientific notation.
  124 + - (match[2] ? +match[2] : 0));
  125 +}//EndFunction.
0 \ No newline at end of file 126 \ No newline at end of file
bower_components/JSDataChecker/src/ODPlatforms/CKAN.js 0 → 100644
  View file @2b9ef0b
  1 +/*
  2 + ** This file is part of JSDataChecker.
  3 + **
  4 + ** JSDataChecker is free software: you can redistribute it and/or modify
  5 + ** it under the terms of the GNU General Public License as published by
  6 + ** the Free Software Foundation, either version 3 of the License, or
  7 + ** (at your option) any later version.
  8 + **
  9 + ** JSDataChecker is distributed in the hope that it will be useful,
  10 + ** but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 + ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12 + ** GNU General Public License for more details.
  13 + **
  14 + ** You should have received a copy of the GNU General Public License
  15 + ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
  16 + **
  17 + ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
  18 + ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
  19 + ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
  20 + **/
  21 +
  22 +
  23 +//This JS class allows the connection to a ckan platform.
  24 +
  25 +function CKANApi() {
  26 +}//EndFunction.
  27 +
  28 +CKANApi.prototype = (function() {
  29 +
  30 + var httpGetAsync = function(theUrl, callback, errorCallback) {
  31 + var xhttp = new XMLHttpRequest();
  32 + xhttp.onreadystatechange = function() {
  33 + if (xhttp.readyState == 4 && xhttp.status == 200)
  34 + callback(xhttp.responseText);
  35 + };
  36 + xhttp.onerror = function (XMLHttpRequest, textStatus, errorThrown) {
  37 + console.log( 'The data failed to load :(' );
  38 + if (typeof errorCallback !== 'undefined')
  39 + errorCallback("Check DataStoreAPI.");
  40 + };
  41 + xhttp.open("GET", theUrl, true);//true for asynchronous.
  42 + xhttp.send(null);
  43 + };//EndFunction.
  44 +
  45 + /*var _processListOfDataset = function(requestContent) {
  46 +
  47 + var jsonContent = JSON.parse(requestContent);
  48 + if (jsonContent.success == false) return;
  49 + var ckanresults = jsonContent.result.results;
  50 +
  51 +
  52 + var datasetsCSV = [];
  53 + var arrFormatsSummary = [];
  54 +
  55 + for (var i=0; i<ckanresults.length; i++) {
  56 + var result = ckanresults[i];
  57 + var resources = result.resources;
  58 + for (var j=0; j<resources.length; j++) {
  59 + var resource = resources[j];
  60 +
  61 + var resourceFormat = resource.format;
  62 + _arrUtil.testAndIncrement(arrFormatsSummary, resourceFormat);
  63 +
  64 + if (resourceFormat == "CSV")
  65 + datasetsCSV.push({ id: resource.id, description: resource.description, url: resource.url });
  66 +
  67 + //debugger;
  68 + }
  69 + }//EndFor.
  70 +
  71 + console.log("...");
  72 + };//EndFunction.*/
  73 +
  74 + var _retrieveListOfDatasets = function(baseUrl, userCallback) {
  75 + httpGetAsync(baseUrl, function(responseText) {
  76 + var datasets = [];
  77 +
  78 + var jsonResponse = JSON.parse(responseText);
  79 + var jsonResults = jsonResponse.result.results;
  80 +
  81 + for (var i=0; i<jsonResults.length; i++) {
  82 + var jsonResult = jsonResults[i];
  83 + var jsonResources = jsonResult.resources;
  84 +
  85 + for (var j=0; j<jsonResources.length; j++) {
  86 + var jsonResource = jsonResources[j];
  87 +
  88 + var idx = baseUrl.indexOf("/api");
  89 + var pageUrl = baseUrl.substring(0, idx) + "/dataset/" + jsonResult.name + "/resource/" + jsonResource.id;
  90 + datasets.push({ id: jsonResource.id, name: jsonResource.name, format: jsonResource.format,
  91 + url: jsonResource.url, pageUrl: pageUrl });
  92 + }//EndForJ.
  93 + }//EndForI.
  94 +
  95 + userCallback(datasets);
  96 + });
  97 + };//EndFunction.
  98 +
  99 + //PUBLIC CLASS CONTENT.
  100 + return {
  101 + constructor: CKANApi,
  102 +
  103 + listDatasets: function (baseUrl, userCallback) {
  104 + var apiListDataset = baseUrl + "/api/3/action/package_search" + "?rows=10000";
  105 + _retrieveListOfDatasets(apiListDataset, userCallback)
  106 + },//EndFunction.
  107 +
  108 + retrieveDataset: function (baseUrl, datasetId, userCallback) {
  109 + var linkDataset = baseUrl + "/api/action/datastore_search?resource_id=" + datasetId;
  110 + httpGetAsync(linkDataset, function(responseContent) {
  111 + var jsonResponseCKAN = JSON.parse(responseContent);
  112 + var numOfRows = jsonResponseCKAN.result.total;
  113 + var numOfCols = jsonResponseCKAN.result.fields.length;
  114 + var record = { error: false, original: jsonResponseCKAN, numOfRows: numOfRows, numOfCols: numOfCols };
  115 + userCallback(record);
  116 + }, function (errMsg) {
  117 + var record = { error: true, errorMessage: errMsg };
  118 + userCallback(record);
  119 + });
  120 + }//EndFunction
  121 + };
  122 +
  123 +})();
0 \ No newline at end of file 124 \ No newline at end of file
bower_components/JSDataChecker/src/ODPlatforms/ODStatistics.js 0 → 100644
  View file @2b9ef0b
  1 +/*
  2 + ** This file is part of JSDataChecker.
  3 + **
  4 + ** JSDataChecker is free software: you can redistribute it and/or modify
  5 + ** it under the terms of the GNU General Public License as published by
  6 + ** the Free Software Foundation, either version 3 of the License, or
  7 + ** (at your option) any later version.
  8 + **
  9 + ** JSDataChecker is distributed in the hope that it will be useful,
  10 + ** but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 + ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12 + ** GNU General Public License for more details.
  13 + **
  14 + ** You should have received a copy of the GNU General Public License
  15 + ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
  16 + **
  17 + ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
  18 + ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
  19 + ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
  20 + **/
  21 +
  22 +function ODStatistics() {
  23 +}//EndFunction.
  24 +
  25 +ODStatistics.prototype = (function() {
  26 +
  27 + var httpGetAsync = function(theUrl, callback) {
  28 + var xhttp = new XMLHttpRequest();
  29 + xhttp.onreadystatechange = function() {
  30 + if (xhttp.readyState == 4 && xhttp.status == 200)
  31 + callback(xhttp.responseText);
  32 + };
  33 + xhttp.onerror = function (XMLHttpRequest, textStatus, errorThrown) {
  34 + console.log( 'The data failed to load :(' );
  35 + console.log(JSON.stringify(XMLHttpRequest));
  36 + };
  37 + xhttp.open("GET", theUrl, true);//true for asynchronous.
  38 + xhttp.send(null);
  39 + };//EndFunction.
  40 +
  41 + var _downloadDataset = function() {
  42 +
  43 + };//EndFunction.
  44 +
  45 + /**
  46 + * Retrieves the formats of all datasets.
  47 + * @param datasets
  48 + * @returns {{}}
  49 + * @private
  50 + */
  51 + var _analyseFormats = function(datasets) {
  52 + var stats = {};
  53 +
  54 + stats.numOfDatasets = datasets.length;
  55 + stats.formats = [];
  56 +
  57 + for (var i=0; i<datasets.length; i++) {
  58 + var dataset = datasets[i];
  59 +
  60 + //Statistics on the datasets' formats.
  61 + ArrayUtils.TestAndIncrement(stats.formats, dataset.format);
  62 + }//EndForI.
  63 +
  64 + //Calculates the formats percentages.
  65 + var tmpArrFormats = stats.formats;
  66 + stats.formats = [];
  67 +
  68 + ArrayUtils.IteratorOverKeys(tmpArrFormats, function(item, property) {
  69 + var recordFormat = {};
  70 + recordFormat.name = property;
  71 + recordFormat.occurrance = item;
  72 + recordFormat.occurrancePercentage = (item / datasets.length) * 100;
  73 + recordFormat.occurrancePercentage = Math.round(recordFormat.occurrancePercentage * 100) / 100;
  74 + stats.formats.push(recordFormat);
  75 + });
  76 +
  77 + return stats;
  78 + };//EndFunction.
  79 +
  80 + /**
  81 + * Given a dataset in input it calculates statistics.
  82 + * @param dataset
  83 + * @private
  84 + */
  85 + var _analyseDataset = function(dataset, stats) {
  86 + if (typeof stats === 'undefined')
  87 + stats = {};
  88 +
  89 + if (!stats.hasOwnProperty('totRows')) {
  90 + stats.totRows = 0;
  91 + stats.totCols = 0;
  92 + stats.maxRowsPerDataset = null;
  93 + stats.minRowsPerDataset = null;
  94 +
  95 + stats.maxColsPerDataset = null;
  96 + stats.minColsPerDataset = null;
  97 +
  98 + stats.totDatasetsAnalysed = 0;
  99 + }
  100 +
  101 + stats.totRows += dataset.numOfRows;
  102 + stats.totCols += dataset.numOfCols;
  103 +
  104 + if (stats.maxRowsPerDataset === null || dataset.numOfRows > stats.maxRowsPerDataset)
  105 + stats.maxRowsPerDataset = dataset.numOfRows;
  106 +
  107 + if (stats.minRowsPerDataset === null || dataset.numOfRows < stats.minRowsPerDataset)
  108 + stats.minRowsPerDataset = dataset.numOfRows;
  109 +
  110 + if (stats.maxColsPerDataset === null || dataset.numOfCols > stats.maxColsPerDataset)
  111 + stats.maxColsPerDataset = dataset.numOfCols;
  112 +
  113 + if (stats.minColsPerDataset === null || dataset.numOfCols < stats.minColsPerDataset)
  114 + stats.minColsPerDataset = dataset.numOfCols;
  115 +
  116 + return stats;
  117 + };//EndFunction.
  118 +
  119 + return {
  120 + constructor: ODStatistics,
  121 +
  122 + analyse: function (datasets) {
  123 + var stats = _analyseFormats(datasets); //Analyses the datasets formats.
  124 + return stats;
  125 + },//EndFunction.
  126 +
  127 + analyseDataset: function (dataset, stats) {
  128 + return _analyseDataset(dataset, stats);
  129 + }//EndFunction.
  130 +
  131 + };
  132 +})();
0 \ No newline at end of file 133 \ No newline at end of file
datalets/base-ajax-json-alasql-datalet/static/js/AjaxJsonAlasqlBehavior_old3.js 0 → 100755
  View file @2b9ef0b
  1 +/*
  2 +@license
  3 + The MIT License (MIT)
  4 +
  5 + Copyright (c) 2015 Dipartimento di Informatica - Universit� di Salerno - Italy
  6 +
  7 + Permission is hereby granted, free of charge, to any person obtaining a copy
  8 + of this software and associated documentation files (the "Software"), to deal
  9 + in the Software without restriction, including without limitation the rights
  10 + to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  11 + copies of the Software, and to permit persons to whom the Software is
  12 + furnished to do so, subject to the following conditions:
  13 +
  14 + The above copyright notice and this permission notice shall be included in
  15 + all copies or substantial portions of the Software.
  16 +
  17 + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  18 + IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  19 + FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  20 + AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  21 + LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  22 + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  23 + THE SOFTWARE.
  24 +*/
  25 +
  26 +/**
  27 + * Developed by :
  28 + * ROUTE-TO-PA Project - grant No 645860. - www.routetopa.eu
  29 + *
  30 +*/
  31 +
  32 +
  33 +var AjaxJsonAlasqlBehavior = {
  34 +
  35 + properties: {
  36 +
  37 + /**
  38 + * It contains the json data from async xhr call returned from core-ajax core component
  39 + *
  40 + * @attribute json_results
  41 + * @type object
  42 + * @default 'null'.
  43 + */
  44 + json_results: {
  45 + type: Object,
  46 + value: {}
  47 + }
  48 +
  49 + },
  50 +
  51 + /**
  52 + * Make an AJAX call to the dataset URL
  53 + *
  54 + * @method requestData
  55 + */
  56 + requestData: function(){
  57 +
  58 + var comp = this;
  59 +
  60 + $.ajax({
  61 + url: this._component.dataUrl,
  62 + dataType: "json",
  63 + success: function(e){
  64 + comp.handleResponse(e);
  65 + }
  66 + });
  67 + },
  68 +
  69 + /**
  70 + * Called when core-ajax component receive the json data from called url.
  71 + *
  72 + * @method handleResponse
  73 + */
  74 + handleResponse: function(e) {
  75 + this.properties.json_results.value = e;
  76 + this.runWorkcycle();
  77 + },
  78 +
  79 + /**
  80 + * selectData built a JSONPATH query based on the user selected fields then extract data from the JSON response.
  81 + * This method built an objects <name, data> for every user selected field and push it into the data array.
  82 + *
  83 + * @method selectData
  84 + */
  85 + selectData : function() {
  86 + this._component.fields = JSON.parse(this._component.fields);
  87 + var provider = this._getProvider(this._component.fields[0]);
  88 +
  89 + var filters = JSON.parse(this._component.getAttribute("filters"));
  90 + var aggregators = JSON.parse(this._component.getAttribute("aggregators"));
  91 + var orders = JSON.parse(this._component.getAttribute("orders"));
  92 +
  93 + //preview my space
  94 + if(filters && filters[0] && filters[0].constructor == Array){
  95 + filters = filters[0];
  96 + aggregators = aggregators[0];
  97 + orders = orders[0];
  98 + }
  99 +
  100 + var fields = [];
  101 + for (var i=0; i < this._component.fields.length; i++)
  102 + fields.push(this._fieldName(this._component.fields[i], provider));
  103 +
  104 + //jsdatachecker
  105 + var _converter = new DataTypeConverter();
  106 + var path2 = this._arrayPath(provider);
  107 + var processingResult = _converter.inferJsonDataType(this.properties.json_results.value, path2);
  108 + var processingResults = _converter.cast(processingResult);
  109 + var jsonData = [processingResults.dataset];
  110 +
  111 + //WHERE
  112 + var where = "";
  113 + if(filters && filters.length) {
  114 +
  115 + for (var i=0; i < filters.length; i++)
  116 + filters[i]["field"] = this._fieldName(filters[i]["field"], provider);
  117 +
  118 + where = "WHERE ";
  119 + for (var i=0; i < filters.length; i++) {
  120 + if(filters[i]["operation"] == "contains")
  121 + where += filters[i]["field"] + " like '%" + filters[i]["value"] + "%' AND ";
  122 + else if(filters[i]["operation"] == "not contains")
  123 + where += filters[i]["field"] + " not like '%" + filters[i]["value"] + "%' AND ";
  124 + else if(filters[i]["operation"] == "start")
  125 + where += filters[i]["field"] + " like '" + filters[i]["value"] + "%' AND ";
  126 + else if(filters[i]["operation"] == "ends")
  127 + where += filters[i]["field"] + " like '%" + filters[i]["value"] + "' AND ";
  128 + else
  129 + where += filters[i]["field"] + " " + filters[i]["operation"] + " " + filters[i]["value"] + " AND ";
  130 + }
  131 + where = where.slice(0, -5);
  132 + }
  133 +
  134 + //ORDER BY
  135 + var orderBy = "";
  136 + if(orders && orders.length) {
  137 +
  138 + for (var i=0; i < orders.length; i++)
  139 + orders[i]["field"] = this._fieldName(orders[i]["field"], "");
  140 +
  141 + orderBy = "ORDER BY ";
  142 + for (var i = 0; i < orders.length; i++)
  143 + orderBy += orders[i]["field"] + " " + orders[i]["operation"] + ", ";
  144 + orderBy = orderBy.slice(0, -2);
  145 + }
  146 +
  147 + //SELECT
  148 + var pureSelect = "SELECT ";
  149 + for (var i = 0; i < fields.length; i++)
  150 + pureSelect += fields[i] + " as " + this._fieldName(this._component.fields[i], "") + ", ";
  151 + pureSelect = pureSelect.slice(0, -2);
  152 +
  153 + //GROUP BY
  154 + var groupBy = "";
  155 + var select = "";
  156 + if(aggregators && aggregators.length) {
  157 +
  158 + for (var i=0; i < aggregators.length; i++)
  159 + aggregators[i]["field"] = this._fieldName(aggregators[i]["field"], "");
  160 +
  161 + groupBy = "GROUP BY " + aggregators[0]["field"];
  162 + select = "SELECT " + aggregators[0]["field"];
  163 + for (var i = 1; i < aggregators.length; i++)
  164 + select += ", " + aggregators[i]["operation"] + "(" + aggregators[i]["field"] + ") as " + aggregators[i]["field"];
  165 +
  166 + if(aggregators[1] && aggregators[1]["operation"] == "GROUP BY") {
  167 + groupBy = "GROUP BY " + aggregators[0]["field"] + ", " + aggregators[1]["field"];
  168 + select = "SELECT " + aggregators[0]["field"] + ", " + aggregators[1]["field"];
  169 + for (var i = 2; i < aggregators.length; i++)
  170 + select += ", " + aggregators[i]["operation"] + "(" + aggregators[i]["field"] + ") as " + aggregators[i]["field"];
  171 + }
  172 + }
  173 +
  174 + //QUERY
  175 + var path = this._path(this._component.fields[0], provider);
  176 + var query;
  177 +
  178 + query = "SELECT "+ path +" FROM ?";
  179 + //console.log(query);
  180 + var res = alasql(query, [jsonData]);
  181 +
  182 + var records = res[0][path];
  183 +
  184 + query = pureSelect + " FROM ? " + where + " " + orderBy;
  185 + //console.log(query);
  186 + var obj = alasql(query, [records]);
  187 +
  188 + if (groupBy != "") {
  189 + query = select + " FROM ? " + groupBy + " " + orderBy;
  190 + //console.log(query);
  191 + obj = alasql(query, [obj]);
  192 + }
  193 +
  194 + //PUSH DATA
  195 + if(!obj || obj.length == 0)
  196 + this.data = []
  197 + else
  198 + this._pushData(obj, fields);
  199 +
  200 + this._deleteWaitImage();
  201 + },
  202 +
  203 + _pushData : function(obj, keys) {
  204 + this.data = [];
  205 +
  206 + if (typeof keys == 'undefined')
  207 + keys = Object.keys(obj[0]);
  208 +
  209 + for (var key in keys){
  210 +
  211 + var name = keys[key].replace(/(\[|\]|fields->)/g, "");
  212 + var data = [];
  213 +
  214 + for (var i in obj) {
  215 + var v = obj[i][name];
  216 + if(!isNaN(v) && v % 1 != 0)
  217 + v = Math.floor(v * 100) / 100;
  218 + data.push(v);
  219 +
  220 + //data.push(obj[i][name]);
  221 + }
  222 +
  223 + this.data.push({
  224 + name: name,
  225 + data: data
  226 + });
  227 + }
  228 + },
  229 +
  230 + _getProvider : function(field) {
  231 + if(field.indexOf("result,records") > -1)
  232 + return "ckan";
  233 + else if(field.indexOf("records,fields") > -1)
  234 + return "openDataSoft";
  235 + else
  236 + return "provider";
  237 + },
  238 +
  239 + _fieldName : function(field, provider) {
  240 + if(provider.indexOf("ckan") > -1) {
  241 + return "[" + field.substring(field.lastIndexOf(",") + 1, field.length) + "]";
  242 + }
  243 + else if(provider.indexOf("openDataSoft") > -1) {
  244 + return "fields->[" + field.substring(field.lastIndexOf(",") + 1, field.length)+ "]";
  245 + }
  246 + else {
  247 + return "[" + field.substring(field.lastIndexOf(",") + 1, field.length) + "]";
  248 + }
  249 + },
  250 +
  251 + _path : function(field, provider) {
  252 + if(provider.indexOf("ckan") > -1) {
  253 + return "result->records"
  254 + }
  255 + else if(provider.indexOf("openDataSoft") > -1) {
  256 + return "records";
  257 + }
  258 + else {
  259 + return field.substring(0, field.lastIndexOf(",")).replace(",", "->");
  260 + }
  261 + },
  262 +
  263 + _arrayPath : function(provider) {
  264 + if(provider.indexOf("ckan") > -1) {
  265 + return ["result", "records", "*"];
  266 + }
  267 + else if(provider.indexOf("openDataSoft") > -1) {
  268 + return ["records", "fields", "*"];
  269 + }
  270 + else {
  271 + return ["*"];
  272 + }
  273 + },
  274 +
  275 + /**
  276 + * Delete a image after loading a datalet
  277 + */
  278 + _deleteWaitImage : function() {
  279 + $("img[src$='spin.svg']").remove();
  280 + }
  281 +
  282 +};
0 \ No newline at end of file 283 \ No newline at end of file