2
0

variant_setget.cpp 99 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488
  1. /*************************************************************************/
  2. /* variant_setget.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2022 Godot Engine contributors (cf. AUTHORS.md). */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /*************************************************************************/
  30. #include "variant_setget.h"
  31. struct VariantSetterGetterInfo {
  32. void (*setter)(Variant *base, const Variant *value, bool &valid);
  33. void (*getter)(const Variant *base, Variant *value);
  34. Variant::ValidatedSetter validated_setter;
  35. Variant::ValidatedGetter validated_getter;
  36. Variant::PTRSetter ptr_setter;
  37. Variant::PTRGetter ptr_getter;
  38. Variant::Type member_type;
  39. };
  40. static LocalVector<VariantSetterGetterInfo> variant_setters_getters[Variant::VARIANT_MAX];
  41. static LocalVector<StringName> variant_setters_getters_names[Variant::VARIANT_MAX]; //one next to another to make it cache friendly
  42. template <class T>
  43. static void register_member(Variant::Type p_type, const StringName &p_member) {
  44. VariantSetterGetterInfo sgi;
  45. sgi.setter = T::set;
  46. sgi.validated_setter = T::validated_set;
  47. sgi.ptr_setter = T::ptr_set;
  48. sgi.getter = T::get;
  49. sgi.validated_getter = T::validated_get;
  50. sgi.ptr_getter = T::ptr_get;
  51. sgi.member_type = T::get_type();
  52. variant_setters_getters[p_type].push_back(sgi);
  53. variant_setters_getters_names[p_type].push_back(p_member);
  54. }
  55. void register_named_setters_getters() {
  56. #define REGISTER_MEMBER(m_base_type, m_member) register_member<VariantSetGet_##m_base_type##_##m_member>(GetTypeInfo<m_base_type>::VARIANT_TYPE, #m_member)
  57. REGISTER_MEMBER(Vector2, x);
  58. REGISTER_MEMBER(Vector2, y);
  59. REGISTER_MEMBER(Vector2i, x);
  60. REGISTER_MEMBER(Vector2i, y);
  61. REGISTER_MEMBER(Vector3, x);
  62. REGISTER_MEMBER(Vector3, y);
  63. REGISTER_MEMBER(Vector3, z);
  64. REGISTER_MEMBER(Vector3i, x);
  65. REGISTER_MEMBER(Vector3i, y);
  66. REGISTER_MEMBER(Vector3i, z);
  67. REGISTER_MEMBER(Vector4, x);
  68. REGISTER_MEMBER(Vector4, y);
  69. REGISTER_MEMBER(Vector4, z);
  70. REGISTER_MEMBER(Vector4, w);
  71. REGISTER_MEMBER(Vector4i, x);
  72. REGISTER_MEMBER(Vector4i, y);
  73. REGISTER_MEMBER(Vector4i, z);
  74. REGISTER_MEMBER(Vector4i, w);
  75. REGISTER_MEMBER(Rect2, position);
  76. REGISTER_MEMBER(Rect2, size);
  77. REGISTER_MEMBER(Rect2, end);
  78. REGISTER_MEMBER(Rect2i, position);
  79. REGISTER_MEMBER(Rect2i, size);
  80. REGISTER_MEMBER(Rect2i, end);
  81. REGISTER_MEMBER(AABB, position);
  82. REGISTER_MEMBER(AABB, size);
  83. REGISTER_MEMBER(AABB, end);
  84. REGISTER_MEMBER(Transform2D, x);
  85. REGISTER_MEMBER(Transform2D, y);
  86. REGISTER_MEMBER(Transform2D, origin);
  87. REGISTER_MEMBER(Plane, x);
  88. REGISTER_MEMBER(Plane, y);
  89. REGISTER_MEMBER(Plane, z);
  90. REGISTER_MEMBER(Plane, d);
  91. REGISTER_MEMBER(Plane, normal);
  92. REGISTER_MEMBER(Quaternion, x);
  93. REGISTER_MEMBER(Quaternion, y);
  94. REGISTER_MEMBER(Quaternion, z);
  95. REGISTER_MEMBER(Quaternion, w);
  96. REGISTER_MEMBER(Basis, x);
  97. REGISTER_MEMBER(Basis, y);
  98. REGISTER_MEMBER(Basis, z);
  99. REGISTER_MEMBER(Transform3D, basis);
  100. REGISTER_MEMBER(Transform3D, origin);
  101. REGISTER_MEMBER(Projection, x);
  102. REGISTER_MEMBER(Projection, y);
  103. REGISTER_MEMBER(Projection, z);
  104. REGISTER_MEMBER(Projection, w);
  105. REGISTER_MEMBER(Color, r);
  106. REGISTER_MEMBER(Color, g);
  107. REGISTER_MEMBER(Color, b);
  108. REGISTER_MEMBER(Color, a);
  109. REGISTER_MEMBER(Color, r8);
  110. REGISTER_MEMBER(Color, g8);
  111. REGISTER_MEMBER(Color, b8);
  112. REGISTER_MEMBER(Color, a8);
  113. REGISTER_MEMBER(Color, h);
  114. REGISTER_MEMBER(Color, s);
  115. REGISTER_MEMBER(Color, v);
  116. }
  117. void unregister_named_setters_getters() {
  118. for (int i = 0; i < Variant::VARIANT_MAX; i++) {
  119. variant_setters_getters[i].clear();
  120. variant_setters_getters_names[i].clear();
  121. }
  122. }
  123. bool Variant::has_member(Variant::Type p_type, const StringName &p_member) {
  124. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, false);
  125. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  126. if (variant_setters_getters_names[p_type][i] == p_member) {
  127. return true;
  128. }
  129. }
  130. return false;
  131. }
  132. Variant::Type Variant::get_member_type(Variant::Type p_type, const StringName &p_member) {
  133. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, Variant::VARIANT_MAX);
  134. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  135. if (variant_setters_getters_names[p_type][i] == p_member) {
  136. return variant_setters_getters[p_type][i].member_type;
  137. }
  138. }
  139. return Variant::NIL;
  140. }
  141. void Variant::get_member_list(Variant::Type p_type, List<StringName> *r_members) {
  142. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  143. r_members->push_back(variant_setters_getters_names[p_type][i]);
  144. }
  145. }
  146. int Variant::get_member_count(Type p_type) {
  147. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, -1);
  148. return variant_setters_getters_names[p_type].size();
  149. }
  150. Variant::ValidatedSetter Variant::get_member_validated_setter(Variant::Type p_type, const StringName &p_member) {
  151. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  152. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  153. if (variant_setters_getters_names[p_type][i] == p_member) {
  154. return variant_setters_getters[p_type][i].validated_setter;
  155. }
  156. }
  157. return nullptr;
  158. }
  159. Variant::ValidatedGetter Variant::get_member_validated_getter(Variant::Type p_type, const StringName &p_member) {
  160. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  161. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  162. if (variant_setters_getters_names[p_type][i] == p_member) {
  163. return variant_setters_getters[p_type][i].validated_getter;
  164. }
  165. }
  166. return nullptr;
  167. }
  168. Variant::PTRSetter Variant::get_member_ptr_setter(Variant::Type p_type, const StringName &p_member) {
  169. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  170. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  171. if (variant_setters_getters_names[p_type][i] == p_member) {
  172. return variant_setters_getters[p_type][i].ptr_setter;
  173. }
  174. }
  175. return nullptr;
  176. }
  177. Variant::PTRGetter Variant::get_member_ptr_getter(Variant::Type p_type, const StringName &p_member) {
  178. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  179. for (uint32_t i = 0; i < variant_setters_getters_names[p_type].size(); i++) {
  180. if (variant_setters_getters_names[p_type][i] == p_member) {
  181. return variant_setters_getters[p_type][i].ptr_getter;
  182. }
  183. }
  184. return nullptr;
  185. }
  186. void Variant::set_named(const StringName &p_member, const Variant &p_value, bool &r_valid) {
  187. uint32_t s = variant_setters_getters[type].size();
  188. if (s) {
  189. for (uint32_t i = 0; i < s; i++) {
  190. if (variant_setters_getters_names[type][i] == p_member) {
  191. variant_setters_getters[type][i].setter(this, &p_value, r_valid);
  192. return;
  193. }
  194. }
  195. r_valid = false;
  196. } else if (type == Variant::OBJECT) {
  197. Object *obj = get_validated_object();
  198. if (!obj) {
  199. r_valid = false;
  200. } else {
  201. obj->set(p_member, p_value, &r_valid);
  202. return;
  203. }
  204. } else if (type == Variant::DICTIONARY) {
  205. Variant *v = VariantGetInternalPtr<Dictionary>::get_ptr(this)->getptr(p_member);
  206. if (v) {
  207. *v = p_value;
  208. r_valid = true;
  209. } else {
  210. VariantGetInternalPtr<Dictionary>::get_ptr(this)->operator[](p_member) = p_value;
  211. r_valid = true;
  212. }
  213. } else {
  214. r_valid = false;
  215. }
  216. }
  217. Variant Variant::get_named(const StringName &p_member, bool &r_valid) const {
  218. Variant ret;
  219. uint32_t s = variant_setters_getters[type].size();
  220. if (s) {
  221. for (uint32_t i = 0; i < s; i++) {
  222. if (variant_setters_getters_names[type][i] == p_member) {
  223. variant_setters_getters[type][i].getter(this, &ret);
  224. r_valid = true;
  225. return ret;
  226. }
  227. }
  228. r_valid = false;
  229. } else if (type == Variant::OBJECT) {
  230. Object *obj = get_validated_object();
  231. if (!obj) {
  232. r_valid = false;
  233. return "Instance base is null.";
  234. } else {
  235. return obj->get(p_member, &r_valid);
  236. }
  237. } else if (type == Variant::DICTIONARY) {
  238. const Variant *v = VariantGetInternalPtr<Dictionary>::get_ptr(this)->getptr(p_member);
  239. if (v) {
  240. r_valid = true;
  241. return *v;
  242. } else {
  243. r_valid = false;
  244. }
  245. } else {
  246. r_valid = false;
  247. }
  248. return ret;
  249. }
  250. /**** INDEXED SETTERS AND GETTERS ****/
  251. #ifdef DEBUG_ENABLED
  252. #define OOB_TEST(m_idx, m_v) \
  253. ERR_FAIL_INDEX(m_idx, m_v)
  254. #else
  255. #define OOB_TEST(m_idx, m_v)
  256. #endif
  257. #ifdef DEBUG_ENABLED
  258. #define NULL_TEST(m_key) \
  259. ERR_FAIL_COND(!m_key)
  260. #else
  261. #define NULL_TEST(m_key)
  262. #endif
  263. #define INDEXED_SETGET_STRUCT_TYPED(m_base_type, m_elem_type) \
  264. struct VariantIndexedSetGet_##m_base_type { \
  265. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  266. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  267. if (index < 0) { \
  268. index += size; \
  269. } \
  270. if (index < 0 || index >= size) { \
  271. *oob = true; \
  272. return; \
  273. } \
  274. VariantTypeAdjust<m_elem_type>::adjust(value); \
  275. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index]; \
  276. *oob = false; \
  277. } \
  278. static void ptr_get(const void *base, int64_t index, void *member) { \
  279. /* avoid ptrconvert for performance*/ \
  280. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  281. if (index < 0) \
  282. index += v.size(); \
  283. OOB_TEST(index, v.size()); \
  284. PtrToArg<m_elem_type>::encode(v[index], member); \
  285. } \
  286. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  287. if (value->get_type() != GetTypeInfo<m_elem_type>::VARIANT_TYPE) { \
  288. *oob = false; \
  289. *valid = false; \
  290. return; \
  291. } \
  292. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  293. if (index < 0) { \
  294. index += size; \
  295. } \
  296. if (index < 0 || index >= size) { \
  297. *oob = true; \
  298. *valid = false; \
  299. return; \
  300. } \
  301. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  302. *oob = false; \
  303. *valid = true; \
  304. } \
  305. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  306. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  307. if (index < 0) { \
  308. index += size; \
  309. } \
  310. if (index < 0 || index >= size) { \
  311. *oob = true; \
  312. return; \
  313. } \
  314. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  315. *oob = false; \
  316. } \
  317. static void ptr_set(void *base, int64_t index, const void *member) { \
  318. /* avoid ptrconvert for performance*/ \
  319. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  320. if (index < 0) \
  321. index += v.size(); \
  322. OOB_TEST(index, v.size()); \
  323. v.write[index] = PtrToArg<m_elem_type>::convert(member); \
  324. } \
  325. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  326. static uint64_t get_indexed_size(const Variant *base) { return VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); } \
  327. };
  328. #define INDEXED_SETGET_STRUCT_TYPED_NUMERIC(m_base_type, m_elem_type, m_assign_type) \
  329. struct VariantIndexedSetGet_##m_base_type { \
  330. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  331. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  332. if (index < 0) { \
  333. index += size; \
  334. } \
  335. if (index < 0 || index >= size) { \
  336. *oob = true; \
  337. return; \
  338. } \
  339. VariantTypeAdjust<m_elem_type>::adjust(value); \
  340. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index]; \
  341. *oob = false; \
  342. } \
  343. static void ptr_get(const void *base, int64_t index, void *member) { \
  344. /* avoid ptrconvert for performance*/ \
  345. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  346. if (index < 0) \
  347. index += v.size(); \
  348. OOB_TEST(index, v.size()); \
  349. PtrToArg<m_elem_type>::encode(v[index], member); \
  350. } \
  351. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  352. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  353. if (index < 0) { \
  354. index += size; \
  355. } \
  356. if (index < 0 || index >= size) { \
  357. *oob = true; \
  358. *valid = false; \
  359. return; \
  360. } \
  361. m_assign_type num; \
  362. if (value->get_type() == Variant::INT) { \
  363. num = (m_assign_type)*VariantGetInternalPtr<int64_t>::get_ptr(value); \
  364. } else if (value->get_type() == Variant::FLOAT) { \
  365. num = (m_assign_type)*VariantGetInternalPtr<double>::get_ptr(value); \
  366. } else { \
  367. *oob = false; \
  368. *valid = false; \
  369. return; \
  370. } \
  371. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = num; \
  372. *oob = false; \
  373. *valid = true; \
  374. } \
  375. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  376. int64_t size = VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); \
  377. if (index < 0) { \
  378. index += size; \
  379. } \
  380. if (index < 0 || index >= size) { \
  381. *oob = true; \
  382. return; \
  383. } \
  384. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)).write[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  385. *oob = false; \
  386. } \
  387. static void ptr_set(void *base, int64_t index, const void *member) { \
  388. /* avoid ptrconvert for performance*/ \
  389. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  390. if (index < 0) \
  391. index += v.size(); \
  392. OOB_TEST(index, v.size()); \
  393. v.write[index] = PtrToArg<m_elem_type>::convert(member); \
  394. } \
  395. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  396. static uint64_t get_indexed_size(const Variant *base) { return VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); } \
  397. };
  398. #define INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(m_base_type, m_elem_type, m_assign_type, m_max) \
  399. struct VariantIndexedSetGet_##m_base_type { \
  400. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  401. if (index < 0 || index >= m_max) { \
  402. *oob = true; \
  403. return; \
  404. } \
  405. VariantTypeAdjust<m_elem_type>::adjust(value); \
  406. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index]; \
  407. *oob = false; \
  408. } \
  409. static void ptr_get(const void *base, int64_t index, void *member) { \
  410. /* avoid ptrconvert for performance*/ \
  411. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  412. OOB_TEST(index, m_max); \
  413. PtrToArg<m_elem_type>::encode(v[index], member); \
  414. } \
  415. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  416. if (index < 0 || index >= m_max) { \
  417. *oob = true; \
  418. *valid = false; \
  419. return; \
  420. } \
  421. m_assign_type num; \
  422. if (value->get_type() == Variant::INT) { \
  423. num = (m_assign_type)*VariantGetInternalPtr<int64_t>::get_ptr(value); \
  424. } else if (value->get_type() == Variant::FLOAT) { \
  425. num = (m_assign_type)*VariantGetInternalPtr<double>::get_ptr(value); \
  426. } else { \
  427. *oob = false; \
  428. *valid = false; \
  429. return; \
  430. } \
  431. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = num; \
  432. *oob = false; \
  433. *valid = true; \
  434. } \
  435. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  436. if (index < 0 || index >= m_max) { \
  437. *oob = true; \
  438. return; \
  439. } \
  440. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  441. *oob = false; \
  442. } \
  443. static void ptr_set(void *base, int64_t index, const void *member) { \
  444. /* avoid ptrconvert for performance*/ \
  445. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  446. OOB_TEST(index, m_max); \
  447. v[index] = PtrToArg<m_elem_type>::convert(member); \
  448. } \
  449. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  450. static uint64_t get_indexed_size(const Variant *base) { return m_max; } \
  451. };
  452. #define INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(m_base_type, m_elem_type, m_accessor, m_max) \
  453. struct VariantIndexedSetGet_##m_base_type { \
  454. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  455. if (index < 0 || index >= m_max) { \
  456. *oob = true; \
  457. return; \
  458. } \
  459. VariantTypeAdjust<m_elem_type>::adjust(value); \
  460. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = (*VariantGetInternalPtr<m_base_type>::get_ptr(base))m_accessor[index]; \
  461. *oob = false; \
  462. } \
  463. static void ptr_get(const void *base, int64_t index, void *member) { \
  464. /* avoid ptrconvert for performance*/ \
  465. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  466. OOB_TEST(index, m_max); \
  467. PtrToArg<m_elem_type>::encode(v m_accessor[index], member); \
  468. } \
  469. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  470. if (value->get_type() != GetTypeInfo<m_elem_type>::VARIANT_TYPE) { \
  471. *oob = false; \
  472. *valid = false; \
  473. } \
  474. if (index < 0 || index >= m_max) { \
  475. *oob = true; \
  476. *valid = false; \
  477. return; \
  478. } \
  479. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)) m_accessor[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  480. *oob = false; \
  481. *valid = true; \
  482. } \
  483. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  484. if (index < 0 || index >= m_max) { \
  485. *oob = true; \
  486. return; \
  487. } \
  488. (*VariantGetInternalPtr<m_base_type>::get_ptr(base)) m_accessor[index] = *VariantGetInternalPtr<m_elem_type>::get_ptr(value); \
  489. *oob = false; \
  490. } \
  491. static void ptr_set(void *base, int64_t index, const void *member) { \
  492. /* avoid ptrconvert for performance*/ \
  493. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  494. OOB_TEST(index, m_max); \
  495. v m_accessor[index] = PtrToArg<m_elem_type>::convert(member); \
  496. } \
  497. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  498. static uint64_t get_indexed_size(const Variant *base) { return m_max; } \
  499. };
  500. #define INDEXED_SETGET_STRUCT_BULTIN_FUNC(m_base_type, m_elem_type, m_set, m_get, m_max) \
  501. struct VariantIndexedSetGet_##m_base_type { \
  502. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  503. if (index < 0 || index >= m_max) { \
  504. *oob = true; \
  505. return; \
  506. } \
  507. VariantTypeAdjust<m_elem_type>::adjust(value); \
  508. *VariantGetInternalPtr<m_elem_type>::get_ptr(value) = VariantGetInternalPtr<m_base_type>::get_ptr(base)->m_get(index); \
  509. *oob = false; \
  510. } \
  511. static void ptr_get(const void *base, int64_t index, void *member) { \
  512. /* avoid ptrconvert for performance*/ \
  513. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  514. OOB_TEST(index, m_max); \
  515. PtrToArg<m_elem_type>::encode(v.m_get(index), member); \
  516. } \
  517. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  518. if (value->get_type() != GetTypeInfo<m_elem_type>::VARIANT_TYPE) { \
  519. *oob = false; \
  520. *valid = false; \
  521. } \
  522. if (index < 0 || index >= m_max) { \
  523. *oob = true; \
  524. *valid = false; \
  525. return; \
  526. } \
  527. VariantGetInternalPtr<m_base_type>::get_ptr(base)->m_set(index, *VariantGetInternalPtr<m_elem_type>::get_ptr(value)); \
  528. *oob = false; \
  529. *valid = true; \
  530. } \
  531. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  532. if (index < 0 || index >= m_max) { \
  533. *oob = true; \
  534. return; \
  535. } \
  536. VariantGetInternalPtr<m_base_type>::get_ptr(base)->m_set(index, *VariantGetInternalPtr<m_elem_type>::get_ptr(value)); \
  537. *oob = false; \
  538. } \
  539. static void ptr_set(void *base, int64_t index, const void *member) { \
  540. /* avoid ptrconvert for performance*/ \
  541. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  542. OOB_TEST(index, m_max); \
  543. v.m_set(index, PtrToArg<m_elem_type>::convert(member)); \
  544. } \
  545. static Variant::Type get_index_type() { return GetTypeInfo<m_elem_type>::VARIANT_TYPE; } \
  546. static uint64_t get_indexed_size(const Variant *base) { return m_max; } \
  547. };
  548. struct VariantIndexedSetGet_Array {
  549. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) {
  550. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  551. if (index < 0) {
  552. index += size;
  553. }
  554. if (index < 0 || index >= size) {
  555. *oob = true;
  556. return;
  557. }
  558. *value = (*VariantGetInternalPtr<Array>::get_ptr(base))[index];
  559. *oob = false;
  560. }
  561. static void ptr_get(const void *base, int64_t index, void *member) {
  562. /* avoid ptrconvert for performance*/
  563. const Array &v = *reinterpret_cast<const Array *>(base);
  564. if (index < 0) {
  565. index += v.size();
  566. }
  567. OOB_TEST(index, v.size());
  568. PtrToArg<Variant>::encode(v[index], member);
  569. }
  570. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) {
  571. if (VariantGetInternalPtr<Array>::get_ptr(base)->is_read_only()) {
  572. *valid = false;
  573. *oob = true;
  574. return;
  575. }
  576. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  577. if (index < 0) {
  578. index += size;
  579. }
  580. if (index < 0 || index >= size) {
  581. *oob = true;
  582. *valid = false;
  583. return;
  584. }
  585. VariantGetInternalPtr<Array>::get_ptr(base)->set(index, *value);
  586. *oob = false;
  587. *valid = true;
  588. }
  589. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) {
  590. if (VariantGetInternalPtr<Array>::get_ptr(base)->is_read_only()) {
  591. *oob = true;
  592. return;
  593. }
  594. int64_t size = VariantGetInternalPtr<Array>::get_ptr(base)->size();
  595. if (index < 0) {
  596. index += size;
  597. }
  598. if (index < 0 || index >= size) {
  599. *oob = true;
  600. return;
  601. }
  602. VariantGetInternalPtr<Array>::get_ptr(base)->set(index, *value);
  603. *oob = false;
  604. }
  605. static void ptr_set(void *base, int64_t index, const void *member) {
  606. /* avoid ptrconvert for performance*/
  607. Array &v = *reinterpret_cast<Array *>(base);
  608. if (index < 0) {
  609. index += v.size();
  610. }
  611. OOB_TEST(index, v.size());
  612. v.set(index, PtrToArg<Variant>::convert(member));
  613. }
  614. static Variant::Type get_index_type() { return Variant::NIL; }
  615. static uint64_t get_indexed_size(const Variant *base) { return 0; }
  616. };
  617. struct VariantIndexedSetGet_String {
  618. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) {
  619. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  620. if (index < 0) {
  621. index += length;
  622. }
  623. if (index < 0 || index >= length) {
  624. *oob = true;
  625. return;
  626. }
  627. char32_t result = (*VariantGetInternalPtr<String>::get_ptr(base))[index];
  628. *value = String(&result, 1);
  629. *oob = false;
  630. }
  631. static void ptr_get(const void *base, int64_t index, void *member) {
  632. /* avoid ptrconvert for performance*/
  633. const String &v = *reinterpret_cast<const String *>(base);
  634. if (index < 0) {
  635. index += v.length();
  636. }
  637. OOB_TEST(index, v.length());
  638. char32_t c = v[index];
  639. PtrToArg<String>::encode(String(&c, 1), member);
  640. }
  641. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) {
  642. if (value->get_type() != Variant::STRING) {
  643. *oob = false;
  644. *valid = false;
  645. return;
  646. }
  647. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  648. if (index < 0) {
  649. index += length;
  650. }
  651. if (index < 0 || index >= length) {
  652. *oob = true;
  653. *valid = false;
  654. return;
  655. }
  656. String *b = VariantGetInternalPtr<String>::get_ptr(base);
  657. const String *v = VariantInternal::get_string(value);
  658. if (v->length() == 0) {
  659. b->remove_at(index);
  660. } else {
  661. b->set(index, v->get(0));
  662. }
  663. *oob = false;
  664. *valid = true;
  665. }
  666. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) {
  667. int64_t length = VariantGetInternalPtr<String>::get_ptr(base)->length();
  668. if (index < 0) {
  669. index += length;
  670. }
  671. if (index < 0 || index >= length) {
  672. *oob = true;
  673. return;
  674. }
  675. String *b = VariantGetInternalPtr<String>::get_ptr(base);
  676. const String *v = VariantInternal::get_string(value);
  677. if (v->length() == 0) {
  678. b->remove_at(index);
  679. } else {
  680. b->set(index, v->get(0));
  681. }
  682. *oob = false;
  683. }
  684. static void ptr_set(void *base, int64_t index, const void *member) {
  685. /* avoid ptrconvert for performance*/
  686. String &v = *reinterpret_cast<String *>(base);
  687. if (index < 0) {
  688. index += v.length();
  689. }
  690. OOB_TEST(index, v.length());
  691. const String &m = *reinterpret_cast<const String *>(member);
  692. if (unlikely(m.length() == 0)) {
  693. v.remove_at(index);
  694. } else {
  695. v.set(index, m.unicode_at(0));
  696. }
  697. }
  698. static Variant::Type get_index_type() { return Variant::STRING; }
  699. static uint64_t get_indexed_size(const Variant *base) { return VariantInternal::get_string(base)->length(); }
  700. };
  701. #define INDEXED_SETGET_STRUCT_DICT(m_base_type) \
  702. struct VariantIndexedSetGet_##m_base_type { \
  703. static void get(const Variant *base, int64_t index, Variant *value, bool *oob) { \
  704. const Variant *ptr = VariantGetInternalPtr<m_base_type>::get_ptr(base)->getptr(index); \
  705. if (!ptr) { \
  706. *oob = true; \
  707. return; \
  708. } \
  709. *value = *ptr; \
  710. *oob = false; \
  711. } \
  712. static void ptr_get(const void *base, int64_t index, void *member) { \
  713. /* avoid ptrconvert for performance*/ \
  714. const m_base_type &v = *reinterpret_cast<const m_base_type *>(base); \
  715. const Variant *ptr = v.getptr(index); \
  716. NULL_TEST(ptr); \
  717. PtrToArg<Variant>::encode(*ptr, member); \
  718. } \
  719. static void set(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) { \
  720. if (VariantGetInternalPtr<m_base_type>::get_ptr(base)->is_read_only()) { \
  721. *valid = false; \
  722. *oob = true; \
  723. return; \
  724. } \
  725. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *value; \
  726. *oob = false; \
  727. *valid = true; \
  728. } \
  729. static void validated_set(Variant *base, int64_t index, const Variant *value, bool *oob) { \
  730. if (VariantGetInternalPtr<m_base_type>::get_ptr(base)->is_read_only()) { \
  731. *oob = true; \
  732. return; \
  733. } \
  734. (*VariantGetInternalPtr<m_base_type>::get_ptr(base))[index] = *value; \
  735. *oob = false; \
  736. } \
  737. static void ptr_set(void *base, int64_t index, const void *member) { \
  738. m_base_type &v = *reinterpret_cast<m_base_type *>(base); \
  739. v[index] = PtrToArg<Variant>::convert(member); \
  740. } \
  741. static Variant::Type get_index_type() { return Variant::NIL; } \
  742. static uint64_t get_indexed_size(const Variant *base) { return VariantGetInternalPtr<m_base_type>::get_ptr(base)->size(); } \
  743. };
  744. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector2, double, real_t, 2)
  745. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector2i, int64_t, int32_t, 2)
  746. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector3, double, real_t, 3)
  747. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector3i, int64_t, int32_t, 3)
  748. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector4, double, real_t, 4)
  749. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Vector4i, int64_t, int32_t, 4)
  750. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Quaternion, double, real_t, 4)
  751. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Color, double, float, 4)
  752. INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(Transform2D, Vector2, .columns, 3)
  753. INDEXED_SETGET_STRUCT_BULTIN_FUNC(Basis, Vector3, set_column, get_column, 3)
  754. INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(Projection, Vector4, .matrix, 4)
  755. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedByteArray, int64_t, uint8_t)
  756. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt32Array, int64_t, int32_t)
  757. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt64Array, int64_t, int64_t)
  758. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat32Array, double, float)
  759. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat64Array, double, double)
  760. INDEXED_SETGET_STRUCT_TYPED(PackedVector2Array, Vector2)
  761. INDEXED_SETGET_STRUCT_TYPED(PackedVector3Array, Vector3)
  762. INDEXED_SETGET_STRUCT_TYPED(PackedStringArray, String)
  763. INDEXED_SETGET_STRUCT_TYPED(PackedColorArray, Color)
  764. INDEXED_SETGET_STRUCT_DICT(Dictionary)
  765. struct VariantIndexedSetterGetterInfo {
  766. void (*setter)(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) = nullptr;
  767. void (*getter)(const Variant *base, int64_t index, Variant *value, bool *oob) = nullptr;
  768. Variant::ValidatedIndexedSetter validated_setter = nullptr;
  769. Variant::ValidatedIndexedGetter validated_getter = nullptr;
  770. Variant::PTRIndexedSetter ptr_setter = nullptr;
  771. Variant::PTRIndexedGetter ptr_getter = nullptr;
  772. uint64_t (*get_indexed_size)(const Variant *base) = nullptr;
  773. Variant::Type index_type;
  774. bool valid = false;
  775. };
  776. static VariantIndexedSetterGetterInfo variant_indexed_setters_getters[Variant::VARIANT_MAX];
  777. template <class T>
  778. static void register_indexed_member(Variant::Type p_type) {
  779. VariantIndexedSetterGetterInfo &sgi = variant_indexed_setters_getters[p_type];
  780. sgi.setter = T::set;
  781. sgi.validated_setter = T::validated_set;
  782. sgi.ptr_setter = T::ptr_set;
  783. sgi.getter = T::get;
  784. sgi.validated_getter = T::get;
  785. sgi.ptr_getter = T::ptr_get;
  786. sgi.index_type = T::get_index_type();
  787. sgi.get_indexed_size = T::get_indexed_size;
  788. sgi.valid = true;
  789. }
  790. void register_indexed_setters_getters() {
  791. #define REGISTER_INDEXED_MEMBER(m_base_type) register_indexed_member<VariantIndexedSetGet_##m_base_type>(GetTypeInfo<m_base_type>::VARIANT_TYPE)
  792. REGISTER_INDEXED_MEMBER(String);
  793. REGISTER_INDEXED_MEMBER(Vector2);
  794. REGISTER_INDEXED_MEMBER(Vector2i);
  795. REGISTER_INDEXED_MEMBER(Vector3);
  796. REGISTER_INDEXED_MEMBER(Vector3i);
  797. REGISTER_INDEXED_MEMBER(Vector4);
  798. REGISTER_INDEXED_MEMBER(Vector4i);
  799. REGISTER_INDEXED_MEMBER(Quaternion);
  800. REGISTER_INDEXED_MEMBER(Color);
  801. REGISTER_INDEXED_MEMBER(Transform2D);
  802. REGISTER_INDEXED_MEMBER(Basis);
  803. REGISTER_INDEXED_MEMBER(Projection);
  804. REGISTER_INDEXED_MEMBER(PackedByteArray);
  805. REGISTER_INDEXED_MEMBER(PackedInt32Array);
  806. REGISTER_INDEXED_MEMBER(PackedInt64Array);
  807. REGISTER_INDEXED_MEMBER(PackedFloat32Array);
  808. REGISTER_INDEXED_MEMBER(PackedFloat64Array);
  809. REGISTER_INDEXED_MEMBER(PackedVector2Array);
  810. REGISTER_INDEXED_MEMBER(PackedVector3Array);
  811. REGISTER_INDEXED_MEMBER(PackedStringArray);
  812. REGISTER_INDEXED_MEMBER(PackedColorArray);
  813. REGISTER_INDEXED_MEMBER(Array);
  814. REGISTER_INDEXED_MEMBER(Dictionary);
  815. }
  816. static void unregister_indexed_setters_getters() {
  817. }
  818. bool Variant::has_indexing(Variant::Type p_type) {
  819. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, false);
  820. return variant_indexed_setters_getters[p_type].valid;
  821. }
  822. Variant::Type Variant::get_indexed_element_type(Variant::Type p_type) {
  823. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, Variant::VARIANT_MAX);
  824. return variant_indexed_setters_getters[p_type].index_type;
  825. }
  826. Variant::ValidatedIndexedSetter Variant::get_member_validated_indexed_setter(Variant::Type p_type) {
  827. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  828. return variant_indexed_setters_getters[p_type].validated_setter;
  829. }
  830. Variant::ValidatedIndexedGetter Variant::get_member_validated_indexed_getter(Variant::Type p_type) {
  831. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  832. return variant_indexed_setters_getters[p_type].validated_getter;
  833. }
  834. Variant::PTRIndexedSetter Variant::get_member_ptr_indexed_setter(Variant::Type p_type) {
  835. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  836. return variant_indexed_setters_getters[p_type].ptr_setter;
  837. }
  838. Variant::PTRIndexedGetter Variant::get_member_ptr_indexed_getter(Variant::Type p_type) {
  839. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  840. return variant_indexed_setters_getters[p_type].ptr_getter;
  841. }
  842. void Variant::set_indexed(int64_t p_index, const Variant &p_value, bool &r_valid, bool &r_oob) {
  843. if (likely(variant_indexed_setters_getters[type].valid)) {
  844. variant_indexed_setters_getters[type].setter(this, p_index, &p_value, &r_valid, &r_oob);
  845. } else {
  846. r_valid = false;
  847. r_oob = false;
  848. }
  849. }
  850. Variant Variant::get_indexed(int64_t p_index, bool &r_valid, bool &r_oob) const {
  851. if (likely(variant_indexed_setters_getters[type].valid)) {
  852. Variant ret;
  853. variant_indexed_setters_getters[type].getter(this, p_index, &ret, &r_oob);
  854. r_valid = !r_oob;
  855. return ret;
  856. } else {
  857. r_valid = false;
  858. r_oob = false;
  859. return Variant();
  860. }
  861. }
  862. uint64_t Variant::get_indexed_size() const {
  863. if (likely(variant_indexed_setters_getters[type].valid && variant_indexed_setters_getters[type].get_indexed_size)) {
  864. return variant_indexed_setters_getters[type].get_indexed_size(this);
  865. } else {
  866. return 0;
  867. }
  868. }
  869. struct VariantKeyedSetGetDictionary {
  870. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  871. const Variant *ptr = VariantGetInternalPtr<Dictionary>::get_ptr(base)->getptr(*key);
  872. if (!ptr) {
  873. *r_valid = false;
  874. return;
  875. }
  876. *value = *ptr;
  877. *r_valid = true;
  878. }
  879. static void ptr_get(const void *base, const void *key, void *value) {
  880. /* avoid ptrconvert for performance*/
  881. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  882. const Variant *ptr = v.getptr(PtrToArg<Variant>::convert(key));
  883. NULL_TEST(ptr);
  884. PtrToArg<Variant>::encode(*ptr, value);
  885. }
  886. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  887. if (VariantGetInternalPtr<Dictionary>::get_ptr(base)->is_read_only()) {
  888. *r_valid = false;
  889. return;
  890. }
  891. (*VariantGetInternalPtr<Dictionary>::get_ptr(base))[*key] = *value;
  892. *r_valid = true;
  893. }
  894. static void ptr_set(void *base, const void *key, const void *value) {
  895. Dictionary &v = *reinterpret_cast<Dictionary *>(base);
  896. v[PtrToArg<Variant>::convert(key)] = PtrToArg<Variant>::convert(value);
  897. }
  898. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  899. *r_valid = true;
  900. return VariantGetInternalPtr<Dictionary>::get_ptr(base)->has(*key);
  901. }
  902. static uint32_t ptr_has(const void *base, const void *key) {
  903. /* avoid ptrconvert for performance*/
  904. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  905. return v.has(PtrToArg<Variant>::convert(key));
  906. }
  907. };
  908. struct VariantKeyedSetGetObject {
  909. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  910. Object *obj = base->get_validated_object();
  911. if (!obj) {
  912. *r_valid = false;
  913. *value = Variant();
  914. return;
  915. }
  916. *value = obj->getvar(*key, r_valid);
  917. }
  918. static void ptr_get(const void *base, const void *key, void *value) {
  919. const Object *obj = PtrToArg<Object *>::convert(base);
  920. NULL_TEST(obj);
  921. Variant v = obj->getvar(PtrToArg<Variant>::convert(key));
  922. PtrToArg<Variant>::encode(v, value);
  923. }
  924. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  925. Object *obj = base->get_validated_object();
  926. if (!obj) {
  927. *r_valid = false;
  928. return;
  929. }
  930. obj->setvar(*key, *value, r_valid);
  931. }
  932. static void ptr_set(void *base, const void *key, const void *value) {
  933. Object *obj = PtrToArg<Object *>::convert(base);
  934. NULL_TEST(obj);
  935. obj->setvar(PtrToArg<Variant>::convert(key), PtrToArg<Variant>::convert(value));
  936. }
  937. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  938. Object *obj = base->get_validated_object();
  939. if (!obj) {
  940. *r_valid = false;
  941. return false;
  942. }
  943. *r_valid = true;
  944. bool exists;
  945. obj->getvar(*key, &exists);
  946. return exists;
  947. }
  948. static uint32_t ptr_has(const void *base, const void *key) {
  949. const Object *obj = PtrToArg<Object *>::convert(base);
  950. ERR_FAIL_COND_V(!obj, false);
  951. bool valid;
  952. obj->getvar(PtrToArg<Variant>::convert(key), &valid);
  953. return valid;
  954. }
  955. };
  956. struct VariantKeyedSetterGetterInfo {
  957. Variant::ValidatedKeyedSetter validated_setter = nullptr;
  958. Variant::ValidatedKeyedGetter validated_getter = nullptr;
  959. Variant::ValidatedKeyedChecker validated_checker = nullptr;
  960. Variant::PTRKeyedSetter ptr_setter = nullptr;
  961. Variant::PTRKeyedGetter ptr_getter = nullptr;
  962. Variant::PTRKeyedChecker ptr_checker = nullptr;
  963. bool valid = false;
  964. };
  965. static VariantKeyedSetterGetterInfo variant_keyed_setters_getters[Variant::VARIANT_MAX];
  966. template <class T>
  967. static void register_keyed_member(Variant::Type p_type) {
  968. VariantKeyedSetterGetterInfo &sgi = variant_keyed_setters_getters[p_type];
  969. sgi.validated_setter = T::set;
  970. sgi.ptr_setter = T::ptr_set;
  971. sgi.validated_getter = T::get;
  972. sgi.ptr_getter = T::ptr_get;
  973. sgi.validated_checker = T::has;
  974. sgi.ptr_checker = T::ptr_has;
  975. sgi.valid = true;
  976. }
  977. static void register_keyed_setters_getters() {
  978. register_keyed_member<VariantKeyedSetGetDictionary>(Variant::DICTIONARY);
  979. register_keyed_member<VariantKeyedSetGetObject>(Variant::OBJECT);
  980. }
  981. bool Variant::is_keyed(Variant::Type p_type) {
  982. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, false);
  983. return variant_keyed_setters_getters[p_type].valid;
  984. }
  985. Variant::ValidatedKeyedSetter Variant::get_member_validated_keyed_setter(Variant::Type p_type) {
  986. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  987. return variant_keyed_setters_getters[p_type].validated_setter;
  988. }
  989. Variant::ValidatedKeyedGetter Variant::get_member_validated_keyed_getter(Variant::Type p_type) {
  990. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  991. return variant_keyed_setters_getters[p_type].validated_getter;
  992. }
  993. Variant::ValidatedKeyedChecker Variant::get_member_validated_keyed_checker(Variant::Type p_type) {
  994. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  995. return variant_keyed_setters_getters[p_type].validated_checker;
  996. }
  997. Variant::PTRKeyedSetter Variant::get_member_ptr_keyed_setter(Variant::Type p_type) {
  998. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  999. return variant_keyed_setters_getters[p_type].ptr_setter;
  1000. }
  1001. Variant::PTRKeyedGetter Variant::get_member_ptr_keyed_getter(Variant::Type p_type) {
  1002. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  1003. return variant_keyed_setters_getters[p_type].ptr_getter;
  1004. }
  1005. Variant::PTRKeyedChecker Variant::get_member_ptr_keyed_checker(Variant::Type p_type) {
  1006. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  1007. return variant_keyed_setters_getters[p_type].ptr_checker;
  1008. }
  1009. void Variant::set_keyed(const Variant &p_key, const Variant &p_value, bool &r_valid) {
  1010. if (likely(variant_keyed_setters_getters[type].valid)) {
  1011. variant_keyed_setters_getters[type].validated_setter(this, &p_key, &p_value, &r_valid);
  1012. } else {
  1013. r_valid = false;
  1014. }
  1015. }
  1016. Variant Variant::get_keyed(const Variant &p_key, bool &r_valid) const {
  1017. if (likely(variant_keyed_setters_getters[type].valid)) {
  1018. Variant ret;
  1019. variant_keyed_setters_getters[type].validated_getter(this, &p_key, &ret, &r_valid);
  1020. return ret;
  1021. } else {
  1022. r_valid = false;
  1023. return Variant();
  1024. }
  1025. }
  1026. bool Variant::has_key(const Variant &p_key, bool &r_valid) const {
  1027. if (likely(variant_keyed_setters_getters[type].valid)) {
  1028. return variant_keyed_setters_getters[type].validated_checker(this, &p_key, &r_valid);
  1029. } else {
  1030. r_valid = false;
  1031. return false;
  1032. }
  1033. }
  1034. void Variant::set(const Variant &p_index, const Variant &p_value, bool *r_valid) {
  1035. if (type == DICTIONARY || type == OBJECT) {
  1036. bool valid;
  1037. set_keyed(p_index, p_value, valid);
  1038. if (r_valid) {
  1039. *r_valid = valid;
  1040. }
  1041. } else {
  1042. bool valid = false;
  1043. if (p_index.get_type() == STRING_NAME) {
  1044. set_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), p_value, valid);
  1045. } else if (p_index.get_type() == INT) {
  1046. bool obb;
  1047. set_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), p_value, valid, obb);
  1048. if (obb) {
  1049. valid = false;
  1050. }
  1051. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1052. set_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), p_value, valid);
  1053. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1054. bool obb;
  1055. set_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), p_value, valid, obb);
  1056. if (obb) {
  1057. valid = false;
  1058. }
  1059. }
  1060. if (r_valid) {
  1061. *r_valid = valid;
  1062. }
  1063. }
  1064. }
  1065. Variant Variant::get(const Variant &p_index, bool *r_valid) const {
  1066. Variant ret;
  1067. if (type == DICTIONARY || type == OBJECT) {
  1068. bool valid;
  1069. ret = get_keyed(p_index, valid);
  1070. if (r_valid) {
  1071. *r_valid = valid;
  1072. }
  1073. } else {
  1074. bool valid = false;
  1075. if (p_index.get_type() == STRING_NAME) {
  1076. ret = get_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), valid);
  1077. } else if (p_index.get_type() == INT) {
  1078. bool obb;
  1079. ret = get_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), valid, obb);
  1080. if (obb) {
  1081. valid = false;
  1082. }
  1083. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1084. ret = get_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), valid);
  1085. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1086. bool obb;
  1087. ret = get_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), valid, obb);
  1088. if (obb) {
  1089. valid = false;
  1090. }
  1091. }
  1092. if (r_valid) {
  1093. *r_valid = valid;
  1094. }
  1095. }
  1096. return ret;
  1097. }
  1098. void Variant::get_property_list(List<PropertyInfo> *p_list) const {
  1099. if (type == DICTIONARY) {
  1100. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1101. List<Variant> keys;
  1102. dic->get_key_list(&keys);
  1103. for (const Variant &E : keys) {
  1104. if (E.get_type() == Variant::STRING) {
  1105. p_list->push_back(PropertyInfo(Variant::STRING, E));
  1106. }
  1107. }
  1108. } else if (type == OBJECT) {
  1109. Object *obj = get_validated_object();
  1110. ERR_FAIL_COND(!obj);
  1111. obj->get_property_list(p_list);
  1112. } else {
  1113. List<StringName> members;
  1114. get_member_list(type, &members);
  1115. for (const StringName &E : members) {
  1116. PropertyInfo pi;
  1117. pi.name = E;
  1118. pi.type = get_member_type(type, E);
  1119. p_list->push_back(pi);
  1120. }
  1121. }
  1122. }
  1123. bool Variant::iter_init(Variant &r_iter, bool &valid) const {
  1124. valid = true;
  1125. switch (type) {
  1126. case INT: {
  1127. r_iter = 0;
  1128. return _data._int > 0;
  1129. } break;
  1130. case FLOAT: {
  1131. r_iter = 0;
  1132. return _data._float > 0.0;
  1133. } break;
  1134. case VECTOR2: {
  1135. double from = reinterpret_cast<const Vector2 *>(_data._mem)->x;
  1136. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1137. r_iter = from;
  1138. return from < to;
  1139. } break;
  1140. case VECTOR2I: {
  1141. int64_t from = reinterpret_cast<const Vector2i *>(_data._mem)->x;
  1142. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1143. r_iter = from;
  1144. return from < to;
  1145. } break;
  1146. case VECTOR3: {
  1147. double from = reinterpret_cast<const Vector3 *>(_data._mem)->x;
  1148. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1149. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1150. r_iter = from;
  1151. if (from == to) {
  1152. return false;
  1153. } else if (from < to) {
  1154. return step > 0;
  1155. }
  1156. return step < 0;
  1157. } break;
  1158. case VECTOR3I: {
  1159. int64_t from = reinterpret_cast<const Vector3i *>(_data._mem)->x;
  1160. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1161. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1162. r_iter = from;
  1163. if (from == to) {
  1164. return false;
  1165. } else if (from < to) {
  1166. return step > 0;
  1167. }
  1168. return step < 0;
  1169. } break;
  1170. case OBJECT: {
  1171. if (!_get_obj().obj) {
  1172. valid = false;
  1173. return false;
  1174. }
  1175. #ifdef DEBUG_ENABLED
  1176. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1177. valid = false;
  1178. return false;
  1179. }
  1180. #endif
  1181. Callable::CallError ce;
  1182. ce.error = Callable::CallError::CALL_OK;
  1183. Array ref;
  1184. ref.push_back(r_iter);
  1185. Variant vref = ref;
  1186. const Variant *refp[] = { &vref };
  1187. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_init, refp, 1, ce);
  1188. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1189. valid = false;
  1190. return false;
  1191. }
  1192. r_iter = ref[0];
  1193. return ret;
  1194. } break;
  1195. case STRING: {
  1196. const String *str = reinterpret_cast<const String *>(_data._mem);
  1197. if (str->is_empty()) {
  1198. return false;
  1199. }
  1200. r_iter = 0;
  1201. return true;
  1202. } break;
  1203. case DICTIONARY: {
  1204. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1205. if (dic->is_empty()) {
  1206. return false;
  1207. }
  1208. const Variant *next = dic->next(nullptr);
  1209. r_iter = *next;
  1210. return true;
  1211. } break;
  1212. case ARRAY: {
  1213. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1214. if (arr->is_empty()) {
  1215. return false;
  1216. }
  1217. r_iter = 0;
  1218. return true;
  1219. } break;
  1220. case PACKED_BYTE_ARRAY: {
  1221. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1222. if (arr->size() == 0) {
  1223. return false;
  1224. }
  1225. r_iter = 0;
  1226. return true;
  1227. } break;
  1228. case PACKED_INT32_ARRAY: {
  1229. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1230. if (arr->size() == 0) {
  1231. return false;
  1232. }
  1233. r_iter = 0;
  1234. return true;
  1235. } break;
  1236. case PACKED_INT64_ARRAY: {
  1237. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1238. if (arr->size() == 0) {
  1239. return false;
  1240. }
  1241. r_iter = 0;
  1242. return true;
  1243. } break;
  1244. case PACKED_FLOAT32_ARRAY: {
  1245. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1246. if (arr->size() == 0) {
  1247. return false;
  1248. }
  1249. r_iter = 0;
  1250. return true;
  1251. } break;
  1252. case PACKED_FLOAT64_ARRAY: {
  1253. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1254. if (arr->size() == 0) {
  1255. return false;
  1256. }
  1257. r_iter = 0;
  1258. return true;
  1259. } break;
  1260. case PACKED_STRING_ARRAY: {
  1261. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1262. if (arr->size() == 0) {
  1263. return false;
  1264. }
  1265. r_iter = 0;
  1266. return true;
  1267. } break;
  1268. case PACKED_VECTOR2_ARRAY: {
  1269. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1270. if (arr->size() == 0) {
  1271. return false;
  1272. }
  1273. r_iter = 0;
  1274. return true;
  1275. } break;
  1276. case PACKED_VECTOR3_ARRAY: {
  1277. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1278. if (arr->size() == 0) {
  1279. return false;
  1280. }
  1281. r_iter = 0;
  1282. return true;
  1283. } break;
  1284. case PACKED_COLOR_ARRAY: {
  1285. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1286. if (arr->size() == 0) {
  1287. return false;
  1288. }
  1289. r_iter = 0;
  1290. return true;
  1291. } break;
  1292. default: {
  1293. }
  1294. }
  1295. valid = false;
  1296. return false;
  1297. }
  1298. bool Variant::iter_next(Variant &r_iter, bool &valid) const {
  1299. valid = true;
  1300. switch (type) {
  1301. case INT: {
  1302. int64_t idx = r_iter;
  1303. idx++;
  1304. if (idx >= _data._int) {
  1305. return false;
  1306. }
  1307. r_iter = idx;
  1308. return true;
  1309. } break;
  1310. case FLOAT: {
  1311. int64_t idx = r_iter;
  1312. idx++;
  1313. if (idx >= _data._float) {
  1314. return false;
  1315. }
  1316. r_iter = idx;
  1317. return true;
  1318. } break;
  1319. case VECTOR2: {
  1320. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1321. double idx = r_iter;
  1322. idx++;
  1323. if (idx >= to) {
  1324. return false;
  1325. }
  1326. r_iter = idx;
  1327. return true;
  1328. } break;
  1329. case VECTOR2I: {
  1330. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1331. int64_t idx = r_iter;
  1332. idx++;
  1333. if (idx >= to) {
  1334. return false;
  1335. }
  1336. r_iter = idx;
  1337. return true;
  1338. } break;
  1339. case VECTOR3: {
  1340. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1341. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1342. double idx = r_iter;
  1343. idx += step;
  1344. if (step < 0 && idx <= to) {
  1345. return false;
  1346. }
  1347. if (step > 0 && idx >= to) {
  1348. return false;
  1349. }
  1350. r_iter = idx;
  1351. return true;
  1352. } break;
  1353. case VECTOR3I: {
  1354. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1355. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1356. int64_t idx = r_iter;
  1357. idx += step;
  1358. if (step < 0 && idx <= to) {
  1359. return false;
  1360. }
  1361. if (step > 0 && idx >= to) {
  1362. return false;
  1363. }
  1364. r_iter = idx;
  1365. return true;
  1366. } break;
  1367. case OBJECT: {
  1368. if (!_get_obj().obj) {
  1369. valid = false;
  1370. return false;
  1371. }
  1372. #ifdef DEBUG_ENABLED
  1373. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1374. valid = false;
  1375. return false;
  1376. }
  1377. #endif
  1378. Callable::CallError ce;
  1379. ce.error = Callable::CallError::CALL_OK;
  1380. Array ref;
  1381. ref.push_back(r_iter);
  1382. Variant vref = ref;
  1383. const Variant *refp[] = { &vref };
  1384. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_next, refp, 1, ce);
  1385. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1386. valid = false;
  1387. return false;
  1388. }
  1389. r_iter = ref[0];
  1390. return ret;
  1391. } break;
  1392. case STRING: {
  1393. const String *str = reinterpret_cast<const String *>(_data._mem);
  1394. int idx = r_iter;
  1395. idx++;
  1396. if (idx >= str->length()) {
  1397. return false;
  1398. }
  1399. r_iter = idx;
  1400. return true;
  1401. } break;
  1402. case DICTIONARY: {
  1403. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1404. const Variant *next = dic->next(&r_iter);
  1405. if (!next) {
  1406. return false;
  1407. }
  1408. r_iter = *next;
  1409. return true;
  1410. } break;
  1411. case ARRAY: {
  1412. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1413. int idx = r_iter;
  1414. idx++;
  1415. if (idx >= arr->size()) {
  1416. return false;
  1417. }
  1418. r_iter = idx;
  1419. return true;
  1420. } break;
  1421. case PACKED_BYTE_ARRAY: {
  1422. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1423. int idx = r_iter;
  1424. idx++;
  1425. if (idx >= arr->size()) {
  1426. return false;
  1427. }
  1428. r_iter = idx;
  1429. return true;
  1430. } break;
  1431. case PACKED_INT32_ARRAY: {
  1432. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1433. int32_t idx = r_iter;
  1434. idx++;
  1435. if (idx >= arr->size()) {
  1436. return false;
  1437. }
  1438. r_iter = idx;
  1439. return true;
  1440. } break;
  1441. case PACKED_INT64_ARRAY: {
  1442. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1443. int64_t idx = r_iter;
  1444. idx++;
  1445. if (idx >= arr->size()) {
  1446. return false;
  1447. }
  1448. r_iter = idx;
  1449. return true;
  1450. } break;
  1451. case PACKED_FLOAT32_ARRAY: {
  1452. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1453. int idx = r_iter;
  1454. idx++;
  1455. if (idx >= arr->size()) {
  1456. return false;
  1457. }
  1458. r_iter = idx;
  1459. return true;
  1460. } break;
  1461. case PACKED_FLOAT64_ARRAY: {
  1462. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1463. int idx = r_iter;
  1464. idx++;
  1465. if (idx >= arr->size()) {
  1466. return false;
  1467. }
  1468. r_iter = idx;
  1469. return true;
  1470. } break;
  1471. case PACKED_STRING_ARRAY: {
  1472. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1473. int idx = r_iter;
  1474. idx++;
  1475. if (idx >= arr->size()) {
  1476. return false;
  1477. }
  1478. r_iter = idx;
  1479. return true;
  1480. } break;
  1481. case PACKED_VECTOR2_ARRAY: {
  1482. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1483. int idx = r_iter;
  1484. idx++;
  1485. if (idx >= arr->size()) {
  1486. return false;
  1487. }
  1488. r_iter = idx;
  1489. return true;
  1490. } break;
  1491. case PACKED_VECTOR3_ARRAY: {
  1492. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1493. int idx = r_iter;
  1494. idx++;
  1495. if (idx >= arr->size()) {
  1496. return false;
  1497. }
  1498. r_iter = idx;
  1499. return true;
  1500. } break;
  1501. case PACKED_COLOR_ARRAY: {
  1502. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1503. int idx = r_iter;
  1504. idx++;
  1505. if (idx >= arr->size()) {
  1506. return false;
  1507. }
  1508. r_iter = idx;
  1509. return true;
  1510. } break;
  1511. default: {
  1512. }
  1513. }
  1514. valid = false;
  1515. return false;
  1516. }
  1517. Variant Variant::iter_get(const Variant &r_iter, bool &r_valid) const {
  1518. r_valid = true;
  1519. switch (type) {
  1520. case INT: {
  1521. return r_iter;
  1522. } break;
  1523. case FLOAT: {
  1524. return r_iter;
  1525. } break;
  1526. case VECTOR2: {
  1527. return r_iter;
  1528. } break;
  1529. case VECTOR2I: {
  1530. return r_iter;
  1531. } break;
  1532. case VECTOR3: {
  1533. return r_iter;
  1534. } break;
  1535. case VECTOR3I: {
  1536. return r_iter;
  1537. } break;
  1538. case OBJECT: {
  1539. if (!_get_obj().obj) {
  1540. r_valid = false;
  1541. return Variant();
  1542. }
  1543. #ifdef DEBUG_ENABLED
  1544. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1545. r_valid = false;
  1546. return Variant();
  1547. }
  1548. #endif
  1549. Callable::CallError ce;
  1550. ce.error = Callable::CallError::CALL_OK;
  1551. const Variant *refp[] = { &r_iter };
  1552. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_get, refp, 1, ce);
  1553. if (ce.error != Callable::CallError::CALL_OK) {
  1554. r_valid = false;
  1555. return Variant();
  1556. }
  1557. //r_iter=ref[0];
  1558. return ret;
  1559. } break;
  1560. case STRING: {
  1561. const String *str = reinterpret_cast<const String *>(_data._mem);
  1562. return str->substr(r_iter, 1);
  1563. } break;
  1564. case DICTIONARY: {
  1565. return r_iter; //iterator is the same as the key
  1566. } break;
  1567. case ARRAY: {
  1568. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1569. int idx = r_iter;
  1570. #ifdef DEBUG_ENABLED
  1571. if (idx < 0 || idx >= arr->size()) {
  1572. r_valid = false;
  1573. return Variant();
  1574. }
  1575. #endif
  1576. return arr->get(idx);
  1577. } break;
  1578. case PACKED_BYTE_ARRAY: {
  1579. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1580. int idx = r_iter;
  1581. #ifdef DEBUG_ENABLED
  1582. if (idx < 0 || idx >= arr->size()) {
  1583. r_valid = false;
  1584. return Variant();
  1585. }
  1586. #endif
  1587. return arr->get(idx);
  1588. } break;
  1589. case PACKED_INT32_ARRAY: {
  1590. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1591. int32_t idx = r_iter;
  1592. #ifdef DEBUG_ENABLED
  1593. if (idx < 0 || idx >= arr->size()) {
  1594. r_valid = false;
  1595. return Variant();
  1596. }
  1597. #endif
  1598. return arr->get(idx);
  1599. } break;
  1600. case PACKED_INT64_ARRAY: {
  1601. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1602. int64_t idx = r_iter;
  1603. #ifdef DEBUG_ENABLED
  1604. if (idx < 0 || idx >= arr->size()) {
  1605. r_valid = false;
  1606. return Variant();
  1607. }
  1608. #endif
  1609. return arr->get(idx);
  1610. } break;
  1611. case PACKED_FLOAT32_ARRAY: {
  1612. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1613. int idx = r_iter;
  1614. #ifdef DEBUG_ENABLED
  1615. if (idx < 0 || idx >= arr->size()) {
  1616. r_valid = false;
  1617. return Variant();
  1618. }
  1619. #endif
  1620. return arr->get(idx);
  1621. } break;
  1622. case PACKED_FLOAT64_ARRAY: {
  1623. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1624. int idx = r_iter;
  1625. #ifdef DEBUG_ENABLED
  1626. if (idx < 0 || idx >= arr->size()) {
  1627. r_valid = false;
  1628. return Variant();
  1629. }
  1630. #endif
  1631. return arr->get(idx);
  1632. } break;
  1633. case PACKED_STRING_ARRAY: {
  1634. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1635. int idx = r_iter;
  1636. #ifdef DEBUG_ENABLED
  1637. if (idx < 0 || idx >= arr->size()) {
  1638. r_valid = false;
  1639. return Variant();
  1640. }
  1641. #endif
  1642. return arr->get(idx);
  1643. } break;
  1644. case PACKED_VECTOR2_ARRAY: {
  1645. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1646. int idx = r_iter;
  1647. #ifdef DEBUG_ENABLED
  1648. if (idx < 0 || idx >= arr->size()) {
  1649. r_valid = false;
  1650. return Variant();
  1651. }
  1652. #endif
  1653. return arr->get(idx);
  1654. } break;
  1655. case PACKED_VECTOR3_ARRAY: {
  1656. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1657. int idx = r_iter;
  1658. #ifdef DEBUG_ENABLED
  1659. if (idx < 0 || idx >= arr->size()) {
  1660. r_valid = false;
  1661. return Variant();
  1662. }
  1663. #endif
  1664. return arr->get(idx);
  1665. } break;
  1666. case PACKED_COLOR_ARRAY: {
  1667. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1668. int idx = r_iter;
  1669. #ifdef DEBUG_ENABLED
  1670. if (idx < 0 || idx >= arr->size()) {
  1671. r_valid = false;
  1672. return Variant();
  1673. }
  1674. #endif
  1675. return arr->get(idx);
  1676. } break;
  1677. default: {
  1678. }
  1679. }
  1680. r_valid = false;
  1681. return Variant();
  1682. }
  1683. Variant Variant::duplicate(bool p_deep) const {
  1684. return recursive_duplicate(p_deep, 0);
  1685. }
  1686. Variant Variant::recursive_duplicate(bool p_deep, int recursion_count) const {
  1687. switch (type) {
  1688. case OBJECT: {
  1689. /* breaks stuff :(
  1690. if (p_deep && !_get_obj().ref.is_null()) {
  1691. Ref<Resource> resource = _get_obj().ref;
  1692. if (resource.is_valid()) {
  1693. return resource->duplicate(true);
  1694. }
  1695. }
  1696. */
  1697. return *this;
  1698. } break;
  1699. case DICTIONARY:
  1700. return operator Dictionary().recursive_duplicate(p_deep, recursion_count);
  1701. case ARRAY:
  1702. return operator Array().recursive_duplicate(p_deep, recursion_count);
  1703. case PACKED_BYTE_ARRAY:
  1704. return operator Vector<uint8_t>().duplicate();
  1705. case PACKED_INT32_ARRAY:
  1706. return operator Vector<int32_t>().duplicate();
  1707. case PACKED_INT64_ARRAY:
  1708. return operator Vector<int64_t>().duplicate();
  1709. case PACKED_FLOAT32_ARRAY:
  1710. return operator Vector<float>().duplicate();
  1711. case PACKED_FLOAT64_ARRAY:
  1712. return operator Vector<double>().duplicate();
  1713. case PACKED_STRING_ARRAY:
  1714. return operator Vector<String>().duplicate();
  1715. case PACKED_VECTOR2_ARRAY:
  1716. return operator Vector<Vector2>().duplicate();
  1717. case PACKED_VECTOR3_ARRAY:
  1718. return operator Vector<Vector3>().duplicate();
  1719. case PACKED_COLOR_ARRAY:
  1720. return operator Vector<Color>().duplicate();
  1721. default:
  1722. return *this;
  1723. }
  1724. }
  1725. void Variant::sub(const Variant &a, const Variant &b, Variant &r_dst) {
  1726. if (a.type != b.type) {
  1727. return;
  1728. }
  1729. switch (a.type) {
  1730. case NIL: {
  1731. r_dst = Variant();
  1732. }
  1733. return;
  1734. case INT: {
  1735. int64_t va = a._data._int;
  1736. int64_t vb = b._data._int;
  1737. r_dst = int(va - vb);
  1738. }
  1739. return;
  1740. case FLOAT: {
  1741. double ra = a._data._float;
  1742. double rb = b._data._float;
  1743. r_dst = ra - rb;
  1744. }
  1745. return;
  1746. case VECTOR2: {
  1747. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) - *reinterpret_cast<const Vector2 *>(b._data._mem);
  1748. }
  1749. return;
  1750. case VECTOR2I: {
  1751. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1752. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1753. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1754. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1755. r_dst = Vector2i(int32_t(vax - vbx), int32_t(vay - vby));
  1756. }
  1757. return;
  1758. case RECT2: {
  1759. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1760. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1761. r_dst = Rect2(ra->position - rb->position, ra->size - rb->size);
  1762. }
  1763. return;
  1764. case RECT2I: {
  1765. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1766. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1767. int32_t vax = ra->position.x;
  1768. int32_t vay = ra->position.y;
  1769. int32_t vbx = ra->size.x;
  1770. int32_t vby = ra->size.y;
  1771. int32_t vcx = rb->position.x;
  1772. int32_t vcy = rb->position.y;
  1773. int32_t vdx = rb->size.x;
  1774. int32_t vdy = rb->size.y;
  1775. r_dst = Rect2i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vcx - vdx), int32_t(vcy - vdy));
  1776. }
  1777. return;
  1778. case VECTOR3: {
  1779. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) - *reinterpret_cast<const Vector3 *>(b._data._mem);
  1780. }
  1781. return;
  1782. case VECTOR3I: {
  1783. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1784. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1785. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1786. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1787. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1788. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1789. r_dst = Vector3i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vaz - vbz));
  1790. }
  1791. return;
  1792. case AABB: {
  1793. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1794. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1795. r_dst = ::AABB(ra->position - rb->position, ra->size - rb->size);
  1796. }
  1797. return;
  1798. case QUATERNION: {
  1799. Quaternion empty_rot;
  1800. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1801. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1802. r_dst = (*qb).inverse() * *qa;
  1803. }
  1804. return;
  1805. case COLOR: {
  1806. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1807. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1808. float new_r = ca->r - cb->r;
  1809. float new_g = ca->g - cb->g;
  1810. float new_b = ca->b - cb->b;
  1811. float new_a = ca->a - cb->a;
  1812. new_r = new_r > 1.0 ? 1.0 : new_r;
  1813. new_g = new_g > 1.0 ? 1.0 : new_g;
  1814. new_b = new_b > 1.0 ? 1.0 : new_b;
  1815. new_a = new_a > 1.0 ? 1.0 : new_a;
  1816. r_dst = Color(new_r, new_g, new_b, new_a);
  1817. }
  1818. return;
  1819. default: {
  1820. r_dst = a;
  1821. }
  1822. return;
  1823. }
  1824. }
  1825. void Variant::blend(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1826. if (a.type != b.type) {
  1827. if (a.is_num() && b.is_num()) {
  1828. real_t va = a;
  1829. real_t vb = b;
  1830. r_dst = va + vb * c;
  1831. } else {
  1832. r_dst = a;
  1833. }
  1834. return;
  1835. }
  1836. switch (a.type) {
  1837. case NIL: {
  1838. r_dst = Variant();
  1839. }
  1840. return;
  1841. case INT: {
  1842. int64_t va = a._data._int;
  1843. int64_t vb = b._data._int;
  1844. r_dst = int(va + vb * c + 0.5);
  1845. }
  1846. return;
  1847. case FLOAT: {
  1848. double ra = a._data._float;
  1849. double rb = b._data._float;
  1850. r_dst = ra + rb * c;
  1851. }
  1852. return;
  1853. case VECTOR2: {
  1854. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) + *reinterpret_cast<const Vector2 *>(b._data._mem) * c;
  1855. }
  1856. return;
  1857. case VECTOR2I: {
  1858. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1859. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1860. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1861. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1862. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  1863. }
  1864. return;
  1865. case RECT2: {
  1866. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1867. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1868. r_dst = Rect2(ra->position + rb->position * c, ra->size + rb->size * c);
  1869. }
  1870. return;
  1871. case RECT2I: {
  1872. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1873. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1874. int32_t vax = ra->position.x;
  1875. int32_t vay = ra->position.y;
  1876. int32_t vbx = ra->size.x;
  1877. int32_t vby = ra->size.y;
  1878. int32_t vcx = rb->position.x;
  1879. int32_t vcy = rb->position.y;
  1880. int32_t vdx = rb->size.x;
  1881. int32_t vdy = rb->size.y;
  1882. r_dst = Rect2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vcx + vdx * c + 0.5), int32_t(vcy + vdy * c + 0.5));
  1883. }
  1884. return;
  1885. case VECTOR3: {
  1886. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) + *reinterpret_cast<const Vector3 *>(b._data._mem) * c;
  1887. }
  1888. return;
  1889. case VECTOR3I: {
  1890. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1891. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1892. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1893. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1894. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1895. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1896. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  1897. }
  1898. return;
  1899. case AABB: {
  1900. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1901. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1902. r_dst = ::AABB(ra->position + rb->position * c, ra->size + rb->size * c);
  1903. }
  1904. return;
  1905. case QUATERNION: {
  1906. Quaternion empty_rot;
  1907. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1908. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1909. r_dst = *qa * empty_rot.slerp(*qb, c);
  1910. }
  1911. return;
  1912. case COLOR: {
  1913. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1914. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1915. float new_r = ca->r + cb->r * c;
  1916. float new_g = ca->g + cb->g * c;
  1917. float new_b = ca->b + cb->b * c;
  1918. float new_a = ca->a + cb->a * c;
  1919. new_r = new_r > 1.0 ? 1.0 : new_r;
  1920. new_g = new_g > 1.0 ? 1.0 : new_g;
  1921. new_b = new_b > 1.0 ? 1.0 : new_b;
  1922. new_a = new_a > 1.0 ? 1.0 : new_a;
  1923. r_dst = Color(new_r, new_g, new_b, new_a);
  1924. }
  1925. return;
  1926. default: {
  1927. r_dst = c < 0.5 ? a : b;
  1928. }
  1929. return;
  1930. }
  1931. }
  1932. void Variant::interpolate(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1933. if (a.type != b.type) {
  1934. if (a.is_num() && b.is_num()) {
  1935. //not as efficient but..
  1936. real_t va = a;
  1937. real_t vb = b;
  1938. r_dst = va + (vb - va) * c;
  1939. } else {
  1940. r_dst = a;
  1941. }
  1942. return;
  1943. }
  1944. switch (a.type) {
  1945. case NIL: {
  1946. r_dst = Variant();
  1947. }
  1948. return;
  1949. case BOOL: {
  1950. r_dst = a;
  1951. }
  1952. return;
  1953. case INT: {
  1954. int64_t va = a._data._int;
  1955. int64_t vb = b._data._int;
  1956. r_dst = int(va + (vb - va) * c);
  1957. }
  1958. return;
  1959. case FLOAT: {
  1960. real_t va = a._data._float;
  1961. real_t vb = b._data._float;
  1962. r_dst = va + (vb - va) * c;
  1963. }
  1964. return;
  1965. case STRING: {
  1966. //this is pretty funny and bizarre, but artists like to use it for typewriter effects
  1967. String sa = *reinterpret_cast<const String *>(a._data._mem);
  1968. String sb = *reinterpret_cast<const String *>(b._data._mem);
  1969. String dst;
  1970. int sa_len = sa.length();
  1971. int sb_len = sb.length();
  1972. int csize = sa_len + (sb_len - sa_len) * c;
  1973. if (csize == 0) {
  1974. r_dst = "";
  1975. return;
  1976. }
  1977. dst.resize(csize + 1);
  1978. dst[csize] = 0;
  1979. int split = csize / 2;
  1980. for (int i = 0; i < csize; i++) {
  1981. char32_t chr = ' ';
  1982. if (i < split) {
  1983. if (i < sa.length()) {
  1984. chr = sa[i];
  1985. } else if (i < sb.length()) {
  1986. chr = sb[i];
  1987. }
  1988. } else {
  1989. if (i < sb.length()) {
  1990. chr = sb[i];
  1991. } else if (i < sa.length()) {
  1992. chr = sa[i];
  1993. }
  1994. }
  1995. dst[i] = chr;
  1996. }
  1997. r_dst = dst;
  1998. }
  1999. return;
  2000. case VECTOR2: {
  2001. r_dst = reinterpret_cast<const Vector2 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector2 *>(b._data._mem), c);
  2002. }
  2003. return;
  2004. case VECTOR2I: {
  2005. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  2006. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  2007. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  2008. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  2009. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  2010. }
  2011. return;
  2012. case RECT2: {
  2013. r_dst = Rect2(reinterpret_cast<const Rect2 *>(a._data._mem)->position.lerp(reinterpret_cast<const Rect2 *>(b._data._mem)->position, c), reinterpret_cast<const Rect2 *>(a._data._mem)->size.lerp(reinterpret_cast<const Rect2 *>(b._data._mem)->size, c));
  2014. }
  2015. return;
  2016. case RECT2I: {
  2017. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  2018. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  2019. int32_t vax = ra->position.x;
  2020. int32_t vay = ra->position.y;
  2021. int32_t vbx = ra->size.x;
  2022. int32_t vby = ra->size.y;
  2023. int32_t vcx = rb->position.x;
  2024. int32_t vcy = rb->position.y;
  2025. int32_t vdx = rb->size.x;
  2026. int32_t vdy = rb->size.y;
  2027. r_dst = Rect2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vcx + vdx * c + 0.5), int32_t(vcy + vdy * c + 0.5));
  2028. }
  2029. return;
  2030. case VECTOR3: {
  2031. r_dst = reinterpret_cast<const Vector3 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector3 *>(b._data._mem), c);
  2032. }
  2033. return;
  2034. case VECTOR3I: {
  2035. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  2036. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  2037. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  2038. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  2039. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  2040. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  2041. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  2042. }
  2043. return;
  2044. case TRANSFORM2D: {
  2045. r_dst = a._data._transform2d->interpolate_with(*b._data._transform2d, c);
  2046. }
  2047. return;
  2048. case PLANE: {
  2049. r_dst = a;
  2050. }
  2051. return;
  2052. case QUATERNION: {
  2053. r_dst = reinterpret_cast<const Quaternion *>(a._data._mem)->slerp(*reinterpret_cast<const Quaternion *>(b._data._mem), c);
  2054. }
  2055. return;
  2056. case AABB: {
  2057. r_dst = ::AABB(a._data._aabb->position.lerp(b._data._aabb->position, c), a._data._aabb->size.lerp(b._data._aabb->size, c));
  2058. }
  2059. return;
  2060. case BASIS: {
  2061. r_dst = a._data._basis->lerp(*b._data._basis, c);
  2062. }
  2063. return;
  2064. case TRANSFORM3D: {
  2065. r_dst = a._data._transform3d->interpolate_with(*b._data._transform3d, c);
  2066. }
  2067. return;
  2068. case COLOR: {
  2069. r_dst = reinterpret_cast<const Color *>(a._data._mem)->lerp(*reinterpret_cast<const Color *>(b._data._mem), c);
  2070. }
  2071. return;
  2072. case STRING_NAME: {
  2073. r_dst = a;
  2074. }
  2075. return;
  2076. case NODE_PATH: {
  2077. r_dst = a;
  2078. }
  2079. return;
  2080. case RID: {
  2081. r_dst = a;
  2082. }
  2083. return;
  2084. case OBJECT: {
  2085. r_dst = a;
  2086. }
  2087. return;
  2088. case DICTIONARY: {
  2089. }
  2090. return;
  2091. case ARRAY: {
  2092. r_dst = a;
  2093. }
  2094. return;
  2095. case PACKED_BYTE_ARRAY: {
  2096. r_dst = a;
  2097. }
  2098. return;
  2099. case PACKED_INT32_ARRAY: {
  2100. const Vector<int32_t> *arr_a = &PackedArrayRef<int32_t>::get_array(a._data.packed_array);
  2101. const Vector<int32_t> *arr_b = &PackedArrayRef<int32_t>::get_array(b._data.packed_array);
  2102. int32_t sz = arr_a->size();
  2103. if (sz == 0 || arr_b->size() != sz) {
  2104. r_dst = a;
  2105. } else {
  2106. Vector<int32_t> v;
  2107. v.resize(sz);
  2108. {
  2109. int32_t *vw = v.ptrw();
  2110. const int32_t *ar = arr_a->ptr();
  2111. const int32_t *br = arr_b->ptr();
  2112. Variant va;
  2113. for (int32_t i = 0; i < sz; i++) {
  2114. Variant::interpolate(ar[i], br[i], c, va);
  2115. vw[i] = va;
  2116. }
  2117. }
  2118. r_dst = v;
  2119. }
  2120. }
  2121. return;
  2122. case PACKED_INT64_ARRAY: {
  2123. const Vector<int64_t> *arr_a = &PackedArrayRef<int64_t>::get_array(a._data.packed_array);
  2124. const Vector<int64_t> *arr_b = &PackedArrayRef<int64_t>::get_array(b._data.packed_array);
  2125. int64_t sz = arr_a->size();
  2126. if (sz == 0 || arr_b->size() != sz) {
  2127. r_dst = a;
  2128. } else {
  2129. Vector<int64_t> v;
  2130. v.resize(sz);
  2131. {
  2132. int64_t *vw = v.ptrw();
  2133. const int64_t *ar = arr_a->ptr();
  2134. const int64_t *br = arr_b->ptr();
  2135. Variant va;
  2136. for (int64_t i = 0; i < sz; i++) {
  2137. Variant::interpolate(ar[i], br[i], c, va);
  2138. vw[i] = va;
  2139. }
  2140. }
  2141. r_dst = v;
  2142. }
  2143. }
  2144. return;
  2145. case PACKED_FLOAT32_ARRAY: {
  2146. const Vector<float> *arr_a = &PackedArrayRef<float>::get_array(a._data.packed_array);
  2147. const Vector<float> *arr_b = &PackedArrayRef<float>::get_array(b._data.packed_array);
  2148. int sz = arr_a->size();
  2149. if (sz == 0 || arr_b->size() != sz) {
  2150. r_dst = a;
  2151. } else {
  2152. Vector<float> v;
  2153. v.resize(sz);
  2154. {
  2155. float *vw = v.ptrw();
  2156. const float *ar = arr_a->ptr();
  2157. const float *br = arr_b->ptr();
  2158. Variant va;
  2159. for (int i = 0; i < sz; i++) {
  2160. Variant::interpolate(ar[i], br[i], c, va);
  2161. vw[i] = va;
  2162. }
  2163. }
  2164. r_dst = v;
  2165. }
  2166. }
  2167. return;
  2168. case PACKED_FLOAT64_ARRAY: {
  2169. const Vector<double> *arr_a = &PackedArrayRef<double>::get_array(a._data.packed_array);
  2170. const Vector<double> *arr_b = &PackedArrayRef<double>::get_array(b._data.packed_array);
  2171. int sz = arr_a->size();
  2172. if (sz == 0 || arr_b->size() != sz) {
  2173. r_dst = a;
  2174. } else {
  2175. Vector<double> v;
  2176. v.resize(sz);
  2177. {
  2178. double *vw = v.ptrw();
  2179. const double *ar = arr_a->ptr();
  2180. const double *br = arr_b->ptr();
  2181. Variant va;
  2182. for (int i = 0; i < sz; i++) {
  2183. Variant::interpolate(ar[i], br[i], c, va);
  2184. vw[i] = va;
  2185. }
  2186. }
  2187. r_dst = v;
  2188. }
  2189. }
  2190. return;
  2191. case PACKED_STRING_ARRAY: {
  2192. r_dst = a;
  2193. }
  2194. return;
  2195. case PACKED_VECTOR2_ARRAY: {
  2196. const Vector<Vector2> *arr_a = &PackedArrayRef<Vector2>::get_array(a._data.packed_array);
  2197. const Vector<Vector2> *arr_b = &PackedArrayRef<Vector2>::get_array(b._data.packed_array);
  2198. int sz = arr_a->size();
  2199. if (sz == 0 || arr_b->size() != sz) {
  2200. r_dst = a;
  2201. } else {
  2202. Vector<Vector2> v;
  2203. v.resize(sz);
  2204. {
  2205. Vector2 *vw = v.ptrw();
  2206. const Vector2 *ar = arr_a->ptr();
  2207. const Vector2 *br = arr_b->ptr();
  2208. for (int i = 0; i < sz; i++) {
  2209. vw[i] = ar[i].lerp(br[i], c);
  2210. }
  2211. }
  2212. r_dst = v;
  2213. }
  2214. }
  2215. return;
  2216. case PACKED_VECTOR3_ARRAY: {
  2217. const Vector<Vector3> *arr_a = &PackedArrayRef<Vector3>::get_array(a._data.packed_array);
  2218. const Vector<Vector3> *arr_b = &PackedArrayRef<Vector3>::get_array(b._data.packed_array);
  2219. int sz = arr_a->size();
  2220. if (sz == 0 || arr_b->size() != sz) {
  2221. r_dst = a;
  2222. } else {
  2223. Vector<Vector3> v;
  2224. v.resize(sz);
  2225. {
  2226. Vector3 *vw = v.ptrw();
  2227. const Vector3 *ar = arr_a->ptr();
  2228. const Vector3 *br = arr_b->ptr();
  2229. for (int i = 0; i < sz; i++) {
  2230. vw[i] = ar[i].lerp(br[i], c);
  2231. }
  2232. }
  2233. r_dst = v;
  2234. }
  2235. }
  2236. return;
  2237. case PACKED_COLOR_ARRAY: {
  2238. const Vector<Color> *arr_a = &PackedArrayRef<Color>::get_array(a._data.packed_array);
  2239. const Vector<Color> *arr_b = &PackedArrayRef<Color>::get_array(b._data.packed_array);
  2240. int sz = arr_a->size();
  2241. if (sz == 0 || arr_b->size() != sz) {
  2242. r_dst = a;
  2243. } else {
  2244. Vector<Color> v;
  2245. v.resize(sz);
  2246. {
  2247. Color *vw = v.ptrw();
  2248. const Color *ar = arr_a->ptr();
  2249. const Color *br = arr_b->ptr();
  2250. for (int i = 0; i < sz; i++) {
  2251. vw[i] = ar[i].lerp(br[i], c);
  2252. }
  2253. }
  2254. r_dst = v;
  2255. }
  2256. }
  2257. return;
  2258. default: {
  2259. r_dst = a;
  2260. }
  2261. }
  2262. }
  2263. void Variant::_register_variant_setters_getters() {
  2264. register_named_setters_getters();
  2265. register_indexed_setters_getters();
  2266. register_keyed_setters_getters();
  2267. }
  2268. void Variant::_unregister_variant_setters_getters() {
  2269. unregister_named_setters_getters();
  2270. unregister_indexed_setters_getters();
  2271. }