mirror of
https://github.com/MaskRay/ccls.git
synced 2024-11-24 08:35:08 +00:00
fc1db06538
Delete method.{cc,h}
Rename $ccls/setSkippedRanges to $ccls/publishSkippedRanges
Rename $ccls/publishSemanticHighlighting to $ccls/publishSemanticHighlight; stableId -> id
43 lines
1.3 KiB
C++
43 lines
1.3 KiB
C++
/* Copyright 2017-2018 ccls Authors
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
==============================================================================*/
|
|
|
|
#pragma once
|
|
|
|
#include "lsp.h"
|
|
|
|
#include <algorithm>
|
|
#include <queue>
|
|
|
|
template <typename Node>
|
|
std::vector<lsLocation> FlattenHierarchy(const std::optional<Node> &root) {
|
|
if (!root)
|
|
return {};
|
|
std::vector<lsLocation> ret;
|
|
std::queue<const Node *> q;
|
|
for (auto &entry : root->children)
|
|
q.push(&entry);
|
|
while (q.size()) {
|
|
auto *entry = q.front();
|
|
q.pop();
|
|
if (entry->location.uri.raw_uri.size())
|
|
ret.push_back({entry->location});
|
|
for (auto &entry1 : entry->children)
|
|
q.push(&entry1);
|
|
}
|
|
std::sort(ret.begin(), ret.end());
|
|
ret.erase(std::unique(ret.begin(), ret.end()), ret.end());
|
|
return ret;
|
|
}
|