public int isThisOneOfOurs (String docPathName) {
		
		/* TODO: 
		 *	this stoopid brute search works fine for extremely small sets
		 *	but it'll bog quickly as doc set sizes grow > 10
		 *	
		 *	stan sez he'll fix this Real Soon
		 *	
		 *	his cheap solution: an ordering array ... 
		 *		int docAlfaOrder[sizeOfDocSet]
		 *		each entry is one of our selector integers
		 *		whenever a pathname's set, adjust the ordering array
		 *		then we can binary search off of the ordering array for stuff like this
		 *		o log n baby
		 *	... so that searches can get flatly fast
		 */
		 
		// for each doc in the set 
		for ( int selector = 0;
			selector < docPaths.length;
			selector ++ ){
				
			// if it's the spec'd doc
			if (docPaths[selector].compareTo(docPathName) == 0) {
				
				// return its selector
				return selector ;	
				
			} // end if
			
		} // end for
		
		// if we get this far, it's not one of ours
		return DOCUMENT_NOT_FOUND ;
		
	} // end method isThisOneOfOurs