Searched refs:hasPrev (Results 1 - 3 of 3) sorted by relevance

/macosx-10.10/BerkeleyDB-21/db/java/src/com/sleepycat/collections/
H A DBlockIterator.java631 boolean hasPrev = hasPrevious();
632 if (!hasPrev && !hasNext()) {
670 * The collection is non-empty. If hasPrev is true then
675 int insertIndex = hasPrev ? (nextIndex - 1) : nextIndex;
687 status = hasPrev ? cursor.putAfter(value)
/macosx-10.10/tcl-105/tcl_ext/tktreectrl/tktreectrl/generic/
H A DtkTreeItem.c4265 int hasPrev, hasNext; local
4286 hasPrev = (walk != NULL);
4290 hasPrev = TRUE;
4300 hasPrev = hasNext = FALSE;
4303 if (hasPrev || hasNext) {
4306 if (!hasPrev)
4329 if (hasPrev || hasNext) {
/macosx-10.10/ICU-531.30/icuSources/test/cintltst/
H A Dccaltst.c2286 UBool hasPrev; /* does it have a previous transition from starting point? If so we test inclusive from that */ member in struct:__anon1031
2319 if (U_FAILURE(status) || result != itemPtr->hasPrev) {
2321 itemPtr->descrip, u_errorName(status), itemPtr->hasPrev, result);

Completed in 212 milliseconds