style cleanup
This commit is contained in:
@@ -80,7 +80,7 @@ void delete_MEM_CacheLimiter(MEM_CacheLimiterC *This);
|
||||
* @return CacheLimiterHandle to ref, unref, touch the managed object
|
||||
*/
|
||||
|
||||
MEM_CacheLimiterHandleC *MEM_CacheLimiter_insert(MEM_CacheLimiterC * This, void * data);
|
||||
MEM_CacheLimiterHandleC *MEM_CacheLimiter_insert(MEM_CacheLimiterC *This, void *data);
|
||||
|
||||
/**
|
||||
* Free objects until memory constraints are satisfied
|
||||
@@ -140,7 +140,7 @@ int MEM_CacheLimiter_get_refcount(MEM_CacheLimiterHandleC *handle);
|
||||
* @param handle of object
|
||||
*/
|
||||
|
||||
void * MEM_CacheLimiter_get(MEM_CacheLimiterHandleC *handle);
|
||||
void *MEM_CacheLimiter_get(MEM_CacheLimiterHandleC *handle);
|
||||
|
||||
void MEM_CacheLimiter_ItemPriority_Func_set(MEM_CacheLimiterC *This,
|
||||
MEM_CacheLimiter_ItemPriority_Func item_priority_func);
|
||||
|
@@ -59,9 +59,9 @@ public:
|
||||
}
|
||||
~MEM_CacheLimiterCClass();
|
||||
|
||||
handle_t * insert(void * data);
|
||||
handle_t * insert(void *data);
|
||||
|
||||
void destruct(void * data, list_t::iterator it);
|
||||
void destruct(void *data, list_t::iterator it);
|
||||
|
||||
cache_t * get_cache() {
|
||||
return &cache;
|
||||
@@ -76,7 +76,7 @@ private:
|
||||
|
||||
class MEM_CacheLimiterHandleCClass {
|
||||
public:
|
||||
MEM_CacheLimiterHandleCClass(void * data_, MEM_CacheLimiterCClass * parent_) :
|
||||
MEM_CacheLimiterHandleCClass(void *data_, MEM_CacheLimiterCClass *parent_) :
|
||||
data(data_),
|
||||
parent(parent_)
|
||||
{ }
|
||||
@@ -87,7 +87,7 @@ public:
|
||||
it = it_;
|
||||
}
|
||||
|
||||
void set_data(void * data_) {
|
||||
void set_data(void *data_) {
|
||||
data = data_;
|
||||
}
|
||||
|
||||
@@ -101,7 +101,7 @@ private:
|
||||
list_t::iterator it;
|
||||
};
|
||||
|
||||
handle_t *MEM_CacheLimiterCClass::insert(void * data)
|
||||
handle_t *MEM_CacheLimiterCClass::insert(void *data)
|
||||
{
|
||||
cclass_list.push_back(new MEM_CacheLimiterHandleCClass(data, this));
|
||||
list_t::iterator it = cclass_list.end();
|
||||
@@ -111,7 +111,7 @@ handle_t *MEM_CacheLimiterCClass::insert(void * data)
|
||||
return cache.insert(cclass_list.back());
|
||||
}
|
||||
|
||||
void MEM_CacheLimiterCClass::destruct(void * data, list_t::iterator it)
|
||||
void MEM_CacheLimiterCClass::destruct(void *data, list_t::iterator it)
|
||||
{
|
||||
data_destructor(data);
|
||||
cclass_list.erase(it);
|
||||
|
Reference in New Issue
Block a user