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