uninitialized.hpp

浏览该文件的文档.

#ifndef NEFORCE_CORE_MEMORY_UNINITIALIZED_HPP__
#define NEFORCE_CORE_MEMORY_UNINITIALIZED_HPP__

 
#include "NeForce/core/algorithm/shift.hpp"
#include "NeForce/core/memory/construct.hpp"
NEFORCE_BEGIN_NAMESPACE__


NEFORCE_BEGIN_INNER__

template <typename Iterator1, typename Iterator2,
          enable_if_t<is_trivially_copy_assignable_v<iter_value_t<Iterator1>>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_copy_aux(Iterator1 first, Iterator1 last, Iterator2 result) {
    return _NEFORCE copy(first, last, result);
}

template <typename Iterator1, typename Iterator2,
          enable_if_t<!is_trivially_copy_assignable_v<iter_value_t<Iterator1>>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_copy_aux(Iterator1 first, Iterator1 last, Iterator2 result) {
    Iterator2 cur = result;
    try {
        for (; first != last; ++first, ++cur) {
            _NEFORCE construct(&*cur, *first);
        }
    } catch (...) {
        while (cur != result) {
            --cur;
            _NEFORCE destroy(&*cur);
        }
        throw;
    }
    return cur;
}
 
NEFORCE_END_INNER__

template <typename Iterator1, typename Iterator2, enable_if_t<is_ranges_fwd_iter_v<Iterator2>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 uninitialized_copy(Iterator1 first, Iterator1 last, Iterator2 result) {
    if (first == last) {
        return result;
    }
    return inner::__uninitialized_copy_aux(first, last, result);
}

NEFORCE_BEGIN_INNER__

template <typename Iterator1, typename Iterator2, enable_if_t<!is_ranges_rnd_iter_v<Iterator1>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_copy_n_aux(Iterator1 first, size_t count, Iterator2 result) {
    Iterator2 cur = result;
    try {
        for (; count > 0; --count, ++first, ++cur) {
            _NEFORCE construct(&*cur, *first);
        }
    } catch (...) {
        for (; result != cur; --cur) {
            _NEFORCE destroy(&*cur);
        }
        throw;
    }
    return cur;
}

template <typename Iterator1, typename Iterator2, enable_if_t<is_ranges_rnd_iter_v<Iterator1>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_copy_n_aux(Iterator1 first, size_t count, Iterator2 result) {
    return inner::__uninitialized_copy_aux(first, first + count, result);
}
 
NEFORCE_END_INNER__

template <typename Iterator1, typename Iterator2, enable_if_t<is_ranges_fwd_iter_v<Iterator2>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 uninitialized_copy_n(Iterator1 first, size_t count, Iterator2 result) {
    return inner::__uninitialized_copy_n_aux(first, count, result);
}

NEFORCE_BEGIN_INNER__

template <typename Iterator, typename T, enable_if_t<is_trivially_copy_assignable_v<iter_value_t<Iterator>>, int> = 0>
NEFORCE_CONSTEXPR20 void __uninitialized_fill_aux(Iterator first, Iterator last, const T& x) {
    for (; first != last; ++first) {
        _NEFORCE construct(&*first, x);
    }
}

template <typename Iterator, typename T, enable_if_t<!is_trivially_copy_assignable_v<iter_value_t<Iterator>>, int> = 0>
NEFORCE_CONSTEXPR20 void __uninitialized_fill_aux(Iterator first, Iterator last, const T& x) {
    Iterator cur = first;
    try {
        for (; cur != last; ++cur) {
            _NEFORCE construct(&*cur, x);
        }
    } catch (...) {
        for (; cur != first; --cur) {
            _NEFORCE destroy(&*cur);
        }
        throw;
    }
}
 
NEFORCE_END_INNER__

template <typename Iterator, typename T, enable_if_t<is_ranges_fwd_iter_v<Iterator>, int> = 0>
NEFORCE_CONSTEXPR20 void uninitialized_fill(Iterator first, Iterator last, const T& x) {
    if (first == last) {
        return;
    }
    inner::__uninitialized_fill_aux(first, last, x);
}

NEFORCE_BEGIN_INNER__

