15668665368

Committed 15 Jun 2025 11:49PM UTC coverage: 54.208% (+0.7%) from 53.519%

Build # 15668665368

Build Type

Pull #17

github

Committed by

web-flow

Commit Message

Merge 650153c4f into 0f0b787a1

Pull Request Pull Request #17: Truncation policy

Run Details

10212 of 18774 branches covered (54.39%)

Branch coverage included in aggregate %.

180 of 219 new or added lines in 12 files covered. (82.19%)

214 existing lines in 11 files now uncovered.

6038 of 11203 relevant lines covered (53.9%)

7753027.29 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

84.72

/include/bitlib/bit-containers/bit_array_dynamic_extent.hpp

// ================================= BIT_ARRAY =================================== //
// Project:     The Experimental Bit Algorithms Library
// \file        bit_array.hpp
// Description: Implementation of bit_array
// Creator:     Vincent Reverdy
// Contributor: Peter McLean [2025]
// License:     BSD 3-Clause License
// ========================================================================== //
#ifndef _BIT_ARRAY_DYNAMIC_EXTENT_HPP_INCLUDED
#define _BIT_ARRAY_DYNAMIC_EXTENT_HPP_INCLUDED

#include <algorithm>
#include <cstddef>
#include <initializer_list>
#include <memory>
#include <new>
#include <span>  // std::dynamic_extent
#include <stdexcept>

#include "bitlib/bit-algorithms/bit_algorithm.hpp"
#include "bitlib/bit-containers/bit_array.hpp"
#include "bitlib/bit-containers/bit_array_base.hpp"
#include "bitlib/bit-containers/bit_bitsof.hpp"
#include "bitlib/bit-containers/bit_policy.hpp"
#include "bitlib/bit-containers/bit_span.hpp"
#include "bitlib/bit-iterator/bit.hpp"
#include "bitlib/bit_concepts.hpp"

