VecDeleteRangeFast
- Macro
- October 8, 2025
Table of Contents
VecDeleteRangeFast
VecDeleteRangeFast
Description
Delete items in given range [start, start + count) using faster implementation. Order preservation is not guaranteed
Success
return
Failure
Does not return
Usage example (Cross-references)
// Test VecDeleteRangeFast (fast delete range)
VecDeleteRangeFast(&vec, 0, 2); // Delete 10 and 20
// Check vector length after fast range deletion
- In
Vec.Remove.c:246
:
// Test VecDeleteRangeFast
bool test_vec_delete_range_fast(void) {
WriteFmtLn("Testing VecDeleteRangeFast");
// Create a vector of integers
- In
Vec.Remove.c:278
:
}
VecDeleteRangeFast(&vec, start_index, count);
// Print after state
- In
Vec.Remove.c:697
:
int fast_start = 2;
int fast_count = 3;
VecDeleteRangeFast(&vec, fast_start, fast_count);
// Print after state
- In
Vec.Remove.c:774
:
// Test R-value fast delete range operation
VecDeleteRangeFast(&vec, 2, 3);
// Print after state
- In
VecInt.c:250
:
uint64_t len = VecLen(vec);
if (len > 0 && start < len && count > 0 && start + count <= len) {
VecDeleteRangeFast(vec, start, count);
}
break;
- In
VecStr.c:263
:
size_t index = extract_u32(data, offset, size) % VecLen(vec);
size_t count = extract_u32(data, offset, size) % (VecLen(vec) - index + 1);
VecDeleteRangeFast(vec, index, count);
}
break;
- In
VecCharPtr.c:273
:
size_t index = extract_u32(data, offset, size) % VecLen(vec);
size_t count = extract_u32(data, offset, size) % (VecLen(vec) - index + 1);
VecDeleteRangeFast(vec, index, count);
}
break;