template <typename Iterator, typename T, enable_if_t<is_trivially_copy_assignable_v<iter_value_t<Iterator>>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator __uninitialized_fill_n_aux(Iterator first, size_t n, const T& x) {
    Iterator cur = first;
    for (size_t i = 0; i != n; ++i, ++cur) {
        _NEFORCE construct(&*cur, x);
    }
    return cur;
}

template <typename Iterator, typename T, enable_if_t<!is_trivially_copy_assignable_v<iter_value_t<Iterator>>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator __uninitialized_fill_n_aux(Iterator first, size_t n, const T& x) {
    Iterator cur = first;
    try {
        for (; n > 0; --n, ++cur) {
            _NEFORCE construct(&*cur, x);
        }
    } catch (...) {
        for (; cur != first; --cur) {
            _NEFORCE destroy(&*cur);
        }
        throw;
    }
    return cur;
}
 
NEFORCE_END_INNER__

template <typename Iterator, typename T, enable_if_t<is_ranges_fwd_iter_v<Iterator>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator uninitialized_fill_n(Iterator first, size_t n, const T& x) {
    return inner::__uninitialized_fill_n_aux(first, n, x);
}

NEFORCE_BEGIN_INNER__

template <typename Iterator1, typename Iterator2,
          enable_if_t<is_trivially_copy_assignable_v<iter_value_t<Iterator1>>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_move_aux(Iterator1 first, Iterator1 last, Iterator2 result) {
    const auto n = static_cast<size_t>(last - first);
    const auto bytes = n * sizeof(iter_value_t<Iterator1>);
    _NEFORCE memory_move(_NEFORCE addressof(*result), _NEFORCE addressof(*first), bytes);
    return _NEFORCE next(result, n);
}

template <typename Iterator1, typename Iterator2,
          enable_if_t<!is_trivially_copy_assignable_v<iter_value_t<Iterator1>>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_move_aux(Iterator1 first, Iterator1 last, Iterator2 result) {
    Iterator2 cur = result;
    try {
        for (; first != last; ++first, ++cur) {
            _NEFORCE construct(&*cur, _NEFORCE move(*first));
        }
    } catch (...) {
        for (; result != cur; --cur) {
            _NEFORCE destroy(&*cur);
        }
        throw;
    }
    return cur;
}
NEFORCE_END_INNER__

template <typename Iterator1, typename Iterator2,
          enable_if_t<is_ranges_input_iter_v<Iterator1> && is_ranges_fwd_iter_v<Iterator2>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 uninitialized_move(Iterator1 first, Iterator1 last, Iterator2 result) {
    if (first == last) {
        return result;
    }
    return inner::__uninitialized_move_aux(first, last, result);
}

NEFORCE_BEGIN_INNER__

template <typename Iterator1, typename Iterator2, enable_if_t<!is_ranges_rnd_iter_v<Iterator1>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_move_n_aux(Iterator1 first, size_t count, Iterator2 result) {
    Iterator2 cur = result;
    try {
        for (; count > 0; --count, ++first, ++cur) {
            _NEFORCE construct(&*cur, _NEFORCE move(*first));
        }
    } catch (...) {
        for (; result != cur; --cur) {
            _NEFORCE destroy(&*cur);
        }
        throw;
    }
    return cur;
}

template <typename Iterator1, typename Iterator2, enable_if_t<is_ranges_rnd_iter_v<Iterator1>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 __uninitialized_move_n_aux(Iterator1 first, size_t count, Iterator2 result) {
    return inner::__uninitialized_move_aux(first, first + count, result);
}
 
NEFORCE_END_INNER__

template <typename Iterator1, typename Iterator2,
          enable_if_t<is_ranges_input_iter_v<Iterator1> && is_ranges_fwd_iter_v<Iterator2>, int> = 0>
NEFORCE_CONSTEXPR20 Iterator2 uninitialized_move_n(Iterator1 first, size_t count, Iterator2 result) {
    return inner::__uninitialized_move_n_aux(first, count, result);
}
 // UninitializedAlgorithms
 
NEFORCE_END_NAMESPACE__
#endif // NEFORCE_CORE_MEMORY_UNINITIALIZED_HPP__