Programming Languages Research Group: Git

author	stephey <stephey>
	Thu, 31 Mar 2011 09:04:04 +0000 (09:04 +0000)
committer	stephey <stephey>
	Thu, 31 Mar 2011 09:04:04 +0000 (09:04 +0000)
commit	5cf014156965d7b21ea7a7ca56013ebd7b55059a
tree	4fb0052b1145e09d866731572a67693b40bb6de2	tree \| snapshot
parent	8082d9728781e75918db402c86cdb854f5cb2ff6	commit \| diff

Tried to squeeze out more performance by changing the LinkedLIsts in the Delaunay port to vectors (which is closer to the original implementation of ArrayLists). Seems not to make an appreciable difference though...

Added Vector.clone() and VectorIterator

Irvine Research Compiler

RSS Atom

Robust/src/Benchmarks/oooJava/DelaunayRefinement/DirectedGraph.java		diff \| blob \| history
Robust/src/Benchmarks/oooJava/DelaunayRefinement/GraphNode.java		diff \| blob \| history
Robust/src/Benchmarks/oooJava/DelaunayRefinement/Mesh.java		diff \| blob \| history
Robust/src/Benchmarks/oooJava/DelaunayRefinement/SerialDelaunayRefinement.java		diff \| blob \| history
Robust/src/Benchmarks/oooJava/DelaunayRefinement/runs		diff \| blob \| history
Robust/src/ClassLibrary/Vector.java		diff \| blob \| history
Robust/src/ClassLibrary/VectorIterator.java	[new file with mode: 0644]	blob