diff --git a/.github/workflows/pkgdown.yaml b/.github/workflows/pkgdown.yaml new file mode 100644 index 0000000..4bbce75 --- /dev/null +++ b/.github/workflows/pkgdown.yaml @@ -0,0 +1,50 @@ +# Workflow derived from https://github.com/r-lib/actions/tree/v2/examples +# Need help debugging build failures? Start at https://github.com/r-lib/actions#where-to-find-help +on: + push: + branches: [main, master] + pull_request: + branches: [main, master] + release: + types: [published] + workflow_dispatch: + +name: pkgdown.yaml + +permissions: read-all + +jobs: + pkgdown: + runs-on: ubuntu-latest + # Only restrict concurrency for non-PR jobs + concurrency: + group: pkgdown-${{ github.event_name != 'pull_request' || github.run_id }} + env: + GITHUB_PAT: ${{ secrets.GITHUB_TOKEN }} + permissions: + contents: write + steps: + - uses: actions/checkout@v4 + + - uses: r-lib/actions/setup-pandoc@v2 + + - uses: r-lib/actions/setup-r@v2 + with: + use-public-rspm: true + + - uses: r-lib/actions/setup-r-dependencies@v2 + with: + extra-packages: any::pkgdown, local::. + needs: website + + - name: Build site + run: pkgdown::build_site_github_pages(new_process = FALSE, install = FALSE) + shell: Rscript {0} + + - name: Deploy to GitHub pages 🚀 + if: github.event_name != 'pull_request' + uses: JamesIves/github-pages-deploy-action@v4.5.0 + with: + clean: false + branch: gh-pages + folder: docs diff --git a/docs/404.html b/docs/404.html deleted file mode 100644 index 8044035..0000000 --- a/docs/404.html +++ /dev/null @@ -1,160 +0,0 @@ - - - - - - - - -Page not found (404) • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
-
- - - - -
- -
-
- - -Content not found. Please use links in the navbar. - -
- - - -
- - - - -
- - - - - - - - diff --git a/docs/LICENSE.html b/docs/LICENSE.html deleted file mode 100644 index 23ec514..0000000 --- a/docs/LICENSE.html +++ /dev/null @@ -1,382 +0,0 @@ - - - - - - - - -GNU General Public License • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
-
- - - - -
- -
-
- - -
- -

Version 3, 29 June 2007
Copyright © 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.

-
- -
-

-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>.

-
-
- -
- - - -
- - - - -
- - - - - - - - diff --git a/docs/articles/benchmarks.html b/docs/articles/benchmarks.html deleted file mode 100644 index 1c2fd6b..0000000 --- a/docs/articles/benchmarks.html +++ /dev/null @@ -1,336 +0,0 @@ - - - - - - - -Comparison with `{hash}` • r2r - - - - - - - - - - -
-
- - - - -
-
- - - - -

This vignette provides a comparison of r2r with the same-purpose CRAN package {hash}, which also offers an implementation of hash tables based on R environments. We first describe the features offered by both packages, and then perform some benchmark timing comparisons. The package versions referred to in this vignette are:

-
-library(hash)
-library(r2r)
-packageVersion("hash")
-#> [1] '2.2.6.1'
-packageVersion("r2r")
-#> [1] '0.1.1'
-
-

-Features

-

Both r2r and {hash} hash tables are built on top of the R built-in environment data structure, and have thus a similar API. In particular, hash table objects have reference semantics for both packages. r2r hashtables are S3 class objects, whereas in {hash} the data structure is implemented as an S4 class.

-

Hash tables provided by r2r support arbitrary type keys and values, arbitrary key comparison and hash functions, and have customizable behaviour (either throw an exception or return a default value) upon query of a missing key.

-

