src: Updating code style to conform (more or less) to ndn-cxx style
Also, adding .clang-format that describes the applied style. Note that
this style requires a slightly customized version of clang-format.
diff --git a/utils/trie/lfu-policy.hpp b/utils/trie/lfu-policy.hpp
index c6d6108..897dc49 100644
--- a/utils/trie/lfu-policy.hpp
+++ b/utils/trie/lfu-policy.hpp
@@ -31,124 +31,125 @@
/**
* @brief Traits for LFU replacement policy
*/
-struct lfu_policy_traits
-{
+struct lfu_policy_traits {
/// @brief Name that can be used to identify the policy (for NS-3 object model and logging)
- static std::string GetName () { return "Lfu"; }
-
- struct policy_hook_type : public boost::intrusive::set_member_hook<> { double frequency; };
-
- template<class Container>
- struct container_hook
+ static std::string
+ GetName()
{
- typedef boost::intrusive::member_hook< Container,
- policy_hook_type,
- &Container::policy_hook_ > type;
+ return "Lfu";
+ }
+
+ struct policy_hook_type : public boost::intrusive::set_member_hook<> {
+ double frequency;
};
- template<class Base,
- class Container,
- class Hook>
- struct policy
- {
- static double& get_order (typename Container::iterator item)
+ template<class Container>
+ struct container_hook {
+ typedef boost::intrusive::member_hook<Container, policy_hook_type, &Container::policy_hook_>
+ type;
+ };
+
+ template<class Base, class Container, class Hook>
+ struct policy {
+ static double&
+ get_order(typename Container::iterator item)
{
- return static_cast<policy_hook_type*>
- (policy_container::value_traits::to_node_ptr(*item))->frequency;
+ return static_cast<policy_hook_type*>(policy_container::value_traits::to_node_ptr(*item))
+ ->frequency;
}
- static const double& get_order (typename Container::const_iterator item)
+ static const double&
+ get_order(typename Container::const_iterator item)
{
- return static_cast<const policy_hook_type*>
- (policy_container::value_traits::to_node_ptr(*item))->frequency;
+ return static_cast<const policy_hook_type*>(
+ policy_container::value_traits::to_node_ptr(*item))->frequency;
}
template<class Key>
- struct MemberHookLess
- {
- bool operator () (const Key &a, const Key &b) const
+ struct MemberHookLess {
+ bool
+ operator()(const Key& a, const Key& b) const
{
- return get_order (&a) < get_order (&b);
+ return get_order(&a) < get_order(&b);
}
};
- typedef boost::intrusive::multiset< Container,
- boost::intrusive::compare< MemberHookLess< Container > >,
- Hook > policy_container;
+ typedef boost::intrusive::multiset<Container,
+ boost::intrusive::compare<MemberHookLess<Container>>,
+ Hook> policy_container;
// could be just typedef
- class type : public policy_container
- {
+ class type : public policy_container {
public:
typedef policy policy_base; // to get access to get_order methods from outside
typedef Container parent_trie;
- type (Base &base)
- : base_ (base)
- , max_size_ (100)
+ type(Base& base)
+ : base_(base)
+ , max_size_(100)
{
}
inline void
- update (typename parent_trie::iterator item)
+ update(typename parent_trie::iterator item)
{
- policy_container::erase (policy_container::s_iterator_to (*item));
- get_order (item) += 1;
- policy_container::insert (*item);
+ policy_container::erase(policy_container::s_iterator_to(*item));
+ get_order(item) += 1;
+ policy_container::insert(*item);
}
inline bool
- insert (typename parent_trie::iterator item)
+ insert(typename parent_trie::iterator item)
{
- get_order (item) = 0;
+ get_order(item) = 0;
- if (max_size_ != 0 && policy_container::size () >= max_size_)
- {
- // this erases the "least frequently used item" from cache
- base_.erase (&(*policy_container::begin ()));
- }
+ if (max_size_ != 0 && policy_container::size() >= max_size_) {
+ // this erases the "least frequently used item" from cache
+ base_.erase(&(*policy_container::begin()));
+ }
- policy_container::insert (*item);
+ policy_container::insert(*item);
return true;
}
inline void
- lookup (typename parent_trie::iterator item)
+ lookup(typename parent_trie::iterator item)
{
- policy_container::erase (policy_container::s_iterator_to (*item));
- get_order (item) += 1;
- policy_container::insert (*item);
+ policy_container::erase(policy_container::s_iterator_to(*item));
+ get_order(item) += 1;
+ policy_container::insert(*item);
}
inline void
- erase (typename parent_trie::iterator item)
+ erase(typename parent_trie::iterator item)
{
- policy_container::erase (policy_container::s_iterator_to (*item));
+ policy_container::erase(policy_container::s_iterator_to(*item));
}
inline void
- clear ()
+ clear()
{
- policy_container::clear ();
+ policy_container::clear();
}
inline void
- set_max_size (size_t max_size)
+ set_max_size(size_t max_size)
{
max_size_ = max_size;
}
inline size_t
- get_max_size () const
+ get_max_size() const
{
return max_size_;
}
private:
- type () : base_(*((Base*)0)) { };
+ type()
+ : base_(*((Base*)0)){};
private:
- Base &base_;
+ Base& base_;
size_t max_size_;
};
};