/*
- * Copyright 2014 Facebook, Inc.
+ * Copyright 2016 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* limitations under the License.
*/
-#ifndef FOLLY_EVICTINGHASHMAP_H_
-#define FOLLY_EVICTINGHASHMAP_H_
+#pragma once
#include <algorithm>
#include <exception>
#include <boost/intrusive/list.hpp>
#include <boost/intrusive/unordered_set.hpp>
#include <boost/iterator/iterator_adaptor.hpp>
+#include <folly/portability/BitsFunctexcept.h>
namespace folly {
TValue& get(const TKey& key) {
auto it = find(key);
if (it == end()) {
- throw std::out_of_range("Key does not exist");
+ std::__throw_out_of_range("Key does not exist");
}
return it->second;
}
const TValue& getWithoutPromotion(const TKey& key) const {
auto it = findWithoutPromotion(key);
if (it == end()) {
- throw std::out_of_range("Key does not exist");
+ std::__throw_out_of_range("Key does not exist");
}
return it->second;
}
};
} // folly
-
-#endif /* FOLLY_EVICTINGHASHMAP_H_ */