In contrast, hash tables in hash currently support only string keys, with basic identity comparison (the hashing is performed automatically by the underlying environment objects); values can be arbitrary R objects. Querying missing keys through non-vectorized [[-subsetting returns the default value NULL, whereas queries through vectorized [-subsetting result in an error. On the other hand, hash also offers support for inverting hash tables (an experimental feature at the time of writing).

-

The table below summarizes the features of the two packages

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Features supported by {r2r} and {hash}
Featurer2rhash
Basic data structureR environmentR environment
Arbitrary type keysX
Arbitrary type valuesXX
Arbitrary hash functionX
Arbitrary key comparison functionX
Throw or return default on missing keysX
Hash table inversionX
-
-
-

-Performance tests

-

We will perform our benchmark tests using the CRAN package microbenchmark.

- -
-

-Key insertion

-

We start by timing the insertion of:

-
-N <- 1e4
-

random key-value pairs (with possible repetitions). In order to perform a meaningful comparison between the two packages, we restrict to string (i.e. length one character) keys. We can generate random keys as follows:

-
-chars <- c(letters, LETTERS, 0:9)
-random_keys <- function(n) paste0(
-    sample(chars, n, replace = TRUE),
-    sample(chars, n, replace = TRUE),
-    sample(chars, n, replace = TRUE),
-    sample(chars, n, replace = TRUE),
-    sample(chars, n, replace = TRUE)
-    )
-
-set.seed(840)
-keys <- random_keys(N)
-values <- rnorm(N)
-

We test both the non-vectorized ([[<-) and vectorized ([<-) operators:

-
-microbenchmark(
-    `r2r_[[<-` = {
-        for (i in seq_along(keys))
-            m_r2r[[ keys[[i]] ]] <- values[[i]]
-    },
-    `r2r_[<-` = { m_r2r[keys] <- values },
-    `hash_[[<-` = { 
-        for (i in seq_along(keys))
-            m_hash[[ keys[[i]] ]] <- values[[i]]
-    },
-    `hash_[<-` = m_hash[keys] <- values,
-    
-    times = 30, 
-    setup = { m_r2r <- hashmap(); m_hash <- hash() }
-)
-#> Unit: milliseconds
-#>       expr       min        lq      mean   median       uq      max neval
-#>   r2r_[[<- 111.54835 130.37921 193.59728 201.5787 246.5056 312.6756    30
-#>    r2r_[<- 103.44057 146.71259 175.29195 176.1595 196.2209 281.5497    30
-#>  hash_[[<-  97.69138 140.48700 177.92566 182.8497 203.2853 259.5250    30
-#>   hash_[<-  52.65147  61.11784  89.96423  81.7027 113.0783 167.0759    30
-

As it is seen, r2r and hash have comparable performances at the insertion of key-value pairs, with both vectorized and non-vectorized insertions, hash being somewhat more efficient in both cases.

-
-
-

-Key query

-

We now test key query, again both in non-vectorized and vectorized form:

-
-microbenchmark(
-    `r2r_[[` = { for (key in keys) m_r2r[[ key ]] },
-    `r2r_[` = { m_r2r[ keys ] },
-    `hash_[[` = { for (key in keys) m_hash[[ key ]] },
-    `hash_[` = { m_hash[ keys ] },
-    
-    times = 30,
-    setup = { 
-        m_r2r <- hashmap(); m_r2r[keys] <- values
-        m_hash <- hash(); m_hash[keys] <- values
-    }
-)
-#> Unit: milliseconds
-#>     expr       min        lq      mean    median        uq       max neval
-#>   r2r_[[ 124.81017 175.76404 228.40115 218.11206 262.34639 363.20552    30
-#>    r2r_[ 113.27040 172.00862 210.85097 211.59312 250.79167 333.21509    30
-#>  hash_[[  14.26790  16.28593  22.85595  21.99028  24.30694  48.34391    30
-#>   hash_[  82.63965 109.64820 141.58864 135.93963 159.63201 268.81355    30
-

For non-vectorized queries, hash is significantly faster (by one order of magnitude) than r2r. This is likely due to the fact that the [[ method dispatch is handled natively by R in hash (i.e. the default [[ method for environments is used ), whereas r2r suffers the overhead of S3 method dispatch. This is confirmed by the result for vectorized queries, which is comparable for the two packages; notice that here a single (rather than N) S3 method dispatch occurs in the r2r timed expression.

-

As an additional test, we perform the benchmarks for non-vectorized expressions with a new set of keys:

-
-set.seed(841)
-new_keys <- random_keys(N)
-microbenchmark(
-    `r2r_[[_bis` = { for (key in new_keys) m_r2r[[ key ]] },
-    `hash_[[_bis` = { for (key in new_keys) m_hash[[ key ]] },
-    
-    times = 30,
-    setup = { 
-        m_r2r <- hashmap(); m_r2r[keys] <- values
-        m_hash <- hash(); m_hash[keys] <- values
-    }
-)
-#> Unit: milliseconds
-#>         expr      min        lq      mean    median        uq       max neval
-#>   r2r_[[_bis 86.50014 118.93648 157.65807 153.16882 163.77239 365.71789    30
-#>  hash_[[_bis 14.05082  16.57323  23.19929  21.53846  30.16298  39.63644    30
-

The results are similar to the ones already commented. Finally, we test the performances of the two packages in checking the existence of keys (notice that here has_key refers to r2r::has_key, whereas has.key is hash::has.key):

-
-set.seed(842)
-mixed_keys <- sample(c(keys, new_keys), N)
-microbenchmark(
-    r2r_has_key = { for (key in mixed_keys) has_key(m_r2r, key) },
-    hash_has_key = { for (key in new_keys) has.key(key, m_hash) },
-    
-    times = 30,
-    setup = { 
-        m_r2r <- hashmap(); m_r2r[keys] <- values
-        m_hash <- hash(); m_hash[keys] <- values
-    }
-)
-#> Unit: milliseconds
-#>          expr      min       lq     mean   median       uq      max neval
-#>   r2r_has_key  83.2514 109.7505 131.4229 120.3173 149.7155 291.3949    30
-#>  hash_has_key 233.2610 304.9865 367.8324 364.3668 408.9261 539.3776    30
-

The results are comparable for the two packages, r2r being slightly more performant in this particular case.

-
-
-

-Key deletion

-

Finally, we test key deletion. In order to handle name collisions, we will use delete() (which refers to r2r::delete()) and del() (which refers to hash::del()).

-
-microbenchmark(
-    r2r_delete = { for (key in keys) delete(m_r2r, key) },
-    hash_delete = { for (key in keys) del(key, m_hash) },
-    hash_vectorized_delete = { del(keys, m_hash) },
-    
-    times = 30,
-    setup = { 
-        m_r2r <- hashmap(); m_r2r[keys] <- values
-        m_hash <- hash(); m_hash[keys] <- values
-    }
-)
-#> Unit: milliseconds
-#>                    expr        min         lq       mean     median         uq
-#>              r2r_delete 429.794784 522.802137 661.172206 639.401653 758.826645
-#>             hash_delete 227.654058 288.144309 364.531141 362.392011 439.393266
-#>  hash_vectorized_delete   4.533082   5.389375   6.431943   5.769315   7.656032
-#>         max neval
-#>  1179.17381    30
-#>   557.73474    30
-#>    11.19358    30
-

The vectorized version of hash significantly outperforms the non-vectorized versions (by roughly two orders of magnitude in speed). Currently, r2r does not support vectorized key deletion 1.

-
-
-
-

-Conclusions

-

The two R packages r2r and hash offer hash table implementations with different advantages and drawbacks. r2r focuses on flexibility, and has a richer set of features. hash is more minimal, but offers superior performance in some important tasks. Finally, as a positive note for both parties, the two packages share a similar API, making it relatively easy to switch between the two, according to the particular use case needs.

-
-
-
-
    -
  1. This is due to complications introduced by the internal hash collision handling system of r2r.↩︎

  2. -
-
-
- - - -
- - - - -
- - - - - - diff --git a/docs/articles/benchmarks_files/header-attrs-2.8/header-attrs.js b/docs/articles/benchmarks_files/header-attrs-2.8/header-attrs.js deleted file mode 100644 index dd57d92..0000000 --- a/docs/articles/benchmarks_files/header-attrs-2.8/header-attrs.js +++ /dev/null @@ -1,12 +0,0 @@ -// Pandoc 2.9 adds attributes on both header and div. We remove the former (to -// be compatible with the behavior of Pandoc < 2.8). -document.addEventListener('DOMContentLoaded', function(e) { - var hs = document.querySelectorAll("div.section[class*='level'] > :first-child"); - var i, h, a; - for (i = 0; i < hs.length; i++) { - h = hs[i]; - if (!/^h[1-6]$/i.test(h.tagName)) continue; // it should be a header h1-h6 - a = h.attributes; - while (a.length > 0) h.removeAttribute(a[0].name); - } -}); diff --git a/docs/articles/index.html b/docs/articles/index.html deleted file mode 100644 index 88fb53d..0000000 --- a/docs/articles/index.html +++ /dev/null @@ -1,161 +0,0 @@ - - - - - - - - -Articles • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
-
- - - - -
- -
-
- - -
-

All vignettes

-

- -
-
Comparison with `{hash}`
-
-
R-Object to R-Object Hash Maps
-
-
-
-
-
- - - -
- - - - - - - - diff --git a/docs/articles/r2r.html b/docs/articles/r2r.html deleted file mode 100644 index 359ab1f..0000000 --- a/docs/articles/r2r.html +++ /dev/null @@ -1,258 +0,0 @@ - - - - - - - -R-Object to R-Object Hash Maps • r2r - - - - - - - - - - -
-
- - - - -
-
- - - - -
-

-Introduction

-

Hash tables are among the most useful data structures for efficient coding. An hash table can be abstractly thought as a map from a set of unique keys (which may be strings, numbers, or even more complicated objects) to a set of values. From a computational viewpoint, its most distinctive feature is that its read/write operations (i.e. storing, retrieving or deleting a particular key or key-value pair) have average \(O(1)\) time complexity, independent of the table size.

-

Many programming languages come with their own native implementation of hash tables (for instance std::unordered_map/sets in C++, or dicts and sets in Python); in base R, the objects which come closest to hash tables are environments. These, however, can be somewhat cumbersome to handle from the user point of view, and only support string type keys. The purpose of r2r is to provide a more flexible implementation of hash tables in R, building on top of base R environments.

-

In particular, r2r hash tables support:

-
    -
  • arbitrary R objects as keys and values,
  • -
  • arbitrary key comparison and hash functions,
  • -
  • customizable behaviour (throw or return a default value) on missing key exceptions.
  • -
-

This document provides a quick hands-on introduction to r2r hash tables.

- -
-
-

-Basic Manipulations

-

We create an empty hash map with:

-
-m <- hashmap()
-

We can insert key-value pairs in m in several different ways:

-
-m[["key"]] <- "value"
-m[c(1, 2, 3)] <- c("a", "b", "c") # Vectorized over keys and values
-m[[c(4, 5, 6)]] <- c("d", "e", "f") # Not vectorized
-

The following queries explain the differences between the [[ and [ operator mentioned in the comments above:

-
-m[["key"]]
-#> [1] "value"
-
-m[c(1, 2, 3)]
-#> [[1]]
-#> [1] "a"
-#> 
-#> [[2]]
-#> [1] "b"
-#> 
-#> [[3]]
-#> [1] "c"
-m[[c(1, 2, 3)]]
-#> NULL
-
-m[c(4, 5, 6)]
-#> [[1]]
-#> NULL
-#> 
-#> [[2]]
-#> NULL
-#> 
-#> [[3]]
-#> NULL
-m[[c(4, 5, 6)]]
-#> [1] "d" "e" "f"
-

Single element insertions and queries can also be performed through the generics insert() and query()

-
-insert(m, "user", "vgherard") # Modifies `m` in place
-query(m, "user")
-#> [1] "vgherard"
-
-
-

-Sets

-

In addition to hash maps, we can also create hash sets, which simply store keys:

-
-s <- hashset()
-insert(s, 1)
-s[[2]] <- T # equivalent to insert(s, 2)
-s[c(1, 2, 3)]
-#> [[1]]
-#> [1] TRUE
-#> 
-#> [[2]]
-#> [1] TRUE
-#> 
-#> [[3]]
-#> [1] FALSE
-
-
-

-Key and value types

-

There is no restriction on the type of object you can use as keys and values. For instance:

-
-m[[ lm(wt ~ mpg, mtcars) ]] <- list("This is my fit!", 840)
-m[[ lm(wt ~ mpg, mtcars) ]]
-#> [[1]]
-#> [1] "This is my fit!"
-#> 
-#> [[2]]
-#> [1] 840
-m[[ lm(cyl ~ mpg, mtcars) ]]
-#> NULL
-
-
-

-Setting default values

-

You can set default values for missing keys. For instance:

-
-m <- hashmap(default = 0)
-

which is useful for creating a counter:

-
-objects <- list(1, 1, "1", FALSE, "1", 1)
-for (object in objects)
-    m[[object]] <- m[[object]] + 1
-m[["1"]]
-#> [1] 2
-

Alternatively, you may throw an exception upon querying a missing key:

-
-m <- hashmap(on_missing_key = "throw")
-tryCatch(m[["Missing key"]], error = function(cnd) "Oops!")
-#> [1] "Oops!"
-
-
-

-Using custom key comparison and hash functions

-

hashmaps and hashmaps use by default base::identical() to compare keys. For instance:

-
-m <- hashmap()
-m[[1]] <- "double"
-m[["1"]] <- "character"
-m[[1]]
-#> [1] "double"
-

This behavior can be changed by explicitly providing a key comparison function. For this to work correctly, one must also explicitly provide an hash function which produces the same hashes for equivalent keys. A simple way to do this is to apply a preprocessing function to keys, as illustrated by the following example.

-

We assume that keys are length one complex numbers, and consider two keys equivalent when they have the same direction in the complex plane. The direction of a complex vector can be found applying the R function Arg(), which is thus a sensible key preprocessing function. We can instruct an hashmap to preprocess its keys in this way through the constructor’s key_preproc_fn argument:

-
-m <- hashmap(key_preproc_fn = Arg)
-

Let us check that everything works as intended:

-
-m[list(1, 1 + 1i, 1i)] <- list("EAST", "NORTH-EAST", "NORTH")
-m[[10]]
-#> [1] "EAST"
-m[[100i]]
-#> [1] "NORTH"
-m[[2 + 2i]]
-#> [1] "NORTH-EAST"
-
-
- - - -
- - - - -
- - - - - - diff --git a/docs/articles/r2r_files/header-attrs-2.8/header-attrs.js b/docs/articles/r2r_files/header-attrs-2.8/header-attrs.js deleted file mode 100644 index dd57d92..0000000 --- a/docs/articles/r2r_files/header-attrs-2.8/header-attrs.js +++ /dev/null @@ -1,12 +0,0 @@ -// Pandoc 2.9 adds attributes on both header and div. We remove the former (to -// be compatible with the behavior of Pandoc < 2.8). -document.addEventListener('DOMContentLoaded', function(e) { - var hs = document.querySelectorAll("div.section[class*='level'] > :first-child"); - var i, h, a; - for (i = 0; i < hs.length; i++) { - h = hs[i]; - if (!/^h[1-6]$/i.test(h.tagName)) continue; // it should be a header h1-h6 - a = h.attributes; - while (a.length > 0) h.removeAttribute(a[0].name); - } -}); diff --git a/docs/authors.html b/docs/authors.html deleted file mode 100644 index 17a8405..0000000 --- a/docs/authors.html +++ /dev/null @@ -1,159 +0,0 @@ - - - - - - - - -Authors • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
-
- - - - -
- -
-
- - -
    -
  • -

    Valerio Gherardi. Author, maintainer. -

    -
  • -
- -
- -
- - - - -
- - - - - - - - diff --git a/docs/bootstrap-toc.css b/docs/bootstrap-toc.css deleted file mode 100644 index 5a85941..0000000 --- a/docs/bootstrap-toc.css +++ /dev/null @@ -1,60 +0,0 @@ -/*! - * Bootstrap Table of Contents v0.4.1 (http://afeld.github.io/bootstrap-toc/) - * Copyright 2015 Aidan Feldman - * Licensed under MIT (https://github.com/afeld/bootstrap-toc/blob/gh-pages/LICENSE.md) */ - -/* modified from https://github.com/twbs/bootstrap/blob/94b4076dd2efba9af71f0b18d4ee4b163aa9e0dd/docs/assets/css/src/docs.css#L548-L601 */ - -/* All levels of nav */ -nav[data-toggle='toc'] .nav > li > a { - display: block; - padding: 4px 20px; - font-size: 13px; - font-weight: 500; - color: #767676; -} -nav[data-toggle='toc'] .nav > li > a:hover, -nav[data-toggle='toc'] .nav > li > a:focus { - padding-left: 19px; - color: #563d7c; - text-decoration: none; - background-color: transparent; - border-left: 1px solid #563d7c; -} -nav[data-toggle='toc'] .nav > .active > a, -nav[data-toggle='toc'] .nav > .active:hover > a, -nav[data-toggle='toc'] .nav > .active:focus > a { - padding-left: 18px; - font-weight: bold; - color: #563d7c; - background-color: transparent; - border-left: 2px solid #563d7c; -} - -/* Nav: second level (shown on .active) */ -nav[data-toggle='toc'] .nav .nav { - display: none; /* Hide by default, but at >768px, show it */ - padding-bottom: 10px; -} -nav[data-toggle='toc'] .nav .nav > li > a { - padding-top: 1px; - padding-bottom: 1px; - padding-left: 30px; - font-size: 12px; - font-weight: normal; -} -nav[data-toggle='toc'] .nav .nav > li > a:hover, -nav[data-toggle='toc'] .nav .nav > li > a:focus { - padding-left: 29px; -} -nav[data-toggle='toc'] .nav .nav > .active > a, -nav[data-toggle='toc'] .nav .nav > .active:hover > a, -nav[data-toggle='toc'] .nav .nav > .active:focus > a { - padding-left: 28px; - font-weight: 500; -} - -/* from https://github.com/twbs/bootstrap/blob/e38f066d8c203c3e032da0ff23cd2d6098ee2dd6/docs/assets/css/src/docs.css#L631-L634 */ -nav[data-toggle='toc'] .nav > .active > ul { - display: block; -} diff --git a/docs/bootstrap-toc.js b/docs/bootstrap-toc.js deleted file mode 100644 index 1cdd573..0000000 --- a/docs/bootstrap-toc.js +++ /dev/null @@ -1,159 +0,0 @@ -/*! - * Bootstrap Table of Contents v0.4.1 (http://afeld.github.io/bootstrap-toc/) - * Copyright 2015 Aidan Feldman - * Licensed under MIT (https://github.com/afeld/bootstrap-toc/blob/gh-pages/LICENSE.md) */ -(function() { - 'use strict'; - - window.Toc = { - helpers: { - // return all matching elements in the set, or their descendants - findOrFilter: function($el, selector) { - // http://danielnouri.org/notes/2011/03/14/a-jquery-find-that-also-finds-the-root-element/ - // http://stackoverflow.com/a/12731439/358804 - var $descendants = $el.find(selector); - return $el.filter(selector).add($descendants).filter(':not([data-toc-skip])'); - }, - - generateUniqueIdBase: function(el) { - var text = $(el).text(); - var anchor = text.trim().toLowerCase().replace(/[^A-Za-z0-9]+/g, '-'); - return anchor || el.tagName.toLowerCase(); - }, - - generateUniqueId: function(el) { - var anchorBase = this.generateUniqueIdBase(el); - for (var i = 0; ; i++) { - var anchor = anchorBase; - if (i > 0) { - // add suffix - anchor += '-' + i; - } - // check if ID already exists - if (!document.getElementById(anchor)) { - return anchor; - } - } - }, - - generateAnchor: function(el) { - if (el.id) { - return el.id; - } else { - var anchor = this.generateUniqueId(el); - el.id = anchor; - return anchor; - } - }, - - createNavList: function() { - return $(''); - }, - - createChildNavList: function($parent) { - var $childList = this.createNavList(); - $parent.append($childList); - return $childList; - }, - - generateNavEl: function(anchor, text) { - var $a = $(''); - $a.attr('href', '#' + anchor); - $a.text(text); - var $li = $('
  • '); - $li.append($a); - return $li; - }, - - generateNavItem: function(headingEl) { - var anchor = this.generateAnchor(headingEl); - var $heading = $(headingEl); - var text = $heading.data('toc-text') || $heading.text(); - return this.generateNavEl(anchor, text); - }, - - // Find the first heading level (`

    `, then `

    `, etc.) that has more than one element. Defaults to 1 (for `

    `). - getTopLevel: function($scope) { - for (var i = 1; i <= 6; i++) { - var $headings = this.findOrFilter($scope, 'h' + i); - if ($headings.length > 1) { - return i; - } - } - - return 1; - }, - - // returns the elements for the top level, and the next below it - getHeadings: function($scope, topLevel) { - var topSelector = 'h' + topLevel; - - var secondaryLevel = topLevel + 1; - var secondarySelector = 'h' + secondaryLevel; - - return this.findOrFilter($scope, topSelector + ',' + secondarySelector); - }, - - getNavLevel: function(el) { - return parseInt(el.tagName.charAt(1), 10); - }, - - populateNav: function($topContext, topLevel, $headings) { - var $context = $topContext; - var $prevNav; - - var helpers = this; - $headings.each(function(i, el) { - var $newNav = helpers.generateNavItem(el); - var navLevel = helpers.getNavLevel(el); - - // determine the proper $context - if (navLevel === topLevel) { - // use top level - $context = $topContext; - } else if ($prevNav && $context === $topContext) { - // create a new level of the tree and switch to it - $context = helpers.createChildNavList($prevNav); - } // else use the current $context - - $context.append($newNav); - - $prevNav = $newNav; - }); - }, - - parseOps: function(arg) { - var opts; - if (arg.jquery) { - opts = { - $nav: arg - }; - } else { - opts = arg; - } - opts.$scope = opts.$scope || $(document.body); - return opts; - } - }, - - // accepts a jQuery object, or an options object - init: function(opts) { - opts = this.helpers.parseOps(opts); - - // ensure that the data attribute is in place for styling - opts.$nav.attr('data-toggle', 'toc'); - - var $topContext = this.helpers.createChildNavList(opts.$nav); - var topLevel = this.helpers.getTopLevel(opts.$scope); - var $headings = this.helpers.getHeadings(opts.$scope, topLevel); - this.helpers.populateNav($topContext, topLevel, $headings); - } - }; - - $(function() { - $('nav[data-toggle="toc"]').each(function(i, el) { - var $nav = $(el); - Toc.init($nav); - }); - }); -})(); diff --git a/docs/dev/404.html b/docs/dev/404.html deleted file mode 100644 index e293675..0000000 --- a/docs/dev/404.html +++ /dev/null @@ -1,160 +0,0 @@ - - - - - - - - -Page not found (404) • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -Content not found. Please use links in the navbar. - -
    - - - -
    - - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/LICENSE.html b/docs/dev/LICENSE.html deleted file mode 100644 index 8e82bd5..0000000 --- a/docs/dev/LICENSE.html +++ /dev/null @@ -1,382 +0,0 @@ - - - - - - - - -GNU General Public License • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    - -

    Version 3, 29 June 2007
    Copyright © 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.

    -
    - -
    -

    -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>.

    -
    -
    - -
    - - - -
    - - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/articles/benchmarks.html b/docs/dev/articles/benchmarks.html deleted file mode 100644 index 2673cfd..0000000 --- a/docs/dev/articles/benchmarks.html +++ /dev/null @@ -1,337 +0,0 @@ - - - - - - - -Comparison with `{hash}` • r2r - - - - - - - - - - - -
    -
    - - - - -
    -
    - - - - -

    This vignette provides a comparison of r2r with the same-purpose CRAN package {hash}, which also offers an implementation of hash tables based on R environments. We first describe the features offered by both packages, and then perform some benchmark timing comparisons. The package versions referred to in this vignette are:

    -
    -library(hash)
    -library(r2r)
    -packageVersion("hash")
    -#> [1] '2.2.6.1'
    -packageVersion("r2r")
    -#> [1] '0.1.1.9000'
    -
    -

    -Features

    -

    Both r2r and {hash} hash tables are built on top of the R built-in environment data structure, and have thus a similar API. In particular, hash table objects have reference semantics for both packages. r2r hashtables are S3 class objects, whereas in {hash} the data structure is implemented as an S4 class.

    -

    Hash tables provided by r2r support arbitrary type keys and values, arbitrary key comparison and hash functions, and have customizable behaviour (either throw an exception or return a default value) upon query of a missing key.

    -

    In contrast, hash tables in hash currently support only string keys, with basic identity comparison (the hashing is performed automatically by the underlying environment objects); values can be arbitrary R objects. Querying missing keys through non-vectorized [[-subsetting returns the default value NULL, whereas queries through vectorized [-subsetting result in an error. On the other hand, hash also offers support for inverting hash tables (an experimental feature at the time of writing).

    -

    The table below summarizes the features of the two packages

    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    Features supported by {r2r} and {hash}
    Featurer2rhash
    Basic data structureR environmentR environment
    Arbitrary type keysX
    Arbitrary type valuesXX
    Arbitrary hash functionX
    Arbitrary key comparison functionX
    Throw or return default on missing keysX
    Hash table inversionX
    -
    -
    -

    -Performance tests

    -

    We will perform our benchmark tests using the CRAN package microbenchmark.

    - -
    -

    -Key insertion

    -

    We start by timing the insertion of:

    -
    -N <- 1e4
    -

    random key-value pairs (with possible repetitions). In order to perform a meaningful comparison between the two packages, we restrict to string (i.e. length one character) keys. We can generate random keys as follows:

    -
    -chars <- c(letters, LETTERS, 0:9)
    -random_keys <- function(n) paste0(
    -    sample(chars, n, replace = TRUE),
    -    sample(chars, n, replace = TRUE),
    -    sample(chars, n, replace = TRUE),
    -    sample(chars, n, replace = TRUE),
    -    sample(chars, n, replace = TRUE)
    -    )
    -
    -set.seed(840)
    -keys <- random_keys(N)
    -values <- rnorm(N)
    -

    We test both the non-vectorized ([[<-) and vectorized ([<-) operators:

    -
    -microbenchmark(
    -    `r2r_[[<-` = {
    -        for (i in seq_along(keys))
    -            m_r2r[[ keys[[i]] ]] <- values[[i]]
    -    },
    -    `r2r_[<-` = { m_r2r[keys] <- values },
    -    `hash_[[<-` = { 
    -        for (i in seq_along(keys))
    -            m_hash[[ keys[[i]] ]] <- values[[i]]
    -    },
    -    `hash_[<-` = m_hash[keys] <- values,
    -    
    -    times = 30, 
    -    setup = { m_r2r <- hashmap(); m_hash <- hash() }
    -)
    -#> Unit: milliseconds
    -#>       expr       min        lq     mean   median       uq      max neval
    -#>   r2r_[[<- 120.47568 182.86525 244.1387 243.1772 304.0422 411.0924    30
    -#>    r2r_[<- 123.38350 182.98655 214.5312 215.8607 232.2120 385.5852    30
    -#>  hash_[[<- 121.26634 186.95017 223.9272 230.6890 251.0618 338.8484    30
    -#>   hash_[<-  62.37829  79.40925 115.5532 116.2670 146.9353 207.5767    30
    -

    As it is seen, r2r and hash have comparable performances at the insertion of key-value pairs, with both vectorized and non-vectorized insertions, hash being somewhat more efficient in both cases.

    -
    -
    -

    -Key query

    -

    We now test key query, again both in non-vectorized and vectorized form:

    -
    -microbenchmark(
    -    `r2r_[[` = { for (key in keys) m_r2r[[ key ]] },
    -    `r2r_[` = { m_r2r[ keys ] },
    -    `hash_[[` = { for (key in keys) m_hash[[ key ]] },
    -    `hash_[` = { m_hash[ keys ] },
    -    
    -    times = 30,
    -    setup = { 
    -        m_r2r <- hashmap(); m_r2r[keys] <- values
    -        m_hash <- hash(); m_hash[keys] <- values
    -    }
    -)
    -#> Unit: milliseconds
    -#>     expr       min        lq      mean    median        uq       max neval
    -#>   r2r_[[ 140.39407 176.18373 224.13309 226.82090 283.59444 317.34049    30
    -#>    r2r_[ 108.70052 177.57796 204.80297 205.84184 238.23730 285.59978    30
    -#>  hash_[[  15.57094  17.46111  22.46317  21.36017  25.60891  34.91532    30
    -#>   hash_[  86.42241 114.73289 145.53935 142.52136 171.77681 250.76570    30
    -

    For non-vectorized queries, hash is significantly faster (by one order of magnitude) than r2r. This is likely due to the fact that the [[ method dispatch is handled natively by R in hash (i.e. the default [[ method for environments is used ), whereas r2r suffers the overhead of S3 method dispatch. This is confirmed by the result for vectorized queries, which is comparable for the two packages; notice that here a single (rather than N) S3 method dispatch occurs in the r2r timed expression.

    -

    As an additional test, we perform the benchmarks for non-vectorized expressions with a new set of keys:

    -
    -set.seed(841)
    -new_keys <- random_keys(N)
    -microbenchmark(
    -    `r2r_[[_bis` = { for (key in new_keys) m_r2r[[ key ]] },
    -    `hash_[[_bis` = { for (key in new_keys) m_hash[[ key ]] },
    -    
    -    times = 30,
    -    setup = { 
    -        m_r2r <- hashmap(); m_r2r[keys] <- values
    -        m_hash <- hash(); m_hash[keys] <- values
    -    }
    -)
    -#> Unit: milliseconds
    -#>         expr      min        lq      mean    median        uq       max neval
    -#>   r2r_[[_bis 94.11585 118.54886 163.74233 156.59081 188.45233 294.04927    30
    -#>  hash_[[_bis 14.27472  17.64294  22.75982  21.47824  28.38551  34.33601    30
    -

    The results are similar to the ones already commented. Finally, we test the performances of the two packages in checking the existence of keys (notice that here has_key refers to r2r::has_key, whereas has.key is hash::has.key):

    -
    -set.seed(842)
    -mixed_keys <- sample(c(keys, new_keys), N)
    -microbenchmark(
    -    r2r_has_key = { for (key in mixed_keys) has_key(m_r2r, key) },
    -    hash_has_key = { for (key in new_keys) has.key(key, m_hash) },
    -    
    -    times = 30,
    -    setup = { 
    -        m_r2r <- hashmap(); m_r2r[keys] <- values
    -        m_hash <- hash(); m_hash[keys] <- values
    -    }
    -)
    -#> Unit: milliseconds
    -#>          expr       min       lq     mean   median       uq      max neval
    -#>   r2r_has_key  87.96082 116.9253 143.7786 142.9583 158.4250 242.7802    30
    -#>  hash_has_key 256.93287 325.4338 410.0415 381.8220 483.4683 793.3913    30
    -

    The results are comparable for the two packages, r2r being slightly more performant in this particular case.

    -
    -
    -

    -Key deletion

    -

    Finally, we test key deletion. In order to handle name collisions, we will use delete() (which refers to r2r::delete()) and del() (which refers to hash::del()).

    -
    -microbenchmark(
    -    r2r_delete = { for (key in keys) delete(m_r2r, key) },
    -    hash_delete = { for (key in keys) del(key, m_hash) },
    -    hash_vectorized_delete = { del(keys, m_hash) },
    -    
    -    times = 30,
    -    setup = { 
    -        m_r2r <- hashmap(); m_r2r[keys] <- values
    -        m_hash <- hash(); m_hash[keys] <- values
    -    }
    -)
    -#> Unit: milliseconds
    -#>                    expr        min         lq       mean     median         uq
    -#>              r2r_delete 447.042418 545.606133 627.458179 606.035055 718.133232
    -#>             hash_delete 216.297967 265.433382 309.916893 319.151273 354.446717
    -#>  hash_vectorized_delete   4.070514   4.670905   5.598708   5.507212   6.282724
    -#>          max neval
    -#>  1063.144923    30
    -#>   421.433838    30
    -#>     7.630347    30
    -

    The vectorized version of hash significantly outperforms the non-vectorized versions (by roughly two orders of magnitude in speed). Currently, r2r does not support vectorized key deletion 1.

    -
    -
    -
    -

    -Conclusions

    -

    The two R packages r2r and hash offer hash table implementations with different advantages and drawbacks. r2r focuses on flexibility, and has a richer set of features. hash is more minimal, but offers superior performance in some important tasks. Finally, as a positive note for both parties, the two packages share a similar API, making it relatively easy to switch between the two, according to the particular use case needs.

    -
    -
    -
    -
      -
    1. This is due to complications introduced by the internal hash collision handling system of r2r.↩︎

    2. -
    -
    -
    - - - -
    - - - -
    - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - diff --git a/docs/dev/articles/benchmarks_files/header-attrs-2.8/header-attrs.js b/docs/dev/articles/benchmarks_files/header-attrs-2.8/header-attrs.js deleted file mode 100644 index dd57d92..0000000 --- a/docs/dev/articles/benchmarks_files/header-attrs-2.8/header-attrs.js +++ /dev/null @@ -1,12 +0,0 @@ -// Pandoc 2.9 adds attributes on both header and div. We remove the former (to -// be compatible with the behavior of Pandoc < 2.8). -document.addEventListener('DOMContentLoaded', function(e) { - var hs = document.querySelectorAll("div.section[class*='level'] > :first-child"); - var i, h, a; - for (i = 0; i < hs.length; i++) { - h = hs[i]; - if (!/^h[1-6]$/i.test(h.tagName)) continue; // it should be a header h1-h6 - a = h.attributes; - while (a.length > 0) h.removeAttribute(a[0].name); - } -}); diff --git a/docs/dev/articles/index.html b/docs/dev/articles/index.html deleted file mode 100644 index 766a90e..0000000 --- a/docs/dev/articles/index.html +++ /dev/null @@ -1,161 +0,0 @@ - - - - - - - - -Articles • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    All vignettes

    -

    - -
    -
    Comparison with `{hash}`
    -
    -
    R-Object to R-Object Hash Maps
    -
    -
    -
    -
    -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/articles/r2r.html b/docs/dev/articles/r2r.html deleted file mode 100644 index 6249cc3..0000000 --- a/docs/dev/articles/r2r.html +++ /dev/null @@ -1,259 +0,0 @@ - - - - - - - -R-Object to R-Object Hash Maps • r2r - - - - - - - - - - - -
    -
    - - - - -
    -
    - - - - -
    -

    -Introduction

    -

    Hash tables are among the most useful data structures for efficient coding. An hash table can be abstractly thought as a map from a set of unique keys (which may be strings, numbers, or even more complicated objects) to a set of values. From a computational viewpoint, its most distinctive feature is that its read/write operations (i.e. storing, retrieving or deleting a particular key or key-value pair) have average \(O(1)\) time complexity, independent of the table size.

    -

    Many programming languages come with their own native implementation of hash tables (for instance std::unordered_map/sets in C++, or dicts and sets in Python); in base R, the objects which come closest to hash tables are environments. These, however, can be somewhat cumbersome to handle from the user point of view, and only support string type keys. The purpose of r2r is to provide a more flexible implementation of hash tables in R, building on top of base R environments.

    -

    In particular, r2r hash tables support:

    -
      -
    • arbitrary R objects as keys and values,
    • -
    • arbitrary key comparison and hash functions,
    • -
    • customizable behaviour (throw or return a default value) on missing key exceptions.
    • -
    -

    This document provides a quick hands-on introduction to r2r hash tables.

    - -
    -
    -

    -Basic Manipulations

    -

    We create an empty hash map with:

    -
    -m <- hashmap()
    -

    We can insert key-value pairs in m in several different ways:

    -
    -m[["key"]] <- "value"
    -m[c(1, 2, 3)] <- c("a", "b", "c") # Vectorized over keys and values
    -m[[c(4, 5, 6)]] <- c("d", "e", "f") # Not vectorized
    -

    The following queries explain the differences between the [[ and [ operator mentioned in the comments above:

    -
    -m[["key"]]
    -#> [1] "value"
    -
    -m[c(1, 2, 3)]
    -#> [[1]]
    -#> [1] "a"
    -#> 
    -#> [[2]]
    -#> [1] "b"
    -#> 
    -#> [[3]]
    -#> [1] "c"
    -m[[c(1, 2, 3)]]
    -#> NULL
    -
    -m[c(4, 5, 6)]
    -#> [[1]]
    -#> NULL
    -#> 
    -#> [[2]]
    -#> NULL
    -#> 
    -#> [[3]]
    -#> NULL
    -m[[c(4, 5, 6)]]
    -#> [1] "d" "e" "f"
    -

    Single element insertions and queries can also be performed through the generics insert() and query()

    -
    -insert(m, "user", "vgherard") # Modifies `m` in place
    -query(m, "user")
    -#> [1] "vgherard"
    -
    -
    -

    -Sets

    -

    In addition to hash maps, we can also create hash sets, which simply store keys:

    -
    -s <- hashset()
    -insert(s, 1)
    -s[[2]] <- T # equivalent to insert(s, 2)
    -s[c(1, 2, 3)]
    -#> [[1]]
    -#> [1] TRUE
    -#> 
    -#> [[2]]
    -#> [1] TRUE
    -#> 
    -#> [[3]]
    -#> [1] FALSE
    -
    -
    -

    -Key and value types

    -

    There is no restriction on the type of object you can use as keys and values. For instance:

    -
    -m[[ lm(wt ~ mpg, mtcars) ]] <- list("This is my fit!", 840)
    -m[[ lm(wt ~ mpg, mtcars) ]]
    -#> [[1]]
    -#> [1] "This is my fit!"
    -#> 
    -#> [[2]]
    -#> [1] 840
    -m[[ lm(cyl ~ mpg, mtcars) ]]
    -#> NULL
    -
    -
    -

    -Setting default values

    -

    You can set default values for missing keys. For instance:

    -
    -m <- hashmap(default = 0)
    -

    which is useful for creating a counter:

    -
    -objects <- list(1, 1, "1", FALSE, "1", 1)
    -for (object in objects)
    -    m[[object]] <- m[[object]] + 1
    -m[["1"]]
    -#> [1] 2
    -

    Alternatively, you may throw an exception upon querying a missing key:

    -
    -m <- hashmap(on_missing_key = "throw")
    -tryCatch(m[["Missing key"]], error = function(cnd) "Oops!")
    -#> [1] "Oops!"
    -
    -
    -

    -Using custom key comparison and hash functions

    -

    hashmaps and hashmaps use by default base::identical() to compare keys. For instance:

    -
    -m <- hashmap()
    -m[[1]] <- "double"
    -m[["1"]] <- "character"
    -m[[1]]
    -#> [1] "double"
    -

    This behavior can be changed by explicitly providing a key comparison function. For this to work correctly, one must also explicitly provide an hash function which produces the same hashes for equivalent keys. A simple way to do this is to apply a preprocessing function to keys, as illustrated by the following example.

    -

    We assume that keys are length one complex numbers, and consider two keys equivalent when they have the same direction in the complex plane. The direction of a complex vector can be found applying the R function Arg(), which is thus a sensible key preprocessing function. We can instruct an hashmap to preprocess its keys in this way through the constructor’s key_preproc_fn argument:

    -
    -m <- hashmap(key_preproc_fn = Arg)
    -

    Let us check that everything works as intended:

    -
    -m[list(1, 1 + 1i, 1i)] <- list("EAST", "NORTH-EAST", "NORTH")
    -m[[10]]
    -#> [1] "EAST"
    -m[[100i]]
    -#> [1] "NORTH"
    -m[[2 + 2i]]
    -#> [1] "NORTH-EAST"
    -
    -
    - - - -
    - - - -
    - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - diff --git a/docs/dev/articles/r2r_files/header-attrs-2.8/header-attrs.js b/docs/dev/articles/r2r_files/header-attrs-2.8/header-attrs.js deleted file mode 100644 index dd57d92..0000000 --- a/docs/dev/articles/r2r_files/header-attrs-2.8/header-attrs.js +++ /dev/null @@ -1,12 +0,0 @@ -// Pandoc 2.9 adds attributes on both header and div. We remove the former (to -// be compatible with the behavior of Pandoc < 2.8). -document.addEventListener('DOMContentLoaded', function(e) { - var hs = document.querySelectorAll("div.section[class*='level'] > :first-child"); - var i, h, a; - for (i = 0; i < hs.length; i++) { - h = hs[i]; - if (!/^h[1-6]$/i.test(h.tagName)) continue; // it should be a header h1-h6 - a = h.attributes; - while (a.length > 0) h.removeAttribute(a[0].name); - } -}); diff --git a/docs/dev/authors.html b/docs/dev/authors.html deleted file mode 100644 index 98eadd2..0000000 --- a/docs/dev/authors.html +++ /dev/null @@ -1,159 +0,0 @@ - - - - - - - - -Authors • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
      -
    • -

      Valerio Gherardi. Author, maintainer. -

      -
    • -
    - -
    - -
    - - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/bootstrap-toc.css b/docs/dev/bootstrap-toc.css deleted file mode 100644 index 5a85941..0000000 --- a/docs/dev/bootstrap-toc.css +++ /dev/null @@ -1,60 +0,0 @@ -/*! - * Bootstrap Table of Contents v0.4.1 (http://afeld.github.io/bootstrap-toc/) - * Copyright 2015 Aidan Feldman - * Licensed under MIT (https://github.com/afeld/bootstrap-toc/blob/gh-pages/LICENSE.md) */ - -/* modified from https://github.com/twbs/bootstrap/blob/94b4076dd2efba9af71f0b18d4ee4b163aa9e0dd/docs/assets/css/src/docs.css#L548-L601 */ - -/* All levels of nav */ -nav[data-toggle='toc'] .nav > li > a { - display: block; - padding: 4px 20px; - font-size: 13px; - font-weight: 500; - color: #767676; -} -nav[data-toggle='toc'] .nav > li > a:hover, -nav[data-toggle='toc'] .nav > li > a:focus { - padding-left: 19px; - color: #563d7c; - text-decoration: none; - background-color: transparent; - border-left: 1px solid #563d7c; -} -nav[data-toggle='toc'] .nav > .active > a, -nav[data-toggle='toc'] .nav > .active:hover > a, -nav[data-toggle='toc'] .nav > .active:focus > a { - padding-left: 18px; - font-weight: bold; - color: #563d7c; - background-color: transparent; - border-left: 2px solid #563d7c; -} - -/* Nav: second level (shown on .active) */ -nav[data-toggle='toc'] .nav .nav { - display: none; /* Hide by default, but at >768px, show it */ - padding-bottom: 10px; -} -nav[data-toggle='toc'] .nav .nav > li > a { - padding-top: 1px; - padding-bottom: 1px; - padding-left: 30px; - font-size: 12px; - font-weight: normal; -} -nav[data-toggle='toc'] .nav .nav > li > a:hover, -nav[data-toggle='toc'] .nav .nav > li > a:focus { - padding-left: 29px; -} -nav[data-toggle='toc'] .nav .nav > .active > a, -nav[data-toggle='toc'] .nav .nav > .active:hover > a, -nav[data-toggle='toc'] .nav .nav > .active:focus > a { - padding-left: 28px; - font-weight: 500; -} - -/* from https://github.com/twbs/bootstrap/blob/e38f066d8c203c3e032da0ff23cd2d6098ee2dd6/docs/assets/css/src/docs.css#L631-L634 */ -nav[data-toggle='toc'] .nav > .active > ul { - display: block; -} diff --git a/docs/dev/bootstrap-toc.js b/docs/dev/bootstrap-toc.js deleted file mode 100644 index 1cdd573..0000000 --- a/docs/dev/bootstrap-toc.js +++ /dev/null @@ -1,159 +0,0 @@ -/*! - * Bootstrap Table of Contents v0.4.1 (http://afeld.github.io/bootstrap-toc/) - * Copyright 2015 Aidan Feldman - * Licensed under MIT (https://github.com/afeld/bootstrap-toc/blob/gh-pages/LICENSE.md) */ -(function() { - 'use strict'; - - window.Toc = { - helpers: { - // return all matching elements in the set, or their descendants - findOrFilter: function($el, selector) { - // http://danielnouri.org/notes/2011/03/14/a-jquery-find-that-also-finds-the-root-element/ - // http://stackoverflow.com/a/12731439/358804 - var $descendants = $el.find(selector); - return $el.filter(selector).add($descendants).filter(':not([data-toc-skip])'); - }, - - generateUniqueIdBase: function(el) { - var text = $(el).text(); - var anchor = text.trim().toLowerCase().replace(/[^A-Za-z0-9]+/g, '-'); - return anchor || el.tagName.toLowerCase(); - }, - - generateUniqueId: function(el) { - var anchorBase = this.generateUniqueIdBase(el); - for (var i = 0; ; i++) { - var anchor = anchorBase; - if (i > 0) { - // add suffix - anchor += '-' + i; - } - // check if ID already exists - if (!document.getElementById(anchor)) { - return anchor; - } - } - }, - - generateAnchor: function(el) { - if (el.id) { - return el.id; - } else { - var anchor = this.generateUniqueId(el); - el.id = anchor; - return anchor; - } - }, - - createNavList: function() { - return $(''); - }, - - createChildNavList: function($parent) { - var $childList = this.createNavList(); - $parent.append($childList); - return $childList; - }, - - generateNavEl: function(anchor, text) { - var $a = $(''); - $a.attr('href', '#' + anchor); - $a.text(text); - var $li = $('
  • '); - $li.append($a); - return $li; - }, - - generateNavItem: function(headingEl) { - var anchor = this.generateAnchor(headingEl); - var $heading = $(headingEl); - var text = $heading.data('toc-text') || $heading.text(); - return this.generateNavEl(anchor, text); - }, - - // Find the first heading level (`

    `, then `

    `, etc.) that has more than one element. Defaults to 1 (for `

    `). - getTopLevel: function($scope) { - for (var i = 1; i <= 6; i++) { - var $headings = this.findOrFilter($scope, 'h' + i); - if ($headings.length > 1) { - return i; - } - } - - return 1; - }, - - // returns the elements for the top level, and the next below it - getHeadings: function($scope, topLevel) { - var topSelector = 'h' + topLevel; - - var secondaryLevel = topLevel + 1; - var secondarySelector = 'h' + secondaryLevel; - - return this.findOrFilter($scope, topSelector + ',' + secondarySelector); - }, - - getNavLevel: function(el) { - return parseInt(el.tagName.charAt(1), 10); - }, - - populateNav: function($topContext, topLevel, $headings) { - var $context = $topContext; - var $prevNav; - - var helpers = this; - $headings.each(function(i, el) { - var $newNav = helpers.generateNavItem(el); - var navLevel = helpers.getNavLevel(el); - - // determine the proper $context - if (navLevel === topLevel) { - // use top level - $context = $topContext; - } else if ($prevNav && $context === $topContext) { - // create a new level of the tree and switch to it - $context = helpers.createChildNavList($prevNav); - } // else use the current $context - - $context.append($newNav); - - $prevNav = $newNav; - }); - }, - - parseOps: function(arg) { - var opts; - if (arg.jquery) { - opts = { - $nav: arg - }; - } else { - opts = arg; - } - opts.$scope = opts.$scope || $(document.body); - return opts; - } - }, - - // accepts a jQuery object, or an options object - init: function(opts) { - opts = this.helpers.parseOps(opts); - - // ensure that the data attribute is in place for styling - opts.$nav.attr('data-toggle', 'toc'); - - var $topContext = this.helpers.createChildNavList(opts.$nav); - var topLevel = this.helpers.getTopLevel(opts.$scope); - var $headings = this.helpers.getHeadings(opts.$scope, topLevel); - this.helpers.populateNav($topContext, topLevel, $headings); - } - }; - - $(function() { - $('nav[data-toggle="toc"]').each(function(i, el) { - var $nav = $(el); - Toc.init($nav); - }); - }); -})(); diff --git a/docs/dev/docsearch.css b/docs/dev/docsearch.css deleted file mode 100644 index e5f1fe1..0000000 --- a/docs/dev/docsearch.css +++ /dev/null @@ -1,148 +0,0 @@ -/* Docsearch -------------------------------------------------------------- */ -/* - Source: https://github.com/algolia/docsearch/ - License: MIT -*/ - -.algolia-autocomplete { - display: block; - -webkit-box-flex: 1; - -ms-flex: 1; - flex: 1 -} - -.algolia-autocomplete .ds-dropdown-menu { - width: 100%; - min-width: none; - max-width: none; - padding: .75rem 0; - background-color: #fff; - background-clip: padding-box; - border: 1px solid rgba(0, 0, 0, .1); - box-shadow: 0 .5rem 1rem rgba(0, 0, 0, .175); -} - -@media (min-width:768px) { - .algolia-autocomplete .ds-dropdown-menu { - width: 175% - } -} - -.algolia-autocomplete .ds-dropdown-menu::before { - display: none -} - -.algolia-autocomplete .ds-dropdown-menu [class^=ds-dataset-] { - padding: 0; - background-color: rgb(255,255,255); - border: 0; - max-height: 80vh; -} - -.algolia-autocomplete .ds-dropdown-menu .ds-suggestions { - margin-top: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion { - padding: 0; - overflow: visible -} - -.algolia-autocomplete .algolia-docsearch-suggestion--category-header { - padding: .125rem 1rem; - margin-top: 0; - font-size: 1.3em; - font-weight: 500; - color: #00008B; - border-bottom: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--wrapper { - float: none; - padding-top: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--subcategory-column { - float: none; - width: auto; - padding: 0; - text-align: left -} - -.algolia-autocomplete .algolia-docsearch-suggestion--content { - float: none; - width: auto; - padding: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--content::before { - display: none -} - -.algolia-autocomplete .ds-suggestion:not(:first-child) .algolia-docsearch-suggestion--category-header { - padding-top: .75rem; - margin-top: .75rem; - border-top: 1px solid rgba(0, 0, 0, .1) -} - -.algolia-autocomplete .ds-suggestion .algolia-docsearch-suggestion--subcategory-column { - display: block; - padding: .1rem 1rem; - margin-bottom: 0.1; - font-size: 1.0em; - font-weight: 400 - /* display: none */ -} - -.algolia-autocomplete .algolia-docsearch-suggestion--title { - display: block; - padding: .25rem 1rem; - margin-bottom: 0; - font-size: 0.9em; - font-weight: 400 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--text { - padding: 0 1rem .5rem; - margin-top: -.25rem; - font-size: 0.8em; - font-weight: 400; - line-height: 1.25 -} - -.algolia-autocomplete .algolia-docsearch-footer { - width: 110px; - height: 20px; - z-index: 3; - margin-top: 10.66667px; - float: right; - font-size: 0; - line-height: 0; -} - -.algolia-autocomplete .algolia-docsearch-footer--logo { - background-image: url("data:image/svg+xml;utf8,"); - background-repeat: no-repeat; - background-position: 50%; - background-size: 100%; - overflow: hidden; - text-indent: -9000px; - width: 100%; - height: 100%; - display: block; - transform: translate(-8px); -} - -.algolia-autocomplete .algolia-docsearch-suggestion--highlight { - color: #FF8C00; - background: rgba(232, 189, 54, 0.1) -} - - -.algolia-autocomplete .algolia-docsearch-suggestion--text .algolia-docsearch-suggestion--highlight { - box-shadow: inset 0 -2px 0 0 rgba(105, 105, 105, .5) -} - -.algolia-autocomplete .ds-suggestion.ds-cursor .algolia-docsearch-suggestion--content { - background-color: rgba(192, 192, 192, .15) -} diff --git a/docs/dev/docsearch.js b/docs/dev/docsearch.js deleted file mode 100644 index b35504c..0000000 --- a/docs/dev/docsearch.js +++ /dev/null @@ -1,85 +0,0 @@ -$(function() { - - // register a handler to move the focus to the search bar - // upon pressing shift + "/" (i.e. "?") - $(document).on('keydown', function(e) { - if (e.shiftKey && e.keyCode == 191) { - e.preventDefault(); - $("#search-input").focus(); - } - }); - - $(document).ready(function() { - // do keyword highlighting - /* modified from https://jsfiddle.net/julmot/bL6bb5oo/ */ - var mark = function() { - - var referrer = document.URL ; - var paramKey = "q" ; - - if (referrer.indexOf("?") !== -1) { - var qs = referrer.substr(referrer.indexOf('?') + 1); - var qs_noanchor = qs.split('#')[0]; - var qsa = qs_noanchor.split('&'); - var keyword = ""; - - for (var i = 0; i < qsa.length; i++) { - var currentParam = qsa[i].split('='); - - if (currentParam.length !== 2) { - continue; - } - - if (currentParam[0] == paramKey) { - keyword = decodeURIComponent(currentParam[1].replace(/\+/g, "%20")); - } - } - - if (keyword !== "") { - $(".contents").unmark({ - done: function() { - $(".contents").mark(keyword); - } - }); - } - } - }; - - mark(); - }); -}); - -/* Search term highlighting ------------------------------*/ - -function matchedWords(hit) { - var words = []; - - var hierarchy = hit._highlightResult.hierarchy; - // loop to fetch from lvl0, lvl1, etc. - for (var idx in hierarchy) { - words = words.concat(hierarchy[idx].matchedWords); - } - - var content = hit._highlightResult.content; - if (content) { - words = words.concat(content.matchedWords); - } - - // return unique words - var words_uniq = [...new Set(words)]; - return words_uniq; -} - -function updateHitURL(hit) { - - var words = matchedWords(hit); - var url = ""; - - if (hit.anchor) { - url = hit.url_without_anchor + '?q=' + escape(words.join(" ")) + '#' + hit.anchor; - } else { - url = hit.url + '?q=' + escape(words.join(" ")); - } - - return url; -} diff --git a/docs/dev/index.html b/docs/dev/index.html deleted file mode 100644 index 32d19f6..0000000 --- a/docs/dev/index.html +++ /dev/null @@ -1,270 +0,0 @@ - - - - - - - -R-Object to R-Object Hash Maps • r2r - - - - - - - - - - - -
    -
    - - - - -
    -
    -
    - - - -

    r2r provides a flexible implementation of hash tables in R, allowing for:

    -
      -
    • arbitrary R objects as keys and values,
    • -
    • arbitrary key comparison and hash functions,
    • -
    • customizable behaviour (throw or return a default value) on missing key exceptions.
    • -
    -
    -

    -Installation

    -

    You can install the released version of r2r from CRAN with:

    - -

    and the development version from my R-universe repository, with:

    -
    -install.packages("r2r", repos = "https://vgherard.r-universe.dev")
    -
    -
    -

    -Usage

    -
    -library(r2r)
    -m <- hashmap()
    -
    -# Insert and query a single key-value pair
    -m[[ "user" ]] <- "vgherard"
    -m[[ "user" ]]
    -#> [1] "vgherard"
    -
    -# Insert and query multiple key-value pairs
    -m[ c(1, 2, 3) ] <- c("one", "two", "three")
    -m[ c(1, 3) ]
    -#> [[1]]
    -#> [1] "one"
    -#> 
    -#> [[2]]
    -#> [1] "three"
    -
    -# Keys and values can be arbitrary R objects
    -m[[ lm(mpg ~ wt, mtcars) ]] <- c(TRUE, FALSE, TRUE)
    -m[[ lm(mpg ~ wt, mtcars) ]]
    -#> [1]  TRUE FALSE  TRUE
    -
    -
    -

    -Getting help

    -

    For further details, including an introductory vignette illustrating the features of r2r hash maps, you can consult the r2r website. If you encounter a bug, want to suggest a feature or need further help, you can open a GitHub issue.

    -
    -
    -

    -Comparison with hash -

    -

    CRAN package {hash} also offers an implementation of hash tables based on R environments. The two tables below offer a comparison between r2r and {hash} (for more details, see the benchmarks Vignette)

    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    Featurer2rhash
    Basic data structureR environmentR environment
    Arbitrary type keysX
    Arbitrary type valuesXX
    Arbitrary hash functionX
    Arbitrary key comparison functionX
    Throw or return default on missing keysX
    Hash table inversionX
    -

    Features supported by {r2r} and {hash}.

    - - - - - - - - - - - - - - - - - - - -
    TaskComparison
    Key insertion{r2r} ~ {hash}
    Key query{r2r} < {hash}
    Key deletion{r2r} << {hash}
    -

    Performances of {r2r} and {hash} for basic hash table operations.

    -
    -
    -
    - - -
    - - -
    - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - diff --git a/docs/dev/link.svg b/docs/dev/link.svg deleted file mode 100644 index 88ad827..0000000 --- a/docs/dev/link.svg +++ /dev/null @@ -1,12 +0,0 @@ - - - - - - diff --git a/docs/dev/pkgdown.css b/docs/dev/pkgdown.css deleted file mode 100644 index 1273238..0000000 --- a/docs/dev/pkgdown.css +++ /dev/null @@ -1,367 +0,0 @@ -/* Sticky footer */ - -/** - * Basic idea: https://philipwalton.github.io/solved-by-flexbox/demos/sticky-footer/ - * Details: https://github.com/philipwalton/solved-by-flexbox/blob/master/assets/css/components/site.css - * - * .Site -> body > .container - * .Site-content -> body > .container .row - * .footer -> footer - * - * Key idea seems to be to ensure that .container and __all its parents__ - * have height set to 100% - * - */ - -html, body { - height: 100%; -} - -body { - position: relative; -} - -body > .container { - display: flex; - height: 100%; - flex-direction: column; -} - -body > .container .row { - flex: 1 0 auto; -} - -footer { - margin-top: 45px; - padding: 35px 0 36px; - border-top: 1px solid #e5e5e5; - color: #666; - display: flex; - flex-shrink: 0; -} -footer p { - margin-bottom: 0; -} -footer div { - flex: 1; -} -footer .pkgdown { - text-align: right; -} -footer p { - margin-bottom: 0; -} - -img.icon { - float: right; -} - -img { - max-width: 100%; -} - -/* Fix bug in bootstrap (only seen in firefox) */ -summary { - display: list-item; -} - -/* Typographic tweaking ---------------------------------*/ - -.contents .page-header { - margin-top: calc(-60px + 1em); -} - -dd { - margin-left: 3em; -} - -/* Section anchors ---------------------------------*/ - -a.anchor { - margin-left: -30px; - display:inline-block; - width: 30px; - height: 30px; - visibility: hidden; - - background-image: url(./link.svg); - background-repeat: no-repeat; - background-size: 20px 20px; - background-position: center center; -} - -.hasAnchor:hover a.anchor { - visibility: visible; -} - -@media (max-width: 767px) { - .hasAnchor:hover a.anchor { - visibility: hidden; - } -} - - -/* Fixes for fixed navbar --------------------------*/ - -.contents h1, .contents h2, .contents h3, .contents h4 { - padding-top: 60px; - margin-top: -40px; -} - -/* Navbar submenu --------------------------*/ - -.dropdown-submenu { - position: relative; -} - -.dropdown-submenu>.dropdown-menu { - top: 0; - left: 100%; - margin-top: -6px; - margin-left: -1px; - border-radius: 0 6px 6px 6px; -} - -.dropdown-submenu:hover>.dropdown-menu { - display: block; -} - -.dropdown-submenu>a:after { - display: block; - content: " "; - float: right; - width: 0; - height: 0; - border-color: transparent; - border-style: solid; - border-width: 5px 0 5px 5px; - border-left-color: #cccccc; - margin-top: 5px; - margin-right: -10px; -} - -.dropdown-submenu:hover>a:after { - border-left-color: #ffffff; -} - -.dropdown-submenu.pull-left { - float: none; -} - -.dropdown-submenu.pull-left>.dropdown-menu { - left: -100%; - margin-left: 10px; - border-radius: 6px 0 6px 6px; -} - -/* Sidebar --------------------------*/ - -#pkgdown-sidebar { - margin-top: 30px; - position: -webkit-sticky; - position: sticky; - top: 70px; -} - -#pkgdown-sidebar h2 { - font-size: 1.5em; - margin-top: 1em; -} - -#pkgdown-sidebar h2:first-child { - margin-top: 0; -} - -#pkgdown-sidebar .list-unstyled li { - margin-bottom: 0.5em; -} - -/* bootstrap-toc tweaks ------------------------------------------------------*/ - -/* All levels of nav */ - -nav[data-toggle='toc'] .nav > li > a { - padding: 4px 20px 4px 6px; - font-size: 1.5rem; - font-weight: 400; - color: inherit; -} - -nav[data-toggle='toc'] .nav > li > a:hover, -nav[data-toggle='toc'] .nav > li > a:focus { - padding-left: 5px; - color: inherit; - border-left: 1px solid #878787; -} - -nav[data-toggle='toc'] .nav > .active > a, -nav[data-toggle='toc'] .nav > .active:hover > a, -nav[data-toggle='toc'] .nav > .active:focus > a { - padding-left: 5px; - font-size: 1.5rem; - font-weight: 400; - color: inherit; - border-left: 2px solid #878787; -} - -/* Nav: second level (shown on .active) */ - -nav[data-toggle='toc'] .nav .nav { - display: none; /* Hide by default, but at >768px, show it */ - padding-bottom: 10px; -} - -nav[data-toggle='toc'] .nav .nav > li > a { - padding-left: 16px; - font-size: 1.35rem; -} - -nav[data-toggle='toc'] .nav .nav > li > a:hover, -nav[data-toggle='toc'] .nav .nav > li > a:focus { - padding-left: 15px; -} - -nav[data-toggle='toc'] .nav .nav > .active > a, -nav[data-toggle='toc'] .nav .nav > .active:hover > a, -nav[data-toggle='toc'] .nav .nav > .active:focus > a { - padding-left: 15px; - font-weight: 500; - font-size: 1.35rem; -} - -/* orcid ------------------------------------------------------------------- */ - -.orcid { - font-size: 16px; - color: #A6CE39; - /* margins are required by official ORCID trademark and display guidelines */ - margin-left:4px; - margin-right:4px; - vertical-align: middle; -} - -/* Reference index & topics ----------------------------------------------- */ - -.ref-index th {font-weight: normal;} - -.ref-index td {vertical-align: top; min-width: 100px} -.ref-index .icon {width: 40px;} -.ref-index .alias {width: 40%;} -.ref-index-icons .alias {width: calc(40% - 40px);} -.ref-index .title {width: 60%;} - -.ref-arguments th {text-align: right; padding-right: 10px;} -.ref-arguments th, .ref-arguments td {vertical-align: top; min-width: 100px} -.ref-arguments .name {width: 20%;} -.ref-arguments .desc {width: 80%;} - -/* Nice scrolling for wide elements --------------------------------------- */ - -table { - display: block; - overflow: auto; -} - -/* Syntax highlighting ---------------------------------------------------- */ - -pre { - word-wrap: normal; - word-break: normal; - border: 1px solid #eee; -} - -pre, code { - background-color: #f8f8f8; - color: #333; -} - -pre code { - overflow: auto; - word-wrap: normal; - white-space: pre; -} - -pre .img { - margin: 5px 0; -} - -pre .img img { - background-color: #fff; - display: block; - height: auto; -} - -code a, pre a { - color: #375f84; -} - -a.sourceLine:hover { - text-decoration: none; -} - -.fl {color: #1514b5;} -.fu {color: #000000;} /* function */ -.ch,.st {color: #036a07;} /* string */ -.kw {color: #264D66;} /* keyword */ -.co {color: #888888;} /* comment */ - -.message { color: black; font-weight: bolder;} -.error { color: orange; font-weight: bolder;} -.warning { color: #6A0366; font-weight: bolder;} - -/* Clipboard --------------------------*/ - -.hasCopyButton { - position: relative; -} - -.btn-copy-ex { - position: absolute; - right: 0; - top: 0; - visibility: hidden; -} - -.hasCopyButton:hover button.btn-copy-ex { - visibility: visible; -} - -/* headroom.js ------------------------ */ - -.headroom { - will-change: transform; - transition: transform 200ms linear; -} -.headroom--pinned { - transform: translateY(0%); -} -.headroom--unpinned { - transform: translateY(-100%); -} - -/* mark.js ----------------------------*/ - -mark { - background-color: rgba(255, 255, 51, 0.5); - border-bottom: 2px solid rgba(255, 153, 51, 0.3); - padding: 1px; -} - -/* vertical spacing after htmlwidgets */ -.html-widget { - margin-bottom: 10px; -} - -/* fontawesome ------------------------ */ - -.fab { - font-family: "Font Awesome 5 Brands" !important; -} - -/* don't display links in code chunks when printing */ -/* source: https://stackoverflow.com/a/10781533 */ -@media print { - code a:link:after, code a:visited:after { - content: ""; - } -} diff --git a/docs/dev/pkgdown.js b/docs/dev/pkgdown.js deleted file mode 100644 index 7e7048f..0000000 --- a/docs/dev/pkgdown.js +++ /dev/null @@ -1,108 +0,0 @@ -/* http://gregfranko.com/blog/jquery-best-practices/ */ -(function($) { - $(function() { - - $('.navbar-fixed-top').headroom(); - - $('body').css('padding-top', $('.navbar').height() + 10); - $(window).resize(function(){ - $('body').css('padding-top', $('.navbar').height() + 10); - }); - - $('[data-toggle="tooltip"]').tooltip(); - - var cur_path = paths(location.pathname); - var links = $("#navbar ul li a"); - var max_length = -1; - var pos = -1; - for (var i = 0; i < links.length; i++) { - if (links[i].getAttribute("href") === "#") - continue; - // Ignore external links - if (links[i].host !== location.host) - continue; - - var nav_path = paths(links[i].pathname); - - var length = prefix_length(nav_path, cur_path); - if (length > max_length) { - max_length = length; - pos = i; - } - } - - // Add class to parent
  • , and enclosing
  • if in dropdown - if (pos >= 0) { - var menu_anchor = $(links[pos]); - menu_anchor.parent().addClass("active"); - menu_anchor.closest("li.dropdown").addClass("active"); - } - }); - - function paths(pathname) { - var pieces = pathname.split("/"); - pieces.shift(); // always starts with / - - var end = pieces[pieces.length - 1]; - if (end === "index.html" || end === "") - pieces.pop(); - return(pieces); - } - - // Returns -1 if not found - function prefix_length(needle, haystack) { - if (needle.length > haystack.length) - return(-1); - - // Special case for length-0 haystack, since for loop won't run - if (haystack.length === 0) { - return(needle.length === 0 ? 0 : -1); - } - - for (var i = 0; i < haystack.length; i++) { - if (needle[i] != haystack[i]) - return(i); - } - - return(haystack.length); - } - - /* Clipboard --------------------------*/ - - function changeTooltipMessage(element, msg) { - var tooltipOriginalTitle=element.getAttribute('data-original-title'); - element.setAttribute('data-original-title', msg); - $(element).tooltip('show'); - element.setAttribute('data-original-title', tooltipOriginalTitle); - } - - if(ClipboardJS.isSupported()) { - $(document).ready(function() { - var copyButton = ""; - - $(".examples, div.sourceCode").addClass("hasCopyButton"); - - // Insert copy buttons: - $(copyButton).prependTo(".hasCopyButton"); - - // Initialize tooltips: - $('.btn-copy-ex').tooltip({container: 'body'}); - - // Initialize clipboard: - var clipboardBtnCopies = new ClipboardJS('[data-clipboard-copy]', { - text: function(trigger) { - return trigger.parentNode.textContent; - } - }); - - clipboardBtnCopies.on('success', function(e) { - changeTooltipMessage(e.trigger, 'Copied!'); - e.clearSelection(); - }); - - clipboardBtnCopies.on('error', function() { - changeTooltipMessage(e.trigger,'Press Ctrl+C or Command+C to copy'); - }); - }); - } -})(window.jQuery || window.$) diff --git a/docs/dev/pkgdown.yml b/docs/dev/pkgdown.yml deleted file mode 100644 index ed61c05..0000000 --- a/docs/dev/pkgdown.yml +++ /dev/null @@ -1,11 +0,0 @@ -pandoc: 2.11.4 -pkgdown: 1.6.1 -pkgdown_sha: ~ -articles: - benchmarks: benchmarks.html - r2r: r2r.html -last_built: 2021-07-06T13:06Z -urls: - reference: https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference - article: https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/articles - diff --git a/docs/dev/reference/Rplot001.png b/docs/dev/reference/Rplot001.png deleted file mode 100644 index 17a3580..0000000 Binary files a/docs/dev/reference/Rplot001.png and /dev/null differ diff --git a/docs/dev/reference/compare_fn.html b/docs/dev/reference/compare_fn.html deleted file mode 100644 index e742df1..0000000 --- a/docs/dev/reference/compare_fn.html +++ /dev/null @@ -1,192 +0,0 @@ - - - - - - - - -Get key comparison function of an hash table — compare_fn • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Returns the key comparison function of an hash table -(hashset or hashmap).

    -
    - -
    compare_fn(x)
    -
    -# S3 method for r2r_hashtable
    -compare_fn(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a function.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -compare_fn(s) -
    #> function (x, y) -#> compare_fn(key_preproc_fn(x), key_preproc_fn(y)) -#> <bytecode: 0x562a8aad7120> -#> <environment: 0x562a8aad6908>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/default.html b/docs/dev/reference/default.html deleted file mode 100644 index aeb0280..0000000 --- a/docs/dev/reference/default.html +++ /dev/null @@ -1,203 +0,0 @@ - - - - - - - - -Default hashmap values — default • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used to get or set the default value of an -hashmap, optionally returned upon query of a missing key.

    -
    - -
    default(x)
    -
    -default(x) <- value
    -
    -# S3 method for r2r_hashmap
    -default(x)
    -
    -# S3 method for r2r_hashmap
    -default(x) <- value
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashmap.

    value

    an arbitrary R object. Default value to be associated to missing -keys in the hashmap.

    - -

    Value

    - -

    an arbitrary R object.

    -

    Details

    - -

    For more details, see the hashtable documentation page.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap() -default(m) -
    #> NULL
    default(m) <- 840 -
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/default_hash_fn.html b/docs/dev/reference/default_hash_fn.html deleted file mode 100644 index 781e8fb..0000000 --- a/docs/dev/reference/default_hash_fn.html +++ /dev/null @@ -1,190 +0,0 @@ - - - - - - - - -String hashes for arbitrary R objects — default_hash_fn • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    generates string hashes for arbitrary R objects as follows. -This is the default hash function used by hashsets and hashmaps -objects.

    -
    - -
    default_hash_fn(key)
    - -

    Arguments

    - - - - - - -
    key

    an arbitrary R object.

    - -

    Value

    - -

    a character vector of length one. Hash digest of key.

    -

    Details

    - -

    If key is an atomic vector (as tested by -is.atomic(key)) of length one, default_hash_fn(key) simply -coerces the input to character. For more complex inputs, the function calls -digest(key) from the digest package.

    -

    Author

    - -

    Valerio Gherardi

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/delete.html b/docs/dev/reference/delete.html deleted file mode 100644 index 75e6ae9..0000000 --- a/docs/dev/reference/delete.html +++ /dev/null @@ -1,197 +0,0 @@ - - - - - - - - -Delete keys or key/value pairs from an hash table. — delete • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for deleting a single key or key/value -pair from an hashset or hashmap, respectively.

    -
    - -
    delete(x, key)
    -
    -# S3 method for r2r_hashmap
    -delete(x, key)
    -
    -# S3 method for r2r_hashset
    -delete(x, key)
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be deleted from the hash table.

    - -

    Value

    - -

    NULL, invisibly.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset(1, 2, 3) -delete(s, 3) -s[[3]] -
    #> [1] FALSE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/has_key.html b/docs/dev/reference/has_key.html deleted file mode 100644 index 1fa18bd..0000000 --- a/docs/dev/reference/has_key.html +++ /dev/null @@ -1,200 +0,0 @@ - - - - - - - - -Key existence in hash tables — has_key • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    This generics are used to check whether a key exists in a given -hashset or hashmap.

    -
    - -
    has_key(x, key)
    -
    -x %has_key% key
    -
    -# S3 method for r2r_hashmap
    -has_key(x, key)
    -
    -# S3 method for r2r_hashset
    -has_key(x, key)
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be checked for existence in the -hash table.

    - -

    Value

    - -

    TRUE or FALSE.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap(list("a", 1), list("b", 2)) -has_key(m, "a") -
    #> [1] TRUE
    m %has_key% "b" -
    #> [1] TRUE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/hash_fn.html b/docs/dev/reference/hash_fn.html deleted file mode 100644 index 5c9431f..0000000 --- a/docs/dev/reference/hash_fn.html +++ /dev/null @@ -1,192 +0,0 @@ - - - - - - - - -Get hash function of an hash table — hash_fn • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Returns the hash function used for key hashing in an hash table -(hashset or hashmap).

    -
    - -
    hash_fn(x)
    -
    -# S3 method for r2r_hashtable
    -hash_fn(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a function.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -hash_fn(s) -
    #> function (x) -#> hash_fn(key_preproc_fn(x)) -#> <bytecode: 0x562a8aad73c0> -#> <environment: 0x562a8a91a7d0>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/hashtable.html b/docs/dev/reference/hashtable.html deleted file mode 100644 index 93b69c1..0000000 --- a/docs/dev/reference/hashtable.html +++ /dev/null @@ -1,283 +0,0 @@ - - - - - - - - -Hash maps and sets — hashtable • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Objects of class hashmap and hashset store -collections of key/value pairs (hashmap), or just keys -(hashset), providing constant time read and write operations. Both -the keys and the optional values can be arbitrary R objects. hashmaps -and hashsets provide an R implementation of -hash tables.

    -

    See hashtable_methods for an overview of the available methods -for hashmap and hashset class objects. Note that both these -classes have a common parent class hashtable, from which they can also -inherit S3 methods.

    -
    - -
    hashmap(
    -  ...,
    -  hash_fn = default_hash_fn,
    -  compare_fn = identical,
    -  key_preproc_fn = identity,
    -  on_missing_key = "default",
    -  default = NULL
    -)
    -
    -hashset(
    -  ...,
    -  hash_fn = default_hash_fn,
    -  compare_fn = identical,
    -  key_preproc_fn = identity
    -)
    - -

    Arguments

    - - - - - - - - - - - - - - - - - - - - - - - - - - -
    ...

    these arguments can be used to specify a set of initial elements -to be inserted in the hashmap or hashset. For hashmap(), -each of these should be a list of two elements (a key-value pair).

    hash_fn

    the (string valued) hash function applied to keys. -Required for advanced use only; see Details.

    compare_fn

    the (boolean valued) comparison function used for -testing key equality. Required for advanced use only; see Details.

    key_preproc_fn

    key pre-processing function applied to keys before -hashing and comparison. Required for advanced use only; see Details.

    on_missing_key

    either "throw" or "default". -In the second case, an exception is thrown upon query of a missing key; otherwise, a default value -(specified through the default argument) is returned.

    default

    default value associated with missing keys. This will be -returned only if on_missing_key is equal to "default".

    - -

    Value

    - -

    a hashmap and a hashset class object for -hashmap() and hashset(), respectively.

    -

    Details

    - -

    hashmaps and hashsets implement hash tables, -building on top of base R built-in environments, -which by themselves are, essentially, string -> R object hash maps. -In order to handle keys of non-string type, a string valued hash function -default_hash_fn() is provided, which leverages on -digest() for handling arbitrary R object keys.

    -

    By default, key equality is tested through identical(). -For some use cases, it may be sensible to employ a different comparison -function, which can be assigned through the compare_fn argument. In this -case, one must also make sure that equal (in the sense of -compare_fn()) -keys get also assigned the same hashes by hash_fn(). A simple way to -ensure this is to use to use a key pre-processing function, to be applied -before both key hashing and comparison. The key_preproc_fn -argument provides a short-cut to this, by automatically composing both the -provided hash_fn() and compare_fn() functions with -key_preproc_fn() function. This is illustrated in an example below.

    -

    One might also want to set set specific hash and/or key comparison functions -for efficiency reasons, e.g. if the default_hash_fn() function produces -many collisions between inequivalent keys.

    -

    When on_missing_key is equal to "throw", querying a missing -key will cause an error. In this case, an rlang abort -condition of class "r2r_missing_key" is returned, which can be useful -for testing purposes.

    -

    See also

    - - -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap( - list("foo", 1), - list("bar", 1:5), - list(data.frame(x = letters, y = LETTERS), "baz") - ) -m[[ data.frame(x = letters, y = LETTERS) ]] -
    #> [1] "baz"
    -# Set of character keys, case insensitive. -s <- hashset("A", "B", "C", key_preproc = tolower) -s[["a"]] -
    #> [1] FALSE
    -
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/hashtable_methods.html b/docs/dev/reference/hashtable_methods.html deleted file mode 100644 index cb74f75..0000000 --- a/docs/dev/reference/hashtable_methods.html +++ /dev/null @@ -1,246 +0,0 @@ - - - - - - - - -Methods for S3 classes hashmap and hashset — hashtable_methods • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    This page provides an overview of the available methods for -hashmap and hashset objects (and for their common parent class -hashtable). We list methods based on the general type of task -addressed.

    Basic read/write operations

    - - - - -

    Size of hash table

    - - - - -

    Other key or value access operations

    - - - - -

    Get/set hashtable properties

    - - - - -
    - - - -

    Author

    - -

    Valerio Gherardi

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/index.html b/docs/dev/reference/index.html deleted file mode 100644 index 0184abb..0000000 --- a/docs/dev/reference/index.html +++ /dev/null @@ -1,269 +0,0 @@ - - - - - - - - -Function reference • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    All functions

    -

    -
    -

    compare_fn()

    -

    Get key comparison function of an hash table

    -

    default() `default<-`()

    -

    Default hashmap values

    -

    default_hash_fn()

    -

    String hashes for arbitrary R objects

    -

    delete()

    -

    Delete keys or key/value pairs from an hash table.

    -

    has_key() `%has_key%`

    -

    Key existence in hash tables

    -

    hash_fn()

    -

    Get hash function of an hash table

    -

    hashmap() hashset()

    -

    Hash maps and sets

    -

    hashtable_methods

    -

    Methods for S3 classes hashmap and hashset

    -

    insert()

    -

    Insert keys or key/value pairs into an hash table.

    -

    keys()

    -

    List all keys from an hash table

    -

    length(<r2r_hashtable>)

    -

    Size of hash tables

    -

    on_missing_key() `on_missing_key<-`()

    -

    On missing key behaviour

    -

    query()

    -

    Query keys from an hash table.

    -

    `[[`(<r2r_hashmap>) `[`(<r2r_hashmap>) `[[<-`(<r2r_hashmap>) `[<-`(<r2r_hashmap>) `[[`(<r2r_hashset>) `[`(<r2r_hashset>) `[[<-`(<r2r_hashset>) `[<-`(<r2r_hashset>)

    -

    Subsetting hashsets and hashmaps

    -

    values()

    -

    List all values from an hash map

    -
    - - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/insert.html b/docs/dev/reference/insert.html deleted file mode 100644 index 4f3c82a..0000000 --- a/docs/dev/reference/insert.html +++ /dev/null @@ -1,208 +0,0 @@ - - - - - - - - -Insert keys or key/value pairs into an hash table. — insert • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for inserting a single key or key/value -pair into an hashset or hashmap, respectively. For vectorized -insertions, see the subsetting_hashtables documentation page.

    -
    - -
    insert(x, key, ...)
    -
    -# S3 method for r2r_hashmap
    -insert(x, key, value, ...)
    -
    -# S3 method for r2r_hashset
    -insert(x, key, ...)
    - -

    Arguments

    - - - - - - - - - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be inserted into the hash table.

    ...

    further arguments passed to or from other methods.

    value

    an arbitrary R object. Value associated to key.

    - -

    Value

    - -

    key for the hashset method, -value for the hashmap method.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -insert(s, "foo") -s[["foo"]] -
    #> [1] TRUE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/keys.html b/docs/dev/reference/keys.html deleted file mode 100644 index 11d6097..0000000 --- a/docs/dev/reference/keys.html +++ /dev/null @@ -1,197 +0,0 @@ - - - - - - - - -List all keys from an hash table — keys • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for listing all keys registered in an -hashset or hashmap, respectively.

    -
    - -
    keys(x)
    -
    -# S3 method for r2r_hashtable
    -keys(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a list. Registered keys in the hash table x.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset(1, 2, 3) -keys(s) -
    #> [[1]] -#> [1] 1 -#> -#> [[2]] -#> [1] 2 -#> -#> [[3]] -#> [1] 3 -#>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/length.r2r_hashtable.html b/docs/dev/reference/length.r2r_hashtable.html deleted file mode 100644 index a564bde..0000000 --- a/docs/dev/reference/length.r2r_hashtable.html +++ /dev/null @@ -1,186 +0,0 @@ - - - - - - - - -Size of hash tables — length.r2r_hashtable • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Returns the total number of keys in an hash table.

    -
    - -
    # S3 method for r2r_hashtable
    -length(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    an integer. Number of keys in the hash table (or elements in a set).

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -insert(s, "foo") -length(s) -
    #> [1] 1
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/on_missing_key.html b/docs/dev/reference/on_missing_key.html deleted file mode 100644 index 44b7a93..0000000 --- a/docs/dev/reference/on_missing_key.html +++ /dev/null @@ -1,205 +0,0 @@ - - - - - - - - -On missing key behaviour — on_missing_key • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used to get or set the behaviour of an -hashmap upon query of a missing key (currently, only an -hashmap method is implemented).

    -
    - -
    on_missing_key(x)
    -
    -on_missing_key(x) <- value
    -
    -# S3 method for r2r_hashmap
    -on_missing_key(x)
    -
    -# S3 method for r2r_hashmap
    -on_missing_key(x) <- value
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashmap.

    value

    a string, either "throw" or "default". Action to -be taken upon query of a missing key.

    - -

    Value

    - -

    a string, either "throw" or "default".

    -

    Details

    - -

    For more details, see the hashtable documentation page.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap() -on_missing_key(m) -
    #> [1] "default"
    on_missing_key(m) <- "throw" -
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/query.html b/docs/dev/reference/query.html deleted file mode 100644 index cc48130..0000000 --- a/docs/dev/reference/query.html +++ /dev/null @@ -1,202 +0,0 @@ - - - - - - - - -Query keys from an hash table. — query • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for querying a single key from an -hashset or hashmap, respectively. For vectorized queries, -see the subsetting_hashtables documentation page.

    -
    - -
    query(x, key)
    -
    -# S3 method for r2r_hashmap
    -query(x, key)
    -
    -# S3 method for r2r_hashset
    -query(x, key)
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be queried from the hash table.

    - -

    Value

    - -

    TRUE or FALSE, for hashsets. For -hashmaps, if the queried key exists in the hash table, returns the -associated value (an a priori arbitrary R object); otherwise, behaves as -specified by on_missing_key(x) -(see also hashtable).

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset(1, 2, 3) -query(s, 3) -
    #> [1] TRUE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/r2r-package.html b/docs/dev/reference/r2r-package.html deleted file mode 100644 index 4f259c5..0000000 --- a/docs/dev/reference/r2r-package.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - -r2r: R-Object to R-Object Hash Maps — r2r-package • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Implementation of hash tables (hash sets and hash maps) in R, - featuring arbitrary R objects as keys, - arbitrary hash and key-comparison functions, - and customizable behaviour upon queries of missing keys.

    -
    - - - -

    See also

    - - -

    Author

    - -

    Maintainer: Valerio Gherardi vgherard@sissa.it (ORCID)

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/subsetting_hashtables.html b/docs/dev/reference/subsetting_hashtables.html deleted file mode 100644 index 7bdf0f8..0000000 --- a/docs/dev/reference/subsetting_hashtables.html +++ /dev/null @@ -1,233 +0,0 @@ - - - - - - - - -Subsetting hashsets and hashmaps — subsetting_hashtables • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Subsetting operators `[[` and `[` for -hashsets and hashmaps provide an equivalent synthax for the -basic read/write operations performed by insert(), -delete() and query().

    -
    - -
    # S3 method for r2r_hashmap
    -[[(x, i)
    -
    -# S3 method for r2r_hashmap
    -[(x, i)
    -
    -# S3 method for r2r_hashmap
    -[[(x, i) <- value
    -
    -# S3 method for r2r_hashmap
    -[(x, i) <- value
    -
    -# S3 method for r2r_hashset
    -[[(x, i)
    -
    -# S3 method for r2r_hashset
    -[(x, i)
    -
    -# S3 method for r2r_hashset
    -[[(x, i) <- value
    -
    -# S3 method for r2r_hashset
    -[(x, i) <- value
    - -

    Arguments

    - - - - - - - - - - - - - - -
    x

    an hashset or hashmap.

    i

    for `[[`-subsetting, an arbitrary R object, the key to be -queried or inserted/deleted from the hash tables. For `[`-subsetting, -a list or an atomic vector whose individual elements correspond to the keys.

    value

    for `[[`-subsetting: TRUE or FALSE if -x is an hashset, an arbitrary R object if x is an -hashmap. In the case of hashsets, setting a key's value to -TRUE and FALSE is equivalent to inserting and deleting, -respectively, such key from the set. For `[`-subsetting, value -must be a list or an atomic vector of the same length of i, -whose individual elements are the values associated to the corresponding -keys in the hash table.

    - -

    Value

    - -

    the replacement forms ([[<- and [<-) always return value. -`[[` returns TRUE or FALSE if -x is an hashset, an arbitrary R object if x is an -hashmap and i is a valid key; when i is not a key, the -behaviour for hashmaps depends on the value of -on_missing_key(x). -The `[` operator returns a list of the same length of i, whose -k-th element is given by x[[ i[[k]] ]] (the remark on missing keys for -hashmaps applies also here).

    -

    Author

    - -

    Valerio Gherardi

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/reference/values.html b/docs/dev/reference/values.html deleted file mode 100644 index 681894e..0000000 --- a/docs/dev/reference/values.html +++ /dev/null @@ -1,196 +0,0 @@ - - - - - - - - -List all values from an hash map — values • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    This function is used to list all values associated to keys in -an hashmap. Implemented as a generic, but currently only the -hashmap method is defined.

    -
    - -
    values(x)
    -
    -# S3 method for r2r_hashmap
    -values(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a list. Values associated to keys in the hash map x.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap(list("a", 1), list("b", 2)) -values(m) -
    #> [[1]] -#> [1] 1 -#> -#> [[2]] -#> [1] 2 -#>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/dev/sitemap.xml b/docs/dev/sitemap.xml deleted file mode 100644 index 86ba1fe..0000000 --- a/docs/dev/sitemap.xml +++ /dev/null @@ -1,60 +0,0 @@ - - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/index.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/compare_fn.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/default.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/default_hash_fn.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/delete.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/has_key.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/hash_fn.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/hashtable.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/hashtable_methods.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/insert.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/keys.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/length.r2r_hashtable.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/on_missing_key.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/query.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/r2r-package.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/subsetting_hashtables.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/values.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/articles/benchmarks.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/articles/r2r.html - - diff --git a/docs/docsearch.css b/docs/docsearch.css deleted file mode 100644 index e5f1fe1..0000000 --- a/docs/docsearch.css +++ /dev/null @@ -1,148 +0,0 @@ -/* Docsearch -------------------------------------------------------------- */ -/* - Source: https://github.com/algolia/docsearch/ - License: MIT -*/ - -.algolia-autocomplete { - display: block; - -webkit-box-flex: 1; - -ms-flex: 1; - flex: 1 -} - -.algolia-autocomplete .ds-dropdown-menu { - width: 100%; - min-width: none; - max-width: none; - padding: .75rem 0; - background-color: #fff; - background-clip: padding-box; - border: 1px solid rgba(0, 0, 0, .1); - box-shadow: 0 .5rem 1rem rgba(0, 0, 0, .175); -} - -@media (min-width:768px) { - .algolia-autocomplete .ds-dropdown-menu { - width: 175% - } -} - -.algolia-autocomplete .ds-dropdown-menu::before { - display: none -} - -.algolia-autocomplete .ds-dropdown-menu [class^=ds-dataset-] { - padding: 0; - background-color: rgb(255,255,255); - border: 0; - max-height: 80vh; -} - -.algolia-autocomplete .ds-dropdown-menu .ds-suggestions { - margin-top: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion { - padding: 0; - overflow: visible -} - -.algolia-autocomplete .algolia-docsearch-suggestion--category-header { - padding: .125rem 1rem; - margin-top: 0; - font-size: 1.3em; - font-weight: 500; - color: #00008B; - border-bottom: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--wrapper { - float: none; - padding-top: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--subcategory-column { - float: none; - width: auto; - padding: 0; - text-align: left -} - -.algolia-autocomplete .algolia-docsearch-suggestion--content { - float: none; - width: auto; - padding: 0 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--content::before { - display: none -} - -.algolia-autocomplete .ds-suggestion:not(:first-child) .algolia-docsearch-suggestion--category-header { - padding-top: .75rem; - margin-top: .75rem; - border-top: 1px solid rgba(0, 0, 0, .1) -} - -.algolia-autocomplete .ds-suggestion .algolia-docsearch-suggestion--subcategory-column { - display: block; - padding: .1rem 1rem; - margin-bottom: 0.1; - font-size: 1.0em; - font-weight: 400 - /* display: none */ -} - -.algolia-autocomplete .algolia-docsearch-suggestion--title { - display: block; - padding: .25rem 1rem; - margin-bottom: 0; - font-size: 0.9em; - font-weight: 400 -} - -.algolia-autocomplete .algolia-docsearch-suggestion--text { - padding: 0 1rem .5rem; - margin-top: -.25rem; - font-size: 0.8em; - font-weight: 400; - line-height: 1.25 -} - -.algolia-autocomplete .algolia-docsearch-footer { - width: 110px; - height: 20px; - z-index: 3; - margin-top: 10.66667px; - float: right; - font-size: 0; - line-height: 0; -} - -.algolia-autocomplete .algolia-docsearch-footer--logo { - background-image: url("data:image/svg+xml;utf8,"); - background-repeat: no-repeat; - background-position: 50%; - background-size: 100%; - overflow: hidden; - text-indent: -9000px; - width: 100%; - height: 100%; - display: block; - transform: translate(-8px); -} - -.algolia-autocomplete .algolia-docsearch-suggestion--highlight { - color: #FF8C00; - background: rgba(232, 189, 54, 0.1) -} - - -.algolia-autocomplete .algolia-docsearch-suggestion--text .algolia-docsearch-suggestion--highlight { - box-shadow: inset 0 -2px 0 0 rgba(105, 105, 105, .5) -} - -.algolia-autocomplete .ds-suggestion.ds-cursor .algolia-docsearch-suggestion--content { - background-color: rgba(192, 192, 192, .15) -} diff --git a/docs/docsearch.js b/docs/docsearch.js deleted file mode 100644 index b35504c..0000000 --- a/docs/docsearch.js +++ /dev/null @@ -1,85 +0,0 @@ -$(function() { - - // register a handler to move the focus to the search bar - // upon pressing shift + "/" (i.e. "?") - $(document).on('keydown', function(e) { - if (e.shiftKey && e.keyCode == 191) { - e.preventDefault(); - $("#search-input").focus(); - } - }); - - $(document).ready(function() { - // do keyword highlighting - /* modified from https://jsfiddle.net/julmot/bL6bb5oo/ */ - var mark = function() { - - var referrer = document.URL ; - var paramKey = "q" ; - - if (referrer.indexOf("?") !== -1) { - var qs = referrer.substr(referrer.indexOf('?') + 1); - var qs_noanchor = qs.split('#')[0]; - var qsa = qs_noanchor.split('&'); - var keyword = ""; - - for (var i = 0; i < qsa.length; i++) { - var currentParam = qsa[i].split('='); - - if (currentParam.length !== 2) { - continue; - } - - if (currentParam[0] == paramKey) { - keyword = decodeURIComponent(currentParam[1].replace(/\+/g, "%20")); - } - } - - if (keyword !== "") { - $(".contents").unmark({ - done: function() { - $(".contents").mark(keyword); - } - }); - } - } - }; - - mark(); - }); -}); - -/* Search term highlighting ------------------------------*/ - -function matchedWords(hit) { - var words = []; - - var hierarchy = hit._highlightResult.hierarchy; - // loop to fetch from lvl0, lvl1, etc. - for (var idx in hierarchy) { - words = words.concat(hierarchy[idx].matchedWords); - } - - var content = hit._highlightResult.content; - if (content) { - words = words.concat(content.matchedWords); - } - - // return unique words - var words_uniq = [...new Set(words)]; - return words_uniq; -} - -function updateHitURL(hit) { - - var words = matchedWords(hit); - var url = ""; - - if (hit.anchor) { - url = hit.url_without_anchor + '?q=' + escape(words.join(" ")) + '#' + hit.anchor; - } else { - url = hit.url + '?q=' + escape(words.join(" ")); - } - - return url; -} diff --git a/docs/index.html b/docs/index.html deleted file mode 100644 index 3d27209..0000000 --- a/docs/index.html +++ /dev/null @@ -1,268 +0,0 @@ - - - - - - - -R-Object to R-Object Hash Maps • r2r - - - - - - - - - - -
    -
    - - - - -
    -
    -
    - - - -

    r2r provides a flexible implementation of hash tables in R, allowing for:

    -
      -
    • arbitrary R objects as keys and values,
    • -
    • arbitrary key comparison and hash functions,
    • -
    • customizable behaviour (throw or return a default value) on missing key exceptions.
    • -
    -
    -

    -Installation

    -

    You can install the released version of r2r from CRAN with:

    - -

    and the development version from my R-universe repository, with:

    -
    -install.packages("r2r", repos = "https://vgherard.r-universe.dev")
    -
    -
    -

    -Usage

    -
    -library(r2r)
    -m <- hashmap()
    -
    -# Insert and query a single key-value pair
    -m[[ "user" ]] <- "vgherard"
    -m[[ "user" ]]
    -#> [1] "vgherard"
    -
    -# Insert and query multiple key-value pairs
    -m[ c(1, 2, 3) ] <- c("one", "two", "three")
    -m[ c(1, 3) ]
    -#> [[1]]
    -#> [1] "one"
    -#> 
    -#> [[2]]
    -#> [1] "three"
    -
    -# Keys and values can be arbitrary R objects
    -m[[ lm(mpg ~ wt, mtcars) ]] <- c(TRUE, FALSE, TRUE)
    -m[[ lm(mpg ~ wt, mtcars) ]]
    -#> [1]  TRUE FALSE  TRUE
    -
    -
    -

    -Getting help

    -

    For further details, including an introductory vignette illustrating the features of r2r hash maps, you can consult the r2r website. If you encounter a bug, want to suggest a feature or need further help, you can open a GitHub issue.

    -
    -
    -

    -Comparison with hash -

    -

    CRAN package {hash} also offers an implementation of hash tables based on R environments. The two tables below offer a comparison between r2r and {hash} (for more details, see the benchmarks Vignette)

    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    Featurer2rhash
    Basic data structureR environmentR environment
    Arbitrary type keysX
    Arbitrary type valuesXX
    Arbitrary hash functionX
    Arbitrary key comparison functionX
    Throw or return default on missing keysX
    Hash table inversionX
    -

    Features supported by {r2r} and {hash}.

    - - - - - - - - - - - - - - - - - - - -
    TaskComparison
    Key insertion{r2r} ~ {hash}
    Key query{r2r} < {hash}
    Key deletion{r2r} << {hash}
    -

    Performances of {r2r} and {hash} for basic hash table operations.

    -
    -
    -
    - - -
    - - -
    - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - diff --git a/docs/link.svg b/docs/link.svg deleted file mode 100644 index 88ad827..0000000 --- a/docs/link.svg +++ /dev/null @@ -1,12 +0,0 @@ - - - - - - diff --git a/docs/pkgdown.css b/docs/pkgdown.css deleted file mode 100644 index 1273238..0000000 --- a/docs/pkgdown.css +++ /dev/null @@ -1,367 +0,0 @@ -/* Sticky footer */ - -/** - * Basic idea: https://philipwalton.github.io/solved-by-flexbox/demos/sticky-footer/ - * Details: https://github.com/philipwalton/solved-by-flexbox/blob/master/assets/css/components/site.css - * - * .Site -> body > .container - * .Site-content -> body > .container .row - * .footer -> footer - * - * Key idea seems to be to ensure that .container and __all its parents__ - * have height set to 100% - * - */ - -html, body { - height: 100%; -} - -body { - position: relative; -} - -body > .container { - display: flex; - height: 100%; - flex-direction: column; -} - -body > .container .row { - flex: 1 0 auto; -} - -footer { - margin-top: 45px; - padding: 35px 0 36px; - border-top: 1px solid #e5e5e5; - color: #666; - display: flex; - flex-shrink: 0; -} -footer p { - margin-bottom: 0; -} -footer div { - flex: 1; -} -footer .pkgdown { - text-align: right; -} -footer p { - margin-bottom: 0; -} - -img.icon { - float: right; -} - -img { - max-width: 100%; -} - -/* Fix bug in bootstrap (only seen in firefox) */ -summary { - display: list-item; -} - -/* Typographic tweaking ---------------------------------*/ - -.contents .page-header { - margin-top: calc(-60px + 1em); -} - -dd { - margin-left: 3em; -} - -/* Section anchors ---------------------------------*/ - -a.anchor { - margin-left: -30px; - display:inline-block; - width: 30px; - height: 30px; - visibility: hidden; - - background-image: url(./link.svg); - background-repeat: no-repeat; - background-size: 20px 20px; - background-position: center center; -} - -.hasAnchor:hover a.anchor { - visibility: visible; -} - -@media (max-width: 767px) { - .hasAnchor:hover a.anchor { - visibility: hidden; - } -} - - -/* Fixes for fixed navbar --------------------------*/ - -.contents h1, .contents h2, .contents h3, .contents h4 { - padding-top: 60px; - margin-top: -40px; -} - -/* Navbar submenu --------------------------*/ - -.dropdown-submenu { - position: relative; -} - -.dropdown-submenu>.dropdown-menu { - top: 0; - left: 100%; - margin-top: -6px; - margin-left: -1px; - border-radius: 0 6px 6px 6px; -} - -.dropdown-submenu:hover>.dropdown-menu { - display: block; -} - -.dropdown-submenu>a:after { - display: block; - content: " "; - float: right; - width: 0; - height: 0; - border-color: transparent; - border-style: solid; - border-width: 5px 0 5px 5px; - border-left-color: #cccccc; - margin-top: 5px; - margin-right: -10px; -} - -.dropdown-submenu:hover>a:after { - border-left-color: #ffffff; -} - -.dropdown-submenu.pull-left { - float: none; -} - -.dropdown-submenu.pull-left>.dropdown-menu { - left: -100%; - margin-left: 10px; - border-radius: 6px 0 6px 6px; -} - -/* Sidebar --------------------------*/ - -#pkgdown-sidebar { - margin-top: 30px; - position: -webkit-sticky; - position: sticky; - top: 70px; -} - -#pkgdown-sidebar h2 { - font-size: 1.5em; - margin-top: 1em; -} - -#pkgdown-sidebar h2:first-child { - margin-top: 0; -} - -#pkgdown-sidebar .list-unstyled li { - margin-bottom: 0.5em; -} - -/* bootstrap-toc tweaks ------------------------------------------------------*/ - -/* All levels of nav */ - -nav[data-toggle='toc'] .nav > li > a { - padding: 4px 20px 4px 6px; - font-size: 1.5rem; - font-weight: 400; - color: inherit; -} - -nav[data-toggle='toc'] .nav > li > a:hover, -nav[data-toggle='toc'] .nav > li > a:focus { - padding-left: 5px; - color: inherit; - border-left: 1px solid #878787; -} - -nav[data-toggle='toc'] .nav > .active > a, -nav[data-toggle='toc'] .nav > .active:hover > a, -nav[data-toggle='toc'] .nav > .active:focus > a { - padding-left: 5px; - font-size: 1.5rem; - font-weight: 400; - color: inherit; - border-left: 2px solid #878787; -} - -/* Nav: second level (shown on .active) */ - -nav[data-toggle='toc'] .nav .nav { - display: none; /* Hide by default, but at >768px, show it */ - padding-bottom: 10px; -} - -nav[data-toggle='toc'] .nav .nav > li > a { - padding-left: 16px; - font-size: 1.35rem; -} - -nav[data-toggle='toc'] .nav .nav > li > a:hover, -nav[data-toggle='toc'] .nav .nav > li > a:focus { - padding-left: 15px; -} - -nav[data-toggle='toc'] .nav .nav > .active > a, -nav[data-toggle='toc'] .nav .nav > .active:hover > a, -nav[data-toggle='toc'] .nav .nav > .active:focus > a { - padding-left: 15px; - font-weight: 500; - font-size: 1.35rem; -} - -/* orcid ------------------------------------------------------------------- */ - -.orcid { - font-size: 16px; - color: #A6CE39; - /* margins are required by official ORCID trademark and display guidelines */ - margin-left:4px; - margin-right:4px; - vertical-align: middle; -} - -/* Reference index & topics ----------------------------------------------- */ - -.ref-index th {font-weight: normal;} - -.ref-index td {vertical-align: top; min-width: 100px} -.ref-index .icon {width: 40px;} -.ref-index .alias {width: 40%;} -.ref-index-icons .alias {width: calc(40% - 40px);} -.ref-index .title {width: 60%;} - -.ref-arguments th {text-align: right; padding-right: 10px;} -.ref-arguments th, .ref-arguments td {vertical-align: top; min-width: 100px} -.ref-arguments .name {width: 20%;} -.ref-arguments .desc {width: 80%;} - -/* Nice scrolling for wide elements --------------------------------------- */ - -table { - display: block; - overflow: auto; -} - -/* Syntax highlighting ---------------------------------------------------- */ - -pre { - word-wrap: normal; - word-break: normal; - border: 1px solid #eee; -} - -pre, code { - background-color: #f8f8f8; - color: #333; -} - -pre code { - overflow: auto; - word-wrap: normal; - white-space: pre; -} - -pre .img { - margin: 5px 0; -} - -pre .img img { - background-color: #fff; - display: block; - height: auto; -} - -code a, pre a { - color: #375f84; -} - -a.sourceLine:hover { - text-decoration: none; -} - -.fl {color: #1514b5;} -.fu {color: #000000;} /* function */ -.ch,.st {color: #036a07;} /* string */ -.kw {color: #264D66;} /* keyword */ -.co {color: #888888;} /* comment */ - -.message { color: black; font-weight: bolder;} -.error { color: orange; font-weight: bolder;} -.warning { color: #6A0366; font-weight: bolder;} - -/* Clipboard --------------------------*/ - -.hasCopyButton { - position: relative; -} - -.btn-copy-ex { - position: absolute; - right: 0; - top: 0; - visibility: hidden; -} - -.hasCopyButton:hover button.btn-copy-ex { - visibility: visible; -} - -/* headroom.js ------------------------ */ - -.headroom { - will-change: transform; - transition: transform 200ms linear; -} -.headroom--pinned { - transform: translateY(0%); -} -.headroom--unpinned { - transform: translateY(-100%); -} - -/* mark.js ----------------------------*/ - -mark { - background-color: rgba(255, 255, 51, 0.5); - border-bottom: 2px solid rgba(255, 153, 51, 0.3); - padding: 1px; -} - -/* vertical spacing after htmlwidgets */ -.html-widget { - margin-bottom: 10px; -} - -/* fontawesome ------------------------ */ - -.fab { - font-family: "Font Awesome 5 Brands" !important; -} - -/* don't display links in code chunks when printing */ -/* source: https://stackoverflow.com/a/10781533 */ -@media print { - code a:link:after, code a:visited:after { - content: ""; - } -} diff --git a/docs/pkgdown.js b/docs/pkgdown.js deleted file mode 100644 index 7e7048f..0000000 --- a/docs/pkgdown.js +++ /dev/null @@ -1,108 +0,0 @@ -/* http://gregfranko.com/blog/jquery-best-practices/ */ -(function($) { - $(function() { - - $('.navbar-fixed-top').headroom(); - - $('body').css('padding-top', $('.navbar').height() + 10); - $(window).resize(function(){ - $('body').css('padding-top', $('.navbar').height() + 10); - }); - - $('[data-toggle="tooltip"]').tooltip(); - - var cur_path = paths(location.pathname); - var links = $("#navbar ul li a"); - var max_length = -1; - var pos = -1; - for (var i = 0; i < links.length; i++) { - if (links[i].getAttribute("href") === "#") - continue; - // Ignore external links - if (links[i].host !== location.host) - continue; - - var nav_path = paths(links[i].pathname); - - var length = prefix_length(nav_path, cur_path); - if (length > max_length) { - max_length = length; - pos = i; - } - } - - // Add class to parent
  • , and enclosing
  • if in dropdown - if (pos >= 0) { - var menu_anchor = $(links[pos]); - menu_anchor.parent().addClass("active"); - menu_anchor.closest("li.dropdown").addClass("active"); - } - }); - - function paths(pathname) { - var pieces = pathname.split("/"); - pieces.shift(); // always starts with / - - var end = pieces[pieces.length - 1]; - if (end === "index.html" || end === "") - pieces.pop(); - return(pieces); - } - - // Returns -1 if not found - function prefix_length(needle, haystack) { - if (needle.length > haystack.length) - return(-1); - - // Special case for length-0 haystack, since for loop won't run - if (haystack.length === 0) { - return(needle.length === 0 ? 0 : -1); - } - - for (var i = 0; i < haystack.length; i++) { - if (needle[i] != haystack[i]) - return(i); - } - - return(haystack.length); - } - - /* Clipboard --------------------------*/ - - function changeTooltipMessage(element, msg) { - var tooltipOriginalTitle=element.getAttribute('data-original-title'); - element.setAttribute('data-original-title', msg); - $(element).tooltip('show'); - element.setAttribute('data-original-title', tooltipOriginalTitle); - } - - if(ClipboardJS.isSupported()) { - $(document).ready(function() { - var copyButton = ""; - - $(".examples, div.sourceCode").addClass("hasCopyButton"); - - // Insert copy buttons: - $(copyButton).prependTo(".hasCopyButton"); - - // Initialize tooltips: - $('.btn-copy-ex').tooltip({container: 'body'}); - - // Initialize clipboard: - var clipboardBtnCopies = new ClipboardJS('[data-clipboard-copy]', { - text: function(trigger) { - return trigger.parentNode.textContent; - } - }); - - clipboardBtnCopies.on('success', function(e) { - changeTooltipMessage(e.trigger, 'Copied!'); - e.clearSelection(); - }); - - clipboardBtnCopies.on('error', function() { - changeTooltipMessage(e.trigger,'Press Ctrl+C or Command+C to copy'); - }); - }); - } -})(window.jQuery || window.$) diff --git a/docs/pkgdown.yml b/docs/pkgdown.yml deleted file mode 100644 index 6956cfe..0000000 --- a/docs/pkgdown.yml +++ /dev/null @@ -1,11 +0,0 @@ -pandoc: 2.11.4 -pkgdown: 1.6.1 -pkgdown_sha: ~ -articles: - benchmarks: benchmarks.html - r2r: r2r.html -last_built: 2021-07-05T11:20Z -urls: - reference: https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference - article: https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/articles - diff --git a/docs/reference/Rplot001.png b/docs/reference/Rplot001.png deleted file mode 100644 index 17a3580..0000000 Binary files a/docs/reference/Rplot001.png and /dev/null differ diff --git a/docs/reference/compare_fn.html b/docs/reference/compare_fn.html deleted file mode 100644 index c4795e6..0000000 --- a/docs/reference/compare_fn.html +++ /dev/null @@ -1,192 +0,0 @@ - - - - - - - - -Get key comparison function of an hash table — compare_fn • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Returns the key comparison function of an hash table -(hashset or hashmap).

    -
    - -
    compare_fn(x)
    -
    -# S3 method for r2r_hashtable
    -compare_fn(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a function.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -compare_fn(s) -
    #> function (x, y) -#> compare_fn(key_preproc_fn(x), key_preproc_fn(y)) -#> <bytecode: 0x55a10d88e100> -#> <environment: 0x55a10d891718>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/default.html b/docs/reference/default.html deleted file mode 100644 index 01c3c97..0000000 --- a/docs/reference/default.html +++ /dev/null @@ -1,203 +0,0 @@ - - - - - - - - -Default hashmap values — default • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used to get or set the default value of an -hashmap, optionally returned upon query of a missing key.

    -
    - -
    default(x)
    -
    -default(x) <- value
    -
    -# S3 method for r2r_hashmap
    -default(x)
    -
    -# S3 method for r2r_hashmap
    -default(x) <- value
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashmap.

    value

    an arbitrary R object. Default value to be associated to missing -keys in the hashmap.

    - -

    Value

    - -

    an arbitrary R object.

    -

    Details

    - -

    For more details, see the hashtable documentation page.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap() -default(m) -
    #> NULL
    default(m) <- 840 -
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/default_hash_fn.html b/docs/reference/default_hash_fn.html deleted file mode 100644 index 91d7b22..0000000 --- a/docs/reference/default_hash_fn.html +++ /dev/null @@ -1,190 +0,0 @@ - - - - - - - - -String hashes for arbitrary R objects — default_hash_fn • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    generates string hashes for arbitrary R objects as follows. -This is the default hash function used by hashsets and hashmaps -objects.

    -
    - -
    default_hash_fn(key)
    - -

    Arguments

    - - - - - - -
    key

    an arbitrary R object.

    - -

    Value

    - -

    a character vector of length one. Hash digest of key.

    -

    Details

    - -

    If key is an atomic vector (as tested by -is.atomic(key)) of length one, default_hash_fn(key) simply -coerces the input to character. For more complex inputs, the function calls -digest(key) from the digest package.

    -

    Author

    - -

    Valerio Gherardi

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/delete.html b/docs/reference/delete.html deleted file mode 100644 index 0f506a8..0000000 --- a/docs/reference/delete.html +++ /dev/null @@ -1,197 +0,0 @@ - - - - - - - - -Delete keys or key/value pairs from an hash table. — delete • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for deleting a single key or key/value -pair from an hashset or hashmap, respectively.

    -
    - -
    delete(x, key)
    -
    -# S3 method for r2r_hashmap
    -delete(x, key)
    -
    -# S3 method for r2r_hashset
    -delete(x, key)
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be deleted from the hash table.

    - -

    Value

    - -

    NULL, invisibly.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset(1, 2, 3) -delete(s, 3) -s[[3]] -
    #> [1] FALSE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/has_key.html b/docs/reference/has_key.html deleted file mode 100644 index 65896e0..0000000 --- a/docs/reference/has_key.html +++ /dev/null @@ -1,200 +0,0 @@ - - - - - - - - -Key existence in hash tables — has_key • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    This generics are used to check whether a key exists in a given -hashset or hashmap.

    -
    - -
    has_key(x, key)
    -
    -x %has_key% key
    -
    -# S3 method for r2r_hashmap
    -has_key(x, key)
    -
    -# S3 method for r2r_hashset
    -has_key(x, key)
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be checked for existence in the -hash table.

    - -

    Value

    - -

    TRUE or FALSE.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap(list("a", 1), list("b", 2)) -has_key(m, "a") -
    #> [1] TRUE
    m %has_key% "b" -
    #> [1] TRUE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/hash_fn.html b/docs/reference/hash_fn.html deleted file mode 100644 index e23c82d..0000000 --- a/docs/reference/hash_fn.html +++ /dev/null @@ -1,192 +0,0 @@ - - - - - - - - -Get hash function of an hash table — hash_fn • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Returns the hash function used for key hashing in an hash table -(hashset or hashmap).

    -
    - -
    hash_fn(x)
    -
    -# S3 method for r2r_hashtable
    -hash_fn(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a function.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -hash_fn(s) -
    #> function (x) -#> hash_fn(key_preproc_fn(x)) -#> <bytecode: 0x55a10d88e3a0> -#> <environment: 0x55a10d8157d8>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/hashtable.html b/docs/reference/hashtable.html deleted file mode 100644 index 3ed70ee..0000000 --- a/docs/reference/hashtable.html +++ /dev/null @@ -1,283 +0,0 @@ - - - - - - - - -Hash maps and sets — hashtable • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Objects of class hashmap and hashset store -collections of key/value pairs (hashmap), or just keys -(hashset), providing constant time read and write operations. Both -the keys and the optional values can be arbitrary R objects. hashmaps -and hashsets provide an R implementation of -hash tables.

    -

    See hashtable_methods for an overview of the available methods -for hashmap and hashset class objects. Note that both these -classes have a common parent class hashtable, from which they can also -inherit S3 methods.

    -
    - -
    hashmap(
    -  ...,
    -  hash_fn = default_hash_fn,
    -  compare_fn = identical,
    -  key_preproc_fn = identity,
    -  on_missing_key = "default",
    -  default = NULL
    -)
    -
    -hashset(
    -  ...,
    -  hash_fn = default_hash_fn,
    -  compare_fn = identical,
    -  key_preproc_fn = identity
    -)
    - -

    Arguments

    - - - - - - - - - - - - - - - - - - - - - - - - - - -
    ...

    these arguments can be used to specify a set of initial elements -to be inserted in the hashmap or hashset. For hashmap(), -each of these should be a list of two elements (a key-value pair).

    hash_fn

    the (string valued) hash function applied to keys. -Required for advanced use only; see Details.

    compare_fn

    the (boolean valued) comparison function used for -testing key equality. Required for advanced use only; see Details.

    key_preproc_fn

    key pre-processing function applied to keys before -hashing and comparison. Required for advanced use only; see Details.

    on_missing_key

    either "throw" or "default". -In the second case, an exception is thrown upon query of a missing key; otherwise, a default value -(specified through the default argument) is returned.

    default

    default value associated with missing keys. This will be -returned only if on_missing_key is equal to "default".

    - -

    Value

    - -

    a hashmap and a hashset class object for -hashmap() and hashset(), respectively.

    -

    Details

    - -

    hashmaps and hashsets implement hash tables, -building on top of base R built-in environments, -which by themselves are, essentially, string -> R object hash maps. -In order to handle keys of non-string type, a string valued hash function -default_hash_fn() is provided, which leverages on -digest() for handling arbitrary R object keys.

    -

    By default, key equality is tested through identical(). -For some use cases, it may be sensible to employ a different comparison -function, which can be assigned through the compare_fn argument. In this -case, one must also make sure that equal (in the sense of -compare_fn()) -keys get also assigned the same hashes by hash_fn(). A simple way to -ensure this is to use to use a key pre-processing function, to be applied -before both key hashing and comparison. The key_preproc_fn -argument provides a short-cut to this, by automatically composing both the -provided hash_fn() and compare_fn() functions with -key_preproc_fn() function. This is illustrated in an example below.

    -

    One might also want to set set specific hash and/or key comparison functions -for efficiency reasons, e.g. if the default_hash_fn() function produces -many collisions between inequivalent keys.

    -

    When on_missing_key is equal to "throw", querying a missing -key will cause an error. In this case, an rlang abort -condition of class "r2r_missing_key" is returned, which can be useful -for testing purposes.

    -

    See also

    - - -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap( - list("foo", 1), - list("bar", 1:5), - list(data.frame(x = letters, y = LETTERS), "baz") - ) -m[[ data.frame(x = letters, y = LETTERS) ]] -
    #> [1] "baz"
    -# Set of character keys, case insensitive. -s <- hashset("A", "B", "C", key_preproc = tolower) -s[["a"]] -
    #> [1] FALSE
    -
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/hashtable_methods.html b/docs/reference/hashtable_methods.html deleted file mode 100644 index 9012e3c..0000000 --- a/docs/reference/hashtable_methods.html +++ /dev/null @@ -1,246 +0,0 @@ - - - - - - - - -Methods for S3 classes hashmap and hashset — hashtable_methods • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    This page provides an overview of the available methods for -hashmap and hashset objects (and for their common parent class -hashtable). We list methods based on the general type of task -addressed.

    Basic read/write operations

    - - - - -

    Size of hash table

    - - - - -

    Other key or value access operations

    - - - - -

    Get/set hashtable properties

    - - - - -
    - - - -

    Author

    - -

    Valerio Gherardi

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/hashtable_properties.html b/docs/reference/hashtable_properties.html deleted file mode 100644 index 0f01ec0..0000000 --- a/docs/reference/hashtable_properties.html +++ /dev/null @@ -1,178 +0,0 @@ - - - - - - - - -Hash table properties — hashtable_properties • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    This generics are used to get and (where allowed) set various -properties of hashset and hashmap objects.

    -
    - - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Author

    - -

    Valerio Gherardi

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/index.html b/docs/reference/index.html deleted file mode 100644 index 933baf7..0000000 --- a/docs/reference/index.html +++ /dev/null @@ -1,269 +0,0 @@ - - - - - - - - -Function reference • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -

    All functions

    -

    -
    -

    compare_fn()

    -

    Get key comparison function of an hash table

    -

    default() `default<-`()

    -

    Default hashmap values

    -

    default_hash_fn()

    -

    String hashes for arbitrary R objects

    -

    delete()

    -

    Delete keys or key/value pairs from an hash table.

    -

    has_key() `%has_key%`

    -

    Key existence in hash tables

    -

    hash_fn()

    -

    Get hash function of an hash table

    -

    hashmap() hashset()

    -

    Hash maps and sets

    -

    hashtable_methods

    -

    Methods for S3 classes hashmap and hashset

    -

    insert()

    -

    Insert keys or key/value pairs into an hash table.

    -

    keys()

    -

    List all keys from an hash table

    -

    length(<r2r_hashtable>)

    -

    Size of hash tables

    -

    on_missing_key() `on_missing_key<-`()

    -

    On missing key behaviour

    -

    query()

    -

    Query keys from an hash table.

    -

    `[[`(<r2r_hashmap>) `[`(<r2r_hashmap>) `[[<-`(<r2r_hashmap>) `[<-`(<r2r_hashmap>) `[[`(<r2r_hashset>) `[`(<r2r_hashset>) `[[<-`(<r2r_hashset>) `[<-`(<r2r_hashset>)

    -

    Subsetting hashsets and hashmaps

    -

    values()

    -

    List all values from an hash map

    -
    - - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/insert.html b/docs/reference/insert.html deleted file mode 100644 index 47c6d5e..0000000 --- a/docs/reference/insert.html +++ /dev/null @@ -1,208 +0,0 @@ - - - - - - - - -Insert keys or key/value pairs into an hash table. — insert • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for inserting a single key or key/value -pair into an hashset or hashmap, respectively. For vectorized -insertions, see the subsetting_hashtables documentation page.

    -
    - -
    insert(x, key, ...)
    -
    -# S3 method for r2r_hashmap
    -insert(x, key, value, ...)
    -
    -# S3 method for r2r_hashset
    -insert(x, key, ...)
    - -

    Arguments

    - - - - - - - - - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be inserted into the hash table.

    ...

    further arguments passed to or from other methods.

    value

    an arbitrary R object. Value associated to key.

    - -

    Value

    - -

    key for the hashset method, -value for the hashmap method.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -insert(s, "foo") -s[["foo"]] -
    #> [1] TRUE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/keys.html b/docs/reference/keys.html deleted file mode 100644 index f3e9fe3..0000000 --- a/docs/reference/keys.html +++ /dev/null @@ -1,197 +0,0 @@ - - - - - - - - -List all keys from an hash table — keys • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for listing all keys registered in an -hashset or hashmap, respectively.

    -
    - -
    keys(x)
    -
    -# S3 method for r2r_hashtable
    -keys(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a list. Registered keys in the hash table x.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset(1, 2, 3) -keys(s) -
    #> [[1]] -#> [1] 1 -#> -#> [[2]] -#> [1] 2 -#> -#> [[3]] -#> [1] 3 -#>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/length.r2r_hashtable.html b/docs/reference/length.r2r_hashtable.html deleted file mode 100644 index 856fd93..0000000 --- a/docs/reference/length.r2r_hashtable.html +++ /dev/null @@ -1,186 +0,0 @@ - - - - - - - - -Size of hash tables — length.r2r_hashtable • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Returns the total number of keys in an hash table.

    -
    - -
    # S3 method for r2r_hashtable
    -length(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    an integer. Number of keys in the hash table (or elements in a set).

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset() -insert(s, "foo") -length(s) -
    #> [1] 1
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/on_missing_key.html b/docs/reference/on_missing_key.html deleted file mode 100644 index a87867a..0000000 --- a/docs/reference/on_missing_key.html +++ /dev/null @@ -1,205 +0,0 @@ - - - - - - - - -On missing key behaviour — on_missing_key • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used to get or set the behaviour of an -hashmap upon query of a missing key (currently, only an -hashmap method is implemented).

    -
    - -
    on_missing_key(x)
    -
    -on_missing_key(x) <- value
    -
    -# S3 method for r2r_hashmap
    -on_missing_key(x)
    -
    -# S3 method for r2r_hashmap
    -on_missing_key(x) <- value
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashmap.

    value

    a string, either "throw" or "default". Action to -be taken upon query of a missing key.

    - -

    Value

    - -

    a string, either "throw" or "default".

    -

    Details

    - -

    For more details, see the hashtable documentation page.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap() -on_missing_key(m) -
    #> [1] "default"
    on_missing_key(m) <- "throw" -
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/query.html b/docs/reference/query.html deleted file mode 100644 index a93d587..0000000 --- a/docs/reference/query.html +++ /dev/null @@ -1,202 +0,0 @@ - - - - - - - - -Query keys from an hash table. — query • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    These generics are used for querying a single key from an -hashset or hashmap, respectively. For vectorized queries, -see the subsetting_hashtables documentation page.

    -
    - -
    query(x, key)
    -
    -# S3 method for r2r_hashmap
    -query(x, key)
    -
    -# S3 method for r2r_hashset
    -query(x, key)
    - -

    Arguments

    - - - - - - - - - - -
    x

    an hashset or hashmap.

    key

    an arbitrary R object. Key to be queried from the hash table.

    - -

    Value

    - -

    TRUE or FALSE, for hashsets. For -hashmaps, if the queried key exists in the hash table, returns the -associated value (an a priori arbitrary R object); otherwise, behaves as -specified by on_missing_key(x) -(see also hashtable).

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    s <- hashset(1, 2, 3) -query(s, 3) -
    #> [1] TRUE
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/r2r-package.html b/docs/reference/r2r-package.html deleted file mode 100644 index 79909ed..0000000 --- a/docs/reference/r2r-package.html +++ /dev/null @@ -1,182 +0,0 @@ - - - - - - - - -r2r: R-Object to R-Object Hash Maps — r2r-package • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Implementation of hash tables (hash sets and hash maps) in R, - featuring arbitrary R objects as keys, - arbitrary hash and key-comparison functions, - and customizable behaviour upon queries of missing keys.

    -
    - - - -

    See also

    - - -

    Author

    - -

    Maintainer: Valerio Gherardi vgherard@sissa.it (ORCID)

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/subsetting_hashtables.html b/docs/reference/subsetting_hashtables.html deleted file mode 100644 index 864f713..0000000 --- a/docs/reference/subsetting_hashtables.html +++ /dev/null @@ -1,233 +0,0 @@ - - - - - - - - -Subsetting hashsets and hashmaps — subsetting_hashtables • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    Subsetting operators `[[` and `[` for -hashsets and hashmaps provide an equivalent synthax for the -basic read/write operations performed by insert(), -delete() and query().

    -
    - -
    # S3 method for r2r_hashmap
    -[[(x, i)
    -
    -# S3 method for r2r_hashmap
    -[(x, i)
    -
    -# S3 method for r2r_hashmap
    -[[(x, i) <- value
    -
    -# S3 method for r2r_hashmap
    -[(x, i) <- value
    -
    -# S3 method for r2r_hashset
    -[[(x, i)
    -
    -# S3 method for r2r_hashset
    -[(x, i)
    -
    -# S3 method for r2r_hashset
    -[[(x, i) <- value
    -
    -# S3 method for r2r_hashset
    -[(x, i) <- value
    - -

    Arguments

    - - - - - - - - - - - - - - -
    x

    an hashset or hashmap.

    i

    for `[[`-subsetting, an arbitrary R object, the key to be -queried or inserted/deleted from the hash tables. For `[`-subsetting, -a list or an atomic vector whose individual elements correspond to the keys.

    value

    for `[[`-subsetting: TRUE or FALSE if -x is an hashset, an arbitrary R object if x is an -hashmap. In the case of hashsets, setting a key's value to -TRUE and FALSE is equivalent to inserting and deleting, -respectively, such key from the set. For `[`-subsetting, value -must be a list or an atomic vector of the same length of i, -whose individual elements are the values associated to the corresponding -keys in the hash table.

    - -

    Value

    - -

    the replacement forms ([[<- and [<-) always return value. -`[[` returns TRUE or FALSE if -x is an hashset, an arbitrary R object if x is an -hashmap and i is a valid key; when i is not a key, the -behaviour for hashmaps depends on the value of -on_missing_key(x). -The `[` operator returns a list of the same length of i, whose -k-th element is given by x[[ i[[k]] ]] (the remark on missing keys for -hashmaps applies also here).

    -

    Author

    - -

    Valerio Gherardi

    - -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/reference/values.html b/docs/reference/values.html deleted file mode 100644 index cebd6c4..0000000 --- a/docs/reference/values.html +++ /dev/null @@ -1,196 +0,0 @@ - - - - - - - - -List all values from an hash map — values • r2r - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    -
    - - - - -
    - -
    -
    - - -
    -

    This function is used to list all values associated to keys in -an hashmap. Implemented as a generic, but currently only the -hashmap method is defined.

    -
    - -
    values(x)
    -
    -# S3 method for r2r_hashmap
    -values(x)
    - -

    Arguments

    - - - - - - -
    x

    an hashset or hashmap.

    - -

    Value

    - -

    a list. Values associated to keys in the hash map x.

    -

    Author

    - -

    Valerio Gherardi

    - -

    Examples

    -
    m <- hashmap(list("a", 1), list("b", 2)) -values(m) -
    #> [[1]] -#> [1] 1 -#> -#> [[2]] -#> [1] 2 -#>
    -
    - -
    - - -
    - - -
    -

    Site built with pkgdown 1.6.1.

    -
    - -
    -
    - - - - - - - - diff --git a/docs/sitemap.xml b/docs/sitemap.xml deleted file mode 100644 index 86ba1fe..0000000 --- a/docs/sitemap.xml +++ /dev/null @@ -1,60 +0,0 @@ - - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/index.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/compare_fn.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/default.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/default_hash_fn.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/delete.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/has_key.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/hash_fn.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/hashtable.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/hashtable_methods.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/insert.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/keys.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/length.r2r_hashtable.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/on_missing_key.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/query.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/r2r-package.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/subsetting_hashtables.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/reference/values.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/articles/benchmarks.html - - - https://vgherard.github.io/r2r/, https://github.com/vgherard/r2r/articles/r2r.html - -