jsdatachecker

Renato De Donato
1 parent cdf7359f
Showing 20 changed files with 2462 additions and 58 deletions
bower_components/jsdatachecker/.bower.json
bower_components/jsdatachecker/LICENSE
bower_components/jsdatachecker/README.md
bower_components/jsdatachecker/bower.json
bower_components/jsdatachecker/build.cmd
bower_components/jsdatachecker/jsdatachecker.min.js
bower_components/jsdatachecker/src/ArrayUtils.js
bower_components/jsdatachecker/src/DataTypeConverter.js
bower_components/jsdatachecker/src/DataTypesUtils.js
bower_components/jsdatachecker/src/ODPlatforms/ODSApi.js
bower_components/jsdatachecker/src/ODPlatforms/ckan.js
bower_components/jsdatachecker/src/oldsrc/DataTypeAnalyser.js
bower_components/jsdatachecker/src/oldsrc/chartviz.js
bower_components/jsdatachecker/src/oldsrc/index.html
bower_components/jsdatachecker/tooldemo/index.html
datalets/base-ajax-json-alasql-datalet/base-ajax-json-alasql-datalet.html
datalets/base-ajax-json-alasql-datalet/static/js/AjaxJsonAlasqlBehavior.js
datalets/base-ajax-json-alasql-datalet/static/js/AjaxJsonAlasqlBehavior_old.js
datalets/base-ajax-json-alasql-datalet/static/js/alasql.min.js
datalets/base-ajax-json-alasql-datalet/static/js/jsonsql-0.1.js
+{
+  "name": "JSDataChecker",
+  "version": "0.0.1",
+  "homepage": "https://github.com/donpir/JSDataChecker",
+  "authors": [
+    "'Donato Pirozzi <'donatopirozzi@gmail.com'>"
+  ],
+  "description": "Javascript library to read dataset content (e.g., Open Data), infer data types, give a data quality indicator and parse content",
+  "main": "jsdatachecker/jsdatachecker.js",
+  "license": "GPL",
+  "ignore": [
+    "**/.*",
+    "node_modules",
+    "bower_components",
+    "test",
+    "tests"
+  ],
+  "devDependencies": {
+    "paper-progress": "PolymerElements/paper-progress#~1.0.8",
+    "polymer": "Polymer/polymer#1.2.0",
+    "qunit": "~1.22.0",
+    "csvjson": "0.1.0"
+  },
+  "private": false,
+  "_release": "0.0.1",
+  "_resolution": {
+    "type": "version",
+    "tag": "v0.0.1",
+    "commit": "22c592624f3d359bc0cc325c5c4bc9dacce1befd"
+  },
+  "_source": "git://github.com/donpir/JSDataChecker.git",
+  "_target": "0.0.1",
+  "_originalSource": "jsdatachecker"
+}
 \ No newline at end of file
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    {one line to give the program's name and a brief idea of what it does.}
+    Copyright (C) {year}  {name of author}
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    {project}  Copyright (C) {year}  {fullname}
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+# JSDataChecker
+JavaScript Library to read dataset content (e.g., Open Data), infer data types, give a data quality indicator and parse content.
+
+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.
+
+{
+  "name": "JSDataChecker",
+  "version": "v0.0.1",
+  "homepage": "https://github.com/donpir/JSDataChecker",
+  "authors": [
+    "'Donato Pirozzi <'donatopirozzi@gmail.com'>"
+  ],
+  "description": "Javascript library to read dataset content (e.g., Open Data), infer data types, give a data quality indicator and parse content",
+  "main": "jsdatachecker/jsdatachecker.js",
+  "license": "GPL",
+  "ignore": [
+    "**/.*",
+    "node_modules",
+    "bower_components",
+    "test",
+    "tests"
+  ],
+  "devDependencies": {
+    "paper-progress": "PolymerElements/paper-progress#~1.0.8",
+    "polymer": "Polymer/polymer#1.2.0",
+    "qunit": "~1.22.0",
+    "csvjson": "0.1.0"
+  },
+  "private": false
+}
+del jsdatachecker.min.js
+uglifyjs src\ArrayUtils.js src\DataTypeConverter.js src\DataTypesUtils.js --compress -o jsdatachecker.min.js
 \ No newline at end of file
+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.TestAndIncrement=function(arr,key){var exists=arr[key];return"undefined"==typeof exists&&(arr[key]=0),arr[key]++,arr},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 result=null;for(var key in arr)(null==result||fncompare(arr[key],result.value))&&(result={index:-1,key:key,value:arr[key]});return result},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});field.type=max.key,field.typeConfidence=field._inferredTypes[max.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){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(value,key){var curKey=sProcessedKeys+","+key,_value=callback(value,key,curKey,numOfRows);item[key]=_value}),numOfRows++}}};return{constructor:DataTypeConverter,convert:function(metadata){var lastRowIndex=0,numOfRows=0,numOfValues=0,datasetErrors=0,datasetMissingValues=0;return jsonTraverse(metadata.dataset,metadata.fieldKeys,function(value,key,traversedKeys,rowIndex){var inferredType=metadata.types[traversedKeys];if(numOfValues++,lastRowIndex!=rowIndex&&(lastRowIndex=rowIndex,numOfRows++),null==value||"undefined"==typeof value||0==(value+"").length,inferredType.type==DataTypeConverter.TYPES.NUMBER.name){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){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+","+key,fieldType=ArrayUtils.TestAndSet(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};return ArrayUtils.IteratorOverKeys(fieldsType,function(fieldType){quality.homogeneity*=fieldType.typeConfidence}),{dataset:json,fieldKeys:fieldKeys,types:fieldsType,qualityIndex:quality}},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};
 \ No newline at end of file
+/*
+ ** This file is part of JSDataChecker.
+ **
+ ** JSDataChecker is free software: you can redistribute it and/or modify
+ ** it under the terms of the GNU General Public License as published by
+ ** the Free Software Foundation, either version 3 of the License, or
+ ** (at your option) any later version.
+ **
+ ** JSDataChecker is distributed in the hope that it will be useful,
+ ** but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ ** GNU General Public License for more details.
+ **
+ ** You should have received a copy of the GNU General Public License
+ ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
+ **
+ ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
+ ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
+ ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
+ **/
+
+function ArrayUtils() {}
+
+/**
+ * It tests if the array has an element with the specified key,
+ * if does not have the key it initialises it with the object.
+ * @param arr
+ * @param key
+ * @param object
+ * @returns {*}
+ * @constructor
+ */
+ArrayUtils.TestAndSet = function (arr, key, object) {
+    if (typeof arr == 'undefined') return null;
+    if (Array.isArray(arr) == false) return null;
+    if (typeof arr[key] == 'undefined')
+        arr[key] = object;
+    return arr[key];
+};//EndFunction.
+
+/***
+ * It tests whether the array has the key, if not it insert it;
+ * then increases the value by one unit.
+ * @param arr
+ * @param key
+ * @returns {The array}
+ */
+ArrayUtils.TestAndIncrement = function (arr, key) {
+    var exists = arr[key];
+    if (typeof exists === 'undefined') arr[key] = 0;
+    arr[key]++;
+    return arr;
+};//EndFunction.
+
+/**
+ * Iterate over the key within the array arr. For each array
+ * value it calls the callback function.
+ * @param arr
+ * @param callback
+ * @constructor
+ */
+ArrayUtils.IteratorOverKeys = function (arr, callback) {
+    for (var property in arr) {
+        if (arr.hasOwnProperty(property)) {
+            var item = arr[property];
+            callback(item, property);
+        }
+    }
+};//EndFunction.
+
+/**
+ * Find the item with the max value within the array.
+ * @param arr
+ * @returns {*} It is an object with index, key, value.
+ */
+ArrayUtils.FindMinMax = function (arr, fncompare) {
+    var result = null;
+    for (var key in arr) {
+        if (result == null || fncompare(arr[key], result.value))
+            result = { index: -1, key: key, value: arr[key] };
+    }
+
+    return result;
+}//EndFunction.
+
+/*
+ ** This file is part of JSDataChecker.
+ **
+ ** JSDataChecker is free software: you can redistribute it and/or modify
+ ** it under the terms of the GNU General Public License as published by
+ ** the Free Software Foundation, either version 3 of the License, or
+ ** (at your option) any later version.
+ **
+ ** JSDataChecker is distributed in the hope that it will be useful,
+ ** but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ ** GNU General Public License for more details.
+ **
+ ** You should have received a copy of the GNU General Public License
+ ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
+ **
+ ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
+ ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
+ ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
+ **/
+
+function DataTypeConverter() {
+    this._fields = [];
+    this._numOfRows = 0;
+};//EndConstructor.
+
+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: 1000, name: "PERCENTAGE" },
+    LATITUDE    : { value: 1001, name: "LATITUDE" },
+    LONGITUDE   : { value: 1002, name: "LONGITUDE" }
+};
+
+DataTypeConverter.prototype = (function () {
+
+    /***
+     * Make an asynchronous call to load the content.
+     * @param theUrl
+     * @param callback
+     * @deprecated
+     */
+    var httpGetAsync = function(theUrl, callbackOnFinish) {
+        console.warn("Calling deprecated function.");
+        var xhttp = new XMLHttpRequest();
+        xhttp.onreadystatechange = function() {
+            if (xhttp.readyState == 4 && xhttp.status == 200)
+                _processDataset(xhttp.responseText, callbackOnFinish);
+        }
+        xhttp.open("GET", theUrl, true); // true for asynchronous
+        xhttp.send(null);
+    };//EndFunction.
+
+    /*var _processDataset = function (jsonRows) {
+        //Check if the jsonRow is an array.
+        if (Array.isArray(jsonRows) == false) return;
+
+        for (var i=0; i<jsonRows.length; i++) {
+            var jsonRow = jsonRows[i];
+            _processRow(jsonRow);
+        }//EndFor.
+
+        _analyseDataTypes(this._fields);
+
+        return this._fields;
+    };//EndFunction.*/
+
+    /*var _processRow = function(row) {
+        //Avoid empty rows
+        if (typeof row === 'undefined') return;
+
+        //Get the object keys.
+        for (var property in row) {
+            if (row.hasOwnProperty(property)) {
+                var cellValue = row[property];
+
+                //if (property == 'votantspourcentages') debugger;
+                //if (property == 'va_no_voie') debugger;
+
+                var inferredType = _processInferType(cellValue);
+
+                if (typeof this._fields[property] === 'undefined')
+                    this._fields[property] = { name: property, _inferredTypes: [], _inferredValues: [] };
+
+                _arrUtil.testAndIncrement(this._fields[property]._inferredTypes, inferredType.name);
+                if (inferredType === DataTypeConverter.TYPES.TEXT)
+                    _arrUtil.testAndIncrement(this._fields[property]._inferredValues, cellValue);
+                if (inferredType === DataTypeConverter.TYPES.LATITUDE || inferredType === DataTypeConverter.TYPES.LONGITUDE)
+                    _arrUtil.testAndIncrement(this._fields[property]._inferredTypes, DataTypeConverter.TYPES.NUMBER);
+            }
+        }
+
+        this._numOfRows++;
+    };//EndFunction.*/
+
+    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;
+                var _numericalInferredType = field._inferredTypes[DataTypeConverter.TYPES.NUMBER.name];
+                if (typeof _numericalInferredType != 'undefined') confidence += _numericalInferredType / field.numOfItems;
+
+                field.type = DataTypeConverter.TYPES.CODE.name;
+                field.typeConfidence = confidence;
+                return;
+            }
+
+
+            var max = ArrayUtils.FindMinMax(field._inferredTypes, function (curval, lastval) {
+                return curval > lastval;
+            });
+            field.type = max.key;
+            field.typeConfidence = field._inferredTypes[max.key] / field.numOfItems;
+
+            /*//TODO: improve this piece of code.
+             //LAT/LNG.
+             var fieldName = field.name.toLowerCase();
+             var isLatType = (field.type === DataTypeConverter.TYPES.LATITUDE.name);
+             var fieldNameContainsLat = fieldName.indexOf('lat') >= 0;
+             var fieldNameContainsLon = fieldName.indexOf('ng') >= 0; //It could be 'lng'.
+             if (isLatType == true && fieldNameContainsLat == false && fieldNameContainsLon == true) {
+             field.type = DataTypeConverter.TYPES.LONGITUDE.name;
+             }*/
+
+            //BOOLEAN.
+            /*var numOfValues = Object.keys(field._inferredValues).length;
+            if (field.type === DataTypeConverter.TYPES.TEXT.name) {
+                //if (numOfValues == 1) field.type = DataTypeConverter.TYPES.CONST.name;
+                //else if (numOfValues == 2) field.type = DataTypeConverter.TYPES.BOOL.name;
+                //else
+                if (numOfValues < field.numOfItems * 0.20) field.type = DataTypeConverter.TYPES.CATEGORY.name;
+            }*/
+        });
+    };//EndFunction.
+
+    /**
+     * Given a dataset value, it tries to recognise the data types.
+     * This is the central function within the library.
+     * @param value
+     * @returns {*}
+     * @private
+     */
+    var _processInferType = function(value) {
+        //value = value.toLocaleString();
+
+        if (value === null || typeof value == 'undefined')
+            return DataTypeConverter.TYPES.EMPTY;
+
+        if (typeof value === 'object')
+            return DataTypeConverter.TYPES.OBJECT;
+
+        //If the value starts with a zero and contains all numbers, it is
+        //inferred as textual content.
+        if (/^0[0-9]+$/.test(value))
+            return DataTypeConverter.TYPES.CODE;
+
+        //Try to parse the float.
+        var isnumber = DataTypesUtils.FilterFloat(value);
+        if (isNaN(isnumber) !== true) {//It is a number.
+            //If the number ranges from -90.0 to 90.0, the value is marked as Latitude.
+            //if (-90.0 <= isnumber && isnumber <= 90.0 && _dataTypesUtils.decimalPlaces(isnumber) >= 5)
+            //    return DataTypeConverter.TYPES.LATITUDE;
+
+            //It the number ranges from -180.0 to 180.0, the value is marked as Longitude.
+            //if (-180.0 <= isnumber && isnumber <= 180.0 && _dataTypesUtils.decimalPlaces(isnumber) >= 5)
+            //    return DataTypeConverter.TYPES.LONGITUDE;
+
+            /*if (0.0 <= isnumber && isnumber <= 100.0)
+                if(/^(\+)?((0|([1-9][0-9]*))\.([0-9]+))$/ .test(value))
+                    return DataTypeConverter.TYPES.PERCENTAGE;*/
+
+            return DataTypeConverter.TYPES.NUMBER;
+        }
+
+        var _date = DataTypesUtils.FilterDateTime(value);
+        if (isNaN(_date) == false && _date != null)
+            return DataTypeConverter.TYPES.DATETIME;
+
+
+        return DataTypeConverter.TYPES.TEXT;
+    };//EndFunction.
+
+    var jsonTraverse = function(json, fieldKeys, callback) {
+        var stack = [];
+        var numOfRows = 0;
+        stack.push({ item: json, fieldKeyIndex: 0 });
+
+        while (stack.length > 0) {
+            var stackTask = stack.pop();
+            var item = stackTask.item;
+            var fieldKeyIndex = stackTask.fieldKeyIndex;
+            var fieldKey = fieldKeys[fieldKeyIndex];
+
+            //Test fieldKey Value.
+            if (fieldKey == '*') {
+                var sProcessedKeys = fieldKeys.slice(0, fieldKeyIndex).toString();
+
+                ArrayUtils.IteratorOverKeys(item, function (value, key) {
+                    var curKey = sProcessedKeys + "," + key;
+                    var _value = callback(value, key, curKey, numOfRows);
+                    item[key] = _value;
+                });
+
+                numOfRows++;
+                continue;
+            }
+
+            var jsonSubtree = item[fieldKey];
+            if (Array.isArray(jsonSubtree)) { //It is an array.
+                for (var j=0; j<jsonSubtree.length; j++) {
+                    var jsonItem = jsonSubtree[j];
+                    stack.push({ item: jsonItem, fieldKeyIndex: fieldKeyIndex+1 });
+                }//EndForJ.
+            } else {
+                stack.push({ item: jsonSubtree, fieldKeyIndex: fieldKeyIndex+1 });
+            }
+        }//EndWhile.
+    };//EndFunction.
+
+    return {
+        constructor: DataTypeConverter,
+
+        /**
+         * It parses the json in input and converts the content
+         * in according to the inferred data types.
+         * @param json
+         * @param path Format: field1->field2->field3
+         */
+        convert: function (metadata) {
+            var lastRowIndex = 0;
+            var isRowInvalid = false;
+            var numOfRowsInvalid = 0;
+
+            var numOfRows = 0;
+            var numOfValues = 0;
+
+            var datasetErrors = 0;
+            var datasetMissingValues = 0;
+
+            jsonTraverse(metadata.dataset, metadata.fieldKeys, function(value, key, traversedKeys, rowIndex) {
+                var inferredType = metadata.types[traversedKeys];
+                numOfValues++;
+
+                if (lastRowIndex != rowIndex) {
+                    lastRowIndex = rowIndex;
+                    numOfRows++;
+                    //if (isRowInvalid) numOfRowsInvalid++;
+                }
+
+                if (value == null || typeof value == 'undefined' || (value + "").length == 0) {
+                    //datasetErrors++;
+                } //isRowInvalid = true;
+
+                if (inferredType.type == DataTypeConverter.TYPES.NUMBER.name) {
+                    var number = parseFloat(value);
+
+                    if (isNaN(number)) {
+                        datasetErrors++;
+                        return value;
+                    }
+
+                    return number;
+                }
+
+                return value;
+            });
+
+
+            metadata.qualityIndex.notNullValues = (numOfValues - datasetMissingValues) / numOfValues;
+            metadata.qualityIndex.errors = (numOfValues - datasetErrors) / numOfValues;
+
+            debugger;
+           return metadata;
+        },//EndFunction.
+
+        /**
+         * It parses the json and infers the data types.
+         * @param json
+         * @param path Array of field keys/names.
+         */
+        inferJsonDataType: function (json, fieldKeys) {
+            var stack = [];
+            var fieldsType = [];
+            var numOfRows = 0;
+
+            if (typeof fieldKeys == 'undefined')
+                throw "IllegalArgumentException: undefined json path to analyse.";
+
+            //Insert the first item (json root) within the stack.
+            stack.push({ item: json, fieldKeyIndex: 0 });
+
+            while (stack.length > 0) {
+                var stackTask = stack.pop();
+                var item = stackTask.item;
+                var fieldKeyIndex = stackTask.fieldKeyIndex;
+                var fieldKey = fieldKeys[fieldKeyIndex];
+
+                //Test fieldKey Value.
+                if (fieldKey == '*') {
+                    var sProcessedKeys = fieldKeys.slice(0, fieldKeyIndex).toString();
+
+                    ArrayUtils.IteratorOverKeys(item, function (item, key) {
+                        var inferredType = _processInferType(item);
+                        var curKey = sProcessedKeys + "," + key;
+
+                        var fieldType = ArrayUtils.TestAndSet(fieldsType, curKey, { name: curKey, _inferredTypes: [], _inferredValues: [], numOfItems: 0 });
+                        fieldType.numOfItems++;
+                        ArrayUtils.TestAndIncrement(fieldType._inferredTypes, inferredType.name);
+                        if (inferredType === DataTypeConverter.TYPES.TEXT)
+                            ArrayUtils.TestAndIncrement(fieldType._inferredValues, item);
+                        //if (inferredType === DataTypeConverter.TYPES.LATITUDE || inferredType === DataTypeConverter.TYPES.LONGITUDE)
+                        //    ArrayUtils.TestAndIncrement(fieldType._inferredTypes, DataTypeConverter.TYPES.NUMBER);
+
+                    });
+
+                    numOfRows++;
+                    continue;
+                }
+
+                var jsonSubtree = item[fieldKey];
+                if (Array.isArray(jsonSubtree)) { //It is an array.
+                    for (var j=0; j<jsonSubtree.length; j++) {
+                        var jsonItem = jsonSubtree[j];
+                        stack.push({ item: jsonItem, fieldKeyIndex: fieldKeyIndex+1 });
+                    }//EndForJ.
+                } else {
+                    stack.push({ item: jsonSubtree, fieldKeyIndex: fieldKeyIndex+1 });
+                }
+            }//EndWhile.
+
+            _analyseDataTypes(fieldsType);
+
+            //Data quality.
+            var quality = { homogeneity: 1 };
+            ArrayUtils.IteratorOverKeys(fieldsType, function(fieldType) {
+                quality.homogeneity *= fieldType.typeConfidence;
+            });
+
+            return { dataset: json, fieldKeys: fieldKeys, types: fieldsType, qualityIndex: quality };
+        },//EndFunction.
+
+        /*inferDataTypes: function (jsonRows) {
+            this._fields = [];
+            this._numOfRows = 0;
+            _processDataset(jsonRows);
+            return this._fields;
+        },//EndFunction.*/
+
+        /**
+         * Given in input a value, the function infers the data type.
+         * @param value
+         * @returns {*}
+         */
+        inferDataTypeOfValue: function (value) {
+            return _processInferType(value);
+        }//EndFunction.
+
+    };
+})();
+/*
+ ** This file is part of JSDataChecker.
+ **
+ ** JSDataChecker is free software: you can redistribute it and/or modify
+ ** it under the terms of the GNU General Public License as published by
+ ** the Free Software Foundation, either version 3 of the License, or
+ ** (at your option) any later version.
+ **
+ ** JSDataChecker is distributed in the hope that it will be useful,
+ ** but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ ** GNU General Public License for more details.
+ **
+ ** You should have received a copy of the GNU General Public License
+ ** along with JSDataChecker. If not, see <http://www.gnu.org/licenses/>.
+ **
+ ** Copyright (C) 2016 JSDataChecker - Donato Pirozzi (donatopirozzi@gmail.com)
+ ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
+ ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
+ **/
+
+function DataTypesUtils() {}
+
+DataTypesUtils.FilterTime = function (value) {
+    var expTime = /^[0-9]{2}:[0-9]{2}(:[0-9]{2})?(\+[0-9]{2}:[0-9]{2})?$/;
+    if (expTime.test(value) == false) return null;
+
+    var splitted = value.split(/[:|\+]/);
+
+    var expNumber = /^[0-9]{2}$/;
+    var HH = expNumber.test(splitted[0]) ? parseInt(splitted[0]) : 0;
+    var MM = expNumber.test(splitted[1]) ? parseInt(splitted[1]) : 0;
+    var SS = splitted.length >=3 && expNumber.test(splitted[2]) ? parseInt(splitted[2]) : 0;
+
+    var dt = new Date();
+    dt.setHours(HH);
+    dt.setMinutes(MM);
+    dt.setSeconds(SS);
+    return dt;
+}//EndFunction.
+
+DataTypesUtils.FilterDateTime = function (value) {
+    var _dtSplitted = value.split(/[T|\s]/);
+    if (_dtSplitted.length == 2) {
+        var dtTime = DataTypesUtils.FilterTime(_dtSplitted[1]);
+        if (dtTime == null) return null;
+
+        var dtDateTime = DataTypesUtils.FilterDate(_dtSplitted[0], dtTime);
+        return dtDateTime;
+    } else {
+        var dtDate = DataTypesUtils.FilterDate(value);
+        if (dtDate != null) return dtDate;
+
+        var dtTime = DataTypesUtils.FilterTime(value);
+        return dtTime;
+    }
+}//EndFunction.
+
+DataTypesUtils.FilterDate = function (value, dtDate) {
+    if (dtDate == null) dtDate = new Date();
+
+    //year-month.
+    if (/^[0-9][0-9][0-9][0-9]\-[0-9][0-9]$/.test(value)) {
+        var year = parseInt(value.substring(0, 4));
+        var month = parseInt(value.substring(5));
+        dtDate.setYear(year);
+        dtDate.setMonth(month);
+        return dtDate;
+    }
+
+    var expDate = /^[0-9]{4}(\-|\/)[0-9]{2}((\-|\/)[0-9]{2})?$/;
+    if (expDate.test(value)) {
+        var splitted = value.split(/[\-|\/]/);
+        var year = parseInt(splitted[0]);
+        var month = parseInt(splitted[1]);
+        var day = splitted.length == 3 ? parseInt(splitted[2]) : 0;
+        dtDate.setYear(year);
+        dtDate.setMonth(month);
+        dtDate.setDate(day);
+        return dtDate;
+    }
+
+    expDate = /^[0-9]{2}(\-|\/)[0-9]{2}(\-|\/)[0-9]{4}$/;
+    if (expDate.test(value)) {
+        var splitted = value.split(/[\-|\/]/);
+        var year = parseInt(splitted[2]);
+        var month = parseInt(splitted[1]);
+        var day = parseInt(splitted[0]);
+        dtDate.setYear(year);
+        dtDate.setMonth(month);
+        dtDate.setDate(day);
+        return dtDate;
+    }
+
+    return null;
+};//EndFunction.
+
+/**
+ * Converts the value in a number, NaN if it is not a number.
+ * @param value
+ * @returns {*}
+ */
+DataTypesUtils.FilterFloat = function (value) {
+    if(/^(\-|\+)?((0|([1-9][0-9]*))(\.[0-9]+)?|Infinity)$/
+            .test(value))
+        return Number(value);
+    return NaN;
+};//EndFunction.
+
+/**
+ * Solution from here:
+ * http://stackoverflow.com/questions/10454518/javascript-how-to-retrieve-the-number-of-decimals-of-a-string-number
+ * @param num
+ * @returns {number}
+ */
+DataTypesUtils.DecimalPlaces = function (num) {
+    var match = (''+num).match(/(?:\.(\d+))?(?:[eE]([+-]?\d+))?$/);
+    if (!match) { return 0; }
+    return Math.max(
+        0,
+        // Number of digits right of decimal point.
+        (match[1] ? match[1].length : 0)
+            // Adjust for scientific notation.
+        - (match[2] ? +match[2] : 0));
+}//EndFunction.
 \ No newline at end of file
