Hawkin
/
arangodb
mirror of https://gitee.com/bigwinds/arangodb
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

removed unused method

This commit is contained in:
Jan Steemann 2015-11-25 14:59:43 +01:00
parent 9d217b92ce
commit 5d2951a15b
2 changed files with 0 additions and 66 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

56
arangod/Indexes/EdgeIndex.cpp
View File

@ -538,62 +538,6 @@ int EdgeIndex::batchInsert (std::vector<TRI_doc_mptr_t const*> const* documents,
return TRI_ERROR_NO_ERROR; return TRI_ERROR_NO_ERROR;
} }
////////////////////////////////////////////////////////////////////////////////
/// @brief looks up edges using the index, restarting at the edge pointed at
/// by next
////////////////////////////////////////////////////////////////////////////////
void EdgeIndex::lookup (TRI_edge_index_iterator_t const* edgeIndexIterator,
std::vector<TRI_doc_mptr_copy_t>& result,
TRI_doc_mptr_copy_t*& next,
size_t batchSize) {
auto callback = [&result] (TRI_doc_mptr_t* data) -> void {
result.emplace_back(*(data));
};
std::vector<TRI_doc_mptr_t*>* found = nullptr;
if (next == nullptr) {
if (edgeIndexIterator->_direction == TRI_EDGE_OUT) {
found = _edgesFrom->lookupByKey(&(edgeIndexIterator->_edge), batchSize);
}
else if (edgeIndexIterator->_direction == TRI_EDGE_IN) {
found = _edgesTo->lookupByKey(&(edgeIndexIterator->_edge), batchSize);
}
else {
TRI_ASSERT(false);
}
if (found != nullptr && found->size() != 0) {
next = static_cast<TRI_doc_mptr_copy_t*>(found->back());
}
}
else {
if (edgeIndexIterator->_direction == TRI_EDGE_OUT) {
found = _edgesFrom->lookupByKeyContinue(next, batchSize);
}
else if (edgeIndexIterator->_direction == TRI_EDGE_IN) {
found = _edgesTo->lookupByKeyContinue(next, batchSize);
}
else {
TRI_ASSERT(false);
}
if (found != nullptr && found->size() != 0) {
next = static_cast<TRI_doc_mptr_copy_t*>(found->back());
}
else {
next = nullptr;
}
}
if (found != nullptr) {
for (auto& v : *found) {
callback(v);
}
delete found;
}
}
//////////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////////////
/// @brief provides a size hint for the edge index /// @brief provides a size hint for the edge index
//////////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////////////////////////

10
arangod/Indexes/EdgeIndex.h
View File

@ -154,16 +154,6 @@ namespace triagens {
int batchInsert (std::vector<TRI_doc_mptr_t const*> const*, int batchInsert (std::vector<TRI_doc_mptr_t const*> const*,
size_t) override final; size_t) override final;
////////////////////////////////////////////////////////////////////////////////
/// @brief looks up edges using the index, restarting at the edge pointed at
/// by next
////////////////////////////////////////////////////////////////////////////////
void lookup (TRI_edge_index_iterator_t const*,
std::vector<TRI_doc_mptr_copy_t>&,
TRI_doc_mptr_copy_t*&,
size_t);
int sizeHint (size_t) override final; int sizeHint (size_t) override final;
bool hasBatchInsert () const override final { bool hasBatchInsert () const override final {