Routine, Cache: generalize, reduce amount of copying in fast path

Implement a generalized Cache<K, V>. Two variants are provided: the
first one is based on std::map, using C++14-specific transparent
std::less<> and generalized std::map::find() to allow searching by tuple
of references. The second one is based on std::vector and O(n) lookup,
but remains C++11-compliant.

1 files changed, 2 insertions, 1 deletions

diff --git a/src/clblast.cpp b/src/clblast.cpp
index e0f8add2..35f3f552 100644
--- a/src/clblast.cpp
+++ b/src/clblast.cpp
@@ -2165,7 +2165,8 @@ template StatusCode PUBLIC_API Omatcopy<half>(const Layout, const Transpose,
 // Clears the cache of stored binaries
 StatusCode ClearCache() {
   try {
-    CacheClearAll();
+    ProgramCache::Instance().Invalidate();
+    BinaryCache::Instance().Invalidate();
   } catch (...) { return DispatchException(); }
   return StatusCode::kSuccess;
 }