118 lines
3.3 KiB
C++
118 lines
3.3 KiB
C++
#ifndef SQL_ARRAY_INCLUDED
|
|
#define SQL_ARRAY_INCLUDED
|
|
|
|
/* Copyright (c) 2005, 2014, Oracle and/or its affiliates. All rights reserved.
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; version 2 of the License.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software Foundation,
|
|
51 Franklin Street, Suite 500, Boston, MA 02110-1335 USA */
|
|
|
|
#include <my_dbug.h>
|
|
|
|
/**
|
|
A wrapper class which provides array bounds checking.
|
|
We do *not* own the array, we simply have a pointer to the first element,
|
|
and a length.
|
|
|
|
@remark
|
|
We want the compiler-generated versions of:
|
|
- the copy CTOR (memberwise initialization)
|
|
- the assignment operator (memberwise assignment)
|
|
|
|
@param Element_type The type of the elements of the container.
|
|
*/
|
|
template <typename Element_type> class Bounds_checked_array
|
|
{
|
|
public:
|
|
// Convenience typedef, same typedef name as std::vector
|
|
typedef Element_type value_type;
|
|
|
|
Bounds_checked_array() : m_array(NULL), m_size(0) {}
|
|
|
|
Bounds_checked_array(Element_type *el, size_t size_arg)
|
|
: m_array(el), m_size(size_arg)
|
|
{}
|
|
|
|
void reset() { m_array= NULL; m_size= 0; }
|
|
|
|
void reset(Element_type *array, size_t size)
|
|
{
|
|
m_array= array;
|
|
m_size= size;
|
|
}
|
|
|
|
/**
|
|
Set a new bound on the array. Does not resize the underlying
|
|
array, so the new size must be smaller than or equal to the
|
|
current size.
|
|
*/
|
|
void resize(size_t new_size)
|
|
{
|
|
DBUG_ASSERT(new_size <= m_size);
|
|
m_size= new_size;
|
|
}
|
|
|
|
Element_type &operator[](size_t n)
|
|
{
|
|
DBUG_ASSERT(n < m_size);
|
|
return m_array[n];
|
|
}
|
|
|
|
const Element_type &operator[](size_t n) const
|
|
{
|
|
DBUG_ASSERT(n < m_size);
|
|
return m_array[n];
|
|
}
|
|
|
|
typedef Element_type *iterator;
|
|
typedef const Element_type *const_iterator;
|
|
|
|
/// begin : Returns a pointer to the first element in the array.
|
|
iterator begin() { return m_array; }
|
|
/// end : Returns a pointer to the past-the-end element in the array.
|
|
iterator end() { return m_array + size(); }
|
|
|
|
/// begin : Returns a pointer to the first element in the array.
|
|
const_iterator begin() const { return m_array; }
|
|
/// end : Returns a pointer to the past-the-end element in the array.
|
|
const_iterator end() const { return m_array + size(); }
|
|
|
|
size_t element_size() const { return sizeof(Element_type); }
|
|
size_t size() const { return m_size; }
|
|
|
|
bool is_null() const { return m_array == NULL; }
|
|
|
|
void pop_front()
|
|
{
|
|
DBUG_ASSERT(m_size > 0);
|
|
m_array+= 1;
|
|
m_size-= 1;
|
|
}
|
|
|
|
Element_type *array() const { return m_array; }
|
|
|
|
bool operator==(const Bounds_checked_array<Element_type>&rhs) const
|
|
{
|
|
return m_array == rhs.m_array && m_size == rhs.m_size;
|
|
}
|
|
bool operator!=(const Bounds_checked_array<Element_type>&rhs) const
|
|
{
|
|
return m_array != rhs.m_array || m_size != rhs.m_size;
|
|
}
|
|
|
|
private:
|
|
Element_type *m_array;
|
|
size_t m_size;
|
|
};
|
|
|
|
#endif /* SQL_ARRAY_INCLUDED */
|