If seeko() is not available use long int for off_t.

[pspp] / TODO

diff --git a/TODO b/TODO
index d3adff4a07a9c69394f39a0ff3a364b6950b7940..794ed43a4a50ea31999ffd824cf68eca7f03c6b3 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,10 +1,11 @@
-Time-stamp: <2004-03-29 15:22:28 blp>
+Time-stamp: <2004-05-31 13:14:29 blp>

 
 What Ben's working on now.
 --------------------------
 
 
 What Ben's working on now.
 --------------------------
 

-Procedures need to be modified to make multiple passes and use the moments
-class.
+Workspace exhaustion heuristics.
+
+Does SET work correctly?

 
 Update q2c input format description.
 
 
 Update q2c input format description.
 


@@ -13,11 +14,20 @@ Rewrite output subsystem, break into multiple processes.
 CROSSTABS needs to be re-examined.
 
 RANK, which is needed for the Wilcoxon signed-rank statistic, Mann-Whitney U,
 CROSSTABS needs to be re-examined.
 
 RANK, which is needed for the Wilcoxon signed-rank statistic, Mann-Whitney U,

-Kruskal-Wallis on NPAR TESTS and for Spearman (in another procedure).
+Kruskal-Wallis on NPAR TESTS and for Spearman and the Johnkheere trend test (in
+other procedures).

 
 TODO
 ----
 
 
 TODO
 ----
 

+Make valgrind --leak-check=yes --show-reachable=yes work.
+
+Add Boolean type.
+
+Add NOT_REACHED() macro.
+
+Add compression to casefiles.
+

 Expressions need to be able to abbreviate function names.  XDATE.QUARTER
 abbreviates to XDA.QUA, etc.
 
 Expressions need to be able to abbreviate function names.  XDATE.QUARTER
 abbreviates to XDA.QUA, etc.
 


@@ -42,8 +52,6 @@ strd.itl.nist.gov/div898/strd
 
 In debug mode hash table code should verify that collisions are reasonably low.
 
 
 In debug mode hash table code should verify that collisions are reasonably low.
 

-Use posix_fadvise(POSIX_FADV_SEQUENTIAL) where available.
-

 Use AFM files instead of Groff font files, and include AFMs for our default
 fonts with the distribution.
 
 Use AFM files instead of Groff font files, and include AFMs for our default
 fonts with the distribution.
 


@@ -368,7 +376,7 @@ For each case we read from the input program:
 3. Write case to replacement active file.
 4. Execute temporary transformations.  If these drop the case, stop.
 5. Post-TEMPORARY N OF CASES.  If we have already analyzed N cases, stop.
 3. Write case to replacement active file.
 4. Execute temporary transformations.  If these drop the case, stop.
 5. Post-TEMPORARY N OF CASES.  If we have already analyzed N cases, stop.

-6. FILTER, PROCESS IF.  If these drop the case, go to 5.
+6. FILTER, PROCESS IF.  If these drop the case, stop.

 7. Pass case to procedure.
 
 Ugly cases:
 7. Pass case to procedure.
 
 Ugly cases: