/kernel/trunk/generic/src/adt/btree.c |
---|
26,7 → 26,7 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
/** @addtogroup genericadt |
* @{ |
*/ |
557,7 → 557,7 |
/** Split full B-tree node and insert new key-value-right-subtree triplet. |
* |
* This function will split a node and return pointer to a newly created |
* This function will split a node and return a pointer to a newly created |
* node containing keys greater than or equal to the greater of medians |
* (or median) of the old keys and the newly added key. It will also write |
* the median key to a memory address supplied by the caller. |
998,6 → 998,5 |
printf("\n"); |
} |
/** @} |
/** @} |
*/ |
/kernel/trunk/generic/src/adt/hash_table.c |
---|
26,7 → 26,7 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
/** @addtogroup genericadt |
* @{ |
*/ |
173,6 → 173,5 |
} |
} |
/** @} |
/** @} |
*/ |
/kernel/trunk/generic/src/adt/list.c |
---|
26,7 → 26,7 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
/** @addtogroup genericadt |
* @{ |
*/ |
90,6 → 90,5 |
list_initialize(head2); |
} |
/** @} |
/** @} |
*/ |
/kernel/trunk/generic/src/adt/bitmap.c |
---|
26,7 → 26,7 |
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
*/ |
/** @addtogroup genericadt |
/** @addtogroup genericadt |
* @{ |
*/ |
/** |
185,6 → 185,5 |
} |
} |
/** @} |
/** @} |
*/ |