summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
...
* Tokenize identifiers.Tavian Barnes2009-10-282-6/+44
|
* Fix line calculation in comment tokenizer.Tavian Barnes2009-10-281-0/+1
|
* Split some tokenizing work out into helper functions.Tavian Barnes2009-10-281-56/+82
|
* Ignore comments in tokenizer.Tavian Barnes2009-10-274-6/+87
|
* Add line and column numbers to tokens.Tavian Barnes2009-10-272-1/+10
|
* Tokenize numeric values.Tavian Barnes2009-10-275-4/+77
|
* Support more symbols in tokenizer.Tavian Barnes2009-10-276-34/+93
|
* Make tokenizer a bit more robust.Tavian Barnes2009-10-271-3/+19
|
* Use the parallel-tests automake option.Tavian Barnes2009-10-273-4/+8
|
* Fix tokenizer test in VPATH build.Tavian Barnes2009-10-273-3/+4
|
* New tokenizer test.Tavian Barnes2009-10-275-5/+48
|
* New mmap-based tokenizer.Tavian Barnes2009-10-271-13/+33
|
* Begin tokenizer.Tavian Barnes2009-10-264-5/+197
|
* Add some command-line options to `dimension' program.Tavian Barnes2009-10-261-1/+64
|
* Begin work on `dimension' client program.Tavian Barnes2009-10-265-0/+56
|
* Major dmnsn_kD_splay_search() optimization.Tavian Barnes2009-10-261-19/+21
| | | | | | | | At each level of recursion, we have to go down the right branch if it exists. But if we do this before we test the current node and the left branch, we can eliminate those tests in the likely case that we find a closer object in the geometrically larger right subtree. This gives about a 2X speed improvement according to `make bench'.
* Clean up some dmnsn_new_*() functions.Tavian Barnes2009-10-264-64/+37
| | | | | Rather than special-case every failed memory allocation, just make dmnsn_delete_*() more robust and call it.
* Delete empty cube.c.Tavian Barnes2009-10-261-23/+0
|
* Call dmnsn_done_progress() later in dmnsn_finish_progress().Tavian Barnes2009-10-261-3/+2
|
* Don't check if it's too late to add canvas optimizers.Tavian Barnes2009-10-264-26/+6
| | | | This fixes some errors displayed by concurrency checkers like helgrind and drd.
* Fix some concurrency mistakes.Tavian Barnes2009-10-262-12/+31
| | | | TODO: eliminate the too_late field on canvases.
* Speed up dmnsn_kD_splay_deepest_recursive() a bit.Tavian Barnes2009-10-261-8/+7
|
* Fix make distcheck.Tavian Barnes2009-10-252-4/+9
| | | | | Tests and benchmarks were using $(top_srcdir) instead of $(top_builddir) to refer to libraries, and PNG files were not being cleaned.
* Properly generate random bounding boxes in kD splay tree benchmark.Tavian Barnes2009-10-251-13/+34
|
* Benchmark dmnsn_kD_splay().Tavian Barnes2009-10-251-0/+45
|
* Upgrade benchmarks to latest libsandglass.Tavian Barnes2009-10-233-132/+53
|
* Add kD splay tree benchmark.Tavian Barnes2009-10-232-2/+139
|
* Fix NULL assignment to integer value in test library.Tavian Barnes2009-10-221-1/+1
|
* New geometric operation benchmarks.Tavian Barnes2009-10-222-2/+187
|
* Fix array benchmark.Tavian Barnes2009-10-221-1/+1
|
* More memory handling improvements.Tavian Barnes2009-10-203-59/+56
|
* Fix some memory leaks.Tavian Barnes2009-10-194-14/+30
| | | | | dmnsn_delete_pigment() was not using the free_fn, and kD splay trees were not being deleted after raytracing finished.
* Improve garbage handling of dmnsn_delete_object().Tavian Barnes2009-10-193-15/+5
|
* Give the cube a black pigment in the default test scene.Tavian Barnes2009-10-191-1/+26
|
* Allow custom fatal error handlers.Tavian Barnes2009-10-182-2/+52
|
* Fix ray-box intersection test.Tavian Barnes2009-10-131-4/+4
|
* Some GL test fixes.Tavian Barnes2009-10-131-1/+4
|
* Re-add GL test case.Tavian Barnes2009-10-132-1/+131
|
* Use convenience library for tests.Tavian Barnes2009-10-131-5/+9
|
* Remove unused variable from dmnsn_kD_splay_search_recursive().Tavian Barnes2009-10-091-1/+0
|
* Use kD splay trees in raytrace engine.Tavian Barnes2009-10-091-28/+29
|
* kD splay tree fixes, and new dmnsn_kD_splay_tree type.Tavian Barnes2009-10-093-203/+176
|
* kD splay tree fixes.Tavian Barnes2009-10-091-4/+8
|
* Typo fixes in kD_splay_tree.c.Tavian Barnes2009-10-071-8/+8
|
* Test object's bounding boxes too in dmnsn_kD_splay_search().Tavian Barnes2009-10-071-13/+30
|
* Implement search for kD splay trees.Tavian Barnes2009-10-073-72/+176
|
* Add ray - bounding-box intersection test function.Tavian Barnes2009-10-071-0/+72
|
* Call kD splay children `contains' and `container'.Tavian Barnes2009-10-073-39/+39
|
* Re-add PNG test.Tavian Barnes2009-10-065-2/+585
|
* Calculate bounding boxes for spheres and cubes.Tavian Barnes2009-10-061-0/+4
|