variant_setget.cpp 99 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484
  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(Quaternion, double, real_t, 4)
  749. INDEXED_SETGET_STRUCT_BULTIN_NUMERIC(Color, double, float, 4)
  750. INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(Transform2D, Vector2, .columns, 3)
  751. INDEXED_SETGET_STRUCT_BULTIN_FUNC(Basis, Vector3, set_column, get_column, 3)
  752. INDEXED_SETGET_STRUCT_BULTIN_ACCESSOR(Projection, Vector4, .matrix, 4)
  753. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedByteArray, int64_t, uint8_t)
  754. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt32Array, int64_t, int32_t)
  755. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedInt64Array, int64_t, int64_t)
  756. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat32Array, double, float)
  757. INDEXED_SETGET_STRUCT_TYPED_NUMERIC(PackedFloat64Array, double, double)
  758. INDEXED_SETGET_STRUCT_TYPED(PackedVector2Array, Vector2)
  759. INDEXED_SETGET_STRUCT_TYPED(PackedVector3Array, Vector3)
  760. INDEXED_SETGET_STRUCT_TYPED(PackedStringArray, String)
  761. INDEXED_SETGET_STRUCT_TYPED(PackedColorArray, Color)
  762. INDEXED_SETGET_STRUCT_DICT(Dictionary)
  763. struct VariantIndexedSetterGetterInfo {
  764. void (*setter)(Variant *base, int64_t index, const Variant *value, bool *valid, bool *oob) = nullptr;
  765. void (*getter)(const Variant *base, int64_t index, Variant *value, bool *oob) = nullptr;
  766. Variant::ValidatedIndexedSetter validated_setter = nullptr;
  767. Variant::ValidatedIndexedGetter validated_getter = nullptr;
  768. Variant::PTRIndexedSetter ptr_setter = nullptr;
  769. Variant::PTRIndexedGetter ptr_getter = nullptr;
  770. uint64_t (*get_indexed_size)(const Variant *base) = nullptr;
  771. Variant::Type index_type;
  772. bool valid = false;
  773. };
  774. static VariantIndexedSetterGetterInfo variant_indexed_setters_getters[Variant::VARIANT_MAX];
  775. template <class T>
  776. static void register_indexed_member(Variant::Type p_type) {
  777. VariantIndexedSetterGetterInfo &sgi = variant_indexed_setters_getters[p_type];
  778. sgi.setter = T::set;
  779. sgi.validated_setter = T::validated_set;
  780. sgi.ptr_setter = T::ptr_set;
  781. sgi.getter = T::get;
  782. sgi.validated_getter = T::get;
  783. sgi.ptr_getter = T::ptr_get;
  784. sgi.index_type = T::get_index_type();
  785. sgi.get_indexed_size = T::get_indexed_size;
  786. sgi.valid = true;
  787. }
  788. void register_indexed_setters_getters() {
  789. #define REGISTER_INDEXED_MEMBER(m_base_type) register_indexed_member<VariantIndexedSetGet_##m_base_type>(GetTypeInfo<m_base_type>::VARIANT_TYPE)
  790. REGISTER_INDEXED_MEMBER(String);
  791. REGISTER_INDEXED_MEMBER(Vector2);
  792. REGISTER_INDEXED_MEMBER(Vector2i);
  793. REGISTER_INDEXED_MEMBER(Vector3);
  794. REGISTER_INDEXED_MEMBER(Vector3i);
  795. REGISTER_INDEXED_MEMBER(Quaternion);
  796. REGISTER_INDEXED_MEMBER(Color);
  797. REGISTER_INDEXED_MEMBER(Transform2D);
  798. REGISTER_INDEXED_MEMBER(Basis);
  799. REGISTER_INDEXED_MEMBER(Projection);
  800. REGISTER_INDEXED_MEMBER(PackedByteArray);
  801. REGISTER_INDEXED_MEMBER(PackedInt32Array);
  802. REGISTER_INDEXED_MEMBER(PackedInt64Array);
  803. REGISTER_INDEXED_MEMBER(PackedFloat32Array);
  804. REGISTER_INDEXED_MEMBER(PackedFloat64Array);
  805. REGISTER_INDEXED_MEMBER(PackedVector2Array);
  806. REGISTER_INDEXED_MEMBER(PackedVector3Array);
  807. REGISTER_INDEXED_MEMBER(PackedStringArray);
  808. REGISTER_INDEXED_MEMBER(PackedColorArray);
  809. REGISTER_INDEXED_MEMBER(Array);
  810. REGISTER_INDEXED_MEMBER(Dictionary);
  811. }
  812. static void unregister_indexed_setters_getters() {
  813. }
  814. bool Variant::has_indexing(Variant::Type p_type) {
  815. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, false);
  816. return variant_indexed_setters_getters[p_type].valid;
  817. }
  818. Variant::Type Variant::get_indexed_element_type(Variant::Type p_type) {
  819. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, Variant::VARIANT_MAX);
  820. return variant_indexed_setters_getters[p_type].index_type;
  821. }
  822. Variant::ValidatedIndexedSetter Variant::get_member_validated_indexed_setter(Variant::Type p_type) {
  823. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  824. return variant_indexed_setters_getters[p_type].validated_setter;
  825. }
  826. Variant::ValidatedIndexedGetter Variant::get_member_validated_indexed_getter(Variant::Type p_type) {
  827. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  828. return variant_indexed_setters_getters[p_type].validated_getter;
  829. }
  830. Variant::PTRIndexedSetter Variant::get_member_ptr_indexed_setter(Variant::Type p_type) {
  831. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  832. return variant_indexed_setters_getters[p_type].ptr_setter;
  833. }
  834. Variant::PTRIndexedGetter Variant::get_member_ptr_indexed_getter(Variant::Type p_type) {
  835. ERR_FAIL_INDEX_V(p_type, Variant::VARIANT_MAX, nullptr);
  836. return variant_indexed_setters_getters[p_type].ptr_getter;
  837. }
  838. void Variant::set_indexed(int64_t p_index, const Variant &p_value, bool &r_valid, bool &r_oob) {
  839. if (likely(variant_indexed_setters_getters[type].valid)) {
  840. variant_indexed_setters_getters[type].setter(this, p_index, &p_value, &r_valid, &r_oob);
  841. } else {
  842. r_valid = false;
  843. r_oob = false;
  844. }
  845. }
  846. Variant Variant::get_indexed(int64_t p_index, bool &r_valid, bool &r_oob) const {
  847. if (likely(variant_indexed_setters_getters[type].valid)) {
  848. Variant ret;
  849. variant_indexed_setters_getters[type].getter(this, p_index, &ret, &r_oob);
  850. r_valid = !r_oob;
  851. return ret;
  852. } else {
  853. r_valid = false;
  854. r_oob = false;
  855. return Variant();
  856. }
  857. }
  858. uint64_t Variant::get_indexed_size() const {
  859. if (likely(variant_indexed_setters_getters[type].valid && variant_indexed_setters_getters[type].get_indexed_size)) {
  860. return variant_indexed_setters_getters[type].get_indexed_size(this);
  861. } else {
  862. return 0;
  863. }
  864. }
  865. struct VariantKeyedSetGetDictionary {
  866. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  867. const Variant *ptr = VariantGetInternalPtr<Dictionary>::get_ptr(base)->getptr(*key);
  868. if (!ptr) {
  869. *r_valid = false;
  870. return;
  871. }
  872. *value = *ptr;
  873. *r_valid = true;
  874. }
  875. static void ptr_get(const void *base, const void *key, void *value) {
  876. /* avoid ptrconvert for performance*/
  877. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  878. const Variant *ptr = v.getptr(PtrToArg<Variant>::convert(key));
  879. NULL_TEST(ptr);
  880. PtrToArg<Variant>::encode(*ptr, value);
  881. }
  882. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  883. if (VariantGetInternalPtr<Dictionary>::get_ptr(base)->is_read_only()) {
  884. *r_valid = false;
  885. return;
  886. }
  887. (*VariantGetInternalPtr<Dictionary>::get_ptr(base))[*key] = *value;
  888. *r_valid = true;
  889. }
  890. static void ptr_set(void *base, const void *key, const void *value) {
  891. Dictionary &v = *reinterpret_cast<Dictionary *>(base);
  892. v[PtrToArg<Variant>::convert(key)] = PtrToArg<Variant>::convert(value);
  893. }
  894. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  895. *r_valid = true;
  896. return VariantGetInternalPtr<Dictionary>::get_ptr(base)->has(*key);
  897. }
  898. static uint32_t ptr_has(const void *base, const void *key) {
  899. /* avoid ptrconvert for performance*/
  900. const Dictionary &v = *reinterpret_cast<const Dictionary *>(base);
  901. return v.has(PtrToArg<Variant>::convert(key));
  902. }
  903. };
  904. struct VariantKeyedSetGetObject {
  905. static void get(const Variant *base, const Variant *key, Variant *value, bool *r_valid) {
  906. Object *obj = base->get_validated_object();
  907. if (!obj) {
  908. *r_valid = false;
  909. *value = Variant();
  910. return;
  911. }
  912. *value = obj->getvar(*key, r_valid);
  913. }
  914. static void ptr_get(const void *base, const void *key, void *value) {
  915. const Object *obj = PtrToArg<Object *>::convert(base);
  916. NULL_TEST(obj);
  917. Variant v = obj->getvar(PtrToArg<Variant>::convert(key));
  918. PtrToArg<Variant>::encode(v, value);
  919. }
  920. static void set(Variant *base, const Variant *key, const Variant *value, bool *r_valid) {
  921. Object *obj = base->get_validated_object();
  922. if (!obj) {
  923. *r_valid = false;
  924. return;
  925. }
  926. obj->setvar(*key, *value, r_valid);
  927. }
  928. static void ptr_set(void *base, const void *key, const void *value) {
  929. Object *obj = PtrToArg<Object *>::convert(base);
  930. NULL_TEST(obj);
  931. obj->setvar(PtrToArg<Variant>::convert(key), PtrToArg<Variant>::convert(value));
  932. }
  933. static bool has(const Variant *base, const Variant *key, bool *r_valid) {
  934. Object *obj = base->get_validated_object();
  935. if (!obj) {
  936. *r_valid = false;
  937. return false;
  938. }
  939. *r_valid = true;
  940. bool exists;
  941. obj->getvar(*key, &exists);
  942. return exists;
  943. }
  944. static uint32_t ptr_has(const void *base, const void *key) {
  945. const Object *obj = PtrToArg<Object *>::convert(base);
  946. ERR_FAIL_COND_V(!obj, false);
  947. bool valid;
  948. obj->getvar(PtrToArg<Variant>::convert(key), &valid);
  949. return valid;
  950. }
  951. };
  952. struct VariantKeyedSetterGetterInfo {
  953. Variant::ValidatedKeyedSetter validated_setter = nullptr;
  954. Variant::ValidatedKeyedGetter validated_getter = nullptr;
  955. Variant::ValidatedKeyedChecker validated_checker = nullptr;
  956. Variant::PTRKeyedSetter ptr_setter = nullptr;
  957. Variant::PTRKeyedGetter ptr_getter = nullptr;
  958. Variant::PTRKeyedChecker ptr_checker = nullptr;
  959. bool valid = false;
  960. };
  961. static VariantKeyedSetterGetterInfo variant_keyed_setters_getters[Variant::VARIANT_MAX];
  962. template <class T>
  963. static void register_keyed_member(Variant::Type p_type) {
  964. VariantKeyedSetterGetterInfo &sgi = variant_keyed_setters_getters[p_type];
  965. sgi.validated_setter = T::set;
  966. sgi.ptr_setter = T::ptr_set;
  967. sgi.validated_getter = T::get;
  968. sgi.ptr_getter = T::ptr_get;
  969. sgi.validated_checker = T::has;
  970. sgi.ptr_checker = T::ptr_has;
  971. sgi.valid = true;
  972. }
  973. static void register_keyed_setters_getters() {
  974. register_keyed_member<VariantKeyedSetGetDictionary>(Variant::DICTIONARY);
  975. register_keyed_member<VariantKeyedSetGetObject>(Variant::OBJECT);
  976. }
  977. bool Variant::is_keyed(Variant::Type p_type) {
  978. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, false);
  979. return variant_keyed_setters_getters[p_type].valid;
  980. }
  981. Variant::ValidatedKeyedSetter Variant::get_member_validated_keyed_setter(Variant::Type p_type) {
  982. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  983. return variant_keyed_setters_getters[p_type].validated_setter;
  984. }
  985. Variant::ValidatedKeyedGetter Variant::get_member_validated_keyed_getter(Variant::Type p_type) {
  986. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  987. return variant_keyed_setters_getters[p_type].validated_getter;
  988. }
  989. Variant::ValidatedKeyedChecker Variant::get_member_validated_keyed_checker(Variant::Type p_type) {
  990. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  991. return variant_keyed_setters_getters[p_type].validated_checker;
  992. }
  993. Variant::PTRKeyedSetter Variant::get_member_ptr_keyed_setter(Variant::Type p_type) {
  994. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  995. return variant_keyed_setters_getters[p_type].ptr_setter;
  996. }
  997. Variant::PTRKeyedGetter Variant::get_member_ptr_keyed_getter(Variant::Type p_type) {
  998. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  999. return variant_keyed_setters_getters[p_type].ptr_getter;
  1000. }
  1001. Variant::PTRKeyedChecker Variant::get_member_ptr_keyed_checker(Variant::Type p_type) {
  1002. ERR_FAIL_INDEX_V(p_type, VARIANT_MAX, nullptr);
  1003. return variant_keyed_setters_getters[p_type].ptr_checker;
  1004. }
  1005. void Variant::set_keyed(const Variant &p_key, const Variant &p_value, bool &r_valid) {
  1006. if (likely(variant_keyed_setters_getters[type].valid)) {
  1007. variant_keyed_setters_getters[type].validated_setter(this, &p_key, &p_value, &r_valid);
  1008. } else {
  1009. r_valid = false;
  1010. }
  1011. }
  1012. Variant Variant::get_keyed(const Variant &p_key, bool &r_valid) const {
  1013. if (likely(variant_keyed_setters_getters[type].valid)) {
  1014. Variant ret;
  1015. variant_keyed_setters_getters[type].validated_getter(this, &p_key, &ret, &r_valid);
  1016. return ret;
  1017. } else {
  1018. r_valid = false;
  1019. return Variant();
  1020. }
  1021. }
  1022. bool Variant::has_key(const Variant &p_key, bool &r_valid) const {
  1023. if (likely(variant_keyed_setters_getters[type].valid)) {
  1024. return variant_keyed_setters_getters[type].validated_checker(this, &p_key, &r_valid);
  1025. } else {
  1026. r_valid = false;
  1027. return false;
  1028. }
  1029. }
  1030. void Variant::set(const Variant &p_index, const Variant &p_value, bool *r_valid) {
  1031. if (type == DICTIONARY || type == OBJECT) {
  1032. bool valid;
  1033. set_keyed(p_index, p_value, valid);
  1034. if (r_valid) {
  1035. *r_valid = valid;
  1036. }
  1037. } else {
  1038. bool valid = false;
  1039. if (p_index.get_type() == STRING_NAME) {
  1040. set_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), p_value, valid);
  1041. } else if (p_index.get_type() == INT) {
  1042. bool obb;
  1043. set_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), p_value, valid, obb);
  1044. if (obb) {
  1045. valid = false;
  1046. }
  1047. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1048. set_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), p_value, valid);
  1049. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1050. bool obb;
  1051. set_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), p_value, valid, obb);
  1052. if (obb) {
  1053. valid = false;
  1054. }
  1055. }
  1056. if (r_valid) {
  1057. *r_valid = valid;
  1058. }
  1059. }
  1060. }
  1061. Variant Variant::get(const Variant &p_index, bool *r_valid) const {
  1062. Variant ret;
  1063. if (type == DICTIONARY || type == OBJECT) {
  1064. bool valid;
  1065. ret = get_keyed(p_index, valid);
  1066. if (r_valid) {
  1067. *r_valid = valid;
  1068. }
  1069. } else {
  1070. bool valid = false;
  1071. if (p_index.get_type() == STRING_NAME) {
  1072. ret = get_named(*VariantGetInternalPtr<StringName>::get_ptr(&p_index), valid);
  1073. } else if (p_index.get_type() == INT) {
  1074. bool obb;
  1075. ret = get_indexed(*VariantGetInternalPtr<int64_t>::get_ptr(&p_index), valid, obb);
  1076. if (obb) {
  1077. valid = false;
  1078. }
  1079. } else if (p_index.get_type() == STRING) { // less efficient version of named
  1080. ret = get_named(*VariantGetInternalPtr<String>::get_ptr(&p_index), valid);
  1081. } else if (p_index.get_type() == FLOAT) { // less efficient version of indexed
  1082. bool obb;
  1083. ret = get_indexed(*VariantGetInternalPtr<double>::get_ptr(&p_index), valid, obb);
  1084. if (obb) {
  1085. valid = false;
  1086. }
  1087. }
  1088. if (r_valid) {
  1089. *r_valid = valid;
  1090. }
  1091. }
  1092. return ret;
  1093. }
  1094. void Variant::get_property_list(List<PropertyInfo> *p_list) const {
  1095. if (type == DICTIONARY) {
  1096. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1097. List<Variant> keys;
  1098. dic->get_key_list(&keys);
  1099. for (const Variant &E : keys) {
  1100. if (E.get_type() == Variant::STRING) {
  1101. p_list->push_back(PropertyInfo(Variant::STRING, E));
  1102. }
  1103. }
  1104. } else if (type == OBJECT) {
  1105. Object *obj = get_validated_object();
  1106. ERR_FAIL_COND(!obj);
  1107. obj->get_property_list(p_list);
  1108. } else {
  1109. List<StringName> members;
  1110. get_member_list(type, &members);
  1111. for (const StringName &E : members) {
  1112. PropertyInfo pi;
  1113. pi.name = E;
  1114. pi.type = get_member_type(type, E);
  1115. p_list->push_back(pi);
  1116. }
  1117. }
  1118. }
  1119. bool Variant::iter_init(Variant &r_iter, bool &valid) const {
  1120. valid = true;
  1121. switch (type) {
  1122. case INT: {
  1123. r_iter = 0;
  1124. return _data._int > 0;
  1125. } break;
  1126. case FLOAT: {
  1127. r_iter = 0;
  1128. return _data._float > 0.0;
  1129. } break;
  1130. case VECTOR2: {
  1131. double from = reinterpret_cast<const Vector2 *>(_data._mem)->x;
  1132. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1133. r_iter = from;
  1134. return from < to;
  1135. } break;
  1136. case VECTOR2I: {
  1137. int64_t from = reinterpret_cast<const Vector2i *>(_data._mem)->x;
  1138. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1139. r_iter = from;
  1140. return from < to;
  1141. } break;
  1142. case VECTOR3: {
  1143. double from = reinterpret_cast<const Vector3 *>(_data._mem)->x;
  1144. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1145. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1146. r_iter = from;
  1147. if (from == to) {
  1148. return false;
  1149. } else if (from < to) {
  1150. return step > 0;
  1151. }
  1152. return step < 0;
  1153. } break;
  1154. case VECTOR3I: {
  1155. int64_t from = reinterpret_cast<const Vector3i *>(_data._mem)->x;
  1156. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1157. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1158. r_iter = from;
  1159. if (from == to) {
  1160. return false;
  1161. } else if (from < to) {
  1162. return step > 0;
  1163. }
  1164. return step < 0;
  1165. } break;
  1166. case OBJECT: {
  1167. if (!_get_obj().obj) {
  1168. valid = false;
  1169. return false;
  1170. }
  1171. #ifdef DEBUG_ENABLED
  1172. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1173. valid = false;
  1174. return false;
  1175. }
  1176. #endif
  1177. Callable::CallError ce;
  1178. ce.error = Callable::CallError::CALL_OK;
  1179. Array ref;
  1180. ref.push_back(r_iter);
  1181. Variant vref = ref;
  1182. const Variant *refp[] = { &vref };
  1183. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_init, refp, 1, ce);
  1184. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1185. valid = false;
  1186. return false;
  1187. }
  1188. r_iter = ref[0];
  1189. return ret;
  1190. } break;
  1191. case STRING: {
  1192. const String *str = reinterpret_cast<const String *>(_data._mem);
  1193. if (str->is_empty()) {
  1194. return false;
  1195. }
  1196. r_iter = 0;
  1197. return true;
  1198. } break;
  1199. case DICTIONARY: {
  1200. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1201. if (dic->is_empty()) {
  1202. return false;
  1203. }
  1204. const Variant *next = dic->next(nullptr);
  1205. r_iter = *next;
  1206. return true;
  1207. } break;
  1208. case ARRAY: {
  1209. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1210. if (arr->is_empty()) {
  1211. return false;
  1212. }
  1213. r_iter = 0;
  1214. return true;
  1215. } break;
  1216. case PACKED_BYTE_ARRAY: {
  1217. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1218. if (arr->size() == 0) {
  1219. return false;
  1220. }
  1221. r_iter = 0;
  1222. return true;
  1223. } break;
  1224. case PACKED_INT32_ARRAY: {
  1225. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1226. if (arr->size() == 0) {
  1227. return false;
  1228. }
  1229. r_iter = 0;
  1230. return true;
  1231. } break;
  1232. case PACKED_INT64_ARRAY: {
  1233. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1234. if (arr->size() == 0) {
  1235. return false;
  1236. }
  1237. r_iter = 0;
  1238. return true;
  1239. } break;
  1240. case PACKED_FLOAT32_ARRAY: {
  1241. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1242. if (arr->size() == 0) {
  1243. return false;
  1244. }
  1245. r_iter = 0;
  1246. return true;
  1247. } break;
  1248. case PACKED_FLOAT64_ARRAY: {
  1249. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1250. if (arr->size() == 0) {
  1251. return false;
  1252. }
  1253. r_iter = 0;
  1254. return true;
  1255. } break;
  1256. case PACKED_STRING_ARRAY: {
  1257. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1258. if (arr->size() == 0) {
  1259. return false;
  1260. }
  1261. r_iter = 0;
  1262. return true;
  1263. } break;
  1264. case PACKED_VECTOR2_ARRAY: {
  1265. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1266. if (arr->size() == 0) {
  1267. return false;
  1268. }
  1269. r_iter = 0;
  1270. return true;
  1271. } break;
  1272. case PACKED_VECTOR3_ARRAY: {
  1273. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1274. if (arr->size() == 0) {
  1275. return false;
  1276. }
  1277. r_iter = 0;
  1278. return true;
  1279. } break;
  1280. case PACKED_COLOR_ARRAY: {
  1281. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1282. if (arr->size() == 0) {
  1283. return false;
  1284. }
  1285. r_iter = 0;
  1286. return true;
  1287. } break;
  1288. default: {
  1289. }
  1290. }
  1291. valid = false;
  1292. return false;
  1293. }
  1294. bool Variant::iter_next(Variant &r_iter, bool &valid) const {
  1295. valid = true;
  1296. switch (type) {
  1297. case INT: {
  1298. int64_t idx = r_iter;
  1299. idx++;
  1300. if (idx >= _data._int) {
  1301. return false;
  1302. }
  1303. r_iter = idx;
  1304. return true;
  1305. } break;
  1306. case FLOAT: {
  1307. int64_t idx = r_iter;
  1308. idx++;
  1309. if (idx >= _data._float) {
  1310. return false;
  1311. }
  1312. r_iter = idx;
  1313. return true;
  1314. } break;
  1315. case VECTOR2: {
  1316. double to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  1317. double idx = r_iter;
  1318. idx++;
  1319. if (idx >= to) {
  1320. return false;
  1321. }
  1322. r_iter = idx;
  1323. return true;
  1324. } break;
  1325. case VECTOR2I: {
  1326. int64_t to = reinterpret_cast<const Vector2i *>(_data._mem)->y;
  1327. int64_t idx = r_iter;
  1328. idx++;
  1329. if (idx >= to) {
  1330. return false;
  1331. }
  1332. r_iter = idx;
  1333. return true;
  1334. } break;
  1335. case VECTOR3: {
  1336. double to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  1337. double step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  1338. double idx = r_iter;
  1339. idx += step;
  1340. if (step < 0 && idx <= to) {
  1341. return false;
  1342. }
  1343. if (step > 0 && idx >= to) {
  1344. return false;
  1345. }
  1346. r_iter = idx;
  1347. return true;
  1348. } break;
  1349. case VECTOR3I: {
  1350. int64_t to = reinterpret_cast<const Vector3i *>(_data._mem)->y;
  1351. int64_t step = reinterpret_cast<const Vector3i *>(_data._mem)->z;
  1352. int64_t idx = r_iter;
  1353. idx += step;
  1354. if (step < 0 && idx <= to) {
  1355. return false;
  1356. }
  1357. if (step > 0 && idx >= to) {
  1358. return false;
  1359. }
  1360. r_iter = idx;
  1361. return true;
  1362. } break;
  1363. case OBJECT: {
  1364. if (!_get_obj().obj) {
  1365. valid = false;
  1366. return false;
  1367. }
  1368. #ifdef DEBUG_ENABLED
  1369. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1370. valid = false;
  1371. return false;
  1372. }
  1373. #endif
  1374. Callable::CallError ce;
  1375. ce.error = Callable::CallError::CALL_OK;
  1376. Array ref;
  1377. ref.push_back(r_iter);
  1378. Variant vref = ref;
  1379. const Variant *refp[] = { &vref };
  1380. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_next, refp, 1, ce);
  1381. if (ref.size() != 1 || ce.error != Callable::CallError::CALL_OK) {
  1382. valid = false;
  1383. return false;
  1384. }
  1385. r_iter = ref[0];
  1386. return ret;
  1387. } break;
  1388. case STRING: {
  1389. const String *str = reinterpret_cast<const String *>(_data._mem);
  1390. int idx = r_iter;
  1391. idx++;
  1392. if (idx >= str->length()) {
  1393. return false;
  1394. }
  1395. r_iter = idx;
  1396. return true;
  1397. } break;
  1398. case DICTIONARY: {
  1399. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1400. const Variant *next = dic->next(&r_iter);
  1401. if (!next) {
  1402. return false;
  1403. }
  1404. r_iter = *next;
  1405. return true;
  1406. } break;
  1407. case ARRAY: {
  1408. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1409. int idx = r_iter;
  1410. idx++;
  1411. if (idx >= arr->size()) {
  1412. return false;
  1413. }
  1414. r_iter = idx;
  1415. return true;
  1416. } break;
  1417. case PACKED_BYTE_ARRAY: {
  1418. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1419. int idx = r_iter;
  1420. idx++;
  1421. if (idx >= arr->size()) {
  1422. return false;
  1423. }
  1424. r_iter = idx;
  1425. return true;
  1426. } break;
  1427. case PACKED_INT32_ARRAY: {
  1428. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1429. int32_t idx = r_iter;
  1430. idx++;
  1431. if (idx >= arr->size()) {
  1432. return false;
  1433. }
  1434. r_iter = idx;
  1435. return true;
  1436. } break;
  1437. case PACKED_INT64_ARRAY: {
  1438. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1439. int64_t idx = r_iter;
  1440. idx++;
  1441. if (idx >= arr->size()) {
  1442. return false;
  1443. }
  1444. r_iter = idx;
  1445. return true;
  1446. } break;
  1447. case PACKED_FLOAT32_ARRAY: {
  1448. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1449. int idx = r_iter;
  1450. idx++;
  1451. if (idx >= arr->size()) {
  1452. return false;
  1453. }
  1454. r_iter = idx;
  1455. return true;
  1456. } break;
  1457. case PACKED_FLOAT64_ARRAY: {
  1458. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1459. int idx = r_iter;
  1460. idx++;
  1461. if (idx >= arr->size()) {
  1462. return false;
  1463. }
  1464. r_iter = idx;
  1465. return true;
  1466. } break;
  1467. case PACKED_STRING_ARRAY: {
  1468. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1469. int idx = r_iter;
  1470. idx++;
  1471. if (idx >= arr->size()) {
  1472. return false;
  1473. }
  1474. r_iter = idx;
  1475. return true;
  1476. } break;
  1477. case PACKED_VECTOR2_ARRAY: {
  1478. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1479. int idx = r_iter;
  1480. idx++;
  1481. if (idx >= arr->size()) {
  1482. return false;
  1483. }
  1484. r_iter = idx;
  1485. return true;
  1486. } break;
  1487. case PACKED_VECTOR3_ARRAY: {
  1488. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1489. int idx = r_iter;
  1490. idx++;
  1491. if (idx >= arr->size()) {
  1492. return false;
  1493. }
  1494. r_iter = idx;
  1495. return true;
  1496. } break;
  1497. case PACKED_COLOR_ARRAY: {
  1498. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1499. int idx = r_iter;
  1500. idx++;
  1501. if (idx >= arr->size()) {
  1502. return false;
  1503. }
  1504. r_iter = idx;
  1505. return true;
  1506. } break;
  1507. default: {
  1508. }
  1509. }
  1510. valid = false;
  1511. return false;
  1512. }
  1513. Variant Variant::iter_get(const Variant &r_iter, bool &r_valid) const {
  1514. r_valid = true;
  1515. switch (type) {
  1516. case INT: {
  1517. return r_iter;
  1518. } break;
  1519. case FLOAT: {
  1520. return r_iter;
  1521. } break;
  1522. case VECTOR2: {
  1523. return r_iter;
  1524. } break;
  1525. case VECTOR2I: {
  1526. return r_iter;
  1527. } break;
  1528. case VECTOR3: {
  1529. return r_iter;
  1530. } break;
  1531. case VECTOR3I: {
  1532. return r_iter;
  1533. } break;
  1534. case OBJECT: {
  1535. if (!_get_obj().obj) {
  1536. r_valid = false;
  1537. return Variant();
  1538. }
  1539. #ifdef DEBUG_ENABLED
  1540. if (EngineDebugger::is_active() && !_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
  1541. r_valid = false;
  1542. return Variant();
  1543. }
  1544. #endif
  1545. Callable::CallError ce;
  1546. ce.error = Callable::CallError::CALL_OK;
  1547. const Variant *refp[] = { &r_iter };
  1548. Variant ret = _get_obj().obj->callp(CoreStringNames::get_singleton()->_iter_get, refp, 1, ce);
  1549. if (ce.error != Callable::CallError::CALL_OK) {
  1550. r_valid = false;
  1551. return Variant();
  1552. }
  1553. //r_iter=ref[0];
  1554. return ret;
  1555. } break;
  1556. case STRING: {
  1557. const String *str = reinterpret_cast<const String *>(_data._mem);
  1558. return str->substr(r_iter, 1);
  1559. } break;
  1560. case DICTIONARY: {
  1561. return r_iter; //iterator is the same as the key
  1562. } break;
  1563. case ARRAY: {
  1564. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1565. int idx = r_iter;
  1566. #ifdef DEBUG_ENABLED
  1567. if (idx < 0 || idx >= arr->size()) {
  1568. r_valid = false;
  1569. return Variant();
  1570. }
  1571. #endif
  1572. return arr->get(idx);
  1573. } break;
  1574. case PACKED_BYTE_ARRAY: {
  1575. const Vector<uint8_t> *arr = &PackedArrayRef<uint8_t>::get_array(_data.packed_array);
  1576. int idx = r_iter;
  1577. #ifdef DEBUG_ENABLED
  1578. if (idx < 0 || idx >= arr->size()) {
  1579. r_valid = false;
  1580. return Variant();
  1581. }
  1582. #endif
  1583. return arr->get(idx);
  1584. } break;
  1585. case PACKED_INT32_ARRAY: {
  1586. const Vector<int32_t> *arr = &PackedArrayRef<int32_t>::get_array(_data.packed_array);
  1587. int32_t idx = r_iter;
  1588. #ifdef DEBUG_ENABLED
  1589. if (idx < 0 || idx >= arr->size()) {
  1590. r_valid = false;
  1591. return Variant();
  1592. }
  1593. #endif
  1594. return arr->get(idx);
  1595. } break;
  1596. case PACKED_INT64_ARRAY: {
  1597. const Vector<int64_t> *arr = &PackedArrayRef<int64_t>::get_array(_data.packed_array);
  1598. int64_t idx = r_iter;
  1599. #ifdef DEBUG_ENABLED
  1600. if (idx < 0 || idx >= arr->size()) {
  1601. r_valid = false;
  1602. return Variant();
  1603. }
  1604. #endif
  1605. return arr->get(idx);
  1606. } break;
  1607. case PACKED_FLOAT32_ARRAY: {
  1608. const Vector<float> *arr = &PackedArrayRef<float>::get_array(_data.packed_array);
  1609. int idx = r_iter;
  1610. #ifdef DEBUG_ENABLED
  1611. if (idx < 0 || idx >= arr->size()) {
  1612. r_valid = false;
  1613. return Variant();
  1614. }
  1615. #endif
  1616. return arr->get(idx);
  1617. } break;
  1618. case PACKED_FLOAT64_ARRAY: {
  1619. const Vector<double> *arr = &PackedArrayRef<double>::get_array(_data.packed_array);
  1620. int idx = r_iter;
  1621. #ifdef DEBUG_ENABLED
  1622. if (idx < 0 || idx >= arr->size()) {
  1623. r_valid = false;
  1624. return Variant();
  1625. }
  1626. #endif
  1627. return arr->get(idx);
  1628. } break;
  1629. case PACKED_STRING_ARRAY: {
  1630. const Vector<String> *arr = &PackedArrayRef<String>::get_array(_data.packed_array);
  1631. int idx = r_iter;
  1632. #ifdef DEBUG_ENABLED
  1633. if (idx < 0 || idx >= arr->size()) {
  1634. r_valid = false;
  1635. return Variant();
  1636. }
  1637. #endif
  1638. return arr->get(idx);
  1639. } break;
  1640. case PACKED_VECTOR2_ARRAY: {
  1641. const Vector<Vector2> *arr = &PackedArrayRef<Vector2>::get_array(_data.packed_array);
  1642. int idx = r_iter;
  1643. #ifdef DEBUG_ENABLED
  1644. if (idx < 0 || idx >= arr->size()) {
  1645. r_valid = false;
  1646. return Variant();
  1647. }
  1648. #endif
  1649. return arr->get(idx);
  1650. } break;
  1651. case PACKED_VECTOR3_ARRAY: {
  1652. const Vector<Vector3> *arr = &PackedArrayRef<Vector3>::get_array(_data.packed_array);
  1653. int idx = r_iter;
  1654. #ifdef DEBUG_ENABLED
  1655. if (idx < 0 || idx >= arr->size()) {
  1656. r_valid = false;
  1657. return Variant();
  1658. }
  1659. #endif
  1660. return arr->get(idx);
  1661. } break;
  1662. case PACKED_COLOR_ARRAY: {
  1663. const Vector<Color> *arr = &PackedArrayRef<Color>::get_array(_data.packed_array);
  1664. int idx = r_iter;
  1665. #ifdef DEBUG_ENABLED
  1666. if (idx < 0 || idx >= arr->size()) {
  1667. r_valid = false;
  1668. return Variant();
  1669. }
  1670. #endif
  1671. return arr->get(idx);
  1672. } break;
  1673. default: {
  1674. }
  1675. }
  1676. r_valid = false;
  1677. return Variant();
  1678. }
  1679. Variant Variant::duplicate(bool p_deep) const {
  1680. return recursive_duplicate(p_deep, 0);
  1681. }
  1682. Variant Variant::recursive_duplicate(bool p_deep, int recursion_count) const {
  1683. switch (type) {
  1684. case OBJECT: {
  1685. /* breaks stuff :(
  1686. if (p_deep && !_get_obj().ref.is_null()) {
  1687. Ref<Resource> resource = _get_obj().ref;
  1688. if (resource.is_valid()) {
  1689. return resource->duplicate(true);
  1690. }
  1691. }
  1692. */
  1693. return *this;
  1694. } break;
  1695. case DICTIONARY:
  1696. return operator Dictionary().recursive_duplicate(p_deep, recursion_count);
  1697. case ARRAY:
  1698. return operator Array().recursive_duplicate(p_deep, recursion_count);
  1699. case PACKED_BYTE_ARRAY:
  1700. return operator Vector<uint8_t>().duplicate();
  1701. case PACKED_INT32_ARRAY:
  1702. return operator Vector<int32_t>().duplicate();
  1703. case PACKED_INT64_ARRAY:
  1704. return operator Vector<int64_t>().duplicate();
  1705. case PACKED_FLOAT32_ARRAY:
  1706. return operator Vector<float>().duplicate();
  1707. case PACKED_FLOAT64_ARRAY:
  1708. return operator Vector<double>().duplicate();
  1709. case PACKED_STRING_ARRAY:
  1710. return operator Vector<String>().duplicate();
  1711. case PACKED_VECTOR2_ARRAY:
  1712. return operator Vector<Vector2>().duplicate();
  1713. case PACKED_VECTOR3_ARRAY:
  1714. return operator Vector<Vector3>().duplicate();
  1715. case PACKED_COLOR_ARRAY:
  1716. return operator Vector<Color>().duplicate();
  1717. default:
  1718. return *this;
  1719. }
  1720. }
  1721. void Variant::sub(const Variant &a, const Variant &b, Variant &r_dst) {
  1722. if (a.type != b.type) {
  1723. return;
  1724. }
  1725. switch (a.type) {
  1726. case NIL: {
  1727. r_dst = Variant();
  1728. }
  1729. return;
  1730. case INT: {
  1731. int64_t va = a._data._int;
  1732. int64_t vb = b._data._int;
  1733. r_dst = int(va - vb);
  1734. }
  1735. return;
  1736. case FLOAT: {
  1737. double ra = a._data._float;
  1738. double rb = b._data._float;
  1739. r_dst = ra - rb;
  1740. }
  1741. return;
  1742. case VECTOR2: {
  1743. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) - *reinterpret_cast<const Vector2 *>(b._data._mem);
  1744. }
  1745. return;
  1746. case VECTOR2I: {
  1747. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1748. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1749. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1750. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1751. r_dst = Vector2i(int32_t(vax - vbx), int32_t(vay - vby));
  1752. }
  1753. return;
  1754. case RECT2: {
  1755. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1756. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1757. r_dst = Rect2(ra->position - rb->position, ra->size - rb->size);
  1758. }
  1759. return;
  1760. case RECT2I: {
  1761. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1762. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1763. int32_t vax = ra->position.x;
  1764. int32_t vay = ra->position.y;
  1765. int32_t vbx = ra->size.x;
  1766. int32_t vby = ra->size.y;
  1767. int32_t vcx = rb->position.x;
  1768. int32_t vcy = rb->position.y;
  1769. int32_t vdx = rb->size.x;
  1770. int32_t vdy = rb->size.y;
  1771. r_dst = Rect2i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vcx - vdx), int32_t(vcy - vdy));
  1772. }
  1773. return;
  1774. case VECTOR3: {
  1775. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) - *reinterpret_cast<const Vector3 *>(b._data._mem);
  1776. }
  1777. return;
  1778. case VECTOR3I: {
  1779. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1780. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1781. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1782. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1783. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1784. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1785. r_dst = Vector3i(int32_t(vax - vbx), int32_t(vay - vby), int32_t(vaz - vbz));
  1786. }
  1787. return;
  1788. case AABB: {
  1789. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1790. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1791. r_dst = ::AABB(ra->position - rb->position, ra->size - rb->size);
  1792. }
  1793. return;
  1794. case QUATERNION: {
  1795. Quaternion empty_rot;
  1796. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1797. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1798. r_dst = (*qb).inverse() * *qa;
  1799. }
  1800. return;
  1801. case COLOR: {
  1802. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1803. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1804. float new_r = ca->r - cb->r;
  1805. float new_g = ca->g - cb->g;
  1806. float new_b = ca->b - cb->b;
  1807. float new_a = ca->a - cb->a;
  1808. new_r = new_r > 1.0 ? 1.0 : new_r;
  1809. new_g = new_g > 1.0 ? 1.0 : new_g;
  1810. new_b = new_b > 1.0 ? 1.0 : new_b;
  1811. new_a = new_a > 1.0 ? 1.0 : new_a;
  1812. r_dst = Color(new_r, new_g, new_b, new_a);
  1813. }
  1814. return;
  1815. default: {
  1816. r_dst = a;
  1817. }
  1818. return;
  1819. }
  1820. }
  1821. void Variant::blend(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1822. if (a.type != b.type) {
  1823. if (a.is_num() && b.is_num()) {
  1824. real_t va = a;
  1825. real_t vb = b;
  1826. r_dst = va + vb * c;
  1827. } else {
  1828. r_dst = a;
  1829. }
  1830. return;
  1831. }
  1832. switch (a.type) {
  1833. case NIL: {
  1834. r_dst = Variant();
  1835. }
  1836. return;
  1837. case INT: {
  1838. int64_t va = a._data._int;
  1839. int64_t vb = b._data._int;
  1840. r_dst = int(va + vb * c + 0.5);
  1841. }
  1842. return;
  1843. case FLOAT: {
  1844. double ra = a._data._float;
  1845. double rb = b._data._float;
  1846. r_dst = ra + rb * c;
  1847. }
  1848. return;
  1849. case VECTOR2: {
  1850. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) + *reinterpret_cast<const Vector2 *>(b._data._mem) * c;
  1851. }
  1852. return;
  1853. case VECTOR2I: {
  1854. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  1855. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  1856. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  1857. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  1858. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  1859. }
  1860. return;
  1861. case RECT2: {
  1862. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  1863. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  1864. r_dst = Rect2(ra->position + rb->position * c, ra->size + rb->size * c);
  1865. }
  1866. return;
  1867. case RECT2I: {
  1868. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  1869. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  1870. int32_t vax = ra->position.x;
  1871. int32_t vay = ra->position.y;
  1872. int32_t vbx = ra->size.x;
  1873. int32_t vby = ra->size.y;
  1874. int32_t vcx = rb->position.x;
  1875. int32_t vcy = rb->position.y;
  1876. int32_t vdx = rb->size.x;
  1877. int32_t vdy = rb->size.y;
  1878. 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));
  1879. }
  1880. return;
  1881. case VECTOR3: {
  1882. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) + *reinterpret_cast<const Vector3 *>(b._data._mem) * c;
  1883. }
  1884. return;
  1885. case VECTOR3I: {
  1886. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  1887. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  1888. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  1889. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  1890. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  1891. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  1892. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  1893. }
  1894. return;
  1895. case AABB: {
  1896. const ::AABB *ra = reinterpret_cast<const ::AABB *>(a._data._mem);
  1897. const ::AABB *rb = reinterpret_cast<const ::AABB *>(b._data._mem);
  1898. r_dst = ::AABB(ra->position + rb->position * c, ra->size + rb->size * c);
  1899. }
  1900. return;
  1901. case QUATERNION: {
  1902. Quaternion empty_rot;
  1903. const Quaternion *qa = reinterpret_cast<const Quaternion *>(a._data._mem);
  1904. const Quaternion *qb = reinterpret_cast<const Quaternion *>(b._data._mem);
  1905. r_dst = *qa * empty_rot.slerp(*qb, c);
  1906. }
  1907. return;
  1908. case COLOR: {
  1909. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  1910. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  1911. float new_r = ca->r + cb->r * c;
  1912. float new_g = ca->g + cb->g * c;
  1913. float new_b = ca->b + cb->b * c;
  1914. float new_a = ca->a + cb->a * c;
  1915. new_r = new_r > 1.0 ? 1.0 : new_r;
  1916. new_g = new_g > 1.0 ? 1.0 : new_g;
  1917. new_b = new_b > 1.0 ? 1.0 : new_b;
  1918. new_a = new_a > 1.0 ? 1.0 : new_a;
  1919. r_dst = Color(new_r, new_g, new_b, new_a);
  1920. }
  1921. return;
  1922. default: {
  1923. r_dst = c < 0.5 ? a : b;
  1924. }
  1925. return;
  1926. }
  1927. }
  1928. void Variant::interpolate(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  1929. if (a.type != b.type) {
  1930. if (a.is_num() && b.is_num()) {
  1931. //not as efficient but..
  1932. real_t va = a;
  1933. real_t vb = b;
  1934. r_dst = va + (vb - va) * c;
  1935. } else {
  1936. r_dst = a;
  1937. }
  1938. return;
  1939. }
  1940. switch (a.type) {
  1941. case NIL: {
  1942. r_dst = Variant();
  1943. }
  1944. return;
  1945. case BOOL: {
  1946. r_dst = a;
  1947. }
  1948. return;
  1949. case INT: {
  1950. int64_t va = a._data._int;
  1951. int64_t vb = b._data._int;
  1952. r_dst = int(va + (vb - va) * c);
  1953. }
  1954. return;
  1955. case FLOAT: {
  1956. real_t va = a._data._float;
  1957. real_t vb = b._data._float;
  1958. r_dst = va + (vb - va) * c;
  1959. }
  1960. return;
  1961. case STRING: {
  1962. //this is pretty funny and bizarre, but artists like to use it for typewriter effects
  1963. String sa = *reinterpret_cast<const String *>(a._data._mem);
  1964. String sb = *reinterpret_cast<const String *>(b._data._mem);
  1965. String dst;
  1966. int sa_len = sa.length();
  1967. int sb_len = sb.length();
  1968. int csize = sa_len + (sb_len - sa_len) * c;
  1969. if (csize == 0) {
  1970. r_dst = "";
  1971. return;
  1972. }
  1973. dst.resize(csize + 1);
  1974. dst[csize] = 0;
  1975. int split = csize / 2;
  1976. for (int i = 0; i < csize; i++) {
  1977. char32_t chr = ' ';
  1978. if (i < split) {
  1979. if (i < sa.length()) {
  1980. chr = sa[i];
  1981. } else if (i < sb.length()) {
  1982. chr = sb[i];
  1983. }
  1984. } else {
  1985. if (i < sb.length()) {
  1986. chr = sb[i];
  1987. } else if (i < sa.length()) {
  1988. chr = sa[i];
  1989. }
  1990. }
  1991. dst[i] = chr;
  1992. }
  1993. r_dst = dst;
  1994. }
  1995. return;
  1996. case VECTOR2: {
  1997. r_dst = reinterpret_cast<const Vector2 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector2 *>(b._data._mem), c);
  1998. }
  1999. return;
  2000. case VECTOR2I: {
  2001. int32_t vax = reinterpret_cast<const Vector2i *>(a._data._mem)->x;
  2002. int32_t vbx = reinterpret_cast<const Vector2i *>(b._data._mem)->x;
  2003. int32_t vay = reinterpret_cast<const Vector2i *>(a._data._mem)->y;
  2004. int32_t vby = reinterpret_cast<const Vector2i *>(b._data._mem)->y;
  2005. r_dst = Vector2i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5));
  2006. }
  2007. return;
  2008. case RECT2: {
  2009. 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));
  2010. }
  2011. return;
  2012. case RECT2I: {
  2013. const Rect2i *ra = reinterpret_cast<const Rect2i *>(a._data._mem);
  2014. const Rect2i *rb = reinterpret_cast<const Rect2i *>(b._data._mem);
  2015. int32_t vax = ra->position.x;
  2016. int32_t vay = ra->position.y;
  2017. int32_t vbx = ra->size.x;
  2018. int32_t vby = ra->size.y;
  2019. int32_t vcx = rb->position.x;
  2020. int32_t vcy = rb->position.y;
  2021. int32_t vdx = rb->size.x;
  2022. int32_t vdy = rb->size.y;
  2023. 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));
  2024. }
  2025. return;
  2026. case VECTOR3: {
  2027. r_dst = reinterpret_cast<const Vector3 *>(a._data._mem)->lerp(*reinterpret_cast<const Vector3 *>(b._data._mem), c);
  2028. }
  2029. return;
  2030. case VECTOR3I: {
  2031. int32_t vax = reinterpret_cast<const Vector3i *>(a._data._mem)->x;
  2032. int32_t vbx = reinterpret_cast<const Vector3i *>(b._data._mem)->x;
  2033. int32_t vay = reinterpret_cast<const Vector3i *>(a._data._mem)->y;
  2034. int32_t vby = reinterpret_cast<const Vector3i *>(b._data._mem)->y;
  2035. int32_t vaz = reinterpret_cast<const Vector3i *>(a._data._mem)->z;
  2036. int32_t vbz = reinterpret_cast<const Vector3i *>(b._data._mem)->z;
  2037. r_dst = Vector3i(int32_t(vax + vbx * c + 0.5), int32_t(vay + vby * c + 0.5), int32_t(vaz + vbz * c + 0.5));
  2038. }
  2039. return;
  2040. case TRANSFORM2D: {
  2041. r_dst = a._data._transform2d->interpolate_with(*b._data._transform2d, c);
  2042. }
  2043. return;
  2044. case PLANE: {
  2045. r_dst = a;
  2046. }
  2047. return;
  2048. case QUATERNION: {
  2049. r_dst = reinterpret_cast<const Quaternion *>(a._data._mem)->slerp(*reinterpret_cast<const Quaternion *>(b._data._mem), c);
  2050. }
  2051. return;
  2052. case AABB: {
  2053. r_dst = ::AABB(a._data._aabb->position.lerp(b._data._aabb->position, c), a._data._aabb->size.lerp(b._data._aabb->size, c));
  2054. }
  2055. return;
  2056. case BASIS: {
  2057. r_dst = a._data._basis->lerp(*b._data._basis, c);
  2058. }
  2059. return;
  2060. case TRANSFORM3D: {
  2061. r_dst = a._data._transform3d->interpolate_with(*b._data._transform3d, c);
  2062. }
  2063. return;
  2064. case COLOR: {
  2065. r_dst = reinterpret_cast<const Color *>(a._data._mem)->lerp(*reinterpret_cast<const Color *>(b._data._mem), c);
  2066. }
  2067. return;
  2068. case STRING_NAME: {
  2069. r_dst = a;
  2070. }
  2071. return;
  2072. case NODE_PATH: {
  2073. r_dst = a;
  2074. }
  2075. return;
  2076. case RID: {
  2077. r_dst = a;
  2078. }
  2079. return;
  2080. case OBJECT: {
  2081. r_dst = a;
  2082. }
  2083. return;
  2084. case DICTIONARY: {
  2085. }
  2086. return;
  2087. case ARRAY: {
  2088. r_dst = a;
  2089. }
  2090. return;
  2091. case PACKED_BYTE_ARRAY: {
  2092. r_dst = a;
  2093. }
  2094. return;
  2095. case PACKED_INT32_ARRAY: {
  2096. const Vector<int32_t> *arr_a = &PackedArrayRef<int32_t>::get_array(a._data.packed_array);
  2097. const Vector<int32_t> *arr_b = &PackedArrayRef<int32_t>::get_array(b._data.packed_array);
  2098. int32_t sz = arr_a->size();
  2099. if (sz == 0 || arr_b->size() != sz) {
  2100. r_dst = a;
  2101. } else {
  2102. Vector<int32_t> v;
  2103. v.resize(sz);
  2104. {
  2105. int32_t *vw = v.ptrw();
  2106. const int32_t *ar = arr_a->ptr();
  2107. const int32_t *br = arr_b->ptr();
  2108. Variant va;
  2109. for (int32_t i = 0; i < sz; i++) {
  2110. Variant::interpolate(ar[i], br[i], c, va);
  2111. vw[i] = va;
  2112. }
  2113. }
  2114. r_dst = v;
  2115. }
  2116. }
  2117. return;
  2118. case PACKED_INT64_ARRAY: {
  2119. const Vector<int64_t> *arr_a = &PackedArrayRef<int64_t>::get_array(a._data.packed_array);
  2120. const Vector<int64_t> *arr_b = &PackedArrayRef<int64_t>::get_array(b._data.packed_array);
  2121. int64_t sz = arr_a->size();
  2122. if (sz == 0 || arr_b->size() != sz) {
  2123. r_dst = a;
  2124. } else {
  2125. Vector<int64_t> v;
  2126. v.resize(sz);
  2127. {
  2128. int64_t *vw = v.ptrw();
  2129. const int64_t *ar = arr_a->ptr();
  2130. const int64_t *br = arr_b->ptr();
  2131. Variant va;
  2132. for (int64_t i = 0; i < sz; i++) {
  2133. Variant::interpolate(ar[i], br[i], c, va);
  2134. vw[i] = va;
  2135. }
  2136. }
  2137. r_dst = v;
  2138. }
  2139. }
  2140. return;
  2141. case PACKED_FLOAT32_ARRAY: {
  2142. const Vector<float> *arr_a = &PackedArrayRef<float>::get_array(a._data.packed_array);
  2143. const Vector<float> *arr_b = &PackedArrayRef<float>::get_array(b._data.packed_array);
  2144. int sz = arr_a->size();
  2145. if (sz == 0 || arr_b->size() != sz) {
  2146. r_dst = a;
  2147. } else {
  2148. Vector<float> v;
  2149. v.resize(sz);
  2150. {
  2151. float *vw = v.ptrw();
  2152. const float *ar = arr_a->ptr();
  2153. const float *br = arr_b->ptr();
  2154. Variant va;
  2155. for (int i = 0; i < sz; i++) {
  2156. Variant::interpolate(ar[i], br[i], c, va);
  2157. vw[i] = va;
  2158. }
  2159. }
  2160. r_dst = v;
  2161. }
  2162. }
  2163. return;
  2164. case PACKED_FLOAT64_ARRAY: {
  2165. const Vector<double> *arr_a = &PackedArrayRef<double>::get_array(a._data.packed_array);
  2166. const Vector<double> *arr_b = &PackedArrayRef<double>::get_array(b._data.packed_array);
  2167. int sz = arr_a->size();
  2168. if (sz == 0 || arr_b->size() != sz) {
  2169. r_dst = a;
  2170. } else {
  2171. Vector<double> v;
  2172. v.resize(sz);
  2173. {
  2174. double *vw = v.ptrw();
  2175. const double *ar = arr_a->ptr();
  2176. const double *br = arr_b->ptr();
  2177. Variant va;
  2178. for (int i = 0; i < sz; i++) {
  2179. Variant::interpolate(ar[i], br[i], c, va);
  2180. vw[i] = va;
  2181. }
  2182. }
  2183. r_dst = v;
  2184. }
  2185. }
  2186. return;
  2187. case PACKED_STRING_ARRAY: {
  2188. r_dst = a;
  2189. }
  2190. return;
  2191. case PACKED_VECTOR2_ARRAY: {
  2192. const Vector<Vector2> *arr_a = &PackedArrayRef<Vector2>::get_array(a._data.packed_array);
  2193. const Vector<Vector2> *arr_b = &PackedArrayRef<Vector2>::get_array(b._data.packed_array);
  2194. int sz = arr_a->size();
  2195. if (sz == 0 || arr_b->size() != sz) {
  2196. r_dst = a;
  2197. } else {
  2198. Vector<Vector2> v;
  2199. v.resize(sz);
  2200. {
  2201. Vector2 *vw = v.ptrw();
  2202. const Vector2 *ar = arr_a->ptr();
  2203. const Vector2 *br = arr_b->ptr();
  2204. for (int i = 0; i < sz; i++) {
  2205. vw[i] = ar[i].lerp(br[i], c);
  2206. }
  2207. }
  2208. r_dst = v;
  2209. }
  2210. }
  2211. return;
  2212. case PACKED_VECTOR3_ARRAY: {
  2213. const Vector<Vector3> *arr_a = &PackedArrayRef<Vector3>::get_array(a._data.packed_array);
  2214. const Vector<Vector3> *arr_b = &PackedArrayRef<Vector3>::get_array(b._data.packed_array);
  2215. int sz = arr_a->size();
  2216. if (sz == 0 || arr_b->size() != sz) {
  2217. r_dst = a;
  2218. } else {
  2219. Vector<Vector3> v;
  2220. v.resize(sz);
  2221. {
  2222. Vector3 *vw = v.ptrw();
  2223. const Vector3 *ar = arr_a->ptr();
  2224. const Vector3 *br = arr_b->ptr();
  2225. for (int i = 0; i < sz; i++) {
  2226. vw[i] = ar[i].lerp(br[i], c);
  2227. }
  2228. }
  2229. r_dst = v;
  2230. }
  2231. }
  2232. return;
  2233. case PACKED_COLOR_ARRAY: {
  2234. const Vector<Color> *arr_a = &PackedArrayRef<Color>::get_array(a._data.packed_array);
  2235. const Vector<Color> *arr_b = &PackedArrayRef<Color>::get_array(b._data.packed_array);
  2236. int sz = arr_a->size();
  2237. if (sz == 0 || arr_b->size() != sz) {
  2238. r_dst = a;
  2239. } else {
  2240. Vector<Color> v;
  2241. v.resize(sz);
  2242. {
  2243. Color *vw = v.ptrw();
  2244. const Color *ar = arr_a->ptr();
  2245. const Color *br = arr_b->ptr();
  2246. for (int i = 0; i < sz; i++) {
  2247. vw[i] = ar[i].lerp(br[i], c);
  2248. }
  2249. }
  2250. r_dst = v;
  2251. }
  2252. }
  2253. return;
  2254. default: {
  2255. r_dst = a;
  2256. }
  2257. }
  2258. }
  2259. void Variant::_register_variant_setters_getters() {
  2260. register_named_setters_getters();
  2261. register_indexed_setters_getters();
  2262. register_keyed_setters_getters();
  2263. }
  2264. void Variant::_unregister_variant_setters_getters() {
  2265. unregister_named_setters_getters();
  2266. unregister_indexed_setters_getters();
  2267. }