Timeline
May 17, 2010:
- 8:46 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:43 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:41 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:39 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:30 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:28 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:27 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:27 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:25 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:23 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:23 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:21 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:20 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:18 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:18 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:12 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:09 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:08 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:06 AM Examples/Fft2dHighpass edited by
- (diff)
- 7:57 AM Examples/Fft2dHighpass edited by
- (diff)
- 7:48 AM Examples/Fft2dHighpass edited by
- (diff)
May 7, 2010:
- 8:27 AM Ticket #17 (FFT: Check that it's being specialised for Manifest arrays.) created by
- If not then it'll be a lot slower than needed.
- 8:23 AM Ticket #15 (Allow FFT transforms of non-square matrices.) closed by
- wontfix
- 8:19 AM Ticket #14 (Add pictures and descriptions of each of the examples to the wiki.) closed by
- fixed
- 8:11 AM Examples/Laplace edited by
- (diff)
- 8:08 AM Examples/Laplace edited by
- (diff)
- 8:05 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:05 AM Examples/Fft2dHighpass edited by
- (diff)
- 8:05 AM Examples/Fft2dHighpass edited by
- (diff)
- 7:50 AM WikiStart edited by
- (diff)
- 7:50 AM WikiStart edited by
- (diff)
- 7:49 AM WikiStart edited by
- (diff)
- 7:48 AM Examples/Laplace edited by
- (diff)
- 7:37 AM Examples/Laplace edited by
- (diff)
- 7:37 AM Examples/Laplace edited by
- (diff)
- 7:36 AM Examples/Laplace edited by
- (diff)
- 7:36 AM Examples/Laplace edited by
- (diff)
- 7:33 AM Examples/Laplace edited by
- (diff)
- 7:31 AM Examples/Laplace created by
- 7:20 AM Examples/Fft2dHighpass edited by
- (diff)
- 7:18 AM WikiStart edited by
- (diff)
- 7:15 AM Examples/Fft2dHighpass edited by
- (diff)
- 7:08 AM Examples/Fft2dHighpass edited by
- (diff)
- 6:52 AM Examples/Fft2dHighpass created by
- 6:45 AM WikiStart edited by
- (diff)
- 6:38 AM WikiStart edited by
- (diff)
- 6:37 AM WikiStart edited by
- (diff)
- 6:34 AM WikiStart edited by
- (diff)
- 6:19 AM WikiStart edited by
- (diff)
- 4:46 AM Ticket #4 (Add traverse3-4) closed by
- fixed
- 4:46 AM Ticket #5 (Add interleave functions) closed by
- fixed
- 4:17 AM WikiStart edited by
- (diff)
- 4:14 AM Ticket #2 (Split core algorithms of examples into repa-algorithms package.) closed by
- fixed
- 4:14 AM Ticket #16 (Split ByteString fns into a separate package.) closed by
- fixed
- 4:14 AM Ticket #6 (Change to BSD3 License.) closed by
- fixed
- 4:13 AM Ticket #1 (Use BMP image format instead of PPM in examples) closed by
- fixed
- 4:13 AM WikiStart edited by
- (diff)
May 6, 2010:
- 3:32 AM Ticket #16 (Split ByteString fns into a separate package.) created by
- to remove "fake" dependencies on the main library.
Apr 30, 2010:
- 5:43 AM Ticket #15 (Allow FFT transforms of non-square matrices.) created by
- Just use a different lengthed roots vector for each axis. We might …
- 4:39 AM Ticket #14 (Add pictures and descriptions of each of the examples to the wiki.) created by
- 4:37 AM Ticket #13 (Optimise Repa.fromByteString to avoid bounds checks in ByteString) created by
- Should be able to use an intermediate CString for this.
- 4:35 AM Ticket #12 (Buildbots for automated performance regression testing.) created by
- Can we re-target the new GHC buildbot to do this?
- 4:34 AM Ticket #11 (Add Gaussian elimination example.) created by
- http://en.wikipedia.org/wiki/Gaussian_elimination We could do a basic …
- 4:32 AM Ticket #10 (Add fluid flow solver example.) created by
- The C code is already in the repo.
- 4:31 AM Ticket #9 (Add singular value decomposition example.) created by
- http://en.wikipedia.org/wiki/Singular_value_decomposition We should …
- 4:30 AM Ticket #8 (Add QR factorisation example.) created by
- http://en.wikipedia.org/wiki/QR_factorisation
- 4:22 AM Ticket #7 (Add bounds checking.) created by
- Adding bounds checks would interfere with program optimisation.
- 4:16 AM Ticket #6 (Change to BSD3 License.) created by
- It's MIT atm.
- 4:15 AM Ticket #5 (Add interleave functions) created by
- Want these for dealing with images in component form.
- 4:15 AM Ticket #4 (Add traverse3-4) created by
- Want these for dealing with images in component form.
- 4:13 AM Ticket #3 (Add FFTW C code for comparison.) created by
- Want to compare the speed of the FFT algorithm against a good C version.
- 4:12 AM Ticket #2 (Split core algorithms of examples into repa-algorithms package.) created by
- Especially the FFT algorithm, as it's generally useful.
- 4:11 AM Ticket #1 (Use BMP image format instead of PPM in examples) created by
- Reading and writing ASCII PPMs is way too slow.
- 4:05 AM WikiStart edited by
- (diff)
Apr 28, 2010:
Note: See TracTimeline
for information about the timeline view.
