This is DepthFirstSearch.h in view mode; [Download] [Up]
/*
File DepthFirstSearch.h
This search is a standard depth first one. At each step, the variable with the highest efficiency is selected and filled. The search backtracks when a variable has no remaining values.
It is the responsibility of the variables to implement any special heuristics like backjumping and leapfrogging.
*/
#import <objc/Object.h>
/* 行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行 */
@interface DepthFirstSearch:Object
{
id variables;
id last;
BOOL ok;
int next;
int count;
}
- (BOOL) startSearch: (id) theVariables;
- (BOOL) continue;
- (BOOL) step;
- (BOOL) done;
- (BOOL) fill: (id) variable;
- findBest;
@end
/* 行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行行 */
@interface Variable:Object
{
}
- (float) efficiency;
- (BOOL) fillNext;
- erase;
- hilight;
- unhilight;
@endThese are the contents of the former NiCE NeXT User Group NeXTSTEP/OpenStep software archive, currently hosted by Netfuture.ch.