Commits

Rhys ! committed 22e03a7

first commit

Comments (0)

Files changed (8)

+syntax: regexp
+
+^\.settings/
+^\.project
+^\.pydevproject
+
+syntax: glob
+
+*.pyc
+*.pyo
+*.sassc
+*.scssc
+rdflib
+simplejson
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+# -*- coding: UTF-8 -*-
+#--------------------------------------------------------------------------------
+# The Oort BSD-style License
+#
+# Copyright (c) 2006, 2007 Niklas Lindström <lindstream@gmail.com>.
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#     * Redistributions of source code must retain the above copyright notice,
+#       this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimer in the documentation
+#       and/or other materials provided with the distribution.
+#     * Neither the name of Oort nor the names of its contributors
+#       may be used to endorse or promote products derived from this software
+#       without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#--------------------------------------------------------------------------------
+#=======================================================================
+
+
+class autosuper(type):
+    """
+    Use this as a metaclass for types to set the magic attribute '__super' on
+    them. When this is accessed through self the result is an object
+    constructed as if super(ThisType, self) had been called. (Makes it a little
+    bit more like in Python 3, where super() will work like this attribute.)
+    """
+    def __init__(cls, name, bases, members):
+        super(autosuper, cls).__init__(name, bases, members)
+        setattr(cls, "_%s__super" % name, super(cls))
+
+
+#=======================================================================
+
+
+def init_slots(obj, *args, **kwargs):
+    data = dict(zip(obj.__slots__, args))
+    data.update(kwargs)
+    for a in obj.__slots__:
+        setattr(obj, a, data.get(a, None))
+
+class SlotStruct(object):
+    """
+    Base class for making "struct" types with members defined by their
+    __slots__ value. Example:
+
+        >>> class Item(SlotStruct):
+        ...     __slots__ = 'first', 'last'
+
+        >>> item1 = Item(first='a', last='b')
+        >>> item1.first, item1.last
+        ('a', 'b')
+
+        >>> item1.middle = '-'
+        Traceback (most recent call last):
+        ...
+        AttributeError: 'Item' object has no attribute 'middle'
+
+        >>> item2 = Item('a', 'b')
+        >>> assert (item1.first, item1.last) == (item2.first, item2.last)
+
+        >>> assert item1.make_dict() == {'first': 'a', 'last': 'b'}
+
+    """
+    __slots__ = ()
+    def __init__(self, *args, **kwargs):
+        init_slots(self, *args, **kwargs)
+    def __str__(self):
+        return "%s instance with %s" % (type(self).__name__, str(self.make_dict()))
+    def make_dict(self):
+        return dict([(a, getattr(self, a)) for a in self.__slots__])
+
+
+#=======================================================================
+
+
+def property_with_setter(fset):
+    attr = '_%s' % fset.func_name
+    return property(lambda self: getattr(self, attr),
+            fset, doc=fset.__doc__)
+
+
+#=======================================================================
+
+
+def call(caller, *args):
+    def decorator(decorated):
+        callArgs = [(arg, decorated)[arg is call] for arg in args]
+        caller(*callArgs)
+        return call
+    return decorator
+
+
+#=======================================================================
+
+
+class BooleanDecorator(object):
+    """
+    A documentation helper. Usage:
+
+        >>> contract = BooleanDecorator('interface')
+        >>> class T:
+        ...     @contract.interface
+        ...     def action(self): raise NotImplementedError
+        ...
+        >>> assert T.action.interface == True
+    """
+
+    __slots__ = ('attributes')
+
+    def __init__(self, *args):
+        self.attributes = args
+
+    def __getattr__(self, name):
+        if name not in self.attributes:
+            raise Exception("Unknown attribute: %s" % name)
+        def decorator(func):
+            setattr(func, name, True)
+            return func
+        return decorator
+
+contract = BooleanDecorator('template_method', 'default_method', 'helper', 'state_change')
+
+
+def attrs(**kwargs):
+    """
+    Generic decorator for setting attributes. Usage:
+
+        >>> @attrs(value="A value", thing=None, other=True)
+        ... def f(): pass
+        ...
+        >>> assert f.value == "A value"
+        >>> assert f.thing is None
+        >>> assert f.other is True
+    """
+    def decorator(func):
+        # TODO: or just func.__dict__.update(kwargs)
+        for key, value in kwargs.items():
+            setattr(func, key, value)
+        return func
+    return decorator
+
+
+#    Opik RDF object mapper
+#    Copyright (C) 2011 Rhys !
+#
+#    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/>.
+
+from itertools import chain
+import simplejson as json
+
+from rdflib import URIRef, BNode, Literal
+from rdflib import Graph as _Graph
+
+from rdfview import RdfQuery, one, each
+from namespaces import RDF, DCTERMS, prefixes
+
+class Term(URIRef):
+    namespace = None
+    prefix = None
+
+def curie(uri, terms, prefixes, value=None):
+    for prefix, u in prefixes.iteritems():
+        if uri.startswith(u):
+            term = uri[len(u):]
+            if term in terms:
+                if 'from' in terms[term]:
+                    if terms[term]['from'] != prefix:
+                        raise ValueError('Term collision: new term %s from %s collides with term %s from %s.' % (term, prefix, term, terms[term]['from']))
+                else:
+                    raise ValueError('Cannot determine where term %s is from.' % term)
+            elif value:
+                many = isinstance(value, list)
+                if many:
+                    value = value[0]
+                if isinstance(value, Term):
+                    terms[term] = {'from': prefix, 'symbol': True, 'many': many}
+                elif isinstance(value, URIRef):
+                    terms[term] = {'from': prefix, 'reference': True, 'many': many}
+                else:
+                    terms[term] = {'from': prefix, 'many': many}
+            else:
+                terms[term] = {'from': prefix}
+            to = Term(term)
+            to.namespace = u
+            to.prefix = prefix
+            return to, terms
+    return uri, terms
+            
+class Graph(_Graph):
+    def absorb(self, graph):
+        for ns in graph.namespaces():
+            self.bind(*ns)
+        self.addN((s[0], s[1], s[2], self) for s in graph)
+
+class RDFDoc(object):
+    def __init__(self, resources=[], uri=None, isPartOf=None):
+        self.defined = {}
+        self.nss = {}
+        self.prefixes = {}
+        self.resources = resources
+        self.uri = uri
+        self.isPartOf = isPartOf
+        super(RDFDoc, self).__init__()
+
+    def __iter__(self):
+        for r in self.resources:
+            yield r
+
+    def add(self, resource):
+        self.resources.append(resource)
+
+    def extend(self, resources):
+        self.resources.extend(resources)
+
+    def to_graph(self):
+        g = Graph()
+        map(g.absorb, map(lambda r: r.to_graph(), self.resources))
+        return g
+
+    def serialize(self, format='pretty-xml', uri=None, isPartOf=None, **kwargs):
+        if format == 'json':
+            return self.to_json(**kwargs)
+        else:
+            if format == 'pretty-xml' and 'max_depth' not in kwargs:
+                kwargs['max_depth'] = 1
+            g = self.to_graph()
+            uri, isPartOf = uri or self.uri, isPartOf or self.isPartOf
+            if uri and isPartOf:
+                data = Data(uri)
+                data.isPartOf = isPartOf
+                g.absorb(data.to_graph())
+            return g.serialize(format=format, **kwargs)
+
+    def _upd(self, t, value=None):
+        if isinstance(t, URIRef):
+            t, self.defined = curie(t, self.defined, self.prefixes, value=value)
+            if isinstance(t, Term):
+                if t.prefix not in self.nss:
+                    self.nss[t.prefix] = t.namespace
+        return t
+
+    to_dictables = __iter__
+
+    def to_tree(self):
+        for r in chain(*map(lambda r: r.to_dictables(), self.resources)):
+            self.prefixes.update(r.prefixes)
+        self.defined, self.nss, linked = {}, {}, {}
+        for r in chain(*map(lambda r: r.to_dictables(), self.resources)):
+            d = r.to_dict_untyped()
+            uri = r.uri
+            linked[uri] = {}
+            for p, ol in d.iteritems():
+                if isinstance(ol, list):
+                    for n, o in enumerate(ol):
+                        ol[n] = self._upd(o)
+                else:
+                    ol = self._upd(ol)
+                p = self._upd(p, value=ol)
+                linked[uri][p] = ol
+        return {
+            'profile': {
+                'prefix': self.nss,
+                'define': self.defined
+            },
+            'linked': linked
+        }
+
+    def _json_conv(self, d):
+        n = {}
+        for k, v in d.iteritems():
+            if isinstance(k, Literal) and k.language:
+                k = {'@' + k.language: k}
+            if isinstance(v, Literal) and v.language:
+                v = {'@' + v.language: v}
+            elif isinstance(v, dict):
+                v = self._json_conv(v)
+            n[k] = v
+        return n
+
+    def to_json(self, ensure_ascii=False, indent=None, separators=(',', ':'), **kwargs):
+        return json.dumps(self._json_conv(self.to_tree()), ensure_ascii=ensure_ascii, indent=indent, separators=separators, **kwargs)
+
+class one_uri(one):
+    def type_raw_value(self, value, lang):
+        if isinstance(value, URIRef) or not value:
+            return value
+        else:
+            return URIRef(value)
+
+class each_uri(each):
+    def __get__(self, rdfQueryInstance, rdfQueryOwnerClass=None):
+        if not rdfQueryInstance:
+            return self
+        prep = rdfQueryInstance._preparedSelects[self._name]
+        if not prep.hasRun:
+            result = self.retreive_result(rdfQueryInstance, prep.selectArgs)
+            for fltr in self.filters:
+                result = fltr(result)
+            prep.hasRun = True
+            prep.result = result
+        lang = rdfQueryInstance._lang
+        result = prep.result
+        if result:
+            return [self.type_raw_value(value, lang) for value in prep.result]
+        else:
+            return result
+
+    def type_raw_value(self, value, lang):
+        if isinstance(value, URIRef) or not value:
+            return value
+        else:
+            return URIRef(value)
+
+class Typed(RdfQuery):
+    RDF_TYPE = None
+    a = one_uri(RDF.type)
+
+    def __init__(self, subject, *args, **kwargs):
+        super(Typed, self).__init__(_Graph(), '', subject if isinstance(subject, URIRef) else URIRef(subject), *args, **kwargs)
+        if self.RDF_TYPE:
+            self.a = self.RDF_TYPE
+        self.prefixes = prefixes
+
+    def __iter__(self):
+        for selector in self._selectors.values():
+            yield selector.predicate, selector.__get__(self)
+
+    def to_dictables(self):
+        return [self]
+
+    def to_graph(self, *args, **kwargs):
+        if args:
+            g, args = args[0], args[1:]
+        else:
+            g = kwargs.pop('lgraph', _Graph())
+        for prefix, uri in self.prefixes.iteritems():
+            g.bind(prefix, uri)
+        return super(Typed, self).to_graph(lgraph=g, *args, **kwargs)
+
+    def to_dict_untyped(self, keepSubject=False):
+        d = {}
+        if keepSubject:
+            # TODO: sync with new property 'uri'
+            subjectKey = isinstance(keepSubject, str) and keepSubject or 'resource'
+            subj = self._subject
+            if subj and not isinstance(subj, BNode):
+                d[subjectKey] = self._subject
+
+        for selector in self._selectors.values():
+            name = selector.predicate
+            value = selector.__get__(self)
+            if not value:
+                continue
+            else:
+                d[name] = self.__dict_untyped_convert(value, keepSubject)
+            # TODO: handle xml literals
+        return d
+
+    def __dict_untyped_convert(self, value, keepSubject):
+        if isinstance(value, RdfQuery):
+            return value.to_dict(keepSubject)
+        else:
+            return value # TODO: simple type conversions?
+
+class Data(Typed):
+    isPartOf = one_uri(DCTERMS.isPartOf)
+#    Opik RDF object mapper
+#    Copyright (C) 2011 Rhys !
+#
+#    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/>.
+
+from core import Typed, one, one_uri, each_uri, RDFDoc
+from namespaces import *
+
+class Artist(Typed):
+    RDF_TYPE = MO.MusicArtist
+
+    name = one(FOAF.name)
+    image = one_uri(MO.image)
+    wikipedia = one_uri(MO.wikipedia)
+    homepage = one_uri(FOAF.homepage)
+    musicbrainz_guid = one(MO.musicbrainz_guid)
+    musicbrainz = one_uri(MO.musicbrainz)
+    isPrimaryTopicOf = each_uri(FOAF.isPrimaryTopicOf)
+    sameAs = each_uri(OWL.sameAs)
+
+class Image(Typed):
+    RDF_TYPE = FOAF.Image
+    
+    thumbnail = each_uri(FOAF.thumbnail)
+    license = one_uri(DCTERMS.license)
+    publisher = one_uri(DCTERMS.publisher)
+
+if __name__ == '__main__':
+    radiohead = Artist('http://localhost/Radiohead')
+    radiohead.name = 'Radiohead'
+    radiohead.image = 'http://userserve-ak.last.fm/serve/_/14055285/Radiohead.jpg'
+    radiohead.wikipedia = 'http://en.wikipedia.org/wiki/Radiohead'
+    radiohead.homepage = 'http://www.radiohead.com'
+    radiohead.musicbrainz_guid = 'a74b1b7f-71a5-4011-9441-d0b5e4122711'
+    radiohead.musicbrainz = 'http://musicbrainz.org/artist/a74b1b7f-71a5-4011-9441-d0b5e4122711'
+    radiohead.isPrimaryTopicOf = ['http://www.last.fm/music/Radiohead']
+    radiohead.sameAs = ['http://zitgist.com/music/artist/a74b1b7f-71a5-4011-9441-d0b5e4122711',
+        'http://dbpedia.org/resource/Radiohead']
+
+    img = Image('http://userserve-ak.last.fm/serve/_/14055285/Radiohead.jpg')
+    img.thumbnail = ['http://userserve-ak.last.fm/serve/34/14055285/Radiohead.jpg',
+        'http://userserve-ak.last.fm/serve/64/14055285/Radiohead.jpg',
+        'http://userserve-ak.last.fm/serve/126/14055285/Radiohead.jpg']
+    img.license = 'http://www.last.fm/api/tos'
+    img.publisher = 'http://dbpedia.org/resource/Last.fm'
+
+    doc = RDFDoc([radiohead, img])
+    print doc.serialize()
+    print doc.serialize('json', indent=2)
+#    Opik RDF object mapper
+#    Copyright (C) 2011 Rhys !
+#
+#    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/>.
+
+from rdflib.namespace import Namespace as _NS
+
+prefixes = {
+    'dcterms': 'http://purl.org/dc/terms/',
+    'foaf': 'http://xmlns.com/foaf/0.1/',
+    'mo': 'http://purl.org/ontology/mo/',
+    'owl': 'http://www.w3.org/2002/07/owl#',
+    'rdf': 'http://www.w3.org/1999/02/22-rdf-syntax-ns#',
+    'rdfs': 'http://www.w3.org/2000/01/rdf-schema#'
+}
+
+class Namespace(_NS):
+    def __new__(self, uri, prefix=None):
+        return super(Namespace, self).__new__(self, uri)
+
+    def __init__(self, uri, prefix=None):
+        self.prefix = prefix
+
+locals().update((prefix.upper(), Namespace(uri, prefix=prefix)) for prefix, uri in prefixes.iteritems())
+# -*- coding: UTF-8 -*-
+#--------------------------------------------------------------------------------
+# The Oort BSD-style License
+#
+# Copyright (c) 2006, 2007 Niklas Lindström <lindstream@gmail.com>.
+#
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions are met:
+#
+#     * Redistributions of source code must retain the above copyright notice,
+#       this list of conditions and the following disclaimer.
+#     * Redistributions in binary form must reproduce the above copyright notice,
+#       this list of conditions and the following disclaimer in the documentation
+#       and/or other materials provided with the distribution.
+#     * Neither the name of Oort nor the names of its contributors
+#       may be used to endorse or promote products derived from this software
+#       without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+#--------------------------------------------------------------------------------
+
+"""This module contains a system for creating rdf query classes in a mainly 
+declarative manner. These are built by subclassing ``RdfQuery`` and creating 
+class attributes by using ``Selector``:s. There are several selectors provided 
+in this module to cover all regular cases of data acquisition.
+"""
+#=======================================================================
+from itertools import chain
+from types import ModuleType
+import warnings
+from rdflib import RDF, RDFS, Namespace, URIRef, BNode, Literal
+from rdflib import ConjunctiveGraph
+from rdflib.term import Identifier
+try: import simplejson
+except ImportError: simplejson = None
+#from oort.util.code import contract
+from codeutils import contract
+#=======================================================================
+
+
+# TODO: deprecate THIS_QUERY and then remove this?
+THIS_QUERY = object()
+
+MODULE_SEP = ':'
+
+
+#-----------------------------------------------------------------------
+
+
+class Selector(object):
+    __slots__ = ('predicate', '_namespace', 'filters',
+                 '_subQueryMarker', '_finalSubQuery',
+                 '_name', '_queryClass')
+
+    def __init__(self, predBase=None, subQuery=None):
+        self.predicate = None
+        self._namespace = None
+        if isinstance(predBase, Namespace) or isinstance(predBase, ModuleType):
+            self._namespace = predBase
+        elif isinstance(predBase, URIRef):
+            self.predicate = predBase
+        self._subQueryMarker = subQuery
+        self._finalSubQuery = False
+        self.filters = []
+
+    @contract.state_change
+    def hook_into_rdf_query(self, name, queryClass):
+        self._name = name
+        self._queryClass = queryClass
+        if not self._namespace:
+            self._namespace = queryClass._namespace
+        if not self.predicate and self._namespace:
+            if isinstance(self._namespace, ModuleType):
+                self.predicate = getattr(self._namespace, name)
+            else:
+                self.predicate = self._namespace[name]
+        # TODO: not used since e.g. the selector decorator uses no predicate
+        #if not self.predicate:
+        #    raise ValueError(
+        #            "Could not determine predicate for Selector %s" % self)
+
+    def get_sub_query(self):
+        final = self._finalSubQuery
+        if final is False:
+            marker = self._subQueryMarker
+            final = marker
+            if isinstance(marker, basestring):
+                if MODULE_SEP in marker:
+                    module, marker = marker.split(MODULE_SEP)
+                else:
+                    module = self._queryClass.__module__
+                final = __import__(module, fromlist=['']).__dict__[marker]
+            elif marker is THIS_QUERY:
+                final = self._queryClass
+            self._finalSubQuery = final
+        return final
+
+    def __get__(self, rdfQueryInstance, rdfQueryOwnerClass=None):
+        if not rdfQueryInstance:
+            return self
+        prep = rdfQueryInstance._preparedSelects[self._name]
+        if not prep.hasRun:
+            result = self.retreive_result(rdfQueryInstance, prep.selectArgs)
+            for fltr in self.filters:
+                result = fltr(result)
+            prep.hasRun = True
+            prep.result = result
+        return prep.result
+
+    @contract.default_method
+    def retreive_result(self, rdfQueryInstance, selectArgs):
+        result = self._process_for_subqueries(
+                rdfQueryInstance,
+                self.select(*selectArgs),
+                *selectArgs[:2]
+            )
+        return result
+
+    def _process_for_subqueries(self, rdfQueryInstance,
+            rawresults, graph, lang):
+        returnList = isinstance(rawresults, list)
+        if not rawresults:
+            if returnList: return []
+            else: return None
+
+        subQuery = self.get_sub_query()
+        if not subQuery:
+            return rawresults
+        else:
+            # TODO: using THIS_QUERY (and no execCache?) may currently cause
+            # infinite loops..? But things are more lazy now; perhaps not..
+            run_query = query_or_cached(subQuery, rdfQueryInstance._execCache)
+            if returnList:
+                return [run_query(graph, lang, uri) for uri in rawresults]
+            else:
+                return run_query(graph, lang, rawresults)
+
+    @contract.template_method
+    def select(self, graph, lang, subject):
+        raise NotImplementedError
+        return None or []
+
+    @contract.default_method
+    def back_to_graph(self, graph, subject, value):
+        pass
+
+    def viewed_as(self, subQuery):
+        self._subQueryMarker = subQuery
+        return self
+
+    def __rshift__(self, subQuery):
+        return self.viewed_as(subQuery)
+
+    def add_filter(self, fltr):
+        self.filters.append(fltr)
+
+    def __or__(self, fltr):
+        self.add_filter(fltr)
+        return self
+
+    def __set__(self, rdfQueryInstance, value):
+        prep = rdfQueryInstance._preparedSelects[self._name]
+        lang = rdfQueryInstance._lang
+        sub = self.get_sub_query()
+        if isinstance(value, list):
+            value = [self.type_raw_value(val, lang) for val in value]
+        else:
+            value = self.type_raw_value(value, lang)
+        if sub:
+            if isinstance(value, list):
+                prep.result = [sub.from_dict(val, lang, BNode())
+                                for val in value]
+            else:
+                prep.result = sub.from_dict(value, lang, BNode())
+        else:
+            prep.result = value
+            prep.hasRun = True
+
+    @contract.default_method
+    def type_raw_value(self, value, lang):
+        # TODO: need more clever type mapping. also, allow {'_uri': ".." } to be resource?
+        if isinstance(value, basestring) and not isinstance(value, Identifier):
+            value = Literal(value)
+        return value
+
+
+class PreparedSelect(object):
+    __slots__ = ('selectArgs', 'result', 'hasRun')
+    def __init__(self, graph, lang, subject):
+        self.selectArgs = (graph, lang, subject)
+        self.result = None
+        self.hasRun = False # TODO: make configurable?
+
+
+class _rdf_query_meta(type):
+    def __init__(cls, clsName, bases, clsDict):
+        super(_rdf_query_meta, cls).__init__(clsName, bases, clsDict)
+
+        cls._selectors = selectors = {}
+        for base in bases:
+            if hasattr(base, '_selectors'):
+                selectors.update(base._selectors)
+
+        rdfBase = clsDict.get('_rdfbase_')
+        if not rdfBase:
+            for base in bases:
+                if hasattr(base, '_rdfbase_'):
+                    rdfBase = base._rdfbase_
+                    break
+        if isinstance(rdfBase, Namespace):
+            cls._namespace = rdfBase
+            if not clsDict.get('RDF_TYPE'):
+                cls.RDF_TYPE = rdfBase[clsName]
+        else:
+            cls._namespace = None # TODO: pick from type?
+
+        for key, value in clsDict.items():
+            if isinstance(value, Selector):
+                value.hook_into_rdf_query(key, cls)
+                selectors[key] = value
+
+
+class RdfQuery(object):
+    __metaclass__ = _rdf_query_meta
+
+    RDF_TYPE = RDFS.Resource
+
+    # TODO: test use of execCache propertly (it seems to work though)
+
+    def __init__(self, graph, lang, subject, execCache=None):
+        self._graph = graph
+        self._subject = subject
+        self._lang = lang
+        self._preparedSelects = self._make_prepare_selects()
+        self._execCache = execCache
+
+    def _make_prepare_selects(self):
+        prepareds = {}
+        graph, lang, subject = self._graph, self._lang, self._subject
+        for name, selector in self._selectors.items():
+            if not subject:
+                # FIXME: happens when subject is a string/Literal - wrong in 
+                # itself! Remove or signal error? As it is, it leads to 
+                # illegible errors further down!
+                # Also, why not: if subject == u'':
+                #setattr(self, name, None) # TODO:removed; see this fixme
+                continue
+            prep = PreparedSelect(graph, lang, subject)
+            prepareds[name] = prep
+        return prepareds
+
+    def __str__(self):
+        return str(self._subject)
+
+    def __eq__(self, other):
+        if isinstance(other, RdfQuery):
+            return self._subject == other._subject
+        else:
+            return self._subject == other
+
+    @classmethod
+    def bound_with(cls, subject, lang=None):
+        def bound_query(graph, _lang, _subject):
+            return cls(graph, lang or _lang, subject)
+        bound_query.query = cls
+        bound_query.__name__ = cls.__name__
+        return bound_query
+
+    @classmethod
+    def from_dict(cls, data, lang, subject):
+        graph = ConjunctiveGraph()
+        query = cls(graph, lang, subject)
+        for k, v in data.items():
+            setattr(query, k, v)
+        return query
+
+    @classmethod
+    def find_by(cls, graph, lang, execCache=None, **kwargs):
+        assert len(kwargs) == 1
+        name, value = kwargs.items()[0]
+        predicate = cls._selectors[name].predicate
+        for subject in graph.subjects(predicate, value):
+            yield query_or_cached(cls, execCache)(graph, lang, subject)
+
+    @property
+    def uri(self):
+        return self._subject
+
+    def get_selected_value(self, name):
+        return self._preparedSelects[name].result
+
+    def to_graph(self, lgraph=None):
+        subject = self._subject or BNode() # FIXME: is this ok?
+        if not subject: return # FIXME, see fixme in __init__
+
+        lgraph = ConjunctiveGraph() if lgraph is None else lgraph
+
+        for t in self._graph.objects(subject, RDF.type):
+            lgraph.add((subject, RDF.type, t))
+
+        for selector in self._selectors.values():
+            value = selector.__get__(self)
+            if not value:
+                continue
+            selector.back_to_graph(lgraph, subject, value)
+
+        # FIXME: why is this happening; how can we prevent it?
+        for t in lgraph:
+            if None in t: lgraph.remove(t)
+        return lgraph
+
+    def to_rdf(self):
+        return self.to_graph().serialize(format='pretty-xml')
+
+    def to_dict(self, keepSubject=False):
+        d = {}
+        if keepSubject:
+            # TODO: sync with new property 'uri'
+            subjectKey = isinstance(keepSubject, str) and keepSubject or 'resource'
+            subj = self._subject
+            if subj and not isinstance(subj, BNode):
+                d[subjectKey] = self._subject
+
+        for selector in self._selectors.values():
+            name = selector._name
+            value = selector.__get__(self)
+            if not value:
+                continue
+            if isinstance(value, dict):
+                d[name] = dict([(key, self.__dict_convert(val, keepSubject))
+                            for key, val in value.items()])
+            elif hasattr(value, '__iter__'):
+                d[name] = [self.__dict_convert(val, keepSubject)
+                            for val in value]
+            else:
+                d[name] = self.__dict_convert(value, keepSubject)
+            # TODO: handle xml literals
+        return d
+
+    def __dict_convert(self, value, keepSubject):
+        if isinstance(value, RdfQuery):
+            return value.to_dict(keepSubject)
+        else:
+            return unicode(value) # TODO: simple type conversions?
+
+    def to_json(self, keepSubject=False):
+        if simplejson:
+            return simplejson.dumps(self.to_dict(keepSubject))
+        else:
+            raise NotImplementedError
+
+
+#-----------------------------------------------------------------------
+
+
+# Is the use of weakref fine enough (reasonably needed to avoid cyclic
+# references and hence possible memory leaks)?
+# See: <http://docs.python.org/lib/module-weakref.html>
+from weakref import WeakValueDictionary
+
+class ExecCache(object):
+    """
+    This is a query execution cache which reuses results for the same query,
+    subject and language, avoiding multiple instances of the same query when
+    given the same subject and lang.
+    """
+    def __init__(self):
+        self.cache = WeakValueDictionary()
+    def __call__(self, query, graph, lang, subject):
+        cache = self.cache
+        key = (id(query), unicode(subject), lang)
+        #key = (query, subject, lang)
+        result = cache.get(key)
+        if not result:
+            result = query(graph, lang, subject, self)
+            cache[key] = result
+        return result
+
+
+def query_or_cached(rdfQuery, execCache):
+    if execCache:
+        def run_query(graph, lang, uri):
+            return execCache(rdfQuery, graph, lang, uri)
+        return run_query
+    else:
+        return rdfQuery
+
+
+def run_queries(queries, graph, lang, subject):
+    execCache = ExecCache()
+    for query in queries:
+        yield execCache(query, graph, lang, subject)
+
+
+#-----------------------------------------------------------------------
+
+
+class Filter(object):
+    def __init__(self, func):
+        self.func = func
+    def __call__(self, items):
+        return filter(self.func, items)
+
+
+class Sorter(object):
+    def __init__(self, obj=None, reverse=False, ignoreCase=False):
+        if callable(obj):
+            self.attr = None
+            self.func = obj
+        else:
+            self.attr = obj
+            self.func = None
+        self.reverse = reverse
+        self.ignoreCase = ignoreCase
+    def __call__(self, items):
+        copy = items[:]
+        copy.sort(self.sort)
+        if self.reverse:
+            copy.reverse()
+        return copy
+    def sort(self, r1, r2):
+        attr = self.attr
+        func = self.func
+        if attr:
+            v1, v2 = getattr(r1, attr, r1), getattr(r2, attr, r2)
+        elif func:
+            v1, v2 = func(r1), func(r2)
+        else:
+            v1, v2 = r1, r2
+        if self.ignoreCase:
+            v1, v2 = v1.lower(), v2.lower()
+        return cmp(v1, v2)
+
+
+#-----------------------------------------------------------------------
+
+
+# TODO: totally untested!
+#   - use: TypeSwitch(persons=Person, values=Literal)
+#   - a subclass of RdfQuery? Or affect selector..? Reasonably yes..
+#   - should adapt to if stuff is a list or one thing (one or each)
+#       - how about localized?
+#   - also should be used as list *or*:
+#       - obj.switchedstuff.persons
+#def type_switch(typeSelectors, default):
+#    rdfType = graph.value(resource, RDF.type, None, any=True)
+#    def select(graph, lang, resource, **kwargs):
+#        query = typeSelectors.get(rdfType, default)
+#        return query(graph, lang, resource, **kwargs)
+#    return select
+
+
+
+def back_from_value(graph, subject, predicate, value):
+        if isinstance(value, RdfQuery):
+            graph.add((subject, predicate, value._subject))
+            value.to_graph(graph)
+        else:
+            if not isinstance(value, list): # TODO: fix this
+                graph.add((subject, predicate, value))
+
+
+class UnarySelector(Selector):
+    def back_to_graph(self, graph, subject, value):
+        back_from_value(graph, subject, self.predicate, value)
+
+class EachSelector(Selector):
+    def back_to_graph(self, graph, subject, values):
+        for value in values:
+            back_from_value(graph, subject, self.predicate, value)
+
+
+class one(UnarySelector):
+    def select(self, graph, lang, subject):
+        return graph.value(subject, self.predicate, None, any=True)
+
+
+class each(EachSelector):
+    def select(self, graph, lang, subject):
+        return list(graph.objects(subject, self.predicate))
+
+
+class one_where_self_is(Selector):
+    def select(self, graph, lang, subject):
+        return graph.value(None, self.predicate, subject, any=True)
+
+    def back_to_graph(self, graph, subject, value):
+        back_from_value(graph, value._subject, self.predicate, subject)
+
+
+class each_where_self_is(Selector):
+    def select(self, graph, lang, subject):
+        return list(graph.subjects(self.predicate, subject))
+
+    def back_to_graph(self, graph, subject, values):
+        for value in values:
+            back_from_value(graph, value._subject, self.predicate, subject)
+
+
+class collection(Selector):
+    def __init__(self, predBase=None, subQuery=None, multiple=False):
+        Selector.__init__(self, predBase, subQuery)
+        self.multiple = multiple
+
+    def select(self, graph, lang, subject):
+        if self.multiple:
+            allItems = [graph.items(res)
+                        for res in graph.objects(subject, self.predicate)]
+            return list(chain(*allItems))
+        else:
+            return list(graph.items(
+                    graph.value(subject, self.predicate, None, any=True)
+                ))
+
+    def back_to_graph(self, graph, subject, values):
+        if not values:
+            graph.add((subject, self.predicate, RDF.nil))
+            return
+        bnode = BNode()
+        graph.add((subject, self.predicate, bnode))
+        for value in values:
+            back_from_value(graph, bnode, RDF.first, value)
+            newBnode = BNode()
+            graph.add((bnode, RDF.rest, newBnode))
+            bnode = newBnode
+        graph.add((bnode, RDF.rest, RDF.nil))
+
+
+class TypeLocalized(Selector):
+    def type_raw_value(self, value, lang):
+        if isinstance(value, basestring):
+            value = Literal(value, lang)
+        return value
+
+class localized(TypeLocalized, UnarySelector):
+    def select(self, graph, lang, subject):
+        first = None
+        for value in graph.objects(subject, self.predicate):
+            if not first: first = value
+            if getattr(value, 'language', None) == lang:
+                return value
+        return first
+
+
+# TODO: This is a hackish solution; see also below (transparently using datatype).
+#       It also reduces the literal, making it irreversible (should store original value!).
+#try:
+#    from oort.util._genshifilters import language_filtered_xml
+#except ImportError, e:
+#    warnings.warn("Could not import _genshifilters. Error was: %r. The selector 'localized_xml' will not be available." % e)
+#else:
+#    class localized_xml(UnarySelector):
+#        """This selector removes any elements with an xml:lang other than the 
+#        current language. It also supports the never standardized 'rdf-wrapper' in 
+#        XML Literals, who are removed from the output.
+
+#        Important! This is currently tied to the Genshi Templating System, and may 
+#        not work as expected in all cases."""
+
+#        def select(self, graph, lang, subject):
+#            return language_filtered_xml(
+#                    graph.objects(subject, self.predicate), lang)
+
+#        def type_raw_value(self, value, lang):
+#            if isinstance(value, basestring):
+#                value = Literal(value, datatype=RDF.XMLLiteral)
+#            return value
+
+class i18n_dict(Selector):
+    def select(self, graph, lang, subject):
+        valueDict = {}
+        for value in graph.objects(subject, self.predicate):
+            valueDict[value.language] = value
+        return valueDict
+
+    def back_to_graph(self, graph, subject, value):
+        for lang, text in value.items():
+            graph.add((subject, self.predicate, Literal(text, lang=lang)))
+
+
+class each_localized(TypeLocalized, EachSelector):
+    def select(self, graph, lang, subject):
+        return [ value for value in graph.objects(subject, self.predicate)
+                 if value.language == lang ]
+
+
+#-----------------------------------------------------------------------
+
+
+# TODO: Though "widely used" (by me), I think this was a little premature.
+# There seems little use for this that a regular property can't do (getting the
+# graph, lang and subject from self -- where needed). Perhaps I should include
+# a memoized codeutil so it's easy to create lazily calculated bigger things.
+#
+# Even worse, this "utility" bypasses _process_for_subqueries, which is
+# intricate and very close to the implementation. And this is the only reason
+# retreive_result is marked as a "default_method"; it should reasonably be
+# private.
+#
+class selector(Selector):
+    "Use as decorator for methods of an RdfQuery subclass to convert them to selectors."
+    def __init__(self, func):
+        super(selector, self).__init__(None)
+        self.func = func
+    def retreive_result(self, rdfQueryInstance, selectArgs):
+        return self.func(rdfQueryInstance, *selectArgs)
+    @classmethod
+    def filtered_by(cls, *filters):
+        def decorator(func):
+            sel = cls(func)
+            for fltr in filters:
+                sel.add_filter(fltr)
+            return sel
+        return decorator
+
+
+#-----------------------------------------------------------------------
+# TODO: consider returning ElementTree data for XML Literals. And if so, also
+# filtered on u'{http://www.w3.org/XML/1998/namespace}lang' (keep if none) for localized.
+
+# TODO: also consider checking datatype and coercing (at least) these:
+# Use: rdflib.Literal.castPythonToLiteral
+# See: rdflib.sparql.sparqlOperators.getLiteralValue(v)
+# See: <http://en.wikipedia.org/wiki/RDFLib#RDF_Literal_Support>
+# - NOTE: Isn't this done automatically by rdflib now? I believe so.
+
+
+#-----------------------------------------------------------------------
+
+
+class QueryContext(object):
+    """
+    A query context, used to provide a managed context for query execution.
+
+    Initalized with:
+
+    -   graph
+    -   language or getter for language
+    -   a set of queries or a modules containing queries
+        Accessible as attributes on the context or via view_for using RDF_TYPE
+
+    """
+
+    def __init__(self, graph, langobj, queries=None, query_modules=None):
+        self._graph = graph
+        self._execCache = ExecCache()
+
+        if callable(langobj):
+            get_lang = langobj
+        else:
+            def get_lang(): return langobj
+        self._get_lang = get_lang
+
+        self._querydict = querydict = {}
+        if queries:
+            for query in queries:
+                querydict[query.__name__] = query
+        if query_modules:
+            for module in query_modules:
+                for name, obj in module.__dict__.items():
+                    if isinstance(obj, type) and issubclass(obj, RdfQuery):
+                        querydict[name] = obj
+
+        self._queryTypeMap = {}
+        for query in querydict.values():
+            self._queryTypeMap[query.RDF_TYPE] = query
+
+    def __getattr__(self, name):
+        try:
+            query = self._querydict[name]
+            return self._prepared_query(query)
+        except KeyError:
+            raise AttributeError("%s has no attribute '%s'" % (self, name))
+
+    def view_for(self, uriref):
+        for typeref in self._graph.objects(uriref, RDF.type):
+            query = self._queryTypeMap.get(typeref)
+            if query:
+                return self._prepared_query(query)(uriref)
+        raise KeyError("%s has no query for type '%s'" % (self, uriref))
+
+    def _prepared_query(self, query):
+        return self.PreparedQuery(self, query)
+
+    class PreparedQuery(object):
+        __slots__ = ('query', 'context')
+
+        def __init__(self, context, query):
+            self.context = context
+            self.query = query
+
+        def __call__(self, subject):
+            cx = self.context
+            return cx._execCache(self.query, cx._graph, cx._get_lang(), subject)
+
+        def find_all(self):
+            cx = self.context
+            for subject in cx._graph.subjects(RDF.type, self.query.RDF_TYPE):
+                yield cx.view_for(subject)
+
+        def find_by(self, **kwargs):
+            cx = self.context
+            return self.query.find_by(cx._graph, cx._get_lang(),
+                    execCache=cx._execCache, **kwargs)
+
+