Lines Matching refs:iterator
298 iterator - description
301 Output: iterator - description
315 BTreeIteratorPtr iterator,
344 if (iterator == nil) // do we have an iterator?
350 err = IsItAHint (btreePtr, iterator, &validHint);
353 nodeNum = iterator->hint.nodeNum;
371 foundIt = SearchNode (btreePtr, middle->buffer, &iterator->key, &index);
377 iterator->hint.nodeNum = 0;
408 foundIt = SearchNode (btreePtr, left->buffer, &iterator->key, &leftIndex);
458 foundIt = SearchNode (btreePtr, right->buffer, &iterator->key, &rightIndex);
485 err = SearchTree ( btreePtr, &iterator->key, treePathTable, &nodeNum, middle, &index);
525 BTreeIterator *iterator,
535 if (iterator == nil) return paramErr;
539 if ( CalcKeyRecordSize (CalcKeySize(btreePtr, &iterator->key), recordLen) > (btreePtr->nodeSize >> 1))
550 Function: If a hint exitst for the iterator, attempt to find the key in the hint
559 Assumptions: iterator key has already been checked by CheckKey
563 iterator - description
579 BTreeIterator *iterator,
597 foundIt = SearchNode (btreePtr, nodePtr, &iterator->key, &index);
602 keySize = CalcKeySize(btreePtr, &iterator->key); // includes length field
628 &iterator->key, KeyLength(btreePtr, &iterator->key),
647 iterator - pointer to BTreeIterator
656 OSStatus IsItAHint (BTreeControlBlockPtr btreePtr, BTreeIterator *iterator, Boolean *answer)
661 if (iterator->hint.nodeNum >= btreePtr->totalNodes)
667 if (iterator->hint.nodeNum == 0)