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). |
| + | |
| + | == Colin's Test Files == |
| + | These files have been verified by [[User:Ben Zoller]] [[User:Cconroy]] [[User:vl]]. |
| + | *deleteCity |
| + | **[[Media:Part1.colin.deleteCity.input.xml]] |
| + | **[[Media:Part1.colin.deleteCity.output.xml]] |
| + | *listCities |
| + | **[[Media:Part1.colin.listCities.input.xml]] |
| + | **[[Media:Part1.colin.listCities.output.xml]] |
| + | *mapCity |
| + | **[[Media:Part1.colin.mapCity.input.xml]] |
| + | **[[Media:Part1.colin.mapCity.output.xml]] |
| + | *unmapCity |
| + | **[[Media:Part1.colin.unmapCity.input.xml]] |
| + | **[[Media:Part1.colin.unmapCity.output.xml]] |
| + | *printPRQuadtree |
| + | **[[Media:Part1.colin.printPRQuadtree.input.xml]] |
| + | **[[Media:Part1.colin.printPRQuadtree.output.xml]] |
| + | *printPRQuadtree2 |
| + | **[[Media:Part1.colin.printPRQuadtree2.input.xml]] |
| + | **[[Media:Part1.colin.printPRQuadtree2.output.xml]] |
| + | |
| + | == John Demme's Test Files == |
| + | These files have been verified by John Demme, [[User:Cconroy]] [[User:vl]]. |
| + | |
| + | *nearest - A basic test of nearestCity |
| + | **[[Media:Part1.john.nearest.input.xml]] |
| + | **[[Media:Part1.john.nearest.output.xml]] |
| + | *fatalError1 - A sanity check for outputting a fatal error |
| + | **[[Media:Part1.john.fatalError1.input.xml]] |
| + | **[[Media:Part1.john.fatalError1.output.xml]] |
| + | *range1 - rangeCities sanity and boundary checking |
| + | **[[Media:Part1.john.range1.input.xml]] |
| + | **[[Media:Part1.john.range1.output.xml]] |
| + | |
| + | == Andrew's Test Files == |
| + | Verified by [[User:Cconroy]] [[User:vl]] |
| + | |
| + | A modified version of Colin P's deleteCity. It deals with the two types of successful delete (mapped and unmapped cities) and the cityNotExisting error. |
| + | Since I'm failing the release test for deleteCity, I was wondering if someone could verify my output. Nothing seems to jump out at me. |
| + | *deleteCityModified |
| + | **[[Media:Part1.andrew.deleteCity.input.xml]] |
| + | **[[Media:Part1.andrew.deleteCity.output.xml]] |
| + | |
| + | == The TA's Gnarly Input Generator Script == |
| + | This is a python script to generate large inputs for testing and timing. |
| + | Put your times up on the [[Part 1 Speed|Part 1 Speed Page]] -- if you dare.... |
| + | *[[Media:Gnarly.zip]] |
| + | |
| + | == Extension to John's boundary rangeCities test file == |
| + | This tests for pruning you might be doing while ranging. |
| + | Verified by Colin Powers and [[User:vl]]. |
| + | *[[Media:Part1.john.range.extend.input.xml]] |
| | | |
| == John's B Tree Test Files == | | == John's B Tree Test Files == |
Line 9: |
Line 62: |
| *These are pretty general and rely on a generic BTree. Some of the tests are pretty much just sanity checks, but the core functionality should be very well tested with this. | | *These are pretty general and rely on a generic BTree. Some of the tests are pretty much just sanity checks, but the core functionality should be very well tested with this. |
| **[http://www.glue.umd.edu/~teqdruid/BTreeTests.java BTreeTests.java] | | **[http://www.glue.umd.edu/~teqdruid/BTreeTests.java BTreeTests.java] |
− |
| |
| | | |
| == John's Part 2 Test Files == | | == John's Part 2 Test Files == |
Line 16: |
Line 68: |
| **[http://www.glue.umd.edu/~teqdruid/maxP3import.input.xml maxP3import.input.xml] | | **[http://www.glue.umd.edu/~teqdruid/maxP3import.input.xml maxP3import.input.xml] |
| **[http://www.glue.umd.edu/~teqdruid/maxP3import.output.xml maxP3import.output.xml] | | **[http://www.glue.umd.edu/~teqdruid/maxP3import.output.xml maxP3import.output.xml] |
− |
| |
| | | |
| == Ryan's Nearest City Matlab Script Generator == | | == Ryan's Nearest City Matlab Script Generator == |
Line 24: |
Line 75: |
| *Also, this script can be modified (with relative ease) to check rangeCities. If I have the time I might make create that as well. | | *Also, this script can be modified (with relative ease) to check rangeCities. If I have the time I might make create that as well. |
| **[http://www.wam.umd.edu/~rjmurphy/cmsc420/nearestCity.m nearestCity.m] | | **[http://www.wam.umd.edu/~rjmurphy/cmsc420/nearestCity.m nearestCity.m] |
| + | |
| + | ==Mike's Java PMQuadtree Input Generator== |
| + | *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. |
| + | |
| + | **[http://www.doc-ent.com/meeshquest/PMTestFileMaker.java] - Program '''(Updated 5/16 at 2:20 PM, Version 1.2)''' |
| + | **[http://www.doc-ent.com/meeshquest/revisedtests] - New Tests '''(Updated 5/16 at 2:20 PM)''' |
| + | |
| + | *Regards, Mike Bentley |
| + | |
| + | == PMQuadtree Creator/Editor == |
| + | *This is my Java made program which allows you to visually create PMQuadtrees rather than type it into the XML files |
| + | *The jar is runnable without cmd prompt if you so prefer |
| + | *A few notes: |
| + | **The command box is at the bottom, help gives you a list of commands and some info on usage |
| + | **There may be bugs saving when you use a file input rather than make a new quadtree |
| + | **If there are any problems, my email is natpett@terpmail.umd.edu |
| + | *Link: [https://www.dropbox.com/s/490k6w234kzp8py/Part2%20Tester.jar?raw=1] |