Add explicit C sorting and binary search #39
No reviewers
Labels
No labels
alpha-1
bug
ci
docs
duplicate
enhancement
help wanted
invalid
performance
phase-6
question
refactor
security
wontfix
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set
Reference
erix/lib-cstd!39
Loading…
Reference in a new issue
No description provided.
Delete branch "feature/explicit-c-sort-search"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Provide allocation-free qsort and bsearch companions with conventional and
prefixed C entry points. Iterative heapsort and binary search use only caller
arrays and comparison callbacks, with documented relocation, ABI and lifetime
contracts and no implicit runtime state.
Depends on #38. Refs #10. Tracks erix/integration#65.
WIP: Add explicit C sorting and binary searchto Add explicit C sorting and binary searchPrepared the merge history at b7495bce to remove duplicate upstream patches and integrate the feature on its prepared prerequisite history. The feature tree is unchanged.