beenull/ladybird

Fork 0

mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2024-11-22 07:30:19 +00:00

Commit graph

Author	SHA1	Message	Date
Mart G	9068398f6b	AK: Make single pivot quick_sort guarantee a max stack depth of log(n) - The change to quick_sort requires SimpleIterator to support assignment. - Rename quick_sort to single_pivot_quick_sort to make it easier to choose a specific implementation (not based on signature). - Ensure single_pivot_quick_sort does not copy the pivots - Expand sorts_without_copy test case to cover both single and dual pivot implementations.	2021-02-01 09:52:36 +01:00
Andreas Kling	a5982f8605	AK: Mark SimpleIterator::operator*() as ALWAYS_INLINE This gives the compiler enough information to optimize index validation when using range-for to iterate over a Vector, drastically reducing the cost of such loops.	2020-11-14 17:20:17 +01:00
asynts	1b3ecb01a5	AK: Add generic SimpleIterator class to replace VectorIterator.	2020-09-08 14:01:21 +02:00

Author

SHA1

Message

Date

Mart G

9068398f6b

AK: Make single pivot quick_sort guarantee a max stack depth of log(n)

- The change to quick_sort requires SimpleIterator to support
  assignment.
- Rename quick_sort to single_pivot_quick_sort to make it easier
  to choose a specific implementation (not based on signature).
- Ensure single_pivot_quick_sort does not copy the pivots
- Expand sorts_without_copy test case to cover both single and dual
  pivot implementations.

2021-02-01 09:52:36 +01:00

Andreas Kling

a5982f8605

AK: Mark SimpleIterator::operator*() as ALWAYS_INLINE

This gives the compiler enough information to optimize index validation
when using range-for to iterate over a Vector, drastically reducing the
cost of such loops.

2020-11-14 17:20:17 +01:00

asynts

1b3ecb01a5

AK: Add generic SimpleIterator class to replace VectorIterator.

2020-09-08 14:01:21 +02:00

3 commits