Coverage Report

Created: 2026-07-14 18:13

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/bitcoin/src/util/vector.h
Line
Count
Source
1
// Copyright (c) 2019-present The Bitcoin Core developers
2
// Distributed under the MIT software license, see the accompanying
3
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
4
5
#ifndef BITCOIN_UTIL_VECTOR_H
6
#define BITCOIN_UTIL_VECTOR_H
7
8
#include <functional>
9
#include <initializer_list>
10
#include <optional>
11
#include <type_traits>
12
#include <utility>
13
#include <vector>
14
15
/** Construct a vector with the specified elements.
16
 *
17
 * This is preferable over the list initializing constructor of std::vector:
18
 * - It automatically infers the element type from its arguments.
19
 * - If any arguments are rvalue references, they will be moved into the vector
20
 *   (list initialization always copies).
21
 */
22
template<typename... Args>
23
inline std::vector<std::common_type_t<Args...>> Vector(Args&&... args)
24
305k
{
25
305k
    std::vector<std::common_type_t<Args...>> ret;
26
305k
    ret.reserve(sizeof...(args));
27
    // The line below uses the trick from https://www.experts-exchange.com/articles/32502/None-recursive-variadic-templates-with-std-initializer-list.html
28
305k
    (void)std::initializer_list<int>{(ret.emplace_back(std::forward<Args>(args)), 0)...};
29
305k
    return ret;
30
305k
}
std::vector<std::common_type<uint256 const&, uint256&>::type, std::allocator<std::common_type<uint256 const&, uint256&>::type> > Vector<uint256 const&, uint256&>(uint256 const&, uint256&)
Line
Count
Source
24
305k
{
25
305k
    std::vector<std::common_type_t<Args...>> ret;
26
305k
    ret.reserve(sizeof...(args));
27
    // The line below uses the trick from https://www.experts-exchange.com/articles/32502/None-recursive-variadic-templates-with-std-initializer-list.html
28
305k
    (void)std::initializer_list<int>{(ret.emplace_back(std::forward<Args>(args)), 0)...};
29
305k
    return ret;
30
305k
}
std::vector<std::common_type<std::vector<unsigned char, std::allocator<unsigned char> > >::type, std::allocator<std::common_type<std::vector<unsigned char, std::allocator<unsigned char> > >::type> > Vector<std::vector<unsigned char, std::allocator<unsigned char> > >(std::vector<unsigned char, std::allocator<unsigned char> >&&)
Line
Count
Source
24
243
{
25
243
    std::vector<std::common_type_t<Args...>> ret;
26
243
    ret.reserve(sizeof...(args));
27
    // The line below uses the trick from https://www.experts-exchange.com/articles/32502/None-recursive-variadic-templates-with-std-initializer-list.html
28
243
    (void)std::initializer_list<int>{(ret.emplace_back(std::forward<Args>(args)), 0)...};
29
243
    return ret;
30
243
}
Unexecuted instantiation: descriptor.cpp:std::vector<std::common_type<std::unique_ptr<(anonymous namespace)::PubkeyProvider, std::default_delete<(anonymous namespace)::PubkeyProvider> > >::type, std::allocator<std::common_type<std::unique_ptr<(anonymous namespace)::PubkeyProvider, std::default_delete<(anonymous namespace)::PubkeyProvider> > >::type> > Vector<std::unique_ptr<(anonymous namespace)::PubkeyProvider, std::default_delete<(anonymous namespace)::PubkeyProvider> > >(std::unique_ptr<(anonymous namespace)::PubkeyProvider, std::default_delete<(anonymous namespace)::PubkeyProvider> >&&)
Unexecuted instantiation: std::vector<std::common_type<CScript>::type, std::allocator<std::common_type<CScript>::type> > Vector<CScript>(CScript&&)
Unexecuted instantiation: descriptor.cpp:std::vector<std::common_type<std::unique_ptr<(anonymous namespace)::DescriptorImpl, std::default_delete<(anonymous namespace)::DescriptorImpl> > >::type, std::allocator<std::common_type<std::unique_ptr<(anonymous namespace)::DescriptorImpl, std::default_delete<(anonymous namespace)::DescriptorImpl> > >::type> > Vector<std::unique_ptr<(anonymous namespace)::DescriptorImpl, std::default_delete<(anonymous namespace)::DescriptorImpl> > >(std::unique_ptr<(anonymous namespace)::DescriptorImpl, std::default_delete<(anonymous namespace)::DescriptorImpl> >&&)
Unexecuted instantiation: std::vector<std::common_type<CScript const&>::type, std::allocator<std::common_type<CScript const&>::type> > Vector<CScript const&>(CScript const&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<unsigned int> >::type, std::allocator<std::common_type<miniscript::Node<unsigned int> >::type> > Vector<miniscript::Node<unsigned int> >(miniscript::Node<unsigned int>&&)
Unexecuted instantiation: std::vector<std::common_type<unsigned int>::type, std::allocator<std::common_type<unsigned int>::type> > Vector<unsigned int>(unsigned int&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::internal::MaxInt<unsigned int> >::type, std::allocator<std::common_type<miniscript::internal::MaxInt<unsigned int> >::type> > Vector<miniscript::internal::MaxInt<unsigned int> >(miniscript::internal::MaxInt<unsigned int>&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::internal::SatInfo>::type, std::allocator<std::common_type<miniscript::internal::SatInfo>::type> > Vector<miniscript::internal::SatInfo>(miniscript::internal::SatInfo&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<unsigned int>, miniscript::Node<unsigned int> >::type, std::allocator<std::common_type<miniscript::Node<unsigned int>, miniscript::Node<unsigned int> >::type> > Vector<miniscript::Node<unsigned int>, miniscript::Node<unsigned int> >(miniscript::Node<unsigned int>&&, miniscript::Node<unsigned int>&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<unsigned int>, miniscript::Node<unsigned int>, miniscript::Node<unsigned int> >::type, std::allocator<std::common_type<miniscript::Node<unsigned int>, miniscript::Node<unsigned int>, miniscript::Node<unsigned int> >::type> > Vector<miniscript::Node<unsigned int>, miniscript::Node<unsigned int>, miniscript::Node<unsigned int> >(miniscript::Node<unsigned int>&&, miniscript::Node<unsigned int>&&, miniscript::Node<unsigned int>&&)
std::vector<std::common_type<unsigned char>::type, std::allocator<std::common_type<unsigned char>::type> > Vector<unsigned char>(unsigned char&&)
Line
Count
Source
24
81
{
25
81
    std::vector<std::common_type_t<Args...>> ret;
26
81
    ret.reserve(sizeof...(args));
27
    // The line below uses the trick from https://www.experts-exchange.com/articles/32502/None-recursive-variadic-templates-with-std-initializer-list.html
28
81
    (void)std::initializer_list<int>{(ret.emplace_back(std::forward<Args>(args)), 0)...};
29
81
    return ret;
30
81
}
Unexecuted instantiation: std::vector<std::common_type<std::vector<unsigned char, std::allocator<unsigned char> >&>::type, std::allocator<std::common_type<std::vector<unsigned char, std::allocator<unsigned char> >&>::type> > Vector<std::vector<unsigned char, std::allocator<unsigned char> >&>(std::vector<unsigned char, std::allocator<unsigned char> >&)
Unexecuted instantiation: std::vector<std::common_type<XOnlyPubKey>::type, std::allocator<std::common_type<XOnlyPubKey>::type> > Vector<XOnlyPubKey>(XOnlyPubKey&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<XOnlyPubKey> >::type, std::allocator<std::common_type<miniscript::Node<XOnlyPubKey> >::type> > Vector<miniscript::Node<XOnlyPubKey> >(miniscript::Node<XOnlyPubKey>&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey> >::type, std::allocator<std::common_type<miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey> >::type> > Vector<miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey> >(miniscript::Node<XOnlyPubKey>&&, miniscript::Node<XOnlyPubKey>&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey> >::type, std::allocator<std::common_type<miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey> >::type> > Vector<miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey>, miniscript::Node<XOnlyPubKey> >(miniscript::Node<XOnlyPubKey>&&, miniscript::Node<XOnlyPubKey>&&, miniscript::Node<XOnlyPubKey>&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::internal::InputStack const&>::type, std::allocator<std::common_type<miniscript::internal::InputStack const&>::type> > Vector<miniscript::internal::InputStack const&>(miniscript::internal::InputStack const&)
Unexecuted instantiation: std::vector<std::common_type<CPubKey>::type, std::allocator<std::common_type<CPubKey>::type> > Vector<CPubKey>(CPubKey&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<CPubKey> >::type, std::allocator<std::common_type<miniscript::Node<CPubKey> >::type> > Vector<miniscript::Node<CPubKey> >(miniscript::Node<CPubKey>&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<CPubKey>, miniscript::Node<CPubKey> >::type, std::allocator<std::common_type<miniscript::Node<CPubKey>, miniscript::Node<CPubKey> >::type> > Vector<miniscript::Node<CPubKey>, miniscript::Node<CPubKey> >(miniscript::Node<CPubKey>&&, miniscript::Node<CPubKey>&&)
Unexecuted instantiation: std::vector<std::common_type<miniscript::Node<CPubKey>, miniscript::Node<CPubKey>, miniscript::Node<CPubKey> >::type, std::allocator<std::common_type<miniscript::Node<CPubKey>, miniscript::Node<CPubKey>, miniscript::Node<CPubKey> >::type> > Vector<miniscript::Node<CPubKey>, miniscript::Node<CPubKey>, miniscript::Node<CPubKey> >(miniscript::Node<CPubKey>&&, miniscript::Node<CPubKey>&&, miniscript::Node<CPubKey>&&)
31
32
/** Concatenate two vectors, moving elements. */
33
template<typename V>
34
inline V Cat(V v1, V&& v2)
35
1.48k
{
36
1.48k
    v1.reserve(v1.size() + v2.size());
37
7.18k
    for (auto& arg : v2) {
  Branch (37:20): [True: 6.21k, False: 1.10k]

  Branch (37:20): [True: 972, False: 378]
  Branch (37:20): [True: 0, False: 0]
  Branch (37:20): [True: 0, False: 0]

38
7.18k
        v1.push_back(std::move(arg));
39
7.18k
    }
40
1.48k
    return v1;
41
1.48k
}
std::vector<RPCResult, std::allocator<RPCResult> > Cat<std::vector<RPCResult, std::allocator<RPCResult> > >(std::vector<RPCResult, std::allocator<RPCResult> >, std::vector<RPCResult, std::allocator<RPCResult> >&&)
Line
Count
Source
35
1.10k
{
36
1.10k
    v1.reserve(v1.size() + v2.size());
37
6.21k
    for (auto& arg : v2) {
  Branch (37:20): [True: 6.21k, False: 1.10k]

38
6.21k
        v1.push_back(std::move(arg));
39
6.21k
    }
40
1.10k
    return v1;
41
1.10k
}
std::vector<RPCArg, std::allocator<RPCArg> > Cat<std::vector<RPCArg, std::allocator<RPCArg> > >(std::vector<RPCArg, std::allocator<RPCArg> >, std::vector<RPCArg, std::allocator<RPCArg> >&&)
Line
Count
Source
35
378
{
36
378
    v1.reserve(v1.size() + v2.size());
37
972
    for (auto& arg : v2) {
  Branch (37:20): [True: 972, False: 378]

38
972
        v1.push_back(std::move(arg));
39
972
    }
40
378
    return v1;
41
378
}
Unexecuted instantiation: std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > Cat<std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >(std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::vector<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >&&)
Unexecuted instantiation: std::vector<std::vector<unsigned char, std::allocator<unsigned char> >, std::allocator<std::vector<unsigned char, std::allocator<unsigned char> > > > Cat<std::vector<std::vector<unsigned char, std::allocator<unsigned char> >, std::allocator<std::vector<unsigned char, std::allocator<unsigned char> > > > >(std::vector<std::vector<unsigned char, std::allocator<unsigned char> >, std::allocator<std::vector<unsigned char, std::allocator<unsigned char> > > >, std::vector<std::vector<unsigned char, std::allocator<unsigned char> >, std::allocator<std::vector<unsigned char, std::allocator<unsigned char> > > >&&)
42
43
/** Concatenate two vectors. */
44
template<typename V>
45
inline V Cat(V v1, const V& v2)
46
54
{
47
54
    v1.reserve(v1.size() + v2.size());
48
540
    for (const auto& arg : v2) {
  Branch (48:26): [True: 540, False: 54]

49
540
        v1.push_back(arg);
50
540
    }
51
54
    return v1;
52
54
}
53
54
/** Clear a vector (or std::deque) and release its allocated memory. */
55
template<typename V>
56
inline void ClearShrink(V& v) noexcept
57
14.6M
{
58
    // There are various ways to clear a vector and release its memory:
59
    //
60
    // 1. V{}.swap(v)
61
    // 2. v = V{}
62
    // 3. v = {}; v.shrink_to_fit();
63
    // 4. v.clear(); v.shrink_to_fit();
64
    //
65
    // (2) does not appear to release memory in glibc debug mode, even if v.shrink_to_fit()
66
    // follows. (3) and (4) rely on std::vector::shrink_to_fit, which is only a non-binding
67
    // request. Therefore, we use method (1).
68
69
14.6M
    V{}.swap(v);
70
14.6M
}
void ClearShrink<std::vector<unsigned char, std::allocator<unsigned char> > >(std::vector<unsigned char, std::allocator<unsigned char> >&)
Line
Count
Source
57
10.1M
{
58
    // There are various ways to clear a vector and release its memory:
59
    //
60
    // 1. V{}.swap(v)
61
    // 2. v = V{}
62
    // 3. v = {}; v.shrink_to_fit();
63
    // 4. v.clear(); v.shrink_to_fit();
64
    //
65
    // (2) does not appear to release memory in glibc debug mode, even if v.shrink_to_fit()
66
    // follows. (3) and (4) rely on std::vector::shrink_to_fit, which is only a non-binding
67
    // request. Therefore, we use method (1).
68
69
10.1M
    V{}.swap(v);
70
10.1M
}
Unexecuted instantiation: void ClearShrink<bitdeque<32768> >(bitdeque<32768>&)
Unexecuted instantiation: void ClearShrink<std::deque<CompressedHeader, std::allocator<CompressedHeader> > >(std::deque<CompressedHeader, std::allocator<CompressedHeader> >&)
txgraph.cpp:void ClearShrink<std::vector<std::_Node_handle<(anonymous namespace)::TxGraphImpl::ChunkData, (anonymous namespace)::TxGraphImpl::ChunkData, std::allocator<std::_Rb_tree_node<(anonymous namespace)::TxGraphImpl::ChunkData> > >, std::allocator<std::_Node_handle<(anonymous namespace)::TxGraphImpl::ChunkData, (anonymous namespace)::TxGraphImpl::ChunkData, std::allocator<std::_Rb_tree_node<(anonymous namespace)::TxGraphImpl::ChunkData> > > > > >(std::vector<std::_Node_handle<(anonymous namespace)::TxGraphImpl::ChunkData, (anonymous namespace)::TxGraphImpl::ChunkData, std::allocator<std::_Rb_tree_node<(anonymous namespace)::TxGraphImpl::ChunkData> > >, std::allocator<std::_Node_handle<(anonymous namespace)::TxGraphImpl::ChunkData, (anonymous namespace)::TxGraphImpl::ChunkData, std::allocator<std::_Rb_tree_node<(anonymous namespace)::TxGraphImpl::ChunkData> > > > >&)
Line
Count
Source
57
4.48M
{
58
    // There are various ways to clear a vector and release its memory:
59
    //
60
    // 1. V{}.swap(v)
61
    // 2. v = V{}
62
    // 3. v = {}; v.shrink_to_fit();
63
    // 4. v.clear(); v.shrink_to_fit();
64
    //
65
    // (2) does not appear to release memory in glibc debug mode, even if v.shrink_to_fit()
66
    // follows. (3) and (4) rely on std::vector::shrink_to_fit, which is only a non-binding
67
    // request. Therefore, we use method (1).
68
69
4.48M
    V{}.swap(v);
70
4.48M
}
71
72
template<typename V, typename L>
73
inline std::optional<V> FindFirst(const std::vector<V>& vec, const L fnc)
74
0
{
75
0
    for (const auto& el : vec) {
  Branch (75:25): [True: 0, False: 0]

  Branch (75:25): [True: 0, False: 0]

76
0
        if (fnc(el)) {
  Branch (76:13): [True: 0, False: 0]

  Branch (76:13): [True: 0, False: 0]

77
0
            return el;
78
0
        }
79
0
    }
80
0
    return std::nullopt;
81
0
}
Unexecuted instantiation: std::optional<AssumeutxoData> FindFirst<AssumeutxoData, CChainParams::AssumeutxoForHeight(int) const::{lambda(auto:1 const&)#1}>(std::vector<AssumeutxoData, std::allocator<AssumeutxoData> > const&, CChainParams::AssumeutxoForHeight(int) const::{lambda(auto:1 const&)#1})
Unexecuted instantiation: std::optional<AssumeutxoData> FindFirst<AssumeutxoData, CChainParams::AssumeutxoForBlockhash(uint256 const&) const::{lambda(auto:1 const&)#1}>(std::vector<AssumeutxoData, std::allocator<AssumeutxoData> > const&, CChainParams::AssumeutxoForBlockhash(uint256 const&) const::{lambda(auto:1 const&)#1})
82
83
#endif // BITCOIN_UTIL_VECTOR_H