diff options
| author | Mikkel Thestrup <mithe24@student.sdu.dk> | 2025-12-04 21:16:10 +0100 |
|---|---|---|
| committer | Mikkel Thestrup <mithe24@student.sdu.dk> | 2025-12-04 21:16:10 +0100 |
| commit | 5ca163f446420c97af8a4fa37f6d0281a84bfbcf (patch) | |
| tree | 492c98311142104f9df3b7a69b56d4c05a72efa8 /src/vector.h | |
| parent | 16527faeedfd8d3a27d3ac505d882f84bd34ed67 (diff) | |
| download | cycle-detector-5ca163f446420c97af8a4fa37f6d0281a84bfbcf.tar.gz cycle-detector-5ca163f446420c97af8a4fa37f6d0281a84bfbcf.zip | |
Less cringe docs
Diffstat (limited to '')
| -rw-r--r-- | src/vector.h | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/src/vector.h b/src/vector.h index 7320442..7deb8d3 100644 --- a/src/vector.h +++ b/src/vector.h @@ -2,8 +2,8 @@ * @file vector.h * @brief Dynamic array (vector) implementation. * @details This module provides a generic resizable array data structure - * that can store pointers to any data type. The vector automatically - * grows as elements are added, using a growth factor to amortize + * that can store pointers to any datatype. The vector automatically + * grows as elements are added, using a growth factor to mediate * reallocation costs. */ @@ -14,7 +14,7 @@ /** * @def VECTOR_INITIAL_CAPACITY - * @brief Initial capacity of a newly created vector. + * @brief Initial capacity of a vector. * @details The vector will be allocated with space for this many elements * when first created. This value is chosen to balance memory usage * and the number of early reallocations. @@ -26,7 +26,6 @@ * @brief Multiplicative factor for vector capacity growth. * @details When the vector reaches capacity and needs to grow, the new * capacity is calculated as (current_capacity * GROWTH_FACTOR). - * A factor of 2 provides good amortized performance. */ #define VECTOR_GROWTH_FACTOR 2 |