dimension.git - A high-performance photo-realistic 3-D renderer

	Commit message (Collapse)	Author	Age	Files	Lines
*	Parse arithmetic expressions.	Tavian Barnes	2009-11-04	5	-67/+280
\|
*	Handle spheres.	Tavian Barnes	2009-11-04	6	-26/+139
\|
*	Implement dmnsn_print_astree_sexpr().	Tavian Barnes	2009-10-31	5	-25/+114
\|
*	Initialize `i' in dmnsn_parse().	Tavian Barnes	2009-10-30	1	-0/+1
\|
*	Remove progress bars from tests, as parallel-tests hides output anyway.	Tavian Barnes	2009-10-30	4	-212/+75
\|
*	Don't flip boxes that are specified backwards.	Tavian Barnes	2009-10-30	1	-3/+6
\|
*	Refactor parsing and realization a bit.	Tavian Barnes	2009-10-30	3	-29/+49
\|
*	Fix dmnsn_kD_splay_node_swallow() typo.	Tavian Barnes	2009-10-30	1	-4/+4
\|
*	(Sort of) realize boxes.	Tavian Barnes	2009-10-30	2	-2/+71
\| \| \| \|	We now have a working rendering from an SDL input, kinda!
*	Don't flip optimized PNG writes.	Tavian Barnes	2009-10-30	1	-2/+3
\|
*	(Sort of) parse boxes.	Tavian Barnes	2009-10-30	10	-27/+360
\|
*	Skeleton of parser and realizer.	Tavian Barnes	2009-10-29	6	-9/+169
\|
*	Make sure we die on critical dmnsn_error()'s.	Tavian Barnes	2009-10-29	1	-0/+2
\|
*	Correctly tokenize <=, >= and !=.	Tavian Barnes	2009-10-29	4	-22/+55
\|
*	Support all POV-Ray keywords.	Tavian Barnes	2009-10-29	4	-11/+1284
\|
*	Correct locale "transaction" handling in dmnsn_tokenize().	Tavian Barnes	2009-10-29	1	-8/+8
\|
*	Rename DMNSN_T_EXCLAMATION to DMNSN_T_BANG.	tavianator	2009-10-29	2	-43/+43
\|
*	Refactor tokenizer a bit.	tavianator	2009-10-29	5	-28/+93
\|
*	Don't modify lines, cols, or next in tokenizer helper functions.	Tavian Barnes	2009-10-29	1	-175/+207
\|
*	Even more tokenizer work.	Tavian Barnes	2009-10-29	3	-117/+96
\| \| \| \| \| \|	The tokenizer is now able to tokenize all of POV-Ray 3.6's include files. It turns out that some #includes may be dynamic (ex. with #writes beforehand), so the tokenizer can't directly perform includes - the executor must do this.
*	Prefix tokens with DMNSN_T_.	Tavian Barnes	2009-10-29	2	-143/+143
\|
*	Tokenize all language directives.	Tavian Barnes	2009-10-29	2	-5/+77
\|
*	Complete string parsing.	Tavian Barnes	2009-10-29	3	-9/+71
\|
*	Set the locale to `C' during tokenization.	Tavian Barnes	2009-10-28	1	-5/+27
\|
*	Search in the same path as the current file for #includes.	Tavian Barnes	2009-10-28	2	-8/+28
\|
*	Split tokenizer.sh into multiple tests.	Tavian Barnes	2009-10-28	7	-48/+138
\|
*	Store source filename in tokens, give better diagnostics.	Tavian Barnes	2009-10-28	3	-49/+76
\|
*	Make '#include' work.	Tavian Barnes	2009-10-28	2	-1/+34
\|
*	Tokenize strings and language directives.	Tavian Barnes	2009-10-28	5	-3/+211
\|
*	Add a vector to numeric tokenizer test.	tavianator	2009-10-28	2	-1/+4
\|
*	Tokenize keywords.	Tavian Barnes	2009-10-28	5	-13/+89
\|
*	Tokenize identifiers.	Tavian Barnes	2009-10-28	2	-6/+44
\|
*	Fix line calculation in comment tokenizer.	Tavian Barnes	2009-10-28	1	-0/+1
\|
*	Split some tokenizing work out into helper functions.	Tavian Barnes	2009-10-28	1	-56/+82
\|
*	Ignore comments in tokenizer.	Tavian Barnes	2009-10-27	4	-6/+87
\|
*	Add line and column numbers to tokens.	Tavian Barnes	2009-10-27	2	-1/+10
\|
*	Tokenize numeric values.	Tavian Barnes	2009-10-27	5	-4/+77
\|
*	Support more symbols in tokenizer.	Tavian Barnes	2009-10-27	6	-34/+93
\|
*	Make tokenizer a bit more robust.	Tavian Barnes	2009-10-27	1	-3/+19
\|
*	Use the parallel-tests automake option.	Tavian Barnes	2009-10-27	3	-4/+8
\|
*	Fix tokenizer test in VPATH build.	Tavian Barnes	2009-10-27	3	-3/+4
\|
*	New tokenizer test.	Tavian Barnes	2009-10-27	5	-5/+48
\|
*	New mmap-based tokenizer.	Tavian Barnes	2009-10-27	1	-13/+33
\|
*	Begin tokenizer.	Tavian Barnes	2009-10-26	4	-5/+197
\|
*	Add some command-line options to `dimension' program.	Tavian Barnes	2009-10-26	1	-1/+64
\|
*	Begin work on `dimension' client program.	Tavian Barnes	2009-10-26	5	-0/+56
\|
*	Major dmnsn_kD_splay_search() optimization.	Tavian Barnes	2009-10-26	1	-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 Barnes	2009-10-26	4	-64/+37
\| \| \| \| \|	Rather than special-case every failed memory allocation, just make dmnsn_delete_*() more robust and call it.
*	Delete empty cube.c.	Tavian Barnes	2009-10-26	1	-23/+0
\|
*	Call dmnsn_done_progress() later in dmnsn_finish_progress().	Tavian Barnes	2009-10-26	1	-3/+2
\|