variant_setget.cpp 94 KB

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