/root/bitcoin/src/util/vector.h

Source
// Copyright (c) 2019-present The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.

#ifndef BITCOIN_UTIL_VECTOR_H
#define BITCOIN_UTIL_VECTOR_H

#include <functional>
#include <initializer_list>
#include <optional>
#include <type_traits>
#include <utility>
#include <vector>

/** Construct a vector with the specified elements.
 *
 * This is preferable over the list initializing constructor of std::vector:
 * - It automatically infers the element type from its arguments.
 * - If any arguments are rvalue references, they will be moved into the vector
 *   (list initialization always copies).
 */
template<typename... Args>
inline std::vector<std::common_type_t<Args...>> Vector(Args&&... args)
{
    std::vector<std::common_type_t<Args...>> ret;
    ret.reserve(sizeof...(args));
    // The line below uses the trick from https://www.experts-exchange.com/articles/32502/None-recursive-variadic-templates-with-std-initializer-list.html
    (void)std::initializer_list<int>{(ret.emplace_back(std::forward<Args>(args)), 0)...};
    return ret;
}

/** Concatenate two vectors, moving elements. */
template<typename V>
inline V Cat(V v1, V&& v2)
{
    v1.reserve(v1.size() + v2.size());
    for (auto& arg : v2) {
        v1.push_back(std::move(arg));
    }
    return v1;
}

/** Concatenate two vectors. */
template<typename V>
inline V Cat(V v1, const V& v2)
{
    v1.reserve(v1.size() + v2.size());
    for (const auto& arg : v2) {
        v1.push_back(arg);
    }
    return v1;
}

/** Clear a vector (or std::deque) and release its allocated memory. */
template<typename V>
inline void ClearShrink(V& v) noexcept
{
    // There are various ways to clear a vector and release its memory:
    //
    // 1. V{}.swap(v)
    // 2. v = V{}
    // 3. v = {}; v.shrink_to_fit();
    // 4. v.clear(); v.shrink_to_fit();
    //
    // (2) does not appear to release memory in glibc debug mode, even if v.shrink_to_fit()
    // follows. (3) and (4) rely on std::vector::shrink_to_fit, which is only a non-binding
    // request. Therefore, we use method (1).

    V{}.swap(v);
}

template<typename V, typename L>
inline std::optional<V> FindFirst(const std::vector<V>& vec, const L fnc)
{
    for (const auto& el : vec) {
        if (fnc(el)) {
            return el;
        }
    }
    return std::nullopt;
}

#endif // BITCOIN_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	0	{
25	0	std::vector<std::common_type_t<Args...>> ret;
26	0	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	0	(void)std::initializer_list<int>{(ret.emplace_back(std::forward<Args>(args)), 0)...};
29	0	return ret;
30	0	} 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<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<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>&&) 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<unsigned char>::type, std::allocator<std::common_type<unsigned char>::type> > Vector<unsigned char>(unsigned char&&) Unexecuted instantiation: miniscript.cpp:std::vector<std::common_type<(anonymous namespace)::ScriptParserContext::Key>::type, std::allocator<std::common_type<(anonymous namespace)::ScriptParserContext::Key>::type> > Vector<(anonymous namespace)::ScriptParserContext::Key>((anonymous namespace)::ScriptParserContext::Key&&) Unexecuted instantiation: miniscript.cpp:std::vector<std::common_type<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >::type, std::allocator<std::common_type<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >::type> > Vector<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >(miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>&&) Unexecuted instantiation: miniscript.cpp:std::vector<std::common_type<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >::type, std::allocator<std::common_type<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >::type> > Vector<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >(miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>&&, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>&&) Unexecuted instantiation: miniscript.cpp:std::vector<std::common_type<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >::type, std::allocator<std::common_type<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >::type> > Vector<miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key> >(miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>&&, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>&&, miniscript::Node<(anonymous namespace)::ScriptParserContext::Key>&&) 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::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>&&) 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<uint256 const&, uint256&>::type, std::allocator<std::common_type<uint256 const&, uint256&>::type> > Vector<uint256 const&, uint256&>(uint256 const&, uint256&)
31
32		/** Concatenate two vectors, moving elements. */
33		template<typename V>
34		inline V Cat(V v1, V&& v2)
35	0	{
36	0	v1.reserve(v1.size() + v2.size());
37	0	for (auto& arg : v2) {
38	0	v1.push_back(std::move(arg));
39	0	}
40	0	return v1;
41	0	} 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> > > >&&) Unexecuted instantiation: 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> >&&) Unexecuted instantiation: 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> >&&) Unexecuted instantiation: std::vector<char const, std::allocator<char const> > Cat<std::vector<char const, std::allocator<char const> > >(std::vector<char const, std::allocator<char const> >, std::vector<char const, std::allocator<char const> >&&) 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> > > >&&)
42
43		/** Concatenate two vectors. */
44		template<typename V>
45		inline V Cat(V v1, const V& v2)
46	0	{
47	0	v1.reserve(v1.size() + v2.size());
48	0	for (const auto& arg : v2) {
49	0	v1.push_back(arg);
50	0	}
51	0	return v1;
52	0	}
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	0	{
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	0	V{}.swap(v);
70	0	} Unexecuted instantiation: void ClearShrink<bitdeque<32768> >(bitdeque<32768>&) Unexecuted instantiation: void ClearShrink<std::deque<CompressedHeader, std::allocator<CompressedHeader> > >(std::deque<CompressedHeader, std::allocator<CompressedHeader> >&) Unexecuted instantiation: void ClearShrink<std::vector<unsigned char, std::allocator<unsigned char> > >(std::vector<unsigned char, std::allocator<unsigned char> >&) Unexecuted instantiation: 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> > > > >&)
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) {
76	0	if (fnc(el)) {
77	0	return el;
78	0	}
79	0	}
80	0	return std::nullopt;
81	0	} Unexecuted instantiation: std::optional<auto> FindFirst<AssumeutxoData, CChainParams::AssumeutxoForHeight(int) const::'lambda'(auto const&)>(std::vector<auto, std::allocator<auto> > const&, CChainParams::AssumeutxoForHeight(int) const::'lambda'(auto const&)) Unexecuted instantiation: std::optional<auto> FindFirst<AssumeutxoData, CChainParams::AssumeutxoForBlockhash(uint256 const&) const::'lambda'(auto const&)>(std::vector<auto, std::allocator<auto> > const&, CChainParams::AssumeutxoForBlockhash(uint256 const&) const::'lambda'(auto const&))
82
83		#endif // BITCOIN_UTIL_VECTOR_H

Bitcoin Core Fuzz Coverage Report

Coverage Report

Created: 2026-03-24 13:57