diff --git a/.clj-kondo/config.edn b/.clj-kondo/config.edn
deleted file mode 100644
index f40cd26..0000000
--- a/.clj-kondo/config.edn
+++ /dev/null
@@ -1 +0,0 @@
-{:lint-as {clojure.core.cache/defcache clojure.core/defrecord}}
diff --git a/.github/PULL_REQUEST_TEMPLATE b/.github/PULL_REQUEST_TEMPLATE
deleted file mode 100644
index 686625a..0000000
--- a/.github/PULL_REQUEST_TEMPLATE
+++ /dev/null
@@ -1,14 +0,0 @@
-Hi! Thanks for your interest in contributing to this project.
-
-Clojure contrib projects do not use GitHub issues or pull requests, and
-require a signed Contributor Agreement. If you would like to contribute,
-please read more about the CA and sign that first (this can be done online).
-
-Then go to this project's issue tracker in JIRA to create tickets, update
-tickets, or submit patches. For help in creating tickets and patches,
-please see:
-
-- Signing the CA: https://clojure.org/community/contributing
-- Creating Tickets: https://clojure.org/community/creating_tickets
-- Developing Patches: https://clojure.org/community/developing_patches
-- Contributing FAQ: https://clojure.org/community/contributing
diff --git a/.github/workflows/doc-build.yml b/.github/workflows/doc-build.yml
deleted file mode 100644
index 65beb66..0000000
--- a/.github/workflows/doc-build.yml
+++ /dev/null
@@ -1,13 +0,0 @@
-name: Build API Docs
-
-permissions:
-  contents: write
-
-on:
-  workflow_dispatch:
-
-jobs:
-  call-doc-build-workflow:
-    uses: clojure/build.ci/.github/workflows/doc-build.yml@master
-    with:
-      project: clojure/core.cache
diff --git a/.github/workflows/release.yml b/.github/workflows/release.yml
deleted file mode 100644
index 286cf95..0000000
--- a/.github/workflows/release.yml
+++ /dev/null
@@ -1,22 +0,0 @@
-name: Release on demand
-
-permissions:
-  contents: write
-
-on:
-  workflow_dispatch:
-    inputs:
-      releaseVersion:
-        description: "Version to release"
-        required: true
-      snapshotVersion:
-        description: "Snapshot version after release"
-        required: true
-
-jobs:
-  call-release:
-    uses: clojure/build.ci/.github/workflows/release.yml@master
-    with:
-      releaseVersion: ${{ github.event.inputs.releaseVersion }}
-      snapshotVersion: ${{ github.event.inputs.snapshotVersion }}
-    secrets: inherit
\ No newline at end of file
diff --git a/.github/workflows/snapshot.yml b/.github/workflows/snapshot.yml
deleted file mode 100644
index 9fdad8c..0000000
--- a/.github/workflows/snapshot.yml
+++ /dev/null
@@ -1,11 +0,0 @@
-name: Snapshot on demand
-
-permissions:
-  contents: read
-
-on: [workflow_dispatch]
-
-jobs:
-  call-snapshot:
-    uses: clojure/build.ci/.github/workflows/snapshot.yml@master
-    secrets: inherit
diff --git a/.github/workflows/test.yml b/.github/workflows/test.yml
deleted file mode 100644
index 2cc441a..0000000
--- a/.github/workflows/test.yml
+++ /dev/null
@@ -1,10 +0,0 @@
-name: Test
-
-permissions:
-  contents: read
-
-on: [push]
-
-jobs:
-  call-test:
-    uses: clojure/build.ci/.github/workflows/test.yml@master
diff --git a/.gitignore b/.gitignore
deleted file mode 100644
index fa951c1..0000000
--- a/.gitignore
+++ /dev/null
@@ -1,17 +0,0 @@
-.classpath
-.clj-kondo/.cache
-.cpcache/
-.idea
-.lein*
-.lsp/.cache
-.nrepl-port
-.portal/vs-code.edn
-.project
-.settings
-.vscode
-/build.boot
-lib
-multi-lib
-target
-.calva/repl.calva-repl
-.calva/mcp-server/port
diff --git a/.rebel_readline_history b/.rebel_readline_history
deleted file mode 100644
index a619ae0..0000000
--- a/.rebel_readline_history
+++ /dev/null
@@ -1,18 +0,0 @@
-1771730881107:(require '[clojure.core.cache :as cache] '[clojure.core.cache.wrapped :as cache-wrapped])
-1771730883786:(let [thread-count 20\n      cache-atom (-> {}\n                   (cache/ttl-cache-factory :ttl 120000)\n                   (cache/lu-cache-factory :threshold 100)\n                   (atom))\n      latch (java.util.concurrent.CountDownLatch. thread-count)\n      invocations-counter (atom 0)]\n (doseq [i (range thread-count)]\n   (println "starting thread" i)\n   (.start (Thread. (fn []\n                     (cache-wrapped/lookup-or-miss cache-atom "my-key"\n                                                   (fn [k]\n                                                     (swap! invocations-counter inc)\n                                                     (Thread/sleep 3000)\n                                                     "some value"))\n                     (.countDown latch)))))\n (.await latch)\n (deref invocations-counter))
-1771874817202:(force (delay ((fn [] (throw (Exception. "bad"))))))
-1771874830891:(def x (force (delay ((fn [] (throw (Exception. "bad")))))))
-1771874832688:x
-1771875362757:(def p (promise))
-1771875366556:(realized? p)
-1771875376098:(deliver p 42)
-1771875377638:(realized? p)
-1771875417454:(force p)
-1771875420076:p
-1771875423512:@p
-1771879609917:(def x (delay (throw (Exception. "bad"))))
-1771879610748:x
-1771879620704:(force x)
-1771879622323:x
-1771879802447:(def x (with-meta (delay (throw (Exception. "bad"))) {::core.cache.added true}))
-1771885580329:(source force)
diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
deleted file mode 100644
index 17e4617..0000000
--- a/CONTRIBUTING.md
+++ /dev/null
@@ -1,12 +0,0 @@
-This is a [Clojure contrib] project.
-
-Under the Clojure contrib [guidelines], this project cannot accept
-pull requests. All patches must be submitted via [JIRA].
-
-See [Contributing] on the Clojure website for
-more information on how to contribute.
-
-[Clojure contrib]: https://clojure.org/community/contrib_libs
-[Contributing]: https://clojure.org/community/contributing
-[JIRA]: http://clojure.atlassian.net/browse/CCACHE
-[guidelines]: https://clojure.org/community/contrib_howto
diff --git a/LICENSE b/LICENSE
deleted file mode 100644
index e246f6a..0000000
--- a/LICENSE
+++ /dev/null
@@ -1,205 +0,0 @@
-Eclipse Public License - v 1.0
-
-THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE PUBLIC
-LICENSE ("AGREEMENT"). ANY USE, REPRODUCTION OR DISTRIBUTION OF THE PROGRAM
-CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS AGREEMENT.
-
-1. DEFINITIONS
-
-"Contribution" means:
-
-a) in the case of the initial Contributor, the initial code and documentation
-   distributed under this Agreement, and
-b) in the case of each subsequent Contributor:
-    i) changes to the Program, and
-   ii) additions to the Program;
-
-   where such changes and/or additions to the Program originate from and are
-   distributed by that particular Contributor. A Contribution 'originates'
-   from a Contributor if it was added to the Program by such Contributor
-   itself or anyone acting on such Contributor's behalf. Contributions do not
-   include additions to the Program which: (i) are separate modules of
-   software distributed in conjunction with the Program under their own
-   license agreement, and (ii) are not derivative works of the Program.
-
-"Contributor" means any person or entity that distributes the Program.
-
-"Licensed Patents" mean patent claims licensable by a Contributor which are
-necessarily infringed by the use or sale of its Contribution alone or when
-combined with the Program.
-
-"Program" means the Contributions distributed in accordance with this
-Agreement.
-
-"Recipient" means anyone who receives the Program under this Agreement,
-including all Contributors.
-
-2. GRANT OF RIGHTS
-  a) Subject to the terms of this Agreement, each Contributor hereby grants
-     Recipient a non-exclusive, worldwide, royalty-free copyright license to
-     reproduce, prepare derivative works of, publicly display, publicly
-     perform, distribute and sublicense the Contribution of such Contributor,
-     if any, and such derivative works, in source code and object code form.
-  b) Subject to the terms of this Agreement, each Contributor hereby grants
-     Recipient a non-exclusive, worldwide, royalty-free patent license under
-     Licensed Patents to make, use, sell, offer to sell, import and otherwise
-     transfer the Contribution of such Contributor, if any, in source code and
-     object code form. This patent license shall apply to the combination of
-     the Contribution and the Program if, at the time the Contribution is
-     added by the Contributor, such addition of the Contribution causes such
-     combination to be covered by the Licensed Patents. The patent license
-     shall not apply to any other combinations which include the Contribution.
-     No hardware per se is licensed hereunder.
-  c) Recipient understands that although each Contributor grants the licenses
-     to its Contributions set forth herein, no assurances are provided by any
-     Contributor that the Program does not infringe the patent or other
-     intellectual property rights of any other entity. Each Contributor
-     disclaims any liability to Recipient for claims brought by any other
-     entity based on infringement of intellectual property rights or
-     otherwise. As a condition to exercising the rights and licenses granted
-     hereunder, each Recipient hereby assumes sole responsibility to secure
-     any other intellectual property rights needed, if any. For example, if a
-     third party patent license is required to allow Recipient to distribute
-     the Program, it is Recipient's responsibility to acquire that license
-     before distributing the Program.
-  d) Each Contributor represents that to its knowledge it has sufficient
-     copyright rights in its Contribution, if any, to grant the copyright
-     license set forth in this Agreement.
-
-3. REQUIREMENTS
-
-A Contributor may choose to distribute the Program in object code form under
-its own license agreement, provided that:
-
-  a) it complies with the terms and conditions of this Agreement; and
-  b) its license agreement:
-      i) effectively disclaims on behalf of all Contributors all warranties
-         and conditions, express and implied, including warranties or
-         conditions of title and non-infringement, and implied warranties or
-         conditions of merchantability and fitness for a particular purpose;
-     ii) effectively excludes on behalf of all Contributors all liability for
-         damages, including direct, indirect, special, incidental and
-         consequential damages, such as lost profits;
-    iii) states that any provisions which differ from this Agreement are
-         offered by that Contributor alone and not by any other party; and
-     iv) states that source code for the Program is available from such
-         Contributor, and informs licensees how to obtain it in a reasonable
-         manner on or through a medium customarily used for software exchange.
-
-When the Program is made available in source code form:
-
-  a) it must be made available under this Agreement; and
-  b) a copy of this Agreement must be included with each copy of the Program.
-     Contributors may not remove or alter any copyright notices contained
-     within the Program.
-
-Each Contributor must identify itself as the originator of its Contribution,
-if
-any, in a manner that reasonably allows subsequent Recipients to identify the
-originator of the Contribution.
-
-4. COMMERCIAL DISTRIBUTION
-
-Commercial distributors of software may accept certain responsibilities with
-respect to end users, business partners and the like. While this license is
-intended to facilitate the commercial use of the Program, the Contributor who
-includes the Program in a commercial product offering should do so in a manner
-which does not create potential liability for other Contributors. Therefore,
-if a Contributor includes the Program in a commercial product offering, such
-Contributor ("Commercial Contributor") hereby agrees to defend and indemnify
-every other Contributor ("Indemnified Contributor") against any losses,
-damages and costs (collectively "Losses") arising from claims, lawsuits and
-other legal actions brought by a third party against the Indemnified
-Contributor to the extent caused by the acts or omissions of such Commercial
-Contributor in connection with its distribution of the Program in a commercial
-product offering. The obligations in this section do not apply to any claims
-or Losses relating to any actual or alleged intellectual property
-infringement. In order to qualify, an Indemnified Contributor must:
-a) promptly notify the Commercial Contributor in writing of such claim, and
-b) allow the Commercial Contributor to control, and cooperate with the
-Commercial Contributor in, the defense and any related settlement
-negotiations. The Indemnified Contributor may participate in any such claim at
-its own expense.
-
-For example, a Contributor might include the Program in a commercial product
-offering, Product X. That Contributor is then a Commercial Contributor. If
-that Commercial Contributor then makes performance claims, or offers
-warranties related to Product X, those performance claims and warranties are
-such Commercial Contributor's responsibility alone. Under this section, the
-Commercial Contributor would have to defend claims against the other
-Contributors related to those performance claims and warranties, and if a
-court requires any other Contributor to pay any damages as a result, the
-Commercial Contributor must pay those damages.
-
-5. NO WARRANTY
-
-EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS PROVIDED ON AN
-"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, EITHER EXPRESS OR
-IMPLIED INCLUDING, WITHOUT LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE,
-NON-INFRINGEMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each
-Recipient is solely responsible for determining the appropriateness of using
-and distributing the Program and assumes all risks associated with its
-exercise of rights under this Agreement , including but not limited to the
-risks and costs of program errors, compliance with applicable laws, damage to
-or loss of data, programs or equipment, and unavailability or interruption of
-operations.
-
-6. DISCLAIMER OF LIABILITY
-
-EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT NOR ANY
-CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING WITHOUT LIMITATION
-LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-ARISING IN ANY WAY OUT OF THE USE OR DISTRIBUTION OF THE PROGRAM OR THE
-EXERCISE OF ANY RIGHTS GRANTED HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY
-OF SUCH DAMAGES.
-
-7. GENERAL
-
-If any provision of this Agreement is invalid or unenforceable under
-applicable law, it shall not affect the validity or enforceability of the
-remainder of the terms of this Agreement, and without further action by the
-parties hereto, such provision shall be reformed to the minimum extent
-necessary to make such provision valid and enforceable.
-
-If Recipient institutes patent litigation against any entity (including a
-cross-claim or counterclaim in a lawsuit) alleging that the Program itself
-(excluding combinations of the Program with other software or hardware)
-infringes such Recipient's patent(s), then such Recipient's rights granted
-under Section 2(b) shall terminate as of the date such litigation is filed.
-
-All Recipient's rights under this Agreement shall terminate if it fails to
-comply with any of the material terms or conditions of this Agreement and does
-not cure such failure in a reasonable period of time after becoming aware of
-such noncompliance. If all Recipient's rights under this Agreement terminate,
-Recipient agrees to cease use and distribution of the Program as soon as
-reasonably practicable. However, Recipient's obligations under this Agreement
-and any licenses granted by Recipient relating to the Program shall continue
-and survive.
-
-Everyone is permitted to copy and distribute copies of this Agreement, but in
-order to avoid inconsistency the Agreement is copyrighted and may only be
-modified in the following manner. The Agreement Steward reserves the right to
-publish new versions (including revisions) of this Agreement from time to
-time. No one other than the Agreement Steward has the right to modify this
-Agreement. The Eclipse Foundation is the initial Agreement Steward. The
-Eclipse Foundation may assign the responsibility to serve as the Agreement
-Steward to a suitable separate entity. Each new version of the Agreement will
-be given a distinguishing version number. The Program (including
-Contributions) may always be distributed subject to the version of the
-Agreement under which it was received. In addition, after a new version of the
-Agreement is published, Contributor may elect to distribute the Program
-(including its Contributions) under the new version. Except as expressly
-stated in Sections 2(a) and 2(b) above, Recipient receives no rights or
-licenses to the intellectual property of any Contributor under this Agreement,
-whether expressly, by implication, estoppel or otherwise. All rights in the
-Program not expressly granted under this Agreement are reserved.
-
-This Agreement is governed by the laws of the State of New York and the
-intellectual property laws of the United States of America. No party to this
-Agreement will bring a legal action under this Agreement more than one year
-after the cause of action arose. Each party waives its rights to a jury trial in
-any resulting litigation.
-
-
diff --git a/README.md b/README.md
deleted file mode 100644
index dcc2dc2..0000000
--- a/README.md
+++ /dev/null
@@ -1,240 +0,0 @@
-clojure.core.cache
-========================================
-
-core.cache is a Clojure contrib library providing the following features:
-
-* An underlying `CacheProtocol` used as the base abstraction for implementing new synchronous caches
-
-* A `defcache` macro for hooking your `CacheProtocol` implementations into the Clojure associative data capabilities.
-
-* Implementations of some basic in-memory caching strategies
-  - First-in-first-out (FIFOCache)
-  - Least-recently-used (LRUCache)
-  - Least-used (LUCache -- sometimes called Least Frequently Used)
-  - Time-to-live (TTLCacheQ)
-  - Naive cache (BasicCache)
-  - Naive cache backed with soft references (SoftCache)
-
-* Implementation of an efficient buffer replacement policy based on the *low inter-reference recency set* algorithm (LIRSCache) described in the [LIRS](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2184) paper
-
-* Factory functions for each existing cache type
-
-* Caches are generally in-memory and immutable and should be used in conjunction with Clojure's state management, such as `atom`. SoftCache is the exception here, an in-memory cache built on top of mutable Java collections, but it can be treated as an immutable cache as well.
-
-The `clojure.core.cache` namespace contains the immutable in-memory caches themselves.
-The `clojure.core.cache.wrapped` namespace contains the same API operating on caches wrapped in atoms, which is the "normal" use in the wild (introduced in 0.8.0).
-
-core.cache is based on an old library named Clache that has been thoroughly deprecated.
-
-The `core.cache` API is hard to use correctly. That's why `clojure.core.cache.wrapped/lookup-or-miss` exists: it encapsulates all the best practices around using the API _and_ wraps it in an `atom` from the get-go. Read this article about [the `core.cache` API](https://dev.to/dpsutton/exploring-the-core-cache-api-57al) by Dan Sutton for why it is important to use the API correctly!
-
-Releases and Dependency Information
-========================================
-
-This project follows the version scheme MAJOR.MINOR.COMMITS where MAJOR and MINOR provide some relative indication of the size of the change, but do not follow semantic versioning. In general, all changes endeavor to be non-breaking (by moving to new names rather than by breaking existing names). COMMITS is an ever-increasing counter of commits since the beginning of this repository.
-
-Latest stable release: 1.2.259
-
-* [All Released Versions](https://search.maven.org/#search%7Cgav%7C1%7Cg%3A%22org.clojure%22%20AND%20a%3A%22core.cache%22)
-* [Development Snapshot Versions](https://oss.sonatype.org/index.html#nexus-search;gav~org.clojure~core.cache~~~)
-
-[CLI/`deps.edn`](https://clojure.org/reference/deps_edn) dependency information:
-
-```clojure
-org.clojure/core.cache {:mvn/version "1.2.259"}
-```
-
-[Leiningen](https://github.com/technomancy/leiningen) dependency information:
-
-    [org.clojure/core.cache "1.2.259"]
-
-[Maven](http://maven.apache.org/) dependency information:
-
-    <dependency>
-      <groupId>org.clojure</groupId>
-      <artifactId>core.cache</artifactId>
-      <version>1.2.259</version>
-    </dependency>
-
-
-
-Example Usage
-========================================
-
-The [`clojure.core.cache` namespace](https://cljdoc.org/d/org.clojure/core.cache/CURRENT/api/clojure.core.cache)
-provides an API for immutable caches where
-it is expected that you would manage storage of these data structures.
-
-The [`clojure.core.cache.wrapped` namespace](https://cljdoc.org/d/org.clojure/core.cache/CURRENT/api/clojure.core.cache.wrapped)
-provides the same API but over
-immutable caches already wrapped in an atom, which is generally a more
-intuitive API for straightforward use cases. In particular, this namespace
-adds a `lookup-or-miss` function which encapsulates the `has?`/`hit`/`miss`
-logic for the underlying cache as well as edge cases such as `lookup`
-returning `nil` if a cache item expires on fetch (e.g., TTL), and guaranteeing
-the value computing function is only called at most once.
-
-The expectation is that you use _either_ `clojure.core.cache` _or_
-`clojure.core.cache.wrapped` and you do not try to mix them.
-
-```clojure
-    (require '[clojure.core.cache :as cache])
-
-    ;; C1 is an immutable cache:
-    (def C1 (cache/fifo-cache-factory {:a 1, :b 2}))
-
-    (def C1' (if (cache/has? C1 :c)
-               (cache/hit C1 :c)
-               (cache/miss C1 :c 42)))
-
-    ;=> {:a 1, :b 2, :c 42}
-
-    (cache/lookup C1' :c)
-
-    ;=> 42
-
-    (get C1' :c) ; cache/lookup is implemented as get
-
-    ;=> 42
-
-    ;; a shorthand for the above conditional...
-    (def C1' (cache/through-cache C1 :c (constantly 42)))
-    ;; ...which uses a value to compute the result from the key...
-    (cache/through-cache C1 my-key (partial jdbc/get-by-id db-spec :storage))
-    ;; ...so you could fetch values from a database if they're not in cache...
-
-    (cache/evict C1 :b)
-
-    ;=> {:a 1}
-
-    ;; since the caches are immutable, you would normally wrap them in an atom
-    (def C2 (atom (cache/fifo-cache-factory {:a 1, :b 2})))
-
-    (swap! C2 cache/through-cache :d (constantly 13))
-
-    ;=> {:a 1, :b 3, :d 13}
-
-    (swap! C2 cache/evict :b)
-
-    ;=> {:a 1, :d 13}
-
-    (get @C2 :a)
-
-    ;=> 1
-
-    ;; or use the wrapped API instead:
-    (require '[clojure.core.cache.wrapped :as w])
-
-    ;; in this case C3 is an atom containing a cache:
-    (def C3 (w/fifo-cache-factory {:a 1, :b 2}))
-
-    ;; operations modify the atom and return the updated cache:
-    (w/through-cache C3 :d (constantly 13))
-
-    ;=> {:a 1, :b 3, :d 13}
-
-    ;; modifies the atom and returns the updated cache:
-    (w/evict C3 :b)
-
-    ;=> {:a 1, :d 13}
-
-    ;; for some caches this is a mutating operation (e.g., TTL):
-    (w/lookup C3 :a) ; or (get @C3 :a)
-
-    ;=> 1
-
-    ;; unique to the wrapped API, this combines through-cache and lookup
-    ;; to return the looked up value, possibly after calling the passed in
-    ;; function with the key to populate the cache if the key wasn't present:
-    (w/lookup-or-miss C3 :b (constantly 42))
-
-    ;=> 42
-
-    @C3
-
-    ;=> {:a 1, :d 13, :b 42}
-
-    ;; calls (jdbc/get-by-id :storage my-key) in the event of a cache miss:
-    (w/lookup-or-miss C3 my-key (partial jdbc/get-by-id db-spec :storage))
-```
-
-Refer to docstrings in the `clojure.core.cache` or `clojure.core.cache.wrapped` namespaces, or the [autogenerated API documentation](http://clojure.github.io/core.cache/) for additional documentation.
-
-
-Developer Information
-========================================
-
-* [GitHub project](https://github.com/clojure/core.cache)
-* [Bug Tracker](https://clojure.atlassian.net/browse/CCACHE)
-* [Continuous Integration](https://github.com/clojure/core.cache/actions/workflows/test.yml)
-
-
-
-Change Log
-====================
-
-* Release 1.2.259 on 2026-02-23
-  * [CCACHE-65](http://clojure.atlassian.net/browse/CCACHE-65) again! Avoids caching exceptions but currently relies on `locking` to avoid an edge case race condition if the `value-fn` throws an exception under heavy load on `lookup-or-miss`. This is a temporary solution until we can implement a more robust solution that doesn't rely on `locking`.
-* Release 1.2.254 on 2026-02-21
-  * [CCACHE-67](http://clojure.atlassian.net/browse/CCACHE-67) Add `clojure.core.cache.wrapped/size` function to get the size of the cache without dereferencing the atom. (via [@dharrigan](https://github.com/dharrigan)).
-  * [CCACHE-65](http://clojure.atlassian.net/browse/CCACHE-65) Use `delay` in `lookup-or-miss` to avoid cache-stampede.
-* Release 1.1.234 on 2024-02-19
-  * Update parent pom and `data.priority-map` versions
-* Release 1.0.225 on 2021-12-06
-  * Update `data.priority-map` to 1.1.0
-* Release 1.0.217 on 2021-08-02
-  * [CCACHE-63](http://clojure.atlassian.net/browse/CCACHE-63) Improve cache initialization for LU/LRU; fix LU miss logic when not full.
-* Release 1.0.207 on 2020-04-10
-  * Switch to 1.0.x versioning.
-  * Update `data.priority-map` to 1.0.0
-* Release 0.8.2 on 2019-09-30
-  * [CCACHE-57](http://clojure.atlassian.net/browse/CCACHE-57) Fix wrapped cache `miss` function
-* Release 0.8.1 on 2019-08-24
-  * [CCACHE-56](http://clojure.atlassian.net/browse/CCACHE-56) Fix wrapped TTL cache and fix `clojure.core.cache.wrapped/lookup-or-miss` for caches that can invalidate on `lookup`
-* Release 0.8.0 on 2019-08-24
-  * [CCACHE-50](http://clojure.atlassian.net/browse/CCACHE-50) Add `clojure.core.cache.wrapped` namespace with atom-wrapped caches for a more convenient API that adds `lookup-or-miss` which avoids the possibility of cache stampede
-* Release 0.7.2 on 2019-01-06
-  * [CCACHE-53](http://clojure.atlassian.net/browse/CCACHE-53) Remove unnecessary/additional `.get` call (Neil Prosser)
-  * [CCACHE-52](http://clojure.atlassian.net/browse/CCACHE-52) Fix NPE in SoftCache (Neil Prosser)
-* Release 0.7.1 on 2018.03.02
-  * [CCACHE-49](http://clojure.atlassian.net/browse/CCACHE-49) Fix TTLCacheQ `seed` function and expand tests on TTLCacheQ
-* Release 0.7.0 on 2018.03.01
-  * [CCACHE-46](http://clojure.atlassian.net/browse/CCACHE-46) Fix TTLCache when wrapped around another cache (Ivan Kryvoruchko)
-  * [CCACHE-43](http://clojure.atlassian.net/browse/CCACHE-43) Add `through-cache` to provide a version of `through` that plays nice with `swap!` etc
-  * [CCACHE-40](http://clojure.atlassian.net/browse/CCACHE-40) Fix FIFOCache stack overflow on large threshold (uses PersistentQueue now instead of concat and list)
-  * [CCACHE-39](http://clojure.atlassian.net/browse/CCACHE-39) Fix FIFOCache evict/miss queue handling
-  * [CCACHE-20](http://clojure.atlassian.net/browse/CCACHE-20) Updated README to clarify that caches are immutable and provide examples of use with `atom` etc
-  * [CCACHE-15](http://clojure.atlassian.net/browse/CCACHE-15) Added queue and generation logic to reduce `miss` cost and make `evict` O(1); rename TTLCache -> TTLCacheQ (Kevin Downey)
-  * Drop support for Clojure 1.3/1.4/1.5
-* Release 0.6.5 on 2016.03.28
-  * Bump tools.priority-map dependency to 0.0.7
-  * [CCACHE-41](http://clojure.atlassian.net/browse/CCACHE-41) Implement Iterable in defcache
-  * [CCACHE-44](http://clojure.atlassian.net/browse/CCACHE-44) Avoid equals comparison on cache miss
-  * [CCACHE-37](http://clojure.atlassian.net/browse/CCACHE-37) Fix typo in docstring
-* Release 0.6.4 on 2014.08.06
-  * Thanks to Paul Stadig and Nicola Mometto who contributed patches for this release
-  * [CCACHE-34](http://clojure.atlassian.net/browse/CCACHE-34) bump tools.priority-map dependency to 0.0.4
-  * [CCACHE-28](http://clojure.atlassian.net/browse/CCACHE-28) concurrency bug in has? for SoftCache
-  * [CCACHE-29](http://clojure.atlassian.net/browse/CCACHE-29) fix conj implementation for caches
-  * [CCACHE-30](http://clojure.atlassian.net/browse/CCACHE-30) make-reference need not be dynamic
-  * [CCACHE-26](http://clojure.atlassian.net/browse/CCACHE-26) hit function in LRU cache can give funny results
-* Release 0.6.3 on 2013.03.15
-  * Added through to encapsulate check logic
-* Release 0.6.2 on 2012.08.07 [more information](http://blog.fogus.me/?p=4527)
-  * Removed reflection warnings
-  * Fixed eviction of items from LU, TTL and LRU caches with thresholds less than two
-  * Fixed eviction of items from FIFO cache prior to threshold
-* Release 0.6.2 on 2012.07.13 [more information](http://blog.fogus.me/2012/07/13/announcing-core-cache-version-0-6-1/)
-  * Added SoftCache
-  * Fixed eviction of items from LU and LRU caches prior to threshold
-  * Adjusted default thresholds in factory functions
-* Release 0.5.0 on 2011.12.13 [more information](http://blog.fogus.me/2011/12/13/announcing-core-cache-v0-5-0/)
-  * Added `evict`
-  * Added cache factory functions
-  * Added associatve operation support
-
-
-Copyright and License
-========================================
-
-Copyright (c) Rich Hickey, Michael Fogus and contributors, 2012-2023. All rights reserved.  The use and distribution terms for this software are covered by the Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php) which can be found in the file epl-v10.html at the root of this distribution. By using this software in any fashion, you are agreeing to be bound bythe terms of this license.  You must not remove this notice, or any other, from this software.
diff --git a/api-index.html b/api-index.html
new file mode 100644
index 0000000..4719574
--- /dev/null
+++ b/api-index.html
@@ -0,0 +1,272 @@
+<html>
+  <head>
+    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+    <title>Index - core.cache 1.0.226-SNAPSHOT API documentation</title>
+    <link rel="icon" href="static/favicon.png" />
+    <link rel="shortcut icon" href="static/favicon.png" />
+    <link rel="stylesheet" href="static/clojure.css" type="text/css" media="all" />
+    <link rel="stylesheet" href="static/wiki.css" type="text/css" media="all" />
+    <link rel="stylesheet" href="static/internal.css" type="text/css" media="all" />
+    <style>.menuWrapper{height: 36px;}</style>
+  </head>
+<!--
+This document was auto-generated from the source by the clojure autodoc system.
+To report errors or ask questions about the overall documentation structure, formatting,
+etc., contact Tom Faulhaber (google mail name: tomfaulhaber).
+For errors in the documentation of a particular namespace, contact the author of that
+namespace.
+-->
+  <body>
+    <div id="AllContentContainer">
+      <div id="Header">
+	<a href="index.html" id="Logo"><img src="static/clojure-icon.gif" width="100" height="100" alt="Clojure" /></a>
+	<h1><a href="index.html" id="page-header" title="page header title">core.cache API Reference</a></h1>
+      </div>
+      <div id="leftcolumn"><div style="text-align: center;"></div>
+<div class="menu">
+  <div class="WikiCustomNav WikiElement wiki">
+    <span class="toc-header"><span id="project-name">core.cache</span> <span id="version">1.0.226-SNAPSHOT</span> API</span><br />
+    <ul>
+      <li><a href="index.html" class="wiki_link">Overview</a></li>
+      <li><a href="api-index.html" class="wiki_link">API Index</a></li>
+    </ul>
+    
+    
+    <a class="wiki_link" href="https://clojure.org">Clojure Home</a>
+  </div>
+</div>
+</div>
+      <div id="rightcolumn">
+	<div id="Content">
+	  <div class="contentBox"><div class="innerContentBox">
+              <div class="wiki wikiPage" id="content_view">
+                <div id="right-sidebar"></div>
+                <div id="content-tag"><h1 id="overview">Index of Public Functions and Variables - <span id="header-project">core.cache</span> <span id="header-version">1.0.226-SNAPSHOT</span><span id="header-status-block"> (<span id="header-status">in development</span>)</span></h1>
+This page has an alphabetical index of all the documented functions and variables
+in <span class="project-name-span">core.cache</span>.
+
+<!-- TODO: enable this functionality on github?
+
+In a narrow browser window, you may want to collapse the sidebar (use the \"<<\" link)
+to get more screen space for the index.
+-->
+<p>
+</p><div class="shortcuts">
+Shortcuts:<br />
+<a href="#A">A</a> <a href="#B">B</a> <a href="#C">C</a> <a href="#D">D</a>
+ <a href="#E">E</a> <a href="#F">F</a> <a href="#G">G</a> <a href="#H">H</a>
+ <a href="#I">I</a> <a href="#J">J</a> <a href="#K">K</a> <a href="#L">L</a>
+ <a href="#M">M</a>
+<br />
+<a href="#N">N</a> <a href="#O">O</a> <a href="#P">P</a> <a href="#Q">Q</a>
+ <a href="#R">R</a> <a href="#S">S</a> <a href="#T">T</a> <a href="#U">U</a>
+ <a href="#V">V</a> <a href="#W">W</a> <a href="#X">X</a> <a href="#Y">Y</a>
+ <a href="#Z">Z</a>
+<br />
+<a href="#Other">Other</a>
+<br />
+</div>
+
+<div id="index-body">
+  <h2 id="A"><span id="section-head">A</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="B"><span id="section-head">B</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;BasicCache">-&gt;BasicCache</a><span id="line-content">                 function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/basic-cache-factory">basic-cache-factory</a><span id="line-content">          function      clojure.core.cache Returns a pluggable basic cache initialized to `ba...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/basic-cache-factory">basic-cache-factory</a><span id="line-content">          function      clojure.core.cache.wrapped Returns a pluggable basic cache initialize...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/BasicCache">BasicCache</a><span id="line-content">                   type          clojure.core.cache 
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="C"><span id="section-head">C</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/CacheProtocol">CacheProtocol</a><span id="line-content">                protocol      clojure.core.cache This is the protocol describing the basic cache ca...
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="D"><span id="section-head">D</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="E"><span id="section-head">E</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/evict">evict</a><span id="line-content">                        function      clojure.core.cache Removes an entry from the cache.
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/evict">evict</a><span id="line-content">                        function      clojure.core.cache.wrapped Removes an entry from the cache.  Returns ...
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="F"><span id="section-head">F</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;FIFOCache">-&gt;FIFOCache</a><span id="line-content">                  function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;FnCache">-&gt;FnCache</a><span id="line-content">                    function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/fifo-cache-factory">fifo-cache-factory</a><span id="line-content">           function      clojure.core.cache Returns a FIFO cache with the cache and FIFO queue...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/fifo-cache-factory">fifo-cache-factory</a><span id="line-content">           function      clojure.core.cache.wrapped Returns a FIFO cache with the cache and FI...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/FIFOCache">FIFOCache</a><span id="line-content">                    type          clojure.core.cache 
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/FnCache">FnCache</a><span id="line-content">                      type          clojure.core.cache 
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="G"><span id="section-head">G</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="H"><span id="section-head">H</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/has?">has?</a><span id="line-content">                         function      clojure.core.cache Checks if the cache contains a value associated wi...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/has?">has?</a><span id="line-content">                         function      clojure.core.cache.wrapped Checks if the cache contains a value assoc...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/hit">hit</a><span id="line-content">                          function      clojure.core.cache Is meant to be called if the cache is determined t...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/hit">hit</a><span id="line-content">                          function      clojure.core.cache.wrapped Is meant to be called if the cache is dete...
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="I"><span id="section-head">I</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="J"><span id="section-head">J</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="K"><span id="section-head">K</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="L"><span id="section-head">L</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;LIRSCache">-&gt;LIRSCache</a><span id="line-content">                  function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;LRUCache">-&gt;LRUCache</a><span id="line-content">                   function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;LUCache">-&gt;LUCache</a><span id="line-content">                    function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/lirs-cache-factory">lirs-cache-factory</a><span id="line-content">           function      clojure.core.cache Returns an LIRS cache with the S &amp; R LRU lists set...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/lirs-cache-factory">lirs-cache-factory</a><span id="line-content">           function      clojure.core.cache.wrapped Returns an LIRS cache with the S &amp; R LRU l...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/LIRSCache">LIRSCache</a><span id="line-content">                    type          clojure.core.cache 
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/lookup">lookup</a><span id="line-content">                       function      clojure.core.cache Retrieve the value associated with `e` if it exist...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/lookup">lookup</a><span id="line-content">                       function      clojure.core.cache.wrapped Retrieve the value associated with `e` if ...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/lookup-or-miss">lookup-or-miss</a><span id="line-content">               function      clojure.core.cache.wrapped Retrieve the value associated with `e` if ...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/lru-cache-factory">lru-cache-factory</a><span id="line-content">            function      clojure.core.cache Returns an LRU cache with the cache and usage-tabl...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/lru-cache-factory">lru-cache-factory</a><span id="line-content">            function      clojure.core.cache.wrapped Returns an LRU cache with the cache and us...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/LRUCache">LRUCache</a><span id="line-content">                     type          clojure.core.cache 
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/lu-cache-factory">lu-cache-factory</a><span id="line-content">             function      clojure.core.cache Returns an LU cache with the cache and usage-table...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/lu-cache-factory">lu-cache-factory</a><span id="line-content">             function      clojure.core.cache.wrapped Returns an LU cache with the cache and usa...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/LUCache">LUCache</a><span id="line-content">                      type          clojure.core.cache 
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="M"><span id="section-head">M</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/miss">miss</a><span id="line-content">                         function      clojure.core.cache Is meant to be called if the cache is determined t...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/miss">miss</a><span id="line-content">                         function      clojure.core.cache.wrapped Is meant to be called if the cache is dete...
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="N"><span id="section-head">N</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="O"><span id="section-head">O</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="P"><span id="section-head">P</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="Q"><span id="section-head">Q</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="R"><span id="section-head">R</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="S"><span id="section-head">S</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;SoftCache">-&gt;SoftCache</a><span id="line-content">                  function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/seed">seed</a><span id="line-content">                         function      clojure.core.cache Is used to signal that the cache should be created...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/seed">seed</a><span id="line-content">                         function      clojure.core.cache.wrapped Is used to signal that the cache should be...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/soft-cache-factory">soft-cache-factory</a><span id="line-content">           function      clojure.core.cache Returns a SoftReference cache.  Cached values will...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/soft-cache-factory">soft-cache-factory</a><span id="line-content">           function      clojure.core.cache.wrapped Returns a SoftReference cache.  Cached val...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/SoftCache">SoftCache</a><span id="line-content">                    type          clojure.core.cache 
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="T"><span id="section-head">T</span></h2>
+  <pre>
+<span id="section-content"> <a href="index.html#clojure.core.cache/-&gt;TTLCacheQ">-&gt;TTLCacheQ</a><span id="line-content">                  function      clojure.core.cache Positional factory function for class clojure.core...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/through">through</a><span id="line-content">                      function      clojure.core.cache The basic hit/miss logic for the cache system.  Ex...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/through">through</a><span id="line-content">                      function      clojure.core.cache.wrapped The basic hit/miss logic for the cache sys...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/through-cache">through-cache</a><span id="line-content">                function      clojure.core.cache The basic hit/miss logic for the cache system.  Li...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/through-cache">through-cache</a><span id="line-content">                function      clojure.core.cache.wrapped The basic hit/miss logic for the cache sys...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/ttl-cache-factory">ttl-cache-factory</a><span id="line-content">            function      clojure.core.cache Returns a TTL cache with the cache and expiration-...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache.wrapped/ttl-cache-factory">ttl-cache-factory</a><span id="line-content">            function      clojure.core.cache.wrapped Returns a TTL cache with the cache and exp...
+</span></span><span id="section-content"> <a href="index.html#clojure.core.cache/TTLCacheQ">TTLCacheQ</a><span id="line-content">                    type          clojure.core.cache 
+</span></span>
+  </pre>
+</div><div id="index-body">
+  <h2 id="U"><span id="section-head">U</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="V"><span id="section-head">V</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="W"><span id="section-head">W</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="X"><span id="section-head">X</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="Y"><span id="section-head">Y</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="Z"><span id="section-head">Z</span></h2>
+  <pre>
+
+  </pre>
+</div><div id="index-body">
+  <h2 id="Other"><span id="section-head">Other</span></h2>
+  <pre>
+
+  </pre>
+</div>
+<style type="text/css">
+  #AllContentContainer {min-width: 96em;}
+</style>
+</div>
+              </div>
+            </div>
+          </div>
+	</div>
+	<div id="foot">
+	  <div id="copyright" style="text-align: center;">Copyright 2007-2023 by Rich Hickey and the various contributors</div>
+	</div>
+      </div>
+      <div id="DesignedBy">Logo &amp; site design by <a href="http://www.tomhickey.com" title="Visit Tom Hickey's website.">Tom Hickey</a>.<br />
+      Clojure auto-documentation system by Tom Faulhaber.</div>
+    </div>
+    <!-- /AllContentContainer -->
+  </body>
+
+</html>
\ No newline at end of file
diff --git a/deps.edn b/deps.edn
deleted file mode 100644
index 5eb3590..0000000
--- a/deps.edn
+++ /dev/null
@@ -1,17 +0,0 @@
-;; You can run clojure.core.cache tests with: clj -A:test:runner
-;; You can also specify an alias to select which version of Clojure to test
-;; against: :1.9 :1.10 :1.11 :1.12
-
-{:paths ["src/main/clojure"]
- :deps {org.clojure/data.priority-map {:mvn/version "1.2.1"}}
- :aliases {:1.9 {:override-deps {org.clojure/clojure {:mvn/version "1.9.0"}}}
-           :1.10 {:override-deps {org.clojure/clojure {:mvn/version "1.10.3"}}}
-           :1.11 {:override-deps {org.clojure/clojure {:mvn/version "1.11.4"}}}
-           :1.12 {:override-deps {org.clojure/clojure {:mvn/version "1.12.4"}}}
-           :test
-           {:extra-paths ["src/test/clojure"]
-            :extra-deps {org.clojure/test.check {:mvn/version "1.1.3"}
-                         io.github.cognitect-labs/test-runner
-                         {:git/tag "v0.5.1" :git/sha "dfb30dd"}}
-            :main-opts ["-m" "cognitect.test-runner"
-                        "-d" "src/test/clojure"]}}}
diff --git a/docs/Building.md b/docs/Building.md
deleted file mode 100644
index 5823088..0000000
--- a/docs/Building.md
+++ /dev/null
@@ -1,25 +0,0 @@
-Building core.cache
-===================
-
-1. Clone the [core.cache git repository](http://github.com/clojure/core.cache) or download its [source archive](https://github.com/clojure/core.cache/zipball/master)
-
-2. Run `mvn package` to generate a Jar file
-
-3. Run `mvn install` to install the Jar into your local Maven repository
-
-To test that the build succeeded try:
-
-    mvn clojure:repl
-
-This will launch a Clojure REPL.  Try the following to exercise core.cache:
-
-```clojure
-(use 'clojure.core.cache)
-	
-(def c (fifo-cache-factory 1 {:a 42}))
-	
-(-> c (assoc :b 1) 
-      (assoc :z 108))
-```
-
-You should see the result `{:z 108}`.
diff --git a/docs/Composing.md b/docs/Composing.md
deleted file mode 100644
index 98bbe65..0000000
--- a/docs/Composing.md
+++ /dev/null
@@ -1,21 +0,0 @@
-Because core.cache types are defined in terms of the `CacheProtocol` protocol and the cache functions adhere to its strictures, any cache types can serve as the basis for another.
-
-Put in simpler terms, to create a cache instance composed of the seed data `{:a 1, :b 2}` with a FIFO eviction policy and a 5-second entry lifetime, then the following nested cache usage would work:
-
-```clojure
-(def C (-> {:a 1 :b 2}
-       (fifo-cache-factory :threshold 2)
-       (ttl-cache-factory  :ttl 5000)))
-
-;; used right away
-
-(assoc C :c 42)
-;;=> {:b 2, :c 42}
-
-;; used after 5 seconds
-
-(assoc C :d 138)
-;;=> {:d 138}
-```
-
-What the code above does is to simply use a `FIFOCache` instance, seeded with `{:a 1, :b 2}` as the seed for a `TTLCacheQ` instance.  As shown, within the TTL window, the cache evicts its elements using a FIFO policy.  However, once a TTL window has expired the expired elements are also evicted.
diff --git a/docs/Extending.md b/docs/Extending.md
deleted file mode 100644
index 6a1812a..0000000
--- a/docs/Extending.md
+++ /dev/null
@@ -1,129 +0,0 @@
-Creating custom caches
-======================
-
-This page will guide you through the steps required to create your own custom cache types.  In this tutorial you will create a naive cache type `LameCache` with a very straight-forward and illustrative eviction policy.
-
-The details of the implementation are as follows:
- * `LameCache` should work like a map
- * Its eviction policy is semi-random
- * It allows a threshold
-
-CacheProtocol
--------------
-
-The best place to start when attempting to create your own cache implementations with core.cache is with the `CacheProtocol`:
-
-```clojure
-(defprotocol CacheProtocol
-  "This is the protocol describing the basic cache capability."
-  (lookup [cache e]
-          [cache e not-found]
-   "Retrieve the value associated with `e` if it exists, else `nil` in
-   the 2-arg case.  Retrieve the value associated with `e` if it exists,
-   else `not-found` in the 3-arg case.")
-  (has?    [cache e]
-   "Checks if the cache contains a value associated with `e`")
-  (hit     [cache e]
-   "Is meant to be called if the cache is determined to contain a value
-   associated with `e`")
-  (miss    [cache e ret]
-   "Is meant to be called if the cache is determined to **not** contain a
-   value associated with `e`")
-  (evict  [cache e]
-   "Removes an entry from the cache")
-  (seed    [cache base]
-   "Is used to signal that the cache should be created with a seed.
-   The contract is that said cache should return an instance of its
-   own type."))
-```
-
-The commentary on the cache protocol is fairly straight-forward, but there are subtlties in play that I will discuss herein.  
-
-The defcache convenience macro
-------------------------------
-
-The core.cache library provides a convenience macro for defining cache implementations called `defcache`.  The advantage that `defcache` provides is that by implementing the `CacheProtocol` protocol your caches will automatically implement Clojure's associative data structure protocols as well.  The `defcache` does this by implementing the associative behaviors in terms of the `CacheProtocol`.  
-
-*All caveats apply regarding the [proper usage patterns](./Using.md).*
-
-Implementing a custom cache
----------------------------
-
-Therefore, to implement a version of `LameCache`, the `defcache` usage is as follows:
-
-```clojure
-(defcache LameCache [cache ks threshold]
-  CacheProtocol
-```
-
-The first step is to name the type and to provide its attributes:
-
-* `cache`: The base storage structure
-  - Should be an associative structure
-  - **Must** be the first attribute listed
-* `ks`: A set of keys stored
-* `threshold`: The threshold defining the point when eviction policies take effect
-
-```clojure
-  (lookup [_ item]
-    (get cache item))
-  (lookup [_ item not-found]
-    (get cache item not-found))
-```
-
-The `lookup` method is straight-forward. Simply retrieve the item at the given key from the base `cache`.
-
-```clojure
-  (has? [_ item]
-    (contains? cache item))
-```
-
-The `has?` method is likewise straight-forward. Simply return `true` if a key is located in the base `cache`; `false` otherwise.
-
-```clojure
-  (hit [this item] this)
-```
-
-The `hit` method in this case is trivial, it just returns the instance itself.  If your cache implementation needs to track hit history then you would probably return a new instance with history updated.
-
-```clojure
-  (miss [_ item result]
-    (let [size (count cache)]
-      (if (<= size threshold)
-        (LameCache. (assoc cache item result)
-                    (conj ks item)
-                    threshold)
-        (let [new-cache (dissoc cache (first ks))
-              new-keys  (dissoc ks item)]
-          (LameCache. (assoc new-cache item result)
-                      (conj item new-keys)
-                      threshold)))))
-```
-
-The `miss` method is where all the action takes place.  That is, if the size of the base `cache` is less than the `threshold` then the cached value is stored in the base `cache` and its key in the `ks` set.  However, if the threshold was breached then the first key in the `ks` set is removed from the base `cache` and `ks` and a new `LameCache` instance is returned with the new key and value added to `cache` and `ks`.
-
-```clojure
-  (evict [_ key]
-    (LameCache. (dissoc cache key)
-                (dissoc ks key)
-                threshold))
-```
-
-The `evict` method purges the value from the base `cache` and its key from `ks`, returning a new `LameCache` instance.
-
-```clojure
-  (seed [_ base]
-    (LameCache. base
-                (set (keys base))
-                threshold))
-```
-
-The `seed` function is meant to populate the cache with a set of known values.  For `LameCache` the seed forms the base `cache` and its keys the `ks`.  Seeding a cache is often a delicate matter and your custom caches may require some thought.
-
-```clojure
-  Object
-  (toString [_]
-    (str cache)))
-```
-
-Finally, `LameCache` is given a lame `toString` method.
diff --git a/docs/FIFO.md b/docs/FIFO.md
deleted file mode 100644
index c3c4046..0000000
--- a/docs/FIFO.md
+++ /dev/null
@@ -1,58 +0,0 @@
-# FIFO cache
-
-A First-In-First-Out cache is one that uses queuing logic for its backing store, expunging the elements at the front of the queue when a predetermined threshold is exceeded.
-
-> In simple terms, the FIFO cache will remove the element that has been in the cache the longest.
-
-*Before reading this page please make sure that you've read and understand the [Basic Usage patterns](./Using.md).*
-
-## General use
-
-To create a core.cache `FIFOCache` instance you should *always* use its associated constructor function `fifo-cache-factory` with an optional `:threshold` parameter:
-
-```clojure
-    (ns your.lib
-      (:require [clojure.core.cache :as cache]))
-	
-    (def C (cache/fifo-cache-factory {:a 1, :b 2, :c 3} :threshold 3))
-```
-
-*note: the default `:threshold` value is 32*
-
-The cache instance `C` is initialized with the seed map `{:a 1, :b 2}` and a queue threshold of `3`,  For your own purposes `2` is probably too small, but it's fine for the purpose of illustration.  Since the queue threshold was set to `3` adding one more element should evict the first element added `:a`; and indeed it does:
-
-```clojure
-    (assoc C :d 42)
-    ;=> {:c 3, :b 2, :d 42}
-```
-
-Likewise, adding two more elements should evict two values:
-
-```clojure
-    (assoc C :x 36 :z 138)
-    ;=> {:z 138, :x 36, :b 2}
-```
-
-Like all of the implementations in core.cache, `FIFOCache` instances operate like regular maps and are immutable. All caveats apply regarding the [proper usage patterns](./Using.md).
-
-## FIFO cache use cases
-
-The FIFO cache eviction policy is very simple to implement and understand.  Additionally, because the policy requires very little information, the implementation is reasonably efficient.
-
-The FIFO eviction policy is the base-level caching capability and is generally applicable.  However, because of its broad applicability it tends to evict at a rate non-optimally for every scenario.  Having said that, there are a few reasons why you might want to use a FIFO cache.
-
-### Benefits to using a FIFO cache
-
- * Its logic is easy to understand
- * It's reasonably fast
- * It's reasonably lightweight
- * Even a naive cache eviction policy may prove better than none
- * Your expensive calculations tend toward single-use
- * It works well for data subject to sequentiality
- 
-### Disadvantages to using a FIFO cache
-
- * It's not efficient for data subject to locality concerns
- * Increasing the cache size does not benefit its efficiency (see [Bélády's anomaly](http://en.wikipedia.org/wiki/B%C3%A9l%C3%A1dy's_anomaly))
-
-As always, you should measure your system's characteristics to determine the best eviction strategy for your purposes.
\ No newline at end of file
diff --git a/docs/Including.md b/docs/Including.md
deleted file mode 100644
index e1f1db4..0000000
--- a/docs/Including.md
+++ /dev/null
@@ -1,25 +0,0 @@
-Including core.cache in your projects
-=====================================
-
-The core.cache releases and snapshots are stored in the following repositories:
-
- * Release versions stored at [Maven Central](http://search.maven.org/#search%7Cgav%7C1%7Cg%3A%22org.clojure%22%20AND%20a%3A%22core.cache%22)
- * Snapshot versions stored at [Sonatype](https://oss.sonatype.org/index.html#nexus-search;gav~org.clojure~core.cache~~~) (url at <http://oss.sonatype.org/content/repositories/snapshots>)
-
-## Leiningen
-
-You can use core.cache in your [Leiningen](https://github.com/technomancy/leiningen) projects with the following `:dependencies` directive in your `project.clj` file:
-
-        [org.clojure/core.cache "1.0.217"]
-
-## Maven
-
-For Maven-driven projects, use the following slice of XML in your `pom.xml`'s `<dependencies>` section:
-
-    <dependency>
-	  <groupId>org.clojure</groupId>
-	  <artifactId>core.cache</artifactId>
-	  <version>1.0.217</version>
-	</dependency>
-
-Enjoy!
diff --git a/docs/LIRS.md b/docs/LIRS.md
deleted file mode 100644
index 9992104..0000000
--- a/docs/LIRS.md
+++ /dev/null
@@ -1,27 +0,0 @@
-LIRS cache
-==========
-
-The low inter-reference recency set cache is one that, like [LRU](./LRU.md), uses recency as its basis for behavior.  Unlike, LRU however, LIRS uses access recency of other cache elements relative to any other block to determine its eviction policy.
-
-*Before reading this page please make sure that you've read and understand the [Basic Usage patterns](./Using.md).*
-
-General usage
--------------
-
-To create a core.cache `LRUCache` instance you can do the following:
-
-```clojure
-    (ns your.lib 
-      (:require [clojure.core.cache :as cache]))
-	
-    (def C (cache/lirs-cache-factory {}))
-```
-
-Most of the trival examples will likely look very similar to the examples found in the [LRU](./LRU.md) page.  See the discussion in the next section why you might wish to choose LIRS instead.
-
-Like all of the implementations in core.cache, `LRUCache` instances operate like regular maps and are immutable. All caveats apply regarding the [proper usage patterns](./Using.md).
-
-LIRS cache use cases
---------------------
-
-TODO
diff --git a/docs/LRU.md b/docs/LRU.md
deleted file mode 100644
index f301ece..0000000
--- a/docs/LRU.md
+++ /dev/null
@@ -1,71 +0,0 @@
-LRU cache
-==========
-
-The least-recently-used cache is one that evicts items that are accessed least recently once its threshold has been exceeded.
-
-> In simple terms, the LRU cache will remove the element in the cache that has not been accessed in the longest time.
-
-*Before reading this page please make sure that you've read and understand the [Basic Usage patterns](./Using.md).*
-
-General usage
--------------
-
-To create a core.cache `LRUCache` instance you should *always* use its associated constructor function `lru-cache-factory` with an optional `:threshold` parameter:
-
-```clojure
-    (ns your.lib
-      (:require [clojure.core.cache :as cache]))
-
-    (def C (cache/lru-cache-factory {} :threshold 2))
-
-    (-> C (assoc :a 1) (assoc :b 2))
-	;=> {:a 1, :b 2}
-```
-
-*note: the default `:threshold` value is 32*
-
-At this point the cache has not yet crossed the set threshold of `2`, but if you execute yet another call the story will change:
-
-```clojure
-    (-> C (assoc :a 1) (assoc :b 2) (assoc :c 3))
-	;=> {:b 2, :c 3}
-```
-
-At this point the operation of the LRU cache looks exactly the same at the FIFO cache.  However, the difference becomes apparent when a given cache item is "touched":
-
-```clojure
-    (-> C (assoc :a 1)
-          (assoc :b 2)
-          (.hit :a)       ;; ensure :a is used most recently
-          (assoc :c 3))
-
-    ;=> {:a 1, :c 3}
-```
-
-As you see, hitting the element at the key `:a` will expose the LRU nature of the underlying cache.  That is, when the threshold is passed, the cache will expel the **L**east **R**ecently **U**sed element in favor of the new.  In this base case the items accessed most recetly were `:c` and `:a`.
-
-Like all of the implementations in core.cache, `LRUCache` instances operate like regular maps and are immutable. All caveats apply regarding the [proper usage patterns](./Using.md).
-
-LRU cache use case
-------------------
-
-The LRU cache eviction policy is very simple to understand and works well in general.  However, because the policy requires "age" information, the implementation is somewhat subtle and moderately memory intensive.
-
-### Advantages to using an LRU cache
-
-There are a few reasons why you might want to use a LRU cache:
-
- * Its logic is easy to understand
- * It's reasonably fast
- * It's generally efficient
- * It works well with data subject to locality concerns
- * It generally performs better as the cache size increases
- * Is fairly agile to catch up with changing access patterns
-
-### Disadvantages to using an LRU cache
-
- * Tends to perform poorly when elements files are accessed occasionally but consistently while other elements are accessed very frequently for a short duration and never accessed again
- * It requires more historical data to operate
- * It requires a larger cache to increase efficiency
-
-As always, you should measure your system's characteristics to determine the best eviction strategy for your purposes.
diff --git a/docs/LU.md b/docs/LU.md
deleted file mode 100644
index 83c291f..0000000
--- a/docs/LU.md
+++ /dev/null
@@ -1,71 +0,0 @@
-LU cache
-=========
-
-The least-used cache (sometimes called "Least Frequently Used") is a [variant of LRU](./LRU.md) that evicts items that are used least frequently once its threshold has been exceeded.
-
-> In simple terms, the LU cache will remove the element in the cache that has been accessed the least, regardless of time.
-
-*Before reading this page please make sure that you've read and understand the [Basic Usage patterns](./Using.md).*
-
-General usage
--------------
-
-To create a core.cache `LUCache` instance you should *always* use its associated constructor function `lu-cache-factory` with an optional `:threshold` parameter:
-
-```clojure
-    (ns your.lib 
-      (:require [clojure.core.cache :as cache]))
-	
-    (def C (cache/lu-cache-factory {} :threshold 2))
-    
-    (-> C (assoc :a 1) (assoc :b 2))
-	;=> {:a 1, :b 2}
-```
-
-*note: the default `:threshold` value is 32*
-	
-At this point the cache has not yet crossed the item threshold of `2`, but if you execute yet another call the story will change:
-
-```clojure
-    (-> C (assoc :a 1) (assoc :b 2) (assoc :c 3))
-	;=> {:b 2, :c 3}
-```
-
-At this point the operation of the LU cache looks exactly the same at the FIFO cache.  However, the difference becomes apparent when a given cache item is "touched":
-
-```clojure
-    (-> C (assoc :a 1) 
-          (assoc :b 2)
-          (.hit :b)
-          (.hit :b)
-          (.hit :a)       ;; ensure :a is used most recently
-          (assoc :c 3))
-    
-    ;=> {:c 3, :b 2}
-```
-
-As you see, hitting the key `:b` twice marks it as more important that `:a` even though the latter was "touched" more recently.  That is, when the threshold is passed, the cache will expel the **L**east **U**sed element in favor of the element accessed most often.
-
-All caveats apply regarding the [proper usage patterns](./Using.md).
-
-LU cache use cases
-------------------
-
-The LU cache eviction policy is very simple to understand and works well in general.
-
-### Advantages to using an LU cache
-
-There are a few reasons why you might want to use an LU cache:
-
- * Performs pretty well if access patterns rarely change
- * Its logic is easy to understand
- * It's reasonably fast
- * It works well with data subject to temporal locality concerns
-
-### Disadvantages to using an LU cache
-
- * It performs poorly when access patterns change
- * It requires some historical data to operate
- * It requires a larger cache to increase efficiency
- 
-As always, you should measure your system's characteristics to determine the best eviction strategy for your purposes.
diff --git a/docs/Plans.md b/docs/Plans.md
deleted file mode 100644
index 17d95e2..0000000
--- a/docs/Plans.md
+++ /dev/null
@@ -1,14 +0,0 @@
-# Plans for core.cache
-
-These were Fogus's plans for core.cache. See https://clojure.atlassian.net/projects/CCACHE/issues/?filter=allopenissues for what is actually being considered.
-
- * Most Recently Used cache implementation
- * Function-backed cache implementation
- * Random eviction cache implementation
- * Double-cache lookup implementation
- * Asynchronous caching protocol
- * LIRSCache evict
- * Adaptive eviction caching
- * test.generative usage
- * Explore Arc impl.
- * More documentation and examples
diff --git a/docs/README.md b/docs/README.md
deleted file mode 100644
index 1f81d19..0000000
--- a/docs/README.md
+++ /dev/null
@@ -1,49 +0,0 @@
-core.cache
-==========
-
-> Note: the documentation here is for the `clojure.core.cache` namespace. See also the documentation for the [`clojure.core.cache.wrapped` namespace](https://cljdoc.org/d/org.clojure/core.cache/CURRENT/api/clojure.core.cache.wrapped) on cljdoc.org.
-
-## Table of Topics
-
-* Overview (this page)
-* [Including core.cache in your projects](./Including.md)
-* [Example usages of core.cache](./Using.md)
-* [Composing caches](./Composing.md)
-* [Creating custom caches](./Extending.md)
-* [Building core.cache](./Building.md)
-* [Plans for core.cache](./Plans.md)
-
-## The problem
-
-Value caching is sometimes needed. This need is often driven by the desire is to avoid calculating expensive operations such as inherently costly algorithms or I/O more often than necessary.  The naive solution for this need is to perform some expensive operation once and cache the result.  Therefore, whenever the same calculation is needed in the future it can be retrieved from cache more quickly than simply recalculating from scratch.
-
-While effective for small domains, the naive caching of many expensive calculations or cyclopean results can consume available memory quickly.  Therefore, the ideal situation is to expunge stored results that have expired, meant for single-use or less likely to be needed again.  There are many general-purpose and domain-specific strategies for efficient cache population and eviction. The core.cache library provides implementations of common caching strategies as well as a mechanism for implementing custom strategies.
-
-## Overview
-
-core.cache is a Clojure contrib library providing the following features:
-
-* An underlying `CacheProtocol` used as the base abstraction for implementing new synchronous caches
-
-* A `defcache` macro for hooking your `CacheProtocol` implementations into the Clojure associative data capabilities.
-
-* Implementations of some common caching strategies, including:
-  - [First-in-first-out](./FIFO.md)
-  - [Least-recently-used](./LRU.md)
-  - [Least-used](./LU.md)
-  - [Time-to-live](./TTL.md)
-  - Function-backed cache (work in progress)
-  - Soft-reference cache (work in progress)
-
-* Implementation of an efficient buffer replacement policy based on the *low inter-reference recency set* algorithm ([LIRSCache](./LIRS.md)) described in the [LIRS](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2184) paper
-
-* Factory functions for each existing cache type
-
-*The implementation of core.cache is based on and heavily influenced by the excellent ['Memoize done right'](http://kotka.de/blog/2010/03/memoize_done_right.html) by Meikel Brandmeyer*
-
-## Places
-
-* [Source code](https://github.com/clojure/core.cache)
-* [Ticket system](http://clojure.atlassian.net/browse/CCACHE)
-* [Announcement](http://groups.google.com/group/clojure/browse_frm/thread/69d08572ab265dc7)
-* [Examples and documentation](http://github.com/clojure/core.cache/wiki)
\ No newline at end of file
diff --git a/docs/TTL.md b/docs/TTL.md
deleted file mode 100644
index b1981d0..0000000
--- a/docs/TTL.md
+++ /dev/null
@@ -1,59 +0,0 @@
-TTL cache
-==========
-
-The time-to-live cache is one that evicts items that are older than a time-to-live threshold (in milliseconds).
-
-*Before reading this page please make sure that you've read and understand the [Basic Usage patterns](./Using.md).*
-
-General usage
--------------
-
-To create a core.cache `TTLCacheQ` instance you should *always* use its associated constructor function `ttl-cache-factory` with an optional `:ttl` parameter:
-
-```clojure
-    (ns your.lib
-      (:require [clojure.core.cache :as cache]))
-
-    (def C (cache/ttl-cache-factory {} :ttl 1000))
-
-    (-> C (assoc :a 1) (assoc :b 2))
-	;=> {:a 1, :b 2}
-```
-
-*note: the default `:ttl` value is 2 seconds*
-
-At this point the cache is fresh and younger than one second (that is, depending on how fast you read), but if you execute yet another call the story will change:
-
-```clojure
-    (def sleepy #(do (Thread/sleep %2) %))
-
-    (-> C (assoc :a 1)
-	      (assoc :b 2)
-		  (sleepy 1500)
-	      (assoc :c 3))
-	;=> {:c 3}
-```
-
-At this point the operation of the TTL cache is exposed.  As you see, sleeping in between adding the keys `:a` and `:b` causes them to be evicted on the next insertion.
-
-All caveats apply regarding the [proper usage patterns](./Using.md).
-
-TTL cache use cases
---------------------
-
-The TTL cache eviction policy is very simple to understand and works well for certain scenarios.  However, because the policy requires "age" information, the implementation is somewhat subtle and moderately memory intensive.
-
-### Advantages to using an TTL cache
-
-There are a few reasons why you might want to use a TTL cache:
-
- * Its logic is easy to understand
- * It's reasonably fast
- * It works well with data subject to temporal concerns
-
-### Disadvantages to using an TTL cache
-
- * It requires more historical data to operate
- * Cache size does not generally help its efficiency
-
-As always, you should measure your system's characteristics to determine the best eviction strategy for your purposes.
diff --git a/docs/Using.md b/docs/Using.md
deleted file mode 100644
index 2c56f10..0000000
--- a/docs/Using.md
+++ /dev/null
@@ -1,88 +0,0 @@
-> Note: the documentation here is for the `clojure.core.cache` namespace. See also the documentation for the [`clojure.core.cache.wrapped` namespace](https://cljdoc.org/d/org.clojure/core.cache/CURRENT/api/clojure.core.cache.wrapped) on cljdoc.org.
-
-# Using core.cache
-
-*note: see the page on [including core.cache](./Including.md) before you begin this section*
-
-## Basic usage pattern
-
-To use the cache implementations or extend the core.cache protocols you first need to require the proper namespace:
-
-```clojure
-(require '[clojure.core.cache :as cache])
-```
-
-Next you should create an instance of a specific cache type, optionally seeded:
-
-```clojure
-(def C (cache/fifo-cache-factory {:a 1, :b 2}))
-```
-
-To find a value in a map by its key you have a couple choices:
-
-```clojure
-(cache/lookup C :a)
-;=> 1
-
-(:b C)
-;=> 2
-```
-
-To ensure the proper cache policies are followed for each specific type, the following `has?/hit/miss` pattern should be used:
-
-```clojure
-(if (cache/has? C :c)     ;; has? checks that the cache contains an item
-  (cache/hit C :c)        ;; hit returns a cache with any relevant internal information updated
-  (cache/miss C :c 42))   ;; miss returns a new cache with the new item and without evicted entries
-
-;=> {:a 1, :b 2, :c 42}
-```
-
-Using the `has?/hit/miss` pattern ensures that the thresholding and eviction logic for each implementation works properly. It is built into the `through` and `through-cache` functions, as well as `clojure.core.cache.wrapped/lookup-or-miss`.  **Avoid this pattern at your own risk.**
-
-Finally, to explicitly evict an element in a cache, use the `evict` function:
-
-```clojure
-(cache/evict C :b)
-
-;=> {:a 1}
-```
-
-For specific information about eviction policies and thresholds, view the specific documentation for each cache type listed in the next section.
-
-Sometimes you may wish to cache a function except when it returns certain values,
-such as a resource-loading function that may return `nil` if the resource is
-(temporarily) unavailable. Because of the edge cases that can arise with doing
-multiple lookups on a cache -- protections from which are baked into `through`,
-`through-cache`, and `lookup-or-miss` -- it is better to write your code to
-simply cache all results and then, post-retrieval, `evict` the key if the
-result is something you don't want cached:
-
-```clojure
-(let [result (wrapped/lookup-or-miss C :c load-my-resource)]
-  (when (nil? result) ; or seq or whatever condition should exclude this result
-    (wrapped/evict C :c))
-  result)
-```
-
-## Builtin cache implementations
-
-core.cache comes with a number of builtin immutable cache implementations, including (*click through for specific information*):
-
-* [FIFO cache](./FIFO.md)
-* [LRU cache](./LRU.md)
-* [LU cache](./LU.md)
-* [TTL cache](./TTL.md)
-* [LIRS cache](./LIRS.md)
-* Function-backed cache (work in progress)
-* Soft-reference cache (work in progress)
-
-The core.cache implementations are backed by any map-like object.  Additionally, each cache implements the Clojure map behaviors and can therefore serve as special maps or even as backing stores for other cache implementations.  For caches taking a limit argument, the eviction policies tend not to apply until the limit has been exceeded.
-
-## Extending core.cache
-
-See the section [on creating custom caches](./Extending.md) for more information.
-
-## Nesting cache types
-
-See the section [on composing caches](./Composing.md) for more information.
diff --git a/docs/release-notes/release-0.5.0.markdown b/docs/release-notes/release-0.5.0.markdown
deleted file mode 100644
index b07d756..0000000
--- a/docs/release-notes/release-0.5.0.markdown
+++ /dev/null
@@ -1,76 +0,0 @@
-core.cache v0.5.0 Release Notes
-===============================
-
-core.cache is a new Clojure contrib library providing the following features:
-
-* An underlying `CacheProtocol` used as the base abstraction for implementing new synchronous caches
-
-* A `defcache` macro for hooking your `CacheProtocol` implementations into the Clojure associative data capabilities.
-
-* Immutable implementations of some basic caching strategies
-  - First-in-first-out (FIFOCache)
-  - Least-recently-used (LRUCache)
-  - Least-used (LUCache)
-  - Time-to-live (TTLCache)
-  - Naive cache (BasicCache)
-
-* Implementation of an efficient buffer replacement policy based on the *low inter-reference recency set* algorithm (LIRSCache) described in the [LIRS](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2184) paper
-
-* Factory functions for each existing cache type
-
-core.cache is based on a library named Clache, found at http://github.com/fogus/clache that is planned for deprecation.
-
-
-Absorb
-------
-
-You can use core.cache in your [Leiningen](https://github.com/technomancy/leiningen) and [Cake](https://github.com/flatland/cake) projects with the following `:dependencies` directive in your `project.clj` file:
-
-    [org.clojure/core.cache "0.5.0"]
-
-For Maven-driven projects, use the following slice of XML in your `pom.xml`'s `<dependencies>` section:
-
-    <dependency>
-	  <groupId>org.clojure</groupId>
-	  <artifactId>core.cache</artifactId>
-	  <version>0.5.0</version>
-	</dependency>
-
-Enjoy!
-
-
-Places
-------
-
-* [Source code](https://github.com/clojure/core.cache)
-* [Ticket system](http://clojure.atlassian.net/browse/CCACHE)
-* [Announcement](http://groups.google.com/group/clojure/browse_frm/thread/69d08572ab265dc7)
-* Examples and documentation -- in progress
-
-Changes from Clache
--------------------
-
-The v0.5.0 version of core.cache is based almost wholly on the final version of Clache, with the following changes:
-
-* An addition of an `evict` function on the `CacheProtocol` used to explicitly remove a value from a cache based on a key.  All of the existing cache types implement this function *except* for `LIRSCache`.
-
-* The addition of cache factory functions for all of the existing cache types
-
-* The associative structure behaviors are defined solely in terms of the underlying `CacheProtocol`
-
-* The `SoftCache` implementation was buggy and removed for now
-
-Plans
------
-
-The following capabilities are under design, development, or consideration for future versions of core.cache:
-
-* Asynchronous caching protocol
-* `LIRSCache evict`
-* Removal of the `seed` function from the `CacheProtocol`
-* Reimplementation of a cache based on soft references
-* test.generative usage
-* Deprecation of Clache
-* Documentation and examples
-
-More planning is needed around capabilities not listed nor thought of.
diff --git a/docs/release-notes/release-0.6.1.markdown b/docs/release-notes/release-0.6.1.markdown
deleted file mode 100644
index 14cd378..0000000
--- a/docs/release-notes/release-0.6.1.markdown
+++ /dev/null
@@ -1,76 +0,0 @@
-core.cache v0.6.1 Release Notes
-===============================
-
-core.cache is a new Clojure contrib library providing the following features:
-
-* An underlying `CacheProtocol` used as the base abstraction for implementing new synchronous caches
-
-* A `defcache` macro for hooking your `CacheProtocol` implementations into the Clojure associative data capabilities.
-
-* Immutable implementations of some basic caching strategies
-  - First-in-first-out (FIFOCache)
-  - Least-recently-used (LRUCache)
-  - Least-used (LUCache)
-  - Time-to-live (TTLCache)
-  - Soft-Reference cache (SoftCache)
-  - Naive cache (BasicCache)
-
-* Implementation of an efficient buffer replacement policy based on the *low inter-reference recency set* algorithm (LIRSCache) described in the [LIRS](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2184) paper
-
-* Factory functions for each existing cache type
-
-Absorb
-------
-
-You can use core.cache in your [Leiningen](https://github.com/technomancy/leiningen) and [Cake](https://github.com/flatland/cake) projects with the following `:dependencies` directive in your `project.clj` file:
-
-    [org.clojure/core.cache "0.6.1"]
-
-For Maven-driven projects, use the following slice of XML in your `pom.xml`'s `<dependencies>` section:
-
-    <dependency>
-	  <groupId>org.clojure</groupId>
-	  <artifactId>core.cache</artifactId>
-	  <version>0.6.1</version>
-	</dependency>
-
-Enjoy!
-
-
-Places
-------
-
-* [Source code](https://github.com/clojure/core.cache)
-* [Ticket system](http://clojure.atlassian.net/browse/CCACHE)
-* [Announcement](http://groups.google.com/group/clojure/browse_frm/thread/69d08572ab265dc7)
-* [API Reference](https://clojure.github.io/core.cache)
-* [Examples and documentation](https://github.com/clojure/core.cache/wiki) (work in progress)
-
-Changes from v0.5.0
--------------------
-
-The v0.6.1 version of core.cache contains the following changes:
-
-* The addition of a cache built on Java soft references
-
-* Bug fix for LRU and LU caches disabling the eviction of duplicate keys prior to threshold.
-
-* The factory function optional argument named `:limit` was changed to `:threshold`.
-
-* The default thresholds set by the factory functions were adjusted.
-
-Plans
------
-
-The following capabilities are under design, development, or consideration for future versions of core.cache:
-
-* Make ClojureScript compatible
-* Asynchronous caching protocol
-* FunCache implementation
-* `LIRSCache evict`
-* Hardening of the `seed` function implementations
-* test.generative usage
-* Deprecation of Clache
-* More documentation and examples
-
-More planning is needed around capabilities not listed nor thought of.
diff --git a/docs/release-notes/release-0.6.2.markdown b/docs/release-notes/release-0.6.2.markdown
deleted file mode 100644
index 7835912..0000000
--- a/docs/release-notes/release-0.6.2.markdown
+++ /dev/null
@@ -1,75 +0,0 @@
-core.cache v0.6.2 Release Notes
-===============================
-
-core.cache is a Clojure contrib library providing the following features:
-
-* An underlying `CacheProtocol` used as the base abstraction for implementing new synchronous caches
-
-* A `defcache` macro for hooking your `CacheProtocol` implementations into the Clojure associative data capabilities.
-
-* Immutable implementations of some basic caching strategies
-  - First-in-first-out (FIFOCache)
-  - Least-recently-used (LRUCache)
-  - Least-used (LUCache)
-  - Time-to-live (TTLCache)
-  - Soft-Reference cache (SoftCache)
-  - Naive cache (BasicCache)
-
-* Implementation of an efficient buffer replacement policy based on the *low inter-reference recency set* algorithm (LIRSCache) described in the [LIRS](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2184) paper
-
-* Factory functions for each existing cache type
-
-Absorb
-------
-
-You can use core.cache in your [Leiningen](https://github.com/technomancy/leiningen) and [Cake](https://github.com/flatland/cake) projects with the following `:dependencies` directive in your `project.clj` file:
-
-    [org.clojure/core.cache "0.6.2"]
-
-For Maven-driven projects, use the following slice of XML in your `pom.xml`'s `<dependencies>` section:
-
-    <dependency>
-	  <groupId>org.clojure</groupId>
-	  <artifactId>core.cache</artifactId>
-	  <version>0.6.2</version>
-	</dependency>
-
-Enjoy!
-
-
-Places
-------
-
-* [Source code](https://github.com/clojure/core.cache)
-* [Ticket system](http://clojure.atlassian.net/browse/CCACHE)
-* [Announcement](http://groups.google.com/group/clojure/browse_frm/thread/69d08572ab265dc7)
-* [API Reference](https://clojure.github.io/core.cache)
-* [Examples and documentation](https://github.com/clojure/core.cache/wiki) (work in progress)
-
-Changes from v0.6.1
--------------------
-
-The v0.6.2 version of core.cache contains the following changes:
-
-* Removed reflection warnings.
-
-* Bug fix for LRU, LU and TTL caches disabling the eviction of duplicate keys prior to a threshold less than three.
-
-* FIFOCache respects threshold prior to applying its eviction policy.
-
-Plans
------
-
-The following capabilities are under design, development, or consideration for future versions of core.cache:
-
-* More speed!
-* Make ClojureScript compatible
-* Asynchronous caching protocol
-* FunCache implementation
-* `LIRSCache evict`
-* Hardening of the `seed` function implementations
-* test.generative usage
-* Deprecation of Clache
-* More documentation and examples
-
-More planning is needed around capabilities not listed nor thought of.
diff --git a/epl-v10.html b/epl-v10.html
deleted file mode 100644
index 84ec251..0000000
--- a/epl-v10.html
+++ /dev/null
@@ -1,261 +0,0 @@
-<?xml version="1.0" encoding="ISO-8859-1" ?>
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml">
-
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1" />
-<title>Eclipse Public License - Version 1.0</title>
-<style type="text/css">
-  body {
-    size: 8.5in 11.0in;
-    margin: 0.25in 0.5in 0.25in 0.5in;
-    tab-interval: 0.5in;
-    }
-  p {  	
-    margin-left: auto;
-    margin-top:  0.5em;
-    margin-bottom: 0.5em;
-    }
-  p.list {
-  	margin-left: 0.5in;
-    margin-top:  0.05em;
-    margin-bottom: 0.05em;
-    }
-  </style>
-
-</head>
-
-<body lang="EN-US">
-
-<p align=center><b>Eclipse Public License - v 1.0</b></p>
-
-<p>THE ACCOMPANYING PROGRAM IS PROVIDED UNDER THE TERMS OF THIS ECLIPSE
-PUBLIC LICENSE (&quot;AGREEMENT&quot;). ANY USE, REPRODUCTION OR
-DISTRIBUTION OF THE PROGRAM CONSTITUTES RECIPIENT'S ACCEPTANCE OF THIS
-AGREEMENT.</p>
-
-<p><b>1. DEFINITIONS</b></p>
-
-<p>&quot;Contribution&quot; means:</p>
-
-<p class="list">a) in the case of the initial Contributor, the initial
-code and documentation distributed under this Agreement, and</p>
-<p class="list">b) in the case of each subsequent Contributor:</p>
-<p class="list">i) changes to the Program, and</p>
-<p class="list">ii) additions to the Program;</p>
-<p class="list">where such changes and/or additions to the Program
-originate from and are distributed by that particular Contributor. A
-Contribution 'originates' from a Contributor if it was added to the
-Program by such Contributor itself or anyone acting on such
-Contributor's behalf. Contributions do not include additions to the
-Program which: (i) are separate modules of software distributed in
-conjunction with the Program under their own license agreement, and (ii)
-are not derivative works of the Program.</p>
-
-<p>&quot;Contributor&quot; means any person or entity that distributes
-the Program.</p>
-
-<p>&quot;Licensed Patents&quot; mean patent claims licensable by a
-Contributor which are necessarily infringed by the use or sale of its
-Contribution alone or when combined with the Program.</p>
-
-<p>&quot;Program&quot; means the Contributions distributed in accordance
-with this Agreement.</p>
-
-<p>&quot;Recipient&quot; means anyone who receives the Program under
-this Agreement, including all Contributors.</p>
-
-<p><b>2. GRANT OF RIGHTS</b></p>
-
-<p class="list">a) Subject to the terms of this Agreement, each
-Contributor hereby grants Recipient a non-exclusive, worldwide,
-royalty-free copyright license to reproduce, prepare derivative works
-of, publicly display, publicly perform, distribute and sublicense the
-Contribution of such Contributor, if any, and such derivative works, in
-source code and object code form.</p>
-
-<p class="list">b) Subject to the terms of this Agreement, each
-Contributor hereby grants Recipient a non-exclusive, worldwide,
-royalty-free patent license under Licensed Patents to make, use, sell,
-offer to sell, import and otherwise transfer the Contribution of such
-Contributor, if any, in source code and object code form. This patent
-license shall apply to the combination of the Contribution and the
-Program if, at the time the Contribution is added by the Contributor,
-such addition of the Contribution causes such combination to be covered
-by the Licensed Patents. The patent license shall not apply to any other
-combinations which include the Contribution. No hardware per se is
-licensed hereunder.</p>
-
-<p class="list">c) Recipient understands that although each Contributor
-grants the licenses to its Contributions set forth herein, no assurances
-are provided by any Contributor that the Program does not infringe the
-patent or other intellectual property rights of any other entity. Each
-Contributor disclaims any liability to Recipient for claims brought by
-any other entity based on infringement of intellectual property rights
-or otherwise. As a condition to exercising the rights and licenses
-granted hereunder, each Recipient hereby assumes sole responsibility to
-secure any other intellectual property rights needed, if any. For
-example, if a third party patent license is required to allow Recipient
-to distribute the Program, it is Recipient's responsibility to acquire
-that license before distributing the Program.</p>
-
-<p class="list">d) Each Contributor represents that to its knowledge it
-has sufficient copyright rights in its Contribution, if any, to grant
-the copyright license set forth in this Agreement.</p>
-
-<p><b>3. REQUIREMENTS</b></p>
-
-<p>A Contributor may choose to distribute the Program in object code
-form under its own license agreement, provided that:</p>
-
-<p class="list">a) it complies with the terms and conditions of this
-Agreement; and</p>
-
-<p class="list">b) its license agreement:</p>
-
-<p class="list">i) effectively disclaims on behalf of all Contributors
-all warranties and conditions, express and implied, including warranties
-or conditions of title and non-infringement, and implied warranties or
-conditions of merchantability and fitness for a particular purpose;</p>
-
-<p class="list">ii) effectively excludes on behalf of all Contributors
-all liability for damages, including direct, indirect, special,
-incidental and consequential damages, such as lost profits;</p>
-
-<p class="list">iii) states that any provisions which differ from this
-Agreement are offered by that Contributor alone and not by any other
-party; and</p>
-
-<p class="list">iv) states that source code for the Program is available
-from such Contributor, and informs licensees how to obtain it in a
-reasonable manner on or through a medium customarily used for software
-exchange.</p>
-
-<p>When the Program is made available in source code form:</p>
-
-<p class="list">a) it must be made available under this Agreement; and</p>
-
-<p class="list">b) a copy of this Agreement must be included with each
-copy of the Program.</p>
-
-<p>Contributors may not remove or alter any copyright notices contained
-within the Program.</p>
-
-<p>Each Contributor must identify itself as the originator of its
-Contribution, if any, in a manner that reasonably allows subsequent
-Recipients to identify the originator of the Contribution.</p>
-
-<p><b>4. COMMERCIAL DISTRIBUTION</b></p>
-
-<p>Commercial distributors of software may accept certain
-responsibilities with respect to end users, business partners and the
-like. While this license is intended to facilitate the commercial use of
-the Program, the Contributor who includes the Program in a commercial
-product offering should do so in a manner which does not create
-potential liability for other Contributors. Therefore, if a Contributor
-includes the Program in a commercial product offering, such Contributor
-(&quot;Commercial Contributor&quot;) hereby agrees to defend and
-indemnify every other Contributor (&quot;Indemnified Contributor&quot;)
-against any losses, damages and costs (collectively &quot;Losses&quot;)
-arising from claims, lawsuits and other legal actions brought by a third
-party against the Indemnified Contributor to the extent caused by the
-acts or omissions of such Commercial Contributor in connection with its
-distribution of the Program in a commercial product offering. The
-obligations in this section do not apply to any claims or Losses
-relating to any actual or alleged intellectual property infringement. In
-order to qualify, an Indemnified Contributor must: a) promptly notify
-the Commercial Contributor in writing of such claim, and b) allow the
-Commercial Contributor to control, and cooperate with the Commercial
-Contributor in, the defense and any related settlement negotiations. The
-Indemnified Contributor may participate in any such claim at its own
-expense.</p>
-
-<p>For example, a Contributor might include the Program in a commercial
-product offering, Product X. That Contributor is then a Commercial
-Contributor. If that Commercial Contributor then makes performance
-claims, or offers warranties related to Product X, those performance
-claims and warranties are such Commercial Contributor's responsibility
-alone. Under this section, the Commercial Contributor would have to
-defend claims against the other Contributors related to those
-performance claims and warranties, and if a court requires any other
-Contributor to pay any damages as a result, the Commercial Contributor
-must pay those damages.</p>
-
-<p><b>5. NO WARRANTY</b></p>
-
-<p>EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, THE PROGRAM IS
-PROVIDED ON AN &quot;AS IS&quot; BASIS, WITHOUT WARRANTIES OR CONDITIONS
-OF ANY KIND, EITHER EXPRESS OR IMPLIED INCLUDING, WITHOUT LIMITATION,
-ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT, MERCHANTABILITY
-OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is solely
-responsible for determining the appropriateness of using and
-distributing the Program and assumes all risks associated with its
-exercise of rights under this Agreement , including but not limited to
-the risks and costs of program errors, compliance with applicable laws,
-damage to or loss of data, programs or equipment, and unavailability or
-interruption of operations.</p>
-
-<p><b>6. DISCLAIMER OF LIABILITY</b></p>
-
-<p>EXCEPT AS EXPRESSLY SET FORTH IN THIS AGREEMENT, NEITHER RECIPIENT
-NOR ANY CONTRIBUTORS SHALL HAVE ANY LIABILITY FOR ANY DIRECT, INDIRECT,
-INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING
-WITHOUT LIMITATION LOST PROFITS), HOWEVER CAUSED AND ON ANY THEORY OF
-LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OR
-DISTRIBUTION OF THE PROGRAM OR THE EXERCISE OF ANY RIGHTS GRANTED
-HEREUNDER, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.</p>
-
-<p><b>7. GENERAL</b></p>
-
-<p>If any provision of this Agreement is invalid or unenforceable under
-applicable law, it shall not affect the validity or enforceability of
-the remainder of the terms of this Agreement, and without further action
-by the parties hereto, such provision shall be reformed to the minimum
-extent necessary to make such provision valid and enforceable.</p>
-
-<p>If Recipient institutes patent litigation against any entity
-(including a cross-claim or counterclaim in a lawsuit) alleging that the
-Program itself (excluding combinations of the Program with other
-software or hardware) infringes such Recipient's patent(s), then such
-Recipient's rights granted under Section 2(b) shall terminate as of the
-date such litigation is filed.</p>
-
-<p>All Recipient's rights under this Agreement shall terminate if it
-fails to comply with any of the material terms or conditions of this
-Agreement and does not cure such failure in a reasonable period of time
-after becoming aware of such noncompliance. If all Recipient's rights
-under this Agreement terminate, Recipient agrees to cease use and
-distribution of the Program as soon as reasonably practicable. However,
-Recipient's obligations under this Agreement and any licenses granted by
-Recipient relating to the Program shall continue and survive.</p>
-
-<p>Everyone is permitted to copy and distribute copies of this
-Agreement, but in order to avoid inconsistency the Agreement is
-copyrighted and may only be modified in the following manner. The
-Agreement Steward reserves the right to publish new versions (including
-revisions) of this Agreement from time to time. No one other than the
-Agreement Steward has the right to modify this Agreement. The Eclipse
-Foundation is the initial Agreement Steward. The Eclipse Foundation may
-assign the responsibility to serve as the Agreement Steward to a
-suitable separate entity. Each new version of the Agreement will be
-given a distinguishing version number. The Program (including
-Contributions) may always be distributed subject to the version of the
-Agreement under which it was received. In addition, after a new version
-of the Agreement is published, Contributor may elect to distribute the
-Program (including its Contributions) under the new version. Except as
-expressly stated in Sections 2(a) and 2(b) above, Recipient receives no
-rights or licenses to the intellectual property of any Contributor under
-this Agreement, whether expressly, by implication, estoppel or
-otherwise. All rights in the Program not expressly granted under this
-Agreement are reserved.</p>
-
-<p>This Agreement is governed by the laws of the State of New York and
-the intellectual property laws of the United States of America. No party
-to this Agreement will bring a legal action under this Agreement more
-than one year after the cause of action arose. Each party waives its
-rights to a jury trial in any resulting litigation.</p>
-
-</body>
-
-</html>
diff --git a/index-0.8.3-SNAPSHOT.clj b/index-0.8.3-SNAPSHOT.clj
new file mode 100644
index 0000000..8d5a29a
--- /dev/null
+++ b/index-0.8.3-SNAPSHOT.clj
@@ -0,0 +1,640 @@
+{:namespaces
+ ({:doc "A caching library for Clojure.",
+   :author "Fogus",
+   :name "clojure.core.cache",
+   :wiki-url "https://clojure.github.io/core.cache/index.html",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj"}
+  {:doc
+   "A higher level way to use clojure.core.cache that assumes the immutable\ncache is wrapped in an atom.\n\nThe API is (almost) the same as clojure.core.cache -- including the factory\nfunctions -- but instead of accepting immutable caches, the functions\nhere accept atoms containing those caches. The factory functions return\nnew atoms containing the newly created cache.\n\nIn addition, lookup-or-miss provides a safe, atomic way to retrieve a\nvalue from a cache or compute it if it is missing, without risking a\ncache stampede.",
+   :name "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache/index.html#clojure.core.cache.wrapped",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj"}),
+ :vars
+ ({:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->BasicCache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L115",
+   :line 115,
+   :var-type "function",
+   :arglists ([cache]),
+   :doc
+   "Positional factory function for class clojure.core.cache.BasicCache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->BasicCache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->FIFOCache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L173",
+   :line 173,
+   :var-type "function",
+   :arglists ([cache q limit]),
+   :doc
+   "Positional factory function for class clojure.core.cache.FIFOCache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->FIFOCache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->FnCache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L135",
+   :line 135,
+   :var-type "function",
+   :arglists ([cache f]),
+   :doc
+   "Positional factory function for class clojure.core.cache.FnCache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->FnCache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->LIRSCache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L437",
+   :line 437,
+   :var-type "function",
+   :arglists ([cache lruS lruQ tick limitS limitQ]),
+   :doc
+   "Positional factory function for class clojure.core.cache.LIRSCache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->LIRSCache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->LRUCache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L214",
+   :line 214,
+   :var-type "function",
+   :arglists ([cache lru tick limit]),
+   :doc
+   "Positional factory function for class clojure.core.cache.LRUCache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->LRUCache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->LUCache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L316",
+   :line 316,
+   :var-type "function",
+   :arglists ([cache lu limit]),
+   :doc
+   "Positional factory function for class clojure.core.cache.LUCache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->LUCache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->SoftCache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L522",
+   :line 522,
+   :var-type "function",
+   :arglists ([cache rcache rq]),
+   :doc
+   "Positional factory function for class clojure.core.cache.SoftCache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->SoftCache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "->TTLCacheQ",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L272",
+   :line 272,
+   :var-type "function",
+   :arglists ([cache ttl q gen ttl-ms]),
+   :doc
+   "Positional factory function for class clojure.core.cache.TTLCacheQ.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/->TTLCacheQ"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "basic-cache-factory",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L581",
+   :line 581,
+   :var-type "function",
+   :arglists ([base]),
+   :doc "Returns a pluggable basic cache initialied to `base`",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/basic-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "fifo-cache-factory",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L587",
+   :line 587,
+   :var-type "function",
+   :arglists ([base & {threshold :threshold, :or {threshold 32}}]),
+   :doc
+   "Returns a FIFO cache with the cache and FIFO queue initialized to `base` --\nthe queue is filled as the values are pulled out of `base`.  If the associative\nstructure can guarantee ordering, then the said ordering will define the\neventual eviction order.  Otherwise, there are no guarantees for the eventual\neviction ordering.\n\nThis function takes an optional `:threshold` argument that defines the maximum number\nof elements in the cache before the FIFO semantics apply (default is 32).\n\nIf the number of elements in `base` is greater than the limit then some items\nin `base` will be dropped from the resulting cache.  If the associative\nstructure used as `base` can guarantee sorting, then the last `limit` elements\nwill be used as the cache seed values.  Otherwise, there are no guarantees about\nthe elements in the resulting cache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/fifo-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "lirs-cache-factory",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L640",
+   :line 640,
+   :var-type "function",
+   :arglists
+   ([base
+     &
+     {:keys [s-history-limit q-history-limit],
+      :or {s-history-limit 32, q-history-limit 32}}]),
+   :doc
+   "Returns an LIRS cache with the S & R LRU lists set to the indicated\nlimits.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/lirs-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "lru-cache-factory",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L608",
+   :line 608,
+   :var-type "function",
+   :arglists ([base & {threshold :threshold, :or {threshold 32}}]),
+   :doc
+   "Returns an LRU cache with the cache and usage-table initialied to `base` --\neach entry is initialized with the same usage value.\n\nThis function takes an optional `:threshold` argument that defines the maximum number\nof elements in the cache before the LRU semantics apply (default is 32).",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/lru-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "lu-cache-factory",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L630",
+   :line 630,
+   :var-type "function",
+   :arglists ([base & {threshold :threshold, :or {threshold 32}}]),
+   :doc
+   "Returns an LU cache with the cache and usage-table initialied to `base`.\n\nThis function takes an optional `:threshold` argument that defines the maximum number\nof elements in the cache before the LU semantics apply (default is 32).",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/lu-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "soft-cache-factory",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L651",
+   :line 651,
+   :var-type "function",
+   :arglists ([base]),
+   :doc
+   "Returns a SoftReference cache.  Cached values will be referred to with\nSoftReferences, allowing the values to be garbage collected when there is\nmemory pressure on the JVM.\n\nSoftCache is a mutable cache, since it is always based on a\nConcurrentHashMap.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/soft-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "through",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L44",
+   :line 44,
+   :var-type "function",
+   :arglists
+   ([cache item] [value-fn cache item] [wrap-fn value-fn cache item]),
+   :doc
+   "The basic hit/miss logic for the cache system.  Expects a wrap function and\nvalue function.  The wrap function takes the value function and the item in question\nand is expected to run the value function with the item whenever a cache\nmiss occurs.  The intent is to hide any cache-specific cells from leaking\ninto the cache logic itelf.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/through"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "through-cache",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L57",
+   :line 57,
+   :var-type "function",
+   :arglists
+   ([cache item] [cache item value-fn] [cache item wrap-fn value-fn]),
+   :doc
+   "The basic hit/miss logic for the cache system.  Like through but always has\nthe cache argument in the first position for easier use with swap! etc.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/through-cache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "ttl-cache-factory",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L619",
+   :line 619,
+   :var-type "function",
+   :arglists ([base & {ttl :ttl, :or {ttl 2000}}]),
+   :doc
+   "Returns a TTL cache with the cache and expiration-table initialized to `base` --\neach with the same time-to-live.\n\nThis function also allows an optional `:ttl` argument that defines the default\ntime in milliseconds that entries are allowed to reside in the cache.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/ttl-cache-factory"}
+  {:name "BasicCache",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/BasicCache",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:name "FIFOCache",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/FIFOCache",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:name "FnCache",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/FnCache",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:name "LIRSCache",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/LIRSCache",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:name "LRUCache",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/LRUCache",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:name "LUCache",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/LUCache",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:name "SoftCache",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/SoftCache",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:name "TTLCacheQ",
+   :var-type "type",
+   :namespace "clojure.core.cache",
+   :arglists nil,
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/TTLCacheQ",
+   :source-url nil,
+   :raw-source-url nil,
+   :file nil}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj",
+   :name "CacheProtocol",
+   :file "src/main/clojure/clojure/core/cache.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/5b8474a532a7f12ca1a1fbbf8f82a6f816c16b29/src/main/clojure/clojure/core/cache.clj#L20",
+   :line 20,
+   :var-type "protocol",
+   :arglists nil,
+   :doc "This is the protocol describing the basic cache capability.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/CacheProtocol"}
+  {:raw-source-url nil,
+   :name "evict",
+   :file nil,
+   :source-url nil,
+   :var-type "function",
+   :arglists ([cache e]),
+   :doc "Removes an entry from the cache",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/evict"}
+  {:raw-source-url nil,
+   :name "has?",
+   :file nil,
+   :source-url nil,
+   :var-type "function",
+   :arglists ([cache e]),
+   :doc "Checks if the cache contains a value associated with `e`",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/has?"}
+  {:raw-source-url nil,
+   :name "hit",
+   :file nil,
+   :source-url nil,
+   :var-type "function",
+   :arglists ([cache e]),
+   :doc
+   "Is meant to be called if the cache is determined to contain a value\nassociated with `e`",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/hit"}
+  {:raw-source-url nil,
+   :name "lookup",
+   :file nil,
+   :source-url nil,
+   :var-type "function",
+   :arglists ([cache e] [cache e not-found]),
+   :doc
+   "Retrieve the value associated with `e` if it exists, else `nil` in\nthe 2-arg case.  Retrieve the value associated with `e` if it exists,\nelse `not-found` in the 3-arg case.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/lookup"}
+  {:raw-source-url nil,
+   :name "miss",
+   :file nil,
+   :source-url nil,
+   :var-type "function",
+   :arglists ([cache e ret]),
+   :doc
+   "Is meant to be called if the cache is determined to **not** contain a\nvalue associated with `e`",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/miss"}
+  {:raw-source-url nil,
+   :name "seed",
+   :file nil,
+   :source-url nil,
+   :var-type "function",
+   :arglists ([cache base]),
+   :doc
+   "Is used to signal that the cache should be created with a seed.\nThe contract is that said cache should return an instance of its\nown type.",
+   :namespace "clojure.core.cache",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache/seed"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "basic-cache-factory",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L130",
+   :line 130,
+   :var-type "function",
+   :arglists ([base]),
+   :doc "Returns a pluggable basic cache initialied to `base`",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/basic-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "evict",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L95",
+   :line 95,
+   :var-type "function",
+   :arglists ([cache-atom e]),
+   :doc
+   "Removes an entry from the cache.\n\nReturns the updated cache from the atom.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/evict"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "fifo-cache-factory",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L135",
+   :line 135,
+   :var-type "function",
+   :arglists ([base & {threshold :threshold, :or {threshold 32}}]),
+   :doc
+   "Returns a FIFO cache with the cache and FIFO queue initialized to `base` --\nthe queue is filled as the values are pulled out of `base`.  If the associative\nstructure can guarantee ordering, then the said ordering will define the\neventual eviction order.  Otherwise, there are no guarantees for the eventual\neviction ordering.\n\nThis function takes an optional `:threshold` argument that defines the maximum number\nof elements in the cache before the FIFO semantics apply (default is 32).\n\nIf the number of elements in `base` is greater than the limit then some items\nin `base` will be dropped from the resulting cache.  If the associative\nstructure used as `base` can guarantee sorting, then the last `limit` elements\nwill be used as the cache seed values.  Otherwise, there are no guarantees about\nthe elements in the resulting cache.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/fifo-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "has?",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L72",
+   :line 72,
+   :var-type "function",
+   :arglists ([cache-atom e]),
+   :doc
+   "Checks if the cache contains a value associated with `e`.\n\nReads from the current version of the atom.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/has?"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "hit",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L79",
+   :line 79,
+   :var-type "function",
+   :arglists ([cache-atom e]),
+   :doc
+   "Is meant to be called if the cache is determined to contain a value\nassociated with `e`.\n\nReturns the updated cache from the atom. Provided for completeness.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/hit"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "lirs-cache-factory",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L179",
+   :line 179,
+   :var-type "function",
+   :arglists
+   ([base
+     &
+     {:keys [s-history-limit q-history-limit],
+      :or {s-history-limit 32, q-history-limit 32}}]),
+   :doc
+   "Returns an LIRS cache with the S & R LRU lists set to the indicated\nlimits.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/lirs-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "lookup",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L25",
+   :line 25,
+   :var-type "function",
+   :arglists ([cache-atom e] [cache-atom e not-found]),
+   :doc
+   "Retrieve the value associated with `e` if it exists, else `nil` in\nthe 2-arg case.  Retrieve the value associated with `e` if it exists,\nelse `not-found` in the 3-arg case.\n\nReads from the current version of the atom.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/lookup"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "lookup-or-miss",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L38",
+   :line 38,
+   :var-type "function",
+   :arglists ([cache-atom e value-fn] [cache-atom e wrap-fn value-fn]),
+   :doc
+   "Retrieve the value associated with `e` if it exists, else compute the\nvalue (using value-fn, and optionally wrap-fn), update the cache for `e`\nand then perform the lookup again.\n\nvalue-fn (and wrap-fn) will only be called (at most) once even in the\ncase of retries, so there is no risk of cache stampede.\n\nSince lookup can cause invalidation in some caches (such as TTL), we\ntrap that case and retry (a maximum of ten times).",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/lookup-or-miss"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "lru-cache-factory",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L153",
+   :line 153,
+   :var-type "function",
+   :arglists ([base & {threshold :threshold, :or {threshold 32}}]),
+   :doc
+   "Returns an LRU cache with the cache and usage-table initialied to `base` --\neach entry is initialized with the same usage value.\n\nThis function takes an optional `:threshold` argument that defines the maximum number\nof elements in the cache before the LRU semantics apply (default is 32).",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/lru-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "lu-cache-factory",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L171",
+   :line 171,
+   :var-type "function",
+   :arglists ([base & {threshold :threshold, :or {threshold 32}}]),
+   :doc
+   "Returns an LU cache with the cache and usage-table initialied to `base`.\n\nThis function takes an optional `:threshold` argument that defines the maximum number\nof elements in the cache before the LU semantics apply (default is 32).",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/lu-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "miss",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L87",
+   :line 87,
+   :var-type "function",
+   :arglists ([cache-atom e ret]),
+   :doc
+   "Is meant to be called if the cache is determined to **not** contain a\nvalue associated with `e`.\n\nReturns the updated cache from the atom. Provided for completeness.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/miss"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "seed",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L102",
+   :line 102,
+   :var-type "function",
+   :arglists ([cache-atom base]),
+   :doc
+   "Is used to signal that the cache should be created with a seed.\nThe contract is that said cache should return an instance of its\nown type.\n\nReturns the updated cache from the atom. Provided for completeness.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/seed"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "soft-cache-factory",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L189",
+   :line 189,
+   :var-type "function",
+   :arglists ([base]),
+   :doc
+   "Returns a SoftReference cache.  Cached values will be referred to with\nSoftReferences, allowing the values to be garbage collected when there is\nmemory pressure on the JVM.\n\nSoftCache is a mutable cache, since it is always based on a\nConcurrentHashMap.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/soft-cache-factory"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "through",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L111",
+   :line 111,
+   :var-type "function",
+   :arglists
+   ([cache-atom item]
+    [value-fn cache-atom item]
+    [wrap-fn value-fn cache-atom item]),
+   :doc
+   "The basic hit/miss logic for the cache system.  Expects a wrap function and\nvalue function.  The wrap function takes the value function and the item in question\nand is expected to run the value function with the item whenever a cache\nmiss occurs.  The intent is to hide any cache-specific cells from leaking\ninto the cache logic itelf.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/through"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "through-cache",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L122",
+   :line 122,
+   :var-type "function",
+   :arglists
+   ([cache-atom item]
+    [cache-atom item value-fn]
+    [cache-atom item wrap-fn value-fn]),
+   :doc
+   "The basic hit/miss logic for the cache system.  Like through but always has\nthe cache argument in the first position.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/through-cache"}
+  {:raw-source-url
+   "https://github.com/clojure/core.cache/raw/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj",
+   :name "ttl-cache-factory",
+   :file "src/main/clojure/clojure/core/cache/wrapped.clj",
+   :source-url
+   "https://github.com/clojure/core.cache/blob/68c317bad2706267a63d024fe3bb5aaf5c1b7b75/src/main/clojure/clojure/core/cache/wrapped.clj#L162",
+   :line 162,
+   :var-type "function",
+   :arglists ([base & {ttl :ttl, :or {ttl 2000}}]),
+   :doc
+   "Returns a TTL cache with the cache and expiration-table initialized to `base` --\neach with the same time-to-live.\n\nThis function also allows an optional `:ttl` argument that defines the default\ntime in milliseconds that entries are allowed to reside in the cache.",
+   :namespace "clojure.core.cache.wrapped",
+   :wiki-url
+   "https://clojure.github.io/core.cache//index.html#clojure.core.cache.wrapped/ttl-cache-factory"})}
diff --git a/index.html b/index.html
new file mode 100644
index 0000000..8235447
--- /dev/null
+++ b/index.html
@@ -0,0 +1,931 @@
+<html>
+  <head>
+    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+    <title>clojure.core.cache - core.cache 1.0.226-SNAPSHOT API documentation</title>
+    <link rel="icon" href="static/favicon.png" />
+    <link rel="shortcut icon" href="static/favicon.png" />
+    <link rel="stylesheet" href="static/clojure.css" type="text/css" media="all" />
+    <link rel="stylesheet" href="static/wiki.css" type="text/css" media="all" />
+    <link rel="stylesheet" href="static/internal.css" type="text/css" media="all" />
+    <style>.menuWrapper{height: 36px;}</style>
+  </head>
+<!--
+This document was auto-generated from the source by the clojure autodoc system.
+To report errors or ask questions about the overall documentation structure, formatting,
+etc., contact Tom Faulhaber (google mail name: tomfaulhaber).
+For errors in the documentation of a particular namespace, contact the author of that
+namespace.
+-->
+  <body>
+    <div id="AllContentContainer">
+      <div id="Header">
+	<a href="index.html" id="Logo"><img src="static/clojure-icon.gif" width="100" height="100" alt="Clojure" /></a>
+	<h1><a href="index.html" id="page-header" title="page header title">core.cache API Reference</a></h1>
+      </div>
+      <div id="leftcolumn"><div style="text-align: center;"></div>
+<div class="menu">
+  <div class="WikiCustomNav WikiElement wiki">
+    <span class="toc-header"><span id="project-name">core.cache</span> <span id="version">1.0.226-SNAPSHOT</span> API</span><br />
+    <ul>
+      <li><a href="index.html" class="wiki_link">Overview</a></li>
+      <li><a href="api-index.html" class="wiki_link">API Index</a></li>
+    </ul>
+    
+    
+    <a class="wiki_link" href="https://clojure.org">Clojure Home</a>
+  </div>
+</div>
+</div>
+      <div id="rightcolumn">
+	<div id="Content">
+	  <div class="contentBox"><div class="innerContentBox">
+              <div class="wiki wikiPage" id="content_view">
+                <div id="right-sidebar"><div id="toc">
+  <h1 class="nopad">Table of Contents</h1>
+  <div class="toc-section" style="margin-left: 1em;">
+    <a style="margin-top: 3px;" href="#toc0">Overview</a>
+    
+  </div><div class="toc-section" style="margin-left: 1em;">
+    <a style="margin-top: 3px;" href="#proto-section">Protocols</a>
+    <div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/CacheProtocol" class="toc-entry-anchor">CacheProtocol</a>
+      <div class="toc-subentry" style="margin-left: 1em;">
+        <a href="#clojure.core.cache/evict" class="toc-subentry-anchor">evict</a>
+      </div><div class="toc-subentry" style="margin-left: 1em;">
+        <a href="#clojure.core.cache/has?" class="toc-subentry-anchor">has?</a>
+      </div><div class="toc-subentry" style="margin-left: 1em;">
+        <a href="#clojure.core.cache/hit" class="toc-subentry-anchor">hit</a>
+      </div><div class="toc-subentry" style="margin-left: 1em;">
+        <a href="#clojure.core.cache/lookup" class="toc-subentry-anchor">lookup</a>
+      </div><div class="toc-subentry" style="margin-left: 1em;">
+        <a href="#clojure.core.cache/miss" class="toc-subentry-anchor">miss</a>
+      </div><div class="toc-subentry" style="margin-left: 1em;">
+        <a href="#clojure.core.cache/seed" class="toc-subentry-anchor">seed</a>
+      </div>
+    </div>
+  </div><div class="toc-section" style="margin-left: 1em;">
+    <a style="margin-top: 3px;" href="#type-section">Types</a>
+    <div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/BasicCache" class="toc-entry-anchor">BasicCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/FIFOCache" class="toc-entry-anchor">FIFOCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/FnCache" class="toc-entry-anchor">FnCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/LIRSCache" class="toc-entry-anchor">LIRSCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/LRUCache" class="toc-entry-anchor">LRUCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/LUCache" class="toc-entry-anchor">LUCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/SoftCache" class="toc-entry-anchor">SoftCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/TTLCacheQ" class="toc-entry-anchor">TTLCacheQ</a>
+      
+    </div>
+  </div><div class="toc-section" style="margin-left: 1em;">
+    <a style="margin-top: 3px;" href="#var-section">Vars and Functions</a>
+    <div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;BasicCache" class="toc-entry-anchor">-&gt;BasicCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;FIFOCache" class="toc-entry-anchor">-&gt;FIFOCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;FnCache" class="toc-entry-anchor">-&gt;FnCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;LIRSCache" class="toc-entry-anchor">-&gt;LIRSCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;LRUCache" class="toc-entry-anchor">-&gt;LRUCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;LUCache" class="toc-entry-anchor">-&gt;LUCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;SoftCache" class="toc-entry-anchor">-&gt;SoftCache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/-&gt;TTLCacheQ" class="toc-entry-anchor">-&gt;TTLCacheQ</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/basic-cache-factory" class="toc-entry-anchor">basic-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/fifo-cache-factory" class="toc-entry-anchor">fifo-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/lirs-cache-factory" class="toc-entry-anchor">lirs-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/lru-cache-factory" class="toc-entry-anchor">lru-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/lu-cache-factory" class="toc-entry-anchor">lu-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/soft-cache-factory" class="toc-entry-anchor">soft-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/through" class="toc-entry-anchor">through</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/through-cache" class="toc-entry-anchor">through-cache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache/ttl-cache-factory" class="toc-entry-anchor">ttl-cache-factory</a>
+      
+    </div>
+  </div><div class="toc-section" style="margin-left: 1em;">
+    <a style="margin-top: 3px;" href="#"></a>
+    
+  </div><div class="toc-section" style="margin-left: 1em;">
+    <a style="margin-top: 3px;" href="#clojure.core.cache.wrapped">clojure.core.cache.wrapped</a>
+    <div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/basic-cache-factory" class="toc-entry-anchor">basic-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/evict" class="toc-entry-anchor">evict</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/fifo-cache-factory" class="toc-entry-anchor">fifo-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/has?" class="toc-entry-anchor">has?</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/hit" class="toc-entry-anchor">hit</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/lirs-cache-factory" class="toc-entry-anchor">lirs-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/lookup" class="toc-entry-anchor">lookup</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/lookup-or-miss" class="toc-entry-anchor">lookup-or-miss</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/lru-cache-factory" class="toc-entry-anchor">lru-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/lu-cache-factory" class="toc-entry-anchor">lu-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/miss" class="toc-entry-anchor">miss</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/seed" class="toc-entry-anchor">seed</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/soft-cache-factory" class="toc-entry-anchor">soft-cache-factory</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/through" class="toc-entry-anchor">through</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/through-cache" class="toc-entry-anchor">through-cache</a>
+      
+    </div><div class="toc-entry" style="margin-left: 1em;">
+      <a href="#clojure.core.cache.wrapped/ttl-cache-factory" class="toc-entry-anchor">ttl-cache-factory</a>
+      
+    </div>
+  </div>
+</div>
+</div>
+                <div id="content-tag"><h1 id="overview">API for <span id="clojure.core.cache">clojure.core.cache</span>
+  - <span id="header-project">core.cache</span> <span id="header-version">1.0.226-SNAPSHOT</span><span id="header-status-block"> (<span id="header-status">in development</span>)</span>
+  </h1>
+<span id="author-line">by <span id="author-name">Fogus</span><br /></span>
+<br />Full namespace name: <span id="long-name">clojure.core.cache</span>
+<p></p>
+<h2>Overview</h2>
+<div id="home-page">Project home page is <a href="https://github.com/clojure/core.cache/">https://github.com/clojure/core.cache/</a></div>
+<pre id="namespace-docstr">A caching library for Clojure.</pre>
+
+
+<br />
+
+<div id="proto-section">
+  <p></p>
+  <h2>Protocols</h2>
+  <div id="proto-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/CacheProtocol">CacheProtocol</h2>
+    <span id="proto-type">Protocol</span><br />
+    <pre id="proto-docstr">This is the protocol describing the basic cache capability.</pre>
+    Known implementations: <span id="proto-impls"><a href="#clojure.core.cache/BasicCache">BasicCache</a>, <a href="#clojure.core.cache/FIFOCache">FIFOCache</a>, <a href="#clojure.core.cache/FnCache">FnCache</a>, <a href="#clojure.core.cache/LIRSCache">LIRSCache</a>, <a href="#clojure.core.cache/LRUCache">LRUCache</a>, <a href="#clojure.core.cache/LUCache">LUCache</a>, <a href="#clojure.core.cache/SoftCache">SoftCache</a>, <a href="#clojure.core.cache/TTLCacheQ">TTLCacheQ</a></span>
+    <div id="proto-var-entry">
+      <br />
+      <h3 id="clojure.core.cache/evict">evict</h3>
+      <span id="var-type">function</span><br />
+      <pre id="var-usage">Usage: (evict cache e)
+</pre>
+      <pre id="var-docstr">Removes an entry from the cache</pre>
+      <pre id="var-specs"></pre>
+      
+      
+      
+    </div><div id="proto-var-entry">
+      <br />
+      <h3 id="clojure.core.cache/has?">has?</h3>
+      <span id="var-type">function</span><br />
+      <pre id="var-usage">Usage: (has? cache e)
+</pre>
+      <pre id="var-docstr">Checks if the cache contains a value associated with `e`</pre>
+      <pre id="var-specs"></pre>
+      
+      
+      
+    </div><div id="proto-var-entry">
+      <br />
+      <h3 id="clojure.core.cache/hit">hit</h3>
+      <span id="var-type">function</span><br />
+      <pre id="var-usage">Usage: (hit cache e)
+</pre>
+      <pre id="var-docstr">Is meant to be called if the cache is determined to contain a value
+associated with `e`</pre>
+      <pre id="var-specs"></pre>
+      
+      
+      
+    </div><div id="proto-var-entry">
+      <br />
+      <h3 id="clojure.core.cache/lookup">lookup</h3>
+      <span id="var-type">function</span><br />
+      <pre id="var-usage">Usage: (lookup cache e)
+       (lookup cache e not-found)
+</pre>
+      <pre id="var-docstr">Retrieve the value associated with `e` if it exists, else `nil` in
+the 2-arg case.  Retrieve the value associated with `e` if it exists,
+else `not-found` in the 3-arg case.</pre>
+      <pre id="var-specs"></pre>
+      
+      
+      
+    </div><div id="proto-var-entry">
+      <br />
+      <h3 id="clojure.core.cache/miss">miss</h3>
+      <span id="var-type">function</span><br />
+      <pre id="var-usage">Usage: (miss cache e ret)
+</pre>
+      <pre id="var-docstr">Is meant to be called if the cache is determined to **not** contain a
+value associated with `e`</pre>
+      <pre id="var-specs"></pre>
+      
+      
+      
+    </div><div id="proto-var-entry">
+      <br />
+      <h3 id="clojure.core.cache/seed">seed</h3>
+      <span id="var-type">function</span><br />
+      <pre id="var-usage">Usage: (seed cache base)
+</pre>
+      <pre id="var-docstr">Is used to signal that the cache should be created with a seed.
+The contract is that said cache should return an instance of its
+own type.</pre>
+      <pre id="var-specs"></pre>
+      
+      
+      
+    </div>
+    
+    
+    <a id="proto-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L20">Source</a>
+  </div>
+</div>
+<div id="type-section">
+  <p></p>
+  <h2>Types</h2>
+  <div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/BasicCache">BasicCache</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div><div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/FIFOCache">FIFOCache</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache q limit]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div><div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/FnCache">FnCache</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache f]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div><div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/LIRSCache">LIRSCache</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache lruS lruQ tick limitS limitQ]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div><div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/LRUCache">LRUCache</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache lru tick limit]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div><div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/LUCache">LUCache</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache lu limit]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div><div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/SoftCache">SoftCache</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache rcache rq]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div><div id="type-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/TTLCacheQ">TTLCacheQ</h2>
+    <span id="type-type">type</span><br />
+    <pre id="type-docstr"></pre>
+    Fields: <span id="type-fields">[cache ttl q gen ttl-ms]</span><br />
+    Protocols: <span id="type-protocols"><a href="#clojure.core.cache/CacheProtocol">CacheProtocol</a></span><br />
+    Interfaces: <span id="type-interfaces">clojure.lang.Associative, clojure.lang.Counted, clojure.lang.ILookup, clojure.lang.IPersistentCollection, clojure.lang.IPersistentMap, clojure.lang.Seqable, java.lang.Iterable</span><br />
+  </div>
+</div>
+<div id="var-section">
+  <p></p>
+  <h2>Public Variables and Functions</h2>
+  <div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;BasicCache">-&gt;BasicCache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;BasicCache cache)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.BasicCache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L115">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;FIFOCache">-&gt;FIFOCache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;FIFOCache cache q limit)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.FIFOCache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L173">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;FnCache">-&gt;FnCache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;FnCache cache f)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.FnCache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L135">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;LIRSCache">-&gt;LIRSCache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;LIRSCache cache lruS lruQ tick limitS limitQ)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.LIRSCache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L434">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;LRUCache">-&gt;LRUCache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;LRUCache cache lru tick limit)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.LRUCache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L211">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;LUCache">-&gt;LUCache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;LUCache cache lu limit)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.LUCache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L313">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;SoftCache">-&gt;SoftCache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;SoftCache cache rcache rq)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.SoftCache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L519">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/-&gt;TTLCacheQ">-&gt;TTLCacheQ</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (-&gt;TTLCacheQ cache ttl q gen ttl-ms)
+</pre>
+    <pre id="var-docstr">Positional factory function for class clojure.core.cache.TTLCacheQ.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L269">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/basic-cache-factory">basic-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (basic-cache-factory base)
+</pre>
+    <pre id="var-docstr">Returns a pluggable basic cache initialized to `base`</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L578">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/fifo-cache-factory">fifo-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (fifo-cache-factory base &amp; {threshold :threshold, :or {threshold 32}})
+</pre>
+    <pre id="var-docstr">Returns a FIFO cache with the cache and FIFO queue initialized to `base` --
+the queue is filled as the values are pulled out of `base`.  If the associative
+structure can guarantee ordering, then the said ordering will define the
+eventual eviction order.  Otherwise, there are no guarantees for the eventual
+eviction ordering.
+
+This function takes an optional `:threshold` argument that defines the maximum number
+of elements in the cache before the FIFO semantics apply (default is 32).
+
+If the number of elements in `base` is greater than the limit then some items
+in `base` will be dropped from the resulting cache.  If the associative
+structure used as `base` can guarantee sorting, then the last `limit` elements
+will be used as the cache seed values.  Otherwise, there are no guarantees about
+the elements in the resulting cache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L584">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/lirs-cache-factory">lirs-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lirs-cache-factory base &amp; {:keys [s-history-limit q-history-limit], :or {s-history-limit 32, q-history-limit 32}})
+</pre>
+    <pre id="var-docstr">Returns an LIRS cache with the S &amp; R LRU lists set to the indicated
+limits.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L637">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/lru-cache-factory">lru-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lru-cache-factory base &amp; {threshold :threshold, :or {threshold 32}})
+</pre>
+    <pre id="var-docstr">Returns an LRU cache with the cache and usage-table initialized to `base` --
+each entry is initialized with the same usage value.
+
+This function takes an optional `:threshold` argument that defines the maximum number
+of elements in the cache before the LRU semantics apply (default is 32).</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L605">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/lu-cache-factory">lu-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lu-cache-factory base &amp; {threshold :threshold, :or {threshold 32}})
+</pre>
+    <pre id="var-docstr">Returns an LU cache with the cache and usage-table initialized to `base`.
+
+This function takes an optional `:threshold` argument that defines the maximum number
+of elements in the cache before the LU semantics apply (default is 32).</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L627">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/soft-cache-factory">soft-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (soft-cache-factory base)
+</pre>
+    <pre id="var-docstr">Returns a SoftReference cache.  Cached values will be referred to with
+SoftReferences, allowing the values to be garbage collected when there is
+memory pressure on the JVM.
+
+SoftCache is a mutable cache, since it is always based on a
+ConcurrentHashMap.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L648">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/through">through</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (through cache item)
+       (through value-fn cache item)
+       (through wrap-fn value-fn cache item)
+</pre>
+    <pre id="var-docstr">The basic hit/miss logic for the cache system.  Expects a wrap function and
+value function.  The wrap function takes the value function and the item in question
+and is expected to run the value function with the item whenever a cache
+miss occurs.  The intent is to hide any cache-specific cells from leaking
+into the cache logic itelf.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L44">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/through-cache">through-cache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (through-cache cache item)
+       (through-cache cache item value-fn)
+       (through-cache cache item wrap-fn value-fn)
+</pre>
+    <pre id="var-docstr">The basic hit/miss logic for the cache system.  Like through but always has
+the cache argument in the first position for easier use with swap! etc.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L57">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache/ttl-cache-factory">ttl-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (ttl-cache-factory base &amp; {ttl :ttl, :or {ttl 2000}})
+</pre>
+    <pre id="var-docstr">Returns a TTL cache with the cache and expiration-table initialized to `base` --
+each with the same time-to-live.
+
+This function also allows an optional `:ttl` argument that defines the default
+time in milliseconds that entries are allowed to reside in the cache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/430cf69a3e8a5ce00112e3534f0c06c70d5638d8/src/main/clojure/clojure/core/cache.clj#L616">Source</a>
+  </div>
+</div>
+
+<br />
+<h2 id="clojure.core.cache.wrapped">clojure.core.cache.wrapped</h2>
+<pre id="namespace-docstr">A higher level way to use clojure.core.cache that assumes the immutable
+cache is wrapped in an atom.
+
+The API is (almost) the same as clojure.core.cache -- including the factory
+functions -- but instead of accepting immutable caches, the functions
+here accept atoms containing those caches. The factory functions return
+new atoms containing the newly created cache.
+
+In addition, lookup-or-miss provides a safe, atomic way to retrieve a
+value from a cache or compute it if it is missing, without risking a
+cache stampede.</pre>
+
+
+<br />
+
+
+<div id="var-section">
+  <p></p>
+  <h2>Public Variables and Functions</h2>
+  <div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/basic-cache-factory">basic-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (basic-cache-factory base)
+</pre>
+    <pre id="var-docstr">Returns a pluggable basic cache initialized to `base`</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L130">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/evict">evict</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (evict cache-atom e)
+</pre>
+    <pre id="var-docstr">Removes an entry from the cache.
+
+Returns the updated cache from the atom.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L95">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/fifo-cache-factory">fifo-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (fifo-cache-factory base &amp; {threshold :threshold, :or {threshold 32}})
+</pre>
+    <pre id="var-docstr">Returns a FIFO cache with the cache and FIFO queue initialized to `base` --
+the queue is filled as the values are pulled out of `base`.  If the associative
+structure can guarantee ordering, then the said ordering will define the
+eventual eviction order.  Otherwise, there are no guarantees for the eventual
+eviction ordering.
+
+This function takes an optional `:threshold` argument that defines the maximum number
+of elements in the cache before the FIFO semantics apply (default is 32).
+
+If the number of elements in `base` is greater than the limit then some items
+in `base` will be dropped from the resulting cache.  If the associative
+structure used as `base` can guarantee sorting, then the last `limit` elements
+will be used as the cache seed values.  Otherwise, there are no guarantees about
+the elements in the resulting cache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L135">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/has?">has?</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (has? cache-atom e)
+</pre>
+    <pre id="var-docstr">Checks if the cache contains a value associated with `e`.
+
+Reads from the current version of the atom.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L72">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/hit">hit</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (hit cache-atom e)
+</pre>
+    <pre id="var-docstr">Is meant to be called if the cache is determined to contain a value
+associated with `e`.
+
+Returns the updated cache from the atom. Provided for completeness.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L79">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/lirs-cache-factory">lirs-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lirs-cache-factory base &amp; {:keys [s-history-limit q-history-limit], :or {s-history-limit 32, q-history-limit 32}})
+</pre>
+    <pre id="var-docstr">Returns an LIRS cache with the S &amp; R LRU lists set to the indicated
+limits.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L179">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/lookup">lookup</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lookup cache-atom e)
+       (lookup cache-atom e not-found)
+</pre>
+    <pre id="var-docstr">Retrieve the value associated with `e` if it exists, else `nil` in
+the 2-arg case.  Retrieve the value associated with `e` if it exists,
+else `not-found` in the 3-arg case.
+
+Reads from the current version of the atom.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L25">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/lookup-or-miss">lookup-or-miss</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lookup-or-miss cache-atom e value-fn)
+       (lookup-or-miss cache-atom e wrap-fn value-fn)
+</pre>
+    <pre id="var-docstr">Retrieve the value associated with `e` if it exists, else compute the
+value (using value-fn, and optionally wrap-fn), update the cache for `e`
+and then perform the lookup again.
+
+value-fn (and wrap-fn) will only be called (at most) once even in the
+case of retries, so there is no risk of cache stampede.
+
+Since lookup can cause invalidation in some caches (such as TTL), we
+trap that case and retry (a maximum of ten times).</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L38">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/lru-cache-factory">lru-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lru-cache-factory base &amp; {threshold :threshold, :or {threshold 32}})
+</pre>
+    <pre id="var-docstr">Returns an LRU cache with the cache and usage-table initialized to `base` --
+each entry is initialized with the same usage value.
+
+This function takes an optional `:threshold` argument that defines the maximum number
+of elements in the cache before the LRU semantics apply (default is 32).</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L153">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/lu-cache-factory">lu-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (lu-cache-factory base &amp; {threshold :threshold, :or {threshold 32}})
+</pre>
+    <pre id="var-docstr">Returns an LU cache with the cache and usage-table initialized to `base`.
+
+This function takes an optional `:threshold` argument that defines the maximum number
+of elements in the cache before the LU semantics apply (default is 32).</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L171">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/miss">miss</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (miss cache-atom e ret)
+</pre>
+    <pre id="var-docstr">Is meant to be called if the cache is determined to **not** contain a
+value associated with `e`.
+
+Returns the updated cache from the atom. Provided for completeness.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L87">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/seed">seed</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (seed cache-atom base)
+</pre>
+    <pre id="var-docstr">Is used to signal that the cache should be created with a seed.
+The contract is that said cache should return an instance of its
+own type.
+
+Returns the updated cache from the atom. Provided for completeness.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L102">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/soft-cache-factory">soft-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (soft-cache-factory base)
+</pre>
+    <pre id="var-docstr">Returns a SoftReference cache.  Cached values will be referred to with
+SoftReferences, allowing the values to be garbage collected when there is
+memory pressure on the JVM.
+
+SoftCache is a mutable cache, since it is always based on a
+ConcurrentHashMap.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L189">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/through">through</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (through cache-atom item)
+       (through value-fn cache-atom item)
+       (through wrap-fn value-fn cache-atom item)
+</pre>
+    <pre id="var-docstr">The basic hit/miss logic for the cache system.  Expects a wrap function and
+value function.  The wrap function takes the value function and the item in question
+and is expected to run the value function with the item whenever a cache
+miss occurs.  The intent is to hide any cache-specific cells from leaking
+into the cache logic itelf.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L111">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/through-cache">through-cache</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (through-cache cache-atom item)
+       (through-cache cache-atom item value-fn)
+       (through-cache cache-atom item wrap-fn value-fn)
+</pre>
+    <pre id="var-docstr">The basic hit/miss logic for the cache system.  Like through but always has
+the cache argument in the first position.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L122">Source</a>
+  </div><div id="var-entry">
+    <br />
+    <hr />
+    <h2 id="clojure.core.cache.wrapped/ttl-cache-factory">ttl-cache-factory</h2>
+    <span id="var-type">function</span><br />
+    <pre id="var-usage">Usage: (ttl-cache-factory base &amp; {ttl :ttl, :or {ttl 2000}})
+</pre>
+    <pre id="var-docstr">Returns a TTL cache with the cache and expiration-table initialized to `base` --
+each with the same time-to-live.
+
+This function also allows an optional `:ttl` argument that defines the default
+time in milliseconds that entries are allowed to reside in the cache.</pre>
+    <pre id="var-specs"></pre>
+    
+    
+    <a id="var-source" href="https://github.com/clojure/core.cache/blob/9038e65b5d0d2c256c68740007e29ef115ac3ec6/src/main/clojure/clojure/core/cache/wrapped.clj#L162">Source</a>
+  </div>
+</div>
+
+
+</div>
+              </div>
+            </div>
+          </div>
+	</div>
+	<div id="foot">
+	  <div id="copyright" style="text-align: center;">Copyright 2007-2023 by Rich Hickey and the various contributors</div>
+	</div>
+      </div>
+      <div id="DesignedBy">Logo &amp; site design by <a href="http://www.tomhickey.com" title="Visit Tom Hickey's website.">Tom Hickey</a>.<br />
+      Clojure auto-documentation system by Tom Faulhaber.</div>
+    </div>
+    <!-- /AllContentContainer -->
+  </body>
+
+</html>
\ No newline at end of file
diff --git a/pom.xml b/pom.xml
deleted file mode 100644
index 97042e4..0000000
--- a/pom.xml
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
-  <modelVersion>4.0.0</modelVersion>
-  <artifactId>core.cache</artifactId>
-  <version>1.2.999-SNAPSHOT</version>
-  <name>core.cache</name>
-  <description>Cache library for Clojure.</description>
-
-  <scm>
-    <connection>scm:git:git://github.com/clojure/core.cache.git</connection>
-    <developerConnection>scm:git:ssh://git@github.com/clojure/core.cache.git</developerConnection>
-    <tag>HEAD</tag>
-    <url>https://github.com/clojure/core.cache</url>
-  </scm>
-
-  <licenses>
-    <license>
-      <name>Eclipse Public License 1.0</name>
-      <url>https://opensource.org/license/epl-1-0/</url>
-      <distribution>repo</distribution>
-    </license>
-  </licenses>
-
-  <parent>
-    <groupId>org.clojure</groupId>
-    <artifactId>pom.contrib</artifactId>
-    <version>1.4.0</version>
-  </parent>
-
-  <developers>
-    <developer>
-      <id>fogus</id>
-      <name>Michael Fogus</name>
-      <url>https://www.fogus.me</url>
-    </developer>
-  </developers>
-
-  <properties>
-    <clojure.version>1.11.4</clojure.version>
-  </properties>
-
-  <dependencies>
-    <dependency>
-      <groupId>org.clojure</groupId>
-      <artifactId>data.priority-map</artifactId>
-      <version>1.2.1</version>
-    </dependency>
-  </dependencies>
-</project>
diff --git a/run-tests.sh b/run-tests.sh
deleted file mode 100755
index 8d255fb..0000000
--- a/run-tests.sh
+++ /dev/null
@@ -1,8 +0,0 @@
-#!/bin/sh
-
-versions="1.9 1.10 1.11 1.12"
-for v in $versions
-do
-  time clojure -M:test:$v
-  if test $? != 0; then exit 1; fi
-done
diff --git a/src/main/clojure/clojure/core/cache.clj b/src/main/clojure/clojure/core/cache.clj
deleted file mode 100644
index 7800345..0000000
--- a/src/main/clojure/clojure/core/cache.clj
+++ /dev/null
@@ -1,658 +0,0 @@
-;   Copyright (c) Rich Hickey. All rights reserved.
-;   The use and distribution terms for this software are covered by the
-;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
-;   which can be found in the file epl-v10.html at the root of this distribution.
-;   By using this software in any fashion, you are agreeing to be bound by
-;   the terms of this license.
-;   You must not remove this notice, or any other, from this software.
-
-(ns ^{:doc "A caching library for Clojure."
-      :author "Fogus"}
-  clojure.core.cache
-  (:require clojure.data.priority-map)
-  (:import (java.lang.ref ReferenceQueue SoftReference)
-           (java.util.concurrent ConcurrentHashMap)))
-
-(set! *warn-on-reflection* true)
-
-;; # Protocols and Types
-
-(defprotocol CacheProtocol
-  "This is the protocol describing the basic cache capability."
-  (lookup [cache e]
-          [cache e not-found]
-   "Retrieve the value associated with `e` if it exists, else `nil` in
-   the 2-arg case.  Retrieve the value associated with `e` if it exists,
-   else `not-found` in the 3-arg case.")
-  (has?    [cache e]
-   "Checks if the cache contains a value associated with `e`")
-  (hit     [cache e]
-   "Is meant to be called if the cache is determined to contain a value
-   associated with `e`")
-  (miss    [cache e ret]
-   "Is meant to be called if the cache is determined to **not** contain a
-   value associated with `e`")
-  (evict  [cache e]
-   "Removes an entry from the cache")
-  (seed    [cache base]
-   "Is used to signal that the cache should be created with a seed.
-   The contract is that said cache should return an instance of its
-   own type."))
-
-(def ^{:private true} default-wrapper-fn #(%1 %2))
-
-(defn through
-  "The basic hit/miss logic for the cache system.  Expects a wrap function and
-  value function.  The wrap function takes the value function and the item in question
-  and is expected to run the value function with the item whenever a cache
-  miss occurs.  The intent is to hide any cache-specific cells from leaking
-  into the cache logic itelf."
-  ([cache item] (through default-wrapper-fn identity cache item))
-  ([value-fn cache item] (through default-wrapper-fn value-fn cache item))
-  ([wrap-fn value-fn cache item]
-   (if (clojure.core.cache/has? cache item)
-     (clojure.core.cache/hit cache item)
-     (clojure.core.cache/miss cache item (wrap-fn #(value-fn %) item)))))
-
-(defn through-cache
-  "The basic hit/miss logic for the cache system.  Like through but always has
-  the cache argument in the first position for easier use with swap! etc."
-  ([cache item] (through-cache cache item default-wrapper-fn identity))
-  ([cache item value-fn] (through-cache cache item default-wrapper-fn value-fn))
-  ([cache item wrap-fn value-fn]
-   (if (clojure.core.cache/has? cache item)
-     (clojure.core.cache/hit cache item)
-     (clojure.core.cache/miss cache item (wrap-fn #(value-fn %) item)))))
-
-(defmacro defcache
-  [type-name fields & specifics]
-  (let [[base & _] fields
-        base-field (with-meta base {:tag 'clojure.lang.IPersistentMap})]
-    `(deftype ~type-name [~@fields]
-       ~@specifics
-
-       clojure.lang.ILookup
-       (valAt [this# key#]
-              (lookup this# key#))
-       (valAt [this# key# not-found#]
-              (if (has? this# key#)
-                (lookup this# key#)
-                not-found#))
-
-       java.lang.Iterable
-       (iterator [_#]
-         (.iterator ~base-field))
-
-       clojure.lang.IPersistentMap
-       (assoc [this# k# v#]
-         (miss this# k# v#))
-       (without [this# k#]
-         (evict this# k#))
-
-       clojure.lang.Associative
-       (containsKey [this# k#]
-         (has? this# k#))
-       (entryAt [this# k#]
-         (when (has? this# k#)
-           (clojure.lang.MapEntry. k# (lookup this# k#))))
-
-       clojure.lang.Counted
-       (count [this#]
-         (count ~base-field))
-
-       clojure.lang.IPersistentCollection
-       (cons [this# elem#]
-         (seed this# (conj ~base-field elem#)))
-       (empty [this#]
-         (seed this# (empty ~base-field)))
-       (equiv [this# other#]
-         (= other# ~base-field))
-
-       clojure.lang.Seqable
-       (seq [_#]
-         (seq ~base-field)))))
-
-(defcache BasicCache [cache]
-  CacheProtocol
-  (lookup [_ item]
-    (get cache item))
-  (lookup [_ item not-found]
-    (get cache item not-found))
-  (has? [_ item]
-    (contains? cache item))
-  (hit [this item] this)
-  (miss [_ item result]
-    (BasicCache. (assoc cache item result)))
-  (evict [_ key]
-    (BasicCache. (dissoc cache key)))
-  (seed [_ base]
-    (BasicCache. base))
-  Object
-  (toString [_] (str cache)))
-
-;; FnCache
-
-(defcache FnCache [cache f]
-  CacheProtocol
-  (lookup [_ item]
-    (f (get cache item)))
-  (lookup [_ item not-found]
-    (let [ret (get cache item not-found)]
-      (if (= not-found ret)
-        not-found
-        (f ret))))
-  (has? [_ item]
-    (contains? cache item))
-  (hit [this item] this)
-  (miss [_ item result]
-    (BasicCache. (assoc cache item result)))
-  (evict [_ key]
-    (BasicCache. (dissoc cache key)))
-  (seed [_ base]
-    (BasicCache. base))
-  Object
-  (toString [_] (str cache)))
-
-;; # FIFO
-
-(defn- describe-layout [mappy limit]
-  (let [ks (keys mappy)
-        [dropping keeping] (split-at (- (count ks) limit) ks)]
-    {:dropping dropping
-     :keeping  keeping
-     :queue
-     (-> clojure.lang.PersistentQueue/EMPTY
-         (into (repeat (- limit (count keeping)) ::free))
-         (into (take limit keeping)))}))
-
-(defn- prune-queue [q k]
-  (reduce (fn [q e] (if (#{k} e) q (conj q e)))
-          (conj clojure.lang.PersistentQueue/EMPTY ::free)
-          q))
-
-(defcache FIFOCache [cache q limit]
-  CacheProtocol
-  (lookup [_ item]
-    (get cache item))
-  (lookup [_ item not-found]
-    (get cache item not-found))
-  (has? [_ item]
-    (contains? cache item))
-  (hit [this item]
-    this)
-  (miss [_ item result]
-    (let [[kache qq] (let [k (peek q)]
-                       (if (>= (count cache) limit)
-                         [(dissoc cache k) (pop q)]
-                         [cache (pop q)]))]
-      (FIFOCache. (assoc kache item result)
-                  (conj qq item)
-                  limit)))
-  (evict [this key]
-    (if (contains? cache key)
-      (FIFOCache. (dissoc cache key)
-                  (prune-queue q key)
-                  limit)
-      this))
-  (seed [_ base]
-    (let [{dropping :dropping
-           q :queue} (describe-layout base limit)]
-      (FIFOCache. (apply dissoc base dropping)
-                  q
-                  limit)))
-  Object
-  (toString [_]
-    (str cache \, \space (pr-str q))))
-
-(defn- build-leastness-queue
-  [base start-at]
-  (into (clojure.data.priority-map/priority-map) (for [[k _] base] [k start-at])))
-
-(defcache LRUCache [cache lru tick limit]
-  CacheProtocol
-  (lookup [_ item]
-    (get cache item))
-  (lookup [_ item not-found]
-    (get cache item not-found))
-  (has? [_ item]
-    (contains? cache item))
-  (hit [_ item]
-    (let [tick+ (inc tick)]
-      (LRUCache. cache
-                 (if (contains? cache item)
-                   (assoc lru item tick+)
-                   lru)
-                 tick+
-                 limit)))
-  (miss [_ item result]
-    (let [tick+ (inc tick)]
-      (if (>= (count lru) limit)
-        (let [k (if (contains? lru item)
-                  item
-                  (first (peek lru))) ;; minimum-key, maybe evict case
-              c (-> cache (dissoc k) (assoc item result))
-              l (-> lru (dissoc k) (assoc item tick+))]
-          (LRUCache. c l tick+ limit))
-        (LRUCache. (assoc cache item result)  ;; no change case
-                   (assoc lru item tick+)
-                   tick+
-                   limit))))
-  (evict [this key]
-    (if (contains? cache key)
-      (LRUCache. (dissoc cache key)
-                 (dissoc lru key)
-                 (inc tick)
-                 limit)
-      this))
-  (seed [_ base]
-    (LRUCache. base
-               (build-leastness-queue base 0)
-               0
-               limit))
-  Object
-  (toString [_]
-    (str cache \, \space lru \, \space tick \, \space limit)))
-
-
-(defn- key-killer-q
-  [ttl q expiry now]
-  (let [[ks q'] (reduce (fn [[ks q] [k g t]]
-                          (if (> (- now t) expiry)
-                            (if (= g (first (get ttl k)))
-                              [(conj ks k) (pop q)]
-                              [ks (pop q)])
-                            (reduced [ks q])))
-                        [[] q]
-                        q)]
-    [#(apply dissoc % ks) q']))
-
-(defcache TTLCacheQ [cache ttl q gen ttl-ms]
-  CacheProtocol
-  (lookup [this item]
-    (let [ret (lookup this item ::nope)]
-      (when-not (= ::nope ret) ret)))
-  (lookup [this item not-found]
-    (if (has? this item)
-      (get cache item)
-      not-found))
-  (has? [_ item]
-    (and (let [[_ t] (get ttl item [0 (- ttl-ms)])]
-           (< (- (System/currentTimeMillis)
-                 t)
-              ttl-ms))
-         (contains? cache item)))
-  (hit [this item] this)
-  (miss [this item result]
-    (let [now  (System/currentTimeMillis)
-          [kill-old q'] (key-killer-q ttl q ttl-ms now)]
-      (TTLCacheQ. (assoc (kill-old cache) item result)
-                  (assoc (kill-old ttl) item [gen now])
-                  (conj q' [item gen now])
-                  (unchecked-inc gen)
-                  ttl-ms)))
-  (seed [_ base]
-    (let [now (System/currentTimeMillis)]
-      (TTLCacheQ. base
-                  ;; we seed the cache all at gen, but subsequent entries
-                  ;; will get gen+1, gen+2 etc
-                  (into {} (for [x base] [(key x) [gen now]]))
-                  (into q  (for [x base] [(key x) gen now]))
-                  (unchecked-inc gen)
-                  ttl-ms)))
-  (evict [_ key]
-    (TTLCacheQ. (dissoc cache key)
-                (dissoc ttl key)
-                q
-                gen
-                ttl-ms))
-  Object
-  (toString [_]
-    (str cache \, \space ttl \, \space ttl-ms)))
-
-
-(defcache LUCache [cache lu limit]
-  CacheProtocol
-  (lookup [_ item]
-    (get cache item))
-  (lookup [_ item not-found]
-    (get cache item not-found))
-  (has? [_ item]
-    (contains? cache item))
-  (hit [_ item]
-    (LUCache. cache (update-in lu [item] inc) limit))
-  (miss [_ item result]
-    (if (>= (count lu) limit) ;; need to evict?
-      (let [min-key (if (contains? lu item)
-                      ::nope
-                      (first (peek lu))) ;; maybe evict case
-            c (-> cache (dissoc min-key) (assoc item result))
-            l (-> lu (dissoc min-key) (update-in [item] (fnil inc 0)))]
-        (LUCache. c l limit))
-      (LUCache. (assoc cache item result)  ;; no change case
-                (update-in lu [item] (fnil inc 0))
-                limit)))
-  (evict [this key]
-    (if (contains? this key)
-      (LUCache. (dissoc cache key)
-                (dissoc lu key)
-                limit)
-      this))
-  (seed [_ base]
-    (LUCache. base
-              (build-leastness-queue base 0)
-              limit))
-  Object
-  (toString [_]
-    (str cache \, \space lu \, \space limit)))
-
-
-;; # LIRS
-;; *initial Clojure implementation by Jan Oberhagemann*
-
-;;  A
-;;  [LIRS](http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.2184)
-;;  cache consists of two LRU lists, `S` and `Q`, and keeps more history
-;;  than a LRU cache. Every cached item is either a LIR, HIR or
-;;  non-resident HIR block. `Q` contains only HIR blocks, `S` contains
-;;  LIR, HIR, non-resident HIR blocks. The total cache size is
-;;  |`S`|+|`Q`|, |`S`| is typically 99% of the cache size.
-
-;;  * LIR block:
-;;    Low Inter-Reference block, a cached item with a short interval
-;;    between accesses. A block `x`, `x` ∈ `S` ∧ `x` ∉ `Q` ∧ `x` ∈
-;;    `cache`, is a LIR block.
-
-;;  * HIR block:
-;;    High Inter-Reference block, a cached item with rare accesses and
-;;    long interval. A block `x`, `x` ∈ `Q` ∧ `x` ∈ `cache`, is a HIR block.
-
-;;  * non-resident HIR block:
-;;    only the key of the HIR block is cached, without the corresponding
-;;    value a test (has?) for the corresponding key is always a
-;;    miss. Used for additional history information. A block `x`, `x` ∈
-;;    `S` ∧ `x` ∉ `Q` ∧ `x` ∉ `cache`, is a non-resident HIR block.
-
-;; ## Outline of the implemented algorithm
-
-;; `cache` is used to store the key value pairs.
-;; `S` and `Q` maintain the relative order of accesses of the keys, like
-;; a LRU list.
-
-;; Definition of `prune stack`:
-;;
-;;         repeatedly remove oldest item from S until an item k, k ∉ Q ∧
-;;         k ∈ cache (a LIR block), is found
-
-
-;; In case of a miss for key `k` and value `v` (`k` ∉ cache) and
-;;
-;;  * (1.1) `S` is not filled, |`S`| < `limitS`
-;;         add k to S
-;;         add k to the cache
-
-;;  * (1.2) `k` ∉ `S`, never seen or not seen for a long, long time
-;;             remove oldest item x from Q
-;;             remove x from cache
-;;             add k to S
-;;             add k to Q
-;;             add k to the cache
-
-;;  * (1.3) `k` ∈ `S`, this is a non-resident HIR block
-;;         remove oldest item x from Q
-;;         remove x from cache
-;;         add k to S
-;;         remove oldest item y from S
-;;         add y to Q
-;;         prune stack
-
-
-;; In case of a hit for key `k` (`k` ∈ cache) and
-
-;;  * (2.1) `k` ∈ `S` ∧ `k` ∉ `Q`, a LIR block
-;;         add k to S / refresh
-;;         prune stack if k was the oldest item in S
-
-;;  * (2.2) `k` ∈ `S` ∧ `k` ∈ `Q`, a HIR block
-;;         add k to S / refresh
-;;         remove k from Q
-;;         remove oldest item x from S
-;;         add x to Q
-;;         prune stack
-
-;;  * (2.3) `k` ∉ `S` ∧ `k` ∈ `Q`, a HIR block, only older than the oldest item in S
-;;         add k to S
-;;         add k to Q / refresh
-
-(defn- prune-stack [lruS lruQ cache]
-  (loop [s lruS q lruQ c cache]
-    (let [k (apply min-key s (keys s))]
-      (if (or (contains? q k)               ; HIR item
-              (not (contains? c k)))        ; non-resident HIR item
-        (recur (dissoc s k) q c)
-        s))))
-
-(defcache LIRSCache [cache lruS lruQ tick limitS limitQ]
-  CacheProtocol
-  (lookup [_ item]
-    (get cache item))
-  (lookup [_ item not-found]
-    (get cache item not-found))
-  (has? [_ item]
-    (contains? cache item))
-  (hit [_ item]
-    (let [tick+ (inc tick)]
-      (if (not (contains? lruS item))
-                                        ; (2.3) item ∉ S ∧ item ∈ Q
-        (LIRSCache. cache (assoc lruS item tick+) (assoc lruQ item tick+) tick+ limitS limitQ)
-        (let [k (apply min-key lruS (keys lruS))]
-          (if (contains? lruQ item)
-                                        ; (2.2) item ∈ S ∧ item ∈ Q
-            (let [new-lruQ (-> lruQ (dissoc item) (assoc k tick+))]
-              (LIRSCache. cache
-                          (-> lruS (dissoc k) (assoc item tick+) (prune-stack new-lruQ cache))
-                          new-lruQ
-                          tick+
-                          limitS
-                          limitQ))
-                                        ; (2.1) item ∈ S ∧ item ∉ Q
-            (LIRSCache. cache
-                        (-> lruS (assoc item tick+) (prune-stack lruQ cache))
-                        lruQ
-                        tick+
-                        limitS
-                        limitQ))))))
-
-  (miss [_ item result]
-    (let [tick+ (inc tick)]
-      (if (< (count cache) limitS)
-                                        ; (1.1)
-        (let [k (apply min-key lruS (keys lruS))]
-          (LIRSCache. (assoc cache item result)
-                      (-> lruS (dissoc k) (assoc item tick+))
-                      lruQ
-                      tick+
-                      limitS
-                      limitQ))
-        (let [k (apply min-key lruQ (keys lruQ))
-              new-lruQ (dissoc lruQ k)
-              new-cache (-> cache  (dissoc k) (assoc item result))]
-          (if (contains? lruS item)
-                                        ; (1.3)
-            (let [lastS (apply min-key lruS (keys lruS))]
-              (LIRSCache. new-cache
-                          (-> lruS (dissoc lastS) (assoc item tick+) (prune-stack new-lruQ new-cache))
-                          (assoc new-lruQ lastS tick+)
-                          tick+
-                          limitS
-                          limitQ))
-                                        ; (1.2)
-            (LIRSCache. new-cache
-                        (assoc lruS item tick+)
-                        (assoc new-lruQ item tick+)
-                        tick+
-                        limitS
-                        limitQ))))))
-  (seed [_ base]
-    (LIRSCache. base
-                (into {} (for [x (range (- limitS) 0)] [x x]))
-                (into {} (for [x (range (- limitQ) 0)] [x x]))
-                0
-                limitS
-                limitQ))
-  Object
-  (toString [_]
-    (str cache \, \space lruS \, \space lruQ \, \space tick \, \space limitS \, \space limitQ)))
-
-(defn clear-soft-cache! [^java.util.Map cache ^java.util.Map rcache ^ReferenceQueue rq]
-  (loop [r (.poll rq)]
-    (when r
-      (when-let [item (get rcache r)]
-        (.remove cache item))
-      (.remove rcache r)
-      (recur (.poll rq)))))
-
-(defn make-reference [v rq]
-  (if (nil? v)
-    (SoftReference. ::nil rq)
-    (SoftReference. v rq)))
-
-(defcache SoftCache [^java.util.Map cache ^java.util.Map rcache rq]
-  CacheProtocol
-  (lookup [_ item]
-    (when-let [^SoftReference r (get cache (or item ::nil))]
-      (let [v (.get r)]
-        (if (= ::nil v)
-          nil
-          v))))
-  (lookup [_ item not-found]
-    (if-let [^SoftReference r (get cache (or item ::nil))]
-      (if-let [v (.get r)]
-        (if (= ::nil v)
-          nil
-          v)
-        not-found)
-      not-found))
-  (has? [_ item]
-    (let [item (or item ::nil)
-          ^SoftReference cell (get cache item)]
-      (boolean
-        (when cell
-          (not (nil? (.get cell)))))))
-  (hit [this item]
-    (clear-soft-cache! cache rcache rq)
-    this)
-  (miss [this item result]
-    (let [item (or item ::nil)
-          r (make-reference result rq)]
-      (.put cache item r)
-      (.put rcache r item)
-      (clear-soft-cache! cache rcache rq)
-      this))
-  (evict [this key]
-    (let [key (or key ::nil)
-          r (get cache key)]
-      (when r
-        (.remove cache key)
-        (.remove rcache r))
-      (clear-soft-cache! cache rcache rq)
-      this))
-  (seed [_ base]
-    (let [soft-cache? (instance? SoftCache base)
-          cache (ConcurrentHashMap.)
-          rcache (ConcurrentHashMap.)
-          rq (ReferenceQueue.)]
-      (if (seq base)
-        (doseq [[k ^SoftReference v] base]
-          (let [k (or k ::nil)
-                r (if soft-cache?
-                    (make-reference (.get v) rq)
-                    (make-reference v rq))]
-            (.put cache k r)
-            (.put rcache r k))))
-      (SoftCache. cache rcache rq)))
-  Object
-  (toString [_] (str cache)))
-
-;; Factories
-
-(defn basic-cache-factory
-  "Returns a pluggable basic cache initialized to `base`"
-  [base]
-  {:pre [(map? base)]}
-  (BasicCache. base))
-
-(defn fifo-cache-factory
-  "Returns a FIFO cache with the cache and FIFO queue initialized to `base` --
-   the queue is filled as the values are pulled out of `base`.  If the associative
-   structure can guarantee ordering, then the said ordering will define the
-   eventual eviction order.  Otherwise, there are no guarantees for the eventual
-   eviction ordering.
-
-   This function takes an optional `:threshold` argument that defines the maximum number
-   of elements in the cache before the FIFO semantics apply (default is 32).
-
-   If the number of elements in `base` is greater than the limit then some items
-   in `base` will be dropped from the resulting cache.  If the associative
-   structure used as `base` can guarantee sorting, then the last `limit` elements
-   will be used as the cache seed values.  Otherwise, there are no guarantees about
-   the elements in the resulting cache."
-  [base & {threshold :threshold :or {threshold 32}}]
-  {:pre [(number? threshold) (< 0 threshold)
-         (map? base)]
-   :post [(== threshold (count (.q ^FIFOCache %)))]}
-  (clojure.core.cache/seed (FIFOCache. {} clojure.lang.PersistentQueue/EMPTY threshold) base))
-
-(defn lru-cache-factory
-  "Returns an LRU cache with the cache and usage-table initialized to `base` --
-   each entry is initialized with the same usage value.
-
-   This function takes an optional `:threshold` argument that defines the maximum number
-   of elements in the cache before the LRU semantics apply (default is 32)."
-  [base & {threshold :threshold :or {threshold 32}}]
-  {:pre [(number? threshold) (< 0 threshold)
-         (map? base)]}
-  (clojure.core.cache/seed (LRUCache. {} (clojure.data.priority-map/priority-map) 0 threshold) base))
-
-(defn ttl-cache-factory
-  "Returns a TTL cache with the cache and expiration-table initialized to `base` --
-   each with the same time-to-live.
-
-   This function also allows an optional `:ttl` argument that defines the default
-   time in milliseconds that entries are allowed to reside in the cache."
-  [base & {ttl :ttl :or {ttl 2000}}]
-  {:pre [(number? ttl) (<= 0 ttl)
-         (map? base)]}
-  (clojure.core.cache/seed (TTLCacheQ. {} {} clojure.lang.PersistentQueue/EMPTY 0 ttl) base))
-
-(defn lu-cache-factory
-  "Returns an LU cache with the cache and usage-table initialized to `base`.
-
-   This function takes an optional `:threshold` argument that defines the maximum number
-   of elements in the cache before the LU semantics apply (default is 32)."
-  [base & {threshold :threshold :or {threshold 32}}]
-  {:pre [(number? threshold) (< 0 threshold)
-         (map? base)]}
-  (clojure.core.cache/seed (LUCache. {} (clojure.data.priority-map/priority-map) threshold) base))
-
-(defn lirs-cache-factory
-  "Returns an LIRS cache with the S & R LRU lists set to the indicated
-   limits."
-  [base & {:keys [s-history-limit q-history-limit]
-           :or {s-history-limit 32
-                q-history-limit 32}}]
-  {:pre [(number? s-history-limit) (< 0 s-history-limit)
-         (number? q-history-limit) (< 0 q-history-limit)
-         (map? base)]}
-  (clojure.core.cache/seed (LIRSCache. {} {} {} 0 s-history-limit q-history-limit) base))
-
-(defn soft-cache-factory
-  "Returns a SoftReference cache.  Cached values will be referred to with
-  SoftReferences, allowing the values to be garbage collected when there is
-  memory pressure on the JVM.
-
-  SoftCache is a mutable cache, since it is always based on a
-  ConcurrentHashMap."
-  [base]
-  {:pre [(map? base)]}
-  (clojure.core.cache/seed (SoftCache. (ConcurrentHashMap.) (ConcurrentHashMap.) (ReferenceQueue.))
-        base))
diff --git a/src/main/clojure/clojure/core/cache/wrapped.clj b/src/main/clojure/clojure/core/cache/wrapped.clj
deleted file mode 100644
index 95e3a3f..0000000
--- a/src/main/clojure/clojure/core/cache/wrapped.clj
+++ /dev/null
@@ -1,246 +0,0 @@
-;   Copyright (c) Rich Hickey. All rights reserved.
-;   The use and distribution terms for this software are covered by the
-;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
-;   which can be found in the file epl-v10.html at the root of this distribution.
-;   By using this software in any fashion, you are agreeing to be bound by
-;   the terms of this license.
-;   You must not remove this notice, or any other, from this software.
-
-(ns clojure.core.cache.wrapped
-  "A higher level way to use clojure.core.cache that assumes the immutable
-  cache is wrapped in an atom.
-
-  The API is (almost) the same as clojure.core.cache -- including the factory
-  functions -- but instead of accepting immutable caches, the functions
-  here accept atoms containing those caches. The factory functions return
-  new atoms containing the newly created cache.
-
-  In addition, lookup-or-miss provides a safe, atomic way to retrieve a
-  value from a cache or compute it if it is missing, without risking a
-  cache stampede."
-  (:require [clojure.core.cache :as c]))
-
-(set! *warn-on-reflection* true)
-
-(def ^{:private true} default-wrapper-fn #(%1 %2))
-
-;; Similar to clojure.lang.Delay, but will not memoize an exception and will
-;; instead retry.
-;;   fun - the function, never nil
-;;   available? - indicates a memoized value is available, volatile for visibility
-;;   value - the value (if available) - volatile for visibility
-(deftype RetryingDelay [fun ^:volatile-mutable available? ^:volatile-mutable value]
-  clojure.lang.IDeref
-  (deref [this]
-    ;; first check (safe with volatile flag)
-    (if available?
-      value
-      (locking fun
-        ;; second check (race condition with locking)
-        (if available?
-          value
-          ;; fun may throw - will retry on next deref
-          (let [v (fun)]
-            ;; this ordering is important - MUST set value before setting available?
-            ;; or you have a race with the first check above
-            (set! value v)
-            (set! available? true)
-            v)))))
-  clojure.lang.IPending
-  (isRealized [this]
-    available?))
-
-(defn- d-lay [fun]
-  (->RetryingDelay fun false nil))
-
-(defn- r-force [maybe-d-lay]
-  (if (instance? RetryingDelay maybe-d-lay)
-    (deref maybe-d-lay)
-    maybe-d-lay))
-
-(defn lookup
-  "Retrieve the value associated with `e` if it exists, else `nil` in
-  the 2-arg case.  Retrieve the value associated with `e` if it exists,
-  else `not-found` in the 3-arg case.
-
-  Reads from the current version of the atom."
-  ([cache-atom e]
-   (r-force (c/lookup @cache-atom e)))
-  ([cache-atom e not-found]
-   (r-force (c/lookup @cache-atom e not-found))))
-
-(defn lookup-or-miss
-  "Retrieve the value associated with `e` if it exists, else compute the
-  value (using value-fn, and optionally wrap-fn), update the cache for `e`
-  and then perform the lookup again.
-
-  value-fn (and wrap-fn) will only be called (at most) once even in the
-  case of retries, so there is no risk of cache stampede.
-
-  Since lookup can cause invalidation in some caches (such as TTL), we
-  trap that case and retry (a maximum of ten times)."
-  ([cache-atom e value-fn]
-   (lookup-or-miss cache-atom e default-wrapper-fn value-fn))
-  ([cache-atom e wrap-fn value-fn]
-   (let [d-new-value (d-lay #(wrap-fn value-fn e))
-         hit-or-miss
-         (fn []
-           (locking cache-atom ; I really do not like this... :(
-             (try
-               (r-force (c/lookup (swap! cache-atom
-                                         c/through-cache
-                                         e
-                                         default-wrapper-fn
-                                         (fn [_] d-new-value))
-                                  e
-                                  ::expired))
-               (catch Throwable t
-                 (swap! cache-atom c/evict e)
-                 (throw t)))))]
-     (loop [n 0 v (hit-or-miss)]
-       (when (< n 10)
-         (if (= ::expired v)
-           (recur (inc n) (hit-or-miss))
-           v))))))
-
-(defn has?
-  "Checks if the cache contains a value associated with `e`.
-
-  Reads from the current version of the atom."
-  [cache-atom e]
-  (c/has? @cache-atom e))
-
-(defn size
-  "Obtain the approximate size/count of the wrapped cache.
-
-  The value returned is a point-in-time approximate count/size as the nature
-  of certain caches don't reflect their true size until a 'lookup-or-miss'
-  operation is invoked - such as the TTL cache.
-
-  Whilst it is an approximate value, the returned result can be useful for
-  metric tracking or decision making.
-
-  Returns an approximate count/size of the wrapped cache.
-  "
-  [cache-atom]
-  (count @cache-atom))
-
-(defn hit
-  "Is meant to be called if the cache is determined to contain a value
-  associated with `e`.
-
-  Returns the updated cache from the atom. Provided for completeness."
-  [cache-atom e]
-  (swap! cache-atom c/hit e))
-
-(defn miss
-  "Is meant to be called if the cache is determined to **not** contain a
-  value associated with `e`.
-
-  Returns the updated cache from the atom. Provided for completeness."
-  [cache-atom e ret]
-  (swap! cache-atom c/miss e ret))
-
-(defn evict
-  "Removes an entry from the cache.
-
-  Returns the updated cache from the atom."
-  [cache-atom e]
-  (swap! cache-atom c/evict e))
-
-(defn seed
-  "Is used to signal that the cache should be created with a seed.
-  The contract is that said cache should return an instance of its
-  own type.
-
-  Returns the updated cache from the atom. Provided for completeness."
-  [cache-atom base]
-  (swap! cache-atom c/seed base))
-
-(defn through
-  "The basic hit/miss logic for the cache system.  Expects a wrap function and
-  value function.  The wrap function takes the value function and the item in question
-  and is expected to run the value function with the item whenever a cache
-  miss occurs.  The intent is to hide any cache-specific cells from leaking
-  into the cache logic itelf."
-  ([cache-atom item] (through default-wrapper-fn identity cache-atom item))
-  ([value-fn cache-atom item] (through default-wrapper-fn value-fn cache-atom item))
-  ([wrap-fn value-fn cache-atom item]
-   (swap! cache-atom c/through-cache item wrap-fn value-fn)))
-
-(defn through-cache
-  "The basic hit/miss logic for the cache system.  Like through but always has
-  the cache argument in the first position."
-  ([cache-atom item] (through-cache cache-atom item default-wrapper-fn identity))
-  ([cache-atom item value-fn] (through-cache cache-atom item default-wrapper-fn value-fn))
-  ([cache-atom item wrap-fn value-fn]
-   (swap! cache-atom c/through-cache item wrap-fn value-fn)))
-
-(defn basic-cache-factory
-  "Returns a pluggable basic cache initialized to `base`"
-  [base]
-  (atom (c/basic-cache-factory base)))
-
-(defn fifo-cache-factory
-  "Returns a FIFO cache with the cache and FIFO queue initialized to `base` --
-   the queue is filled as the values are pulled out of `base`.  If the associative
-   structure can guarantee ordering, then the said ordering will define the
-   eventual eviction order.  Otherwise, there are no guarantees for the eventual
-   eviction ordering.
-
-   This function takes an optional `:threshold` argument that defines the maximum number
-   of elements in the cache before the FIFO semantics apply (default is 32).
-
-   If the number of elements in `base` is greater than the limit then some items
-   in `base` will be dropped from the resulting cache.  If the associative
-   structure used as `base` can guarantee sorting, then the last `limit` elements
-   will be used as the cache seed values.  Otherwise, there are no guarantees about
-   the elements in the resulting cache."
-  [base & {threshold :threshold :or {threshold 32}}]
-  (atom (c/fifo-cache-factory base :threshold threshold)))
-
-(defn lru-cache-factory
-  "Returns an LRU cache with the cache and usage-table initialized to `base` --
-   each entry is initialized with the same usage value.
-
-   This function takes an optional `:threshold` argument that defines the maximum number
-   of elements in the cache before the LRU semantics apply (default is 32)."
-  [base & {threshold :threshold :or {threshold 32}}]
-  (atom (c/lru-cache-factory base :threshold threshold)))
-
-(defn ttl-cache-factory
-  "Returns a TTL cache with the cache and expiration-table initialized to `base` --
-   each with the same time-to-live.
-
-   This function also allows an optional `:ttl` argument that defines the default
-   time in milliseconds that entries are allowed to reside in the cache."
-  [base & {ttl :ttl :or {ttl 2000}}]
-  (atom (c/ttl-cache-factory base :ttl ttl)))
-
-(defn lu-cache-factory
-  "Returns an LU cache with the cache and usage-table initialized to `base`.
-
-   This function takes an optional `:threshold` argument that defines the maximum number
-   of elements in the cache before the LU semantics apply (default is 32)."
-  [base & {threshold :threshold :or {threshold 32}}]
-  (atom (c/lu-cache-factory base :threshold threshold)))
-
-(defn lirs-cache-factory
-  "Returns an LIRS cache with the S & R LRU lists set to the indicated
-   limits."
-  [base & {:keys [s-history-limit q-history-limit]
-           :or {s-history-limit 32
-                q-history-limit 32}}]
-  (atom (c/lirs-cache-factory base
-                              :s-history-limit s-history-limit
-                              :q-history-limit q-history-limit)))
-
-(defn soft-cache-factory
-  "Returns a SoftReference cache.  Cached values will be referred to with
-  SoftReferences, allowing the values to be garbage collected when there is
-  memory pressure on the JVM.
-
-  SoftCache is a mutable cache, since it is always based on a
-  ConcurrentHashMap."
-  [base]
-  (atom (c/soft-cache-factory base)))
diff --git a/src/test/clojure/clojure/core/cache/wrapped_test.clj b/src/test/clojure/clojure/core/cache/wrapped_test.clj
deleted file mode 100644
index b66677c..0000000
--- a/src/test/clojure/clojure/core/cache/wrapped_test.clj
+++ /dev/null
@@ -1,112 +0,0 @@
-;   Copyright (c) Rich Hickey. All rights reserved.
-;   The use and distribution terms for this software are covered by the
-;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
-;   which can be found in the file epl-v10.html at the root of this distribution.
-;   By using this software in any fashion, you are agreeing to be bound by
-;   the terms of this license.
-;   You must not remove this notice, or any other, from this software.
-
-(ns clojure.core.cache.wrapped-test
-  (:require [clojure.core.cache.wrapped :as c]
-            [clojure.core.cache :as cache]
-            [clojure.test :refer [deftest is]]))
-
-(deftest basic-wrapped-test
-  (let [cache (c/basic-cache-factory {})]
-    (is (= nil (c/lookup cache :a)))
-    ;; the size of the cache is zero
-    (is (= 0 (c/size cache)))
-    (is (= ::missing (c/lookup cache :a ::missing)))
-    ;; mutating operation
-    (is (= 42 (c/lookup-or-miss cache :a (constantly 42))))
-    ;; cache now contains :a
-    (is (= 42 (c/lookup cache :a)))
-    ;; and it now has a size of one
-    (is (= 1 (c/size cache)))
-    ;; :a is present, does not call value-fn
-    (is (= 42 (c/lookup-or-miss cache :a #(throw (ex-info "bad" {:key %})))))
-    ;; cache still contains :a as 42
-    (is (= 42 (c/lookup cache :a)))
-    ;; and it still has a size of one
-    (is (= 1 (c/size cache)))
-    (c/evict cache :a)
-    (is (= nil (c/lookup cache :a)))
-    ;; and the cache now has a size of zero
-    (is (= 0 (c/size cache)))
-    (is (= ::missing (c/lookup cache :a ::missing)))))
-
-(deftest wrapped-ttl-test
-  ;; TTL lookup-or-miss can expire on the lookup so this test verifies
-  ;; that bug (in 0.8.0) so I can fix it in 0.8.1!
-  (let [cache (c/ttl-cache-factory {} :ttl 1)
-        limit 2000000
-        start (System/currentTimeMillis)]
-    (loop [n 0]
-      (if-not (c/lookup-or-miss cache :a (constantly 42))
-        (is false (str "Failure on call " n))
-        (when (< n limit)
-          (recur (inc n)))))
-    (println "ttl test completed" limit "calls in"
-             (- (System/currentTimeMillis) start) "ms")))
-
-(deftest cache-stampede
-  (let [thread-count 1000
-        cache-atom (-> {}
-                       (cache/ttl-cache-factory :ttl 120000)
-                       (cache/lu-cache-factory :threshold 100)
-                       (atom))
-        latch (java.util.concurrent.CountDownLatch. thread-count)
-        invocations-counter (atom 0)
-        freds  (atom [])
-        values (atom [])
-        exes   (atom 0)]
-    (dotimes [n thread-count]
-      (if (<= n (rand-int thread-count))
-        (swap! freds conj
-               (Thread.
-                (fn []
-                  (try
-                    (swap! values conj
-                           (c/lookup-or-miss cache-atom "my-key"
-                                             (fn [_]
-                                               (throw (Exception. "Bad")))))
-                    (catch Exception e
-                      (swap! exes inc)
-                      (is (= "Bad" (.getMessage e)))))
-                  (.countDown latch))))
-        (swap! freds conj
-               (Thread.
-                (fn []
-                  (try
-                    (swap! values conj
-                           (c/lookup-or-miss cache-atom "my-key"
-                                             (fn [_]
-                                               (swap! invocations-counter inc)
-                                               (Thread/sleep 3000)
-                                               "some value")))
-                    (catch Exception _
-                      (is false "Unexpected cached exception")))
-                  (.countDown latch))))))
-
-    (run! #(.start ^Thread %) @freds)
-
-    (.await latch)
-    (println "cache-stampede test completed with" @invocations-counter
-             "successful invocation(s)\n\tand" (count @values)
-             "successful lookups in" thread-count
-             "threads with" @exes "exceptions")
-    (is (= 1 (deref invocations-counter)))
-    (is (= (- thread-count @exes) (count @values)))
-    (doseq [v @values]
-      (is (= "some value" v)))))
-
-(deftest cache-thrown
-  (let [c (c/basic-cache-factory {})]
-    (is (thrown? Exception
-                 (c/lookup-or-miss c :a
-                                   (fn [_]
-                                     (throw (Exception. "bad"))))))
-    ;; cache should not have :a in it
-    (is (= nil (c/lookup c :a)))
-    ;; and the cache should still be empty
-    (is (= 0 (c/size c)))))
diff --git a/src/test/clojure/clojure/core/cache_test.clj b/src/test/clojure/clojure/core/cache_test.clj
deleted file mode 100644
index a67f614..0000000
--- a/src/test/clojure/clojure/core/cache_test.clj
+++ /dev/null
@@ -1,531 +0,0 @@
-;   Copyright (c) Rich Hickey. All rights reserved.
-;   The use and distribution terms for this software are covered by the
-;   Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
-;   which can be found in the file epl-v10.html at the root of this distribution.
-;   By using this software in any fashion, you are agreeing to be bound by
-;   the terms of this license.
-;   You must not remove this notice, or any other, from this software.
-
-(ns ^{:doc "A caching library for Clojure."
-      :author "Fogus"}
-  clojure.core.cache-test
-  (:use [clojure.core.cache] :reload-all)
-  (:use [clojure.test])
-  (:import (clojure.core.cache BasicCache FIFOCache LRUCache TTLCacheQ LUCache
-                               LIRSCache)
-           (java.lang.ref ReferenceQueue SoftReference)
-           (java.util.concurrent ConcurrentHashMap)))
-
-(println "\nTesting with Clojure" (clojure-version))
-
-(deftest test-basic-cache-lookup
-  (testing "that the BasicCache can lookup as expected"
-    (is (= :robot (lookup (miss (BasicCache. {}) '(servo) :robot) '(servo))))))
-
-(defn do-dot-lookup-tests [c]
-  (are [expect actual] (= expect actual)
-       1   (.lookup c :a)
-       2   (.lookup c :b)
-       42  (.lookup c :c 42)
-       nil (.lookup c :c)))
-
-(defn do-ilookup-tests [c]
-  (are [expect actual] (= expect actual)
-       1   (:a c)
-       2   (:b c)
-       42  (:X c 42)
-       nil (:X c)))
-
-(defn do-assoc [c]
-  (are [expect actual] (= expect actual)
-       1   (:a (assoc c :a 1))
-       nil (:a (assoc c :b 1))))
-
-(defn do-dissoc [c]
-  (are [expect actual] (= expect actual)
-       2   (:b (dissoc c :a))
-       nil (:a (dissoc c :a))
-       nil (:b (-> c (dissoc :a) (dissoc :b)))
-       0   (count (-> c (dissoc :a) (dissoc :b)))))
-
-(defn do-getting [c]
-  (are [actual expect] (= expect actual)
-       (get c :a) 1
-       (get c :e) nil
-       (get c :e 0) 0
-       (get c :b 0) 2
-       (get c :f 0) nil
-
-       (get-in c [:c :e]) 4
-       (get-in c '(:c :e)) 4
-       (get-in c [:c :x]) nil
-       (get-in c [:f]) nil
-       (get-in c [:g]) false
-       (get-in c [:h]) nil
-       (get-in c []) c
-       (get-in c nil) c
-
-       (get-in c [:c :e] 0) 4
-       (get-in c '(:c :e) 0) 4
-       (get-in c [:c :x] 0) 0
-       (get-in c [:b] 0) 2
-       (get-in c [:f] 0) nil
-       (get-in c [:g] 0) false
-       (get-in c [:h] 0) 0
-       (get-in c [:x :y] {:y 1}) {:y 1}
-       (get-in c [] 0) c
-       (get-in c nil 0) c))
-
-(defn do-finding [c]
-  (are [expect actual] (= expect actual)
-       (find c :a) [:a 1]
-       (find c :b) [:b 2]
-       (find c :c) nil
-       (find c nil) nil))
-
-(defn do-contains [c]
-  (are [expect actual] (= expect actual)
-       (contains? c :a) true
-       (contains? c :b) true
-       (contains? c :c) false
-       (contains? c nil) false))
-
-
-(def big-map {:a 1, :b 2, :c {:d 3, :e 4}, :f nil, :g false, nil {:h 5}})
-(def small-map {:a 1 :b 2})
-
-(deftest test-basic-cache-ilookup
-  (testing "counts"
-    (is (= 0 (count (BasicCache. {}))))
-    (is (= 1 (count (BasicCache. {:a 1})))))
-  (testing "that the BasicCache can lookup via keywords"
-    (do-ilookup-tests (BasicCache. small-map)))
-  (testing "that the BasicCache can .lookup"
-    (do-dot-lookup-tests (BasicCache. small-map)))
-  (testing "assoc and dissoc for BasicCache"
-    (do-assoc (BasicCache. {}))
-    (do-dissoc (BasicCache. {:a 1 :b 2})))
-  (testing "that get and cascading gets work for BasicCache"
-    (do-getting (BasicCache. big-map)))
-  (testing "that finding works for BasicCache"
-    (do-finding (BasicCache. small-map)))
-  (testing "that contains? works for BasicCache"
-    (do-contains (BasicCache. small-map))))
-
-(deftest test-fifo-cache-ilookup
-  (testing "that the FifoCache can lookup via keywords"
-    (do-ilookup-tests (FIFOCache. small-map clojure.lang.PersistentQueue/EMPTY 2)))
-  (testing "that the FifoCache can lookup via keywords"
-    (do-dot-lookup-tests (FIFOCache. small-map clojure.lang.PersistentQueue/EMPTY 2)))
-  (testing "assoc and dissoc for FifoCache"
-    (do-assoc (FIFOCache. {} clojure.lang.PersistentQueue/EMPTY 2))
-    (do-dissoc (FIFOCache. {:a 1 :b 2} clojure.lang.PersistentQueue/EMPTY 2)))
-  (testing "that get and cascading gets work for FifoCache"
-    (do-getting (FIFOCache. big-map clojure.lang.PersistentQueue/EMPTY 2)))
-  (testing "that finding works for FifoCache"
-    (do-finding (FIFOCache. small-map clojure.lang.PersistentQueue/EMPTY 2)))
-  (testing "that contains? works for FifoCache"
-    (do-contains (FIFOCache. small-map clojure.lang.PersistentQueue/EMPTY 2)))
-  (testing "that FIFO caches starting with less elements than the threshold work"
-    (let [C (fifo-cache-factory (sorted-map :a 1, :b 2) :threshold 3)]
-      (are [x y] (= x y)
-           {:a 1, :b 2, :c 3} (.cache (assoc C :c 3))
-           {:d 4, :b 2, :c 3} (.cache (assoc C :c 3 :d 4))))))
-
-(deftest test-lru-cache-ilookup
-  (testing "that the LRUCache can lookup via keywords"
-    (do-ilookup-tests (LRUCache. small-map {} 0 2)))
-  (testing "that the LRUCache can lookup via keywords"
-    (do-dot-lookup-tests (LRUCache. small-map {} 0 2)))
-  (testing "assoc and dissoc for LRUCache"
-    (do-assoc (LRUCache. {} {} 0 2))
-    (do-dissoc (LRUCache. {:a 1 :b 2} {} 0 2)))
-  (testing "that get and cascading gets work for LRUCache"
-    (do-getting (LRUCache. big-map {} 0 2)))
-  (testing "that finding works for LRUCache"
-    (do-finding (LRUCache. small-map {} 0 2)))
-  (testing "that contains? works for LRUCache"
-    (do-contains (LRUCache. small-map {} 0 2))))
-
-(deftest test-lru-cache
-  (testing "LRU-ness with empty cache and threshold 2"
-    (let [C (lru-cache-factory {} :threshold 2)]
-      (are [x y] (= x y)
-           {:a 1, :b 2} (-> C (assoc :a 1) (assoc :b 2) .cache)
-           {:b 2, :c 3} (-> C (assoc :a 1) (assoc :b 2) (assoc :c 3) .cache)
-           {:a 1, :c 3} (-> C (assoc :a 1) (assoc :b 2) (.hit :a) (assoc :c 3) .cache))))
-  (testing "LRU-ness with seeded cache and threshold 4"
-    (let [C (lru-cache-factory {:a 1, :b 2} :threshold 4)]
-      (are [x y] (= x y)
-           {:a 1, :b 2, :c 3, :d 4} (-> C (assoc :c 3) (assoc :d 4) .cache)
-           {:a 1, :c 3, :d 4, :e 5} (-> C (assoc :c 3) (assoc :d 4) (.hit :c) (.hit :a) (assoc :e 5) .cache))))
-  (testing "regressions against LRU eviction before threshold met"
-    (is (= {:b 3 :a 4}
-           (-> (clojure.core.cache/lru-cache-factory {} :threshold 2)
-               (assoc :a 1)
-               (assoc :b 2)
-               (assoc :b 3)
-               (assoc :a 4)
-               .cache)))
-
-    (is (= {:e 6, :d 5, :c 4}
-           (-> (clojure.core.cache/lru-cache-factory {} :threshold 3)
-               (assoc :a 1)
-               (assoc :b 2)
-               (assoc :b 3)
-               (assoc :c 4)
-               (assoc :d 5)
-               (assoc :e 6)
-               .cache)))
-
-    (is (= {:a 1 :b 3}
-           (-> (clojure.core.cache/lru-cache-factory {} :threshold 2)
-               (assoc :a 1)
-               (assoc :b 2)
-               (assoc :b 3)
-               .cache))))
-
-  (is (= {:d 4 :e 5}
-         (-> (lru-cache-factory {} :threshold 2)
-             (hit :x)
-             (hit :y)
-             (hit :z)
-             (assoc :a 1)
-             (assoc :b 2)
-             (assoc :c 3)
-             (assoc :d 4)
-             (assoc :e 5)
-             .cache))))
-
-(defn sleepy [e t] (Thread/sleep t) e)
-
-(deftest test-ttl-cache-ilookup
-  (let [five-secs  (+ 5000 (System/currentTimeMillis))
-        big-time   (into {} (for [[k _] big-map] [k [0 five-secs]]))
-        big-q      (into clojure.lang.PersistentQueue/EMPTY
-                         (for [[k _] big-map] [k 0 five-secs]))
-        small-time (into {} (for [[k _] small-map] [k [0 five-secs]]))
-        small-q    (into clojure.lang.PersistentQueue/EMPTY
-                         (for [[k _] small-map] [k 0 five-secs]))]
-    (testing "that the TTLCacheQ can lookup via keywords"
-      (do-ilookup-tests (TTLCacheQ. small-map small-time small-q 1 2000)))
-    (testing "that the TTLCacheQ can lookup via keywords"
-      (do-dot-lookup-tests (TTLCacheQ. small-map small-time small-q 1 2000)))
-    (testing "assoc and dissocQ for TTLCacheQ"
-      (do-assoc (TTLCacheQ. {} {} clojure.lang.PersistentQueue/EMPTY 1 2000))
-      (do-dissoc (TTLCacheQ. {:a 1 :b 2}
-                             {:a [0 five-secs] :b [0 five-secs]}
-                             (into clojure.lang.PersistentQueue/EMPTY
-                                   [[:a 0 five-secs] [:b 0 five-secs]])
-                             1
-                             2000)))
-    (testing "that get and cascading gets work for TTLCacheQ"
-      (do-getting (TTLCacheQ. big-map big-time big-q 1 2000)))
-    (testing "that finding works for TTLCacheQ"
-        (do-finding (TTLCacheQ. small-map small-time small-q 1 2000)))
-    (testing "that contains? works for TTLCacheQ"
-        (do-contains (TTLCacheQ. small-map small-time small-q 1 2000)))))
-
-(defn- ttl-q-check
-  [start nap [k g t]]
-  [k g (<= start (+ start nap) t (+ start nap 100))])
-
-(deftest test-ttl-cache
-  (testing "TTL-ness with empty cache"
-    (let [start (System/currentTimeMillis)
-          C     (ttl-cache-factory {} :ttl 500)
-          C'    (-> C (assoc :a 1) (assoc :b 2))]
-      (are [x y] (= x y)
-           [[:a 1 true], [:b 2 true]] (map (partial ttl-q-check start 0) (.q C'))
-           {:a 1, :b 2}               (.cache C')
-           3                          (.gen C')))
-    (let [start (System/currentTimeMillis)
-          C     (ttl-cache-factory {} :ttl 500)
-          C'    (-> C (assoc :a 1) (assoc :b 2) (sleepy 700) (assoc :c 3))]
-      (are [x y] (= x y)
-           [[:c 3 true]] (map (partial ttl-q-check start 700) (.q C'))
-           {:c 3}        (.cache C')
-           4             (.gen C'))))
-  (testing "TTL cache does not return a value that has expired."
-    (let [C (ttl-cache-factory {} :ttl 500)]
-      (is (nil? (-> C (assoc :a 1) (sleepy 700) (lookup :a))))))
-  (testing "TTL cache does not contain a value that was removed from underlying cache."
-    (let [underlying-cache (lru-cache-factory {} :threshold 1)
-          C (ttl-cache-factory underlying-cache :ttl 360000)]
-      (is (not (-> C (assoc :a 1) (assoc :b 2) (has? :a)))))))
-
-(deftest test-lu-cache-ilookup
-  (testing "that the LUCache can lookup via keywords"
-    (do-ilookup-tests (LUCache. small-map {} 2)))
-  (testing "that the LUCache can lookup via keywords"
-    (do-dot-lookup-tests (LUCache. small-map {} 2)))
-  (testing "assoc and dissoc for LUCache"
-    (do-assoc (LUCache. {} {}  2))
-    (do-dissoc (LUCache. {:a 1 :b 2} {} 2))))
-
-(deftest test-lu-cache
-  (testing "LU-ness with empty cache"
-    (let [C (lu-cache-factory {} :threshold 2)]
-      (are [x y] (= x y)
-           {:a 1, :b 2} (-> C (assoc :a 1) (assoc :b 2) .cache)
-           {:b 2, :c 3} (-> C (assoc :a 1) (assoc :b 2) (.hit :b) (assoc :c 3) .cache)
-           {:b 2, :c 3} (-> C (assoc :a 1) (assoc :b 2) (.hit :b) (.hit :b) (.hit :a) (assoc :c 3) .cache))))
-  (testing "LU-ness with seeded cache"
-    (let [C (lu-cache-factory {:a 1, :b 2} :threshold 4)]
-      (are [x y] (= x y)
-           {:a 1, :b 2, :c 3, :d 4} (-> C (assoc :c 3) (assoc :d 4) .cache)
-           {:a 1, :c 3, :d 4, :e 5} (-> C (assoc :c 3) (assoc :d 4) (.hit :a) (assoc :e 5) .cache)
-           {:b 2, :c 3, :d 4, :e 5} (-> C (assoc :c 3) (assoc :d 4)  (.hit :b) (.hit :c) (.hit :d) (assoc :e 5) .cache))))
-  (testing "regressions against LU eviction before threshold met"
-    (is (= (-> (clojure.core.cache/lu-cache-factory {} :threshold 2)
-               (assoc :a 1)
-               (assoc :b 2)
-               (assoc :b 3)
-               (assoc :a 4))
-           {:b 3 :a 4}))
-
-    (is (= (-> (clojure.core.cache/lu-cache-factory {} :threshold 3)
-               (assoc :a 1)
-               (assoc :b 2)
-               (assoc :b 3)
-               (assoc :c 4)
-               (assoc :d -5)
-               ;; ensure that the test result does not rely on
-               ;; arbitrary tie-breakers in number of hits
-               (assoc :d 5)
-               (assoc :e 6))
-           {:e 6, :d 5, :b 3}))
-
-    (is (= {:a 1 :b 3}
-           (-> (clojure.core.cache/lu-cache-factory {} :threshold 2)
-               (assoc :a 1)
-               (assoc :b 2)
-               (assoc :b 3)
-               .cache)))
-
-    (is (= {:c 3 :d 4}
-           (-> (clojure.core.cache/lu-cache-factory {:a 1 :b 2} :threshold 2)
-               (dissoc :a)
-               (assoc :c 3)
-               (assoc :d 4)
-               .cache)))))
-
-;; # LIRS
-
-(defn- lirs-map [lirs]
-  {:cache (.cache lirs)
-   :lruS (.lruS lirs)
-   :lruQ (.lruQ lirs)
-   :tick (.tick lirs)
-   :limitS (.limitS lirs)
-   :limitQ (.limitQ lirs)})
-
-(deftest test-LIRSCache
-  (testing "that the LIRSCache can lookup as expected"
-    (is (= :robot (lookup (miss (seed (LIRSCache. {} {} {} 0 1 1) {}) '(servo) :robot) '(servo)))))
-
-  (testing "a hit of a LIR block:
-
-L LIR block
-H HIR block
-N non-resident HIR block
-
-
-          +-----------------------------+   +----------------+
-          |           HIT 4             |   |     HIT 8      |
-          |                             v   |                |
-          |                                 |                |
-    H 5   |                           L 4   |                v
-    H 3   |                           H 5   |
-    N 2   |                           H 3   |              L 8
-    L 1   |                           N 2   |              L 4
-    N 6   |                           L 1   |              H 5
-    N 9   |                           N 6   |              H 3
-    L 4---+ 5                         N 9   | 5            N 2     5
-    L 8     3                         L 8---+ 3            L 1     3
-
-      S     Q                           S     Q              S     Q
-
-"
-    (let [lirs (LIRSCache. {:1 1 :3 3 :4 4 :5 5 :8 8}
-                           {:5 7 :3 6 :2 5 :1 4 :6 3 :9 2 :4 1 :8 0}
-                           {:5 1 :3 0} 7 3 2)]
-      (testing "hit 4"
-        (is (= (lirs-map (hit lirs :4))
-               (lirs-map (LIRSCache. {:1 1 :3 3 :4 4 :5 5 :8 8}
-                                     {:5 7 :3 6 :2 5 :1 4 :6 3 :9 2 :4 8 :8 0}
-                                     {:5 1 :3 0} 8 3 2)))))
-      (testing "hit 8 prunes the stack"
-        (is (= (lirs-map (-> lirs (hit :4) (hit :8)))
-               (lirs-map (LIRSCache. {:1 1 :3 3 :4 4 :5 5 :8 8}
-                                     {:5 7 :3 6 :2 5 :1 4 :4 8 :8 9}
-                                     {:5 1 :3 0} 9 3 2)))))))
-  (testing "a hit of a HIR block:
-
-L LIR block
-H HIR block
-N non-resident HIR block
-
-
-                     HIT 3                                  HIT 5
-         +-----------------------------+         +------------------+-----+
-         |                             |         |                  |     |
-    L 4  |+----------------------------+-----+   |                  v     |
-    L 8  ||                            v     |   |                        |
-    H 5  ||                                  v   |                H 5     v
-    H 3-- |                          L 3         |                L 3
-    N 2   | 5                        L 4     1   |                L 4     5
-    L 1---+ 3                        L 8     5---+                L 8     1
-
-      S     Q                          S     Q                      S     Q
-
-"
-    (let [lirs (LIRSCache. {:1 1 :3 3 :4 4 :5 5 :8 8}
-                           {:4 9 :8 8 :5 7 :3 6 :2 5 :1 4}
-                           {:5 1 :3 0} 9 3 2)]
-      (testing "hit 3 prunes the stack and moves oldest block of lruS to lruQ"
-        (is (= (lirs-map (hit lirs :3))
-               {:cache {:1 1 :3 3 :4 4 :5 5 :8 8}
-                :lruS {:3 10 :4 9 :8 8}
-                :lruQ {:1 10 :5 1}
-                :tick 10 :limitS 3 :limitQ 2})))
-      (testing "hit 5 adds the block to lruS"
-        (is (= (lirs-map (-> lirs (hit :3) (hit :5)))
-               {:cache {:1 1 :3 3 :4 4 :5 5 :8 8}
-                :lruS {:5 11 :3 10 :4 9 :8 8}
-                :lruQ {:5 11 :1 10}
-                :tick 11 :limitS 3 :limitQ 2})))))
-  (testing "a miss:
-
-L LIR block
-H HIR block
-N non-resident HIR block
-
-
-                     MISS 7                          MISS 9                    MISS 5
-             ---------------------+-----+    -----------------+-----+     +-------------------+
-                                  |     |                     v     |     |                   |
-                                  v     |                           |     |                   v
-                                        |                   H 9  + -| - - +
-                                H 7     |                   H 7  |  |                       L 5  +--+
-    H 5                         H 5     v                   N 5- +  v                       H 9  |  v
-    L 3                         L 3                         L 3                             N 7  |
-    L 4     5                   L 4     7                   L 4     9                       L 3  |  8
-    L 8     1                   L 8     5                   L 8--+  7                       L 4  |  9
-                                                                 +-------------------------------+
-      S     Q                     S     Q                     S     Q                         S     Q
-
-
-"
-    (let [lirs (LIRSCache. {:1 1 :3 3 :4 4 :5 5 :8 8}
-                           {:5 11 :3 10 :4 9 :8 8}
-                           {:5 11 :1 10} 11 3 2)]
-      (testing "miss 7 adds the block to lruS and lruQ and removes the oldest block in lruQ"
-        (is (= (lirs-map (miss lirs :7 7))
-               {:cache {:3 3 :4 4 :5 5 :8 8 :7 7}
-                :lruS {:7 12 :5 11 :3 10 :4 9 :8 8}
-                :lruQ {:7 12 :5 11}
-                :tick 12 :limitS 3 :limitQ 2})))
-      (testing "miss 9 makes 5 a non-resident HIR block"
-        (is (= (lirs-map (-> lirs (miss :7 7) (miss :9 9)))
-               {:cache {:3 3 :4 4 :8 8 :7 7 :9 9}
-                :lruS {:9 13 :7 12 :5 11 :3 10 :4 9 :8 8}
-                :lruQ {:9 13 :7 12}
-                :tick 13 :limitS 3 :limitQ 2})))
-      (testing "miss 5, a non-resident HIR block becomes a new LIR block"
-        (is (= (lirs-map (-> lirs (miss :7 7) (miss :9 9) (miss :5 5)))
-               {:cache {:3 3 :4 4 :8 8 :9 9 :5 5}
-                :lruS {:5 14 :9 13 :7 12 :3 10 :4 9}
-                :lruQ {:8 14 :9 13}
-                :tick 14 :limitS 3 :limitQ 2}))))))
-
-(deftest test-soft-cache-ilookup
-  (testing "counts"
-    (is (= 0 (count (soft-cache-factory {}))))
-    (is (= 1 (count (soft-cache-factory {:a 1})))))
-  (testing "that the SoftCache can lookup via keywords"
-    (do-ilookup-tests (soft-cache-factory small-map)))
-  (testing "that the SoftCache can .lookup"
-    (do-dot-lookup-tests (soft-cache-factory small-map)))
-  (testing "that get and cascading gets work for SoftCache"
-    (do-getting (soft-cache-factory big-map)))
-  (testing "that finding works for SoftCache"
-    (do-finding (soft-cache-factory small-map)))
-  (testing "that contains? works for SoftCache"
-    (do-contains (soft-cache-factory small-map))))
-
-(deftest test-clear-soft-cache!
-  (let [rq (ReferenceQueue.)
-        ref (SoftReference. :bar rq)
-        cache (doto (ConcurrentHashMap.)
-                (.put :foo ref))
-        rcache (doto (ConcurrentHashMap.)
-                 (.put ref :foo))
-        _ (clear-soft-cache! cache rcache rq)]
-    (is (contains? cache :foo) (str cache))
-    (is (contains? rcache ref) (str rcache))
-    (.clear ref)
-    (.enqueue ref)
-    (is (not (.get ref)))
-    (let [_ (clear-soft-cache! cache rcache rq)]
-      (is (not (contains? cache :foo)))
-      (is (not (contains? rcache ref))))))
-
-(deftest test-soft-cache
-  (let [ref (atom nil)
-        old-make-reference make-reference]
-    (with-redefs [make-reference (fn [& args]
-                                   (reset! ref (apply old-make-reference args))
-                                   @ref)]
-      (let [old-soft-cache (soft-cache-factory {:foo1 :bar})
-            r @ref
-            soft-cache (assoc old-soft-cache :foo2 :baz)]
-        (is (and r (= :bar (.get r))))
-        (.clear r)
-        (.enqueue r)
-        (is (nil? (.lookup soft-cache :foo1)))
-        (is (nil? (.lookup old-soft-cache :foo1)))
-        (is (= :quux (.lookup soft-cache :foo1 :quux)))
-        (is (= :quux (.lookup old-soft-cache :foo1 :quux)))
-        (is (= :quux (.lookup soft-cache :foo3 :quux)))
-        (is (= :quux (.lookup old-soft-cache :foo3 :quux)))
-        (is (not (.has? soft-cache :foo1)))
-        (is (not (.has? old-soft-cache :foo1)))))))
-
-(deftest test-soft-cache-eviction-handling
-  (let [ref (atom nil)
-        old-make-reference make-reference]
-    (with-redefs [make-reference (fn [& args]
-                                   (reset! ref (apply old-make-reference args))
-                                   @ref)]
-      (let [cache (soft-cache-factory {})]
-        (miss cache :foo "foo")
-        (.enqueue @ref)
-        (evict cache :foo)))))
-
-(deftest test-equiv
-  (is (= (fifo-cache-factory {:a 1 :c 3} :threshold 3)
-         (fifo-cache-factory {:a 1 :c 3} :threshold 3))))
-
-(deftest test-persistent-cons
-  (is (let [starts-with-a (fifo-cache-factory {:a 1} :threshold 3)]
-        (= (fifo-cache-factory {:a 1 :c 3} :threshold 3)
-           (conj starts-with-a [:c 3])
-           (conj starts-with-a {:c 3})))))
-
-(deftest evict-with-object-exception
-  (let [thing (proxy [Object] []
-                (equals [obj] (throw (new Exception "Boom!"))))]
-    (are [x y] (= x y)
-      {:b 2} (-> (lru-cache-factory {:a thing, :b 2}) (evict :a) (.cache))
-      {:b 2} (-> (lu-cache-factory {:a thing, :b 2}) (evict :a) (.cache))
-      {:b 2} (-> (fifo-cache-factory {:a thing, :b 2}) (evict :a) (.cache)))))
-
-(deftest test-cache-iterable
-  (let [c (fifo-cache-factory {:a 1 :b 2} :threshold 10)]
-    (is (= #{:a :b} (set (iterator-seq (.iterator (keys c))))))))
-
-(deftest test-fifo-miss-does-not-drop-ccache-39
-  (let [c (fifo-cache-factory {:a 1 :b 2} :threshold 2)]
-    (is (= #{:a :c} (set (-> c (evict :b) (miss :c 42) (.q)))))
-    (is (= #{:c :d} (set (-> c (evict :b) (miss :c 42) (miss :d 43) (.q)))))))
diff --git a/static/clojure-icon.gif b/static/clojure-icon.gif
new file mode 100644
index 0000000..84eee16
Binary files /dev/null and b/static/clojure-icon.gif differ
diff --git a/static/clojure.css b/static/clojure.css
new file mode 100644
index 0000000..d40ea35
--- /dev/null
+++ b/static/clojure.css
@@ -0,0 +1,53 @@
+
+body {margin: 0;padding: 0;background-color: #e3e3e3;border-top: 4px solid #b3ccfe;color: #272727}
+body, .wiki, #Content, .wikipage {font-family: "Lucida Grande","Trebuchet MS","Bitstream Vera Sans",Verdana,Helvetica,sans-serif;font-size: 12px;line-height: 18px;}
+#leftcolumn .wiki_link, #toc, #toc a, .toc-header {font-size: 11px;line-height: 18px;text-decoration: none}
+img {border: 0;}
+#AllContentContainer {max-width: 96em;min-width: 663px;background: #fff url(space/content-background.gif) right repeat-y;padding: 0 40px 18px 0;}
+
+#Header {position: relative;clear: both;overflow: auto;height: 110px}
+#Logo {position: absolute;top: 0;left: 0;padding: 10px 0 0 62px;width: 138px;height: 100px}
+#Header h1 {float: left;border: 0;margin: 0;padding: 0;position: absolute;top: 50;left: 200px; height: 60px}
+#Header h1 a:link, #Header h1 a:visited, #Header h1 a:hover {color:#000000; text-decoration: none;}
+#Resources {min-height: 110px;width: 234px;padding: 5px 0;float: right;border-bottom: 1px solid #abc4e2;background: #e4eaf7 url(space/resources-background.gif) repeat-y;overflow: auto;}
+#Resources ul {margin: 0;padding: 0 25px;list-style: none;}
+#ResourcesB {float: right;}
+#Resources a {text-decoration: none;}
+#Resources a:link, #Resources a:visited, #Resources a:hover, #Resources a:active {color: #4c5770;}
+#Resources a:hover {text-decoration: underline;}
+
+#leftcolumn {margin: 0 0 0 22px;float: left;width: 168px;padding-bottom: 18px;background: #c5d2eb url(space/left-nav-bottom.gif) bottom no-repeat;}
+
+#leftcolumn ul {list-style: none;margin: 0;padding: 0;}
+
+#leftcolumn a, #leftcolumn .toc-header {font-weight: bold;display: block;background: transparent url(space/left-nav-divider.gif) repeat-x;padding: 6px 0 0 17px;margin: 12px 0 0 0;}
+#leftcolumn li a {font-weight: normal;background:none;margin: 0;padding: 0 0 0 17px;}
+#leftcolumn br {display: none;}
+#leftcolumn .menu {margin-top: 14px;background: #fff url(space/left-nav-background.gif) repeat-y;}
+
+#leftcolumn a:link , #leftcolumn a:visited , #leftcolumn a:active {color: #666;}
+#leftcolumn a:hover {text-decoration: underline;color: #222;}
+
+#rightcolumn {margin-left: 220px;}
+
+.wiki #toc {border: none;margin: 0 0 30px 18px;width: 222px;padding: 0 0 17px 12px;background: transparent url(space/toc-background.gif) repeat-y;border-bottom: 1px solid #d6d6d6;}
+.wiki #toc h1, .wiki #toc div {margin: 0;padding: 0;}
+.wiki #toc h1 {font-size: 14px;line-height: 18px;font-family: Georgia, "Times New Roman", Times, serif;font-style: italic;font-weight: normal;color: #969696;padding: 10px 0 8px 11px;}
+.wiki #toc a:link, .wiki #toc a:visited, .wiki #toc a:active {color: #646464;}
+.wiki #toc a:hover {background: none;color: #333333;}
+
+.wiki pre {font-family: Inconsolata, Monaco, Consolas, "Lucida Console", "Courier New", Courier, monospace;background-color: transparent;border: 0px;color: #000000}
+#DesignedBy { clear: both; text-align: right; margin-top: 18px;}
+#DesignedBy, #DesignedBy a, #DesignedBy a:link, #DesignedBy a:visited, #DesignedBy a:hover, #DesignedBy a:active { color: #999; }
+
+#WikiHeaderNavContainer { height: 36px; position: relative; }
+#leftcolumn .WikiActions a {display: inline;}
+
+.comment { color: gray; }
+.string {	color: teal; }
+.function { color: #00c; }
+.macro, .specialops { color: #60c; }
+.parens { color: #000; }
+.keyword { color: #c09; }
+.brackets { color: #006; }
+.curlybrackets { color: #906; }
diff --git a/static/favicon.png b/static/favicon.png
new file mode 100644
index 0000000..b1653e8
Binary files /dev/null and b/static/favicon.png differ
diff --git a/static/internal.css b/static/internal.css
new file mode 100644
index 0000000..08ce7fb
--- /dev/null
+++ b/static/internal.css
@@ -0,0 +1,18 @@
+/* *** MISC STUFF USED ALL OVER *** */
+.nowrap { white-space: nowrap; }
+.hidden { display: none; }
+tr td .sm { font-size: 90%; }
+.grey { color: #666; }
+.smgrey { color: #666; font-size: 80%; }
+.grey a { color: #666; }
+.textentry { font-family: arial, helvetica, sans-serif; border: 1px solid #999; }
+.nopad { padding: 0; margin: 0; }
+.bblack { color: #000; font-size: 1.1em; font-weight: bold; }
+.bblacklight { color: #000; font-size: 1.1em; }
+
+/* IE6 min-height: http://www.dustindiaz.com/min-height-fast-hack */
+#content_view { display: block; padding-bottom: 2em; width: 100%; min-height: 600px; height: auto !important; height: 600px; }
+
+/* Used with .innerContentBox and #WikiAds to position the ad column */
+.contentBox { position: relative; min-height: 600px; height: auto !important; height: 600px; }
+
diff --git a/static/space/content-background.gif b/static/space/content-background.gif
new file mode 100644
index 0000000..0786c72
Binary files /dev/null and b/static/space/content-background.gif differ
diff --git a/static/space/left-nav-background.gif b/static/space/left-nav-background.gif
new file mode 100644
index 0000000..e6e5904
Binary files /dev/null and b/static/space/left-nav-background.gif differ
diff --git a/static/space/left-nav-bottom.gif b/static/space/left-nav-bottom.gif
new file mode 100644
index 0000000..061c089
Binary files /dev/null and b/static/space/left-nav-bottom.gif differ
diff --git a/static/space/left-nav-divider.gif b/static/space/left-nav-divider.gif
new file mode 100644
index 0000000..1854e56
Binary files /dev/null and b/static/space/left-nav-divider.gif differ
diff --git a/static/space/resources-background.gif b/static/space/resources-background.gif
new file mode 100644
index 0000000..9657769
Binary files /dev/null and b/static/space/resources-background.gif differ
diff --git a/static/space/toc-background.gif b/static/space/toc-background.gif
new file mode 100644
index 0000000..0b7c95b
Binary files /dev/null and b/static/space/toc-background.gif differ
diff --git a/static/wiki.css b/static/wiki.css
new file mode 100644
index 0000000..1cb1bdd
--- /dev/null
+++ b/static/wiki.css
@@ -0,0 +1,22 @@
+/* Wiki Rendered Styles */
+.wiki { line-height: 150%; font-family: arial, helvetica, sans-serif; font-size: small; }
+.wiki h1 { font-weight: bold; padding: 5px 0 0 0; margin: 0; font-size: 1.4em; }
+.wiki h2 { font-weight: bold; padding: 5px 0 0 0; margin: 0; font-size: 1.3em; }
+.wiki h3 { font-weight: bold; padding: 5px 0 0 0; margin: 0; font-size: 1.1em; }
+.wiki h4 { font-weight: normal; padding: 5px 0 0 0; margin: 0; font-size: 1.066em; }
+.wiki h5 { font-weight: normal; padding: 5px 0 0 0; margin: 0; font-size: 1.033em; }
+.wiki h6 { font-weight: normal; padding: 5px 0 0 0; margin: 0; font-size: 1.0em; }
+.wiki table { border-collapse: collapse; margin: 10px 0; font-size: small; }
+.wiki p { margin: 0; padding: 0; padding: 5px 0; }
+.wiki td { border: 1px solid #DDD; }
+.wiki #toc { border: 1px solid #AAA; background: #fff; padding: 5px; margin: 0 0 10px 10px; width: 25%; float: right; clear: right;}
+.wiki #toc h1 { font-weight: normal; font-size: 1.2em; padding: 0; }
+.wiki #toc a:hover { color: #00D; background: #FFD; }
+
+.wiki hr { height: 1px; color: #AAA; background-color: #AAA; border: 0; margin: 0 10px; }
+.wiki ul { padding: .5em 0 0 3em; margin: 0; }
+.wiki ol { padding: .5em 0 0 3em; margin: 0; }
+.wiki ul.quotelist { list-style: none; }
+.wiki tt { font-size: small; }
+.wiki img { border: 0; padding: 4px; }
+