coffee/etl
1
0
Fork 0
mirror of https://github.com/ETLCPP/etl.git synced 2026-04-30 19:09:10 +08:00
Code Issues Packages Projects Releases Wiki Activity

Work in progress

Browse Source
This commit is contained in:
John Wellbelove 2022-02-03 12:40:29 +00:00
parent 19a4b93e78
commit 791aa97885
31 changed files with 615 additions and 126 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
.gitignore vendored
View File

@ -347,3 +347,4 @@ test/build-ninja
test/vs2019/Debug MSVC C++20
test/vs2019/Debug MSVC C++20 - No STL
patches
test/vs2019/Debug MSVC - No Tests

149
include/etl/algorithm.h
View File

@ -96,7 +96,9 @@ namespace etl
{
while (first1 != last1)
{
iter_swap(first1++, first2++);
iter_swap(first1, first2);
++first1;
++first2;
}
return first2;
@ -195,7 +197,8 @@ namespace etl
{
while (sb != se)
{
*(db++) = *(--se);
*db = *--se;
++db;
}
return db;
@ -223,7 +226,9 @@ namespace etl
{
while (count != 0)
{
*db++ = *sb++;
*db = *sb;
++db;
++sb;
--count;
}
@ -255,7 +260,9 @@ namespace etl
{
while (count != 0)
{
*db++ = *sb++;
*db = *sb;
++db;
++sb;
--count;
}
@ -360,7 +367,9 @@ namespace etl
{
while (sb != se)
{
*db++ = etl::move(*sb++);
*db = etl::move(*sb);
++db;
++sb;
}
return db;
@ -826,10 +835,13 @@ namespace etl
{
while (first1 != last1)
{
if (*first1++ != *first2++)
if (*first1 != *first2)
{
return false;
}
++first1;
++first2;
}
return true;
@ -865,10 +877,13 @@ namespace etl
{
while (first1 != last1)
{
if (*first1++ != *first2++)
if (*first1 != *first2)
{
return false;
}
++first1;
++first2;
}
return true;
@ -897,10 +912,13 @@ namespace etl
{
while (first1 != last1)
{
if (!predicate(*first1++, *first2++))
if (!predicate(*first1, *first2))
{
return false;
}
++first1;
++first2;
}
return true;
@ -914,10 +932,13 @@ namespace etl
{
while ((first1 != last1) && (first2 != last2))
{
if (*first1++ != *first2++)
if (*first1 != *first2)
{
return false;
}
++first1;
++first2;
}
return (first1 == last1) && (first2 == last2);
@ -931,10 +952,13 @@ namespace etl
{
while ((first1 != last1) && (first2 != last2))
{
if (!predicate(*first1++ , *first2++))
if (!predicate(*first1 , *first2))
{
return false;
}
++first1;
++first2;
}
return (first1 == last1) && (first2 == last2);
@ -1030,7 +1054,8 @@ namespace etl
{
while (first != last)
{
unary_operation(*first++);
unary_operation(*first);
++first;
}
return unary_operation;
@ -1044,7 +1069,10 @@ namespace etl
{
while (first1 != last1)
{
*d_first++ = unary_operation(*first1++);
*d_first = unary_operation(*first1);
++d_first;
++first1;
}
return d_first;
@ -1056,7 +1084,11 @@ namespace etl
{
while (first1 != last1)
{
*d_first++ = binary_operation(*first1++, *first2++);
*d_first = binary_operation(*first1, *first2);
++d_first;
++first1;
++first2;
}
return d_first;
@ -1343,7 +1375,10 @@ namespace etl
{
using ETL_OR_STD::swap; // Allow ADL
swap(*first++, *next++);
swap(*first, *next);
++first;
++next;
if (next == last)
{
@ -1891,18 +1926,22 @@ namespace etl
{
while (begin != end)
{
if (!predicate(*begin++))
if (!predicate(*begin))
{
break;
}
++begin;
}
while (begin != end)
{
if (predicate(*begin++))
if (predicate(*begin))
{
return false;
}
++begin;
}
return true;
@ -1951,12 +1990,16 @@ namespace etl
{
if (predicate(*begin))
{
*destination_true++ = *begin++;
*destination_true = *begin;
++destination_true;
}
else
{
*destination_false++ = *begin++;
*destination_false = *begin;
++destination_false;
}
++begin;
}
return ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse>(destination_true, destination_false);
@ -1978,7 +2021,8 @@ namespace etl
{
if (predicate(*begin))
{
*out++ = *begin;
*out = *begin;
++out;
}
++begin;
@ -2132,7 +2176,8 @@ namespace etl
{
while (first != last)
{
sum = etl::move(sum) + *first++;
sum = etl::move(sum) + *first;
++first;
}
return sum;
@ -2148,7 +2193,8 @@ namespace etl
{
while (first != last)
{
sum = operation(etl::move(sum), *first++);
sum = operation(etl::move(sum), *first);
++first;
}
return sum;
@ -2190,7 +2236,8 @@ namespace etl
{
if (!(*itr == value))
{
*first++ = etl::move(*itr);
*first = etl::move(*itr);
++first;
}
++itr;
@ -2218,7 +2265,8 @@ namespace etl
{
if (!predicate(*itr))
{
*first++ = etl::move(*itr);
*first = etl::move(*itr);
++first;
}
++itr;
@ -2285,7 +2333,9 @@ namespace etl
{
while ((i_begin != i_end) && (o_begin != o_end))
{
*o_begin++ = *i_begin++;
*o_begin = *i_begin;
++o_begin;
++i_begin;
}
return o_begin;
@ -2307,7 +2357,9 @@ namespace etl
{
while ((n-- > 0) && (o_begin != o_end))
{
*o_begin++ = *i_begin++;
*o_begin = *i_begin;
++o_begin;
++i_begin;
}
return o_begin;
@ -2330,7 +2382,9 @@ namespace etl
{
while ((n1-- > 0) && (n2-- > 0))
{
*o_begin++ = *i_begin++;
*o_begin = *i_begin;
++o_begin;
++i_begin;
}
return o_begin;
@ -2356,7 +2410,8 @@ namespace etl
{
if (predicate(*i_begin))
{
*o_begin++ = *i_begin;
*o_begin = *i_begin;
++o_begin;
}
++i_begin;
@ -2384,7 +2439,8 @@ namespace etl
{
if (predicate(*i_begin))
{
*o_begin++ = *i_begin;
*o_begin = *i_begin;
++o_begin;
}
++i_begin;
@ -2443,7 +2499,9 @@ namespace etl
{
while ((i_begin != i_end) && (o_begin != o_end))
{
*o_begin++ = etl::move(*i_begin++);
*o_begin = etl::move(*i_begin);
++i_begin;
++o_begin;
}
return o_begin;
@ -2561,7 +2619,8 @@ namespace etl
{
while (n-- > 0)
{
function(*begin++);
function(*begin);
++begin;
}
return begin;
@ -2610,7 +2669,9 @@ namespace etl
{
while ((i_begin != i_end) && (o_begin != o_end))
{
*o_begin++ = function(*i_begin++);
*o_begin = function(*i_begin);
++i_begin;
++o_begin;
}
return o_begin;
@ -2681,7 +2742,8 @@ namespace etl
{
if (predicate(*i_begin))
{
*o_begin++ = function(*i_begin);
*o_begin = function(*i_begin);
++o_begin;
}
++i_begin;
@ -2711,7 +2773,8 @@ namespace etl
{
if (predicate(*i_begin1, *i_begin2))
{
*o_begin++ = function(*i_begin1, *i_begin2);
*o_begin = function(*i_begin1, *i_begin2);
++o_begin;
}
++i_begin1;
@ -2741,7 +2804,8 @@ namespace etl
{
if (predicate(*i_begin))
{
*o_begin++ = function(*i_begin);
*o_begin = function(*i_begin);
++o_begin;
}
++i_begin;
@ -2803,12 +2867,16 @@ namespace etl
{
if (predicate(*begin))
{
*destination_true++ = function_true(*begin++);
*destination_true = function_true(*begin);
++destination_true;
}
else
{
*destination_false++ = function_false(*begin++);
*destination_false = function_false(*begin);
++destination_false;
}
++begin;
}
return ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse>(destination_true, destination_false);
@ -2840,12 +2908,17 @@ namespace etl
{
if (predicate(*begin1, *begin2))
{
*destination_true++ = function_true(*begin1++, *begin2++);
*destination_true = function_true(*begin1, *begin2);
++destination_true;
}
else
{
*destination_false++ = function_false(*begin1++, *begin2++);
*destination_false = function_false(*begin1, *begin2);
++destination_false;
}
++begin1;
++begin2;
}
return ETL_OR_STD::pair<TDestinationTrue, TDestinationFalse>(destination_true, destination_false);

6
include/etl/byte_stream.h
View File

@ -165,7 +165,8 @@ namespace etl
while (itr != range.end())
{
to_bytes(*itr++);
to_bytes(*itr);
++itr;
}
}
@ -196,7 +197,8 @@ namespace etl
{
while (length-- != 0U)
{
to_bytes(*start++);
to_bytes(*start);
++start;
}
}

9
include/etl/circular_buffer.h
View File

@ -886,7 +886,8 @@ namespace etl
{
while (first != last)
{
push(*first++);
push(*first);
++first;
}
}
@ -1058,7 +1059,8 @@ namespace etl
{
while (first != last)
{
this->push(*first++);
this->push(*first);
++first;
}
}
@ -1178,7 +1180,8 @@ namespace etl
{
while (first != last)
{
this->push(*first++);
this->push(*first);
++first;
}
}

4
include/etl/correlation.h
View File

@ -135,7 +135,9 @@ namespace etl
{
while (first1 != last1)
{
add(*first1++, *first2++);
add(*first1, *first2);
++first1;
++first2;
}
}

4
include/etl/covariance.h
View File

@ -133,7 +133,9 @@ namespace etl
{
while (first1 != last1)
{
add(*first1++, *first2++);
add(*first1, *first2);
++first1;
++first2;
}
}

18
include/etl/deque.h
View File

@ -725,7 +725,8 @@ namespace etl
while (range_begin != range_end)
{
push_back(*range_begin++);
push_back(*range_begin);
++range_begin;
}
}
@ -1470,7 +1471,8 @@ namespace etl
for (size_t i = 0UL; i < n_create_copy; ++i)
{
create_element_back(*from++);
create_element_back(*from);
++from;
}
// Move old.
@ -1511,7 +1513,8 @@ namespace etl
{
for (difference_type i = 0; i < n; ++i)
{
create_element_back(*range_begin++);
create_element_back(*range_begin);
++range_begin;
}
position = _end - n;
@ -1566,7 +1569,8 @@ namespace etl
TIterator item = range_begin + (n - n_create_new);
for (size_t i = 0UL; i < n_create_new; ++i)
{
create_element_back(*item++);
create_element_back(*item);
++item;
}
// Create copy.
@ -1574,7 +1578,8 @@ namespace etl
for (size_t i = 0UL; i < n_create_copy; ++i)
{
create_element_back(*from++);
create_element_back(*from);
++from;
}
// Move old.
@ -2136,7 +2141,8 @@ namespace etl
do
{
::new (&(*item++)) T(*from);
::new (&(*item)) T(*from);
++item;
++from;
++current_size;
ETL_INCREMENT_DEBUG_COUNT

9
include/etl/flat_map.h
View File

@ -299,7 +299,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -391,7 +392,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -979,7 +981,8 @@ namespace etl
// Add all of the elements.
while (first != last)
{
this->insert(etl::move(*first++));
this->insert(etl::move(*first));
++first;
}
}
}

9
include/etl/flat_multimap.h
View File

@ -249,7 +249,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -333,7 +334,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -863,7 +865,8 @@ namespace etl
// Add all of the elements.
while (first != last)
{
this->insert(etl::move(*first++));
this->insert(etl::move(*first));
++first;
}
}
}

9
include/etl/flat_multiset.h
View File

@ -220,7 +220,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -304,7 +305,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -816,7 +818,8 @@ namespace etl
// Add all of the elements.
while (first != last)
{
this->insert(etl::move(*first++));
this->insert(etl::move(*first));
++first;
}
}
}

9
include/etl/flat_set.h
View File

@ -220,7 +220,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -312,7 +313,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -903,7 +905,8 @@ namespace etl
// Add all of the elements.
while (first != last)
{
this->insert(etl::move(*first++));
this->insert(etl::move(*first));
++first;
}
}
}

9
include/etl/forward_list.h
View File

@ -663,7 +663,8 @@ namespace etl
{
ETL_ASSERT(!full(), ETL_ERROR(forward_list_full));
data_node_t& data_node = allocate_data_node(*first++);
data_node_t& data_node = allocate_data_node(*first);
++first;
join(p_last_node, &data_node);
data_node.next = ETL_NULLPTR;
p_last_node = &data_node;
@ -994,7 +995,8 @@ namespace etl
while (first != last)
{
// Set up the next free node.
data_node_t& data_node = allocate_data_node(*first++);
data_node_t& data_node = allocate_data_node(*first);
++first;
insert_node_after(*to_iterator(position).p_node, data_node);
++position;
}
@ -1519,7 +1521,8 @@ namespace etl
{
ETL_ASSERT(!full(), ETL_ERROR(forward_list_full));
data_node_t& data_node = this->allocate_data_node(etl::move(*first++));
data_node_t& data_node = this->allocate_data_node(etl::move(*first));
++first;
join(p_last_node, &data_node);
data_node.next = ETL_NULLPTR;
p_last_node = &data_node;

3
include/etl/frame_check_sequence.h
View File

@ -149,7 +149,8 @@ namespace etl
while (begin != end)
{
frame_check = policy.add(frame_check, *begin++);
frame_check = policy.add(frame_check, *begin);
++begin;
}
}

12
include/etl/histogram.h
View File

@ -188,7 +188,8 @@ namespace etl
{
while (first != last)
{
add(*first++);
add(*first);
++first;
}
}
@ -311,7 +312,8 @@ namespace etl
{
while (first != last)
{
add(*first++);
add(*first);
++first;
}
}
@ -472,7 +474,8 @@ namespace etl
{
while (first != last)
{
add(*first++);
add(*first);
++first;
}
}
@ -547,7 +550,8 @@ namespace etl
while (itr != accumulator.end())
{
sum += (*itr++).second;
sum += (*itr).second;
++itr;
}
return sum;

3
include/etl/intrusive_forward_list.h
View File

@ -603,7 +603,8 @@ namespace etl
while (first != last)
{
// Set up the next free link.
this->insert_link_after(*position.p_value, *first++);
this->insert_link_after(*position.p_value, *first);
++first;
++position;
}
}

3
include/etl/intrusive_list.h
View File

@ -688,7 +688,8 @@ namespace etl
while (first != last)
{
// Set up the next free link.
this->insert_link(*position.p_value->link_type::etl_previous, *first++);
this->insert_link(*position.p_value->link_type::etl_previous, *first);
++first;
}
}

17
include/etl/list.h
View File

@ -1198,7 +1198,8 @@ namespace etl
ETL_ASSERT(!full(), ETL_ERROR(list_full));
// Set up the next free node and insert.
insert_node(*to_iterator(position).p_node, allocate_data_node(*first++));
insert_node(*to_iterator(position).p_node, allocate_data_node(*first));
++first;
}
}
@ -1385,7 +1386,8 @@ namespace etl
typename ilist<T>::iterator itr = other.begin();
while (itr != other.end())
{
to = insert(to, etl::move(*itr++));
to = insert(to, etl::move(*itr));
++itr;
}
other.erase(other.begin(), other.end());
@ -1466,7 +1468,8 @@ namespace etl
ilist::iterator itr = first;
while (itr != last)
{
to = insert(to, etl::move(*itr++));
to = insert(to, etl::move(*itr));
++itr;
++to;
}
@ -1583,8 +1586,9 @@ namespace etl
{
while (other_begin != other_end)
{
insert(this_end, etl::move(*other_begin++));
}
insert(this_end, etl::move(*other_begin));
++other_begin;
}
}
other.clear();
@ -1864,7 +1868,8 @@ namespace etl
{
ETL_ASSERT(!full(), ETL_ERROR(list_full));
insert_node(terminal_node, this->allocate_data_node(etl::move(*first++)));
insert_node(terminal_node, this->allocate_data_node(etl::move(*first)));
++first;
}
rhs.initialise();

24
include/etl/map.h
View File

@ -798,6 +798,13 @@ namespace etl
}
private:
// Convert to an iterator.
imap::iterator to_iterator() const
{
return imap::iterator(const_cast<imap&>(*p_map), const_cast<Node*>(p_node));
}
// Pointer to map associated with this iterator
const imap* p_map;
@ -1102,13 +1109,12 @@ namespace etl
//*************************************************************************
iterator erase(const_iterator first, const_iterator last)
{
iterator next;
while (first != last)
{
next = erase(first++);
first = erase(first);
}
return next;
return last.to_iterator();
}
//*********************************************************************
@ -1259,7 +1265,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -1372,7 +1379,8 @@ namespace etl
while (from != rhs.end())
{
this->insert(etl::move(*from++));
this->insert(etl::move(*from));
++from;
}
}
@ -2624,7 +2632,8 @@ namespace etl
while (from != other.end())
{
this->insert(etl::move(*from++));
this->insert(etl::move(*from));
++from;
}
}
}
@ -2691,7 +2700,8 @@ namespace etl
while (from != rhs.end())
{
this->insert(etl::move(*from++));
this->insert(etl::move(*from));
++from;
}
}

3
include/etl/mean.h
View File

@ -120,7 +120,8 @@ namespace etl
{
while (first != last)
{
add(*first++);
add(*first);
++first;
}
}

9
include/etl/message_router_registry.h
View File

@ -386,7 +386,8 @@ namespace etl
{
while (first != last)
{
add(*first++);
add(*first);
++first;
}
}
@ -526,7 +527,8 @@ namespace etl
{
while (first != last)
{
this->add(*first++);
this->add(*first);
++first;
}
}
@ -541,7 +543,8 @@ namespace etl
while (itr != init.end())
{
this->add(*itr++);
this->add(*itr);
++itr;
}
}
#endif

28
include/etl/multimap.h
View File

@ -954,6 +954,13 @@ namespace etl
}
private:
// Convert to an iterator.
imultimap::iterator to_iterator() const
{
return imultimap::iterator(const_cast<imultimap&>(*p_multimap), const_cast<Node*>(p_node));
}
// Pointer to multimap associated with this iterator
const imultimap* p_multimap;
@ -1185,7 +1192,7 @@ namespace etl
// Increment count for each node removed
++d;
// Remove node using the other erase method
(void)erase(lower++);
lower = erase(lower);
}
// Return the total count erased
@ -1206,7 +1213,7 @@ namespace etl
// Increment count for each node removed
++d;
// Remove node using the other erase method
(void)erase(lower++);
lower = erase(lower);
}
// Return the total count erased
@ -1219,13 +1226,12 @@ namespace etl
//*************************************************************************
iterator erase(const_iterator first, const_iterator last)
{
iterator next;
while (first != last)
{
next = erase(first++);
first = erase(first);
}
return next;
return last.to_iterator();
}
//*********************************************************************
@ -1350,7 +1356,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -1463,7 +1470,8 @@ namespace etl
while (from != rhs.end())
{
this->insert(etl::move(*from++));
this->insert(etl::move(*from));
++from;
}
}
@ -2347,7 +2355,8 @@ namespace etl
while (from != other.end())
{
this->insert(etl::move(*from++));
this->insert(etl::move(*from));
++from;
}
}
}
@ -2411,7 +2420,8 @@ namespace etl
while (from != rhs.end())
{
this->insert(etl::move(*from++));
this->insert(etl::move(*from));
++from;
}
}

6
include/etl/murmur3.h
View File

@ -90,7 +90,8 @@ namespace etl
reset();
while (begin != end)
{
block |= (*begin++) << (block_fill_count * 8U);
block |= (*begin) << (block_fill_count * 8U);
++begin;
if (++block_fill_count == FULL_BLOCK)
{
@ -128,7 +129,8 @@ namespace etl
while (begin != end)
{
block |= (*begin++) << (block_fill_count * 8U);
block |= (*begin) << (block_fill_count * 8U);
++begin;
if (++block_fill_count == FULL_BLOCK)
{

3
include/etl/pearson.h
View File

@ -107,7 +107,8 @@ namespace etl
while (begin != end)
{
add(*begin++);
add(*begin);
++begin;
}
}

3
include/etl/private/pvoidvector.h
View File

@ -346,7 +346,8 @@ namespace etl
while (first != last)
{
*p_end++ = (void*)(*first++);
*p_end++ = (void*)(*first);
++first;
}
}

6
include/etl/reference_flat_map.h
View File

@ -565,7 +565,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -604,7 +605,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}

6
include/etl/reference_flat_multimap.h
View File

@ -453,7 +453,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -496,7 +497,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}

6
include/etl/reference_flat_multiset.h
View File

@ -431,7 +431,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -489,7 +490,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}

6
include/etl/reference_flat_set.h
View File

@ -433,7 +433,8 @@ namespace etl
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}
@ -472,7 +473,8 @@ namespace etl
{
while (first != last)
{
insert(*first++);
insert(*first);
++first;
}
}

3
include/etl/rms.h
View File

@ -122,7 +122,8 @@ namespace etl
{
while (first != last)
{
add(*first++);
add(*first);
++first;
}
}

22
test/vs2019/etl.sln
View File

@ -21,8 +21,8 @@ Global
Debug MSVC - No STL - Force No Advanced|x64 = Debug MSVC - No STL - Force No Advanced|x64
Debug MSVC - No STL|Win32 = Debug MSVC - No STL|Win32
Debug MSVC - No STL|x64 = Debug MSVC - No STL|x64
Debug MSVC - No Unit Tests|Win32 = Debug MSVC - No Unit Tests|Win32
Debug MSVC - No Unit Tests|x64 = Debug MSVC - No Unit Tests|x64
Debug MSVC - No Tests|Win32 = Debug MSVC - No Tests|Win32
Debug MSVC - No Tests|x64 = Debug MSVC - No Tests|x64
Debug MSVC - Small Strings|Win32 = Debug MSVC - Small Strings|Win32
Debug MSVC - Small Strings|x64 = Debug MSVC - Small Strings|x64
Debug MSVC - String Truncation Is Error|Win32 = Debug MSVC - String Truncation Is Error|Win32
@ -33,8 +33,6 @@ Global
Debug MSVC C++20 - No STL|x64 = Debug MSVC C++20 - No STL|x64
Debug MSVC C++20|Win32 = Debug MSVC C++20|Win32
Debug MSVC C++20|x64 = Debug MSVC C++20|x64
Debug MSVC No Checks|Win32 = Debug MSVC No Checks|Win32
Debug MSVC No Checks|x64 = Debug MSVC No Checks|x64
Debug MSVC|Win32 = Debug MSVC|Win32
Debug MSVC|x64 = Debug MSVC|x64
MSVC Debug Appveyor|Win32 = MSVC Debug Appveyor|Win32
@ -73,10 +71,10 @@ Global
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No STL|Win32.Build.0 = Debug - No STL|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No STL|x64.ActiveCfg = DebugNoSTL|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No STL|x64.Build.0 = DebugNoSTL|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Unit Tests|Win32.ActiveCfg = Debug No Unit Tests|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Unit Tests|Win32.Build.0 = Debug No Unit Tests|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Unit Tests|x64.ActiveCfg = Debug No Unit Tests|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Unit Tests|x64.Build.0 = Debug No Unit Tests|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Tests|Win32.ActiveCfg = Debug MSVC - No Tests|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Tests|Win32.Build.0 = Debug MSVC - No Tests|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Tests|x64.ActiveCfg = Debug MSVC - No Tests|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - No Tests|x64.Build.0 = Debug MSVC - No Tests|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - Small Strings|Win32.ActiveCfg = DebugMSVCSmallStrings|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - Small Strings|Win32.Build.0 = DebugMSVCSmallStrings|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC - Small Strings|x64.ActiveCfg = DebugMSVCSmallStrings|x64
@ -97,16 +95,12 @@ Global
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC C++20|Win32.Build.0 = Debug MSVC C++20|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC C++20|x64.ActiveCfg = Debug MSVC C++20|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC C++20|x64.Build.0 = Debug MSVC C++20|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC No Checks|Win32.ActiveCfg = Debug MSVC No Checks|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC No Checks|Win32.Build.0 = Debug MSVC No Checks|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC No Checks|x64.ActiveCfg = Debug MSVC No Checks|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC No Checks|x64.Build.0 = Debug MSVC No Checks|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC|Win32.ActiveCfg = Debug|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC|Win32.Build.0 = Debug|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC|x64.ActiveCfg = Debug|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.Debug MSVC|x64.Build.0 = Debug|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.MSVC Debug Appveyor|Win32.ActiveCfg = MSVC Debug Appveyor|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.MSVC Debug Appveyor|Win32.Build.0 = MSVC Debug Appveyor|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.MSVC Debug Appveyor|Win32.ActiveCfg = Debug|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.MSVC Debug Appveyor|Win32.Build.0 = Debug|Win32
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.MSVC Debug Appveyor|x64.ActiveCfg = MSVC Debug Appveyor|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.MSVC Debug Appveyor|x64.Build.0 = MSVC Debug Appveyor|x64
{C21DF78C-D8E0-46AB-9D6F-D38A3C1CB0FB}.MSVC Debug No STL Appveyor|Win32.ActiveCfg = MSVC Debug No STL Appveyor|Win32

342
test/vs2019/etl.vcxproj
View File

File diff suppressed because it is too large Load Diff