Lines Matching defs:iterator
108 <3> 1/4/96 jev Fix BTItererateRecord for the condition when the iterator
135 iterator gets set correctly.
448 iterator - pointer to BTreeIterator indicating position result of search
638 iterator - pointer to iterator indicating start position
640 Output: iterator - iterator is updated to indicate new position
651 BTreeIterator *iterator,
739 err = FindIteratorPosition (btreePtr, iterator,
865 if (iterator != nil) // first & last do not require iterator
867 iterator->hint.writeCount = btreePtr->writeCount;
868 iterator->hint.nodeNum = nodeNum;
869 iterator->hint.index = index;
870 iterator->hint.reserved1 = 0;
871 iterator->hint.reserved2 = 0;
873 iterator->version = 0;
874 iterator->reserved = 0;
882 iterator->hitCount = 1;
884 iterator->hitCount += 1;
886 iterator->maxLeafRecs = max(btreePtr->leafRecords, iterator->maxLeafRecs);
889 if (iterator->hitCount > iterator->maxLeafRecs + kNumLeafRecSlack)
898 BlockMoveData ((Ptr)keyPtr, (Ptr)&iterator->key, CalcKeySize(btreePtr, keyPtr));
932 if (iterator != nil)
934 iterator->hint.writeCount = 0;
935 iterator->hint.nodeNum = 0;
936 iterator->hint.index = 0;
937 iterator->hint.reserved1 = 0;
938 iterator->hint.reserved2 = 0;
940 iterator->version = 0;
941 iterator->reserved = 0;
942 iterator->key.length16 = 0;
959 iterator - pointer to iterator indicating start position
963 Output: iterator - iterator is updated to indicate new position
970 BTIterateRecords(FCB *filePtr, BTreeIterationOperation operation, BTreeIterator *iterator,
1048 err = FindIteratorPosition(btreePtr, iterator, &left, &node, &right,
1204 if (iterator != nil) // first & last have optional iterator
1206 iterator->hint.writeCount = btreePtr->writeCount;
1207 iterator->hint.nodeNum = nodeNum;
1208 iterator->hint.index = index;
1209 iterator->version = 0;
1211 BlockMoveData((Ptr)keyPtr, (Ptr)&iterator->key, CalcKeySize(btreePtr, keyPtr));
1243 if (iterator != nil)
1245 iterator->hint.writeCount = 0;
1246 iterator->hint.nodeNum = 0;
1247 iterator->hint.index = 0;
1248 iterator->version = 0;
1249 iterator->key.length16 = 0;
1262 BTreeIterator *iterator,
1280 err = CheckInsertParams (filePtr, iterator, record, recordLen);
1292 err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1322 &iterator->key, KeyLength(btreePtr, &iterator->key),
1356 &iterator->key, KeyLength(btreePtr, &iterator->key),
1381 err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1394 iterator->hint.writeCount = btreePtr->writeCount;
1395 iterator->hint.nodeNum = insertNodeNum;
1396 iterator->hint.index = 0; // unused
1397 iterator->hint.reserved1 = 0;
1398 iterator->hint.reserved2 = 0;
1409 iterator->hint.writeCount = 0;
1410 iterator->hint.nodeNum = 0;
1411 iterator->hint.index = 0;
1412 iterator->hint.reserved1 = 0;
1413 iterator->hint.reserved2 = 0;
1425 BTreeIterator *iterator,
1445 err = CheckInsertParams (filePtr, iterator, record, recordLen);
1455 err = IsItAHint (btreePtr, iterator, &validHint);
1460 insertNodeNum = iterator->hint.nodeNum;
1468 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1482 (void) BTInvalidateHint( iterator );
1490 (void) BTInvalidateHint( iterator );
1497 err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1506 err = TrySimpleReplace (btreePtr, nodeRec.buffer, iterator, record, recordLen, &recordFit);
1535 err = InsertTree (btreePtr, treePathTable, &iterator->key, record->bufferAddress,
1543 iterator->hint.writeCount = btreePtr->writeCount;
1544 iterator->hint.nodeNum = insertNodeNum;
1545 iterator->hint.index = 0; // unused
1546 iterator->hint.reserved1 = 0;
1547 iterator->hint.reserved2 = 0;
1558 iterator->hint.writeCount = 0;
1559 iterator->hint.nodeNum = 0;
1560 iterator->hint.index = 0;
1561 iterator->hint.reserved1 = 0;
1562 iterator->hint.reserved2 = 0;
1572 BTUpdateRecord(FCB *filePtr, BTreeIterator *iterator,
1598 err = IsItAHint (btreePtr, iterator, &validHint);
1603 insertNodeNum = iterator->hint.nodeNum;
1609 SearchNode (btreePtr, nodeRec.buffer, &iterator->key, &index))
1629 (void) BTInvalidateHint( iterator );
1637 (void) BTInvalidateHint( iterator );
1643 err = SearchTree (btreePtr, &iterator->key, treePathTable, &insertNodeNum, &nodeRec, &index);
1660 iterator->hint.writeCount = btreePtr->writeCount;
1661 iterator->hint.nodeNum = insertNodeNum;
1662 iterator->hint.index = 0;
1663 iterator->hint.reserved1 = 0;
1664 iterator->hint.reserved2 = 0;
1673 iterator->hint.writeCount = 0;
1674 iterator->hint.nodeNum = 0;
1675 iterator->hint.index = 0;
1676 iterator->hint.reserved1 = 0;
1677 iterator->hint.reserved2 = 0;
1686 BTreeIterator *iterator )
1703 M_ReturnErrorIf (iterator == nil, paramErr);
1719 err = SearchTree (btreePtr, &iterator->key, treePathTable, &nodeNum, &nodeRec, &index);
1744 iterator->hint.nodeNum = 0;
1904 Input: iterator - pointer to BTreeIterator
1906 Output: iterator - iterator with the hint.nodeNum cleared
1909 paramErr - iterator == nil
1913 OSStatus BTInvalidateHint (BTreeIterator *iterator )
1915 if (iterator == nil)
1918 iterator->hint.nodeNum = 0;
1936 paramErr - iterator == nil
1975 paramErr - iterator == nil