Difference between revisions of "Part 3 Test Files"
From CMSC 420
Ben Zoller (talk | contribs) |
|||
| (8 intermediate revisions by 3 users not shown) | |||
| Line 4: | Line 4: | ||
If you have downloaded and ran someone's test files, mark on the wiki that you verify if outputs correctly. If you have a problem with a test file, mark it on the wiki and discuss it on the forum or possibly on the talk page (although more people would probably see it on the CS forum). | If you have downloaded and ran someone's test files, mark on the wiki that you verify if outputs correctly. If you have a problem with a test file, mark it on the wiki and discuss it on the forum or possibly on the talk page (although more people would probably see it on the CS forum). | ||
| + | |||
| + | ==Jesse's Unit Tests== | ||
| + | *Tests the HexTrie Bplus and Bstar for put and remove. Verifies the HexTrie has the correct keys/guides/values/children in each node. Don't use Save As... Just click on the link. | ||
| + | ***[[Jesse_HexTrie_Junit_Test]] | ||
| + | You need to add in this method to your HexTrie to get the tests to work: | ||
| + | <pre> | ||
| + | public Node<K,V> getRootNode(){ | ||
| + | return root.me; | ||
| + | } | ||
| + | </pre> | ||
== Chris Conroy's Test Files == | == Chris Conroy's Test Files == | ||
| Line 28: | Line 38: | ||
**** Conroy says: new versions as of 3:15am Wed. Should be correct now. | **** Conroy says: new versions as of 3:15am Wed. Should be correct now. | ||
| − | ** | + | ** Nearest City To Road tester. Checks for cities along the boundary, error cases, and name ordering for ties. (Note, after passing this test my release score went up 20 points, so it at least constitutes a subset of valid nearestCityToRoad tests) |
| − | (Note, after passing this test my release score went up 20 points, so it at least constitutes a subset of valid nearestCityToRoad tests) | + | *** Verified by: Ben |
***[http://www.glue.umd.edu/~cconroy/420/conroyNearestCityToRoad.input.xml Nearest City To Road Input] | ***[http://www.glue.umd.edu/~cconroy/420/conroyNearestCityToRoad.input.xml Nearest City To Road Input] | ||
***[http://www.glue.umd.edu/~cconroy/420/conroyNearestCityToRoad.output.xml Nearest City To Road Output] | ***[http://www.glue.umd.edu/~cconroy/420/conroyNearestCityToRoad.output.xml Nearest City To Road Output] | ||
| Line 36: | Line 46: | ||
== J Stuckey's Test Files == | == J Stuckey's Test Files == | ||
** Name Range test | ** Name Range test | ||
| + | *** Verified by: Ben | ||
***[http://www.wam.umd.edu/~jstuckey/nameRange.input.xml Name Range input] | ***[http://www.wam.umd.edu/~jstuckey/nameRange.input.xml Name Range input] | ||
| − | ***[http://www.wam.umd.edu/~jstuckey/nameRange. | + | ***[http://www.wam.umd.edu/~jstuckey/nameRange.output.xml Name Range output] |
==Mike's Java PMQuadtree Input Generator== | ==Mike's Java PMQuadtree Input Generator== | ||
Latest revision as of 02:22, 16 May 2012
Upload and post Part 3 test files here.
You will need to right-click these and do a Save As... just copying/pasting them from your browser will not work.
If you have downloaded and ran someone's test files, mark on the wiki that you verify if outputs correctly. If you have a problem with a test file, mark it on the wiki and discuss it on the forum or possibly on the talk page (although more people would probably see it on the CS forum).
Jesse's Unit Tests[edit]
- Tests the HexTrie Bplus and Bstar for put and remove. Verifies the HexTrie has the correct keys/guides/values/children in each node. Don't use Save As... Just click on the link.
You need to add in this method to your HexTrie to get the tests to work:
public Node<K,V> getRootNode(){
return root.me;
}
Chris Conroy's Test Files[edit]
- Verified by Chris (Updated Nearest/Range Road test & Added NearestCityToRoad Test 11:40pm, Tues)
- See This Unit Test if you want a quick way of regression testing against part 2 stuff.
- Test case taken from the PM powerpoint lecture. I stole the cheesy title as well.
- Verified by: Ben
- All Your Base Input
- All Your Base Output
- All Your Base Image0
- All Your Base Image1
- Test case taken from the PM powerpoint lecture. I stole the cheesy title as well.
- Basic Range and Nearest Road test. Helped me figure out the problems with mine. It's not exhaustive but gets a few edge cases in there.
- Verified by: Ben
- Simple Range Road Test Input
- Simple Range Road Test Output
- Conroy says: new versions as of 3:15am Wed. Should be correct now.
- Basic Range and Nearest Road test. Helped me figure out the problems with mine. It's not exhaustive but gets a few edge cases in there.
- Nearest City To Road tester. Checks for cities along the boundary, error cases, and name ordering for ties. (Note, after passing this test my release score went up 20 points, so it at least constitutes a subset of valid nearestCityToRoad tests)
- Verified by: Ben
- Nearest City To Road Input
- Nearest City To Road Output
- It works for me. For those who skimmed through the spec (like me), remember to not include that road in the search. I was stuck on that for a while. :/
- Nearest City To Road tester. Checks for cities along the boundary, error cases, and name ordering for ties. (Note, after passing this test my release score went up 20 points, so it at least constitutes a subset of valid nearestCityToRoad tests)
J Stuckey's Test Files[edit]
- Name Range test
- Verified by: Ben
- Name Range input
- Name Range output
- Name Range test
Mike's Java PMQuadtree Input Generator[edit]
- I made a program that will generate some tests files for you. It can test most things in a PM Quadtree except for shortest path, but it wouldn't be that hard for you to add a test for that into your program.
- I also put up some examples with my output. I'm passing the release tests for part 3 so hypothetically these outputs are all correct.
- Regards, Mike Bentley
