|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface ArraySearchingGopher
A gopher for searching algorithms is an pluggable adapter that adapts a generic array searching algorithm to a specific data structure. This interface defines the minimum actions required by searching algorithms. It is designed to be high-performance, so uses a memory register for compare-to values rather than some kind of object accessor. This allows higher speed for primitive searching or complex keys.
| Method Summary | |
|---|---|
int |
compare(int index)
Compares the key of the item at the given index with the current remembered key. |
int |
getSize()
Returns the number of items in the array. |
void |
remember(java.lang.Object key)
Remembers the given key for future comparisons. |
| Method Detail |
|---|
void remember(java.lang.Object key)
int compare(int index)
int getSize()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||