本文整理汇总了C++中DocumentStorageIterator::position方法的典型用法代码示例。如果您正苦于以下问题：C++ DocumentStorageIterator::position方法的具体用法？C++ DocumentStorageIterator::position怎么用？C++ DocumentStorageIterator::position使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类DocumentStorageIterator的用法示例。
在下文中一共展示了DocumentStorageIterator::position方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: findField
Position DocumentStorage::findField(StringData requested) const {
int reqSize = requested.size(); // get size calculation out of the way if needed
if (_numFields >= HASH_TAB_MIN) { // hash lookup
const unsigned bucket = bucketForKey(requested);
Position pos = _hashTab[bucket];
while (pos.found()) {
const ValueElement& elem = getField(pos);
if (elem.nameLen == reqSize
&& memcmp(requested.rawData(), elem._name, reqSize) == 0) {
return pos;
}
// possible collision
pos = elem.nextCollision;
}
}
else { // linear scan
for (DocumentStorageIterator it = iteratorAll(); !it.atEnd(); it.advance()) {
if (it->nameLen == reqSize
&& memcmp(requested.rawData(), it->_name, reqSize) == 0) {
return it.position();
}
}
}
// if we got here, there's no such field
return Position();
}示例2: findField
Position DocumentStorage::findField(StringData requested) const {
if (_numFields >= HASH_TAB_MIN) { // hash lookup
const unsigned bucket = bucketForKey(requested);
Position pos = _hashTab[bucket];
while (pos.found()) {
const ValueElement& elem = getField(pos);
if (requested == elem.nameSD())
return pos;
// possible collision
pos = elem.nextCollision;
}
}
else if (_numFields) { // linear scan
for (DocumentStorageIterator it = iteratorAll(); !it.atEnd(); it.advance()) {
if (size_t(it->nameLen) == requested.size()
&& requested == it->nameSD()) {
return it.position();
}
}
}
// if we got here, there's no such field
return Position();
}