![]() |
Blaze 3.9
|
Header file for the SmallArray implementation. More...
#include <algorithm>
#include <iterator>
#include <memory>
#include <blaze/util/algorithms/Destroy.h>
#include <blaze/util/algorithms/DestroyAt.h>
#include <blaze/util/algorithms/Max.h>
#include <blaze/util/algorithms/UninitializedDefaultConstruct.h>
#include <blaze/util/algorithms/UninitializedMove.h>
#include <blaze/util/Assert.h>
#include <blaze/util/constraints/Const.h>
#include <blaze/util/constraints/Volatile.h>
#include <blaze/util/Exception.h>
#include <blaze/util/InitializerList.h>
#include <blaze/util/smallarray/SmallArrayData.h>
#include <blaze/util/Types.h>
#include <blaze/util/typetraits/IsConstructible.h>
#include <blaze/util/typetraits/IsAssignable.h>
Go to the source code of this file.
Classes | |
class | blaze::SmallArray< T, N, A > |
Implementation of a dynamic array with small array optimization. More... | |
struct | blaze::SmallArray< T, N, A >::Uninitialized |
Definition of the nested auxiliary struct Uninitialized. More... | |
Functions | |
SmallArray operators | |
template<typename T1 , size_t N1, typename A1 , typename T2 , size_t N2, typename A2 > | |
bool | blaze::operator== (const SmallArray< T1, N1, A1 > &lhs, const SmallArray< T2, N2, A2 > &rhs) |
Equality operator for the comparison of two dense arrays. More... | |
template<typename T1 , size_t N1, typename A1 , typename T2 , size_t N2, typename A2 > | |
bool | blaze::operator!= (const SmallArray< T1, N1, A1 > &lhs, const SmallArray< T2, N2, A2 > &rhs) |
Inequality operator for the comparison of two dense arrays. More... | |
template<typename T , size_t N, typename A > | |
SmallArray< T, N, A >::Iterator | blaze::begin (SmallArray< T, N, A > &sa) |
Returns an iterator to the first element of the given small array. More... | |
template<typename T , size_t N, typename A > | |
SmallArray< T, N, A >::ConstIterator | blaze::begin (const SmallArray< T, N, A > &sa) |
Returns an iterator to the first element of the given small array. More... | |
template<typename T , size_t N, typename A > | |
SmallArray< T, N, A >::ConstIterator | blaze::cbegin (const SmallArray< T, N, A > &sa) |
Returns an iterator to the first element of the given small array. More... | |
template<typename T , size_t N, typename A > | |
SmallArray< T, N, A >::Iterator | blaze::end (SmallArray< T, N, A > &sa) |
Returns an iterator just past the last element of the given small array. More... | |
template<typename T , size_t N, typename A > | |
SmallArray< T, N, A >::ConstIterator | blaze::end (const SmallArray< T, N, A > &sa) |
Returns an iterator just past the last element of the given small array. More... | |
template<typename T , size_t N, typename A > | |
SmallArray< T, N, A >::ConstIterator | blaze::cend (const SmallArray< T, N, A > &sa) |
Returns an iterator just past the last element of the given small array. More... | |
template<typename T , size_t N, typename A > | |
void | blaze::clear (SmallArray< T, N, A > &sa) |
Clearing the given small array. More... | |
template<typename T , size_t N, typename A > | |
void | blaze::swap (SmallArray< T, N, A > &a, SmallArray< T, N, A > &b) noexcept(IsNothrowMoveConstructible_v< T >) |
Swapping the contents of two small arrays. More... | |
Header file for the SmallArray implementation.
Copyright (C) 2012-2020 Klaus Iglberger - All Rights Reserved
This file is part of the Blaze library. You can redistribute it and/or modify it under the terms of the New (Revised) BSD License. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.