+/*
+ ** This file is part of ChartViz.
+ **
+ ** ChartViz is free software: you can redistribute it and/or modify
+ ** it under the terms of the GNU General Public License as published by
+ ** the Free Software Foundation, either version 3 of the License, or
+ ** (at your option) any later version.
+ **
+ ** ChartViz is distributed in the hope that it will be useful,
+ ** but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ ** GNU General Public License for more details.
+ **
+ ** You should have received a copy of the GNU General Public License
+ ** along with ChartViz. If not, see <http://www.gnu.org/licenses/>.
+ **
+ ** Copyright (C) 2016 ChartViz - Donato Pirozzi (donatopirozzi@gmail.com)
+ ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
+ ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
+ **/
+
+function ODSApi() {
+}
+
+ODSApi.prototype = (function() {
+
+    var _arrUtil = new ArrayUtils();
+
+    var httpGetAsync = function(theUrl, callback, callbackOnFinish) {
+        //var asynch = typeof asynch === 'undefined' ? true : asynch;
+        var xhttp = new XMLHttpRequest();
+        xhttp.onreadystatechange = function() {
+            if (xhttp.readyState == 4 && xhttp.status == 200)
+                callback(theUrl, xhttp.responseText, callbackOnFinish);
+        };
+        xhttp.open("GET", theUrl, true);//true for asynchronous.
+        xhttp.send(null);
+    };//EndFunction.
+
+    var _processListOfDataset = function(baseUrl, requestContent, callbackOnFinish) {
+        var jsonContent = JSON.parse(requestContent);
+        var jsonDatasets = jsonContent.datasets;
+
+        var resultDatasets = [];
+
+        for (var i=0; i<jsonDatasets.length; i++) {
+            var jsonDataset = jsonDatasets[i];
+            var _title = jsonDataset.metas.title;
+            var _datasetId = jsonDataset.datasetid;
+            var _datasetUrl = "/api/records/1.0/search/?rows=1000&dataset=" + _datasetId;
+
+            var ds = { id: _datasetId, title: _title, url: _datasetUrl };
+            ds.fields = jsonDataset.fields;
+            resultDatasets.push(ds);
+        }
+
+        callbackOnFinish(resultDatasets);
+    };//EndFunction.
+
+    var _processDataset = function (dataset, requestContent, callbackOnFinish) {
+        var jsonContent = JSON.parse(requestContent);
+        var records = jsonContent.records;
+
+        if (typeof dataset !== 'undefined') {
+            dataset.rows = [];
+            for (var i=0; i<records.length; i++) {
+                var record = records[i];
+                dataset.rows.push(record.fields);
+            }//EndFor.
+        }
+
+        callbackOnFinish(dataset);
+    };//EndFunction.
+
+    return {
+        constructor: ODSApi,
+
+        listDatasets: function (theUrl, callbackOnFinish) {
+            theUrl = theUrl + "/api/datasets/1.0/search/?rows=-1";
+            httpGetAsync(theUrl, _processListOfDataset, callbackOnFinish);
+        },//EndFunction.
+
+        /*requestDataset: function (theUrl, callbackOnFinish) {
+            httpGetAsync(theUrl, _processDataset, callbackOnFinish);
+        }//EndFunction.*/
+
+        requestDataset: function (urlDomain, dataset, callbackOnFinish) {
+            var xhttp = new XMLHttpRequest();
+            xhttp.onreadystatechange = function() {
+                if (xhttp.readyState == 4 && xhttp.status == 200)
+                    _processDataset(dataset, xhttp.responseText, callbackOnFinish);
+            };
+            xhttp.open("GET", urlDomain + dataset.url, true);//true for asynchronous.
+            xhttp.send(null);
+        }//EndFunction.
+    };
+
+})();
 \ No newline at end of file
