Mirroristas/rathena
2
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

* Added a generic binary heap implementation based on defines. (round 2)

Browse Source 
git-svn-id: https://svn.code.sf.net/p/rathena/svn/trunk@13464 54d463be-8e91-2dee-dedb-b68131a5f0ec
This commit is contained in:
FlavioJS 2009-01-21 00:35:33 +00:00
parent dfe2b1edaa
commit 013d104eff
1 changed files with 32 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
src/common/db.h
View File

@ -1288,12 +1288,11 @@ void linkdb_final ( struct linkdb_node** head );
size_t _i_ = VECTOR_LENGTH(__heap); \ size_t _i_ = VECTOR_LENGTH(__heap); \
VECTOR_PUSH(__heap,__val); /* insert at end */ \ VECTOR_PUSH(__heap,__val); /* insert at end */ \
while( _i_ ) \ while( _i_ ) \
{ /* restore heap property */ \ { /* restore heap property in parents */ \
size_t _parent_ = (_i_-1)/2; \ size_t _parent_ = (_i_-1)/2; \
if( __topcmp(VECTOR_INDEX(__heap,_parent_),__val) < 0 ) \ if( __topcmp(VECTOR_INDEX(__heap,_parent_),VECTOR_INDEX(__heap,_i_)) < 0 ) \
break; /* done */ \ break; /* done */ \
VECTOR_INDEX(__heap,_i_) = VECTOR_INDEX(__heap,_parent_); \ swap(VECTOR_INDEX(__heap,_parent_),VECTOR_INDEX(__heap,_i_)); \
VECTOR_INDEX(__heap,_parent_) = __val; \
_i_ = _parent_; \ _i_ = _parent_; \
} \ } \
}while(0) }while(0)
@ -1310,12 +1309,35 @@ void linkdb_final ( struct linkdb_node** head );
/// ///
/// @param __heap Binary heap /// @param __heap Binary heap
/// @param __topcmp Comparator /// @param __topcmp Comparator
#define BHEAP_POP(__heap,__topcmp) \ #define BHEAP_POP(__heap,__topcmp) BHEAP_POPINDEX(__heap,0,__topcmp)
/// Removes the target value of the heap. (using the '=' operator)
/// Assumes the index exists.
///
/// The comparator takes two values as arguments, returns:
/// - negative if the first value is on the top
/// - positive if the second value is on the top
/// - 0 if they are equal
///
/// @param __heap Binary heap
/// @param __idx Index
/// @param __topcmp Comparator
#define BHEAP_POPINDEX(__heap,__idx,__topcmp) \
do{ \ do{ \
size_t _i_ = 0; \ size_t _i_ = __idx; \
VECTOR_INDEX(__heap,0) = VECTOR_POP(__heap); /* put last at top */ \ VECTOR_INDEX(__heap,__idx) = VECTOR_POP(__heap); /* put last at index */ \
while( _i_ ) \
{ /* restore heap property in parents */ \
size_t _parent_ = (_i_-1)/2; \
if( __topcmp(VECTOR_INDEX(__heap,_parent_),VECTOR_INDEX(__heap,_i_)) < 0 ) \
break; /* done */ \
swap(VECTOR_INDEX(__heap,_parent_),VECTOR_INDEX(__heap,_i_)); \
_i_ = _parent_; \
} \
while( _i_ < VECTOR_LENGTH(__heap) ) \ while( _i_ < VECTOR_LENGTH(__heap) ) \
{ /* restore heap property */ \ { /* restore heap property in childs */ \
size_t _lchild_ = _i_*2 + 1; \ size_t _lchild_ = _i_*2 + 1; \
size_t _rchild_ = _i_*2 + 2; \ size_t _rchild_ = _i_*2 + 2; \
if( (_lchild_ >= VECTOR_LENGTH(__heap) || __topcmp(VECTOR_INDEX(__heap,_i_),VECTOR_INDEX(__heap,_lchild_)) <= 0) && \ if( (_lchild_ >= VECTOR_LENGTH(__heap) || __topcmp(VECTOR_INDEX(__heap,_i_),VECTOR_INDEX(__heap,_lchild_)) <= 0) && \
@ -1323,14 +1345,12 @@ void linkdb_final ( struct linkdb_node** head );
break; /* done */ \ break; /* done */ \
else if( _rchild_ >= VECTOR_LENGTH(__heap) || __topcmp(VECTOR_INDEX(__heap,_lchild_),VECTOR_INDEX(__heap,_rchild_)) <= 0 ) \ else if( _rchild_ >= VECTOR_LENGTH(__heap) || __topcmp(VECTOR_INDEX(__heap,_lchild_),VECTOR_INDEX(__heap,_rchild_)) <= 0 ) \
{ /* left child */ \ { /* left child */ \
VECTOR_INDEX(__heap,_i_) = VECTOR_INDEX(__heap,_lchild_); \ swap(VECTOR_INDEX(__heap,_i_),VECTOR_INDEX(__heap,_lchild_)); \
VECTOR_INDEX(__heap,_lchild_) = VECTOR_INDEX(__heap,VECTOR_LENGTH(__heap)); \
_i_ = _lchild_; \ _i_ = _lchild_; \
} \ } \
else \ else \
{ /* right child */ \ { /* right child */ \
VECTOR_INDEX(__heap,_i_) = VECTOR_INDEX(__heap,_rchild_); \ swap(VECTOR_INDEX(__heap,_i_),VECTOR_INDEX(__heap,_rchild_)); \
VECTOR_INDEX(__heap,_rchild_) = VECTOR_INDEX(__heap,VECTOR_LENGTH(__heap)); \
_i_ = _rchild_; \ _i_ = _rchild_; \
} \ } \
} \ } \