Today
-
r132
(Produce a better input spread across the mergers.) committed by nathanfiedler
- Produce a better input spread across the mergers.
Produce a better input spread across the mergers.
Yesterday
-
r131
(Edited some comments, enabled all tests, made some tests use...) committed by nathanfiedler
- Edited some comments, enabled all tests, made some tests use large dictwords set.
Edited some comments, enabled all tests, made some tests use large dictwords set.
-
r130
(Cleaned up the cruft; still not working for large sets.) committed by nathanfiedler
- Cleaned up the cruft; still not working for large sets.
Cleaned up the cruft; still not working for large sets.
-
r129
(Closer to working, but not correct for all inputs.) committed by nathanfiedler
- Closer to working, but not correct for all inputs.
Closer to working, but not correct for all inputs.
-
r128
(Add support for Observers to be notified when buffer becomes...) committed by nathanfiedler
- Add support for Observers to be notified when buffer becomes empty.
Add support for Observers to be notified when buffer becomes empty.
-
r127
(Not yet correctly working lazy funnelsort implementation, wi...) committed by nathanfiedler
- Not yet correctly working lazy funnelsort implementation, with some unit tests.
Not yet correctly working lazy funnelsort implementation, with some unit tests.
-
r126
(NetBeans 6.8 modified project files.) committed by nathanfiedler
- NetBeans 6.8 modified project files.
NetBeans 6.8 modified project files.
Last 30 days
-
r125
(Clarify comments for the buffer bounds.) committed by nathanfiedler
- Clarify comments for the buffer bounds.
Clarify comments for the buffer bounds.
-
r124
(Renamed getCapacity() method, added remaining() method.) committed by nathanfiedler
- Renamed getCapacity() method, added remaining() method.
Renamed getCapacity() method, added remaining() method.
-
Earlier this year
-
r123
(Broken implementation of lazy funnelsort.) committed by nathanfiedler
- Broken implementation of lazy funnelsort.
Broken implementation of lazy funnelsort.
-
r122
(Make parameterized sort method public.) committed by nathanfiedler
- Make parameterized sort method public.
Make parameterized sort method public.
-
r121
(Giving up on basic funnelsort for now.) committed by nathanfiedler
- Giving up on basic funnelsort for now.
Giving up on basic funnelsort for now.
-
r120
(Basic funnelsort implementation is working for some small te...) committed by nathanfiedler
- Basic funnelsort implementation is working for some small tests but is
failing on larger tests, most likely because a buffer is emptying and
the logic is not there to handle this case properly.
Attention will now be turned to the lazy funnelsort which is much more
practical in terms of implementation and speed.
Basic funnelsort implementation is working for some small tests but is
failing on larger tests, most likely because a buffer is emptying and
the logic is not there to handle this case properly.
Attention will now be turned to the lazy funnelsort which is much more
practical in terms of implementation and speed.
-
r119
(Still broken funnelsort, but using Comparable instead of Str...) committed by nathanfiedler
- Still broken funnelsort, but using Comparable instead of String.
Still broken funnelsort, but using Comparable instead of String.
-
r118
(A sometimes working funnel sort implementation.) committed by nathanfiedler
- A sometimes working funnel sort implementation.
A sometimes working funnel sort implementation.
-
r117
(Make the argument validation consistent throughout.) committed by nathanfiedler
- Make the argument validation consistent throughout.
Make the argument validation consistent throughout.
-
r116
(Greatly simplified funnelsort draft/untested implementation.) committed by nathanfiedler
- Greatly simplified funnelsort draft/untested implementation.
Greatly simplified funnelsort draft/untested implementation.
-
r115
(Updated NetBeans project metadata.) committed by nathanfiedler
- Updated NetBeans project metadata.
Updated NetBeans project metadata.
-
r114
(Implemented Collection and Queue interfaces.) committed by nathanfiedler
- Implemented Collection and Queue interfaces.
Implemented Collection and Queue interfaces.
-
r113
(More non-working funnelsort code.) committed by nathanfiedler
- More non-working funnelsort code.
More non-working funnelsort code.
-
r112
(An incomplete and woefully ass-backward implementation of fu...) committed by nathanfiedler
- An incomplete and woefully ass-backward implementation of funnelsort.
The processing of the string inputs needs to be done properly, with
k-mergers specifically written to read from a given range in the
input array. From there, "right" mergers need to take the circular
buffers that act as the outputs for the left mergers and merge those
as described in the Cache Oblivious Algorithms paper. Both the left
and right mergers need to recursively build out additional mergers
as appropriate.
Despite the broken and flawed design, committing the code so that
its development can be tracked over time.
An incomplete and woefully ass-backward implementation of funnelsort.
The processing of the string inputs needs to be done properly, with
k-mergers specifically written to read from a given range in the
input array. From there, "right" mergers need to take the circular
buffers that act as the outputs for the left mergers and merge those
as described in the Cache Oblivious Algorithms paper. Both the left
and right mergers need to recursively build out additional mergers
as appropriate.
Despite the broken and flawed design, committing the code so that
its development can be tracked over time.
-
r111
(A suggestion for the future.) committed by nathanfiedler
- A suggestion for the future.
A suggestion for the future.
-
r110
(Much simpler drain implementation, along with new move opera...) committed by nathanfiedler
- Much simpler drain implementation, along with new move operation.
Much simpler drain implementation, along with new move operation.
-
r109
(Adding an alternative insertion d-way merger implementation.) committed by nathanfiedler
- Adding an alternative insertion d-way merger implementation.
Adding an alternative insertion d-way merger implementation.
-
r108
(Clarify the parameter values for insertion sort.) committed by nathanfiedler
- Clarify the parameter values for insertion sort.
Clarify the parameter values for insertion sort.
-
r107
(Removing the useless toArray(T[]) as it is identical to drai...) committed by nathanfiedler
- Removing the useless toArray(T[]) as it is identical to drain().
Removing the useless toArray(T[]) as it is identical to drain().
-
r106
(Added toArray() for CircularBuffer, similar to drain().) committed by nathanfiedler
- Added toArray() for CircularBuffer, similar to drain().
Added toArray() for CircularBuffer, similar to drain().
-
r105
(Circular buffer now works within subset of existing array.) committed by nathanfiedler
- Circular buffer now works within subset of existing array.
Circular buffer now works within subset of existing array.
-
r104
(Working insertion d-way merge with 2-way optimization.) committed by nathanfiedler
- Working insertion d-way merge with 2-way optimization.
Working insertion d-way merge with 2-way optimization.
-
r103
(Working drain to another circular buffer.) committed by nathanfiedler
- Working drain to another circular buffer.
Working drain to another circular buffer.
-
r102
(Added two-way merge optimization for insertion d-way merge.) committed by nathanfiedler
- Added two-way merge optimization for insertion d-way merge.
Added two-way merge optimization for insertion d-way merge.
-
r101
(Added constructors for populating buffer with data.) committed by nathanfiedler
- Added constructors for populating buffer with data.
Added constructors for populating buffer with data.
-
r100
(Adding circular buffer and basic insertion d-way merge.) committed by nathanfiedler
- Adding circular buffer and basic insertion d-way merge.
Adding circular buffer and basic insertion d-way merge.
-
r99
(Adding bubblesort just to prove it is awful.) committed by nathanfiedler
- Adding bubblesort just to prove it is awful.
Adding bubblesort just to prove it is awful.
-
r98
(Replace the slower siftUp with O(n) siftDown algorithm.) committed by nathanfiedler
- Replace the slower siftUp with O(n) siftDown algorithm.
Replace the slower siftUp with O(n) siftDown algorithm.
-
r97
(Add the small data size test case.) committed by nathanfiedler
- Add the small data size test case.
Add the small data size test case.
-
r96
(Adding quicksort for comparison; more data generators for be...) committed by nathanfiedler
- Adding quicksort for comparison; more data generators for better testing.
Adding quicksort for comparison; more data generators for better testing.
-
r95
(Delegate to insertion sort for ranges of 16 and under.) committed by nathanfiedler
- Delegate to insertion sort for ranges of 16 and under.
Delegate to insertion sort for ranges of 16 and under.
-
r94
(Have burstsort delegate to multikey quicksort unconditionall...) committed by nathanfiedler
- Have burstsort delegate to multikey quicksort unconditionally.
Have burstsort delegate to multikey quicksort unconditionally.
-
r93
(Removing commented out integer sorts.) committed by nathanfiedler
- Removing commented out integer sorts.
Removing commented out integer sorts.
-
r92
(Adding micro benchmarks for in-place sort algorithms.) committed by nathanfiedler
- Adding micro benchmarks for in-place sort algorithms.
Adding micro benchmarks for in-place sort algorithms.
-
r91
(Change the descriptions of tests to be more intuitable.) committed by nathanfiedler
- Change the descriptions of tests to be more intuitable.
Change the descriptions of tests to be more intuitable.
-
r90
(Actually test Shellsort and not some other sort; fixing shel...) committed by nathanfiedler
- Actually test Shellsort and not some other sort; fixing shell sort.
Actually test Shellsort and not some other sort; fixing shell sort.
-
r89
(Adding all of the classic sort algorithms, which more to fol...) committed by nathanfiedler
- Adding all of the classic sort algorithms, which more to follow.
The intent is to benchmark all of them using small data sets to
determine which is best for sorting small subarrays, rather than
just assuming that insertion sort is the right answer.
Adding all of the classic sort algorithms, which more to follow.
The intent is to benchmark all of them using small data sets to
determine which is best for sorting small subarrays, rather than
just assuming that insertion sort is the right answer.
-
r88
(Streamline the benchmarking process.) committed by nathanfiedler
- Streamline the benchmarking process.
Streamline the benchmarking process.
-
r87
(Fix the redesigned burstsort so it does not sort the null bu...) committed by nathanfiedler
- Fix the redesigned burstsort so it does not sort the null bucket entries
which is a waste of cycles (consumed strings do not need to be sorted).
Fixed the redesigned burstsort to break up the copying of the null buckets
into separate jobs so they can be processed in parallel, otherwise you may
have a large number of elements being processed on a single thread and
nothing being done on the other threads.
Added many more unit tests to test all of this new code.
Fix the redesigned burstsort so it does not sort the null bucket entries
which is a waste of cycles (consumed strings do not need to be sorted).
Fixed the redesigned burstsort to break up the copying of the null buckets
into separate jobs so they can be processed in parallel, otherwise you may
have a large number of elements being processed on a single thread and
nothing being done on the other threads.
Added many more unit tests to test all of this new code.
-
r86
(Add clarifying comment about copy jobs.) committed by nathanfiedler
- Add clarifying comment about copy jobs.
Add clarifying comment about copy jobs.
-
r85
(Fix formatting of error message.) committed by nathanfiedler
- Fix formatting of error message.
Fix formatting of error message.
-
issue 21
(Experiment with various garbage collection options) Labels changed by nathanfiedler
-
Labels:
Priority-Low
−Priority-Medium
Labels:
Priority-Low
−Priority-Medium
|
