variant_op.cpp 98 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299
  1. /*************************************************************************/
  2. /* variant_op.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2017 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2017 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.h"
  31. #include "core_string_names.h"
  32. #include "object.h"
  33. #include "script_language.h"
  34. #define CASE_TYPE_ALL(PREFIX, OP) \
  35. CASE_TYPE(PREFIX, OP, INT) \
  36. CASE_TYPE_ALL_BUT_INT(PREFIX, OP)
  37. #define CASE_TYPE_ALL_BUT_INT(PREFIX, OP) \
  38. CASE_TYPE(PREFIX, OP, NIL) \
  39. CASE_TYPE(PREFIX, OP, BOOL) \
  40. CASE_TYPE(PREFIX, OP, REAL) \
  41. CASE_TYPE(PREFIX, OP, STRING) \
  42. CASE_TYPE(PREFIX, OP, VECTOR2) \
  43. CASE_TYPE(PREFIX, OP, RECT2) \
  44. CASE_TYPE(PREFIX, OP, VECTOR3) \
  45. CASE_TYPE(PREFIX, OP, TRANSFORM2D) \
  46. CASE_TYPE(PREFIX, OP, PLANE) \
  47. CASE_TYPE(PREFIX, OP, QUAT) \
  48. CASE_TYPE(PREFIX, OP, RECT3) \
  49. CASE_TYPE(PREFIX, OP, BASIS) \
  50. CASE_TYPE(PREFIX, OP, TRANSFORM) \
  51. CASE_TYPE(PREFIX, OP, COLOR) \
  52. CASE_TYPE(PREFIX, OP, NODE_PATH) \
  53. CASE_TYPE(PREFIX, OP, _RID) \
  54. CASE_TYPE(PREFIX, OP, OBJECT) \
  55. CASE_TYPE(PREFIX, OP, DICTIONARY) \
  56. CASE_TYPE(PREFIX, OP, ARRAY) \
  57. CASE_TYPE(PREFIX, OP, POOL_BYTE_ARRAY) \
  58. CASE_TYPE(PREFIX, OP, POOL_INT_ARRAY) \
  59. CASE_TYPE(PREFIX, OP, POOL_REAL_ARRAY) \
  60. CASE_TYPE(PREFIX, OP, POOL_STRING_ARRAY) \
  61. CASE_TYPE(PREFIX, OP, POOL_VECTOR2_ARRAY) \
  62. CASE_TYPE(PREFIX, OP, POOL_VECTOR3_ARRAY) \
  63. CASE_TYPE(PREFIX, OP, POOL_COLOR_ARRAY)
  64. #ifdef __GNUC__
  65. #define TYPE(PREFIX, OP, TYPE) &&PREFIX##_##OP##_##TYPE
  66. /* clang-format off */
  67. #define TYPES(PREFIX, OP) { \
  68. TYPE(PREFIX, OP, NIL), \
  69. TYPE(PREFIX, OP, BOOL), \
  70. TYPE(PREFIX, OP, INT), \
  71. TYPE(PREFIX, OP, REAL), \
  72. TYPE(PREFIX, OP, STRING), \
  73. TYPE(PREFIX, OP, VECTOR2), \
  74. TYPE(PREFIX, OP, RECT2), \
  75. TYPE(PREFIX, OP, VECTOR3), \
  76. TYPE(PREFIX, OP, TRANSFORM2D), \
  77. TYPE(PREFIX, OP, PLANE), \
  78. TYPE(PREFIX, OP, QUAT), \
  79. TYPE(PREFIX, OP, RECT3), \
  80. TYPE(PREFIX, OP, BASIS), \
  81. TYPE(PREFIX, OP, TRANSFORM), \
  82. TYPE(PREFIX, OP, COLOR), \
  83. TYPE(PREFIX, OP, NODE_PATH), \
  84. TYPE(PREFIX, OP, _RID), \
  85. TYPE(PREFIX, OP, OBJECT), \
  86. TYPE(PREFIX, OP, DICTIONARY), \
  87. TYPE(PREFIX, OP, ARRAY), \
  88. TYPE(PREFIX, OP, POOL_BYTE_ARRAY), \
  89. TYPE(PREFIX, OP, POOL_INT_ARRAY), \
  90. TYPE(PREFIX, OP, POOL_REAL_ARRAY), \
  91. TYPE(PREFIX, OP, POOL_STRING_ARRAY), \
  92. TYPE(PREFIX, OP, POOL_VECTOR2_ARRAY), \
  93. TYPE(PREFIX, OP, POOL_VECTOR3_ARRAY), \
  94. TYPE(PREFIX, OP, POOL_COLOR_ARRAY), \
  95. }
  96. /* clang-format on */
  97. #define CASES(PREFIX) static void *switch_table_##PREFIX[25][27] = { \
  98. TYPES(PREFIX, OP_EQUAL), \
  99. TYPES(PREFIX, OP_NOT_EQUAL), \
  100. TYPES(PREFIX, OP_LESS), \
  101. TYPES(PREFIX, OP_LESS_EQUAL), \
  102. TYPES(PREFIX, OP_GREATER), \
  103. TYPES(PREFIX, OP_GREATER_EQUAL), \
  104. TYPES(PREFIX, OP_ADD), \
  105. TYPES(PREFIX, OP_SUBTRACT), \
  106. TYPES(PREFIX, OP_MULTIPLY), \
  107. TYPES(PREFIX, OP_DIVIDE), \
  108. TYPES(PREFIX, OP_NEGATE), \
  109. TYPES(PREFIX, OP_POSITIVE), \
  110. TYPES(PREFIX, OP_MODULE), \
  111. TYPES(PREFIX, OP_STRING_CONCAT), \
  112. TYPES(PREFIX, OP_SHIFT_LEFT), \
  113. TYPES(PREFIX, OP_SHIFT_RIGHT), \
  114. TYPES(PREFIX, OP_BIT_AND), \
  115. TYPES(PREFIX, OP_BIT_OR), \
  116. TYPES(PREFIX, OP_BIT_XOR), \
  117. TYPES(PREFIX, OP_BIT_NEGATE), \
  118. TYPES(PREFIX, OP_AND), \
  119. TYPES(PREFIX, OP_OR), \
  120. TYPES(PREFIX, OP_XOR), \
  121. TYPES(PREFIX, OP_NOT), \
  122. TYPES(PREFIX, OP_IN), \
  123. }
  124. #define SWITCH(PREFIX, op, val) goto *switch_table_##PREFIX[op][val];
  125. #define SWITCH_OP(PREFIX, OP, val)
  126. #define CASE_TYPE(PREFIX, OP, TYPE) PREFIX##_##OP##_##TYPE:
  127. #else
  128. #define CASES(PREFIX)
  129. #define SWITCH(PREFIX, op, val) switch (op)
  130. #define SWITCH_OP(PREFIX, OP, val) \
  131. case OP: \
  132. switch (val)
  133. #define CASE_TYPE(PREFIX, OP, TYPE) case TYPE:
  134. #endif
  135. Variant::operator bool() const {
  136. return booleanize();
  137. }
  138. // We consider all unitialized or empty types to be false based on the type's
  139. // zeroiness.
  140. bool Variant::booleanize() const {
  141. return !is_zero();
  142. }
  143. #define _RETURN(m_what) \
  144. { \
  145. r_ret = m_what; \
  146. return; \
  147. }
  148. #define _RETURN_FAIL \
  149. { \
  150. r_valid = false; \
  151. return; \
  152. }
  153. #define DEFAULT_OP_NUM(m_prefix, m_op_name, m_name, m_op, m_type) \
  154. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  155. if (p_b.type == INT) _RETURN(p_a._data.m_type m_op p_b._data._int); \
  156. if (p_b.type == REAL) _RETURN(p_a._data.m_type m_op p_b._data._real); \
  157. \
  158. _RETURN_FAIL \
  159. };
  160. #define DEFAULT_OP_NUM_NULL(m_prefix, m_op_name, m_name, m_op, m_type) \
  161. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  162. if (p_b.type == INT) _RETURN(p_a._data.m_type m_op p_b._data._int); \
  163. if (p_b.type == REAL) _RETURN(p_a._data.m_type m_op p_b._data._real); \
  164. if (p_b.type == NIL) _RETURN(!p_b.type m_op NIL); \
  165. \
  166. _RETURN_FAIL \
  167. };
  168. #ifdef DEBUG_ENABLED
  169. #define DEFAULT_OP_NUM_DIV(m_prefix, m_op_name, m_name, m_type) \
  170. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  171. if (p_b.type == INT) { \
  172. if (p_b._data._int == 0) { \
  173. r_valid = false; \
  174. _RETURN("Division By Zero"); \
  175. } \
  176. _RETURN(p_a._data.m_type / p_b._data._int); \
  177. } \
  178. if (p_b.type == REAL) { \
  179. if (p_b._data._real == 0) { \
  180. r_valid = false; \
  181. _RETURN("Division By Zero"); \
  182. } \
  183. _RETURN(p_a._data.m_type / p_b._data._real); \
  184. } \
  185. \
  186. _RETURN_FAIL \
  187. };
  188. #else
  189. #define DEFAULT_OP_NUM_DIV(m_prefix, m_op_name, m_name, m_type) \
  190. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  191. if (p_b.type == INT) _RETURN(p_a._data.m_type / p_b._data._int); \
  192. if (p_b.type == REAL) _RETURN(p_a._data.m_type / p_b._data._real); \
  193. \
  194. _RETURN_FAIL \
  195. };
  196. #endif
  197. #define DEFAULT_OP_NUM_NEG(m_prefix, m_op_name, m_name, m_type) \
  198. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  199. _RETURN(-p_a._data.m_type); \
  200. };
  201. #define DEFAULT_OP_NUM_POS(m_prefix, m_op_name, m_name, m_type) \
  202. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  203. _RETURN(p_a._data.m_type); \
  204. };
  205. #define DEFAULT_OP_NUM_VEC(m_prefix, m_op_name, m_name, m_op, m_type) \
  206. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  207. if (p_b.type == INT) _RETURN(p_a._data.m_type m_op p_b._data._int); \
  208. if (p_b.type == REAL) _RETURN(p_a._data.m_type m_op p_b._data._real); \
  209. if (p_b.type == VECTOR2) _RETURN(p_a._data.m_type m_op *reinterpret_cast<const Vector2 *>(p_b._data._mem)); \
  210. if (p_b.type == VECTOR3) _RETURN(p_a._data.m_type m_op *reinterpret_cast<const Vector3 *>(p_b._data._mem)); \
  211. \
  212. _RETURN_FAIL \
  213. };
  214. #define DEFAULT_OP_STR_REV(m_prefix, m_op_name, m_name, m_op, m_type) \
  215. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  216. if (p_b.type == STRING) _RETURN(*reinterpret_cast<const m_type *>(p_b._data._mem) m_op *reinterpret_cast<const String *>(p_a._data._mem)); \
  217. if (p_b.type == NODE_PATH) _RETURN(*reinterpret_cast<const m_type *>(p_b._data._mem) m_op *reinterpret_cast<const NodePath *>(p_a._data._mem)); \
  218. \
  219. _RETURN_FAIL \
  220. };
  221. #define DEFAULT_OP_STR(m_prefix, m_op_name, m_name, m_op, m_type) \
  222. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  223. if (p_b.type == STRING) _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op *reinterpret_cast<const String *>(p_b._data._mem)); \
  224. if (p_b.type == NODE_PATH) _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op *reinterpret_cast<const NodePath *>(p_b._data._mem)); \
  225. \
  226. _RETURN_FAIL \
  227. };
  228. #define DEFAULT_OP_STR_NULL(m_prefix, m_op_name, m_name, m_op, m_type) \
  229. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  230. if (p_b.type == STRING) _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op *reinterpret_cast<const String *>(p_b._data._mem)); \
  231. if (p_b.type == NODE_PATH) _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op *reinterpret_cast<const NodePath *>(p_b._data._mem)); \
  232. if (p_b.type == NIL) _RETURN(!p_b.type m_op NIL); \
  233. \
  234. _RETURN_FAIL \
  235. };
  236. #define DEFAULT_OP_LOCALMEM_REV(m_prefix, m_op_name, m_name, m_op, m_type) \
  237. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  238. if (p_b.type == m_name) \
  239. _RETURN(*reinterpret_cast<const m_type *>(p_b._data._mem) m_op *reinterpret_cast<const m_type *>(p_a._data._mem)); \
  240. \
  241. _RETURN_FAIL \
  242. };
  243. #define DEFAULT_OP_LOCALMEM(m_prefix, m_op_name, m_name, m_op, m_type) \
  244. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  245. if (p_b.type == m_name) \
  246. _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op *reinterpret_cast<const m_type *>(p_b._data._mem)); \
  247. \
  248. _RETURN_FAIL \
  249. };
  250. #define DEFAULT_OP_LOCALMEM_NULL(m_prefix, m_op_name, m_name, m_op, m_type) \
  251. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  252. if (p_b.type == m_name) \
  253. _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op *reinterpret_cast<const m_type *>(p_b._data._mem)); \
  254. if (p_b.type == NIL) \
  255. _RETURN(!p_b.type m_op NIL); \
  256. \
  257. _RETURN_FAIL \
  258. };
  259. #define DEFAULT_OP_LOCALMEM_NEG(m_prefix, m_op_name, m_name, m_type) \
  260. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  261. _RETURN(-*reinterpret_cast<const m_type *>(p_a._data._mem)); \
  262. }
  263. #define DEFAULT_OP_LOCALMEM_POS(m_prefix, m_op_name, m_name, m_type) \
  264. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  265. _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem)); \
  266. }
  267. #define DEFAULT_OP_LOCALMEM_NUM(m_prefix, m_op_name, m_name, m_op, m_type) \
  268. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  269. if (p_b.type == m_name) _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op *reinterpret_cast<const m_type *>(p_b._data._mem)); \
  270. if (p_b.type == INT) _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op p_b._data._int); \
  271. if (p_b.type == REAL) _RETURN(*reinterpret_cast<const m_type *>(p_a._data._mem) m_op p_b._data._real); \
  272. \
  273. _RETURN_FAIL \
  274. }
  275. #define DEFAULT_OP_PTR(m_op, m_name, m_sub) \
  276. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  277. if (p_b.type == m_name) \
  278. _RETURN(p_a._data.m_sub m_op p_b._data.m_sub); \
  279. \
  280. _RETURN_FAIL \
  281. }
  282. #define DEFAULT_OP_PTRREF(m_prefix, m_op_name, m_name, m_op, m_sub) \
  283. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  284. if (p_b.type == m_name) \
  285. _RETURN(*p_a._data.m_sub m_op *p_b._data.m_sub); \
  286. \
  287. _RETURN_FAIL \
  288. }
  289. #define DEFAULT_OP_PTRREF_NULL(m_prefix, m_op_name, m_name, m_op, m_sub) \
  290. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  291. if (p_b.type == m_name) \
  292. _RETURN(*p_a._data.m_sub m_op *p_b._data.m_sub); \
  293. if (p_b.type == NIL) \
  294. _RETURN(!p_b.type m_op NIL); \
  295. \
  296. _RETURN_FAIL \
  297. }
  298. #define DEFAULT_OP_ARRAY_EQ(m_prefix, m_op_name, m_name, m_type) \
  299. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  300. if (p_b.type == NIL) \
  301. _RETURN(false) \
  302. DEFAULT_OP_ARRAY_OP_BODY(m_prefix, m_op_name, m_name, m_type, !=, !=, true, false, false) \
  303. }
  304. #define DEFAULT_OP_ARRAY_LT(m_prefix, m_op_name, m_name, m_type) \
  305. DEFAULT_OP_ARRAY_OP(m_prefix, m_op_name, m_name, m_type, <, !=, false, a_len < array_b.size(), true)
  306. #define DEFAULT_OP_ARRAY_GT(m_prefix, m_op_name, m_name, m_type) \
  307. DEFAULT_OP_ARRAY_OP(m_prefix, m_op_name, m_name, m_type, >, !=, false, a_len < array_b.size(), true)
  308. #define DEFAULT_OP_ARRAY_OP(m_prefix, m_op_name, m_name, m_type, m_opa, m_opb, m_ret_def, m_ret_s, m_ret_f) \
  309. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  310. DEFAULT_OP_ARRAY_OP_BODY(m_prefix, m_op_name, m_name, m_type, m_opa, m_opb, m_ret_def, m_ret_s, m_ret_f) \
  311. }
  312. #define DEFAULT_OP_ARRAY_OP_BODY(m_prefix, m_op_name, m_name, m_type, m_opa, m_opb, m_ret_def, m_ret_s, m_ret_f) \
  313. if (p_a.type != p_b.type) \
  314. _RETURN_FAIL \
  315. \
  316. const PoolVector<m_type> &array_a = *reinterpret_cast<const PoolVector<m_type> *>(p_a._data._mem); \
  317. const PoolVector<m_type> &array_b = *reinterpret_cast<const PoolVector<m_type> *>(p_b._data._mem); \
  318. \
  319. int a_len = array_a.size(); \
  320. if (a_len m_opa array_b.size()) { \
  321. _RETURN(m_ret_s); \
  322. } else { \
  323. \
  324. PoolVector<m_type>::Read ra = array_a.read(); \
  325. PoolVector<m_type>::Read rb = array_b.read(); \
  326. \
  327. for (int i = 0; i < a_len; i++) { \
  328. if (ra[i] m_opb rb[i]) \
  329. _RETURN(m_ret_f); \
  330. } \
  331. \
  332. _RETURN(m_ret_def); \
  333. }
  334. #define DEFAULT_OP_ARRAY_ADD(m_prefix, m_op_name, m_name, m_type) \
  335. CASE_TYPE(m_prefix, m_op_name, m_name) { \
  336. if (p_a.type != p_b.type) \
  337. _RETURN_FAIL; \
  338. \
  339. const PoolVector<m_type> &array_a = *reinterpret_cast<const PoolVector<m_type> *>(p_a._data._mem); \
  340. const PoolVector<m_type> &array_b = *reinterpret_cast<const PoolVector<m_type> *>(p_b._data._mem); \
  341. PoolVector<m_type> sum = array_a; \
  342. sum.append_array(array_b); \
  343. _RETURN(sum); \
  344. }
  345. void Variant::evaluate(const Operator &p_op, const Variant &p_a,
  346. const Variant &p_b, Variant &r_ret, bool &r_valid) {
  347. CASES(math);
  348. r_valid = true;
  349. SWITCH(math, p_op, p_a.type) {
  350. SWITCH_OP(math, OP_EQUAL, p_a.type) {
  351. CASE_TYPE(math, OP_EQUAL, NIL) {
  352. if (p_b.type == NIL) _RETURN(true);
  353. if (p_b.type == OBJECT)
  354. _RETURN(p_b._get_obj().obj == NULL);
  355. _RETURN(false);
  356. }
  357. CASE_TYPE(math, OP_EQUAL, BOOL) {
  358. if (p_b.type != BOOL) {
  359. if (p_b.type == NIL)
  360. _RETURN(false);
  361. _RETURN_FAIL;
  362. }
  363. _RETURN(p_a._data._bool == p_b._data._bool);
  364. }
  365. CASE_TYPE(math, OP_EQUAL, OBJECT) {
  366. if (p_b.type == OBJECT)
  367. _RETURN((p_a._get_obj().obj == p_b._get_obj().obj));
  368. if (p_b.type == NIL)
  369. _RETURN(p_a._get_obj().obj == NULL);
  370. _RETURN_FAIL;
  371. }
  372. CASE_TYPE(math, OP_EQUAL, DICTIONARY) {
  373. if (p_b.type != DICTIONARY) {
  374. if (p_b.type == NIL)
  375. _RETURN(false);
  376. _RETURN_FAIL;
  377. }
  378. const Dictionary *arr_a = reinterpret_cast<const Dictionary *>(p_a._data._mem);
  379. const Dictionary *arr_b = reinterpret_cast<const Dictionary *>(p_b._data._mem);
  380. _RETURN(*arr_a == *arr_b);
  381. }
  382. CASE_TYPE(math, OP_EQUAL, ARRAY) {
  383. if (p_b.type != ARRAY) {
  384. if (p_b.type == NIL)
  385. _RETURN(false);
  386. _RETURN_FAIL;
  387. }
  388. const Array *arr_a = reinterpret_cast<const Array *>(p_a._data._mem);
  389. const Array *arr_b = reinterpret_cast<const Array *>(p_b._data._mem);
  390. int l = arr_a->size();
  391. if (arr_b->size() != l)
  392. _RETURN(false);
  393. for (int i = 0; i < l; i++) {
  394. if (!((*arr_a)[i] == (*arr_b)[i])) {
  395. _RETURN(false);
  396. }
  397. }
  398. _RETURN(true);
  399. }
  400. DEFAULT_OP_NUM_NULL(math, OP_EQUAL, INT, ==, _int);
  401. DEFAULT_OP_NUM_NULL(math, OP_EQUAL, REAL, ==, _real);
  402. DEFAULT_OP_STR_NULL(math, OP_EQUAL, STRING, ==, String);
  403. DEFAULT_OP_LOCALMEM_NULL(math, OP_EQUAL, VECTOR2, ==, Vector2);
  404. DEFAULT_OP_LOCALMEM_NULL(math, OP_EQUAL, RECT2, ==, Rect2);
  405. DEFAULT_OP_PTRREF_NULL(math, OP_EQUAL, TRANSFORM2D, ==, _transform2d);
  406. DEFAULT_OP_LOCALMEM_NULL(math, OP_EQUAL, VECTOR3, ==, Vector3);
  407. DEFAULT_OP_LOCALMEM_NULL(math, OP_EQUAL, PLANE, ==, Plane);
  408. DEFAULT_OP_LOCALMEM_NULL(math, OP_EQUAL, QUAT, ==, Quat);
  409. DEFAULT_OP_PTRREF_NULL(math, OP_EQUAL, RECT3, ==, _rect3);
  410. DEFAULT_OP_PTRREF_NULL(math, OP_EQUAL, BASIS, ==, _basis);
  411. DEFAULT_OP_PTRREF_NULL(math, OP_EQUAL, TRANSFORM, ==, _transform);
  412. DEFAULT_OP_LOCALMEM_NULL(math, OP_EQUAL, COLOR, ==, Color);
  413. DEFAULT_OP_STR_NULL(math, OP_EQUAL, NODE_PATH, ==, NodePath);
  414. DEFAULT_OP_LOCALMEM_NULL(math, OP_EQUAL, _RID, ==, RID);
  415. DEFAULT_OP_ARRAY_EQ(math, OP_EQUAL, POOL_BYTE_ARRAY, uint8_t);
  416. DEFAULT_OP_ARRAY_EQ(math, OP_EQUAL, POOL_INT_ARRAY, int);
  417. DEFAULT_OP_ARRAY_EQ(math, OP_EQUAL, POOL_REAL_ARRAY, real_t);
  418. DEFAULT_OP_ARRAY_EQ(math, OP_EQUAL, POOL_STRING_ARRAY, String);
  419. DEFAULT_OP_ARRAY_EQ(math, OP_EQUAL, POOL_VECTOR2_ARRAY, Vector2);
  420. DEFAULT_OP_ARRAY_EQ(math, OP_EQUAL, POOL_VECTOR3_ARRAY, Vector3);
  421. DEFAULT_OP_ARRAY_EQ(math, OP_EQUAL, POOL_COLOR_ARRAY, Color);
  422. }
  423. SWITCH_OP(math, OP_NOT_EQUAL, p_a.type) {
  424. CASE_TYPE(math, OP_NOT_EQUAL, NIL) {
  425. if (p_b.type == NIL) _RETURN(false);
  426. if (p_b.type == OBJECT)
  427. _RETURN(p_b._get_obj().obj != NULL);
  428. _RETURN(true);
  429. }
  430. CASE_TYPE(math, OP_NOT_EQUAL, BOOL) {
  431. if (p_b.type != BOOL) {
  432. if (p_b.type == NIL)
  433. _RETURN(true);
  434. _RETURN_FAIL;
  435. }
  436. _RETURN(p_a._data._bool != p_b._data._bool);
  437. }
  438. CASE_TYPE(math, OP_NOT_EQUAL, OBJECT) {
  439. if (p_b.type == OBJECT)
  440. _RETURN((p_a._get_obj().obj != p_b._get_obj().obj));
  441. if (p_b.type == NIL)
  442. _RETURN(p_a._get_obj().obj != NULL);
  443. _RETURN_FAIL;
  444. }
  445. CASE_TYPE(math, OP_NOT_EQUAL, DICTIONARY) {
  446. if (p_b.type != DICTIONARY) {
  447. if (p_b.type == NIL)
  448. _RETURN(true);
  449. _RETURN_FAIL;
  450. }
  451. const Dictionary *arr_a = reinterpret_cast<const Dictionary *>(p_a._data._mem);
  452. const Dictionary *arr_b = reinterpret_cast<const Dictionary *>(p_b._data._mem);
  453. _RETURN((*arr_a == *arr_b) == false);
  454. }
  455. CASE_TYPE(math, OP_NOT_EQUAL, ARRAY) {
  456. if (p_b.type != ARRAY) {
  457. if (p_b.type == NIL)
  458. _RETURN(true);
  459. _RETURN_FAIL;
  460. }
  461. const Array *arr_a = reinterpret_cast<const Array *>(p_a._data._mem);
  462. const Array *arr_b = reinterpret_cast<const Array *>(p_b._data._mem);
  463. int l = arr_a->size();
  464. if (arr_b->size() != l)
  465. _RETURN(true);
  466. for (int i = 0; i < l; i++) {
  467. if (((*arr_a)[i] == (*arr_b)[i])) {
  468. _RETURN(false);
  469. }
  470. }
  471. _RETURN(true);
  472. }
  473. DEFAULT_OP_NUM_NULL(math, OP_NOT_EQUAL, INT, !=, _int);
  474. DEFAULT_OP_NUM_NULL(math, OP_NOT_EQUAL, REAL, !=, _real);
  475. DEFAULT_OP_STR_NULL(math, OP_NOT_EQUAL, STRING, !=, String);
  476. DEFAULT_OP_LOCALMEM_NULL(math, OP_NOT_EQUAL, VECTOR2, !=, Vector2);
  477. DEFAULT_OP_LOCALMEM_NULL(math, OP_NOT_EQUAL, RECT2, !=, Rect2);
  478. DEFAULT_OP_PTRREF_NULL(math, OP_NOT_EQUAL, TRANSFORM2D, !=, _transform2d);
  479. DEFAULT_OP_LOCALMEM_NULL(math, OP_NOT_EQUAL, VECTOR3, !=, Vector3);
  480. DEFAULT_OP_LOCALMEM_NULL(math, OP_NOT_EQUAL, PLANE, !=, Plane);
  481. DEFAULT_OP_LOCALMEM_NULL(math, OP_NOT_EQUAL, QUAT, !=, Quat);
  482. DEFAULT_OP_PTRREF_NULL(math, OP_NOT_EQUAL, RECT3, !=, _rect3);
  483. DEFAULT_OP_PTRREF_NULL(math, OP_NOT_EQUAL, BASIS, !=, _basis);
  484. DEFAULT_OP_PTRREF_NULL(math, OP_NOT_EQUAL, TRANSFORM, !=, _transform);
  485. DEFAULT_OP_LOCALMEM_NULL(math, OP_NOT_EQUAL, COLOR, !=, Color);
  486. DEFAULT_OP_STR_NULL(math, OP_NOT_EQUAL, NODE_PATH, !=, NodePath);
  487. DEFAULT_OP_LOCALMEM_NULL(math, OP_NOT_EQUAL, _RID, !=, RID);
  488. CASE_TYPE(math, OP_NOT_EQUAL, POOL_BYTE_ARRAY);
  489. CASE_TYPE(math, OP_NOT_EQUAL, POOL_INT_ARRAY);
  490. CASE_TYPE(math, OP_NOT_EQUAL, POOL_REAL_ARRAY);
  491. CASE_TYPE(math, OP_NOT_EQUAL, POOL_STRING_ARRAY);
  492. CASE_TYPE(math, OP_NOT_EQUAL, POOL_VECTOR2_ARRAY);
  493. CASE_TYPE(math, OP_NOT_EQUAL, POOL_VECTOR3_ARRAY);
  494. CASE_TYPE(math, OP_NOT_EQUAL, POOL_COLOR_ARRAY);
  495. _RETURN_FAIL;
  496. }
  497. SWITCH_OP(math, OP_LESS, p_a.type) {
  498. CASE_TYPE(math, OP_LESS, BOOL) {
  499. if (p_b.type != BOOL)
  500. _RETURN_FAIL;
  501. if (p_a._data._bool == p_b._data._bool)
  502. _RETURN(false);
  503. if (p_a._data._bool && !p_b._data._bool)
  504. _RETURN(false);
  505. _RETURN(true);
  506. }
  507. CASE_TYPE(math, OP_LESS, OBJECT) {
  508. if (p_b.type != OBJECT)
  509. _RETURN_FAIL;
  510. _RETURN((p_a._get_obj().obj < p_b._get_obj().obj));
  511. }
  512. CASE_TYPE(math, OP_LESS, ARRAY) {
  513. if (p_b.type != ARRAY)
  514. _RETURN_FAIL;
  515. const Array *arr_a = reinterpret_cast<const Array *>(p_a._data._mem);
  516. const Array *arr_b = reinterpret_cast<const Array *>(p_b._data._mem);
  517. int l = arr_a->size();
  518. if (arr_b->size() < l)
  519. _RETURN(false);
  520. for (int i = 0; i < l; i++) {
  521. if (!((*arr_a)[i] < (*arr_b)[i])) {
  522. _RETURN(true);
  523. }
  524. }
  525. _RETURN(false);
  526. }
  527. DEFAULT_OP_NUM(math, OP_LESS, INT, <, _int);
  528. DEFAULT_OP_NUM(math, OP_LESS, REAL, <, _real);
  529. DEFAULT_OP_STR(math, OP_LESS, STRING, <, String);
  530. DEFAULT_OP_LOCALMEM(math, OP_LESS, VECTOR2, <, Vector2);
  531. DEFAULT_OP_LOCALMEM(math, OP_LESS, VECTOR3, <, Vector3);
  532. DEFAULT_OP_LOCALMEM(math, OP_LESS, _RID, <, RID);
  533. DEFAULT_OP_ARRAY_LT(math, OP_LESS, POOL_BYTE_ARRAY, uint8_t);
  534. DEFAULT_OP_ARRAY_LT(math, OP_LESS, POOL_INT_ARRAY, int);
  535. DEFAULT_OP_ARRAY_LT(math, OP_LESS, POOL_REAL_ARRAY, real_t);
  536. DEFAULT_OP_ARRAY_LT(math, OP_LESS, POOL_STRING_ARRAY, String);
  537. DEFAULT_OP_ARRAY_LT(math, OP_LESS, POOL_VECTOR2_ARRAY, Vector3);
  538. DEFAULT_OP_ARRAY_LT(math, OP_LESS, POOL_VECTOR3_ARRAY, Vector3);
  539. DEFAULT_OP_ARRAY_LT(math, OP_LESS, POOL_COLOR_ARRAY, Color);
  540. CASE_TYPE(math, OP_LESS, NIL)
  541. CASE_TYPE(math, OP_LESS, RECT2)
  542. CASE_TYPE(math, OP_LESS, TRANSFORM2D)
  543. CASE_TYPE(math, OP_LESS, PLANE)
  544. CASE_TYPE(math, OP_LESS, QUAT)
  545. CASE_TYPE(math, OP_LESS, RECT3)
  546. CASE_TYPE(math, OP_LESS, BASIS)
  547. CASE_TYPE(math, OP_LESS, TRANSFORM)
  548. CASE_TYPE(math, OP_LESS, COLOR)
  549. CASE_TYPE(math, OP_LESS, NODE_PATH)
  550. CASE_TYPE(math, OP_LESS, DICTIONARY)
  551. _RETURN_FAIL;
  552. }
  553. SWITCH_OP(math, OP_LESS_EQUAL, p_a.type) {
  554. CASE_TYPE(math, OP_LESS_EQUAL, OBJECT) {
  555. if (p_b.type != OBJECT)
  556. _RETURN_FAIL;
  557. _RETURN((p_a._get_obj().obj <= p_b._get_obj().obj));
  558. }
  559. DEFAULT_OP_NUM(math, OP_LESS_EQUAL, INT, <=, _int);
  560. DEFAULT_OP_NUM(math, OP_LESS_EQUAL, REAL, <=, _real);
  561. DEFAULT_OP_STR(math, OP_LESS_EQUAL, STRING, <=, String);
  562. DEFAULT_OP_LOCALMEM(math, OP_LESS_EQUAL, VECTOR2, <=, Vector2);
  563. DEFAULT_OP_LOCALMEM(math, OP_LESS_EQUAL, VECTOR3, <=, Vector3);
  564. DEFAULT_OP_LOCALMEM(math, OP_LESS_EQUAL, _RID, <=, RID);
  565. CASE_TYPE(math, OP_LESS_EQUAL, NIL)
  566. CASE_TYPE(math, OP_LESS_EQUAL, BOOL)
  567. CASE_TYPE(math, OP_LESS_EQUAL, RECT2)
  568. CASE_TYPE(math, OP_LESS_EQUAL, TRANSFORM2D)
  569. CASE_TYPE(math, OP_LESS_EQUAL, PLANE)
  570. CASE_TYPE(math, OP_LESS_EQUAL, QUAT)
  571. CASE_TYPE(math, OP_LESS_EQUAL, RECT3)
  572. CASE_TYPE(math, OP_LESS_EQUAL, BASIS)
  573. CASE_TYPE(math, OP_LESS_EQUAL, TRANSFORM)
  574. CASE_TYPE(math, OP_LESS_EQUAL, COLOR)
  575. CASE_TYPE(math, OP_LESS_EQUAL, NODE_PATH)
  576. CASE_TYPE(math, OP_LESS_EQUAL, DICTIONARY)
  577. CASE_TYPE(math, OP_LESS_EQUAL, ARRAY)
  578. CASE_TYPE(math, OP_LESS_EQUAL, POOL_BYTE_ARRAY);
  579. CASE_TYPE(math, OP_LESS_EQUAL, POOL_INT_ARRAY);
  580. CASE_TYPE(math, OP_LESS_EQUAL, POOL_REAL_ARRAY);
  581. CASE_TYPE(math, OP_LESS_EQUAL, POOL_STRING_ARRAY);
  582. CASE_TYPE(math, OP_LESS_EQUAL, POOL_VECTOR2_ARRAY);
  583. CASE_TYPE(math, OP_LESS_EQUAL, POOL_VECTOR3_ARRAY);
  584. CASE_TYPE(math, OP_LESS_EQUAL, POOL_COLOR_ARRAY);
  585. _RETURN_FAIL;
  586. }
  587. SWITCH_OP(math, OP_GREATER, p_a.type) {
  588. CASE_TYPE(math, OP_GREATER, BOOL) {
  589. if (p_b.type != BOOL)
  590. _RETURN_FAIL;
  591. if (p_a._data._bool == p_b._data._bool)
  592. _RETURN(false);
  593. if (!p_a._data._bool && p_b._data._bool)
  594. _RETURN(false);
  595. _RETURN(true);
  596. }
  597. CASE_TYPE(math, OP_GREATER, OBJECT) {
  598. if (p_b.type != OBJECT)
  599. _RETURN_FAIL;
  600. _RETURN((p_a._get_obj().obj > p_b._get_obj().obj));
  601. }
  602. CASE_TYPE(math, OP_GREATER, ARRAY) {
  603. if (p_b.type != ARRAY)
  604. _RETURN_FAIL;
  605. const Array *arr_a = reinterpret_cast<const Array *>(p_a._data._mem);
  606. const Array *arr_b = reinterpret_cast<const Array *>(p_b._data._mem);
  607. int l = arr_a->size();
  608. if (arr_b->size() > l)
  609. _RETURN(false);
  610. for (int i = 0; i < l; i++) {
  611. if (((*arr_a)[i] < (*arr_b)[i])) {
  612. _RETURN(false);
  613. }
  614. }
  615. _RETURN(true);
  616. }
  617. DEFAULT_OP_NUM(math, OP_GREATER, INT, >, _int);
  618. DEFAULT_OP_NUM(math, OP_GREATER, REAL, >, _real);
  619. DEFAULT_OP_STR_REV(math, OP_GREATER, STRING, <, String);
  620. DEFAULT_OP_LOCALMEM_REV(math, OP_GREATER, VECTOR2, <, Vector2);
  621. DEFAULT_OP_LOCALMEM_REV(math, OP_GREATER, VECTOR3, <, Vector3);
  622. DEFAULT_OP_LOCALMEM_REV(math, OP_GREATER, _RID, <, RID);
  623. DEFAULT_OP_ARRAY_GT(math, OP_GREATER, POOL_BYTE_ARRAY, uint8_t);
  624. DEFAULT_OP_ARRAY_GT(math, OP_GREATER, POOL_INT_ARRAY, int);
  625. DEFAULT_OP_ARRAY_GT(math, OP_GREATER, POOL_REAL_ARRAY, real_t);
  626. DEFAULT_OP_ARRAY_GT(math, OP_GREATER, POOL_STRING_ARRAY, String);
  627. DEFAULT_OP_ARRAY_GT(math, OP_GREATER, POOL_VECTOR2_ARRAY, Vector3);
  628. DEFAULT_OP_ARRAY_GT(math, OP_GREATER, POOL_VECTOR3_ARRAY, Vector3);
  629. DEFAULT_OP_ARRAY_GT(math, OP_GREATER, POOL_COLOR_ARRAY, Color);
  630. CASE_TYPE(math, OP_GREATER, NIL)
  631. CASE_TYPE(math, OP_GREATER, RECT2)
  632. CASE_TYPE(math, OP_GREATER, TRANSFORM2D)
  633. CASE_TYPE(math, OP_GREATER, PLANE)
  634. CASE_TYPE(math, OP_GREATER, QUAT)
  635. CASE_TYPE(math, OP_GREATER, RECT3)
  636. CASE_TYPE(math, OP_GREATER, BASIS)
  637. CASE_TYPE(math, OP_GREATER, TRANSFORM)
  638. CASE_TYPE(math, OP_GREATER, COLOR)
  639. CASE_TYPE(math, OP_GREATER, NODE_PATH)
  640. CASE_TYPE(math, OP_GREATER, DICTIONARY)
  641. _RETURN_FAIL;
  642. }
  643. SWITCH_OP(math, OP_GREATER_EQUAL, p_a.type) {
  644. CASE_TYPE(math, OP_GREATER_EQUAL, OBJECT) {
  645. if (p_b.type != OBJECT)
  646. _RETURN_FAIL;
  647. _RETURN((p_a._get_obj().obj >= p_b._get_obj().obj));
  648. }
  649. DEFAULT_OP_NUM(math, OP_GREATER_EQUAL, INT, >=, _int);
  650. DEFAULT_OP_NUM(math, OP_GREATER_EQUAL, REAL, >=, _real);
  651. DEFAULT_OP_STR_REV(math, OP_GREATER_EQUAL, STRING, <=, String);
  652. DEFAULT_OP_LOCALMEM_REV(math, OP_GREATER_EQUAL, VECTOR2, <=, Vector2);
  653. DEFAULT_OP_LOCALMEM_REV(math, OP_GREATER_EQUAL, VECTOR3, <=, Vector3);
  654. DEFAULT_OP_LOCALMEM_REV(math, OP_GREATER_EQUAL, _RID, <=, RID);
  655. CASE_TYPE(math, OP_GREATER_EQUAL, NIL)
  656. CASE_TYPE(math, OP_GREATER_EQUAL, BOOL)
  657. CASE_TYPE(math, OP_GREATER_EQUAL, RECT2)
  658. CASE_TYPE(math, OP_GREATER_EQUAL, TRANSFORM2D)
  659. CASE_TYPE(math, OP_GREATER_EQUAL, PLANE)
  660. CASE_TYPE(math, OP_GREATER_EQUAL, QUAT)
  661. CASE_TYPE(math, OP_GREATER_EQUAL, RECT3)
  662. CASE_TYPE(math, OP_GREATER_EQUAL, BASIS)
  663. CASE_TYPE(math, OP_GREATER_EQUAL, TRANSFORM)
  664. CASE_TYPE(math, OP_GREATER_EQUAL, COLOR)
  665. CASE_TYPE(math, OP_GREATER_EQUAL, NODE_PATH)
  666. CASE_TYPE(math, OP_GREATER_EQUAL, DICTIONARY)
  667. CASE_TYPE(math, OP_GREATER_EQUAL, ARRAY)
  668. CASE_TYPE(math, OP_GREATER_EQUAL, POOL_BYTE_ARRAY);
  669. CASE_TYPE(math, OP_GREATER_EQUAL, POOL_INT_ARRAY);
  670. CASE_TYPE(math, OP_GREATER_EQUAL, POOL_REAL_ARRAY);
  671. CASE_TYPE(math, OP_GREATER_EQUAL, POOL_STRING_ARRAY);
  672. CASE_TYPE(math, OP_GREATER_EQUAL, POOL_VECTOR2_ARRAY);
  673. CASE_TYPE(math, OP_GREATER_EQUAL, POOL_VECTOR3_ARRAY);
  674. CASE_TYPE(math, OP_GREATER_EQUAL, POOL_COLOR_ARRAY);
  675. _RETURN_FAIL;
  676. }
  677. SWITCH_OP(math, OP_ADD, p_a.type) {
  678. CASE_TYPE(math, OP_ADD, ARRAY) {
  679. if (p_a.type != p_b.type)
  680. _RETURN_FAIL;
  681. const Array &array_a = *reinterpret_cast<const Array *>(p_a._data._mem);
  682. const Array &array_b = *reinterpret_cast<const Array *>(p_b._data._mem);
  683. Array sum;
  684. int asize = array_a.size();
  685. int bsize = array_b.size();
  686. sum.resize(asize + bsize);
  687. for (int i = 0; i < asize; i++)
  688. sum[i] = array_a[i];
  689. for (int i = 0; i < bsize; i++)
  690. sum[i + asize] = array_b[i];
  691. _RETURN(sum);
  692. }
  693. DEFAULT_OP_NUM(math, OP_ADD, INT, +, _int);
  694. DEFAULT_OP_NUM(math, OP_ADD, REAL, +, _real);
  695. DEFAULT_OP_STR(math, OP_ADD, STRING, +, String);
  696. DEFAULT_OP_LOCALMEM(math, OP_ADD, VECTOR2, +, Vector2);
  697. DEFAULT_OP_LOCALMEM(math, OP_ADD, VECTOR3, +, Vector3);
  698. DEFAULT_OP_LOCALMEM(math, OP_ADD, QUAT, +, Quat);
  699. DEFAULT_OP_LOCALMEM(math, OP_ADD, COLOR, +, Color);
  700. DEFAULT_OP_ARRAY_ADD(math, OP_ADD, POOL_BYTE_ARRAY, uint8_t);
  701. DEFAULT_OP_ARRAY_ADD(math, OP_ADD, POOL_INT_ARRAY, int);
  702. DEFAULT_OP_ARRAY_ADD(math, OP_ADD, POOL_REAL_ARRAY, real_t);
  703. DEFAULT_OP_ARRAY_ADD(math, OP_ADD, POOL_STRING_ARRAY, String);
  704. DEFAULT_OP_ARRAY_ADD(math, OP_ADD, POOL_VECTOR2_ARRAY, Vector2);
  705. DEFAULT_OP_ARRAY_ADD(math, OP_ADD, POOL_VECTOR3_ARRAY, Vector3);
  706. DEFAULT_OP_ARRAY_ADD(math, OP_ADD, POOL_COLOR_ARRAY, Color);
  707. CASE_TYPE(math, OP_ADD, NIL)
  708. CASE_TYPE(math, OP_ADD, BOOL)
  709. CASE_TYPE(math, OP_ADD, RECT2)
  710. CASE_TYPE(math, OP_ADD, TRANSFORM2D)
  711. CASE_TYPE(math, OP_ADD, PLANE)
  712. CASE_TYPE(math, OP_ADD, RECT3)
  713. CASE_TYPE(math, OP_ADD, BASIS)
  714. CASE_TYPE(math, OP_ADD, TRANSFORM)
  715. CASE_TYPE(math, OP_ADD, NODE_PATH)
  716. CASE_TYPE(math, OP_ADD, _RID)
  717. CASE_TYPE(math, OP_ADD, OBJECT)
  718. CASE_TYPE(math, OP_ADD, DICTIONARY)
  719. _RETURN_FAIL;
  720. }
  721. SWITCH_OP(math, OP_SUBTRACT, p_a.type) {
  722. DEFAULT_OP_NUM(math, OP_SUBTRACT, INT, -, _int);
  723. DEFAULT_OP_NUM(math, OP_SUBTRACT, REAL, -, _real);
  724. DEFAULT_OP_LOCALMEM(math, OP_SUBTRACT, VECTOR2, -, Vector2);
  725. DEFAULT_OP_LOCALMEM(math, OP_SUBTRACT, VECTOR3, -, Vector3);
  726. DEFAULT_OP_LOCALMEM(math, OP_SUBTRACT, QUAT, -, Quat);
  727. DEFAULT_OP_LOCALMEM(math, OP_SUBTRACT, COLOR, -, Color);
  728. CASE_TYPE(math, OP_SUBTRACT, NIL)
  729. CASE_TYPE(math, OP_SUBTRACT, BOOL)
  730. CASE_TYPE(math, OP_SUBTRACT, STRING)
  731. CASE_TYPE(math, OP_SUBTRACT, RECT2)
  732. CASE_TYPE(math, OP_SUBTRACT, TRANSFORM2D)
  733. CASE_TYPE(math, OP_SUBTRACT, PLANE)
  734. CASE_TYPE(math, OP_SUBTRACT, RECT3)
  735. CASE_TYPE(math, OP_SUBTRACT, BASIS)
  736. CASE_TYPE(math, OP_SUBTRACT, TRANSFORM)
  737. CASE_TYPE(math, OP_SUBTRACT, NODE_PATH)
  738. CASE_TYPE(math, OP_SUBTRACT, _RID)
  739. CASE_TYPE(math, OP_SUBTRACT, OBJECT)
  740. CASE_TYPE(math, OP_SUBTRACT, DICTIONARY)
  741. CASE_TYPE(math, OP_SUBTRACT, ARRAY)
  742. CASE_TYPE(math, OP_SUBTRACT, POOL_BYTE_ARRAY);
  743. CASE_TYPE(math, OP_SUBTRACT, POOL_INT_ARRAY);
  744. CASE_TYPE(math, OP_SUBTRACT, POOL_REAL_ARRAY);
  745. CASE_TYPE(math, OP_SUBTRACT, POOL_STRING_ARRAY);
  746. CASE_TYPE(math, OP_SUBTRACT, POOL_VECTOR2_ARRAY);
  747. CASE_TYPE(math, OP_SUBTRACT, POOL_VECTOR3_ARRAY);
  748. CASE_TYPE(math, OP_SUBTRACT, POOL_COLOR_ARRAY);
  749. _RETURN_FAIL;
  750. }
  751. SWITCH_OP(math, OP_MULTIPLY, p_a.type) {
  752. CASE_TYPE(math, OP_MULTIPLY, TRANSFORM2D) {
  753. switch (p_b.type) {
  754. case TRANSFORM2D: {
  755. _RETURN(*p_a._data._transform2d * *p_b._data._transform2d);
  756. }
  757. case VECTOR2: {
  758. _RETURN(p_a._data._transform2d->xform(*(const Vector2 *)p_b._data._mem));
  759. }
  760. default: _RETURN_FAIL;
  761. }
  762. }
  763. CASE_TYPE(math, OP_MULTIPLY, QUAT) {
  764. switch (p_b.type) {
  765. case VECTOR3: {
  766. _RETURN(reinterpret_cast<const Quat *>(p_a._data._mem)->xform(*(const Vector3 *)p_b._data._mem));
  767. }
  768. case QUAT: {
  769. _RETURN(*reinterpret_cast<const Quat *>(p_a._data._mem) * *reinterpret_cast<const Quat *>(p_b._data._mem));
  770. }
  771. case REAL: {
  772. _RETURN(*reinterpret_cast<const Quat *>(p_a._data._mem) * p_b._data._real);
  773. }
  774. default: _RETURN_FAIL;
  775. }
  776. }
  777. CASE_TYPE(math, OP_MULTIPLY, BASIS) {
  778. switch (p_b.type) {
  779. case VECTOR3: {
  780. _RETURN(p_a._data._basis->xform(*(const Vector3 *)p_b._data._mem));
  781. }
  782. case BASIS: {
  783. _RETURN(*p_a._data._basis * *p_b._data._basis);
  784. }
  785. default: _RETURN_FAIL;
  786. }
  787. }
  788. CASE_TYPE(math, OP_MULTIPLY, TRANSFORM) {
  789. switch (p_b.type) {
  790. case VECTOR3: {
  791. _RETURN(p_a._data._transform->xform(*(const Vector3 *)p_b._data._mem));
  792. }
  793. case TRANSFORM: {
  794. _RETURN(*p_a._data._transform * *p_b._data._transform);
  795. }
  796. default: _RETURN_FAIL;
  797. }
  798. }
  799. DEFAULT_OP_NUM_VEC(math, OP_MULTIPLY, INT, *, _int);
  800. DEFAULT_OP_NUM_VEC(math, OP_MULTIPLY, REAL, *, _real);
  801. DEFAULT_OP_LOCALMEM_NUM(math, OP_MULTIPLY, VECTOR2, *, Vector2);
  802. DEFAULT_OP_LOCALMEM_NUM(math, OP_MULTIPLY, VECTOR3, *, Vector3);
  803. DEFAULT_OP_LOCALMEM_NUM(math, OP_MULTIPLY, COLOR, *, Color);
  804. CASE_TYPE(math, OP_MULTIPLY, NIL)
  805. CASE_TYPE(math, OP_MULTIPLY, BOOL)
  806. CASE_TYPE(math, OP_MULTIPLY, STRING)
  807. CASE_TYPE(math, OP_MULTIPLY, RECT2)
  808. CASE_TYPE(math, OP_MULTIPLY, PLANE)
  809. CASE_TYPE(math, OP_MULTIPLY, RECT3)
  810. CASE_TYPE(math, OP_MULTIPLY, NODE_PATH)
  811. CASE_TYPE(math, OP_MULTIPLY, _RID)
  812. CASE_TYPE(math, OP_MULTIPLY, OBJECT)
  813. CASE_TYPE(math, OP_MULTIPLY, DICTIONARY)
  814. CASE_TYPE(math, OP_MULTIPLY, ARRAY)
  815. CASE_TYPE(math, OP_MULTIPLY, POOL_BYTE_ARRAY);
  816. CASE_TYPE(math, OP_MULTIPLY, POOL_INT_ARRAY);
  817. CASE_TYPE(math, OP_MULTIPLY, POOL_REAL_ARRAY);
  818. CASE_TYPE(math, OP_MULTIPLY, POOL_STRING_ARRAY);
  819. CASE_TYPE(math, OP_MULTIPLY, POOL_VECTOR2_ARRAY);
  820. CASE_TYPE(math, OP_MULTIPLY, POOL_VECTOR3_ARRAY);
  821. CASE_TYPE(math, OP_MULTIPLY, POOL_COLOR_ARRAY);
  822. _RETURN_FAIL;
  823. }
  824. SWITCH_OP(math, OP_DIVIDE, p_a.type) {
  825. CASE_TYPE(math, OP_DIVIDE, QUAT) {
  826. if (p_b.type != REAL)
  827. _RETURN_FAIL;
  828. #ifdef DEBUG_ENABLED
  829. if (p_b._data._real == 0) {
  830. r_valid = false;
  831. _RETURN("Division By Zero");
  832. }
  833. #endif
  834. _RETURN(*reinterpret_cast<const Quat *>(p_a._data._mem) / p_b._data._real);
  835. }
  836. DEFAULT_OP_NUM_DIV(math, OP_DIVIDE, INT, _int);
  837. DEFAULT_OP_NUM_DIV(math, OP_DIVIDE, REAL, _real);
  838. DEFAULT_OP_LOCALMEM_NUM(math, OP_DIVIDE, VECTOR2, /, Vector2);
  839. DEFAULT_OP_LOCALMEM_NUM(math, OP_DIVIDE, VECTOR3, /, Vector3);
  840. DEFAULT_OP_LOCALMEM_NUM(math, OP_DIVIDE, COLOR, /, Color);
  841. CASE_TYPE(math, OP_DIVIDE, NIL)
  842. CASE_TYPE(math, OP_DIVIDE, BOOL)
  843. CASE_TYPE(math, OP_DIVIDE, STRING)
  844. CASE_TYPE(math, OP_DIVIDE, RECT2)
  845. CASE_TYPE(math, OP_DIVIDE, TRANSFORM2D)
  846. CASE_TYPE(math, OP_DIVIDE, PLANE)
  847. CASE_TYPE(math, OP_DIVIDE, RECT3)
  848. CASE_TYPE(math, OP_DIVIDE, BASIS)
  849. CASE_TYPE(math, OP_DIVIDE, TRANSFORM)
  850. CASE_TYPE(math, OP_DIVIDE, NODE_PATH)
  851. CASE_TYPE(math, OP_DIVIDE, _RID)
  852. CASE_TYPE(math, OP_DIVIDE, OBJECT)
  853. CASE_TYPE(math, OP_DIVIDE, DICTIONARY)
  854. CASE_TYPE(math, OP_DIVIDE, ARRAY)
  855. CASE_TYPE(math, OP_DIVIDE, POOL_BYTE_ARRAY);
  856. CASE_TYPE(math, OP_DIVIDE, POOL_INT_ARRAY);
  857. CASE_TYPE(math, OP_DIVIDE, POOL_REAL_ARRAY);
  858. CASE_TYPE(math, OP_DIVIDE, POOL_STRING_ARRAY);
  859. CASE_TYPE(math, OP_DIVIDE, POOL_VECTOR2_ARRAY);
  860. CASE_TYPE(math, OP_DIVIDE, POOL_VECTOR3_ARRAY);
  861. CASE_TYPE(math, OP_DIVIDE, POOL_COLOR_ARRAY);
  862. _RETURN_FAIL;
  863. }
  864. SWITCH_OP(math, OP_POSITIVE, p_a.type) {
  865. DEFAULT_OP_NUM_POS(math, OP_POSITIVE, INT, _int);
  866. DEFAULT_OP_NUM_POS(math, OP_POSITIVE, REAL, _real);
  867. DEFAULT_OP_LOCALMEM_POS(math, OP_POSITIVE, VECTOR3, Vector3);
  868. DEFAULT_OP_LOCALMEM_POS(math, OP_POSITIVE, PLANE, Plane);
  869. DEFAULT_OP_LOCALMEM_POS(math, OP_POSITIVE, QUAT, Quat);
  870. DEFAULT_OP_LOCALMEM_POS(math, OP_POSITIVE, VECTOR2, Vector2);
  871. CASE_TYPE(math, OP_POSITIVE, NIL)
  872. CASE_TYPE(math, OP_POSITIVE, BOOL)
  873. CASE_TYPE(math, OP_POSITIVE, STRING)
  874. CASE_TYPE(math, OP_POSITIVE, RECT2)
  875. CASE_TYPE(math, OP_POSITIVE, TRANSFORM2D)
  876. CASE_TYPE(math, OP_POSITIVE, RECT3)
  877. CASE_TYPE(math, OP_POSITIVE, BASIS)
  878. CASE_TYPE(math, OP_POSITIVE, TRANSFORM)
  879. CASE_TYPE(math, OP_POSITIVE, COLOR)
  880. CASE_TYPE(math, OP_POSITIVE, NODE_PATH)
  881. CASE_TYPE(math, OP_POSITIVE, _RID)
  882. CASE_TYPE(math, OP_POSITIVE, OBJECT)
  883. CASE_TYPE(math, OP_POSITIVE, DICTIONARY)
  884. CASE_TYPE(math, OP_POSITIVE, ARRAY)
  885. CASE_TYPE(math, OP_POSITIVE, POOL_BYTE_ARRAY)
  886. CASE_TYPE(math, OP_POSITIVE, POOL_INT_ARRAY)
  887. CASE_TYPE(math, OP_POSITIVE, POOL_REAL_ARRAY)
  888. CASE_TYPE(math, OP_POSITIVE, POOL_STRING_ARRAY)
  889. CASE_TYPE(math, OP_POSITIVE, POOL_VECTOR2_ARRAY)
  890. CASE_TYPE(math, OP_POSITIVE, POOL_VECTOR3_ARRAY)
  891. CASE_TYPE(math, OP_POSITIVE, POOL_COLOR_ARRAY)
  892. _RETURN_FAIL;
  893. }
  894. SWITCH_OP(math, OP_NEGATE, p_a.type) {
  895. DEFAULT_OP_NUM_NEG(math, OP_NEGATE, INT, _int);
  896. DEFAULT_OP_NUM_NEG(math, OP_NEGATE, REAL, _real);
  897. DEFAULT_OP_LOCALMEM_NEG(math, OP_NEGATE, VECTOR2, Vector2);
  898. DEFAULT_OP_LOCALMEM_NEG(math, OP_NEGATE, VECTOR3, Vector3);
  899. DEFAULT_OP_LOCALMEM_NEG(math, OP_NEGATE, PLANE, Plane);
  900. DEFAULT_OP_LOCALMEM_NEG(math, OP_NEGATE, QUAT, Quat);
  901. DEFAULT_OP_LOCALMEM_NEG(math, OP_NEGATE, COLOR, Color);
  902. CASE_TYPE(math, OP_NEGATE, NIL)
  903. CASE_TYPE(math, OP_NEGATE, BOOL)
  904. CASE_TYPE(math, OP_NEGATE, STRING)
  905. CASE_TYPE(math, OP_NEGATE, RECT2)
  906. CASE_TYPE(math, OP_NEGATE, TRANSFORM2D)
  907. CASE_TYPE(math, OP_NEGATE, RECT3)
  908. CASE_TYPE(math, OP_NEGATE, BASIS)
  909. CASE_TYPE(math, OP_NEGATE, TRANSFORM)
  910. CASE_TYPE(math, OP_NEGATE, NODE_PATH)
  911. CASE_TYPE(math, OP_NEGATE, _RID)
  912. CASE_TYPE(math, OP_NEGATE, OBJECT)
  913. CASE_TYPE(math, OP_NEGATE, DICTIONARY)
  914. CASE_TYPE(math, OP_NEGATE, ARRAY)
  915. CASE_TYPE(math, OP_NEGATE, POOL_BYTE_ARRAY)
  916. CASE_TYPE(math, OP_NEGATE, POOL_INT_ARRAY)
  917. CASE_TYPE(math, OP_NEGATE, POOL_REAL_ARRAY)
  918. CASE_TYPE(math, OP_NEGATE, POOL_STRING_ARRAY)
  919. CASE_TYPE(math, OP_NEGATE, POOL_VECTOR2_ARRAY)
  920. CASE_TYPE(math, OP_NEGATE, POOL_VECTOR3_ARRAY)
  921. CASE_TYPE(math, OP_NEGATE, POOL_COLOR_ARRAY)
  922. _RETURN_FAIL;
  923. }
  924. SWITCH_OP(math, OP_MODULE, p_a.type) {
  925. CASE_TYPE(math, OP_MODULE, INT) {
  926. if (p_b.type != INT)
  927. _RETURN_FAIL;
  928. #ifdef DEBUG_ENABLED
  929. if (p_b._data._int == 0) {
  930. r_valid = false;
  931. _RETURN("Division By Zero");
  932. }
  933. #endif
  934. _RETURN(p_a._data._int % p_b._data._int);
  935. }
  936. CASE_TYPE(math, OP_MODULE, STRING) {
  937. const String *format = reinterpret_cast<const String *>(p_a._data._mem);
  938. String result;
  939. bool error;
  940. if (p_b.type == ARRAY) {
  941. // e.g. "frog %s %d" % ["fish", 12]
  942. const Array *args = reinterpret_cast<const Array *>(p_b._data._mem);
  943. result = format->sprintf(*args, &error);
  944. } else {
  945. // e.g. "frog %d" % 12
  946. Array args;
  947. args.push_back(p_b);
  948. result = format->sprintf(args, &error);
  949. }
  950. r_valid = !error;
  951. _RETURN(result);
  952. }
  953. CASE_TYPE(math, OP_MODULE, NIL)
  954. CASE_TYPE(math, OP_MODULE, BOOL)
  955. CASE_TYPE(math, OP_MODULE, REAL)
  956. CASE_TYPE(math, OP_MODULE, VECTOR2)
  957. CASE_TYPE(math, OP_MODULE, RECT2)
  958. CASE_TYPE(math, OP_MODULE, VECTOR3)
  959. CASE_TYPE(math, OP_MODULE, TRANSFORM2D)
  960. CASE_TYPE(math, OP_MODULE, PLANE)
  961. CASE_TYPE(math, OP_MODULE, QUAT)
  962. CASE_TYPE(math, OP_MODULE, RECT3)
  963. CASE_TYPE(math, OP_MODULE, BASIS)
  964. CASE_TYPE(math, OP_MODULE, TRANSFORM)
  965. CASE_TYPE(math, OP_MODULE, COLOR)
  966. CASE_TYPE(math, OP_MODULE, NODE_PATH)
  967. CASE_TYPE(math, OP_MODULE, _RID)
  968. CASE_TYPE(math, OP_MODULE, OBJECT)
  969. CASE_TYPE(math, OP_MODULE, DICTIONARY)
  970. CASE_TYPE(math, OP_MODULE, ARRAY)
  971. CASE_TYPE(math, OP_MODULE, POOL_BYTE_ARRAY)
  972. CASE_TYPE(math, OP_MODULE, POOL_INT_ARRAY)
  973. CASE_TYPE(math, OP_MODULE, POOL_REAL_ARRAY)
  974. CASE_TYPE(math, OP_MODULE, POOL_STRING_ARRAY)
  975. CASE_TYPE(math, OP_MODULE, POOL_VECTOR2_ARRAY)
  976. CASE_TYPE(math, OP_MODULE, POOL_VECTOR3_ARRAY)
  977. CASE_TYPE(math, OP_MODULE, POOL_COLOR_ARRAY)
  978. _RETURN_FAIL;
  979. }
  980. SWITCH_OP(math, OP_STRING_CONCAT, p_a.type) {
  981. CASE_TYPE_ALL(math, OP_STRING_CONCAT)
  982. _RETURN(p_a.operator String() + p_b.operator String());
  983. }
  984. SWITCH_OP(math, OP_SHIFT_LEFT, p_a.type) {
  985. CASE_TYPE(math, OP_SHIFT_LEFT, INT) {
  986. if (p_b.type != INT)
  987. _RETURN_FAIL;
  988. _RETURN(p_a._data._int << p_b._data._int);
  989. }
  990. CASE_TYPE_ALL_BUT_INT(math, OP_SHIFT_LEFT)
  991. _RETURN_FAIL;
  992. }
  993. SWITCH_OP(math, OP_SHIFT_RIGHT, p_a.type) {
  994. CASE_TYPE(math, OP_SHIFT_RIGHT, INT) {
  995. if (p_b.type != INT)
  996. _RETURN_FAIL;
  997. _RETURN(p_a._data._int >> p_b._data._int);
  998. }
  999. CASE_TYPE_ALL_BUT_INT(math, OP_SHIFT_RIGHT)
  1000. _RETURN_FAIL;
  1001. }
  1002. SWITCH_OP(math, OP_BIT_AND, p_a.type) {
  1003. CASE_TYPE(math, OP_BIT_AND, INT) {
  1004. if (p_b.type != INT)
  1005. _RETURN_FAIL;
  1006. _RETURN(p_a._data._int & p_b._data._int);
  1007. }
  1008. CASE_TYPE_ALL_BUT_INT(math, OP_BIT_AND)
  1009. _RETURN_FAIL;
  1010. }
  1011. SWITCH_OP(math, OP_BIT_OR, p_a.type) {
  1012. CASE_TYPE(math, OP_BIT_OR, INT) {
  1013. if (p_b.type != INT)
  1014. _RETURN_FAIL;
  1015. _RETURN(p_a._data._int | p_b._data._int);
  1016. }
  1017. CASE_TYPE_ALL_BUT_INT(math, OP_BIT_OR)
  1018. _RETURN_FAIL;
  1019. }
  1020. SWITCH_OP(math, OP_BIT_XOR, p_a.type) {
  1021. CASE_TYPE(math, OP_BIT_XOR, INT) {
  1022. if (p_b.type != INT)
  1023. _RETURN_FAIL;
  1024. _RETURN(p_a._data._int ^ p_b._data._int);
  1025. }
  1026. CASE_TYPE_ALL_BUT_INT(math, OP_BIT_XOR)
  1027. _RETURN_FAIL;
  1028. }
  1029. SWITCH_OP(math, OP_BIT_NEGATE, p_a.type) {
  1030. CASE_TYPE(math, OP_BIT_NEGATE, INT) {
  1031. _RETURN(~p_a._data._int);
  1032. }
  1033. CASE_TYPE_ALL_BUT_INT(math, OP_BIT_NEGATE)
  1034. _RETURN_FAIL;
  1035. }
  1036. SWITCH_OP(math, OP_AND, p_a.type) {
  1037. CASE_TYPE_ALL(math, OP_AND) {
  1038. bool l = p_a.booleanize();
  1039. bool r = p_b.booleanize();
  1040. _RETURN(l && r);
  1041. }
  1042. }
  1043. SWITCH_OP(math, OP_OR, p_a.type) {
  1044. CASE_TYPE_ALL(math, OP_OR) {
  1045. bool l = p_a.booleanize();
  1046. bool r = p_b.booleanize();
  1047. _RETURN(l || r);
  1048. }
  1049. }
  1050. SWITCH_OP(math, OP_XOR, p_a.type) {
  1051. CASE_TYPE_ALL(math, OP_XOR) {
  1052. bool l = p_a.booleanize();
  1053. bool r = p_b.booleanize();
  1054. _RETURN((l || r) && !(l && r));
  1055. }
  1056. }
  1057. SWITCH_OP(math, OP_NOT, p_a.type) {
  1058. CASE_TYPE_ALL(math, OP_NOT) {
  1059. bool l = p_a.booleanize();
  1060. _RETURN(!l);
  1061. }
  1062. }
  1063. SWITCH_OP(math, OP_IN, p_a.type) {
  1064. CASE_TYPE_ALL(math, OP_IN)
  1065. _RETURN(p_b.in(p_a, &r_valid));
  1066. }
  1067. }
  1068. }
  1069. void Variant::set_named(const StringName &p_index, const Variant &p_value, bool *r_valid) {
  1070. if (type == OBJECT) {
  1071. #ifdef DEBUG_ENABLED
  1072. if (!_get_obj().obj) {
  1073. if (r_valid)
  1074. *r_valid = false;
  1075. return;
  1076. } else {
  1077. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null() && !ObjectDB::instance_validate(_get_obj().obj)) {
  1078. if (r_valid)
  1079. *r_valid = false;
  1080. return;
  1081. }
  1082. }
  1083. #endif
  1084. _get_obj().obj->set(p_index, p_value, r_valid);
  1085. return;
  1086. }
  1087. set(p_index.operator String(), p_value, r_valid);
  1088. }
  1089. Variant Variant::get_named(const StringName &p_index, bool *r_valid) const {
  1090. if (type == OBJECT) {
  1091. #ifdef DEBUG_ENABLED
  1092. if (!_get_obj().obj) {
  1093. if (r_valid)
  1094. *r_valid = false;
  1095. return "Instance base is null.";
  1096. } else {
  1097. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null() && !ObjectDB::instance_validate(_get_obj().obj)) {
  1098. if (r_valid)
  1099. *r_valid = false;
  1100. return "Attempted use of stray pointer object.";
  1101. }
  1102. }
  1103. #endif
  1104. return _get_obj().obj->get(p_index, r_valid);
  1105. }
  1106. return get(p_index.operator String(), r_valid);
  1107. }
  1108. #define DEFAULT_OP_ARRAY_CMD(m_name, m_type, skip_test, cmd) \
  1109. case m_name: { \
  1110. skip_test; \
  1111. \
  1112. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) { \
  1113. int index = p_index; \
  1114. m_type *arr = reinterpret_cast<m_type *>(_data._mem); \
  1115. \
  1116. if (index < 0) \
  1117. index += arr->size(); \
  1118. if (index >= 0 && index < arr->size()) { \
  1119. valid = true; \
  1120. cmd; \
  1121. } \
  1122. } \
  1123. } break;
  1124. #define DEFAULT_OP_DVECTOR_SET(m_name, dv_type, skip_cond) \
  1125. DEFAULT_OP_ARRAY_CMD(m_name, PoolVector<dv_type>, if (skip_cond) return;, arr->set(index, p_value); return )
  1126. #define DEFAULT_OP_DVECTOR_GET(m_name, dv_type) \
  1127. DEFAULT_OP_ARRAY_CMD(m_name, const PoolVector<dv_type>, ;, return arr->get(index))
  1128. void Variant::set(const Variant &p_index, const Variant &p_value, bool *r_valid) {
  1129. static bool _dummy = false;
  1130. bool &valid = r_valid ? *r_valid : _dummy;
  1131. valid = false;
  1132. switch (type) {
  1133. case NIL: {
  1134. return;
  1135. } break;
  1136. case BOOL: {
  1137. return;
  1138. } break;
  1139. case INT: {
  1140. return;
  1141. } break;
  1142. case REAL: {
  1143. return;
  1144. } break;
  1145. case STRING: {
  1146. if (p_index.type != Variant::INT && p_index.type != Variant::REAL)
  1147. return;
  1148. int idx = p_index;
  1149. String *str = reinterpret_cast<String *>(_data._mem);
  1150. int len = str->length();
  1151. if (idx < 0)
  1152. idx += len;
  1153. if (idx < 0 || idx >= len)
  1154. return;
  1155. String chr;
  1156. if (p_value.type == Variant::INT || p_value.type == Variant::REAL) {
  1157. chr = String::chr(p_value);
  1158. } else if (p_value.type == Variant::STRING) {
  1159. chr = p_value;
  1160. } else {
  1161. return;
  1162. }
  1163. *str = str->substr(0, idx) + chr + str->substr(idx + 1, len);
  1164. valid = true;
  1165. return;
  1166. } break;
  1167. case VECTOR2: {
  1168. if (p_value.type != Variant::INT && p_value.type != Variant::REAL)
  1169. return;
  1170. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1171. // scalar index
  1172. int idx = p_index;
  1173. if (idx < 0)
  1174. idx += 2;
  1175. if (idx >= 0 && idx < 2) {
  1176. Vector2 *v = reinterpret_cast<Vector2 *>(_data._mem);
  1177. valid = true;
  1178. (*v)[idx] = p_value;
  1179. return;
  1180. }
  1181. } else if (p_index.get_type() == Variant::STRING) {
  1182. //scalar name
  1183. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1184. Vector2 *v = reinterpret_cast<Vector2 *>(_data._mem);
  1185. if (*str == "x") {
  1186. valid = true;
  1187. v->x = p_value;
  1188. return;
  1189. } else if (*str == "y") {
  1190. valid = true;
  1191. v->y = p_value;
  1192. return;
  1193. }
  1194. }
  1195. } break; // 5
  1196. case RECT2: {
  1197. if (p_value.type != Variant::VECTOR2)
  1198. return;
  1199. if (p_index.get_type() == Variant::STRING) {
  1200. //scalar name
  1201. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1202. Rect2 *v = reinterpret_cast<Rect2 *>(_data._mem);
  1203. if (*str == "position") {
  1204. valid = true;
  1205. v->position = p_value;
  1206. return;
  1207. } else if (*str == "size") {
  1208. valid = true;
  1209. v->size = p_value;
  1210. return;
  1211. } else if (*str == "end") {
  1212. valid = true;
  1213. v->size = Vector2(p_value) - v->position;
  1214. return;
  1215. }
  1216. }
  1217. } break;
  1218. case TRANSFORM2D: {
  1219. if (p_value.type != Variant::VECTOR2)
  1220. return;
  1221. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1222. int index = p_index;
  1223. if (index < 0)
  1224. index += 3;
  1225. if (index >= 0 && index < 3) {
  1226. Transform2D *v = _data._transform2d;
  1227. valid = true;
  1228. v->elements[index] = p_value;
  1229. return;
  1230. }
  1231. } else if (p_index.get_type() == Variant::STRING && p_value.get_type() == Variant::VECTOR2) {
  1232. //scalar name
  1233. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1234. Transform2D *v = _data._transform2d;
  1235. if (*str == "x") {
  1236. valid = true;
  1237. v->elements[0] = p_value;
  1238. return;
  1239. } else if (*str == "y") {
  1240. valid = true;
  1241. v->elements[1] = p_value;
  1242. return;
  1243. } else if (*str == "origin") {
  1244. valid = true;
  1245. v->elements[2] = p_value;
  1246. return;
  1247. }
  1248. }
  1249. } break;
  1250. case VECTOR3: {
  1251. if (p_value.type != Variant::INT && p_value.type != Variant::REAL)
  1252. return;
  1253. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1254. //scalar index
  1255. int idx = p_index;
  1256. if (idx < 0)
  1257. idx += 3;
  1258. if (idx >= 0 && idx < 3) {
  1259. Vector3 *v = reinterpret_cast<Vector3 *>(_data._mem);
  1260. valid = true;
  1261. (*v)[idx] = p_value;
  1262. return;
  1263. }
  1264. } else if (p_index.get_type() == Variant::STRING) {
  1265. //scalar name
  1266. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1267. Vector3 *v = reinterpret_cast<Vector3 *>(_data._mem);
  1268. if (*str == "x") {
  1269. valid = true;
  1270. v->x = p_value;
  1271. return;
  1272. } else if (*str == "y") {
  1273. valid = true;
  1274. v->y = p_value;
  1275. return;
  1276. } else if (*str == "z") {
  1277. valid = true;
  1278. v->z = p_value;
  1279. return;
  1280. }
  1281. }
  1282. } break;
  1283. case PLANE: {
  1284. if (p_index.get_type() == Variant::STRING) {
  1285. //scalar name
  1286. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1287. Plane *v = reinterpret_cast<Plane *>(_data._mem);
  1288. if (*str == "x") {
  1289. if (p_value.type != Variant::INT && p_value.type != Variant::REAL)
  1290. return;
  1291. valid = true;
  1292. v->normal.x = p_value;
  1293. return;
  1294. } else if (*str == "y") {
  1295. if (p_value.type != Variant::INT && p_value.type != Variant::REAL)
  1296. return;
  1297. valid = true;
  1298. v->normal.y = p_value;
  1299. return;
  1300. } else if (*str == "z") {
  1301. if (p_value.type != Variant::INT && p_value.type != Variant::REAL)
  1302. return;
  1303. valid = true;
  1304. v->normal.z = p_value;
  1305. return;
  1306. } else if (*str == "normal") {
  1307. if (p_value.type != Variant::VECTOR3)
  1308. return;
  1309. valid = true;
  1310. v->normal = p_value;
  1311. return;
  1312. } else if (*str == "d") {
  1313. valid = true;
  1314. v->d = p_value;
  1315. return;
  1316. }
  1317. }
  1318. } break;
  1319. case QUAT: {
  1320. if (p_value.type != Variant::INT && p_value.type != Variant::REAL)
  1321. return;
  1322. if (p_index.get_type() == Variant::STRING) {
  1323. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1324. Quat *v = reinterpret_cast<Quat *>(_data._mem);
  1325. if (*str == "x") {
  1326. valid = true;
  1327. v->x = p_value;
  1328. return;
  1329. } else if (*str == "y") {
  1330. valid = true;
  1331. v->y = p_value;
  1332. return;
  1333. } else if (*str == "z") {
  1334. valid = true;
  1335. v->z = p_value;
  1336. return;
  1337. } else if (*str == "w") {
  1338. valid = true;
  1339. v->w = p_value;
  1340. return;
  1341. }
  1342. }
  1343. } break; // 10
  1344. case RECT3: {
  1345. if (p_value.type != Variant::VECTOR3)
  1346. return;
  1347. if (p_index.get_type() == Variant::STRING) {
  1348. //scalar name
  1349. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1350. Rect3 *v = _data._rect3;
  1351. if (*str == "position") {
  1352. valid = true;
  1353. v->position = p_value;
  1354. return;
  1355. } else if (*str == "size") {
  1356. valid = true;
  1357. v->size = p_value;
  1358. return;
  1359. } else if (*str == "end") {
  1360. valid = true;
  1361. v->size = Vector3(p_value) - v->position;
  1362. return;
  1363. }
  1364. }
  1365. } break;
  1366. case BASIS: {
  1367. if (p_value.type != Variant::VECTOR3)
  1368. return;
  1369. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1370. int index = p_index;
  1371. if (index < 0)
  1372. index += 3;
  1373. if (index >= 0 && index < 3) {
  1374. Basis *v = _data._basis;
  1375. valid = true;
  1376. v->set_axis(index, p_value);
  1377. return;
  1378. }
  1379. } else if (p_index.get_type() == Variant::STRING) {
  1380. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1381. Basis *v = _data._basis;
  1382. if (*str == "x") {
  1383. valid = true;
  1384. v->set_axis(0, p_value);
  1385. return;
  1386. } else if (*str == "y") {
  1387. valid = true;
  1388. v->set_axis(1, p_value);
  1389. return;
  1390. } else if (*str == "z") {
  1391. valid = true;
  1392. v->set_axis(2, p_value);
  1393. return;
  1394. }
  1395. }
  1396. } break;
  1397. case TRANSFORM: {
  1398. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1399. if (p_value.type != Variant::VECTOR3)
  1400. return;
  1401. int index = p_index;
  1402. if (index < 0)
  1403. index += 4;
  1404. if (index >= 0 && index < 4) {
  1405. Transform *v = _data._transform;
  1406. valid = true;
  1407. if (index == 3)
  1408. v->origin = p_value;
  1409. else
  1410. v->basis.set_axis(index, p_value);
  1411. return;
  1412. }
  1413. } else if (p_index.get_type() == Variant::STRING) {
  1414. Transform *v = _data._transform;
  1415. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1416. if (*str == "basis") {
  1417. if (p_value.type != Variant::BASIS)
  1418. return;
  1419. valid = true;
  1420. v->basis = p_value;
  1421. return;
  1422. }
  1423. if (*str == "origin") {
  1424. if (p_value.type != Variant::VECTOR3)
  1425. return;
  1426. valid = true;
  1427. v->origin = p_value;
  1428. return;
  1429. }
  1430. }
  1431. } break;
  1432. case COLOR: {
  1433. if (p_value.type != Variant::INT && p_value.type != Variant::REAL)
  1434. return;
  1435. if (p_index.get_type() == Variant::STRING) {
  1436. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1437. Color *v = reinterpret_cast<Color *>(_data._mem);
  1438. if (*str == "r") {
  1439. valid = true;
  1440. v->r = p_value;
  1441. return;
  1442. } else if (*str == "g") {
  1443. valid = true;
  1444. v->g = p_value;
  1445. return;
  1446. } else if (*str == "b") {
  1447. valid = true;
  1448. v->b = p_value;
  1449. return;
  1450. } else if (*str == "a") {
  1451. valid = true;
  1452. v->a = p_value;
  1453. return;
  1454. } else if (*str == "h") {
  1455. valid = true;
  1456. v->set_hsv(p_value, v->get_s(), v->get_v());
  1457. return;
  1458. } else if (*str == "s") {
  1459. valid = true;
  1460. v->set_hsv(v->get_h(), p_value, v->get_v());
  1461. return;
  1462. } else if (*str == "v") {
  1463. valid = true;
  1464. v->set_hsv(v->get_h(), v->get_s(), p_value);
  1465. return;
  1466. } else if (*str == "r8") {
  1467. valid = true;
  1468. v->r = float(p_value) / 255.0;
  1469. return;
  1470. } else if (*str == "g8") {
  1471. valid = true;
  1472. v->g = float(p_value) / 255.0;
  1473. return;
  1474. } else if (*str == "b8") {
  1475. valid = true;
  1476. v->b = float(p_value) / 255.0;
  1477. return;
  1478. } else if (*str == "a8") {
  1479. valid = true;
  1480. v->a = float(p_value) / 255.0;
  1481. return;
  1482. }
  1483. } else if (p_index.get_type() == Variant::INT) {
  1484. int idx = p_index;
  1485. if (idx < 0)
  1486. idx += 4;
  1487. if (idx >= 0 || idx < 4) {
  1488. Color *v = reinterpret_cast<Color *>(_data._mem);
  1489. (*v)[idx] = p_value;
  1490. valid = true;
  1491. }
  1492. }
  1493. } break;
  1494. case NODE_PATH: {
  1495. } break; // 15
  1496. case _RID: {
  1497. } break;
  1498. case OBJECT: {
  1499. Object *obj = _get_obj().obj;
  1500. //only if debugging!
  1501. if (obj) {
  1502. #ifdef DEBUG_ENABLED
  1503. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null()) {
  1504. if (!ObjectDB::instance_validate(obj)) {
  1505. WARN_PRINT("Attempted use of stray pointer object.");
  1506. valid = false;
  1507. return;
  1508. }
  1509. }
  1510. #endif
  1511. if (p_index.get_type() != Variant::STRING) {
  1512. obj->setvar(p_index, p_value, r_valid);
  1513. return;
  1514. }
  1515. return obj->set(p_index, p_value, r_valid);
  1516. }
  1517. } break;
  1518. case DICTIONARY: {
  1519. Dictionary *dic = reinterpret_cast<Dictionary *>(_data._mem);
  1520. dic->operator[](p_index) = p_value;
  1521. valid = true; //always valid, i guess? should this really be ok?
  1522. return;
  1523. } break;
  1524. DEFAULT_OP_ARRAY_CMD(ARRAY, Array, ;, (*arr)[index] = p_value; return ) // 20
  1525. DEFAULT_OP_DVECTOR_SET(POOL_BYTE_ARRAY, uint8_t, p_value.type != Variant::REAL && p_value.type != Variant::INT)
  1526. DEFAULT_OP_DVECTOR_SET(POOL_INT_ARRAY, int, p_value.type != Variant::REAL && p_value.type != Variant::INT)
  1527. DEFAULT_OP_DVECTOR_SET(POOL_REAL_ARRAY, real_t, p_value.type != Variant::REAL && p_value.type != Variant::INT)
  1528. DEFAULT_OP_DVECTOR_SET(POOL_STRING_ARRAY, String, p_value.type != Variant::STRING)
  1529. DEFAULT_OP_DVECTOR_SET(POOL_VECTOR2_ARRAY, Vector2, p_value.type != Variant::VECTOR2) // 25
  1530. DEFAULT_OP_DVECTOR_SET(POOL_VECTOR3_ARRAY, Vector3, p_value.type != Variant::VECTOR3)
  1531. DEFAULT_OP_DVECTOR_SET(POOL_COLOR_ARRAY, Color, p_value.type != Variant::COLOR)
  1532. default:
  1533. return;
  1534. }
  1535. }
  1536. Variant Variant::get(const Variant &p_index, bool *r_valid) const {
  1537. static bool _dummy = false;
  1538. bool &valid = r_valid ? *r_valid : _dummy;
  1539. valid = false;
  1540. switch (type) {
  1541. case NIL: {
  1542. return Variant();
  1543. } break;
  1544. case BOOL: {
  1545. return Variant();
  1546. } break;
  1547. case INT: {
  1548. return Variant();
  1549. } break;
  1550. case REAL: {
  1551. return Variant();
  1552. } break;
  1553. case STRING: {
  1554. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1555. //string index
  1556. int idx = p_index;
  1557. const String *str = reinterpret_cast<const String *>(_data._mem);
  1558. if (idx < 0)
  1559. idx += str->length();
  1560. if (idx >= 0 && idx < str->length()) {
  1561. valid = true;
  1562. return str->substr(idx, 1);
  1563. }
  1564. }
  1565. } break;
  1566. case VECTOR2: {
  1567. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1568. // scalar index
  1569. int idx = p_index;
  1570. if (idx < 0)
  1571. idx += 2;
  1572. if (idx >= 0 && idx < 2) {
  1573. const Vector2 *v = reinterpret_cast<const Vector2 *>(_data._mem);
  1574. valid = true;
  1575. return (*v)[idx];
  1576. }
  1577. } else if (p_index.get_type() == Variant::STRING) {
  1578. //scalar name
  1579. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1580. const Vector2 *v = reinterpret_cast<const Vector2 *>(_data._mem);
  1581. if (*str == "x") {
  1582. valid = true;
  1583. return v->x;
  1584. } else if (*str == "y") {
  1585. valid = true;
  1586. return v->y;
  1587. }
  1588. }
  1589. } break; // 5
  1590. case RECT2: {
  1591. if (p_index.get_type() == Variant::STRING) {
  1592. //scalar name
  1593. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1594. const Rect2 *v = reinterpret_cast<const Rect2 *>(_data._mem);
  1595. if (*str == "position") {
  1596. valid = true;
  1597. return v->position;
  1598. } else if (*str == "size") {
  1599. valid = true;
  1600. return v->size;
  1601. } else if (*str == "end") {
  1602. valid = true;
  1603. return v->size + v->position;
  1604. }
  1605. }
  1606. } break;
  1607. case VECTOR3: {
  1608. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1609. //scalar index
  1610. int idx = p_index;
  1611. if (idx < 0)
  1612. idx += 3;
  1613. if (idx >= 0 && idx < 3) {
  1614. const Vector3 *v = reinterpret_cast<const Vector3 *>(_data._mem);
  1615. valid = true;
  1616. return (*v)[idx];
  1617. }
  1618. } else if (p_index.get_type() == Variant::STRING) {
  1619. //scalar name
  1620. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1621. const Vector3 *v = reinterpret_cast<const Vector3 *>(_data._mem);
  1622. if (*str == "x") {
  1623. valid = true;
  1624. return v->x;
  1625. } else if (*str == "y") {
  1626. valid = true;
  1627. return v->y;
  1628. } else if (*str == "z") {
  1629. valid = true;
  1630. return v->z;
  1631. }
  1632. }
  1633. } break;
  1634. case TRANSFORM2D: {
  1635. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1636. int index = p_index;
  1637. if (index < 0)
  1638. index += 3;
  1639. if (index >= 0 && index < 3) {
  1640. const Transform2D *v = _data._transform2d;
  1641. valid = true;
  1642. return v->elements[index];
  1643. }
  1644. } else if (p_index.get_type() == Variant::STRING) {
  1645. //scalar name
  1646. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1647. const Transform2D *v = _data._transform2d;
  1648. if (*str == "x") {
  1649. valid = true;
  1650. return v->elements[0];
  1651. } else if (*str == "y") {
  1652. valid = true;
  1653. return v->elements[1];
  1654. } else if (*str == "origin") {
  1655. valid = true;
  1656. return v->elements[2];
  1657. }
  1658. }
  1659. } break;
  1660. case PLANE: {
  1661. if (p_index.get_type() == Variant::STRING) {
  1662. //scalar name
  1663. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1664. const Plane *v = reinterpret_cast<const Plane *>(_data._mem);
  1665. if (*str == "x") {
  1666. valid = true;
  1667. return v->normal.x;
  1668. } else if (*str == "y") {
  1669. valid = true;
  1670. return v->normal.y;
  1671. } else if (*str == "z") {
  1672. valid = true;
  1673. return v->normal.z;
  1674. } else if (*str == "normal") {
  1675. valid = true;
  1676. return v->normal;
  1677. } else if (*str == "d") {
  1678. valid = true;
  1679. return v->d;
  1680. }
  1681. }
  1682. } break;
  1683. case QUAT: {
  1684. if (p_index.get_type() == Variant::STRING) {
  1685. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1686. const Quat *v = reinterpret_cast<const Quat *>(_data._mem);
  1687. if (*str == "x") {
  1688. valid = true;
  1689. return v->x;
  1690. } else if (*str == "y") {
  1691. valid = true;
  1692. return v->y;
  1693. } else if (*str == "z") {
  1694. valid = true;
  1695. return v->z;
  1696. } else if (*str == "w") {
  1697. valid = true;
  1698. return v->w;
  1699. }
  1700. }
  1701. } break; // 10
  1702. case RECT3: {
  1703. if (p_index.get_type() == Variant::STRING) {
  1704. //scalar name
  1705. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1706. const Rect3 *v = _data._rect3;
  1707. if (*str == "position") {
  1708. valid = true;
  1709. return v->position;
  1710. } else if (*str == "size") {
  1711. valid = true;
  1712. return v->size;
  1713. } else if (*str == "end") {
  1714. valid = true;
  1715. return v->size + v->position;
  1716. }
  1717. }
  1718. } break;
  1719. case BASIS: {
  1720. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1721. int index = p_index;
  1722. if (index < 0)
  1723. index += 3;
  1724. if (index >= 0 && index < 3) {
  1725. const Basis *v = _data._basis;
  1726. valid = true;
  1727. return v->get_axis(index);
  1728. }
  1729. } else if (p_index.get_type() == Variant::STRING) {
  1730. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1731. const Basis *v = _data._basis;
  1732. if (*str == "x") {
  1733. valid = true;
  1734. return v->get_axis(0);
  1735. } else if (*str == "y") {
  1736. valid = true;
  1737. return v->get_axis(1);
  1738. } else if (*str == "z") {
  1739. valid = true;
  1740. return v->get_axis(2);
  1741. }
  1742. }
  1743. } break;
  1744. case TRANSFORM: {
  1745. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1746. int index = p_index;
  1747. if (index < 0)
  1748. index += 4;
  1749. if (index >= 0 && index < 4) {
  1750. const Transform *v = _data._transform;
  1751. valid = true;
  1752. return index == 3 ? v->origin : v->basis.get_axis(index);
  1753. }
  1754. } else if (p_index.get_type() == Variant::STRING) {
  1755. const Transform *v = _data._transform;
  1756. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1757. if (*str == "basis") {
  1758. valid = true;
  1759. return v->basis;
  1760. }
  1761. if (*str == "origin") {
  1762. valid = true;
  1763. return v->origin;
  1764. }
  1765. }
  1766. } break;
  1767. case COLOR: {
  1768. if (p_index.get_type() == Variant::STRING) {
  1769. const String *str = reinterpret_cast<const String *>(p_index._data._mem);
  1770. const Color *v = reinterpret_cast<const Color *>(_data._mem);
  1771. if (*str == "r") {
  1772. valid = true;
  1773. return v->r;
  1774. } else if (*str == "g") {
  1775. valid = true;
  1776. return v->g;
  1777. } else if (*str == "b") {
  1778. valid = true;
  1779. return v->b;
  1780. } else if (*str == "a") {
  1781. valid = true;
  1782. return v->a;
  1783. } else if (*str == "h") {
  1784. valid = true;
  1785. return v->get_h();
  1786. } else if (*str == "s") {
  1787. valid = true;
  1788. return v->get_s();
  1789. } else if (*str == "v") {
  1790. valid = true;
  1791. return v->get_v();
  1792. } else if (*str == "r8") {
  1793. valid = true;
  1794. return (int)Math::round(v->r * 255.0);
  1795. } else if (*str == "g8") {
  1796. valid = true;
  1797. return (int)Math::round(v->g * 255.0);
  1798. } else if (*str == "b8") {
  1799. valid = true;
  1800. return (int)Math::round(v->b * 255.0);
  1801. } else if (*str == "a8") {
  1802. valid = true;
  1803. return (int)Math::round(v->a * 255.0);
  1804. }
  1805. } else if (p_index.get_type() == Variant::INT) {
  1806. int idx = p_index;
  1807. if (idx < 0)
  1808. idx += 4;
  1809. if (idx >= 0 || idx < 4) {
  1810. const Color *v = reinterpret_cast<const Color *>(_data._mem);
  1811. valid = true;
  1812. return (*v)[idx];
  1813. }
  1814. }
  1815. } break;
  1816. case NODE_PATH: {
  1817. } break; // 15
  1818. case _RID: {
  1819. } break;
  1820. case OBJECT: {
  1821. Object *obj = _get_obj().obj;
  1822. if (obj) {
  1823. #ifdef DEBUG_ENABLED
  1824. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null()) {
  1825. //only if debugging!
  1826. if (!ObjectDB::instance_validate(obj)) {
  1827. valid = false;
  1828. return "Attempted get on stray pointer.";
  1829. }
  1830. }
  1831. #endif
  1832. if (p_index.get_type() != Variant::STRING) {
  1833. return obj->getvar(p_index, r_valid);
  1834. }
  1835. return obj->get(p_index, r_valid);
  1836. }
  1837. } break;
  1838. case DICTIONARY: {
  1839. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1840. const Variant *res = dic->getptr(p_index);
  1841. if (res) {
  1842. valid = true;
  1843. return *res;
  1844. }
  1845. } break;
  1846. DEFAULT_OP_ARRAY_CMD(ARRAY, const Array, ;, return (*arr)[index]) // 20
  1847. DEFAULT_OP_DVECTOR_GET(POOL_BYTE_ARRAY, uint8_t)
  1848. DEFAULT_OP_DVECTOR_GET(POOL_INT_ARRAY, int)
  1849. DEFAULT_OP_DVECTOR_GET(POOL_REAL_ARRAY, real_t)
  1850. DEFAULT_OP_DVECTOR_GET(POOL_STRING_ARRAY, String)
  1851. DEFAULT_OP_DVECTOR_GET(POOL_VECTOR2_ARRAY, Vector2) // 25
  1852. DEFAULT_OP_DVECTOR_GET(POOL_VECTOR3_ARRAY, Vector3)
  1853. DEFAULT_OP_DVECTOR_GET(POOL_COLOR_ARRAY, Color)
  1854. default:
  1855. return Variant();
  1856. }
  1857. return Variant();
  1858. }
  1859. bool Variant::in(const Variant &p_index, bool *r_valid) const {
  1860. if (r_valid)
  1861. *r_valid = true;
  1862. switch (type) {
  1863. case STRING: {
  1864. if (p_index.get_type() == Variant::STRING) {
  1865. //string index
  1866. String idx = p_index;
  1867. const String *str = reinterpret_cast<const String *>(_data._mem);
  1868. return str->find(idx) != -1;
  1869. }
  1870. } break;
  1871. case OBJECT: {
  1872. Object *obj = _get_obj().obj;
  1873. if (obj) {
  1874. bool valid = false;
  1875. #ifdef DEBUG_ENABLED
  1876. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null()) {
  1877. //only if debugging!
  1878. if (!ObjectDB::instance_validate(obj)) {
  1879. if (r_valid) {
  1880. *r_valid = false;
  1881. }
  1882. return "Attempted get on stray pointer.";
  1883. }
  1884. }
  1885. #endif
  1886. if (p_index.get_type() != Variant::STRING) {
  1887. obj->getvar(p_index, &valid);
  1888. } else {
  1889. obj->get(p_index, &valid);
  1890. }
  1891. return valid;
  1892. } else {
  1893. if (r_valid)
  1894. *r_valid = false;
  1895. }
  1896. return false;
  1897. } break;
  1898. case DICTIONARY: {
  1899. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  1900. return dic->has(p_index);
  1901. } break; // 20
  1902. case ARRAY: {
  1903. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  1904. int l = arr->size();
  1905. if (l) {
  1906. for (int i = 0; i < l; i++) {
  1907. if (evaluate(OP_EQUAL, (*arr)[i], p_index))
  1908. return true;
  1909. }
  1910. }
  1911. return false;
  1912. } break;
  1913. case POOL_BYTE_ARRAY: {
  1914. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1915. int index = p_index;
  1916. const PoolVector<uint8_t> *arr = reinterpret_cast<const PoolVector<uint8_t> *>(_data._mem);
  1917. int l = arr->size();
  1918. if (l) {
  1919. PoolVector<uint8_t>::Read r = arr->read();
  1920. for (int i = 0; i < l; i++) {
  1921. if (r[i] == index)
  1922. return true;
  1923. }
  1924. }
  1925. return false;
  1926. }
  1927. } break;
  1928. case POOL_INT_ARRAY: {
  1929. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1930. int index = p_index;
  1931. const PoolVector<int> *arr = reinterpret_cast<const PoolVector<int> *>(_data._mem);
  1932. int l = arr->size();
  1933. if (l) {
  1934. PoolVector<int>::Read r = arr->read();
  1935. for (int i = 0; i < l; i++) {
  1936. if (r[i] == index)
  1937. return true;
  1938. }
  1939. }
  1940. return false;
  1941. }
  1942. } break;
  1943. case POOL_REAL_ARRAY: {
  1944. if (p_index.get_type() == Variant::INT || p_index.get_type() == Variant::REAL) {
  1945. real_t index = p_index;
  1946. const PoolVector<real_t> *arr = reinterpret_cast<const PoolVector<real_t> *>(_data._mem);
  1947. int l = arr->size();
  1948. if (l) {
  1949. PoolVector<real_t>::Read r = arr->read();
  1950. for (int i = 0; i < l; i++) {
  1951. if (r[i] == index)
  1952. return true;
  1953. }
  1954. }
  1955. return false;
  1956. }
  1957. } break;
  1958. case POOL_STRING_ARRAY: {
  1959. if (p_index.get_type() == Variant::STRING) {
  1960. String index = p_index;
  1961. const PoolVector<String> *arr = reinterpret_cast<const PoolVector<String> *>(_data._mem);
  1962. int l = arr->size();
  1963. if (l) {
  1964. PoolVector<String>::Read r = arr->read();
  1965. for (int i = 0; i < l; i++) {
  1966. if (r[i] == index)
  1967. return true;
  1968. }
  1969. }
  1970. return false;
  1971. }
  1972. } break; //25
  1973. case POOL_VECTOR2_ARRAY: {
  1974. if (p_index.get_type() == Variant::VECTOR2) {
  1975. Vector2 index = p_index;
  1976. const PoolVector<Vector2> *arr = reinterpret_cast<const PoolVector<Vector2> *>(_data._mem);
  1977. int l = arr->size();
  1978. if (l) {
  1979. PoolVector<Vector2>::Read r = arr->read();
  1980. for (int i = 0; i < l; i++) {
  1981. if (r[i] == index)
  1982. return true;
  1983. }
  1984. }
  1985. return false;
  1986. }
  1987. } break;
  1988. case POOL_VECTOR3_ARRAY: {
  1989. if (p_index.get_type() == Variant::VECTOR3) {
  1990. Vector3 index = p_index;
  1991. const PoolVector<Vector3> *arr = reinterpret_cast<const PoolVector<Vector3> *>(_data._mem);
  1992. int l = arr->size();
  1993. if (l) {
  1994. PoolVector<Vector3>::Read r = arr->read();
  1995. for (int i = 0; i < l; i++) {
  1996. if (r[i] == index)
  1997. return true;
  1998. }
  1999. }
  2000. return false;
  2001. }
  2002. } break;
  2003. case POOL_COLOR_ARRAY: {
  2004. if (p_index.get_type() == Variant::COLOR) {
  2005. Color index = p_index;
  2006. const PoolVector<Color> *arr = reinterpret_cast<const PoolVector<Color> *>(_data._mem);
  2007. int l = arr->size();
  2008. if (l) {
  2009. PoolVector<Color>::Read r = arr->read();
  2010. for (int i = 0; i < l; i++) {
  2011. if (r[i] == index)
  2012. return true;
  2013. }
  2014. }
  2015. return false;
  2016. }
  2017. } break;
  2018. default: {}
  2019. }
  2020. if (r_valid)
  2021. *r_valid = false;
  2022. return false;
  2023. }
  2024. void Variant::get_property_list(List<PropertyInfo> *p_list) const {
  2025. switch (type) {
  2026. case VECTOR2: {
  2027. p_list->push_back(PropertyInfo(Variant::REAL, "x"));
  2028. p_list->push_back(PropertyInfo(Variant::REAL, "y"));
  2029. } break; // 5
  2030. case RECT2: {
  2031. p_list->push_back(PropertyInfo(Variant::VECTOR2, "position"));
  2032. p_list->push_back(PropertyInfo(Variant::VECTOR2, "size"));
  2033. p_list->push_back(PropertyInfo(Variant::VECTOR2, "end"));
  2034. } break;
  2035. case VECTOR3: {
  2036. p_list->push_back(PropertyInfo(Variant::REAL, "x"));
  2037. p_list->push_back(PropertyInfo(Variant::REAL, "y"));
  2038. p_list->push_back(PropertyInfo(Variant::REAL, "z"));
  2039. } break;
  2040. case TRANSFORM2D: {
  2041. p_list->push_back(PropertyInfo(Variant::VECTOR2, "x"));
  2042. p_list->push_back(PropertyInfo(Variant::VECTOR2, "y"));
  2043. p_list->push_back(PropertyInfo(Variant::VECTOR2, "origin"));
  2044. } break;
  2045. case PLANE: {
  2046. p_list->push_back(PropertyInfo(Variant::VECTOR3, "normal"));
  2047. p_list->push_back(PropertyInfo(Variant::REAL, "x"));
  2048. p_list->push_back(PropertyInfo(Variant::REAL, "y"));
  2049. p_list->push_back(PropertyInfo(Variant::REAL, "z"));
  2050. p_list->push_back(PropertyInfo(Variant::REAL, "d"));
  2051. } break;
  2052. case QUAT: {
  2053. p_list->push_back(PropertyInfo(Variant::REAL, "x"));
  2054. p_list->push_back(PropertyInfo(Variant::REAL, "y"));
  2055. p_list->push_back(PropertyInfo(Variant::REAL, "z"));
  2056. p_list->push_back(PropertyInfo(Variant::REAL, "w"));
  2057. } break; // 10
  2058. case RECT3: {
  2059. p_list->push_back(PropertyInfo(Variant::VECTOR3, "position"));
  2060. p_list->push_back(PropertyInfo(Variant::VECTOR3, "size"));
  2061. p_list->push_back(PropertyInfo(Variant::VECTOR3, "end"));
  2062. } break;
  2063. case BASIS: {
  2064. p_list->push_back(PropertyInfo(Variant::VECTOR3, "x"));
  2065. p_list->push_back(PropertyInfo(Variant::VECTOR3, "y"));
  2066. p_list->push_back(PropertyInfo(Variant::VECTOR3, "z"));
  2067. } break;
  2068. case TRANSFORM: {
  2069. p_list->push_back(PropertyInfo(Variant::BASIS, "basis"));
  2070. p_list->push_back(PropertyInfo(Variant::VECTOR3, "origin"));
  2071. } break;
  2072. case COLOR: {
  2073. p_list->push_back(PropertyInfo(Variant::REAL, "r"));
  2074. p_list->push_back(PropertyInfo(Variant::REAL, "g"));
  2075. p_list->push_back(PropertyInfo(Variant::REAL, "b"));
  2076. p_list->push_back(PropertyInfo(Variant::REAL, "a"));
  2077. p_list->push_back(PropertyInfo(Variant::REAL, "h"));
  2078. p_list->push_back(PropertyInfo(Variant::REAL, "s"));
  2079. p_list->push_back(PropertyInfo(Variant::REAL, "v"));
  2080. p_list->push_back(PropertyInfo(Variant::INT, "r8"));
  2081. p_list->push_back(PropertyInfo(Variant::INT, "g8"));
  2082. p_list->push_back(PropertyInfo(Variant::INT, "b8"));
  2083. p_list->push_back(PropertyInfo(Variant::INT, "a8"));
  2084. } break;
  2085. case NODE_PATH: {
  2086. } break; // 15
  2087. case _RID: {
  2088. } break;
  2089. case OBJECT: {
  2090. Object *obj = _get_obj().obj;
  2091. if (obj) {
  2092. #ifdef DEBUG_ENABLED
  2093. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null()) {
  2094. //only if debugging!
  2095. if (!ObjectDB::instance_validate(obj)) {
  2096. WARN_PRINT("Attempted get_property list on stray pointer.");
  2097. return;
  2098. }
  2099. }
  2100. #endif
  2101. obj->get_property_list(p_list);
  2102. }
  2103. } break;
  2104. case DICTIONARY: {
  2105. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  2106. List<Variant> keys;
  2107. dic->get_key_list(&keys);
  2108. for (List<Variant>::Element *E = keys.front(); E; E = E->next()) {
  2109. if (E->get().get_type() == Variant::STRING) {
  2110. p_list->push_back(PropertyInfo(Variant::STRING, E->get()));
  2111. }
  2112. }
  2113. } break;
  2114. case ARRAY: // 20
  2115. case POOL_BYTE_ARRAY:
  2116. case POOL_INT_ARRAY:
  2117. case POOL_REAL_ARRAY:
  2118. case POOL_STRING_ARRAY:
  2119. case POOL_VECTOR2_ARRAY: // 25
  2120. case POOL_VECTOR3_ARRAY:
  2121. case POOL_COLOR_ARRAY: {
  2122. //nothing
  2123. } break;
  2124. default: {}
  2125. }
  2126. }
  2127. bool Variant::iter_init(Variant &r_iter, bool &valid) const {
  2128. valid = true;
  2129. switch (type) {
  2130. case INT: {
  2131. r_iter = 0;
  2132. return _data._int > 0;
  2133. } break;
  2134. case REAL: {
  2135. r_iter = 0;
  2136. return _data._real > 0.0;
  2137. } break;
  2138. case VECTOR2: {
  2139. int64_t from = reinterpret_cast<const Vector2 *>(_data._mem)->x;
  2140. int64_t to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  2141. r_iter = from;
  2142. return from < to;
  2143. } break;
  2144. case VECTOR3: {
  2145. int64_t from = reinterpret_cast<const Vector3 *>(_data._mem)->x;
  2146. int64_t to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  2147. int64_t step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  2148. r_iter = from;
  2149. if (from == to) {
  2150. return false;
  2151. } else if (from < to) {
  2152. return step > 0;
  2153. } else {
  2154. return step < 0;
  2155. }
  2156. //return true;
  2157. } break;
  2158. case OBJECT: {
  2159. #ifdef DEBUG_ENABLED
  2160. if (!_get_obj().obj) {
  2161. valid = false;
  2162. return false;
  2163. }
  2164. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null() && !ObjectDB::instance_validate(_get_obj().obj)) {
  2165. valid = false;
  2166. return false;
  2167. }
  2168. #endif
  2169. Variant::CallError ce;
  2170. ce.error = Variant::CallError::CALL_OK;
  2171. Array ref;
  2172. ref.push_back(r_iter);
  2173. Variant vref = ref;
  2174. const Variant *refp[] = { &vref };
  2175. Variant ret = _get_obj().obj->call(CoreStringNames::get_singleton()->_iter_init, refp, 1, ce);
  2176. if (ref.size() != 1 || ce.error != Variant::CallError::CALL_OK) {
  2177. valid = false;
  2178. return false;
  2179. }
  2180. r_iter = ref[0];
  2181. return ret;
  2182. } break;
  2183. case STRING: {
  2184. const String *str = reinterpret_cast<const String *>(_data._mem);
  2185. if (str->empty())
  2186. return false;
  2187. r_iter = 0;
  2188. return true;
  2189. } break;
  2190. case DICTIONARY: {
  2191. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  2192. if (dic->empty())
  2193. return false;
  2194. const Variant *next = dic->next(NULL);
  2195. r_iter = *next;
  2196. return true;
  2197. } break;
  2198. case ARRAY: {
  2199. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  2200. if (arr->empty())
  2201. return false;
  2202. r_iter = 0;
  2203. return true;
  2204. } break;
  2205. case POOL_BYTE_ARRAY: {
  2206. const PoolVector<uint8_t> *arr = reinterpret_cast<const PoolVector<uint8_t> *>(_data._mem);
  2207. if (arr->size() == 0)
  2208. return false;
  2209. r_iter = 0;
  2210. return true;
  2211. } break;
  2212. case POOL_INT_ARRAY: {
  2213. const PoolVector<int> *arr = reinterpret_cast<const PoolVector<int> *>(_data._mem);
  2214. if (arr->size() == 0)
  2215. return false;
  2216. r_iter = 0;
  2217. return true;
  2218. } break;
  2219. case POOL_REAL_ARRAY: {
  2220. const PoolVector<real_t> *arr = reinterpret_cast<const PoolVector<real_t> *>(_data._mem);
  2221. if (arr->size() == 0)
  2222. return false;
  2223. r_iter = 0;
  2224. return true;
  2225. } break;
  2226. case POOL_STRING_ARRAY: {
  2227. const PoolVector<String> *arr = reinterpret_cast<const PoolVector<String> *>(_data._mem);
  2228. if (arr->size() == 0)
  2229. return false;
  2230. r_iter = 0;
  2231. return true;
  2232. } break;
  2233. case POOL_VECTOR2_ARRAY: {
  2234. const PoolVector<Vector2> *arr = reinterpret_cast<const PoolVector<Vector2> *>(_data._mem);
  2235. if (arr->size() == 0)
  2236. return false;
  2237. r_iter = 0;
  2238. return true;
  2239. } break;
  2240. case POOL_VECTOR3_ARRAY: {
  2241. const PoolVector<Vector3> *arr = reinterpret_cast<const PoolVector<Vector3> *>(_data._mem);
  2242. if (arr->size() == 0)
  2243. return false;
  2244. r_iter = 0;
  2245. return true;
  2246. } break;
  2247. case POOL_COLOR_ARRAY: {
  2248. const PoolVector<Color> *arr = reinterpret_cast<const PoolVector<Color> *>(_data._mem);
  2249. if (arr->size() == 0)
  2250. return false;
  2251. r_iter = 0;
  2252. return true;
  2253. } break;
  2254. default: {
  2255. }
  2256. }
  2257. valid = false;
  2258. return false;
  2259. }
  2260. bool Variant::iter_next(Variant &r_iter, bool &valid) const {
  2261. valid = true;
  2262. switch (type) {
  2263. case INT: {
  2264. int64_t idx = r_iter;
  2265. idx++;
  2266. if (idx >= _data._int)
  2267. return false;
  2268. r_iter = idx;
  2269. return true;
  2270. } break;
  2271. case REAL: {
  2272. int64_t idx = r_iter;
  2273. idx++;
  2274. if (idx >= _data._real)
  2275. return false;
  2276. r_iter = idx;
  2277. return true;
  2278. } break;
  2279. case VECTOR2: {
  2280. int64_t to = reinterpret_cast<const Vector2 *>(_data._mem)->y;
  2281. int64_t idx = r_iter;
  2282. idx++;
  2283. if (idx >= to)
  2284. return false;
  2285. r_iter = idx;
  2286. return true;
  2287. } break;
  2288. case VECTOR3: {
  2289. int64_t to = reinterpret_cast<const Vector3 *>(_data._mem)->y;
  2290. int64_t step = reinterpret_cast<const Vector3 *>(_data._mem)->z;
  2291. int64_t idx = r_iter;
  2292. idx += step;
  2293. if (step < 0 && idx <= to)
  2294. return false;
  2295. if (step > 0 && idx >= to)
  2296. return false;
  2297. r_iter = idx;
  2298. return true;
  2299. } break;
  2300. case OBJECT: {
  2301. #ifdef DEBUG_ENABLED
  2302. if (!_get_obj().obj) {
  2303. valid = false;
  2304. return false;
  2305. }
  2306. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null() && !ObjectDB::instance_validate(_get_obj().obj)) {
  2307. valid = false;
  2308. return false;
  2309. }
  2310. #endif
  2311. Variant::CallError ce;
  2312. ce.error = Variant::CallError::CALL_OK;
  2313. Array ref;
  2314. ref.push_back(r_iter);
  2315. Variant vref = ref;
  2316. const Variant *refp[] = { &vref };
  2317. Variant ret = _get_obj().obj->call(CoreStringNames::get_singleton()->_iter_next, refp, 1, ce);
  2318. if (ref.size() != 1 || ce.error != Variant::CallError::CALL_OK) {
  2319. valid = false;
  2320. return false;
  2321. }
  2322. r_iter = ref[0];
  2323. return ret;
  2324. } break;
  2325. case STRING: {
  2326. const String *str = reinterpret_cast<const String *>(_data._mem);
  2327. int idx = r_iter;
  2328. idx++;
  2329. if (idx >= str->length())
  2330. return false;
  2331. r_iter = idx;
  2332. return true;
  2333. } break;
  2334. case DICTIONARY: {
  2335. const Dictionary *dic = reinterpret_cast<const Dictionary *>(_data._mem);
  2336. const Variant *next = dic->next(&r_iter);
  2337. if (!next)
  2338. return false;
  2339. r_iter = *next;
  2340. return true;
  2341. } break;
  2342. case ARRAY: {
  2343. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  2344. int idx = r_iter;
  2345. idx++;
  2346. if (idx >= arr->size())
  2347. return false;
  2348. r_iter = idx;
  2349. return true;
  2350. } break;
  2351. case POOL_BYTE_ARRAY: {
  2352. const PoolVector<uint8_t> *arr = reinterpret_cast<const PoolVector<uint8_t> *>(_data._mem);
  2353. int idx = r_iter;
  2354. idx++;
  2355. if (idx >= arr->size())
  2356. return false;
  2357. r_iter = idx;
  2358. return true;
  2359. } break;
  2360. case POOL_INT_ARRAY: {
  2361. const PoolVector<int> *arr = reinterpret_cast<const PoolVector<int> *>(_data._mem);
  2362. int idx = r_iter;
  2363. idx++;
  2364. if (idx >= arr->size())
  2365. return false;
  2366. r_iter = idx;
  2367. return true;
  2368. } break;
  2369. case POOL_REAL_ARRAY: {
  2370. const PoolVector<real_t> *arr = reinterpret_cast<const PoolVector<real_t> *>(_data._mem);
  2371. int idx = r_iter;
  2372. idx++;
  2373. if (idx >= arr->size())
  2374. return false;
  2375. r_iter = idx;
  2376. return true;
  2377. } break;
  2378. case POOL_STRING_ARRAY: {
  2379. const PoolVector<String> *arr = reinterpret_cast<const PoolVector<String> *>(_data._mem);
  2380. int idx = r_iter;
  2381. idx++;
  2382. if (idx >= arr->size())
  2383. return false;
  2384. r_iter = idx;
  2385. return true;
  2386. } break;
  2387. case POOL_VECTOR2_ARRAY: {
  2388. const PoolVector<Vector2> *arr = reinterpret_cast<const PoolVector<Vector2> *>(_data._mem);
  2389. int idx = r_iter;
  2390. idx++;
  2391. if (idx >= arr->size())
  2392. return false;
  2393. r_iter = idx;
  2394. return true;
  2395. } break;
  2396. case POOL_VECTOR3_ARRAY: {
  2397. const PoolVector<Vector3> *arr = reinterpret_cast<const PoolVector<Vector3> *>(_data._mem);
  2398. int idx = r_iter;
  2399. idx++;
  2400. if (idx >= arr->size())
  2401. return false;
  2402. r_iter = idx;
  2403. return true;
  2404. } break;
  2405. case POOL_COLOR_ARRAY: {
  2406. const PoolVector<Color> *arr = reinterpret_cast<const PoolVector<Color> *>(_data._mem);
  2407. int idx = r_iter;
  2408. idx++;
  2409. if (idx >= arr->size())
  2410. return false;
  2411. r_iter = idx;
  2412. return true;
  2413. } break;
  2414. default: {}
  2415. }
  2416. valid = false;
  2417. return false;
  2418. }
  2419. Variant Variant::iter_get(const Variant &r_iter, bool &r_valid) const {
  2420. r_valid = true;
  2421. switch (type) {
  2422. case INT: {
  2423. return r_iter;
  2424. } break;
  2425. case REAL: {
  2426. return r_iter;
  2427. } break;
  2428. case VECTOR2: {
  2429. return r_iter;
  2430. } break;
  2431. case VECTOR3: {
  2432. return r_iter;
  2433. } break;
  2434. case OBJECT: {
  2435. #ifdef DEBUG_ENABLED
  2436. if (!_get_obj().obj) {
  2437. r_valid = false;
  2438. return Variant();
  2439. }
  2440. if (ScriptDebugger::get_singleton() && _get_obj().ref.is_null() && !ObjectDB::instance_validate(_get_obj().obj)) {
  2441. r_valid = false;
  2442. return Variant();
  2443. }
  2444. #endif
  2445. Variant::CallError ce;
  2446. ce.error = Variant::CallError::CALL_OK;
  2447. const Variant *refp[] = { &r_iter };
  2448. Variant ret = _get_obj().obj->call(CoreStringNames::get_singleton()->_iter_get, refp, 1, ce);
  2449. if (ce.error != Variant::CallError::CALL_OK) {
  2450. r_valid = false;
  2451. return Variant();
  2452. }
  2453. //r_iter=ref[0];
  2454. return ret;
  2455. } break;
  2456. case STRING: {
  2457. const String *str = reinterpret_cast<const String *>(_data._mem);
  2458. return str->substr(r_iter, 1);
  2459. } break;
  2460. case DICTIONARY: {
  2461. return r_iter; //iterator is the same as the key
  2462. } break;
  2463. case ARRAY: {
  2464. const Array *arr = reinterpret_cast<const Array *>(_data._mem);
  2465. int idx = r_iter;
  2466. #ifdef DEBUG_ENABLED
  2467. if (idx < 0 || idx >= arr->size()) {
  2468. r_valid = false;
  2469. return Variant();
  2470. }
  2471. #endif
  2472. return arr->get(idx);
  2473. } break;
  2474. case POOL_BYTE_ARRAY: {
  2475. const PoolVector<uint8_t> *arr = reinterpret_cast<const PoolVector<uint8_t> *>(_data._mem);
  2476. int idx = r_iter;
  2477. #ifdef DEBUG_ENABLED
  2478. if (idx < 0 || idx >= arr->size()) {
  2479. r_valid = false;
  2480. return Variant();
  2481. }
  2482. #endif
  2483. return arr->get(idx);
  2484. } break;
  2485. case POOL_INT_ARRAY: {
  2486. const PoolVector<int> *arr = reinterpret_cast<const PoolVector<int> *>(_data._mem);
  2487. int idx = r_iter;
  2488. #ifdef DEBUG_ENABLED
  2489. if (idx < 0 || idx >= arr->size()) {
  2490. r_valid = false;
  2491. return Variant();
  2492. }
  2493. #endif
  2494. return arr->get(idx);
  2495. } break;
  2496. case POOL_REAL_ARRAY: {
  2497. const PoolVector<real_t> *arr = reinterpret_cast<const PoolVector<real_t> *>(_data._mem);
  2498. int idx = r_iter;
  2499. #ifdef DEBUG_ENABLED
  2500. if (idx < 0 || idx >= arr->size()) {
  2501. r_valid = false;
  2502. return Variant();
  2503. }
  2504. #endif
  2505. return arr->get(idx);
  2506. } break;
  2507. case POOL_STRING_ARRAY: {
  2508. const PoolVector<String> *arr = reinterpret_cast<const PoolVector<String> *>(_data._mem);
  2509. int idx = r_iter;
  2510. #ifdef DEBUG_ENABLED
  2511. if (idx < 0 || idx >= arr->size()) {
  2512. r_valid = false;
  2513. return Variant();
  2514. }
  2515. #endif
  2516. return arr->get(idx);
  2517. } break;
  2518. case POOL_VECTOR2_ARRAY: {
  2519. const PoolVector<Vector2> *arr = reinterpret_cast<const PoolVector<Vector2> *>(_data._mem);
  2520. int idx = r_iter;
  2521. #ifdef DEBUG_ENABLED
  2522. if (idx < 0 || idx >= arr->size()) {
  2523. r_valid = false;
  2524. return Variant();
  2525. }
  2526. #endif
  2527. return arr->get(idx);
  2528. } break;
  2529. case POOL_VECTOR3_ARRAY: {
  2530. const PoolVector<Vector3> *arr = reinterpret_cast<const PoolVector<Vector3> *>(_data._mem);
  2531. int idx = r_iter;
  2532. #ifdef DEBUG_ENABLED
  2533. if (idx < 0 || idx >= arr->size()) {
  2534. r_valid = false;
  2535. return Variant();
  2536. }
  2537. #endif
  2538. return arr->get(idx);
  2539. } break;
  2540. case POOL_COLOR_ARRAY: {
  2541. const PoolVector<Color> *arr = reinterpret_cast<const PoolVector<Color> *>(_data._mem);
  2542. int idx = r_iter;
  2543. #ifdef DEBUG_ENABLED
  2544. if (idx < 0 || idx >= arr->size()) {
  2545. r_valid = false;
  2546. return Variant();
  2547. }
  2548. #endif
  2549. return arr->get(idx);
  2550. } break;
  2551. default: {}
  2552. }
  2553. r_valid = false;
  2554. return Variant();
  2555. }
  2556. void Variant::blend(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  2557. if (a.type != b.type) {
  2558. if (a.is_num() && b.is_num()) {
  2559. real_t va = a;
  2560. real_t vb = b;
  2561. r_dst = va + vb * c;
  2562. } else {
  2563. r_dst = a;
  2564. }
  2565. return;
  2566. }
  2567. switch (a.type) {
  2568. case NIL: {
  2569. r_dst = Variant();
  2570. }
  2571. return;
  2572. case INT: {
  2573. int64_t va = a._data._int;
  2574. int64_t vb = b._data._int;
  2575. r_dst = int(va + vb * c + 0.5);
  2576. }
  2577. return;
  2578. case REAL: {
  2579. double ra = a._data._real;
  2580. double rb = b._data._real;
  2581. r_dst = ra + rb * c;
  2582. }
  2583. return;
  2584. case VECTOR2: {
  2585. r_dst = *reinterpret_cast<const Vector2 *>(a._data._mem) + *reinterpret_cast<const Vector2 *>(b._data._mem) * c;
  2586. }
  2587. return;
  2588. case RECT2: {
  2589. const Rect2 *ra = reinterpret_cast<const Rect2 *>(a._data._mem);
  2590. const Rect2 *rb = reinterpret_cast<const Rect2 *>(b._data._mem);
  2591. r_dst = Rect2(ra->position + rb->position * c, ra->size + rb->size * c);
  2592. }
  2593. return;
  2594. case VECTOR3: {
  2595. r_dst = *reinterpret_cast<const Vector3 *>(a._data._mem) + *reinterpret_cast<const Vector3 *>(b._data._mem) * c;
  2596. }
  2597. return;
  2598. case RECT3: {
  2599. const Rect3 *ra = reinterpret_cast<const Rect3 *>(a._data._mem);
  2600. const Rect3 *rb = reinterpret_cast<const Rect3 *>(b._data._mem);
  2601. r_dst = Rect3(ra->position + rb->position * c, ra->size + rb->size * c);
  2602. }
  2603. return;
  2604. case QUAT: {
  2605. Quat empty_rot;
  2606. const Quat *qa = reinterpret_cast<const Quat *>(a._data._mem);
  2607. const Quat *qb = reinterpret_cast<const Quat *>(b._data._mem);
  2608. r_dst = *qa * empty_rot.slerp(*qb, c);
  2609. }
  2610. return;
  2611. case COLOR: {
  2612. const Color *ca = reinterpret_cast<const Color *>(a._data._mem);
  2613. const Color *cb = reinterpret_cast<const Color *>(b._data._mem);
  2614. float r = ca->r + cb->r * c;
  2615. float g = ca->g + cb->g * c;
  2616. float b = ca->b + cb->b * c;
  2617. float a = ca->a + cb->a * c;
  2618. r = r > 1.0 ? 1.0 : r;
  2619. g = g > 1.0 ? 1.0 : g;
  2620. b = b > 1.0 ? 1.0 : b;
  2621. a = a > 1.0 ? 1.0 : a;
  2622. r_dst = Color(r, g, b, a);
  2623. }
  2624. return;
  2625. default: {
  2626. r_dst = c < 0.5 ? a : b;
  2627. }
  2628. return;
  2629. }
  2630. }
  2631. void Variant::interpolate(const Variant &a, const Variant &b, float c, Variant &r_dst) {
  2632. if (a.type != b.type) {
  2633. if (a.is_num() && b.is_num()) {
  2634. //not as efficient but..
  2635. real_t va = a;
  2636. real_t vb = b;
  2637. r_dst = (1.0 - c) * va + vb * c;
  2638. } else {
  2639. r_dst = a;
  2640. }
  2641. return;
  2642. }
  2643. switch (a.type) {
  2644. case NIL: {
  2645. r_dst = Variant();
  2646. }
  2647. return;
  2648. case BOOL: {
  2649. r_dst = a;
  2650. }
  2651. return;
  2652. case INT: {
  2653. int64_t va = a._data._int;
  2654. int64_t vb = b._data._int;
  2655. r_dst = int((1.0 - c) * va + vb * c);
  2656. }
  2657. return;
  2658. case REAL: {
  2659. real_t va = a._data._real;
  2660. real_t vb = b._data._real;
  2661. r_dst = (1.0 - c) * va + vb * c;
  2662. }
  2663. return;
  2664. case STRING: {
  2665. //this is pretty funny and bizarre, but artists like to use it for typewritter effects
  2666. String sa = *reinterpret_cast<const String *>(a._data._mem);
  2667. String sb = *reinterpret_cast<const String *>(b._data._mem);
  2668. String dst;
  2669. int csize = sb.length() * c + sa.length() * (1.0 - c);
  2670. if (csize == 0) {
  2671. r_dst = "";
  2672. return;
  2673. }
  2674. dst.resize(csize + 1);
  2675. dst[csize] = 0;
  2676. int split = csize / 2;
  2677. for (int i = 0; i < csize; i++) {
  2678. CharType chr = ' ';
  2679. if (i < split) {
  2680. if (i < sa.length())
  2681. chr = sa[i];
  2682. else if (i < sb.length())
  2683. chr = sb[i];
  2684. } else {
  2685. if (i < sb.length())
  2686. chr = sb[i];
  2687. else if (i < sa.length())
  2688. chr = sa[i];
  2689. }
  2690. dst[i] = chr;
  2691. }
  2692. r_dst = dst;
  2693. }
  2694. return;
  2695. case VECTOR2: {
  2696. r_dst = reinterpret_cast<const Vector2 *>(a._data._mem)->linear_interpolate(*reinterpret_cast<const Vector2 *>(b._data._mem), c);
  2697. }
  2698. return;
  2699. case RECT2: {
  2700. r_dst = Rect2(reinterpret_cast<const Rect2 *>(a._data._mem)->position.linear_interpolate(reinterpret_cast<const Rect2 *>(b._data._mem)->position, c), reinterpret_cast<const Rect2 *>(a._data._mem)->size.linear_interpolate(reinterpret_cast<const Rect2 *>(b._data._mem)->size, c));
  2701. }
  2702. return;
  2703. case VECTOR3: {
  2704. r_dst = reinterpret_cast<const Vector3 *>(a._data._mem)->linear_interpolate(*reinterpret_cast<const Vector3 *>(b._data._mem), c);
  2705. }
  2706. return;
  2707. case TRANSFORM2D: {
  2708. r_dst = a._data._transform2d->interpolate_with(*b._data._transform2d, c);
  2709. }
  2710. return;
  2711. case PLANE: {
  2712. r_dst = a;
  2713. }
  2714. return;
  2715. case QUAT: {
  2716. r_dst = reinterpret_cast<const Quat *>(a._data._mem)->slerp(*reinterpret_cast<const Quat *>(b._data._mem), c);
  2717. }
  2718. return;
  2719. case RECT3: {
  2720. r_dst = Rect3(a._data._rect3->position.linear_interpolate(b._data._rect3->position, c), a._data._rect3->size.linear_interpolate(b._data._rect3->size, c));
  2721. }
  2722. return;
  2723. case BASIS: {
  2724. r_dst = Transform(*a._data._basis).interpolate_with(Transform(*b._data._basis), c).basis;
  2725. }
  2726. return;
  2727. case TRANSFORM: {
  2728. r_dst = a._data._transform->interpolate_with(*b._data._transform, c);
  2729. }
  2730. return;
  2731. case COLOR: {
  2732. r_dst = reinterpret_cast<const Color *>(a._data._mem)->linear_interpolate(*reinterpret_cast<const Color *>(b._data._mem), c);
  2733. }
  2734. return;
  2735. case NODE_PATH: {
  2736. r_dst = a;
  2737. }
  2738. return;
  2739. case _RID: {
  2740. r_dst = a;
  2741. }
  2742. return;
  2743. case OBJECT: {
  2744. r_dst = a;
  2745. }
  2746. return;
  2747. case DICTIONARY: {
  2748. }
  2749. return;
  2750. case ARRAY: {
  2751. r_dst = a;
  2752. }
  2753. return;
  2754. case POOL_BYTE_ARRAY: {
  2755. r_dst = a;
  2756. }
  2757. return;
  2758. case POOL_INT_ARRAY: {
  2759. r_dst = a;
  2760. }
  2761. return;
  2762. case POOL_REAL_ARRAY: {
  2763. r_dst = a;
  2764. }
  2765. return;
  2766. case POOL_STRING_ARRAY: {
  2767. r_dst = a;
  2768. }
  2769. return;
  2770. case POOL_VECTOR2_ARRAY: {
  2771. const PoolVector<Vector2> *arr_a = reinterpret_cast<const PoolVector<Vector2> *>(a._data._mem);
  2772. const PoolVector<Vector2> *arr_b = reinterpret_cast<const PoolVector<Vector2> *>(b._data._mem);
  2773. int sz = arr_a->size();
  2774. if (sz == 0 || arr_b->size() != sz) {
  2775. r_dst = a;
  2776. } else {
  2777. PoolVector<Vector2> v;
  2778. v.resize(sz);
  2779. {
  2780. PoolVector<Vector2>::Write vw = v.write();
  2781. PoolVector<Vector2>::Read ar = arr_a->read();
  2782. PoolVector<Vector2>::Read br = arr_b->read();
  2783. for (int i = 0; i < sz; i++) {
  2784. vw[i] = ar[i].linear_interpolate(br[i], c);
  2785. }
  2786. }
  2787. r_dst = v;
  2788. }
  2789. }
  2790. return;
  2791. case POOL_VECTOR3_ARRAY: {
  2792. const PoolVector<Vector3> *arr_a = reinterpret_cast<const PoolVector<Vector3> *>(a._data._mem);
  2793. const PoolVector<Vector3> *arr_b = reinterpret_cast<const PoolVector<Vector3> *>(b._data._mem);
  2794. int sz = arr_a->size();
  2795. if (sz == 0 || arr_b->size() != sz) {
  2796. r_dst = a;
  2797. } else {
  2798. PoolVector<Vector3> v;
  2799. v.resize(sz);
  2800. {
  2801. PoolVector<Vector3>::Write vw = v.write();
  2802. PoolVector<Vector3>::Read ar = arr_a->read();
  2803. PoolVector<Vector3>::Read br = arr_b->read();
  2804. for (int i = 0; i < sz; i++) {
  2805. vw[i] = ar[i].linear_interpolate(br[i], c);
  2806. }
  2807. }
  2808. r_dst = v;
  2809. }
  2810. }
  2811. return;
  2812. case POOL_COLOR_ARRAY: {
  2813. r_dst = a;
  2814. }
  2815. return;
  2816. default: {
  2817. r_dst = a;
  2818. }
  2819. }
  2820. }
  2821. static const char *_op_names[Variant::OP_MAX] = {
  2822. "==",
  2823. "!=",
  2824. "<",
  2825. "<=",
  2826. ">",
  2827. ">=",
  2828. "+",
  2829. "-",
  2830. "*",
  2831. "/",
  2832. "- (negation)",
  2833. "%",
  2834. "..",
  2835. "<<",
  2836. ">>",
  2837. "&",
  2838. "|",
  2839. "^",
  2840. "~",
  2841. "and",
  2842. "or",
  2843. "xor",
  2844. "not",
  2845. "in"
  2846. };
  2847. String Variant::get_operator_name(Operator p_op) {
  2848. ERR_FAIL_INDEX_V(p_op, OP_MAX, "");
  2849. return _op_names[p_op];
  2850. }