Lines Matching defs:iterator
653 iterator - pointer to BTreeIterator indicating position result of search
864 iterator - pointer to iterator indicating start position
866 Output: iterator - iterator is updated to indicate new position
877 BTreeIterator *iterator,
960 err = FindIteratorPosition (btreePtr, iterator,
1076 if (iterator != nil) // first & last do not require iterator
1078 iterator->hint.writeCount = btreePtr->writeCount;
1079 iterator->hint.nodeNum = nodeNum;
1080 iterator->hint.index = index;
1081 iterator->hint.reserved1 = 0;
1082 iterator->hint.reserved2 = 0;
1084 iterator->version = 0;
1085 iterator->reserved = 0;
1087 CopyKey(btreePtr, keyPtr, &iterator->key);
1123 if (iterator != nil)
1125 iterator->hint.writeCount = 0;
1126 iterator->hint.nodeNum = 0;
1127 iterator->hint.index = 0;
1128 iterator->hint.reserved1 = 0;
1129 iterator->hint.reserved2 = 0;
1131 iterator->version = 0;
1132 iterator->reserved = 0;
1133 iterator->key.length16 = 0;
1148 BTreeIterator *iterator,
1166 err = CheckInsertParams (filePtr, iterator, record, recordLen);
1177 err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1204 &iterator->key, KeyLength(btreePtr, &iterator->key),
1231 &iterator->key, KeyLength(btreePtr, &iterator->key),
1257 err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1270 iterator->hint.writeCount = btreePtr->writeCount; // unused until <CS10>
1271 iterator->hint.nodeNum = insertNodeNum;
1272 iterator->hint.index = 0; // unused
1273 iterator->hint.reserved1 = 0;
1274 iterator->hint.reserved2 = 0;
1286 iterator->hint.writeCount = 0;
1287 iterator->hint.nodeNum = 0;
1288 iterator->hint.index = 0;
1289 iterator->hint.reserved1 = 0;
1290 iterator->hint.reserved2 = 0;
1305 BTreeIterator *iterator,
1326 err = CheckInsertParams (filePtr, iterator, record, recordLen);
1335 err = IsItAHint (btreePtr, iterator, &validHint);
1340 insertNodeNum = iterator->hint.nodeNum;
1345 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1359 (void) BTInvalidateHint( iterator );
1367 err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1394 &iterator->key, KeyLength(btreePtr, &iterator->key),
1418 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1453 err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1467 iterator->hint.writeCount = btreePtr->writeCount; // unused until <CS10>
1468 iterator->hint.nodeNum = insertNodeNum;
1469 iterator->hint.index = 0; // unused
1470 iterator->hint.reserved1 = 0;
1471 iterator->hint.reserved2 = 0;
1482 iterator->hint.writeCount = 0;
1483 iterator->hint.nodeNum = 0;
1484 iterator->hint.index = 0;
1485 iterator->hint.reserved1 = 0;
1486 iterator->hint.reserved2 = 0;
1496 BTreeIterator *iterator,
1515 err = CheckInsertParams (filePtr, iterator, record, recordLen);
1525 err = IsItAHint (btreePtr, iterator, &validHint);
1530 insertNodeNum = iterator->hint.nodeNum;
1535 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1549 (void) BTInvalidateHint( iterator );
1557 (void) BTInvalidateHint( iterator );
1564 err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1570 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1598 err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1606 iterator->hint.writeCount = btreePtr->writeCount; // unused until <CS10>
1607 iterator->hint.nodeNum = insertNodeNum;
1608 iterator->hint.index = 0; // unused
1609 iterator->hint.reserved1 = 0;
1610 iterator->hint.reserved2 = 0;
1623 iterator->hint.writeCount = 0;
1624 iterator->hint.nodeNum = 0;
1625 iterator->hint.index = 0;
1626 iterator->hint.reserved1 = 0;
1627 iterator->hint.reserved2 = 0;
1639 BTreeIterator *iterator )
1655 M_ReturnErrorIf (iterator == nil, paramErr);
1667 err = CheckKey (&iterator->key, btreePtr->keyDescPtr, btreePtr->maxKeyLength);
1676 err = SearchTree (btreePtr, &iterator->key, treePathTable, &nodeNum, &nodeRec, &index);
1690 iterator->hint.nodeNum = 0;
1788 Input: iterator - pointer to BTreeIterator
1790 Output: iterator - iterator with the hint.nodeNum cleared
1793 paramErr - iterator == nil
1797 OSStatus BTInvalidateHint (BTreeIterator *iterator )
1799 if (iterator == nil)
1802 iterator->hint.nodeNum = 0;