Make to use tail recursive calls in L2lsplit.
More specifically, replace @ by rev_append and flatten+map by fold_left. On a file that has 11000 equations (normal.ec), I win a factor 4: 60s -> 15s
Showing
- Makefile 5 additions, 2 deletionsMakefile
- _oasis 3 additions, 0 deletions_oasis
- src/actionsDeps.ml 3 additions, 3 deletionssrc/actionsDeps.ml
- src/compile.ml 11 additions, 10 deletionssrc/compile.ml
- src/l2lSplit.ml 16 additions, 9 deletionssrc/l2lSplit.ml
- src/lic2soc.ml 8 additions, 8 deletionssrc/lic2soc.ml
- src/lv6MainArgs.ml 4 additions, 3 deletionssrc/lv6MainArgs.ml
- src/lv6version.ml 2 additions, 2 deletionssrc/lv6version.ml
- src/main.ml 4 additions, 2 deletionssrc/main.ml
- test/lus2lic.log.ref 30 additions, 50 deletionstest/lus2lic.log.ref
- test/lus2lic.sum 5 additions, 3 deletionstest/lus2lic.sum
- test/lus2lic.time 2 additions, 2 deletionstest/lus2lic.time
Loading
Please register or sign in to comment