2023-01-10 14:26:54 +00:00
|
|
|
/**************************************************************************/
|
|
|
|
/* array.h */
|
|
|
|
/**************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* GODOT ENGINE */
|
|
|
|
/* https://godotengine.org */
|
|
|
|
/**************************************************************************/
|
|
|
|
/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
|
|
|
|
/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
|
|
|
|
/* */
|
|
|
|
/* Permission is hereby granted, free of charge, to any person obtaining */
|
|
|
|
/* a copy of this software and associated documentation files (the */
|
|
|
|
/* "Software"), to deal in the Software without restriction, including */
|
|
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
|
|
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
|
|
|
/* permit persons to whom the Software is furnished to do so, subject to */
|
|
|
|
/* the following conditions: */
|
|
|
|
/* */
|
|
|
|
/* The above copyright notice and this permission notice shall be */
|
|
|
|
/* included in all copies or substantial portions of the Software. */
|
|
|
|
/* */
|
|
|
|
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
|
|
|
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
|
|
|
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
|
|
|
|
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
|
|
|
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
|
|
|
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
|
|
|
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
|
|
|
/**************************************************************************/
|
2018-01-04 23:50:27 +00:00
|
|
|
|
2014-02-10 01:10:30 +00:00
|
|
|
#ifndef ARRAY_H
|
|
|
|
#define ARRAY_H
|
|
|
|
|
2018-09-11 16:13:45 +00:00
|
|
|
#include "core/typedefs.h"
|
|
|
|
|
2014-02-10 01:10:30 +00:00
|
|
|
class Variant;
|
|
|
|
class ArrayPrivate;
|
|
|
|
class Object;
|
|
|
|
class StringName;
|
|
|
|
|
|
|
|
class Array {
|
|
|
|
mutable ArrayPrivate *_p;
|
2017-03-05 15:44:50 +00:00
|
|
|
void _ref(const Array &p_from) const;
|
2014-02-10 01:10:30 +00:00
|
|
|
void _unref() const;
|
|
|
|
|
2020-05-01 16:06:36 +00:00
|
|
|
inline int _clamp_slice_index(int p_index) const;
|
2019-07-17 01:31:58 +00:00
|
|
|
|
2014-02-10 01:10:30 +00:00
|
|
|
public:
|
2017-03-05 15:44:50 +00:00
|
|
|
Variant &operator[](int p_idx);
|
|
|
|
const Variant &operator[](int p_idx) const;
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
void set(int p_idx, const Variant &p_value);
|
|
|
|
const Variant &get(int p_idx) const;
|
2014-02-10 01:10:30 +00:00
|
|
|
|
|
|
|
int size() const;
|
|
|
|
bool empty() const;
|
|
|
|
void clear();
|
|
|
|
|
2020-10-07 17:23:06 +00:00
|
|
|
bool deep_equal(const Array &p_array, int p_recursion_count = 0) const;
|
2017-03-05 15:44:50 +00:00
|
|
|
bool operator==(const Array &p_array) const;
|
2014-02-10 01:10:30 +00:00
|
|
|
|
|
|
|
uint32_t hash() const;
|
2017-03-05 15:44:50 +00:00
|
|
|
void operator=(const Array &p_array);
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
void push_back(const Variant &p_value);
|
|
|
|
_FORCE_INLINE_ void append(const Variant &p_value) { push_back(p_value); } //for python compatibility
|
2020-11-08 20:09:45 +00:00
|
|
|
void append_array(const Array &p_array);
|
2014-02-10 01:10:30 +00:00
|
|
|
Error resize(int p_new_size);
|
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
void insert(int p_pos, const Variant &p_value);
|
2014-02-10 01:10:30 +00:00
|
|
|
void remove(int p_pos);
|
2022-04-22 10:45:34 +00:00
|
|
|
void fill(const Variant &p_value);
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2016-11-18 20:30:16 +00:00
|
|
|
Variant front() const;
|
2022-10-15 12:43:16 +00:00
|
|
|
Variant pick_random() const;
|
2016-11-18 20:30:16 +00:00
|
|
|
Variant back() const;
|
|
|
|
|
2017-10-07 15:49:23 +00:00
|
|
|
Array &sort();
|
|
|
|
Array &sort_custom(Object *p_obj, const StringName &p_function);
|
2018-01-10 18:36:53 +00:00
|
|
|
void shuffle();
|
2017-11-02 18:04:38 +00:00
|
|
|
int bsearch(const Variant &p_value, bool p_before = true);
|
|
|
|
int bsearch_custom(const Variant &p_value, Object *p_obj, const StringName &p_function, bool p_before = true);
|
2017-10-07 15:49:23 +00:00
|
|
|
Array &invert();
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
int find(const Variant &p_value, int p_from = 0) const;
|
|
|
|
int rfind(const Variant &p_value, int p_from = -1) const;
|
|
|
|
int find_last(const Variant &p_value) const;
|
|
|
|
int count(const Variant &p_value) const;
|
|
|
|
bool has(const Variant &p_value) const;
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
void erase(const Variant &p_value);
|
2014-02-10 01:10:30 +00:00
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
void push_front(const Variant &p_value);
|
2016-08-27 15:33:45 +00:00
|
|
|
Variant pop_back();
|
|
|
|
Variant pop_front();
|
2021-08-26 23:27:07 +00:00
|
|
|
Variant pop_at(int p_pos);
|
2015-12-12 11:27:30 +00:00
|
|
|
|
2018-03-09 19:16:08 +00:00
|
|
|
Array duplicate(bool p_deep = false) const;
|
2017-09-06 21:13:05 +00:00
|
|
|
|
2019-07-17 01:31:58 +00:00
|
|
|
Array slice(int p_begin, int p_end, int p_step = 1, bool p_deep = false) const;
|
|
|
|
|
2018-08-23 18:31:02 +00:00
|
|
|
Variant min() const;
|
|
|
|
Variant max() const;
|
|
|
|
|
2019-04-19 23:57:29 +00:00
|
|
|
const void *id() const;
|
|
|
|
|
2017-03-05 15:44:50 +00:00
|
|
|
Array(const Array &p_from);
|
2017-01-11 11:53:31 +00:00
|
|
|
Array();
|
2014-02-10 01:10:30 +00:00
|
|
|
~Array();
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif // ARRAY_H
|