VecDeleteFast
- Macro
- October 8, 2025
Table of Contents
VecDeleteFast
VecDeleteFastDescription
Delete item at given index using faster implementation. Order preservation is not guaranteed
Success
return
Failure
Does not return
Usage example (Cross-references)
// Test VecDeleteFast (fast delete)
// This replaces the deleted element with the last element
VecDeleteFast(&vec, 2); // Delete 30
// Check vector length after fast deletion
- In
Vec.Remove.c:173:
// Test VecDeleteFast function
bool test_vec_delete_fast(void) {
WriteFmtLn("Testing VecDeleteFast");
// Create a vector of integers
- In
Vec.Remove.c:190:
// Delete element at index 1 (value 20) using fast delete
VecDeleteFast(&vec, 1);
// Check new length
- In
Vec.Remove.c:465:
int valueToBeDeleted = VecAt(&vec, fast_index);
int lastValue = VecAt(&vec, vec.length - 1); // Should move to deleted position
VecDeleteFast(&vec, fast_index);
// Print after state
- In
Vec.Remove.c:547:
// Test R-value fast delete operation
VecDeleteFast(&vec, 2);
// Print after state
- In
VecInt.c:375:
uint16_t idx = extract_u16(data, offset, size);
if (idx < VecLen(vec)) {
VecDeleteFast(vec, idx);
}
break;
- In
VecStr.c:402:
if (VecLen(vec) > 0 && *offset + 4 <= size) {
size_t index = extract_u32(data, offset, size) % VecLen(vec);
VecDeleteFast(vec, index);
}
break;
- In
VecCharPtr.c:438:
if (VecLen(vec) > 0 && *offset + 4 <= size) {
size_t index = extract_u32(data, offset, size) % VecLen(vec);
VecDeleteFast(vec, index);
}
break;