+/*
+ ** This file is part of ChartViz.
+ **
+ ** ChartViz is free software: you can redistribute it and/or modify
+ ** it under the terms of the GNU General Public License as published by
+ ** the Free Software Foundation, either version 3 of the License, or
+ ** (at your option) any later version.
+ **
+ ** ChartViz is distributed in the hope that it will be useful,
+ ** but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ ** GNU General Public License for more details.
+ **
+ ** You should have received a copy of the GNU General Public License
+ ** along with ChartViz. If not, see <http://www.gnu.org/licenses/>.
+ **
+ ** Copyright (C) 2016 ChartViz - Donato Pirozzi (donatopirozzi@gmail.com)
+ ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
+ ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
+ **/
+
+
+//This JS class allows the connection to a ckan platform.
+
+function CKANApi() {
+}//EndFunction.
+
+CKANApi.prototype = (function() {
+
+    var _arrUtil = new ArrayUtils();
+
+    var httpGetAsync = function(theUrl, callback) {
+        var xhttp = new XMLHttpRequest();
+        xhttp.onreadystatechange = function() {
+            if (xhttp.readyState == 4 && xhttp.status == 200)
+                _processListOfDataset(xhttp.responseText);
+        };
+        xhttp.open("GET", theUrl, true);//true for asynchronous.
+        xhttp.send(null);
+    };//EndFunction.
+
+    var _processListOfDataset = function(requestContent) {
+        var jsonContent = JSON.parse(requestContent);
+        if (jsonContent.success == false) return;
+        var ckanresults = jsonContent.result.results;
+
+
+        var datasetsCSV = [];
+        var arrFormatsSummary = [];
+
+        for (var i=0; i<ckanresults.length; i++) {
+            var result = ckanresults[i];
+            var resources = result.resources;
+            for (var j=0; j<resources.length; j++) {
+                var resource = resources[j];
+
+                var resourceFormat = resource.format;
+                _arrUtil.testAndIncrement(arrFormatsSummary, resourceFormat);
+
+                if (resourceFormat == "CSV")
+                    datasetsCSV.push({ id: resource.id, description: resource.description, url: resource.url });
+
+                //debugger;
+            }
+        }//EndFor.
+
+        console.log("...");
+    };//EndFunction.
+
+    //PUBLIC CLASS CONTENT.
+    return {
+        constructor: CKANApi,
+
+        listDatasets: function (urlBase) {
+            httpGetAsync(urlBase);
+        }//EndFunction.
+    };
+
+})();
 \ No newline at end of file