namespace bit {
namespace detail {

template <typename value_type, typename word_type>
struct bit_array_dextent_iterator_types {
  using iterator = typename std::conditional<std::is_same_v<value_type, bit_value>,
                                             bit_iterator<word_type*>,
                                             word_type*>::type;
  using const_iterator = typename std::conditional<std::is_same_v<value_type, bit_value>,
                                                   bit_iterator<const word_type*>,
                                                   const word_type*>::type;
};
}  // namespace detail
template <typename T, typename W, typename Policy>
class bit_array<T, std::dynamic_extent, W, Policy>
    : public bit_array_base<bit_array<T, std::dynamic_extent, W>, T, std::dynamic_extent, W, Policy, detail::bit_array_dextent_iterator_types<T, W>> {
 public:
  using base = bit_array_base<bit_array<T, std::dynamic_extent, W>, T, std::dynamic_extent, W, Policy, detail::bit_array_dextent_iterator_types<T, W>>;
  using base::end;
  using typename base::const_iterator;
  using typename base::const_pointer;
  using typename base::const_reference;
  using typename base::difference_type;
  using typename base::iterator;
  using typename base::pointer;
  using typename base::reference;
  using typename base::size_type;
  using typename base::value_type;
  using typename base::word_type;
  using Allocator = typename Policy::allocator;

 private:
  using word_type_ptr = word_type*;
  static const size_type FixedWords = sizeof(word_type_ptr) / sizeof(word_type);
  static const size_type FixedBits = FixedWords * bitsof<word_type>();

  const size_type m_size;

  struct Storage {
    union {
      word_type_ptr pointer;
      word_type fixed[FixedWords];
    };
    Allocator m_allocator;

    Storage(size_type words, const Allocator& allocator, detail::uninitialized_t) : m_allocator(allocator) {
      if (words > FixedWords) {
        new (&pointer) word_type_ptr(m_allocator.allocate(words));
      }
    }

    Storage(size_type words, const Allocator& allocator = Allocator()) : m_allocator(allocator) {
      if (words > FixedWords) {
        new (&pointer) word_type_ptr(m_allocator.allocate(words));
        for (size_type i = 0; i < words; ++i) {
          new (pointer + i) word_type();
        }
      } else {
        for (size_type i = 0; i < words; ++i) {
          new (&fixed[i]) word_type();
        }
      }
    }

    Storage(size_type words, Storage&& other) {
      if (words > FixedWords) {
        new (&pointer) word_type_ptr(std::move(other.pointer));
        other.pointer = nullptr;  // Prevent double deletion
      } else {
        for (size_type i = 0; i < words; ++i) {
          new (&fixed[i]) word_type(std::move(other.fixed[i]));
        }
      }
    }

    Storage(size_type words, const Storage& other, const Allocator& allocator = Allocator())
        : m_allocator(allocator) {
      if (words > FixedWords) {
        new (&pointer) word_type_ptr(m_allocator.allocate(words));
        for (size_t i = 0; i < words; ++i) {
          new (pointer + i) word_type(other.pointer[i]);
        }
        std::copy_n(other.pointer, words, pointer);
      } else {
        for (size_type i = 0; i < words; ++i) {
          new (&fixed[i]) word_type(other.fixed[i]);
        }
      }
    }
    template <typename U>
    Storage(size_type words, const U& val, const Allocator& allocator = Allocator())
        : m_allocator(allocator) {
      if (words > FixedWords) {
        new (&pointer) word_type_ptr(m_allocator.allocate(words));
        for (size_t i = 0; i < words; ++i) {
          new (pointer + i) word_type(val);
        }
      } else {
        for (size_type i = 0; i < words; ++i) {
          new (&fixed[i]) word_type(val);
        }
      }
    }
    Storage() = delete;
    ~Storage() {};
  } storage;

  static constexpr size_type Words(size_type N) {
    return (N * bitsof<value_type>() + bitsof<word_type>() - 1) / bitsof<word_type>();
  };

 public:
  ~bit_array() {
    if (size() > FixedBits) {
      storage.m_allocator.deallocate(storage.pointer, Words(size()));
    } else {
      for (size_type i = 0; i < Words(size()); ++i) {
        storage.fixed[i].~word_type();
      }
    }
  }

  /*
  * Constructors, copies and moves...
  */
  bit_array() = delete;

  constexpr bit_array(const size_type size, const Allocator& allocator = Allocator())
      : m_size(size), storage(Words(size), allocator) {
  }

  template <std::integral U>
  constexpr bit_array(const size_type size, const U& integral, const Allocator& allocator = Allocator())
      : m_size(size), storage(Words(size), allocator, detail::uninitialized) {
    if (size() * bitsof<value_type>() > bitsof<U>()) {
      Policy::truncation::from_integral(*this, integral);
    } else {
      bit_pointer<U> integral_ptr = bit_pointer<U>(&integral);
      ::bit::copy(integral_ptr, integral_ptr + bitsof<U>(), begin());
    }
    if (bitsof<U>() < size() * bitsof<value_type>()) {
      Policy::extension::from_integral(*this, integral, detail::uninitialized);
    }
  }

  constexpr bit_array(const size_type size, const word_type val, const Allocator& allocator = Allocator())
      : m_size(size), storage(Words(size), val, allocator) {
  }

  constexpr bit_array(const size_type size, const value_type bit_val, const Allocator& allocator = Allocator())
    requires(!std::is_same<value_type, word_type>::value)
      : m_size(size), storage(Words(size), allocator, detail::uninitialized) {
    this->fill(bit_val);
  }

  constexpr bit_array(const bit_array<T, std::dynamic_extent, W, Policy>& other)
      : m_size(other.size()), storage(Words(size()), other.storage) {
  }

  constexpr bit_array(const bit_array<T, std::dynamic_extent, W, Policy>& other, const Allocator& allocator)
      : m_size(other.size()), storage(Words(size()), other.storage, allocator) {
  }

  constexpr bit_array(const bit_sized_range auto& other, const Allocator& allocator = Allocator())
      : bit_array(other.size(), allocator, detail::uninitialized) {
    ::bit::copy(other.begin(), other.end(), this->begin());
  }

  constexpr bit_array(bit_array<T, std::dynamic_extent, W>&& other)
      : m_size(other.size()), storage(Words(size()), std::move(other.storage)) {
  }

  constexpr bit_array(bit_array<T, std::dynamic_extent, W>&& other, const Allocator& allocator)
      : m_size(other.size()), storage(Words(size()), std::move(other.storage), allocator) {
  }

  constexpr bit_array(const std::initializer_list<value_type> init, const Allocator& allocator = Allocator())
    requires(!std::is_same_v<value_type, word_type>)
      : m_size(init.size()), storage(Words(size()), allocator, detail::uninitialized) {
    std::copy(init.begin(), init.end(), this->begin());
  }

#if 0
  No known conversion from bool to bit_value
  bit_value has explicit constructor from bool to bit_value so this doesnt work
  constexpr bit_array<std::dynamic_extent,W>::bit_array(const std::initializer_list<bool> init)
      : storage(std::make_unique<word_type[]>(Words(init.size()))),
        m_size(init.size()) {
    std::copy(init.begin(), init.end(), this->begin());
  }
#endif

  template <typename U>
  constexpr bit_array(const std::initializer_list<U> init, const Allocator& allocator = Allocator())
      : m_size(bitsof<U>() * init.size()), storage(Words(size()), allocator, detail::uninitialized) {
    std::copy(init.begin(), init.end(), data());
  }

  constexpr bit_array(const std::string_view s, const Allocator& allocator = Allocator())
    requires(std::is_same_v<value_type, bit_value>)
      : m_size(std::count(s.begin(), s.end(), '0') + std::count(s.begin(), s.end(), '1')), storage(Words(size()), allocator, detail::uninitialized) {
    size_type i = 0;
    for (char c : s) {
      if (c == '0') {
        begin()[i++] = bit0;
      } else if (c == '1') {
        begin()[i++] = bit1;
      }
    }
  }

  /*
   * Assignment
   */
  constexpr bit_array<T, std::dynamic_extent, W>& operator=(const bit_array<T, std::dynamic_extent, W>& other) {
    if (nullptr == data() || size() != other.size()) {
      throw std::invalid_argument("Cannot reassign bit_array<std::dynamic_extent,V,W> size");
    }
    if (this == &other) [[unlikely]] {
      return *this;
    }
    std::copy(other.begin(), other.end(), this->begin());
    return *this;
  }

  constexpr bit_array<T, std::dynamic_extent, W>& operator=(const bit_sized_range auto& other) {
    if (other.size() != this->size()) [[unlikely]] {
      throw std::invalid_argument("other bit_range contains an invalid number of bits for bit_array.");
    }
    ::bit::copy(other.begin(), other.end(), this->begin());
    return *this;
  };

  constexpr bit_array<T, std::dynamic_extent, W>& operator=(bit_array<T, std::dynamic_extent, W>&& other) {
    if (nullptr == data() || size() != other.size()) {
      throw std::invalid_argument("Cannot reassign bit_array<std::dynamic_extent,V,W> size");
    }
    bit_array<T, std::dynamic_extent, W> temp(std::move(other));
    swap(temp);
    return *this;
  }

  /*
   * Element Access
   */
  constexpr word_type* data() noexcept {
    if (size() > FixedBits) {
      return storage.pointer;
    } else {
      return storage.fixed;
    }
  }

  constexpr const word_type* data() const noexcept {
    if (size() > FixedBits) {
      return storage.pointer;
    } else {
      return storage.fixed;
    }
  }

  /*
   * Iterators
   */
  constexpr iterator begin() noexcept {
    if (size() > FixedBits) {
      return iterator(storage.pointer);
    } else {
      return iterator(storage.fixed);
    }
  }

  constexpr const_iterator begin() const noexcept {
    if (size() > FixedBits) {
      return const_iterator(storage.pointer);
    } else {
      return const_iterator(storage.fixed);
    }
  }

  /*
   * Capacity
   */
  constexpr size_type size() const noexcept {
    return m_size;
  }

  /*
   * Operations
   */
  constexpr void swap(bit_array<T, std::dynamic_extent, W>& other) noexcept {
    assert(size() == other.size());
    if (size() > FixedBits) {
      std::swap(this->storage.pointer, other.storage.pointer);
    } else {
      for (size_type i = 0; i < Words(size()); ++i) {
        std::swap(this->storage.fixed[i], other.storage.fixed[i]);
      }
    }
  }
};

static_assert(bit_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_range concept!");
static_assert(bit_sized_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_sized_range concept!");
#ifdef CONTIGUOUS_RANGE
static_assert(bit_contiguous_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_range concept!");
static_assert(bit_contiguous_sized_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_sized_range concept!");
#endif

// ========================================================================== //
}  // namespace bit

#endif  // _BIT_ARRAY_DYNAMIC_EXTENT_HPP_INCLUDED

1	// ================================= BIT_ARRAY =================================== //
2	// Project: The Experimental Bit Algorithms Library
3	// \file bit_array.hpp
4	// Description: Implementation of bit_array
5	// Creator: Vincent Reverdy
6	// Contributor: Peter McLean [2025]
7	// License: BSD 3-Clause License
8	// ========================================================================== //
9	#ifndef _BIT_ARRAY_DYNAMIC_EXTENT_HPP_INCLUDED
10	#define _BIT_ARRAY_DYNAMIC_EXTENT_HPP_INCLUDED
11
12	#include <algorithm>
13	#include <cstddef>
14	#include <initializer_list>
15	#include <memory>
16	#include <new>
17	#include <span> // std::dynamic_extent
18	#include <stdexcept>
19
20	#include "bitlib/bit-algorithms/bit_algorithm.hpp"
21	#include "bitlib/bit-containers/bit_array.hpp"
22	#include "bitlib/bit-containers/bit_array_base.hpp"
23	#include "bitlib/bit-containers/bit_bitsof.hpp"
24	#include "bitlib/bit-containers/bit_policy.hpp"
25	#include "bitlib/bit-containers/bit_span.hpp"
26	#include "bitlib/bit-iterator/bit.hpp"
27	#include "bitlib/bit_concepts.hpp"
28
29	namespace bit {
30	namespace detail {
31
32	template <typename value_type, typename word_type>
33	struct bit_array_dextent_iterator_types {
34	using iterator = typename std::conditional<std::is_same_v<value_type, bit_value>,
35	bit_iterator<word_type*>,
36	word_type*>::type;
37	using const_iterator = typename std::conditional<std::is_same_v<value_type, bit_value>,
38	bit_iterator<const word_type*>,
39	const word_type*>::type;
40	};
41	} // namespace detail
42	template <typename T, typename W, typename Policy>
43	class bit_array<T, std::dynamic_extent, W, Policy>
44	: public bit_array_base<bit_array<T, std::dynamic_extent, W>, T, std::dynamic_extent, W, Policy, detail::bit_array_dextent_iterator_types<T, W>> {
45	public:
46	using base = bit_array_base<bit_array<T, std::dynamic_extent, W>, T, std::dynamic_extent, W, Policy, detail::bit_array_dextent_iterator_types<T, W>>;
47	using base::end;
48	using typename base::const_iterator;
49	using typename base::const_pointer;
50	using typename base::const_reference;
51	using typename base::difference_type;
52	using typename base::iterator;
53	using typename base::pointer;
54	using typename base::reference;
55	using typename base::size_type;
56	using typename base::value_type;
57	using typename base::word_type;
58	using Allocator = typename Policy::allocator;
59
60	private:
61	using word_type_ptr = word_type*;
62	static const size_type FixedWords = sizeof(word_type_ptr) / sizeof(word_type);
63	static const size_type FixedBits = FixedWords * bitsof<word_type>();
64
65	const size_type m_size;
66
67	struct Storage {
68	union {
69	word_type_ptr pointer;
70	word_type fixed[FixedWords];
71	};
72	Allocator m_allocator;
73
74	Storage(size_type words, const Allocator& allocator, detail::uninitialized_t) : m_allocator(allocator) {	111✔
75	if (words > FixedWords) {	74!
NEW 76	new (&pointer) word_type_ptr(m_allocator.allocate(words));	×
NEW 77	}
78	}	74✔
79
80	Storage(size_type words, const Allocator& allocator = Allocator()) : m_allocator(allocator) {	36✔
81	if (words > FixedWords) {	24!
82	new (&pointer) word_type_ptr(m_allocator.allocate(words));	12✔
83	for (size_type i = 0; i < words; ++i) {	135,403,552!
84	new (pointer + i) word_type();	135,403,544✔
85	}	67,701,772✔
86	} else {	8✔
87	for (size_type i = 0; i < words; ++i) {	32✔
88	new (&fixed[i]) word_type();	16✔
89	}	8✔
90	}	8✔
91	}	24✔
92
93	Storage(size_type words, Storage&& other) {	12✔
94	if (words > FixedWords) {	8!
95	new (&pointer) word_type_ptr(std::move(other.pointer));	×
96	other.pointer = nullptr; // Prevent double deletion	×
97	} else {	4✔
98	for (size_type i = 0; i < words; ++i) {	16✔
99	new (&fixed[i]) word_type(std::move(other.fixed[i]));	8✔
100	}	4✔
101	}	4✔
102	}	8✔
103
104	Storage(size_type words, const Storage& other, const Allocator& allocator = Allocator())	4✔
105	: m_allocator(allocator) {	4✔
106	if (words > FixedWords) {	4!
NEW 107	new (&pointer) word_type_ptr(m_allocator.allocate(words));	×
NEW 108	for (size_t i = 0; i < words; ++i) {	×
NEW 109	new (pointer + i) word_type(other.pointer[i]);	×
NEW 110	}
NEW 111	std::copy_n(other.pointer, words, pointer);	×
112	} else {	2✔
113	for (size_type i = 0; i < words; ++i) {	8✔
114	new (&fixed[i]) word_type(other.fixed[i]);	4✔
115	}	2✔
116	}	2✔
117	}	4✔
118	template <typename U>
119	Storage(size_type words, const U& val, const Allocator& allocator = Allocator())
120	: m_allocator(allocator) {
121	if (words > FixedWords) {
122	new (&pointer) word_type_ptr(m_allocator.allocate(words));
123	for (size_t i = 0; i < words; ++i) {
124	new (pointer + i) word_type(val);
125	}
126	} else {
127	for (size_type i = 0; i < words; ++i) {
128	new (&fixed[i]) word_type(val);
129	}
130	}
131	}
132	Storage() = delete;
133	~Storage() {};	220✔
134	} storage;
135
136	static constexpr size_type Words(size_type N) {	340✔
137	return (N * bitsof<value_type>() + bitsof<word_type>() - 1) / bitsof<word_type>();	340✔
138	};	170✔
139
140	public:
141	~bit_array() {	110✔
142	if (size() > FixedBits) {	110!
143	storage.m_allocator.deallocate(storage.pointer, Words(size()));	8✔
144	} else {	51✔
145	for (size_type i = 0; i < Words(size()); ++i) {	206✔
146	storage.fixed[i].~word_type();	104✔
147	}	52✔
148	}	51✔
149	}	110✔
150
151	/*
152	* Constructors, copies and moves...
153	*/
154	bit_array() = delete;
155
156	constexpr bit_array(const size_type size, const Allocator& allocator = Allocator())	12✔
157	: m_size(size), storage(Words(size), allocator) {	24✔
158	}	24✔
159
160	template <std::integral U>
161	constexpr bit_array(const size_type size, const U& integral, const Allocator& allocator = Allocator())
162	: m_size(size), storage(Words(size), allocator, detail::uninitialized) {
163	if (size() * bitsof<value_type>() > bitsof<U>()) {
164	Policy::truncation::from_integral(*this, integral);
165	} else {
166	bit_pointer<U> integral_ptr = bit_pointer<U>(&integral);
167	::bit::copy(integral_ptr, integral_ptr + bitsof<U>(), begin());
168	}
169	if (bitsof<U>() < size() * bitsof<value_type>()) {
170	Policy::extension::from_integral(*this, integral, detail::uninitialized);
171	}
172	}
173
174	constexpr bit_array(const size_type size, const word_type val, const Allocator& allocator = Allocator())
175	: m_size(size), storage(Words(size), val, allocator) {
176	}
177
178	constexpr bit_array(const size_type size, const value_type bit_val, const Allocator& allocator = Allocator())	22✔
179	requires(!std::is_same<value_type, word_type>::value)
180	: m_size(size), storage(Words(size), allocator, detail::uninitialized) {	44✔
181	this->fill(bit_val);	44✔
182	}	44✔
183
184	constexpr bit_array(const bit_array<T, std::dynamic_extent, W, Policy>& other)	2✔
185	: m_size(other.size()), storage(Words(size()), other.storage) {	8✔
186	}	4✔
187
188	constexpr bit_array(const bit_array<T, std::dynamic_extent, W, Policy>& other, const Allocator& allocator)
189	: m_size(other.size()), storage(Words(size()), other.storage, allocator) {
190	}
191
192	constexpr bit_array(const bit_sized_range auto& other, const Allocator& allocator = Allocator())
193	: bit_array(other.size(), allocator, detail::uninitialized) {
194	::bit::copy(other.begin(), other.end(), this->begin());
195	}
196
197	constexpr bit_array(bit_array<T, std::dynamic_extent, W>&& other)	4✔
198	: m_size(other.size()), storage(Words(size()), std::move(other.storage)) {	8✔
199	}	8✔
200
201	constexpr bit_array(bit_array<T, std::dynamic_extent, W>&& other, const Allocator& allocator)
202	: m_size(other.size()), storage(Words(size()), std::move(other.storage), allocator) {
203	}
204
205	constexpr bit_array(const std::initializer_list<value_type> init, const Allocator& allocator = Allocator())	12✔
206	requires(!std::is_same_v<value_type, word_type>)
207	: m_size(init.size()), storage(Words(size()), allocator, detail::uninitialized) {	24✔
208	std::copy(init.begin(), init.end(), this->begin());	24✔
209	}	24✔
210
211	#if 0
212	No known conversion from bool to bit_value
213	bit_value has explicit constructor from bool to bit_value so this doesnt work
214	constexpr bit_array<std::dynamic_extent,W>::bit_array(const std::initializer_list<bool> init)
215	: storage(std::make_unique<word_type[]>(Words(init.size()))),
216	m_size(init.size()) {
217	std::copy(init.begin(), init.end(), this->begin());
218	}
219	#endif
220
221	template <typename U>
222	constexpr bit_array(const std::initializer_list<U> init, const Allocator& allocator = Allocator())	1✔
223	: m_size(bitsof<U>() * init.size()), storage(Words(size()), allocator, detail::uninitialized) {	2✔
224	std::copy(init.begin(), init.end(), data());	2✔
225	}	2✔
226
227	constexpr bit_array(const std::string_view s, const Allocator& allocator = Allocator())	2✔
228	requires(std::is_same_v<value_type, bit_value>)
229	: m_size(std::count(s.begin(), s.end(), '0') + std::count(s.begin(), s.end(), '1')), storage(Words(size()), allocator, detail::uninitialized) {	4✔
230	size_type i = 0;	4✔
231	for (char c : s) {	32✔
232	if (c == '0') {	30✔
233	begin()[i++] = bit0;	14✔
234	} else if (c == '1') {	16!
235	begin()[i++] = bit1;	16✔
236	}	8✔
237	}	15✔
238	}	4✔
239
240	/*
241	* Assignment
242	*/
243	constexpr bit_array<T, std::dynamic_extent, W>& operator=(const bit_array<T, std::dynamic_extent, W>& other) {	6✔
244	if (nullptr == data() \|\| size() != other.size()) {	6!
245	throw std::invalid_argument("Cannot reassign bit_array<std::dynamic_extent,V,W> size");	4✔
246	}	2✔
247	if (this == &other) [[unlikely]] {	2!
248	return *this;	×
UNCOV 249	}
250	std::copy(other.begin(), other.end(), this->begin());	2✔
251	return *this;	2✔
252	}	1✔
253
254	constexpr bit_array<T, std::dynamic_extent, W>& operator=(const bit_sized_range auto& other) {	4✔
255	if (other.size() != this->size()) [[unlikely]] {	4✔
256	throw std::invalid_argument("other bit_range contains an invalid number of bits for bit_array.");	2✔
257	}	1✔
258	::bit::copy(other.begin(), other.end(), this->begin());	2✔
259	return *this;	3✔
260	};	2✔
261
262	constexpr bit_array<T, std::dynamic_extent, W>& operator=(bit_array<T, std::dynamic_extent, W>&& other) {	8✔
263	if (nullptr == data() \|\| size() != other.size()) {	8!
264	throw std::invalid_argument("Cannot reassign bit_array<std::dynamic_extent,V,W> size");	2✔
265	}	1✔
266	bit_array<T, std::dynamic_extent, W> temp(std::move(other));	6✔
267	swap(temp);	6✔
268	return *this;	9✔
269	}	7✔
270
271	/*
272	* Element Access
273	*/
274	constexpr word_type* data() noexcept {	36✔
275	if (size() > FixedBits) {	36!
NEW 276	return storage.pointer;	×
277	} else {	18✔
278	return storage.fixed;	36✔
279	}	18✔
280	}	18✔
281
282	constexpr const word_type* data() const noexcept {
283	if (size() > FixedBits) {
284	return storage.pointer;
285	} else {
286	return storage.fixed;
287	}
288	}
289
290	/*
291	* Iterators
292	*/
293	constexpr iterator begin() noexcept {	1,702✔
294	if (size() > FixedBits) {	1,702!
295	return iterator(storage.pointer);	842✔
296	} else {	430✔
297	return iterator(storage.fixed);	860✔
298	}	430✔
299	}	851✔
300
301	constexpr const_iterator begin() const noexcept {	44✔
302	if (size() > FixedBits) {	44!
NEW 303	return const_iterator(storage.pointer);	×
304	} else {	22✔
305	return const_iterator(storage.fixed);	44✔
306	}	22✔
307	}	22✔
308
309	/*
310	* Capacity
311	*/
312	constexpr size_type size() const noexcept {	2,658✔
313	return m_size;	2,658✔
314	}	1,329✔
315
316	/*
317	* Operations
318	*/
319	constexpr void swap(bit_array<T, std::dynamic_extent, W>& other) noexcept {	8✔
320	assert(size() == other.size());	8!
321	if (size() > FixedBits) {	8!
322	std::swap(this->storage.pointer, other.storage.pointer);	×
323	} else {	4✔
324	for (size_type i = 0; i < Words(size()); ++i) {	16✔
325	std::swap(this->storage.fixed[i], other.storage.fixed[i]);	8✔
326	}	4✔
327	}	4✔
328	}	8✔
329	};
330
331	static_assert(bit_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_range concept!");
332	static_assert(bit_sized_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_sized_range concept!");
333	#ifdef CONTIGUOUS_RANGE
334	static_assert(bit_contiguous_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_range concept!");
335	static_assert(bit_contiguous_sized_range<bit_array<>>, "bit_array<> does not satisfy bit_contiguous_sized_range concept!");
336	#endif
337
338	// ========================================================================== //
339	} // namespace bit
340
341	#endif // _BIT_ARRAY_DYNAMIC_EXTENT_HPP_INCLUDED

PeterCDMcLean / BitLib / 15668665368

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous