1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
|
// Copyright (C) 2021 ycmd contributors
//
// This file is part of ycmd.
//
// ycmd is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// ycmd is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with ycmd. If not, see <http://www.gnu.org/licenses/>.
#ifndef REPOSITORY_H_36TXTS6C
#define REPOSITORY_H_36TXTS6C
#include "Candidate.h"
#include "Character.h"
#include "CodePoint.h"
#include "Utils.h"
#ifdef YCM_ABSEIL_SUPPORTED
#include <absl/container/flat_hash_map.h>
namespace YouCompleteMe {
template< typename K, typename V >
using HashMap = absl::flat_hash_map< K, V >;
} // namespace YouCompleteMe
#else
#include <unordered_map>
namespace YouCompleteMe {
template< typename K, typename V >
using HashMap = std::unordered_map< K, V >;
} // namespace YouCompleteMe
#endif
#include <memory>
#include <shared_mutex>
#include <string>
#include <vector>
namespace YouCompleteMe {
// This singleton stores already built T objects. If Ts are requested for
// previously unseen strings, new T objects are built.
//
// This class is thread-safe.
template< typename T >
class Repository {
public:
using Holder = HashMap< std::string, std::unique_ptr< T > >;
using Sequence = std::vector< const T* >;
static Repository &Instance() {
static Repository repo;
return repo;
}
// Make class noncopyable
Repository( const Repository& ) = delete;
Repository& operator=( const Repository& ) = delete;
size_t NumStoredElements() const {
std::shared_lock locker( element_holder_mutex_ );
return element_holder_.size();
}
Sequence GetElements(
std::vector< std::string >&& elements ) {
Sequence element_objects( elements.size() );
auto it = element_objects.begin();
{
std::lock_guard locker( element_holder_mutex_ );
for ( auto&& element : elements ) {
if constexpr ( std::is_same_v< T, Candidate > ) {
if ( element.size() > 80 ) {
element = "";
}
}
std::unique_ptr< T > &element_object = GetValueElseInsert(
element_holder_,
element,
nullptr );
if ( !element_object ) {
element_object = std::make_unique< T >( std::move( element ) );
}
*it++ = element_object.get();
}
}
return element_objects;
}
// This should only be used to isolate tests and benchmarks.
void ClearElements() {
element_holder_.clear();
}
private:
Repository() = default;
~Repository() = default;
// This data structure owns all the T pointers
Holder element_holder_;
mutable std::shared_mutex element_holder_mutex_;
};
extern template class YCM_EXPORT Repository< Candidate >;
extern template class YCM_EXPORT Repository< Character >;
extern template class YCM_EXPORT Repository< CodePoint >;
} // namespace YouCompleteMe
#endif /* end of include guard: REPOSITORY_H_36TXTS6C */
|