+/*
+ ** This file is part of ChartViz.
+ **
+ ** ChartViz is free software: you can redistribute it and/or modify
+ ** it under the terms of the GNU General Public License as published by
+ ** the Free Software Foundation, either version 3 of the License, or
+ ** (at your option) any later version.
+ **
+ ** ChartViz is distributed in the hope that it will be useful,
+ ** but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ ** GNU General Public License for more details.
+ **
+ ** You should have received a copy of the GNU General Public License
+ ** along with ChartViz. If not, see <http://www.gnu.org/licenses/>.
+ **
+ ** Copyright (C) 2016 ChartViz - Donato Pirozzi (donatopirozzi@gmail.com)
+ ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
+ ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
+ **/
+
+function DataTypeAnalyser() {}
+
+DataTypeAnalyser.TYPES = {
+    TEXT        : { value: 0, name: "TEXT" },
+    NUMBER      : { value: 1, name: "NUMBER" },
+    PERCENTAGE  : { value: 2, name: "PERCENTAGE" },
+
+    LATITUDE    : { value: 3, name: "LATITUDE" },
+    LONGITUDE   : { value: 4, name: "LONGITUDE" },
+    BOOL        : { value: 5, name: "BOOL"},
+    CONST       : { value: 6, name: "CONST" },
+    CATEGORY    : { value: 7, name: "CATEGORY" },
+
+    DATETIME    : { value: 8, name: "DATETIME" },
+    OBJECT      : { value: 100, name: "OBJECT" }
+};
+
+DataTypeAnalyser.prototype = (function () {
+
+    var _fields = [];
+    var _numOfRows = 0;
+    var _arrUtil = new ArrayUtils();
+    var _dataTypesUtils = new DataTypesUtils();
+
+    /***
+     * Make an asynchronous call to load the content.
+     * @param theUrl
+     * @param callback
+     */
+    var httpGetAsync = function(theUrl, callbackOnFinish) {
+        var xhttp = new XMLHttpRequest();
+        xhttp.onreadystatechange = function() {
+            if (xhttp.readyState == 4 && xhttp.status == 200)
+                _processDataset(xhttp.responseText, callbackOnFinish);
+        }
+        xhttp.open("GET", theUrl, true); // true for asynchronous
+        xhttp.send(null);
+    };//EndFunction.
+
+    var _processDataset = function (jsonRows) {
+        //Check if the jsonRow is an array.
+        if (Array.isArray(jsonRows) == false) return;
+
+        for (var i=0; i<jsonRows.length; i++) {
+            var jsonRow = jsonRows[i];
+            _processRow(jsonRow);
+        }//EndFor.
+
+        _dataTypeAnalyser(_fields);
+
+        return _fields;
+    };//EndFunction.
+
+    var _processRow = function(row) {
+        //Avoid empty rows
+        if (typeof row === 'undefined') return;
+
+        //Get the object keys.
+        for (var property in row) {
+            if (row.hasOwnProperty(property)) {
+                var cellValue = row[property];
+
+                //if (property == 'votantspourcentages') debugger;
+                //if (property == 'va_no_voie') debugger;
+
+                var inferredType = _processInferType(cellValue);
+
+                if (typeof _fields[property] === 'undefined')
+                    _fields[property] = { name: property, _inferredTypes: [], _inferredValues: [] };
+
+                _arrUtil.testAndIncrement(_fields[property]._inferredTypes, inferredType.name);
+                if (inferredType === DataTypeAnalyser.TYPES.TEXT)
+                    _arrUtil.testAndIncrement(_fields[property]._inferredValues, cellValue);
+                if (inferredType === DataTypeAnalyser.TYPES.LATITUDE || inferredType === DataTypeAnalyser.TYPES.LONGITUDE)
+                    _arrUtil.testAndIncrement(_fields[property]._inferredTypes, DataTypeAnalyser.TYPES.NUMBER);
+            }
+        }
+
+        _numOfRows++;
+    };//EndFunction.
+
+    var _dataTypeAnalyser = function(fields) {
+        _arrUtil.iteratorOverKeys(fields, function(field) {
+            var max = _arrUtil.findMinMax(field._inferredTypes, function (curval, lastval) {
+                return curval > lastval;
+            });
+            field.type = max.key;
+            field.typeConfidence = field._inferredTypes[max.key] / _numOfRows;
+
+            /*//TODO: improve this piece of code.
+            //LAT/LNG.
+            var fieldName = field.name.toLowerCase();
+            var isLatType = (field.type === DataTypeAnalyser.TYPES.LATITUDE.name);
+            var fieldNameContainsLat = fieldName.indexOf('lat') >= 0;
+            var fieldNameContainsLon = fieldName.indexOf('ng') >= 0; //It could be 'lng'.
+            if (isLatType == true && fieldNameContainsLat == false && fieldNameContainsLon == true) {
+                field.type = DataTypeAnalyser.TYPES.LONGITUDE.name;
+            }*/
+
+            //BOOLEAN.
+            var numOfValues = Object.keys(field._inferredValues).length;
+            if (field.type === DataTypeAnalyser.TYPES.TEXT.name) {
+                if (numOfValues == 1) field.type = DataTypeAnalyser.TYPES.CONST.name;
+                //else if (numOfValues == 2) field.type = DataTypeAnalyser.TYPES.BOOL.name;
+                else if (numOfValues < _numOfRows * 0.20) field.type = DataTypeAnalyser.TYPES.CATEGORY.name;
+            }
+        });
+    };//EndFunction.
+
+    /*var _dataTypeAnalyserField = function (field) {
+        var max = _arrUtil.findMinMax(field._inferredTypes, function (curval, lastval) {
+            return curval > lastval;
+        });
+        field.type = max.key;
+        field.typeConfidence = field._inferredTypes[max.key] / _numOfRows;
+
+        //TODO: improve this piece of code.
+        //LAT/LNG.
+        var fieldName = field.name.toLowerCase();
+        var isLatType = (field.type === ChartProcessor.TYPES.LATITUDE.name);
+        var fieldNameContainsLat = fieldName.indexOf('lat') >= 0;
+        var fieldNameContainsLon = fieldName.indexOf('ng') >= 0; //It could be 'lng'.
+        if (isLatType == true && fieldNameContainsLat == false && fieldNameContainsLon == true) {
+            field.type = ChartProcessor.TYPES.LONGITUDE.name;
+        }
+
+        //BOOLEAN.
+        var numOfValues = Object.keys(field._inferredValues).length;
+        if (field.type === ChartProcessor.TYPES.TEXT.name) {
+            if (numOfValues == 1) field.type = ChartProcessor.TYPES.CONST.name;
+            else if (numOfValues == 2) field.type = ChartProcessor.TYPES.BOOL.name;
+            else if (numOfValues < _numOfRows * 0.10) field.type = ChartProcessor.TYPES.CATEGORY.name;
+        }
+    };//EndFunction.*/
+
+    /**
+     * Given a dataset value, it tries to recognise the data types.
+     * This is the central function within the library.
+     * @param value
+     * @returns {*}
+     * @private
+     */
+    var _processInferType = function(value) {
+        //value = value.toLocaleString();
+
+        if (typeof value === 'object')
+            return DataTypeAnalyser.TYPES.OBJECT;
+
+        //Try to parse the float.
+        var isnumber = _dataTypesUtils.filterFloat(value);
+        if (isNaN(isnumber) !== true) {//It is a number.
+            //If the number ranges from -90.0 to 90.0, the value is marked as Latitude.
+            //if (-90.0 <= isnumber && isnumber <= 90.0 && _dataTypesUtils.decimalPlaces(isnumber) >= 5)
+            //    return DataTypeAnalyser.TYPES.LATITUDE;
+
+            //It the number ranges from -180.0 to 180.0, the value is marked as Longitude.
+            //if (-180.0 <= isnumber && isnumber <= 180.0 && _dataTypesUtils.decimalPlaces(isnumber) >= 5)
+            //    return DataTypeAnalyser.TYPES.LONGITUDE;
+
+            if (0.0 <= isnumber && isnumber <= 100.0)
+                if(/^(\+)?((0|([1-9][0-9]*))\.([0-9]+))$/ .test(value))
+                    return DataTypeAnalyser.TYPES.PERCENTAGE;
+
+            return DataTypeAnalyser.TYPES.NUMBER;
+        }
+
+        var _date = Date.parse(value);
+        if (isNaN(_date) == false)
+            return DataTypeAnalyser.TYPES.DATETIME;
+
+
+        return DataTypeAnalyser.TYPES.TEXT;
+    };//EndFunction.
+
+    return {
+        constructor: DataTypeAnalyser,
+
+        inferDataTypes: function (jsonRows) {
+            _fields = [];
+            _numOfRows = 0;
+            _processDataset(jsonRows);
+            return _fields;
+        },//EndFunction.
+
+        inferDataTypeOfValue: function (value) {
+            return _processInferType(value);
+        }//EndFunction.
+
+    };
+})();
+ /*
+ ** This file is part of ChartViz.
+ **
+ ** ChartViz is free software: you can redistribute it and/or modify
+ ** it under the terms of the GNU General Public License as published by
+ ** the Free Software Foundation, either version 3 of the License, or
+ ** (at your option) any later version.
+ **
+ ** ChartViz is distributed in the hope that it will be useful,
+ ** but WITHOUT ANY WARRANTY; without even the implied warranty of
+ ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ ** GNU General Public License for more details.
+ **
+ ** You should have received a copy of the GNU General Public License
+ ** along with ChartViz. If not, see <http://www.gnu.org/licenses/>.
+ **
+ ** Copyright (C) 2016 ChartViz - Donato Pirozzi (donatopirozzi@gmail.com)
+ ** Distributed under the GNU GPL v3. For full terms see the file LICENSE.
+ ** License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
+ **/
+
+//<INCLUDE>. Find a batter way to include dependent scripts.
+//document.write('<script type="text/javascript" src="ArrayUtils.js"></script>');
+//document.write('<script type="text/javascript" src="DataTypesUtils.js"></script>');
+
+function ChartProcessor() {
+}
+
+ChartProcessor.TYPES = {
+    TEXT        : { value: 0, name: "TEXT" },
+    NUMBER      : { value: 1, name: "NUMBER" },
+    LATITUDE    : { value: 2, name: "LATITUDE" },
+    LONGITUDE   : { value: 2, name: "LONGITUDE" },
+    BOOL        : { value: 3, name: "BOOL"},
+    CONST       : { value: 4, name: "BOOL" },
+    CATEGORY    : { value: 5, name: "CATEGORY" }
+};
+
+ChartProcessor.prototype = (function () {
+
+    var _fields = [];
+    var _numOfRows = 0;
+    var _arrUtil = new ArrayUtils();
+    var _dataTypesUtils = new DataTypesUtils();
+
+    /***
+     * Make an asynchronous call to load the content.
+     * @param theUrl
+     * @param callback
+     */
+    var httpGetAsync = function(theUrl, callbackOnFinish) {
+        var xhttp = new XMLHttpRequest();
+        xhttp.onreadystatechange = function() {
+            if (xhttp.readyState == 4 && xhttp.status == 200)
+                _processDataset(xhttp.responseText, callbackOnFinish);
+        }
+        xhttp.open("GET", theUrl, true); // true for asynchronous
+        xhttp.send(null);
+    };//EndFunction.
+
+    var _processDataset = function (datasetContent, callbackOnFinish) {
+        //Split the dataset rows.
+        var rows = datasetContent.split("\n");
+
+        //The assumption is that the first row is the header.
+        _processHeader(rows[0]);
+
+        //Loop through the dataset's rows.
+        var i;
+        for (i=1; i<rows.length; i++) {
+            var row = rows[i];
+            _processRow(row);
+        }//EndFor.
+
+        //It determines the type of each column.
+        var datasetsize = rows.length - 1;
+        _fields.map(function (field) {
+            var max = _arrUtil.findMinMax(field._inferredTypes, function (curval, lastval) {
+                return curval > lastval;
+            });
+            field.type = max.key;
+            field.typeConfidence = field._inferredTypes[max.key] / _numOfRows;
+
+            //TODO: improve this piece of code.
+            //LAT/LNG.
+            var fieldName = field.name.toLowerCase();
+            var isLatType = (field.type === ChartProcessor.TYPES.LATITUDE.name);
+            var fieldNameContainsLat = fieldName.indexOf('lat') >= 0;
+            var fieldNameContainsLon = fieldName.indexOf('ng') >= 0; //It could be 'lng'.
+            if (isLatType == true && fieldNameContainsLat == false && fieldNameContainsLon == true) {
+                field.type = ChartProcessor.TYPES.LONGITUDE.name;
+            }
+
+            //BOOLEAN.
+            var numOfValues = Object.keys(field._inferredValues).length;
+            if (field.type === ChartProcessor.TYPES.TEXT.name) {
+                if (numOfValues == 1) field.type = ChartProcessor.TYPES.CONST.name;
+                else if (numOfValues == 2) field.type = ChartProcessor.TYPES.BOOL.name;
+                else if (numOfValues < _numOfRows * 0.10) field.type = ChartProcessor.TYPES.CATEGORY.name;
+            }
+
+            console.log("ccc");
+        });
+
+        //Call the user function.
+        callbackOnFinish(_fields);
+    };//EndFunction.
+
+    var _processHeader = function(header) {
+        var fields = _processSplitRow(header);
+        fields.map( function(item) { _fields.push({ name: item, _inferredTypes: [], _inferredValues: [] }); });
+    };//EndFunction.
+
+    var _processRow = function(row) {
+        //Avoid empty rows
+        if (typeof row === 'undefined') return;
+        row = row.trim();
+        if (row.length == 0) return;
+
+        //Process the ROW.
+        var values = _processSplitRow(row);
+        var i;
+        for (i=0; i<values.length; i++) {//Loop on the row values.
+            var inferredType = _processInferType(values[i]);
+            _arrUtil.testAndIncrement(_fields[i]._inferredTypes, inferredType.name);
+            if (inferredType === ChartProcessor.TYPES.TEXT)
+                _arrUtil.testAndIncrement(_fields[i]._inferredValues, values[i]);
+            if (inferredType === ChartProcessor.TYPES.LATITUDE || inferredType === ChartProcessor.TYPES.LONGITUDE)
+                _arrUtil.testAndIncrement(_fields[i]._inferredTypes, ChartProcessor.TYPES.NUMBER);
+        }//EndFor.
+
+        _numOfRows++;
+    };//EndFunction.
+
+    /**
+     * Given a dataset value, it tries to recognise the data types.
+     * This is the central function within the library.
+     * @param value
+     * @returns {*}
+     * @private
+     */
+    var _processInferType = function(value) {
+        value = value.toLocaleString();
+
+        //Try to parse the float.
+        var isnumber = _dataTypesUtils.filterFloat(value);
+        if (isNaN(isnumber) !== true) {//It is a number.
+            //If the number ranges from -90.0 to 90.0, the value is marked as Latitude.
+            if (-90.0 <= isnumber && isnumber <= 90.0)
+                return ChartProcessor.TYPES.LATITUDE;
+
+            //It the number ranges from -180.0 to 180.0, the value is marked as Longitude.
+            if (-180.0 <= isnumber && isnumber <= 180.0)
+                return ChartProcessor.TYPES.LONGITUDE;
+
+            return ChartProcessor.TYPES.NUMBER;
+        }
+
+        return ChartProcessor.TYPES.TEXT;
+    };//EndFunction.
+
+    var _processSplitRow = function (row) {
+        return row.split(',');
+    };//EndFunction.
+
+    return {
+        constructor: ChartProcessor,
+
+        inferDataTypes: function (theUrl, callback) {
+            _fields = [];
+            _numOfRows = 0;
+            httpGetAsync(theUrl, callback);
+        }
+    };
+})();
+
+
+
+<html>
+<head>
+    <script type="text/javascript" src="../ArrayUtils.js"></script>
+    <script type="text/javascript" src="../DataTypesUtils.js"></script>
+    <script type="text/javascript" src="chartviz.js"></script>
+</head>
+<body>
+    <h3>Dataset Visualizer</h3>
+
+    Dataset URL: <input id="txtDatasetUrl" type="text" style="width: 75%;"
+            value="http://ckan.routetopa.eu/dataset/fce7b89c-4c36-47c4-a486-7df5307a884e/resource/1b675fb7-8c9a-46d0-8f80-3e28afe4f4b5/download/litterwardennonulls.csv">
+    <input id="btnLoad" type="button" value="Load dataset" onclick="btnLoad_OnClick();">
+
+    <br/>
+    <br>
+    <table border=1>
+        <thead>
+        <tr id="trHeader">
+
+        </tr>
+        <tr id="trHeaderType">
+
+        </tr>
+        </thead>
+        <tbody>
+
+        </tbody>
+    </table>
+
+    <script type="text/javascript">
+
+        window.onload = function() {
+            //var chartProcessor = new ChartProcessor();
+            //chartProcessor.inferDataTypes(urllnk);
+        }//EndFunction.
+
+        function btnLoad_OnClick() {
+            //Take the url from the input text.
+            var valDatasetUrl = document.getElementById('txtDatasetUrl').value;
+
+            var chartProcessor = new ChartProcessor();
+            chartProcessor.inferDataTypes(valDatasetUrl, update);
+        }//EndFunction.
+
+        function update(fields) {
+            console.log("update function.");
+
+            var trHeader = document.getElementById('trHeader');
+            for (var i=0;i<fields.length; i++) {
+                var field = fields[i];
+                var ntd = document.createElement("th");
+                ntd.innerHTML = field.name;
+                trHeader.appendChild(ntd);
+            }//EndFor.
+
+            var trHeaderType = document.getElementById('trHeaderType');
+            for (var i=0;i<fields.length; i++) {
+                var field = fields[i];
+                var ntd = document.createElement("th");
+                ntd.innerHTML = field.type + " (" + Math.round(field.typeConfidence * 100) + "%)";
+                trHeaderType.appendChild(ntd);
+            }//EndFor.
+        }//EndFunction.
+    </script>
+</body>
+</html>
 \ No newline at end of file
