mirror of
https://github.com/RGBCube/serenity
synced 2025-07-27 18:57:35 +00:00
AK: Inline busy functions in Vector
This commit is contained in:
parent
dace14e70d
commit
d0106c129a
1 changed files with 9 additions and 9 deletions
18
AK/Vector.h
18
AK/Vector.h
|
@ -250,7 +250,7 @@ public:
|
||||||
// NOTE: Vector::is_null() exists for the benefit of String::copy().
|
// NOTE: Vector::is_null() exists for the benefit of String::copy().
|
||||||
bool is_null() const { return false; }
|
bool is_null() const { return false; }
|
||||||
bool is_empty() const { return size() == 0; }
|
bool is_empty() const { return size() == 0; }
|
||||||
size_t size() const { return m_size; }
|
ALWAYS_INLINE size_t size() const { return m_size; }
|
||||||
size_t capacity() const { return m_capacity; }
|
size_t capacity() const { return m_capacity; }
|
||||||
|
|
||||||
T* data()
|
T* data()
|
||||||
|
@ -266,19 +266,19 @@ public:
|
||||||
return m_outline_buffer;
|
return m_outline_buffer;
|
||||||
}
|
}
|
||||||
|
|
||||||
const T& at(size_t i) const
|
ALWAYS_INLINE const T& at(size_t i) const
|
||||||
{
|
{
|
||||||
ASSERT(i >= 0 && i < m_size);
|
ASSERT(i >= 0 && i < m_size);
|
||||||
return data()[i];
|
return data()[i];
|
||||||
}
|
}
|
||||||
T& at(size_t i)
|
ALWAYS_INLINE T& at(size_t i)
|
||||||
{
|
{
|
||||||
ASSERT(i >= 0 && i < m_size);
|
ASSERT(i >= 0 && i < m_size);
|
||||||
return data()[i];
|
return data()[i];
|
||||||
}
|
}
|
||||||
|
|
||||||
const T& operator[](size_t i) const { return at(i); }
|
ALWAYS_INLINE const T& operator[](size_t i) const { return at(i); }
|
||||||
T& operator[](size_t i) { return at(i); }
|
ALWAYS_INLINE T& operator[](size_t i) { return at(i); }
|
||||||
|
|
||||||
const T& first() const { return at(0); }
|
const T& first() const { return at(0); }
|
||||||
T& first() { return at(0); }
|
T& first() { return at(0); }
|
||||||
|
@ -437,14 +437,14 @@ public:
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void unchecked_append(T&& value)
|
ALWAYS_INLINE void unchecked_append(T&& value)
|
||||||
{
|
{
|
||||||
ASSERT((size() + 1) <= capacity());
|
ASSERT((size() + 1) <= capacity());
|
||||||
new (slot(m_size)) T(move(value));
|
new (slot(m_size)) T(move(value));
|
||||||
++m_size;
|
++m_size;
|
||||||
}
|
}
|
||||||
|
|
||||||
void unchecked_append(const T& value)
|
ALWAYS_INLINE void unchecked_append(const T& value)
|
||||||
{
|
{
|
||||||
unchecked_append(T(value));
|
unchecked_append(T(value));
|
||||||
}
|
}
|
||||||
|
@ -457,14 +457,14 @@ public:
|
||||||
++m_size;
|
++m_size;
|
||||||
}
|
}
|
||||||
|
|
||||||
void append(T&& value)
|
ALWAYS_INLINE void append(T&& value)
|
||||||
{
|
{
|
||||||
grow_capacity(size() + 1);
|
grow_capacity(size() + 1);
|
||||||
new (slot(m_size)) T(move(value));
|
new (slot(m_size)) T(move(value));
|
||||||
++m_size;
|
++m_size;
|
||||||
}
|
}
|
||||||
|
|
||||||
void append(const T& value)
|
ALWAYS_INLINE void append(const T& value)
|
||||||
{
|
{
|
||||||
append(T(value));
|
append(T(value));
|
||||||
}
|
}
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue