 trunk/TODO 2011/06/13 04:50:55 1336
+++ trunk/TODO 2011/06/13 19:52:18 1338
@@ 7,13 +7,13 @@
Remove CL from compiler
[GLK:3] Add sequence types (needed for evals & evecs)
+[GLK:2] Add sequence types (needed for evals & evecs)
syntax
types: ty '{' INT '}'
value construction: '{' e1 ',' … ',' en '}'
indexing: e '{' e '}'
[GLK:4] evals & evecs for symmetric tensor[2,2] and
+[GLK:3] evals & evecs for symmetric tensor[2,2] and
tensor[3,3] (requires sequences)
ability to emit/track/record variables into dynamically resized
@@ 33,19 +33,7 @@
(currently only scalars & vectors). Want to add some regression tests
based on this and currently can't
[GLK:1] Add a clamp function, which takes three arguments; either
three scalars:
 clamp(lo, hi, x) = max(lo, min(hi, x))
or three vectors of the same size:
 clamp(lo, hi, [x,y]) = [max(lo[0], min(hi[0], x)),
 max(lo[1], min(hi[1], y))]
This would be useful in many current Diderot programs.
One question: clamp(x, lo, hi) is the argument order used in OpenCL
and other places, but clamp(lo, hi, x) is much more consistent with
lerp(lo, hi, x), hence GLK's preference
[DONE]

[GLK:2] Proper handling of stabilize method
+[GLK:1] Proper handling of stabilize method
allow "*" to represent "modulate": percomponent multiplication of
vectors, and vectors only (not tensors of order 2 or higher). Once
@@ 55,17 +43,17 @@
implicit type promotion of integers to reals where reals are
required (e.g. not exponentiation "^")
[GLK:5] Save Diderot output to nrrd, instead of "mip.txt"
+[GLK:4] Save Diderot output to nrrd, instead of "mip.txt"
For grid of strands, save to similarlyshaped array
For list of strands, save to long 1D (or 2D for nonscalar output) list
For ragged things (like tractography output), will need to save both
complete list of values, as well as list of start indices and lengths
to index into complete list
[GLK:6] Use of Teem's "hest" commandline parser for getting
+[GLK:5] Use of Teem's "hest" commandline parser for getting
any "input" variables that are not defined in the source file.
[GLK:7] ability to declare a field so that probe positions are
+[GLK:6] ability to declare a field so that probe positions are
*always* "inside"; with various ways of mapping the known image values
to nonexistant index locations. One possible syntax emphasizes that
there is a index mapping function that logically precedes convolution:
@@ 119,11 +107,6 @@
Allow integer exponentiation ("^2") to apply to square matrices,
to represent repeated matrix multiplication
Alow X *= Y, X /= Y, X += Y, X = Y to mean what they do in C,
provided that X*Y, X/Y, X+Y, XY are already supported.
Nearly every Diderot program would be simplified by this.
[DONE]

Put small 1D and 2D fields, when reconstructed specifically by tent
and when differentiation is not needed, into faster texture buffers.
test/illustvr.diderot is good example of program that uses multiple
@@ 168,7 +151,7 @@
(but we should only duplicate over the liverange of the result of the
conditional.
[GLK:8] Want: nontrivial field expressions & functions.
+[GLK:7] Want: nontrivial field expressions & functions.
scalar fields from scalar fields F and G:
field#0(2)[] X = (sin(F) + 1.0)/2;
field#0(2)[] X = F*G;