+<html>
+<head>
+
+    <script type="text/javascript" src="../bower_components/csvjson/csvjson.min.js"></script>
+
+    <script type="text/javascript" src="../src/ArrayUtils.js"></script>
+    <script type="text/javascript" src="../src/DataTypesUtils.js"></script>
+    <script type="text/javascript" src="../src/DataTypeConverter.js"></script>
+
+    <link rel="import" href="../bower_components/polymer/polymer.html">
+    <link rel="import" href="../bower_components/paper-progress/paper-progress.html">
+    <script type="text/javascript" src="../bower_components/webcomponentsjs/webcomponents-lite.min.js"></script>
+
+    <style is="custom-style">
+        paper-progress {
+            --paper-progress-active-color: #FFC107;
+            --paper-progress-container-color: white;
+            --paper-progress-height: 20px;
+            border: 1px solid black;
+        }
+    </style>
+</head>
+<body>
+    <h3>Dataset Visualizer</h3>
+
+    Dataset URL: <input id="txtDatasetUrl" type="text" style="width: 75%;"
+            value="http://ckan.routetopa.eu/dataset/fce7b89c-4c36-47c4-a486-7df5307a884e/resource/1b675fb7-8c9a-46d0-8f80-3e28afe4f4b5/download/litterwardennonulls.csv">
+    <input id="btnLoad" type="button" value="Load dataset" onclick="btnLoad_OnClick();">
+
+    <br/>
+
+
+
+
+    <table border="0">
+    <tr>
+        <td>Data homogeneity:</td>
+        <td><paper-progress id="barHomogeneity" value="0">sbiricuda</paper-progress></td>
+        <td id="barHomogeneityValue"></td>
+    </tr>
+
+    <!--<tr>
+        <td>Dataset Not Null Values:</td>
+        <td><paper-progress id="barNotNull" value="0">sbiricuda</paper-progress></td>
+        <td id="barNotNullValues"></td>
+    </tr>-->
+
+    <tr>
+        <td>Dataset Consistent Values:</td>
+        <td><paper-progress id="barErrors" value="0">sbiricuda</paper-progress></td>
+        <td id="barErrorsValues"></td>
+    </tr>
+    </table>
+
+
+    <br>
+    <table border=1>
+        <thead>
+        <tr id="trHeader">
+
+        </tr>
+        <tr id="trHeaderType">
+
+        </tr>
+        </thead>
+        <tbody id="tbody">
+
+        </tbody>
+    </table>
+
+    <script type="text/javascript">
+
+        window.onload = function() {
+            //var chartProcessor = new ChartProcessor();
+            //chartProcessor.inferDataTypes(urllnk);
+        }//EndFunction.
+
+        var httpGetAsync = function(theUrl, callback) {
+            var xhttp = new XMLHttpRequest();
+            xhttp.onreadystatechange = function() {
+                if (xhttp.readyState == 4 && xhttp.status == 200)
+                    callback(xhttp.responseText);
+            };
+            xhttp.open("GET", theUrl, true); // true for asynchronous
+            xhttp.send(null);
+        };//EndFunction.
+
+        function btnLoad_OnClick() {
+        //Take the url from the input text.
+        var valDatasetUrl = document.getElementById('txtDatasetUrl').value;
+
+        //Call Ajax to load the dataset content.
+        httpGetAsync(valDatasetUrl, update);
+        };//EndFunction.
+
+        function update(csvContent) {
+            console.log("update function.");
+            var _arrUtils = new ArrayUtils();
+
+            var reader =  new csvjson();
+            var jsonDataset = reader.read(csvContent);
+
+            var _converter = new DataTypeConverter();
+            var path = [ "records", "*" ];
+            var processingResult = _converter.inferJsonDataType(jsonDataset, path);
+            var types = processingResult.types;
+
+            //Create the header table.
+            var trHeader = document.getElementById('trHeader');
+            ArrayUtils.IteratorOverKeys(types, function(field) {
+                var ntd = document.createElement("th");
+                ntd.innerHTML = field.name;
+                trHeader.appendChild(ntd);
+            });
+
+            debugger;
+            var trHeaderType = document.getElementById('trHeaderType');
+            ArrayUtils.IteratorOverKeys(types, function(field){
+                var ntd = document.createElement("th");
+                ntd.innerHTML = field.type + " (" + Math.round(field.typeConfidence * 100 * 100) / 100 + "%)";
+                trHeaderType.appendChild(ntd);
+            });
+
+            var processingResults = _converter.convert(processingResult);
+
+            var percentage = processingResult.qualityIndex.homogeneity*100;
+            var barHomogeneity = document.getElementById("barHomogeneity");
+            barHomogeneity.setAttribute("value", percentage);
+            document.getElementById("barHomogeneityValue").innerHTML = Math.round(percentage*100)/100 + "%";
+
+            /*var percentage = processingResult.qualityIndex.notNullValues*100;
+            var barConsistency = document.getElementById("barNotNull");
+            barConsistency.setAttribute("value", percentage);
+            document.getElementById("barNotNullValues").innerHTML = Math.round(percentage*100)/100 + "%";*/
+
+            var percentage = processingResult.qualityIndex.errors*100;
+            var barConsistency = document.getElementById("barErrors");
+            barConsistency.setAttribute("value", percentage);
+            document.getElementById("barErrorsValues").innerHTML = Math.round(percentage*100)/100 + "%";
+
+        }//EndFunction.
+    </script>
+</body>
+</html>
 \ No newline at end of file
@@ -29,6 +29,7 @@
 -->
  
 <link rel="import" href="../base-datalet/base-datalet.html">
+<script type="text/javascript" src="../../bower_components/jsdatachecker/jsdatachecker.min.js"></script>
  
 <!--
 The `base-ajax-json-jsonpath-datalet` extend the base component and define the mechanism to access and select data.
@@ -83,9 +83,8 @@ var AjaxJsonAlasqlBehavior = {
      * @method selectData
      */
     selectData : function() {
-        var jsonData = [this.properties.json_results.value];
-
         this._component.fields = JSON.parse(this._component.fields);
+        var provider = this._getProvider(this._component.fields[0]);
  
         var filters = JSON.parse(this._component.getAttribute("filters"));
         var aggregators = JSON.parse(this._component.getAttribute("aggregators"));
@@ -98,14 +97,23 @@ var AjaxJsonAlasqlBehavior = {
             orders = orders[0];
         }
  
-        var provider = this._getProvider(this._component.fields[0]);
-
-        var path = this._path(this._component.fields[0], provider);
-
         var fields = [];
         for (var i=0; i < this._component.fields.length; i++)
             fields.push(this._fieldName(this._component.fields[i], provider));
  
+        //if(aggregators)
+        //    for (var i=0; i < aggregators.length; i++)
+        //        aggregators[i]["field"] = this._fieldName(aggregators[i]["field"], provider);
+
+        //var jsonData = [this.properties.json_results.value];
+
+        //jsdatachecker
+        var _converter = new DataTypeConverter();
+        var path2 = this._arrayPath(provider);
+        var processingResult = _converter.inferJsonDataType(this.properties.json_results.value, path2);
+        var processingResults = _converter.convert(processingResult);
+        var jsonData = [processingResults.dataset];
+
         //WHERE
         var where = "";
         if(filters && filters.length) {
@@ -127,14 +135,12 @@ var AjaxJsonAlasqlBehavior = {
             where = where.slice(0, -5);
         }
  
-        provider="";
-
         //ORDER BY
         var orderBy = "";
         if(orders && orders.length) {
  
             for (var i=0; i < orders.length; i++)
-                orders[i]["field"] = this._fieldName(orders[i]["field"], provider);
+                orders[i]["field"] = this._fieldName(orders[i]["field"], "");
  
             orderBy = "ORDER BY ";
             for (var i = 0; i < orders.length; i++)
@@ -143,56 +149,49 @@ var AjaxJsonAlasqlBehavior = {
         }
  
         //SELECT
-        var select = "SELECT ";
+        var pureSelect = "SELECT ";
         for (var i = 0; i < fields.length; i++)
-            select += fields[i] + " as " + this._fieldName(this._component.fields[i], "") + ", ";
-        select = select.slice(0, -2);
-
-        var pureSelect = select;
-
-        /**/
-        var res = alasql("SELECT "+ path +" FROM ?", [jsonData]);
-        var records = res[0][path];
-        var obj = alasql(pureSelect + " FROM ?", [records]);
-        //console.log(obj);
+            pureSelect += fields[i] + " as " + this._fieldName(this._component.fields[i], "") + ", ";
+        pureSelect = pureSelect.slice(0, -2);
  
-        var select = "SELECT ";
-        for (var i = 0; i < fields.length; i++) {
-            var key = Object.keys(obj[0])[i];
-            var v = obj[0][key];
-            //if (!isNaN(v))
-            //    select += fields[i] + "::NUMBER as " + this._fieldName(this._component.fields[i], "") + ", ";
-            //else
-            //    select += fields[i] + " as " + this._fieldName(this._component.fields[i], "") + ", ";
-
-            //omg!
-            var key2 = "["+key+"]";
-            if(fields[0].indexOf("->") > -1)
-                key2 = "fields->["+key+"]";
-            if (!isNaN(v))
-                select += key2 + "::NUMBER as " + this._fieldName(key, "") + ", ";
-            else
-                select += key2 + " as " + this._fieldName(key, "") + ", ";
-        }
-        select = select.slice(0, -2);
-
-        var pureSelect = select;
-        /**/
+        //GROUP BY
+        //var groupBy = "";
+        //if(aggregators && aggregators.length) {
+        //
+        //    for (var i=0; i < aggregators.length; i++)
+        //        aggregators[i]["field"] = this._fieldName(aggregators[i]["field"], provider);
+        //
+        //    groupBy = "GROUP BY " + aggregators[0]["field"];
+        //    select = "SELECT "  + aggregators[0]["field"];
+        //    for (var i = 1; i < aggregators.length; i++)
+        //        select += ", " + aggregators[i]["operation"] + "(" + aggregators[i]["field"] + ") as " + aggregators[i]["field"];
+        //}
+
+        //var groupBy = "";
+        //if(aggregators && aggregators.length) {
+        //
+        //    groupBy = "GROUP BY " + this._fieldName(aggregators[0]["field"], "");
+        //    select = "SELECT "  + this._fieldName(aggregators[0]["field"], provider) + " as " + this._fieldName(aggregators[0]["field"], "");
+        //    for (var i = 1; i < aggregators.length; i++)
+        //        select += ", " + aggregators[i]["operation"] + "(" + this._fieldName(aggregators[i]["field"], provider) + ") as " + this._fieldName(aggregators[i]["field"], "");
+        //}
  
         //GROUP BY
         var groupBy = "";
         if(aggregators && aggregators.length) {
  
             for (var i=0; i < aggregators.length; i++)
-                aggregators[i]["field"] = this._fieldName(aggregators[i]["field"], provider);
+                aggregators[i]["field"] = this._fieldName(aggregators[i]["field"], "");
  
             groupBy = "GROUP BY " + aggregators[0]["field"];
-            select = "SELECT "  + aggregators[0]["field"];
+            var select = "SELECT "  + aggregators[0]["field"];
             for (var i = 1; i < aggregators.length; i++)
                 select += ", " + aggregators[i]["operation"] + "(" + aggregators[i]["field"] + ") as " + aggregators[i]["field"];
         }
  
         //QUERY
+        var path = this._path(this._component.fields[0], provider);
+
         console.log('SELECT '+ path +' FROM ?');
         var res = alasql("SELECT "+ path +" FROM ?", [jsonData]);
  
@@ -206,40 +205,37 @@ var AjaxJsonAlasqlBehavior = {
  
         if (groupBy != "") {
             console.log(select + ' FROM ? ' + groupBy + ' ' + orderBy + '');
-            var obj = alasql(select + " FROM ? " + groupBy + " " + orderBy + "", [obj]);
+            obj = alasql(select + " FROM ? " + groupBy + " " + orderBy + "", [obj]);
         }
  
-        //multiserie test
+        //TEST
         //var query = "SELECT [preteur], [annee] as [annee], SUM([capital_restant_du]) as [capital_restant_du] FROM ? GROUP BY [preteur], [annee]"
         //var obj = alasql(query, [obj]);
         //console.log(obj);
         //this.data = obj;
  
-
         //PUSH DATA
         if(!obj || obj.length == 0)
             this.data = []
         else
-            this._pushData(obj);
+            this._pushData(obj, fields);
  
         this._deleteWaitImage();
     },
  
-    _pushData : function(obj) {
+    _pushData : function(obj, keys) {
         this.data = [];
  
-        for (var key in Object.keys(obj[0])){
+        if (typeof keys == 'undefined')
+            keys = Object.keys(obj[0]);
+
+        for (var key in keys){
  
-            var name = Object.keys(obj[0])[key];
+            var name = keys[key].replace(/(\[|\]|fields->)/g, "");
             var data = [];
-            var value;
  
             for (var i in obj) {
                 data.push(obj[i][name]);
-                //value = obj[i][name];
-                //if(!isNaN(value) && value != "")
-                //    value = parseFloat(obj[i][name]);
-                //data.push(value);
             }
  
             this.data.push({
@@ -263,10 +259,10 @@ var AjaxJsonAlasqlBehavior = {
             return "[" + field.substring(field.lastIndexOf(",") + 1, field.length) + "]";
         }
         else if(provider.indexOf("openDataSoft") > -1) {
-            return "fields->["+field.substring(field.lastIndexOf(",")+1, field.length)+"]";
+            return "fields->[" + field.substring(field.lastIndexOf(",") + 1, field.length)+ "]";
         }
         else {
-            return "["+field.substring(field.lastIndexOf(",")+1, field.length)+"]";
+            return "[" + field.substring(field.lastIndexOf(",") + 1, field.length) + "]";
         }
     },
  
@@ -282,6 +278,18 @@ var AjaxJsonAlasqlBehavior = {
         }
     },
  
+    _arrayPath : function(provider) {
+        if(provider.indexOf("ckan") > -1) {
+            return ["result", "records", "*"];
+        }
+        else if(provider.indexOf("openDataSoft") > -1) {
+            return ["records", "fields", "*"];
+        }
+        else {
+            return ["*"];
+        }
+    },
+
     /**
      * Delete a image after loading a datalet
      */
+/*
+@license
+    The MIT License (MIT)
+
+    Copyright (c) 2015 Dipartimento di Informatica - Universit� di Salerno - Italy
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in
+    all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+    THE SOFTWARE.
+*/
+
+/**
+ * Developed by :
+ * ROUTE-TO-PA Project - grant No 645860. - www.routetopa.eu
+ *
+*/
+
+
+var AjaxJsonAlasqlBehavior = {
+
+    properties: {
+
+        /**
+         * It contains the json data from async xhr call returned from core-ajax core component
+         *
+         * @attribute json_results
+         * @type object
+         * @default 'null'.
+         */
+        json_results: {
+            type: Object,
+            value: {}
+        }
+
+    },
+
+    /**
+     * Make an AJAX call to the dataset URL
+     *
+     * @method requestData
+     */
+    requestData: function(){
+
+        var comp = this;
+
+        $.ajax({
+            url: this._component.dataUrl,
+            dataType: "json",
+            success: function(e){
+                comp.handleResponse(e);
+            }
+        });
+    },
+
+    /**
+     * Called when core-ajax component receive the json data from called url.
+     *
+     * @method handleResponse
+     */
+    handleResponse: function(e) {
+        this.properties.json_results.value = e;
+        this.runWorkcycle();
+    },
+
+    /**
+     * selectData built a JSONPATH query based on the user selected fields then extract data from the JSON response.
+     * This method built an objects <name, data> for every user selected field and push it into the data array.
+     *
+     * @method selectData
+     */
+    selectData : function() {
+        var jsonData = [this.properties.json_results.value];
+
+        this._component.fields = JSON.parse(this._component.fields);
+
+        var filters = JSON.parse(this._component.getAttribute("filters"));
+        var aggregators = JSON.parse(this._component.getAttribute("aggregators"));
+        var orders = JSON.parse(this._component.getAttribute("orders"));
+
+        //preview my space
+        if(filters && filters[0] && filters[0].constructor == Array){
+            filters = filters[0];
+            aggregators = aggregators[0];
+            orders = orders[0];
+        }
+
+        var provider = this._getProvider(this._component.fields[0]);
+
+        var path = this._path(this._component.fields[0], provider);
+
+        var fields = [];
+        for (var i=0; i < this._component.fields.length; i++)
+            fields.push(this._fieldName(this._component.fields[i], provider));
+
+        //WHERE
+        var where = "";
+        if(filters && filters.length) {
+
+            for (var i=0; i < filters.length; i++)
+                filters[i]["field"] = this._fieldName(filters[i]["field"], provider);
+
+            where = "WHERE ";
+            for (var i=0; i < filters.length; i++) {
+                if(filters[i]["operation"] == "contains")
+                    where += filters[i]["field"] + " like '%" + filters[i]["value"] + "%' AND ";
+                else if(filters[i]["operation"] == "start")
+                    where += filters[i]["field"] + " like '" + filters[i]["value"] + "%' AND ";
+                else if(filters[i]["operation"] == "ends")
+                    where += filters[i]["field"] + " like '%" + filters[i]["value"] + "' AND ";
+                else
+                    where += filters[i]["field"] + " " + filters[i]["operation"] + " " + filters[i]["value"] + " AND ";
+            }
+            where = where.slice(0, -5);
+        }
+
+        provider="";
+
+        //ORDER BY
+        var orderBy = "";
+        if(orders && orders.length) {
+
+            for (var i=0; i < orders.length; i++)
+                orders[i]["field"] = this._fieldName(orders[i]["field"], provider);
+
+            orderBy = "ORDER BY ";
+            for (var i = 0; i < orders.length; i++)
+                orderBy += orders[i]["field"] + " " + orders[i]["operation"] + ", ";
+            orderBy = orderBy.slice(0, -2);
+        }
+
+        //SELECT
+        var select = "SELECT ";
+        for (var i = 0; i < fields.length; i++)
+            select += fields[i] + " as " + this._fieldName(this._component.fields[i], "") + ", ";
+        select = select.slice(0, -2);
+
+        var pureSelect = select;
+
+        /**/
+        var res = alasql("SELECT "+ path +" FROM ?", [jsonData]);
+        var records = res[0][path];
+        var obj = alasql(pureSelect + " FROM ?", [records]);
+        //console.log(obj);
+
+        var select = "SELECT ";
+        for (var i = 0; i < fields.length; i++) {
+            var key = Object.keys(obj[0])[i];
+            var v = obj[0][key];
+            if (!isNaN(v))
+                select += fields[i] + "::NUMBER as " + this._fieldName(this._component.fields[i], "") + ", ";
+            else
+                select += fields[i] + " as " + this._fieldName(this._component.fields[i], "") + ", ";
+
+            //omg!
+            //var key2 = "["+key+"]";
+            //if(fields[0].indexOf("->") > -1)
+            //    key2 = "fields->["+key+"]";
+            //if (!isNaN(v))
+            //    select += key2 + "::NUMBER as " + this._fieldName(key, "") + ", ";
+            //else
+            //    select += key2 + " as " + this._fieldName(key, "") + ", ";
+        }
+        select = select.slice(0, -2);
+
+        var pureSelect = select;
+        /**/
+
+        //GROUP BY
+        var groupBy = "";
+        if(aggregators && aggregators.length) {
+
+            for (var i=0; i < aggregators.length; i++)
+                aggregators[i]["field"] = this._fieldName(aggregators[i]["field"], provider);
+
+            groupBy = "GROUP BY " + aggregators[0]["field"];
+            select = "SELECT "  + aggregators[0]["field"];
+            for (var i = 1; i < aggregators.length; i++)
+                select += ", " + aggregators[i]["operation"] + "(" + aggregators[i]["field"] + ") as " + aggregators[i]["field"];
+        }
+
+        //QUERY
+        console.log('SELECT '+ path +' FROM ?');
+        var res = alasql("SELECT "+ path +" FROM ?", [jsonData]);
+
+        var records = res[0][path];
+
+        //console.log(select + ' FROM ? ' + where + ' ' + groupBy + ' ' + orderBy + '');
+        //var obj = alasql(select + " FROM ? " + where + " " + groupBy + " " + orderBy + "", [records]);
+
+        console.log(pureSelect + ' FROM ? ' + where);
+        var obj = alasql(pureSelect + " FROM ? " + where, [records]);
+
+        if (groupBy != "") {
+            console.log(select + ' FROM ? ' + groupBy + ' ' + orderBy + '');
+            var obj = alasql(select + " FROM ? " + groupBy + " " + orderBy + "", [obj]);
+        }
+
+        //multiserie test
+        //var query = "SELECT [preteur], [annee] as [annee], SUM([capital_restant_du]) as [capital_restant_du] FROM ? GROUP BY [preteur], [annee]"
+        //var obj = alasql(query, [obj]);
+        //console.log(obj);
+        //this.data = obj;
+
+
+        //PUSH DATA
+        if(!obj || obj.length == 0)
+            this.data = []
+        else
+            this._pushData(obj);
+
+        this._deleteWaitImage();
+    },
+
+    _pushData : function(obj) {
+        this.data = [];
+
+        for (var key in Object.keys(obj[0])){
+
+            var name = Object.keys(obj[0])[key];
+            var data = [];
+            var value;
+
+            for (var i in obj) {
+                data.push(obj[i][name]);
+                //value = obj[i][name];
+                //if(!isNaN(value) && value != "")
+                //    value = parseFloat(obj[i][name]);
+                //data.push(value);
+            }
+
+            this.data.push({
+                name: name,
+                data: data
+            });
+        }
+    },
+
+    _getProvider : function(field) {
+        if(field.indexOf("result,records") > -1)
+            return "ckan";
+        else if(field.indexOf("records,fields") > -1)
+            return "openDataSoft";
+        else
+            return "provider";
+    },
+
+    _fieldName : function(field, provider) {
+        if(provider.indexOf("ckan") > -1) {
+            return "[" + field.substring(field.lastIndexOf(",") + 1, field.length) + "]";
+        }
+        else if(provider.indexOf("openDataSoft") > -1) {
+            return "fields->["+field.substring(field.lastIndexOf(",")+1, field.length)+"]";
+        }
+        else {
+            return "["+field.substring(field.lastIndexOf(",")+1, field.length)+"]";
+        }
+    },
+
+    _path : function(field, provider) {
+        if(provider.indexOf("ckan") > -1) {
+            return "result->records"
+        }
+        else if(provider.indexOf("openDataSoft") > -1) {
+            return "records";
+        }
+        else {
+            return field.substring(0, field.lastIndexOf(",")).replace(",", "->");
+        }
+    },
+
+    /**
+     * Delete a image after loading a datalet
+     */
+    _deleteWaitImage : function() {
+        $("img[src$='spin.svg']").remove();
+    }
+
+};
 \ No newline at end of file