Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
119 kB · 3787 lines
C++
at develop
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/* * Main authors: * Guido Tack <guido.tack@monash.edu> */
/* This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include <minizinc/ast.hh>#include <minizinc/astexception.hh>#include <minizinc/astiterator.hh>#include <minizinc/builtins.hh>#include <minizinc/config.hh>#include <minizinc/eval_par.hh>#include <minizinc/file_utils.hh>#include <minizinc/flat_exp.hh>#include <minizinc/flatten_internal.hh>#include <minizinc/output.hh>#include <minizinc/prettyprinter.hh>#include <minizinc/support/regex.hh>#include <minizinc/typecheck.hh>
#include <climits>#include <cmath>#include <iomanip>#include <random>#include <regex>
namespace MiniZinc {
void rb(EnvI& env, Model* m, const ASTString& id, const std::vector<Type>& t, FunctionI::builtin_e b, bool fromGlobals = false) { FunctionI* fi = m->matchFn(env, id, t, false); if (fi != nullptr) { fi->builtins.e = b; } else if (!fromGlobals) { std::ostringstream ss; ss << "no definition found for builtin " << id; throw InternalError(ss.str()); }}void rb(EnvI& env, Model* m, const ASTString& id, const std::vector<Type>& t, FunctionI::builtin_f b, bool fromGlobals = false) { FunctionI* fi = m->matchFn(env, id, t, false); if (fi != nullptr) { fi->builtins.f = b; } else if (!fromGlobals) { std::ostringstream ss; ss << "no definition found for builtin " << id; throw InternalError(ss.str()); }}void rb(EnvI& env, Model* m, const ASTString& id, const std::vector<Type>& t, FunctionI::builtin_i b, bool fromGlobals = false) { FunctionI* fi = m->matchFn(env, id, t, false); if (fi != nullptr) { fi->builtins.i = b; } else if (!fromGlobals) { std::ostringstream ss; ss << "no definition found for builtin " << id; throw InternalError(ss.str()); }}void rb(EnvI& env, Model* m, const ASTString& id, const std::vector<Type>& t, FunctionI::builtin_b b, bool fromGlobals = false) { FunctionI* fi = m->matchFn(env, id, t, false); if (fi != nullptr) { fi->builtins.b = b; } else if (!fromGlobals) { std::ostringstream ss; ss << "no definition found for builtin " << id; throw InternalError(ss.str()); }}void rb(EnvI& env, Model* m, const ASTString& id, const std::vector<Type>& t, FunctionI::builtin_s b, bool fromGlobals = false) { FunctionI* fi = m->matchFn(env, id, t, false); if (fi != nullptr) { fi->builtins.s = b; } else if (!fromGlobals) { std::ostringstream ss; ss << "no definition found for builtin " << id; throw InternalError(ss.str()); }}void rb(EnvI& env, Model* m, const ASTString& id, const std::vector<Type>& t, FunctionI::builtin_str b, bool fromGlobals = false) { FunctionI* fi = m->matchFn(env, id, t, false); if (fi != nullptr) { fi->builtins.str = b; } else if (!fromGlobals) { std::ostringstream ss; ss << "no definition found for builtin " << id; throw InternalError(ss.str()); }}
IntVal b_int_min(EnvI& env, Call* call) { switch (call->argCount()) { case 1: if (call->arg(0)->type().isSet()) { throw EvalError(env, call->arg(0)->loc(), "sets not supported"); } else { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "minimum of empty array is undefined"); } IntVal m = eval_int(env, (*al)[0]); for (unsigned int i = 1; i < al->size(); i++) { m = std::min(m, eval_int(env, (*al)[i])); } return m; } case 2: { return std::min(eval_int(env, call->arg(0)), eval_int(env, call->arg(1))); } default: throw EvalError(env, Location(), "dynamic type error"); }}
IntVal b_int_max(EnvI& env, Call* call) { switch (call->argCount()) { case 1: if (call->arg(0)->type().isSet()) { throw EvalError(env, call->arg(0)->loc(), "sets not supported"); } else { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "maximum of empty array is undefined"); } IntVal m = eval_int(env, (*al)[0]); for (unsigned int i = 1; i < al->size(); i++) { m = std::max(m, eval_int(env, (*al)[i])); } return m; } case 2: { return std::max(eval_int(env, call->arg(0)), eval_int(env, call->arg(1))); } default: throw EvalError(env, Location(), "dynamic type error"); }}
IntVal b_arg_min_bool(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "arg_min of empty array is undefined"); } assert(al->dims() == 1); for (unsigned int i = 0; i < al->size(); i++) { bool val = eval_bool(env, (*al)[i]); if (!val) { return IntVal(i) + al->min(0); } } return al->min(0);}IntVal b_arg_max_bool(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "arg_max of empty array is undefined"); } assert(al->dims() == 1); for (unsigned int i = 0; i < al->size(); i++) { bool val = eval_bool(env, (*al)[i]); if (val) { return IntVal(i) + al->min(0); } } return al->min(0);}IntVal b_arg_min_int(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "argmin of empty array is undefined"); } assert(al->dims() == 1); IntVal m = eval_int(env, (*al)[0]); unsigned int m_idx = 0; for (unsigned int i = 1; i < al->size(); i++) { IntVal mi = eval_int(env, (*al)[i]); if (mi < m) { m = mi; m_idx = i; } } return IntVal(m_idx) + al->min(0);}IntVal b_arg_max_int(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "argmax of empty array is undefined"); } assert(al->dims() == 1); IntVal m = eval_int(env, (*al)[0]); unsigned int m_idx = 0; for (unsigned int i = 1; i < al->size(); i++) { IntVal mi = eval_int(env, (*al)[i]); if (mi > m) { m = mi; m_idx = i; } } return IntVal(m_idx) + al->min(0);}IntVal b_arg_min_float(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "argmin of empty array is undefined"); } assert(al->dims() == 1); FloatVal m = eval_float(env, (*al)[0]); unsigned int m_idx = 0; for (unsigned int i = 1; i < al->size(); i++) { FloatVal mi = eval_float(env, (*al)[i]); if (mi < m) { m = mi; m_idx = i; } } return IntVal(m_idx) + al->min(0);}IntVal b_arg_max_float(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw ResultUndefinedError(env, al->loc(), "argmax of empty array is undefined"); } assert(al->dims() == 1); FloatVal m = eval_float(env, (*al)[0]); unsigned int m_idx = 0; for (unsigned int i = 1; i < al->size(); i++) { FloatVal mi = eval_float(env, (*al)[i]); if (mi > m) { m = mi; m_idx = i; } } return IntVal(m_idx) + al->min(0);}
IntVal b_abs_int(EnvI& env, Call* call) { assert(call->argCount() == 1); return std::abs(eval_int(env, call->arg(0)));}
FloatVal b_abs_float(EnvI& env, Call* call) { assert(call->argCount() == 1); return std::abs(eval_float(env, call->arg(0)));}
bool b_has_bounds_int(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "dynamic type error"); } IntBounds ib = compute_int_bounds(env, call->arg(0)); return ib.valid && ib.l.isFinite() && ib.u.isFinite();}bool b_has_bounds_float(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "dynamic type error"); } FloatBounds fb = compute_float_bounds(env, call->arg(0)); return fb.valid;}
IntVal lb_varoptint(EnvI& env, Expression* e) { IntBounds b = compute_int_bounds(env, e); if (b.valid) { return b.l; } return -IntVal::infinity();}IntVal b_lb_varoptint(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "dynamic type error"); } return lb_varoptint(env, call->arg(0));}
bool b_occurs(EnvI& env, Call* call) { GCLock lock; return eval_par(env, call->arg(0)) != constants().absent;}
IntVal b_deopt_int(EnvI& env, Call* call) { GCLock lock; Expression* e = eval_par(env, call->arg(0)); if (e == constants().absent) { throw EvalError(env, e->loc(), "cannot evaluate deopt on absent value"); } return eval_int(env, e);}
bool b_deopt_bool(EnvI& env, Call* call) { GCLock lock; Expression* e = eval_par(env, call->arg(0)); if (e == constants().absent) { throw EvalError(env, e->loc(), "cannot evaluate deopt on absent value"); } return eval_bool(env, e);}
FloatVal b_deopt_float(EnvI& env, Call* call) { GCLock lock; Expression* e = eval_par(env, call->arg(0)); if (e == constants().absent) { throw EvalError(env, e->loc(), "cannot evaluate deopt on absent value"); } return eval_float(env, e);}
IntSetVal* b_deopt_intset(EnvI& env, Call* call) { GCLock lock; Expression* e = eval_par(env, call->arg(0)); if (e == constants().absent) { throw EvalError(env, e->loc(), "cannot evaluate deopt on absent value"); } return eval_intset(env, e);}
std::string b_deopt_string(EnvI& env, Call* call) { GCLock lock; Expression* e = eval_par(env, call->arg(0)); if (e == constants().absent) { throw EvalError(env, e->loc(), "cannot evaluate deopt on absent value"); } return eval_string(env, e);}
Expression* b_deopt_expr(EnvI& env, Call* call) { GCLock lock; Expression* e = eval_par(env, call->arg(0)); if (e == constants().absent) { throw EvalError(env, e->loc(), "cannot evaluate deopt on absent value"); } return e;};
IntVal b_array_lb_int(EnvI& env, Call* call) { assert(call->argCount() == 1); Expression* e = follow_id_to_decl(call->arg(0));
bool foundMin = false; IntVal array_lb = -IntVal::infinity();
if (auto* vd = e->dynamicCast<VarDecl>()) { if (vd->ti()->domain() != nullptr) { GCLock lock; IntSetVal* isv = eval_intset(env, vd->ti()->domain()); if (isv->size() != 0) { array_lb = isv->min(); foundMin = true; } } e = vd->e(); }
if (e != nullptr) { GCLock lock; ArrayLit* al = eval_array_lit(env, e); if (al->size() == 0) { throw EvalError(env, Location(), "lower bound of empty array undefined"); } IntVal min = IntVal::infinity(); for (unsigned int i = 0; i < al->size(); i++) { IntBounds ib = compute_int_bounds(env, (*al)[i]); if (!ib.valid) { goto b_array_lb_int_done; } min = std::min(min, ib.l); } if (foundMin) { array_lb = std::max(array_lb, min); } else { array_lb = min; } foundMin = true; }b_array_lb_int_done: if (foundMin) { return array_lb; } else { return -IntVal::infinity(); }}
IntVal ub_varoptint(EnvI& env, Expression* e) { IntBounds b = compute_int_bounds(env, e); if (b.valid) { return b.u; } return IntVal::infinity();}IntVal b_ub_varoptint(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "dynamic type error"); } return ub_varoptint(env, call->arg(0));}
IntVal b_array_ub_int(EnvI& env, Call* call) { assert(call->argCount() == 1); Expression* e = follow_id_to_decl(call->arg(0));
bool foundMax = false; IntVal array_ub = IntVal::infinity();
if (auto* vd = e->dynamicCast<VarDecl>()) { if (vd->ti()->domain() != nullptr) { GCLock lock; IntSetVal* isv = eval_intset(env, vd->ti()->domain()); if (isv->size() != 0) { array_ub = isv->max(); foundMax = true; } } e = vd->e(); }
if (e != nullptr) { GCLock lock; ArrayLit* al = eval_array_lit(env, e); if (al->size() == 0) { throw EvalError(env, Location(), "upper bound of empty array undefined"); } IntVal max = -IntVal::infinity(); for (unsigned int i = 0; i < al->size(); i++) { IntBounds ib = compute_int_bounds(env, (*al)[i]); if (!ib.valid) { goto b_array_ub_int_done; } max = std::max(max, ib.u); } if (foundMax) { array_ub = std::min(array_ub, max); } else { array_ub = max; } foundMax = true; }b_array_ub_int_done: if (foundMax) { return array_ub; } else { return IntVal::infinity(); }}
IntVal b_idiv(EnvI& env, Call* call) { assert(call->argCount() == 2); IntVal a = eval_int(env, call->arg(0)); IntVal b = eval_int(env, call->arg(1)); if (b == 0) { throw ResultUndefinedError(env, call->loc(), "division by zero"); } return a / b;}IntVal b_mod(EnvI& env, Call* call) { assert(call->argCount() == 2); IntVal a = eval_int(env, call->arg(0)); IntVal b = eval_int(env, call->arg(1)); if (b == 0) { throw ResultUndefinedError(env, call->loc(), "division by zero"); } return a % b;}FloatVal b_fdiv(EnvI& env, Call* call) { assert(call->argCount() == 2); FloatVal a = eval_float(env, call->arg(0)); FloatVal b = eval_float(env, call->arg(1)); if (b == 0.0) { throw ResultUndefinedError(env, call->loc(), "division by zero"); } return a / b;}IntSetVal* b_dotdot(EnvI& env, Call* call) { assert(call->argCount() == 2); IntVal a = eval_int(env, call->arg(0)); IntVal b = eval_int(env, call->arg(1)); return IntSetVal::a(a, b);}
IntVal b_sum_int(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { return 0; } IntVal m = 0; for (unsigned int i = 0; i < al->size(); i++) { m += eval_int(env, (*al)[i]); } return m;}
IntVal b_product_int(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { return 1; } IntVal m = 1; for (unsigned int i = 0; i < al->size(); i++) { m *= eval_int(env, (*al)[i]); } return m;}
FloatVal b_product_float(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { return 1; } FloatVal m = 1.0; for (unsigned int i = 0; i < al->size(); i++) { m *= eval_float(env, (*al)[i]); } return m;}
FloatVal lb_varoptfloat(EnvI& env, Expression* e) { FloatBounds b = compute_float_bounds(env, e); if (b.valid) { return b.l; } throw EvalError(env, e->loc(), "cannot determine bounds");}FloatVal ub_varoptfloat(EnvI& env, Expression* e) { FloatBounds b = compute_float_bounds(env, e); if (b.valid) { return b.u; } throw EvalError(env, e->loc(), "cannot determine bounds");}
FloatVal b_lb_varoptfloat(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "dynamic type error"); } return lb_varoptfloat(env, call->arg(0));}FloatVal b_ub_varoptfloat(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "dynamic type error"); } return ub_varoptfloat(env, call->arg(0));}
FloatVal b_array_lb_float(EnvI& env, Call* call) { assert(call->argCount() == 1); Expression* e = follow_id_to_decl(call->arg(0));
bool foundMin = false; FloatVal array_lb = 0.0;
if (auto* vd = e->dynamicCast<VarDecl>()) { if (vd->ti()->domain() != nullptr) { FloatSetVal* fsv = eval_floatset(env, vd->ti()->domain()); array_lb = fsv->min(); foundMin = true; } e = vd->e(); }
if (e != nullptr) { GCLock lock; ArrayLit* al = eval_array_lit(env, e); if (al->size() == 0) { throw EvalError(env, Location(), "lower bound of empty array undefined"); } bool min_valid = false; FloatVal min = 0.0; for (unsigned int i = 0; i < al->size(); i++) { FloatBounds fb = compute_float_bounds(env, (*al)[i]); if (!fb.valid) { goto b_array_lb_float_done; } if (min_valid) { min = std::min(min, fb.l); } else { min_valid = true; min = fb.l; } } assert(min_valid); if (foundMin) { array_lb = std::max(array_lb, min); } else { array_lb = min; } foundMin = true; }b_array_lb_float_done: if (foundMin) { return array_lb; } else { throw EvalError(env, e->loc(), "cannot determine lower bound"); }}
FloatVal b_array_ub_float(EnvI& env, Call* call) { assert(call->argCount() == 1); Expression* e = follow_id_to_decl(call->arg(0));
bool foundMax = false; FloatVal array_ub = 0.0;
if (auto* vd = e->dynamicCast<VarDecl>()) { if (vd->ti()->domain() != nullptr) { FloatSetVal* fsv = eval_floatset(env, vd->ti()->domain()); array_ub = fsv->max(); foundMax = true; } e = vd->e(); }
if (e != nullptr) { GCLock lock; ArrayLit* al = eval_array_lit(env, e); if (al->size() == 0) { throw EvalError(env, Location(), "upper bound of empty array undefined"); } bool max_valid = false; FloatVal max = 0.0; for (unsigned int i = 0; i < al->size(); i++) { FloatBounds fb = compute_float_bounds(env, (*al)[i]); if (!fb.valid) { goto b_array_ub_float_done; } if (max_valid) { max = std::max(max, fb.u); } else { max_valid = true; max = fb.u; } } assert(max_valid); if (foundMax) { array_ub = std::min(array_ub, max); } else { array_ub = max; } foundMax = true; }b_array_ub_float_done: if (foundMax) { return array_ub; } else { throw EvalError(env, e->loc(), "cannot determine upper bound"); }}
FloatVal b_sum_float(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { return 0; } FloatVal m = 0; for (unsigned int i = 0; i < al->size(); i++) { m += eval_float(env, (*al)[i]); } return m;}
FloatVal b_float_min(EnvI& env, Call* call) { switch (call->argCount()) { case 1: if (call->arg(0)->type().isSet()) { throw EvalError(env, call->arg(0)->loc(), "sets not supported"); } else { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw EvalError(env, al->loc(), "min on empty array undefined"); } FloatVal m = eval_float(env, (*al)[0]); for (unsigned int i = 1; i < al->size(); i++) { m = std::min(m, eval_float(env, (*al)[i])); } return m; } case 2: { return std::min(eval_float(env, call->arg(0)), eval_float(env, call->arg(1))); } default: throw EvalError(env, Location(), "dynamic type error"); }}
FloatVal b_float_max(EnvI& env, Call* call) { switch (call->argCount()) { case 1: if (call->arg(0)->type().isSet()) { throw EvalError(env, call->arg(0)->loc(), "sets not supported"); } else { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw EvalError(env, al->loc(), "max on empty array undefined"); } FloatVal m = eval_float(env, (*al)[0]); for (unsigned int i = 1; i < al->size(); i++) { m = std::max(m, eval_float(env, (*al)[i])); } return m; } case 2: { return std::max(eval_float(env, call->arg(0)), eval_float(env, call->arg(1))); } default: throw EvalError(env, Location(), "dynamic type error"); }}
IntSetVal* b_index_set(EnvI& env, Expression* e, int i) { if (e->eid() != Expression::E_ID) { GCLock lock; ArrayLit* al = eval_array_lit(env, e); if (al->dims() < i) { throw EvalError(env, e->loc(), "index_set: wrong dimension"); } return IntSetVal::a(al->min(i - 1), al->max(i - 1)); } Id* id = e->cast<Id>(); if (id->decl() == nullptr) { throw EvalError(env, id->loc(), "undefined identifier"); } if ((id->decl()->ti()->ranges().size() == 1 && id->decl()->ti()->ranges()[0]->domain() != nullptr && id->decl()->ti()->ranges()[0]->domain()->isa<TIId>()) || (static_cast<int>(id->decl()->ti()->ranges().size()) >= i && (id->decl()->ti()->ranges()[i - 1]->domain() == nullptr || id->decl()->ti()->ranges()[i - 1]->domain()->isa<TIId>()))) { GCLock lock; ArrayLit* al = eval_array_lit(env, id); if (al->dims() < i) { throw EvalError(env, id->loc(), "index_set: wrong dimension"); } return IntSetVal::a(al->min(i - 1), al->max(i - 1)); } if (static_cast<int>(id->decl()->ti()->ranges().size()) < i) { throw EvalError(env, id->loc(), "index_set: wrong dimension"); } return eval_intset(env, id->decl()->ti()->ranges()[i - 1]->domain());}bool b_index_sets_agree(EnvI& env, Call* call) { if (call->argCount() != 2) { throw EvalError(env, Location(), "index_sets_agree needs exactly two arguments"); } GCLock lock; ArrayLit* al0 = eval_array_lit(env, call->arg(0)); ArrayLit* al1 = eval_array_lit(env, call->arg(1)); if (al0->type().dim() != al1->type().dim()) { return false; } for (int i = 1; i <= al0->type().dim(); i++) { IntSetVal* index0 = b_index_set(env, al0, i); IntSetVal* index1 = b_index_set(env, al1, i); if (!index0->equal(index1)) { return false; } } return true;}IntSetVal* b_index_set1(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "index_set needs exactly one argument"); } return b_index_set(env, call->arg(0), 1);}IntSetVal* b_index_set2(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "index_set needs exactly one argument"); } return b_index_set(env, call->arg(0), 2);}IntSetVal* b_index_set3(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "index_set needs exactly one argument"); } return b_index_set(env, call->arg(0), 3);}IntSetVal* b_index_set4(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "index_set needs exactly one argument"); } return b_index_set(env, call->arg(0), 4);}IntSetVal* b_index_set5(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "index_set needs exactly one argument"); } return b_index_set(env, call->arg(0), 5);}IntSetVal* b_index_set6(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "index_set needs exactly one argument"); } return b_index_set(env, call->arg(0), 6);}
IntVal b_min_parsetint(EnvI& env, Call* call) { assert(call->argCount() == 1); IntSetVal* isv = eval_intset(env, call->arg(0)); return isv->min();}IntVal b_max_parsetint(EnvI& env, Call* call) { assert(call->argCount() == 1); IntSetVal* isv = eval_intset(env, call->arg(0)); return isv->max();}IntSetVal* b_lb_set(EnvI& env, Call* e) { Expression* ee = follow_id_to_value(e->arg(0)); if (ee->type().isPar()) { return eval_intset(env, ee); } return IntSetVal::a();}IntSetVal* b_ub_set(EnvI& env, Expression* e) { IntSetVal* isv = compute_intset_bounds(env, e); if (isv != nullptr) { return isv; } throw EvalError(env, e->loc(), "cannot determine bounds of set expression");}IntSetVal* b_ub_set(EnvI& env, Call* call) { assert(call->argCount() == 1); return b_ub_set(env, call->arg(0));}bool b_has_ub_set(EnvI& env, Call* call) { Expression* e = call->arg(0); for (;;) { switch (e->eid()) { case Expression::E_SETLIT: return true; case Expression::E_ID: { Id* id = e->cast<Id>(); if (id->decl() == nullptr) { throw EvalError(env, id->loc(), "undefined identifier"); } if (id->decl()->e() == nullptr) { return id->decl()->ti()->domain() != nullptr; } e = id->decl()->e();
} break; default: throw EvalError(env, e->loc(), "invalid argument to has_ub_set"); } }}
IntSetVal* b_array_ub_set(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { throw EvalError(env, Location(), "upper bound of empty array undefined"); } IntSetVal* ub = b_ub_set(env, (*al)[0]); for (unsigned int i = 1; i < al->size(); i++) { IntSetRanges isr(ub); IntSetRanges r(b_ub_set(env, (*al)[i])); Ranges::Union<IntVal, IntSetRanges, IntSetRanges> u(isr, r); ub = IntSetVal::ai(u); } return ub;}
IntSetVal* b_dom_varint(EnvI& env, Expression* e) { Id* lastid = nullptr; Expression* cur = e; for (;;) { if (cur == nullptr) { if (lastid == nullptr || lastid->decl()->ti()->domain() == nullptr) { IntBounds b = compute_int_bounds(env, e); if (b.valid) { return IntSetVal::a(b.l, b.u); } return IntSetVal::a(-IntVal::infinity(), IntVal::infinity()); } return eval_intset(env, lastid->decl()->ti()->domain()); } switch (cur->eid()) { case Expression::E_INTLIT: { IntVal v = cur->cast<IntLit>()->v(); return IntSetVal::a(v, v); } case Expression::E_ID: { lastid = cur->cast<Id>(); if (lastid == constants().absent) { return IntSetVal::a(-IntVal::infinity(), IntVal::infinity()); } if (lastid->decl() == nullptr) { throw EvalError(env, lastid->loc(), "undefined identifier"); } cur = lastid->decl()->e(); } break; case Expression::E_ARRAYACCESS: { bool success; cur = eval_arrayaccess(env, cur->cast<ArrayAccess>(), success); if (!success) { cur = nullptr; } } break; default: cur = nullptr; break; } }}IntSetVal* b_dom_varint(EnvI& env, Call* call) { assert(call->argCount() == 1); return b_dom_varint(env, call->arg(0));}
IntSetVal* b_dom_bounds_array(EnvI& env, Call* call) { assert(call->argCount() == 1); Expression* arg_e = call->arg(0); Expression* e = follow_id_to_decl(arg_e);
bool foundBounds = false; IntVal array_lb = -IntVal::infinity(); IntVal array_ub = IntVal::infinity();
if (auto* vd = e->dynamicCast<VarDecl>()) { if (vd->ti()->domain() != nullptr) { GCLock lock; IntSetVal* isv = eval_intset(env, vd->ti()->domain()); if (isv->size() != 0) { array_lb = isv->min(); array_ub = isv->max(); foundBounds = true; } } e = vd->e(); if (e == nullptr) { e = vd->flat()->e(); } }
if (foundBounds) { return IntSetVal::a(array_lb, array_ub); }
if (e != nullptr) { GCLock lock; ArrayLit* al = eval_array_lit(env, e); if (al->size() == 0) { throw EvalError(env, Location(), "lower bound of empty array undefined"); } IntVal min = IntVal::infinity(); IntVal max = -IntVal::infinity(); for (unsigned int i = 0; i < al->size(); i++) { IntBounds ib = compute_int_bounds(env, (*al)[i]); if (!ib.valid) { goto b_array_lb_int_done; } min = std::min(min, ib.l); max = std::max(max, ib.u); } array_lb = std::max(array_lb, min); array_ub = std::min(array_ub, max); foundBounds = true; }b_array_lb_int_done: if (foundBounds) { return IntSetVal::a(array_lb, array_ub); } else { throw EvalError(env, e->loc(), "cannot determine lower bound"); }}
IntSetVal* b_dom_array(EnvI& env, Call* call) { assert(call->argCount() == 1); Expression* ae = call->arg(0); ArrayLit* al = nullptr; while (al == nullptr) { switch (ae->eid()) { case Expression::E_ARRAYLIT: al = ae->cast<ArrayLit>(); break; case Expression::E_ID: { Id* id = ae->cast<Id>(); if (id->decl() == nullptr) { throw EvalError(env, id->loc(), "undefined identifier"); } if (id->decl()->e() == nullptr) { if (id->decl()->flat() == nullptr) { throw EvalError(env, id->loc(), "array without initialiser"); } if (id->decl()->flat()->e() == nullptr) { throw EvalError(env, id->loc(), "array without initialiser"); } ae = id->decl()->flat()->e();
} else { ae = id->decl()->e(); } } break; default: throw EvalError(env, ae->loc(), "invalid argument to dom"); } } if (al->size() == 0) { return IntSetVal::a(); } IntSetVal* isv = b_dom_varint(env, (*al)[0]); for (unsigned int i = 1; i < al->size(); i++) { IntSetRanges isr(isv); IntSetRanges r(b_dom_varint(env, (*al)[i])); Ranges::Union<IntVal, IntSetRanges, IntSetRanges> u(isr, r); isv = IntSetVal::ai(u); } return isv;}IntSetVal* b_compute_div_bounds(EnvI& env, Call* call) { assert(call->argCount() == 2); IntBounds bx = compute_int_bounds(env, call->arg(0)); if (!bx.valid) { throw EvalError(env, call->arg(0)->loc(), "cannot determine bounds"); } /// TODO: better bounds if only some input bounds are infinite if (!bx.l.isFinite() || !bx.u.isFinite()) { return constants().infinity->isv(); } IntBounds by = compute_int_bounds(env, call->arg(1)); if (!by.valid) { throw EvalError(env, call->arg(1)->loc(), "cannot determine bounds"); } if (!by.l.isFinite() || !by.u.isFinite()) { return constants().infinity->isv(); } Ranges::Const<IntVal> byr(by.l, by.u); Ranges::Const<IntVal> by0(0, 0); Ranges::Diff<IntVal, Ranges::Const<IntVal>, Ranges::Const<IntVal>> byr0(byr, by0);
IntVal min = IntVal::maxint(); IntVal max = IntVal::minint(); if (byr0()) { min = std::min(min, bx.l / byr0.min()); min = std::min(min, bx.l / byr0.max()); min = std::min(min, bx.u / byr0.min()); min = std::min(min, bx.u / byr0.max()); max = std::max(max, bx.l / byr0.min()); max = std::max(max, bx.l / byr0.max()); max = std::max(max, bx.u / byr0.min()); max = std::max(max, bx.u / byr0.max()); ++byr0; if (byr0()) { min = std::min(min, bx.l / byr0.min()); min = std::min(min, bx.l / byr0.max()); min = std::min(min, bx.u / byr0.min()); min = std::min(min, bx.u / byr0.max()); max = std::max(max, bx.l / byr0.min()); max = std::max(max, bx.l / byr0.max()); max = std::max(max, bx.u / byr0.min()); max = std::max(max, bx.u / byr0.max()); } } return IntSetVal::a(min, max);}
// NOLINTNEXTLINE(readability-identifier-naming)ArrayLit* b_arrayXd(EnvI& env, Call* call, int d) { GCLock lock; bool check_form = call->ann().contains(constants().ann.array_check_form); ArrayLit* al = eval_array_lit(env, call->arg(d)); std::vector<std::pair<int, int>> dims(d); unsigned int dim1d = 1;
if (check_form && d != al->dims()) { std::ostringstream ss; ss << "number of dimensions of original array (" << al->dims() << ") does not match the given number of index sets (" << d << ")"; throw EvalError(env, call->loc(), ss.str()); }
for (int i = 0; i < d; i++) { IntSetVal* di = eval_intset(env, call->arg(i)); if (di->size() == 0) { dims[i] = std::pair<int, int>(1, 0); dim1d = 0; } else if (di->size() != 1) { throw EvalError(env, call->arg(i)->loc(), "arrayXd only defined for ranges"); } else { dims[i] = std::pair<int, int>(static_cast<int>(di->min(0).toInt()), static_cast<int>(di->max(0).toInt())); dim1d *= dims[i].second - dims[i].first + 1; if (check_form && dims[i].second - dims[i].first != al->max(i) - al->min(i)) { std::ostringstream ss; ss << "index set " << i + 1 << " (" << dims[i].first << ".." << dims[i].second << ") does not match index set " << i + 1 << " of original array (" << al->min(i) << ".." << al->max(i) << ")"; throw EvalError(env, call->arg(i)->loc(), ss.str()); } } } if (dim1d != al->size()) { throw EvalError(env, al->loc(), "mismatch in array dimensions"); } auto* ret = new ArrayLit(al->loc(), *al, dims); Type t = al->type(); t.dim(d); ret->type(t); ret->flat(al->flat()); return ret;}Expression* b_array1d_list(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->dims() == 1 && al->min(0) == 1) { return call->arg(0)->isa<Id>() ? call->arg(0) : al; } auto* ret = new ArrayLit(al->loc(), *al); Type t = al->type(); t.dim(1); ret->type(t); ret->flat(al->flat()); return ret;}Expression* b_array1d(EnvI& env, Call* call) { return b_arrayXd(env, call, 1); }Expression* b_array2d(EnvI& env, Call* call) { return b_arrayXd(env, call, 2); }Expression* b_array3d(EnvI& env, Call* call) { return b_arrayXd(env, call, 3); }Expression* b_array4d(EnvI& env, Call* call) { return b_arrayXd(env, call, 4); }Expression* b_array5d(EnvI& env, Call* call) { return b_arrayXd(env, call, 5); }Expression* b_array6d(EnvI& env, Call* call) { return b_arrayXd(env, call, 6); }
// NOLINTNEXTLINE(readability-identifier-naming)Expression* b_arrayXd(EnvI& env, Call* call) { GCLock lock; ArrayLit* al0 = eval_array_lit(env, call->arg(0)); ArrayLit* al1 = eval_array_lit(env, call->arg(1)); if (al0->dims() == al1->dims()) { bool sameDims = true; for (unsigned int i = al0->dims(); (i--) != 0U;) { if (al0->min(i) != al1->min(i) || al0->max(i) != al1->max(i)) { sameDims = false; break; } } if (sameDims) { return call->arg(1)->isa<Id>() ? call->arg(1) : al1; } } std::vector<std::pair<int, int>> dims(al0->dims()); for (unsigned int i = al0->dims(); (i--) != 0U;) { dims[i] = std::make_pair(al0->min(i), al0->max(i)); } auto* ret = new ArrayLit(al1->loc(), *al1, dims); Type t = al1->type(); t.dim(static_cast<int>(dims.size())); ret->type(t); ret->flat(al1->flat()); return ret;}
IntVal b_length(EnvI& env, Call* call) { GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); return al->size();}
IntVal b_bool2int(EnvI& env, Call* call) { return eval_bool(env, call->arg(0)) ? 1 : 0; }
bool b_forall_par(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "forall needs exactly one argument"); } GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); for (unsigned int i = al->size(); (i--) != 0U;) { if (!eval_bool(env, (*al)[i])) { return false; } } return true;}bool b_exists_par(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "exists needs exactly one argument"); } GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); for (unsigned int i = al->size(); (i--) != 0U;) { if (eval_bool(env, (*al)[i])) { return true; } } return false;}bool b_clause_par(EnvI& env, Call* call) { if (call->argCount() != 2) { throw EvalError(env, Location(), "clause needs exactly two arguments"); } GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); for (unsigned int i = al->size(); (i--) != 0U;) { if (eval_bool(env, (*al)[i])) { return true; } } al = eval_array_lit(env, call->arg(1)); for (unsigned int i = al->size(); (i--) != 0U;) { if (!eval_bool(env, (*al)[i])) { return true; } } return false;}bool b_xorall_par(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "xorall needs exactly one argument"); } GCLock lock; int count = 0; ArrayLit* al = eval_array_lit(env, call->arg(0)); for (unsigned int i = al->size(); (i--) != 0U;) { count += static_cast<int>(eval_bool(env, (*al)[i])); } return count % 2 == 1;}bool b_iffall_par(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "xorall needs exactly one argument"); } GCLock lock; int count = 0; ArrayLit* al = eval_array_lit(env, call->arg(0)); for (unsigned int i = al->size(); (i--) != 0U;) { count += static_cast<int>(eval_bool(env, (*al)[i])); } return count % 2 == 0;}bool b_not_par(EnvI& env, Call* call) { assert(call->argCount() == 1); return !eval_bool(env, call->arg(0));}
IntVal b_card(EnvI& env, Call* call) { if (call->argCount() != 1) { throw EvalError(env, Location(), "card needs exactly one argument"); } IntSetVal* isv = eval_intset(env, call->arg(0)); IntSetRanges isr(isv); return Ranges::cardinality(isr);}
Expression* exp_is_fixed(EnvI& env, Expression* e) { GCLock lock; Expression* cur = e; for (;;) { if (cur == nullptr) { return nullptr; } if (cur->type().isPar()) { return eval_par(env, cur); } switch (cur->eid()) { case Expression::E_ID: cur = cur->cast<Id>()->decl(); break; case Expression::E_VARDECL: if (cur->type().st() != Type::ST_SET) { Expression* dom = cur->cast<VarDecl>()->ti()->domain(); if ((dom != nullptr) && (dom->isa<IntLit>() || dom->isa<BoolLit>() || dom->isa<FloatLit>())) { return dom; } if ((dom != nullptr) && dom->isa<SetLit>()) { auto* sl = dom->cast<SetLit>(); auto* isv = sl->isv(); if ((isv != nullptr) && isv->min() == isv->max()) { return IntLit::a(isv->min()); } auto* fsv = sl->fsv(); if ((fsv != nullptr) && fsv->min() == fsv->max()) { return FloatLit::a(fsv->min()); } } } cur = cur->cast<VarDecl>()->e(); break; default: return nullptr; } }}
bool b_is_fixed(EnvI& env, Call* call) { assert(call->argCount() == 1); return exp_is_fixed(env, call->arg(0)) != nullptr;}
bool b_is_fixed_array(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { return true; } for (unsigned int i = 0; i < al->size(); i++) { if (exp_is_fixed(env, (*al)[i]) == nullptr) { return false; } } return true;}
bool b_is_same(EnvI& env, Call* call) { assert(call->argCount() == 2); return follow_id_to_decl(call->arg(0)) == follow_id_to_decl(call->arg(1));}
Expression* b_fix(EnvI& env, Call* call) { assert(call->argCount() == 1); Expression* ret = exp_is_fixed(env, call->arg(0)); if (ret == nullptr) { throw EvalError(env, call->arg(0)->loc(), "expression is not fixed"); } return ret;}
IntVal b_fix_int(EnvI& env, Call* call) { return eval_int(env, b_fix(env, call)); }bool b_fix_bool(EnvI& env, Call* call) { return eval_bool(env, b_fix(env, call)); }FloatVal b_fix_float(EnvI& env, Call* call) { return eval_float(env, b_fix(env, call)); }IntSetVal* b_fix_set(EnvI& env, Call* call) { return eval_intset(env, b_fix(env, call)); }
Expression* b_fix_array(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); std::vector<Expression*> fixed(al->size()); for (unsigned int i = 0; i < fixed.size(); i++) { fixed[i] = exp_is_fixed(env, (*al)[i]); if (fixed[i] == nullptr) { throw EvalError(env, (*al)[i]->loc(), "expression is not fixed"); } } auto* ret = new ArrayLit(Location(), fixed); Type tt = al->type(); tt.ti(Type::TI_PAR); ret->type(tt); return ret;}
bool b_has_ann(EnvI& env, Call* call) { assert(call->argCount() == 2); Expression* expr = call->arg(0); if (!expr->isa<Id>()) { // Argument is a literal, unable to verify annotations return false; } expr = follow_id_to_decl(expr); Expression* ann = call->arg(1); if (ann->isa<Id>()) { return expr->ann().contains(ann); } auto* key = ann->cast<Call>(); if (Call* c = expr->ann().getCall(key->id())) { if (c->argCount() != key->argCount()) { return false; } for (int i = 0; i < c->argCount(); ++i) { if (c->arg(i)->type() != key->arg(i)->type()) { return false; } if (c->arg(i)->type().isPar()) { GCLock lock; Expression* check_eq = new BinOp(Location().introduce(), c->arg(i), BOT_EQ, key->arg(i)); check_eq->type(Type::parbool()); if (!eval_bool(env, check_eq)) { return false; } } else { if (c->arg(i)->isa<Id>() && key->arg(i)->isa<Id>()) { if (follow_id_to_decl(c->arg(i)) != follow_id_to_decl(key->arg(i))) { return false; } } else { throw EvalError(env, call->loc(), "Unable to determine equality of variable expressions"); } } } return true; } return false;}
bool b_annotate(EnvI& env, Call* call) { assert(call->argCount() == 2); Expression* expr = call->arg(0); if (!expr->isa<Id>()) { // Argument is a literal, unable to annotate std::ostringstream ss; ss << "Unable to annotate literal expression `" << *expr << "'."; env.addWarning(ss.str()); return true; } auto* var_decl = follow_id_to_decl(expr)->cast<VarDecl>(); // Add annotation Expression* ann = call->arg(1); var_decl->ann().add(ann); // Increase usage count of the annotation if (auto* ann_decl = follow_id_to_decl(ann)->dynamicCast<VarDecl>()) { auto var_it = env.varOccurrences.idx.find(var_decl->id()); assert(var_it != env.varOccurrences.idx.end()); env.varOccurrences.add(ann_decl, (*env.flat())[var_it->second]); } return true;}
FloatVal b_int2float(EnvI& env, Call* call) { return eval_int(env, call->arg(0)); }IntVal b_ceil(EnvI& env, Call* call) { return static_cast<IntVal>(std::ceil(eval_float(env, call->arg(0))));}IntVal b_floor(EnvI& env, Call* call) { return static_cast<IntVal>(std::floor(eval_float(env, call->arg(0))));}IntVal b_round(EnvI& env, Call* call) { /// Cast to int truncates, so cannot just add 0.5 and cast return {static_cast<long long>(std::round(eval_float(env, call->arg(0)).toDouble()))};}FloatVal b_log10(EnvI& env, Call* call) { return std::log10(eval_float(env, call->arg(0)).toDouble());}FloatVal b_log2(EnvI& env, Call* call) { return std::log(eval_float(env, call->arg(0)).toDouble()) / std::log(2.0);}FloatVal b_ln(EnvI& env, Call* call) { return std::log(eval_float(env, call->arg(0)).toDouble()); }FloatVal b_log(EnvI& env, Call* call) { return std::log(eval_float(env, call->arg(1)).toDouble()) / std::log(eval_float(env, call->arg(0)).toDouble());}FloatVal b_exp(EnvI& env, Call* call) { return std::exp(eval_float(env, call->arg(0)).toDouble()); }FloatVal b_pow(EnvI& env, Call* call) { return std::pow(eval_float(env, call->arg(0)).toDouble(), eval_float(env, call->arg(1)).toDouble());}IntVal b_pow_int(EnvI& env, Call* call) { IntVal p = eval_int(env, call->arg(0)); IntVal r = 1; long long int e = eval_int(env, call->arg(1)).toInt(); if (e < 0) { throw EvalError(env, call->arg(1)->loc(), "Cannot raise integer to a negative power"); } for (long long int i = e; (i--) != 0;) { r = r * p; } return r;}FloatVal b_sqrt(EnvI& env, Call* call) { return std::sqrt(eval_float(env, call->arg(0)).toDouble());}
bool b_assert_bool(EnvI& env, Call* call) { assert(call->argCount() == 2); GCLock lock; Expression* cond_e; if (call->arg(0)->type().cv()) { Ctx ctx; ctx.b = C_MIX; cond_e = flat_cv_exp(env, ctx, call->arg(0))(); } else { cond_e = call->arg(0); } if (eval_bool(env, cond_e)) { return true; } Expression* msg_e; if (call->arg(1)->type().cv()) { msg_e = flat_cv_exp(env, Ctx(), call->arg(1))(); } else { msg_e = call->arg(1); } std::ostringstream ss; ss << "Assertion failed: " << eval_string(env, msg_e); throw EvalError(env, call->arg(0)->loc(), ss.str());}
Expression* b_assert(EnvI& env, Call* call) { assert(call->argCount() == 3); GCLock lock; Expression* cond_e; if (call->arg(0)->type().cv()) { Ctx ctx; ctx.b = C_MIX; cond_e = flat_cv_exp(env, ctx, call->arg(0))(); } else { cond_e = call->arg(0); } if (eval_bool(env, cond_e)) { return call->arg(2); } Expression* msg_e; if (call->arg(1)->type().cv()) { msg_e = flat_cv_exp(env, Ctx(), call->arg(1))(); } else { msg_e = call->arg(1); } std::ostringstream ss; ss << "Assertion failed: " << eval_string(env, msg_e); throw EvalError(env, call->arg(0)->loc(), ss.str());}
Expression* b_mzn_deprecate(EnvI& env, Call* call) { assert(call->argCount() == 4); GCLock lock; std::string fnName = eval_string(env, call->arg(0)); if (env.deprecationWarnings.find(fnName) == env.deprecationWarnings.end()) { env.deprecationWarnings.insert(fnName); env.dumpStack(env.errstream, false); env.errstream << " The function/predicate `" << fnName; env.errstream << "' was deprecated in MiniZinc version " << eval_string(env, call->arg(1)); env.errstream << ".\n More information can be found at " << eval_string(env, call->arg(2)) << ".\n"; } return call->arg(3);}
bool b_abort(EnvI& env, Call* call) { GCLock lock; Expression* msg_e; if (call->arg(0)->type().cv()) { msg_e = flat_cv_exp(env, Ctx(), call->arg(0))(); } else { msg_e = call->arg(0); } std::ostringstream ss; ss << "Abort: " << eval_string(env, msg_e); throw EvalError(env, call->arg(0)->loc(), ss.str());}
Expression* b_mzn_symmetry_breaking_constraint(EnvI& env, Call* call) { GCLock lock; Call* check = new Call(Location().introduce(), ASTString("mzn_check_ignore_symmetry_breaking_constraints"), {}); check->type(Type::parbool()); check->decl(env.model->matchFn(env, check, false, true)); if (eval_bool(env, check)) { return constants().literalTrue; } Call* nc = new Call(call->loc(), ASTString("symmetry_breaking_constraint"), {call->arg(0)}); nc->type(Type::varbool()); nc->decl(env.model->matchFn(env, nc, false, true)); return nc;}
Expression* b_mzn_redundant_constraint(EnvI& env, Call* call) { GCLock lock; Call* check = new Call(Location().introduce(), ASTString("mzn_check_ignore_redundant_constraints"), {}); check->type(Type::parbool()); check->decl(env.model->matchFn(env, check, false, true)); if (eval_bool(env, check)) { return constants().literalTrue; } Call* nc = new Call(call->loc(), ASTString("redundant_constraint"), {call->arg(0)}); nc->type(Type::varbool()); nc->decl(env.model->matchFn(env, nc, false, true)); return nc;}
Expression* b_trace(EnvI& env, Call* call) { GCLock lock; Expression* msg_e; if (call->arg(0)->type().cv()) { msg_e = flat_cv_exp(env, Ctx(), call->arg(0))(); } else { msg_e = call->arg(0); } env.errstream << eval_string(env, msg_e); return call->argCount() == 1 ? constants().literalTrue : call->arg(1);}
Expression* b_trace_stdout(EnvI& env, Call* call) { GCLock lock; Expression* msg_e; if (call->arg(0)->type().cv()) { msg_e = flat_cv_exp(env, Ctx(), call->arg(0))(); } else { msg_e = call->arg(0); } env.errstream << eval_string(env, msg_e); return call->argCount() == 1 ? constants().literalTrue : call->arg(1);}
Expression* b_trace_logstream(EnvI& env, Call* call) { GCLock lock; StringLit* msg; if (call->arg(0)->type().cv()) { msg = flat_cv_exp(env, Ctx(), call->arg(0))()->cast<StringLit>(); } else { msg = eval_par(env, call->arg(0))->cast<StringLit>(); } env.logstream << msg->v(); return call->argCount() == 1 ? constants().literalTrue : call->arg(1);}std::string b_logstream(EnvI& env, Call* call) { return env.logstream.str(); }
bool b_output_to_section(EnvI& env, Call* call) { GCLock lock; StringLit* section; if (call->arg(0)->type().cv()) { section = flat_cv_exp(env, Ctx(), call->arg(0))()->cast<StringLit>(); } else { section = eval_par(env, call->arg(0))->cast<StringLit>(); } std::string section_s = eval_string(env, section); std::vector<Expression*> al_v({call->arg(1)}); auto* al = new ArrayLit(Location().introduce(), al_v); al->type(Type::parstring(1)); auto* oi = new OutputI(Location().introduce(), al); if (section_s != "default") { Call* osec = new Call(Location().introduce(), "mzn_output_section", {section}); oi->ann().add(osec); } env.model->addItem(oi); return true;}
bool b_in_redundant_constraint(EnvI& env, Call* /*call*/) { return env.inRedundantConstraint > 0; }
bool b_in_symmetry_breaking_constraint(EnvI& env, Call* /*call*/) { return env.inSymmetryBreakingConstraint > 0;}
Expression* b_set2array(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; IntSetVal* isv = eval_intset(env, call->arg(0)); std::vector<Expression*> elems; IntSetRanges isr(isv); for (Ranges::ToValues<IntSetRanges> isr_v(isr); isr_v(); ++isr_v) { elems.push_back(IntLit::a(isr_v.val())); } auto* al = new ArrayLit(call->arg(0)->loc(), elems); al->type(Type::parint(1)); return al;}
IntVal b_string_length(EnvI& env, Call* call) { GCLock lock; std::string s = eval_string(env, call->arg(0)); return s.size();}
std::string show(EnvI& env, Expression* exp) { std::ostringstream oss; GCLock lock; Printer p(oss, 0, false); Expression* e = follow_id_to_decl(exp); if (auto* vd = e->dynamicCast<VarDecl>()) { if ((vd->e() != nullptr) && !vd->e()->isa<Call>()) { e = vd->e(); } else { e = vd->id(); } } if (e->type().isPar()) { e = eval_par(env, e); } if (e->type().dim() > 0) { e = eval_array_lit(env, e); } if (auto* al = e->dynamicCast<ArrayLit>()) { oss << "["; for (unsigned int i = 0; i < al->size(); i++) { p.print((*al)[i]); if (i < al->size() - 1) { oss << ", "; } } oss << "]"; } else { p.print(e); } return oss.str();}std::string b_show(EnvI& env, Call* call) { return show(env, call->arg(0)); }std::string b_show_dzn_id(EnvI& env, Call* call) { GCLock lock; std::string s = eval_string(env, call->arg(0)); size_t nonIdChar = s.find_first_not_of("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_"); size_t nonIdBegin = s.find_first_of("0123456789_"); if (nonIdChar != std::string::npos || nonIdBegin == 0) { s = "'" + s + "'"; } return s;}
std::string b_show_json_basic(EnvI& env, Expression* e) { std::ostringstream oss; Printer p(oss, 0, false); if (auto* sl = e->dynamicCast<SetLit>()) { oss << "{ \"set\" : ["; if (IntSetVal* isv = sl->isv()) { bool first = true; for (IntSetRanges isr(isv); isr(); ++isr) { if (first) { first = false; } else { oss << ","; } if (isr.min() == isr.max()) { oss << isr.min(); } else { oss << "[" << isr.min() << "," << isr.max() << "]"; } } } else if (FloatSetVal* fsv = sl->fsv()) { bool first = true; for (FloatSetRanges fsr(fsv); fsr(); ++fsr) { if (first) { first = false; } else { oss << ","; } if (fsr.min() == fsr.max()) { pp_floatval(oss, fsr.min()); } else { oss << "["; pp_floatval(oss, fsr.min()); oss << ","; pp_floatval(oss, fsr.max()); oss << "]"; } } } else { for (unsigned int i = 0; i < sl->v().size(); i++) { p.print(sl->v()[i]); if (i < sl->v().size() - 1) { oss << ","; } } } oss << "]}"; } else if (e == constants().absent) { oss << "null"; } else { p.print(e); } return oss.str();}
std::string b_show_json(EnvI& env, Call* call) { Expression* exp = call->arg(0); GCLock lock; Expression* e = eval_par(env, exp); if (e->type().isvar()) { std::ostringstream oss; Printer p(oss, 0, false); p.print(e); return oss.str(); } if (auto* al = e->dynamicCast<ArrayLit>()) { std::vector<unsigned int> dims(al->dims() - 1); if (!dims.empty()) { dims[0] = al->max(al->dims() - 1) - al->min(al->dims() - 1) + 1; }
for (int i = 1; i < al->dims() - 1; i++) { dims[i] = dims[i - 1] * (al->max(al->dims() - 1 - i) - al->min(al->dims() - 1 - i) + 1); }
std::ostringstream oss; oss << "["; for (unsigned int i = 0; i < al->size(); i++) { for (unsigned int dim : dims) { if (i % dim == 0) { oss << "["; } } oss << b_show_json_basic(env, (*al)[i]); for (unsigned int dim : dims) { if (i % dim == dim - 1) { oss << "]"; } }
if (i < al->size() - 1) { oss << ", "; } } oss << "]";
return oss.str(); } return b_show_json_basic(env, e);}
Expression* b_output_json(EnvI& env, Call* call) { return create_json_output(env, false, false, false);}Expression* b_output_json_parameters(EnvI& env, Call* call) { std::vector<Expression*> outputVars; outputVars.push_back(new StringLit(Location().introduce(), "{\n"));
class JSONParVisitor : public ItemVisitor { protected: EnvI& _e; std::vector<Expression*>& _outputVars; bool _firstVar;
public: JSONParVisitor(EnvI& e, std::vector<Expression*>& outputVars) : _e(e), _outputVars(outputVars), _firstVar(true) {} void vVarDeclI(VarDeclI* vdi) { VarDecl* vd = vdi->e(); if (vd->ann().contains(constants().ann.rhs_from_assignment)) { std::ostringstream s; if (_firstVar) { _firstVar = false; } else { s << ",\n"; } s << " \"" << vd->id()->str() << "\"" << " : "; auto* sl = new StringLit(Location().introduce(), s.str()); _outputVars.push_back(sl);
std::vector<Expression*> showArgs(1); showArgs[0] = vd->id(); Call* show = new Call(Location().introduce(), "showJSON", showArgs); show->type(Type::parstring()); FunctionI* fi = _e.model->matchFn(_e, show, false); assert(fi); show->decl(fi); _outputVars.push_back(show); } } } jsonov(env, outputVars);
iter_items(jsonov, env.model); outputVars.push_back(new StringLit(Location().introduce(), "\n}\n")); return new ArrayLit(Location().introduce(), outputVars);}
std::string b_format(EnvI& env, Call* call) { int width = 0; int prec = -1; GCLock lock; Expression* e; if (call->argCount() > 1) { width = static_cast<int>(eval_int(env, call->arg(0)).toInt()); if (call->argCount() == 2) { e = eval_par(env, call->arg(1)); } else { assert(call->argCount() == 3); prec = static_cast<int>(eval_int(env, call->arg(1)).toInt()); if (prec < 0) { throw EvalError(env, call->arg(1)->loc(), "output precision cannot be negative"); } e = eval_par(env, call->arg(2)); } } else { e = eval_par(env, call->arg(0)); } if (e->type() == Type::parint()) { long long int i = eval_int(env, e).toInt(); std::ostringstream formatted; if (width > 0) { formatted.width(width); } else if (width < 0) { formatted.width(-width); formatted.flags(std::ios::left); } if (prec != -1) { formatted.precision(prec); } formatted << i; return formatted.str(); } if (e->type() == Type::parfloat()) { FloatVal i = eval_float(env, e); std::ostringstream formatted; if (width > 0) { formatted.width(width); } else if (width < 0) { formatted.width(-width); formatted.flags(std::ios::left); } formatted.setf(std::ios::fixed); formatted.precision(std::numeric_limits<double>::digits10 + 2); if (prec != -1) { formatted.precision(prec); } formatted << i; return formatted.str(); } std::string s = show(env, e); if (prec >= 0 && prec < s.size()) { s = s.substr(0, prec); } std::ostringstream oss; if (s.size() < std::abs(width)) { int addLeft = width < 0 ? 0 : (width - static_cast<int>(s.size())); if (addLeft < 0) { addLeft = 0; } int addRight = width < 0 ? (-width - static_cast<int>(s.size())) : 0; if (addRight < 0) { addRight = 0; } for (int i = addLeft; (i--) != 0;) { oss << " "; } oss << s; for (int i = addRight; (i--) != 0;) { oss << " "; } return oss.str(); } return s;}
std::string b_format_justify_string(EnvI& env, Call* call) { int width = 0; GCLock lock; Expression* e; width = static_cast<int>(eval_int(env, call->arg(0)).toInt()); e = eval_par(env, call->arg(1)); std::string s = eval_string(env, e); std::ostringstream oss; if (s.size() < std::abs(width)) { int addLeft = width < 0 ? 0 : (width - static_cast<int>(s.size())); if (addLeft < 0) { addLeft = 0; } int addRight = width < 0 ? (-width - static_cast<int>(s.size())) : 0; if (addRight < 0) { addRight = 0; } for (int i = addLeft; (i--) != 0;) { oss << " "; } oss << s; for (int i = addRight; (i--) != 0;) { oss << " "; } return oss.str(); } return s;}
std::string b_show_int(EnvI& env, Call* call) { assert(call->argCount() == 2); GCLock lock; Expression* e = eval_par(env, call->arg(1)); std::ostringstream oss; if (auto* iv = e->dynamicCast<IntLit>()) { int justify = static_cast<int>(eval_int(env, call->arg(0)).toInt()); std::ostringstream oss_length; oss_length << iv->v(); int iv_length = static_cast<int>(oss_length.str().size()); int addLeft = justify < 0 ? 0 : (justify - iv_length); if (addLeft < 0) { addLeft = 0; } int addRight = justify < 0 ? (-justify - iv_length) : 0; if (addRight < 0) { addRight = 0; } for (int i = addLeft; (i--) != 0;) { oss << " "; } oss << iv->v(); for (int i = addRight; (i--) != 0;) { oss << " "; } } else { Printer p(oss, 0, false); p.print(e); } return oss.str();}
std::string b_show_float(EnvI& env, Call* call) { assert(call->argCount() == 3); GCLock lock; Expression* e = eval_par(env, call->arg(2)); std::ostringstream oss; if (auto* fv = e->dynamicCast<FloatLit>()) { int justify = static_cast<int>(eval_int(env, call->arg(0)).toInt()); int prec = static_cast<int>(eval_int(env, call->arg(1)).toInt()); if (prec < 0) { throw EvalError(env, call->arg(1)->loc(), "number of digits in show_float cannot be negative"); } std::ostringstream oss_length; oss_length << std::setprecision(prec) << std::fixed << fv->v(); int fv_length = static_cast<int>(oss_length.str().size()); int addLeft = justify < 0 ? 0 : (justify - fv_length); if (addLeft < 0) { addLeft = 0; } int addRight = justify < 0 ? (-justify - fv_length) : 0; if (addRight < 0) { addRight = 0; } for (int i = addLeft; (i--) != 0;) { oss << " "; } oss << std::setprecision(prec) << std::fixed << fv->v(); for (int i = addRight; (i--) != 0;) { oss << " "; } } else { Printer p(oss, 0, false); p.print(e); } return oss.str();}
std::string b_file_path(EnvI& /*env*/, Call* call) { return FileUtils::file_path( std::string(call->loc().filename().c_str(), call->loc().filename().size()));}
std::string b_concat(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); std::ostringstream oss; for (unsigned int i = 0; i < al->size(); i++) { oss << eval_string(env, (*al)[i]); } return oss.str();}
std::string b_join(EnvI& env, Call* call) { assert(call->argCount() == 2); std::string sep = eval_string(env, call->arg(0)); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(1)); std::ostringstream oss; for (unsigned int i = 0; i < al->size(); i++) { oss << eval_string(env, (*al)[i]); if (i < al->size() - 1) { oss << sep; } } return oss.str();}
IntSetVal* b_array_union(EnvI& env, Call* call) { assert(call->argCount() == 1); ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { return IntSetVal::a(); } IntSetVal* isv = eval_intset(env, (*al)[0]); for (unsigned int i = 0; i < al->size(); i++) { IntSetRanges i0(isv); IntSetRanges i1(eval_intset(env, (*al)[i])); Ranges::Union<IntVal, IntSetRanges, IntSetRanges> u(i0, i1); isv = IntSetVal::ai(u); } return isv;}
IntSetVal* b_array_intersect(EnvI& env, Call* call) { assert(call->argCount() == 1); ArrayLit* al = eval_array_lit(env, call->arg(0)); std::vector<IntSetVal::Range> ranges; if (al->size() > 0) { IntSetVal* i0 = eval_intset(env, (*al)[0]); if (i0->size() > 0) { IntSetRanges i0r(i0); IntVal min = i0r.min(); while (i0r()) { // Initialize with last interval IntVal max = i0r.max(); // Intersect with all other intervals restart: for (unsigned int j = al->size(); (j--) != 0U;) { IntSetRanges ij(eval_intset(env, (*al)[j])); // Skip intervals that are too small while (ij() && (ij.max() < min)) { ++ij; } if (!ij()) { goto done; } if (ij.min() > max) { min = ij.min(); max = ij.max(); goto restart; } // Now the intervals overlap if (min < ij.min()) { min = ij.min(); } if (max > ij.max()) { max = ij.max(); } } ranges.emplace_back(min, max); // The next interval must be at least two elements away min = max + 2; } done: return IntSetVal::a(ranges); } else { return IntSetVal::a(); } } else { return IntSetVal::a(); }}
Expression* b_sort_by_int(EnvI& env, Call* call) { assert(call->argCount() == 2); ArrayLit* al = eval_array_lit(env, call->arg(0)); ArrayLit* order_e = eval_array_lit(env, call->arg(1)); std::vector<IntVal> order(order_e->size()); std::vector<int> a(order_e->size()); for (unsigned int i = 0; i < order.size(); i++) { a[i] = i; order[i] = eval_int(env, (*order_e)[i]); } struct Ord { std::vector<IntVal>& order; Ord(std::vector<IntVal>& order0) : order(order0) {} bool operator()(int i, int j) { return order[i] < order[j]; } } _ord(order); std::stable_sort(a.begin(), a.end(), _ord); std::vector<Expression*> sorted(a.size()); for (auto i = static_cast<unsigned int>(sorted.size()); (i--) != 0U;) { sorted[i] = (*al)[a[i]]; } auto* al_sorted = new ArrayLit(al->loc(), sorted); al_sorted->type(al->type()); return al_sorted;}
Expression* b_sort_by_float(EnvI& env, Call* call) { assert(call->argCount() == 2); ArrayLit* al = eval_array_lit(env, call->arg(0)); ArrayLit* order_e = eval_array_lit(env, call->arg(1)); std::vector<FloatVal> order(order_e->size()); std::vector<int> a(order_e->size()); for (unsigned int i = 0; i < order.size(); i++) { a[i] = i; order[i] = eval_float(env, (*order_e)[i]); } struct Ord { std::vector<FloatVal>& order; Ord(std::vector<FloatVal>& order0) : order(order0) {} bool operator()(int i, int j) { return order[i] < order[j]; } } _ord(order); std::stable_sort(a.begin(), a.end(), _ord); std::vector<Expression*> sorted(a.size()); for (auto i = static_cast<unsigned int>(sorted.size()); (i--) != 0U;) { sorted[i] = (*al)[a[i]]; } auto* al_sorted = new ArrayLit(al->loc(), sorted); al_sorted->type(al->type()); return al_sorted;}
Expression* b_sort(EnvI& env, Call* call) { assert(call->argCount() == 1); ArrayLit* al = eval_array_lit(env, call->arg(0)); std::vector<Expression*> sorted(al->size()); for (auto i = static_cast<unsigned int>(sorted.size()); (i--) != 0U;) { sorted[i] = (*al)[i]; } struct Ord { EnvI& env; Ord(EnvI& env0) : env(env0) {} bool operator()(Expression* e0, Expression* e1) { switch (e0->type().bt()) { case Type::BT_INT: return eval_int(env, e0) < eval_int(env, e1); case Type::BT_BOOL: return static_cast<int>(eval_bool(env, e0)) < static_cast<int>(eval_bool(env, e1)); case Type::BT_FLOAT: return eval_float(env, e0) < eval_float(env, e1); default: throw EvalError(env, e0->loc(), "unsupported type for sorting"); } } } _ord(env); std::sort(sorted.begin(), sorted.end(), _ord); auto* al_sorted = new ArrayLit(al->loc(), sorted); al_sorted->type(al->type()); return al_sorted;}
Expression* b_inverse(EnvI& env, Call* call) { assert(call->argCount() == 1); ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->size() == 0) { return al; } int min_idx = al->min(0);
std::vector<IntVal> ivs(al->size()); IntVal minVal = eval_int(env, (*al)[0]); IntVal maxVal = minVal; ivs[0] = minVal; for (unsigned int i = 1; i < al->size(); i++) { IntVal ii = eval_int(env, (*al)[i]); ivs[i] = ii; minVal = std::min(minVal, ii); maxVal = std::max(maxVal, ii); } if (maxVal - minVal + 1 != al->size()) { throw ResultUndefinedError(env, call->loc(), "inverse on non-contiguous set of values is undefined"); }
std::vector<Expression*> inv(al->size()); std::vector<bool> used(al->size()); for (unsigned int i = 0; i < ivs.size(); i++) { used[(ivs[i] - minVal).toInt()] = true; inv[(ivs[i] - minVal).toInt()] = IntLit::a(i + min_idx); } for (bool b : used) { if (!b) { throw ResultUndefinedError(env, call->loc(), "inverse on non-contiguous set of values is undefined"); } } auto* al_inv = new ArrayLit(al->loc(), inv, {{minVal.toInt(), maxVal.toInt()}}); al_inv->type(al->type()); return al_inv;}
Expression* b_set_to_ranges_int(EnvI& env, Call* call) { assert(call->argCount() == 1); IntSetVal* isv = eval_intset(env, call->arg(0)); std::vector<Expression*> v(isv->size() * 2); for (unsigned int i = 0; i < isv->size(); i++) { v[2 * i] = IntLit::a(isv->min(i)); v[2 * i + 1] = IntLit::a(isv->max(i)); } auto* al = new ArrayLit(call->loc().introduce(), v); al->type(Type::parint(1)); return al;}
Expression* b_set_to_ranges_float(EnvI& env, Call* call) { assert(call->argCount() == 1); FloatSetVal* fsv = eval_floatset(env, call->arg(0)); std::vector<Expression*> v(fsv->size() * 2); for (unsigned int i = 0; i < fsv->size(); i++) { v[2 * i] = FloatLit::a(fsv->min(i)); v[2 * i + 1] = FloatLit::a(fsv->max(i)); } auto* al = new ArrayLit(call->loc().introduce(), v); al->type(Type::parfloat(1)); return al;}
std::default_random_engine& rnd_generator() { // TODO: initiate with seed if given as annotation/in command line static std::default_random_engine g; return g;}
FloatVal b_normal_float_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double mean = eval_float(env, call->arg(0)).toDouble(); const double stdv = eval_float(env, call->arg(1)).toDouble(); std::normal_distribution<double> distribution(mean, stdv); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_normal_int_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double mean = double(eval_int(env, call->arg(0)).toInt()); const double stdv = eval_float(env, call->arg(1)).toDouble(); std::normal_distribution<double> distribution(mean, stdv); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_uniform_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double lb = eval_float(env, call->arg(0)).toDouble(); const double ub = eval_float(env, call->arg(1)).toDouble(); if (lb > ub) { std::stringstream ssm; ssm << "lowerbound of uniform distribution \"" << lb << "\" is higher than its upperbound: " << ub; throw EvalError(env, call->arg(0)->loc(), ssm.str()); } std::uniform_real_distribution<double> distribution(lb, ub); // return a sample from the distribution return distribution(rnd_generator());}
IntVal b_uniform_int(EnvI& env, Call* call) { assert(call->argCount() == 2); const long long int lb = eval_int(env, call->arg(0)).toInt(); const long long int ub = eval_int(env, call->arg(1)).toInt(); if (lb > ub) { std::stringstream ssm; ssm << "lowerbound of uniform distribution \"" << lb << "\" is higher than its upperbound: " << ub; throw EvalError(env, call->arg(0)->loc(), ssm.str()); } std::uniform_int_distribution<long long int> distribution(lb, ub); // return a sample from the distribution return IntVal(distribution(rnd_generator()));}
IntVal b_poisson_int(EnvI& env, Call* call) { assert(call->argCount() == 1); long long int mean = eval_int(env, call->arg(0)).toInt(); std::poisson_distribution<long long int> distribution(static_cast<double>(mean)); // return a sample from the distribution return IntVal(distribution(rnd_generator()));}
IntVal b_poisson_float(EnvI& env, Call* call) { assert(call->argCount() == 1); double mean = eval_float(env, call->arg(0)).toDouble(); std::poisson_distribution<long long int> distribution(mean); // return a sample from the distribution return IntVal(distribution(rnd_generator()));}
FloatVal b_gamma_float_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double alpha = eval_float(env, call->arg(0)).toDouble(); const double beta = eval_float(env, call->arg(1)).toDouble(); std::gamma_distribution<double> distribution(alpha, beta); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_gamma_int_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double alpha = eval_float(env, call->arg(0)).toDouble(); const double beta = eval_float(env, call->arg(1)).toDouble(); std::gamma_distribution<double> distribution(alpha, beta); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_weibull_int_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double shape = double(eval_int(env, call->arg(0)).toInt()); if (shape < 0) { std::stringstream ssm; ssm << "The shape factor for the weibull distribution \"" << shape << "\" has to be greater than zero."; throw EvalError(env, call->arg(0)->loc(), ssm.str()); } const double scale = eval_float(env, call->arg(1)).toDouble(); if (scale < 0) { std::stringstream ssm; ssm << "The scale factor for the weibull distribution \"" << scale << "\" has to be greater than zero."; throw EvalError(env, call->arg(1)->loc(), ssm.str()); } std::weibull_distribution<double> distribution(shape, scale); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_weibull_float_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double shape = eval_float(env, call->arg(0)).toDouble(); if (shape < 0) { std::stringstream ssm; ssm << "The shape factor for the weibull distribution \"" << shape << "\" has to be greater than zero."; throw EvalError(env, call->arg(0)->loc(), ssm.str()); } const double scale = eval_float(env, call->arg(1)).toDouble(); if (scale < 0) { std::stringstream ssm; ssm << "The scale factor for the weibull distribution \"" << scale << "\" has to be greater than zero."; throw EvalError(env, call->arg(1)->loc(), ssm.str()); } std::weibull_distribution<double> distribution(shape, scale); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_exponential_float(EnvI& env, Call* call) { assert(call->argCount() == 1); const double lambda = eval_float(env, call->arg(0)).toDouble(); if (lambda < 0) { std::stringstream ssm; ssm << "The lambda-parameter for the exponential distribution function \"" << lambda << "\" has to be greater than zero."; throw EvalError(env, call->arg(0)->loc(), ssm.str()); } std::exponential_distribution<double> distribution(lambda); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_exponential_int(EnvI& env, Call* call) { assert(call->argCount() == 1); const double lambda = double(eval_int(env, call->arg(0)).toInt()); if (lambda < 0) { std::stringstream ssm; ssm << "The lambda-parameter for the exponential distribution function \"" << lambda << "\" has to be greater than zero."; throw EvalError(env, call->arg(0)->loc(), ssm.str()); } std::exponential_distribution<double> distribution(lambda); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_lognormal_float_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double mean = eval_float(env, call->arg(0)).toDouble(); const double stdv = eval_float(env, call->arg(1)).toDouble(); std::lognormal_distribution<double> distribution(mean, stdv); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_lognormal_int_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double mean = double(eval_int(env, call->arg(0)).toInt()); const double stdv = eval_float(env, call->arg(1)).toDouble(); std::lognormal_distribution<double> distribution(mean, stdv); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_chisquared_float(EnvI& env, Call* call) { assert(call->argCount() == 1); const double lambda = eval_float(env, call->arg(0)).toDouble(); std::exponential_distribution<double> distribution(lambda); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_chisquared_int(EnvI& env, Call* call) { assert(call->argCount() == 1); const double lambda = double(eval_int(env, call->arg(0)).toInt()); std::exponential_distribution<double> distribution(lambda); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_cauchy_float_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double mean = eval_float(env, call->arg(0)).toDouble(); const double scale = eval_float(env, call->arg(1)).toDouble(); std::cauchy_distribution<double> distribution(mean, scale); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_cauchy_int_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double mean = double(eval_int(env, call->arg(0)).toInt()); const double scale = eval_float(env, call->arg(1)).toDouble(); std::cauchy_distribution<double> distribution(mean, scale); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_fdistribution_float_float(EnvI& env, Call* call) { assert(call->argCount() == 2); const double d1 = eval_float(env, call->arg(0)).toDouble(); const double d2 = eval_float(env, call->arg(1)).toDouble(); std::fisher_f_distribution<double> distribution(d1, d2); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_fdistribution_int_int(EnvI& env, Call* call) { assert(call->argCount() == 2); const double d1 = double(eval_int(env, call->arg(0)).toInt()); const double d2 = double(eval_int(env, call->arg(1)).toInt()); std::fisher_f_distribution<double> distribution(d1, d2); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_tdistribution_float(EnvI& env, Call* call) { assert(call->argCount() == 1); const double sampleSize = eval_float(env, call->arg(0)).toDouble(); std::student_t_distribution<double> distribution(sampleSize); // return a sample from the distribution return distribution(rnd_generator());}
FloatVal b_tdistribution_int(EnvI& env, Call* call) { assert(call->argCount() == 1); const double sampleSize = double(eval_int(env, call->arg(0)).toInt()); std::student_t_distribution<double> distribution(sampleSize); // return a sample from the distribution return distribution(rnd_generator());}
IntVal b_discrete_distribution(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; ArrayLit* al = eval_array_lit(env, call->arg(0)); if (al->dims() != 1) { std::stringstream ssm; ssm << "expecting 1-dimensional array of weights for discrete distribution instead of: " << *al << std::endl; throw EvalError(env, al->loc(), ssm.str()); } std::vector<long long int> weights(al->size()); for (unsigned int i = 0; i < al->size(); i++) { weights[i] = eval_int(env, (*al)[i]).toInt(); }#ifdef _MSC_VER std::size_t i(0); std::discrete_distribution<long long int> distribution( weights.size(), 0.0, 1.0, [&weights, &i](double d) { return weights[i++]; });#else std::discrete_distribution<long long int> distribution(weights.begin(), weights.end());#endif // return a sample from the distribution IntVal iv = IntVal(distribution(rnd_generator())); return iv;}
bool b_bernoulli(EnvI& env, Call* call) { assert(call->argCount() == 1); const double p = eval_float(env, call->arg(0)).toDouble(); std::bernoulli_distribution distribution(p); // return a sample from the distribution return distribution(rnd_generator());}
IntVal b_binomial(EnvI& env, Call* call) { assert(call->argCount() == 2); double t = double(eval_int(env, call->arg(0)).toInt()); double p = eval_float(env, call->arg(1)).toDouble(); std::binomial_distribution<long long int> distribution(t, p); // return a sample from the distribution return IntVal(distribution(rnd_generator()));}
FloatVal b_atan(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; FloatVal f = eval_float(env, call->arg(0)); return std::atan(f.toDouble());}
FloatVal b_cos(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; FloatVal f = eval_float(env, call->arg(0)); return std::cos(f.toDouble());}
FloatVal b_sin(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; FloatVal f = eval_float(env, call->arg(0)); return std::sin(f.toDouble());}
FloatVal b_asin(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; FloatVal f = eval_float(env, call->arg(0)); return std::asin(f.toDouble());}
FloatVal b_acos(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; FloatVal f = eval_float(env, call->arg(0)); return std::acos(f.toDouble());}
FloatVal b_tan(EnvI& env, Call* call) { assert(call->argCount() == 1); GCLock lock; FloatVal f = eval_float(env, call->arg(0)); return std::tan(f.toDouble());}
IntVal b_to_enum(EnvI& env, Call* call) { assert(call->argCount() == 2); IntSetVal* isv = eval_intset(env, call->arg(0)); IntVal v = eval_int(env, call->arg(1)); if (!isv->contains(v)) { throw ResultUndefinedError(env, call->loc(), "value outside of enum range"); } return v;}
IntVal b_enum_next(EnvI& env, Call* call) { IntSetVal* isv = eval_intset(env, call->arg(0)); IntVal v = eval_int(env, call->arg(1)); if (!isv->contains(v + 1)) { throw ResultUndefinedError(env, call->loc(), "value outside of enum range"); } return v + 1;}
IntVal b_enum_prev(EnvI& env, Call* call) { IntSetVal* isv = eval_intset(env, call->arg(0)); IntVal v = eval_int(env, call->arg(1)); if (!isv->contains(v - 1)) { throw ResultUndefinedError(env, call->loc(), "value outside of enum range"); } return v - 1;}
IntVal b_mzn_compiler_version(EnvI& /*env*/, Call* /*call*/) { return atoi(MZN_VERSION_MAJOR) * 10000 + atoi(MZN_VERSION_MINOR) * 1000 + atoi(MZN_VERSION_PATCH);}
Expression* b_slice(EnvI& env, Call* call) { ArrayLit* al = eval_array_lit(env, call->arg(0));
ArrayLit* slice = eval_array_lit(env, call->arg(1)); std::vector<std::pair<int, int>> newSlice(slice->size()); for (unsigned int i = 0; i < slice->size(); i++) { IntSetVal* isv = eval_intset(env, (*slice)[i]); if (isv->size() == 0) { newSlice[i] = std::pair<int, int>(1, 0); } else { if (isv->size() > 1) { throw ResultUndefinedError(env, call->loc(), "array slice must be contiguous"); } int sl_min = isv->min().isFinite() ? static_cast<int>(isv->min().toInt()) : al->min(i); int sl_max = isv->max().isFinite() ? static_cast<int>(isv->max().toInt()) : al->max(i); if (sl_min < al->min(i) || sl_max > al->max(i)) { throw ResultUndefinedError(env, call->loc(), "array slice out of bounds"); } newSlice[i] = std::pair<int, int>(sl_min, sl_max); } }
std::vector<std::pair<int, int>> newDims(call->argCount() - 2); for (unsigned int i = 0; i < newDims.size(); i++) { IntSetVal* isv = eval_intset(env, call->arg(2 + i)); if (isv->size() == 0) { newDims[i] = std::pair<int, int>(1, 0); } else { newDims[i] = std::pair<int, int>(static_cast<int>(isv->min().toInt()), static_cast<int>(isv->max().toInt())); } } auto* ret = new ArrayLit(al->loc(), al, newDims, newSlice); ret->type(call->type()); return ret;}
Expression* b_regular_from_string(EnvI& env, Call* call) {#ifdef HAS_GECODE using namespace Gecode; ArrayLit* vars = eval_array_lit(env, call->arg(0)); std::string expr = eval_string(env, call->arg(1));
IntSetVal* dom; if (vars->size() == 0) { dom = IntSetVal::a(); } else { dom = b_dom_varint(env, (*vars)[0]); for (unsigned int i = 1; i < vars->size(); i++) { IntSetRanges isr(dom); IntSetRanges r(b_dom_varint(env, (*vars)[i])); Ranges::Union<IntVal, IntSetRanges, IntSetRanges> u(isr, r); dom = IntSetVal::ai(u); } } long long int card = dom->max().toInt() - dom->min().toInt() + 1; int offset = 1 - static_cast<int>(dom->min().toInt());
// Replace all occurrences of enum constructor calls std::regex constructor_call( "([A-Za-z][A-Za-z0-9_]*|'[^'\\xa\\xd\\x0]*')[[:space:]]*\\([[:space:]]*([A-Za-z][A-Za-z0-9_]*" "|'[^'\\xa\\xd\\x0]*'|([0-9]*))[[:space:]]*\\)", std::regex_constants::egrep); while (std::regex_search(expr, constructor_call)) { std::ostringstream oss; auto id_re_it = std::sregex_token_iterator(expr.begin(), expr.end(), constructor_call, {-1, 1, 2, 3}); for (; id_re_it != std::sregex_token_iterator();) { std::string rest = *id_re_it; oss << rest; ++id_re_it; if (id_re_it == std::sregex_token_iterator()) { break; } std::string id1 = *id_re_it; ++id_re_it; std::string id2 = *id_re_it; ++id_re_it; std::string val3 = *id_re_it; ++id_re_it; // Enum constructor call, get both items Expression* arg; if (val3.empty()) { auto it = env.reverseEnum.find(id2); if (it == env.reverseEnum.end()) { throw std::runtime_error("Unknown identifier: " + id2); } auto* id2_vd = it->second->dynamicCast<VarDeclI>(); if (id2_vd == nullptr) { throw std::runtime_error("identifier " + id2 + " is not an enum constant"); } arg = id2_vd->e()->id(); } else { int v = std::stoi(val3); arg = IntLit::a(v); } auto it = env.reverseEnum.find(id1); if (it == env.reverseEnum.end()) { throw std::runtime_error("Unknown identifier: " + id2); } if (auto* id1_vdi = it->second->dynamicCast<VarDeclI>()) { // this is not an enum constructor, simply output both values IntVal result1 = eval_int(env, id1_vdi->e()->id()); IntVal result2 = eval_int(env, arg); oss << result1 << "(" << result2 << ")"; } else { auto* fi = it->second->cast<FunctionI>(); Call* c = new Call(Location().introduce(), fi->id(), {arg}); c->type(fi->rtype(env, {arg->type()}, true)); c->decl(fi);
IntVal result = eval_int(env, c); oss << result; } } expr = oss.str(); }
// Replace all remaining enum identifiers std::regex enumid("[A-Za-z][A-Za-z0-9_]*|'[^'\\xa\\xd\\x0]*'", std::regex_constants::egrep); auto id_re_it = std::sregex_token_iterator(expr.begin(), expr.end(), enumid, {-1, 0}); std::ostringstream oss; for (; id_re_it != std::sregex_token_iterator();) { std::string rest = *id_re_it; oss << rest; ++id_re_it; if (id_re_it == std::sregex_token_iterator()) { break; } std::string id1 = *id_re_it; ++id_re_it; auto it = env.reverseEnum.find(id1); if (it == env.reverseEnum.end()) { throw std::runtime_error("Unknown identifier: " + id1); } auto* id1_vd = it->second->dynamicCast<VarDeclI>(); if (id1_vd == nullptr) { throw std::runtime_error("identifier " + id1 + " is not an enum constant"); } IntVal result1 = eval_int(env, id1_vd->e()->id()); oss << result1; } expr = oss.str();
std::unique_ptr<REG> regex; try { regex = regex_from_string(expr, *dom); } catch (const std::exception& e) { throw SyntaxError(call->arg(1)->loc(), e.what()); } DFA dfa = DFA(*regex);
std::vector<std::vector<Expression*>> reg_trans( dfa.n_states(), std::vector<Expression*>(static_cast<size_t>(card), IntLit::a(IntVal(0))));
DFA::Transitions trans(dfa); while (trans()) { // std::cerr << trans.i_state() + 1 << " -- " << trans.symbol() << " --> " << // trans.o_state() + 1 << "\n"; if (trans.symbol() >= dom->min().toInt() && trans.symbol() <= dom->max().toInt()) { reg_trans[trans.i_state()][trans.symbol() + offset - 1] = IntLit::a(IntVal(trans.o_state() + 1)); } ++trans; }
std::vector<Expression*> args(6); if (offset == 0) { args[0] = vars; // x } else { std::vector<Expression*> nvars(vars->size()); IntLit* loffset = IntLit::a(IntVal(offset)); for (int i = 0; i < nvars.size(); ++i) { nvars[i] = new BinOp(call->loc().introduce(), (*vars)[i], BOT_PLUS, loffset); nvars[i]->type(Type::varint()); } args[0] = new ArrayLit(call->loc().introduce(), nvars); // x args[0]->type(Type::varint(1)); } args[1] = IntLit::a(IntVal(dfa.n_states())); // Q args[1]->type(Type::parint()); args[2] = IntLit::a(IntVal(card)); // S args[2]->type(Type::parint()); args[3] = new ArrayLit(call->loc().introduce(), reg_trans); // d args[3]->type(Type::parint(2)); args[4] = IntLit::a(IntVal(1)); // q0 args[4]->type(Type::parint()); args[5] = new SetLit(call->loc().introduce(), IntSetVal::a(IntVal(dfa.final_fst() + 1), IntVal(dfa.final_lst()))); // F args[5]->type(Type::parsetint());
auto* nc = new Call(call->loc().introduce(), "regular", args); nc->type(Type::varbool());
return nc;#else throw FlatteningError( env, call->loc(), "MiniZinc was compiled without built-in Gecode, cannot parse regular expression");#endif}
Expression* b_show_checker_output(EnvI& env, Call* call) { // Get checker output env.checkerOutput.flush(); std::string output = env.checkerOutput.str(); // Reset checker output env.checkerOutput.str(""); env.checkerOutput.clear(); return new StringLit(call->loc().introduce(), output);}
void register_builtins(Env& e) { EnvI& env = e.envi(); Model* m = env.model;
std::vector<Type> t_intint(2); t_intint[0] = Type::parint(); t_intint[1] = Type::parint();
std::vector<Type> t_intarray(1); t_intarray[0] = Type::parint(-1);
GCLock lock;
rb(env, m, ASTString("min"), t_intint, b_int_min); rb(env, m, ASTString("min"), t_intarray, b_int_min); rb(env, m, ASTString("max"), t_intint, b_int_max); rb(env, m, ASTString("max"), t_intarray, b_int_max); rb(env, m, constants().ids.sum, t_intarray, b_sum_int); rb(env, m, ASTString("product"), t_intarray, b_product_int); rb(env, m, ASTString("pow"), t_intint, b_pow_int);
rb(env, m, ASTString("'div'"), t_intint, b_idiv); rb(env, m, ASTString("'mod'"), t_intint, b_mod); rb(env, m, ASTString("'..'"), t_intint, b_dotdot); { std::vector<Type> t({Type::parfloat(), Type::parfloat()}); rb(env, m, ASTString("'/'"), t, b_fdiv); } { std::vector<Type> t(2); t[0] = Type::top(-1); t[1] = Type::top(-1); rb(env, m, ASTString("index_sets_agree"), t, b_index_sets_agree); } { std::vector<Type> t_anyarray1(1); t_anyarray1[0] = Type::optvartop(1); rb(env, m, ASTString("index_set"), t_anyarray1, b_index_set1); } { std::vector<Type> t_anyarray2(1); t_anyarray2[0] = Type::optvartop(2); rb(env, m, ASTString("index_set_1of2"), t_anyarray2, b_index_set1); rb(env, m, ASTString("index_set_2of2"), t_anyarray2, b_index_set2); } { std::vector<Type> t_anyarray3(1); t_anyarray3[0] = Type::optvartop(3); rb(env, m, ASTString("index_set_1of3"), t_anyarray3, b_index_set1); rb(env, m, ASTString("index_set_2of3"), t_anyarray3, b_index_set2); rb(env, m, ASTString("index_set_3of3"), t_anyarray3, b_index_set3); } { std::vector<Type> t_anyarray4(1); t_anyarray4[0] = Type::optvartop(4); rb(env, m, ASTString("index_set_1of4"), t_anyarray4, b_index_set1); rb(env, m, ASTString("index_set_2of4"), t_anyarray4, b_index_set2); rb(env, m, ASTString("index_set_3of4"), t_anyarray4, b_index_set3); rb(env, m, ASTString("index_set_4of4"), t_anyarray4, b_index_set4); } { std::vector<Type> t_anyarray5(1); t_anyarray5[0] = Type::optvartop(5); rb(env, m, ASTString("index_set_1of5"), t_anyarray5, b_index_set1); rb(env, m, ASTString("index_set_2of5"), t_anyarray5, b_index_set2); rb(env, m, ASTString("index_set_3of5"), t_anyarray5, b_index_set3); rb(env, m, ASTString("index_set_4of5"), t_anyarray5, b_index_set4); rb(env, m, ASTString("index_set_5of5"), t_anyarray5, b_index_set5); } { std::vector<Type> t_anyarray6(1); t_anyarray6[0] = Type::optvartop(6); rb(env, m, ASTString("index_set_1of6"), t_anyarray6, b_index_set1); rb(env, m, ASTString("index_set_2of6"), t_anyarray6, b_index_set2); rb(env, m, ASTString("index_set_3of6"), t_anyarray6, b_index_set3); rb(env, m, ASTString("index_set_4of6"), t_anyarray6, b_index_set4); rb(env, m, ASTString("index_set_5of6"), t_anyarray6, b_index_set5); rb(env, m, ASTString("index_set_6of6"), t_anyarray6, b_index_set6); } { std::vector<Type> t_arrayXd(1); t_arrayXd[0] = Type::top(-1); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d_list); t_arrayXd[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d_list); t_arrayXd[0] = Type::vartop(-1); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d_list); t_arrayXd[0] = Type::optvartop(-1); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d_list); } { std::vector<Type> t_arrayXd(2); t_arrayXd[0] = Type::parsetint(); t_arrayXd[1] = Type::top(-1); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d); t_arrayXd[1].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d); t_arrayXd[1] = Type::vartop(-1); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d); t_arrayXd[1] = Type::optvartop(-1); rb(env, m, ASTString("array1d"), t_arrayXd, b_array1d); } { std::vector<Type> t_arrayXd(2); t_arrayXd[0] = Type::optvartop(-1); t_arrayXd[1] = Type::top(-1); rb(env, m, ASTString("arrayXd"), t_arrayXd, b_arrayXd); t_arrayXd[1].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("arrayXd"), t_arrayXd, b_arrayXd); t_arrayXd[1] = Type::vartop(-1); rb(env, m, ASTString("arrayXd"), t_arrayXd, b_arrayXd); t_arrayXd[1] = Type::optvartop(-1); rb(env, m, ASTString("arrayXd"), t_arrayXd, b_arrayXd); } { std::vector<Type> t_arrayXd(3); t_arrayXd[0] = Type::parsetint(); t_arrayXd[1] = Type::parsetint(); t_arrayXd[2] = Type::top(-1); rb(env, m, ASTString("array2d"), t_arrayXd, b_array2d); t_arrayXd[2].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("array2d"), t_arrayXd, b_array2d); t_arrayXd[2] = Type::vartop(-1); rb(env, m, ASTString("array2d"), t_arrayXd, b_array2d); t_arrayXd[2] = Type::optvartop(-1); rb(env, m, ASTString("array2d"), t_arrayXd, b_array2d); } { std::vector<Type> t_arrayXd(4); t_arrayXd[0] = Type::parsetint(); t_arrayXd[1] = Type::parsetint(); t_arrayXd[2] = Type::parsetint(); t_arrayXd[3] = Type::top(-1); rb(env, m, ASTString("array3d"), t_arrayXd, b_array3d); t_arrayXd[3].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("array3d"), t_arrayXd, b_array3d); t_arrayXd[3] = Type::vartop(-1); rb(env, m, ASTString("array3d"), t_arrayXd, b_array3d); t_arrayXd[3] = Type::optvartop(-1); rb(env, m, ASTString("array3d"), t_arrayXd, b_array3d); } { std::vector<Type> t_arrayXd(5); t_arrayXd[0] = Type::parsetint(); t_arrayXd[1] = Type::parsetint(); t_arrayXd[2] = Type::parsetint(); t_arrayXd[3] = Type::parsetint(); t_arrayXd[4] = Type::top(-1); rb(env, m, ASTString("array4d"), t_arrayXd, b_array4d); t_arrayXd[4].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("array4d"), t_arrayXd, b_array4d); t_arrayXd[4] = Type::vartop(-1); rb(env, m, ASTString("array4d"), t_arrayXd, b_array4d); t_arrayXd[4] = Type::optvartop(-1); rb(env, m, ASTString("array4d"), t_arrayXd, b_array4d); } { std::vector<Type> t_arrayXd(6); t_arrayXd[0] = Type::parsetint(); t_arrayXd[1] = Type::parsetint(); t_arrayXd[2] = Type::parsetint(); t_arrayXd[3] = Type::parsetint(); t_arrayXd[4] = Type::parsetint(); t_arrayXd[5] = Type::top(-1); rb(env, m, ASTString("array5d"), t_arrayXd, b_array5d); t_arrayXd[5].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("array5d"), t_arrayXd, b_array5d); t_arrayXd[5] = Type::vartop(-1); rb(env, m, ASTString("array5d"), t_arrayXd, b_array5d); t_arrayXd[5] = Type::optvartop(-1); rb(env, m, ASTString("array5d"), t_arrayXd, b_array5d); } { std::vector<Type> t_arrayXd(7); t_arrayXd[0] = Type::parsetint(); t_arrayXd[1] = Type::parsetint(); t_arrayXd[2] = Type::parsetint(); t_arrayXd[3] = Type::parsetint(); t_arrayXd[4] = Type::parsetint(); t_arrayXd[5] = Type::parsetint(); t_arrayXd[6] = Type::top(-1); rb(env, m, ASTString("array6d"), t_arrayXd, b_array6d); t_arrayXd[6].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("array6d"), t_arrayXd, b_array6d); t_arrayXd[6] = Type::vartop(-1); rb(env, m, ASTString("array6d"), t_arrayXd, b_array6d); t_arrayXd[6] = Type::optvartop(-1); rb(env, m, ASTString("array6d"), t_arrayXd, b_array6d); } { std::vector<Type> stv(3); stv[0] = Type::partop(-1); stv[1] = Type::parsetint(1); stv[2] = Type::parsetint(); rb(env, m, ASTString("slice_1d"), stv, b_slice); stv[0] = Type::vartop(-1); rb(env, m, ASTString("slice_1d"), stv, b_slice); stv[0] = Type::optvartop(-1); rb(env, m, ASTString("slice_1d"), stv, b_slice); stv[0] = Type::optpartop(-1); rb(env, m, ASTString("slice_1d"), stv, b_slice);
stv.push_back(Type::parsetint()); stv[0] = Type::partop(-1); rb(env, m, ASTString("slice_2d"), stv, b_slice); stv[0] = Type::vartop(-1); rb(env, m, ASTString("slice_2d"), stv, b_slice); stv[0] = Type::optvartop(-1); rb(env, m, ASTString("slice_2d"), stv, b_slice); stv[0] = Type::optpartop(-1); rb(env, m, ASTString("slice_2d"), stv, b_slice);
stv.push_back(Type::parsetint()); stv[0] = Type::partop(-1); rb(env, m, ASTString("slice_3d"), stv, b_slice); stv[0] = Type::vartop(-1); rb(env, m, ASTString("slice_3d"), stv, b_slice); stv[0] = Type::optvartop(-1); rb(env, m, ASTString("slice_3d"), stv, b_slice); stv[0] = Type::optpartop(-1); rb(env, m, ASTString("slice_3d"), stv, b_slice);
stv.push_back(Type::parsetint()); stv[0] = Type::partop(-1); rb(env, m, ASTString("slice_4d"), stv, b_slice); stv[0] = Type::vartop(-1); rb(env, m, ASTString("slice_4d"), stv, b_slice); stv[0] = Type::optvartop(-1); rb(env, m, ASTString("slice_4d"), stv, b_slice); stv[0] = Type::optpartop(-1); rb(env, m, ASTString("slice_4d"), stv, b_slice);
stv.push_back(Type::parsetint()); stv[0] = Type::partop(-1); rb(env, m, ASTString("slice_5d"), stv, b_slice); stv[0] = Type::vartop(-1); rb(env, m, ASTString("slice_5d"), stv, b_slice); stv[0] = Type::optvartop(-1); rb(env, m, ASTString("slice_5d"), stv, b_slice); stv[0] = Type::optpartop(-1); rb(env, m, ASTString("slice_5d"), stv, b_slice);
stv.push_back(Type::parsetint()); stv[0] = Type::partop(-1); rb(env, m, ASTString("slice_6d"), stv, b_slice); stv[0] = Type::vartop(-1); rb(env, m, ASTString("slice_6d"), stv, b_slice); stv[0] = Type::optvartop(-1); rb(env, m, ASTString("slice_6d"), stv, b_slice); stv[0] = Type::optpartop(-1); rb(env, m, ASTString("slice_6d"), stv, b_slice); } { std::vector<Type> t(2); t[0] = Type::parbool(); t[1] = Type::parstring(); rb(env, m, constants().ids.assert, t, b_assert_bool); } { std::vector<Type> t(3); t[0] = Type::parbool(); t[1] = Type::parstring(); t[2] = Type::top(); rb(env, m, constants().ids.assert, t, b_assert); t[2] = Type::optpartop(); rb(env, m, constants().ids.assert, t, b_assert); t[2] = Type::vartop(); rb(env, m, constants().ids.assert, t, b_assert); t[2] = Type::optvartop(); rb(env, m, constants().ids.assert, t, b_assert); t[2] = Type::top(-1); rb(env, m, constants().ids.assert, t, b_assert); t[2] = Type::optpartop(-1); rb(env, m, constants().ids.assert, t, b_assert); t[2] = Type::vartop(-1); rb(env, m, constants().ids.assert, t, b_assert); t[2] = Type::optvartop(-1); rb(env, m, constants().ids.assert, t, b_assert); } { std::vector<Type> t(4); t[0] = Type::parstring(); t[1] = Type::parstring(); t[2] = Type::parstring(); t[3] = Type::top(); rb(env, m, constants().ids.mzn_deprecate, t, b_mzn_deprecate); t[3] = Type::vartop(); rb(env, m, constants().ids.mzn_deprecate, t, b_mzn_deprecate); t[3] = Type::optvartop(); rb(env, m, constants().ids.mzn_deprecate, t, b_mzn_deprecate); t[3] = Type::top(-1); rb(env, m, constants().ids.mzn_deprecate, t, b_mzn_deprecate); t[3] = Type::vartop(-1); rb(env, m, constants().ids.mzn_deprecate, t, b_mzn_deprecate); t[3] = Type::optvartop(-1); rb(env, m, constants().ids.mzn_deprecate, t, b_mzn_deprecate); } { rb(env, m, constants().ids.mzn_symmetry_breaking_constraint, {Type::varbool()}, b_mzn_symmetry_breaking_constraint); rb(env, m, constants().ids.mzn_redundant_constraint, {Type::varbool()}, b_mzn_redundant_constraint); } { std::vector<Type> t(1); t[0] = Type::parstring(); rb(env, m, ASTString("abort"), t, b_abort); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); } { std::vector<Type> t; rb(env, m, ASTString("logstream_to_string"), t, b_logstream); } { std::vector<Type> t(2); t[0] = Type::parstring(); t[1] = Type::top(); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); t[1] = Type::optpartop(); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); t[1] = Type::vartop(); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); t[1] = Type::optvartop(); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); t[1] = Type::top(-1); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); t[1] = Type::optpartop(-1); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); t[1] = Type::vartop(-1); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); t[1] = Type::optvartop(-1); rb(env, m, constants().ids.trace, t, b_trace); rb(env, m, ASTString("trace_stdout"), t, b_trace_stdout); rb(env, m, ASTString("trace_logstream"), t, b_trace_logstream); } { rb(env, m, ASTString("output_to_section"), {Type::parstring(), Type::parstring()}, b_output_to_section); } { rb(env, m, ASTString("mzn_in_redundant_constraint"), std::vector<Type>(), b_in_redundant_constraint); } { rb(env, m, ASTString("mzn_in_symmetry_breaking_constraint"), std::vector<Type>(), b_in_symmetry_breaking_constraint); } { std::vector<Type> t_length(1); t_length[0] = Type::optvartop(-1); rb(env, m, ASTString("length"), t_length, b_length); } { std::vector<Type> t(1); t[0] = Type::parbool(); rb(env, m, constants().ids.bool2int, t, b_bool2int); } { std::vector<Type> t(1); t[0] = Type::parbool(-1); rb(env, m, constants().ids.forall, t, b_forall_par); rb(env, m, constants().ids.exists, t, b_exists_par); rb(env, m, ASTString("xorall"), t, b_xorall_par); rb(env, m, ASTString("iffall"), t, b_iffall_par); } { rb(env, m, constants().ids.bool_not, {Type::parbool()}, b_not_par); } { std::vector<Type> t(2); t[0] = Type::parbool(-1); t[1] = Type::parbool(-1); rb(env, m, constants().ids.clause, t, b_clause_par); } { std::vector<Type> t(1); t[0] = Type::varsetint(); rb(env, m, ASTString("ub"), t, b_ub_set); rb(env, m, ASTString("lb"), t, b_lb_set); } { std::vector<Type> t(1); t[0] = Type::varsetint(1); rb(env, m, ASTString("ub_array"), t, b_array_ub_set); } { std::vector<Type> t(1); t[0] = Type::varint(); rb(env, m, ASTString("dom"), t, b_dom_varint); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("dom"), t, b_dom_varint); } { std::vector<Type> t(1); t[0] = Type::varint(-1); rb(env, m, ASTString("dom_array"), t, b_dom_array); rb(env, m, ASTString("dom_bounds_array"), t, b_dom_bounds_array); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("dom_array"), t, b_dom_array); rb(env, m, ASTString("dom_bounds_array"), t, b_dom_bounds_array); } { std::vector<Type> t(1); t[0] = Type::parsetint(); rb(env, m, ASTString("min"), t, b_min_parsetint); } { std::vector<Type> t(1); t[0] = Type::parsetint(); rb(env, m, ASTString("max"), t, b_max_parsetint); } { std::vector<Type> t(1); t[0] = Type::varint(); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("lb"), t, b_lb_varoptint); } { std::vector<Type> t(1); t[0] = Type::varint(); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("ub"), t, b_ub_varoptint); } { std::vector<Type> t(1); t[0] = Type::varint(); rb(env, m, ASTString("lb"), t, b_lb_varoptint); } { std::vector<Type> t(1); t[0] = Type::varint(); rb(env, m, ASTString("ub"), t, b_ub_varoptint); } { std::vector<Type> t(1); t[0] = Type::varint(-1); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("lb_array"), t, b_array_lb_int); } { std::vector<Type> t(1); t[0] = Type::varint(-1); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("ub_array"), t, b_array_ub_int); } { std::vector<Type> t(1); t[0] = Type::varfloat(); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("lb"), t, b_lb_varoptfloat); } { std::vector<Type> t(1); t[0] = Type::varfloat(); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("ub"), t, b_ub_varoptfloat); } { std::vector<Type> t(1); t[0] = Type::varfloat(); rb(env, m, ASTString("lb"), t, b_lb_varoptfloat); } { std::vector<Type> t(1); t[0] = Type::varfloat(); rb(env, m, ASTString("ub"), t, b_ub_varoptfloat); } { std::vector<Type> t(1); t[0] = Type::varfloat(-1); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("lb_array"), t, b_array_lb_float); } { std::vector<Type> t(1); t[0] = Type::varfloat(-1); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("ub_array"), t, b_array_ub_float); } { std::vector<Type> t(1); t[0] = Type::parsetint(); rb(env, m, ASTString("card"), t, b_card); } { std::vector<Type> t(1); t[0] = Type::parsetint(); rb(env, m, ASTString("set_to_ranges"), t, b_set_to_ranges_int); t[0] = Type::parsetfloat(); rb(env, m, ASTString("set_to_ranges"), t, b_set_to_ranges_float); } { std::vector<Type> t(1); t[0] = Type::parint(); rb(env, m, ASTString("abs"), t, b_abs_int); t[0] = Type::parfloat(); rb(env, m, ASTString("abs"), t, b_abs_float); } { std::vector<Type> t(1); t[0] = Type::varint(); rb(env, m, ASTString("has_bounds"), t, b_has_bounds_int); } { std::vector<Type> t(1); t[0] = Type::varfloat(); rb(env, m, ASTString("has_bounds"), t, b_has_bounds_float); } { std::vector<Type> t(1); t[0] = Type::varsetint(); rb(env, m, ASTString("has_ub_set"), t, b_has_ub_set); } { std::vector<Type> t(1); t[0] = Type::optvartop(); rb(env, m, ASTString("is_fixed"), t, b_is_fixed); t[0] = Type::varsetint(); rb(env, m, ASTString("is_fixed"), t, b_is_fixed); Type setoftop; setoftop.bt(Type::BT_TOP); setoftop.st(Type::ST_SET); setoftop.ti(Type::TI_PAR); setoftop.ot(Type::OT_PRESENT); t[0] = setoftop; rb(env, m, ASTString("is_fixed"), t, b_is_fixed); } { std::vector<Type> t(1); t[0] = Type::optvartop(-1); rb(env, m, ASTString("is_fixed"), t, b_is_fixed_array); } { std::vector<Type> t(2); t[0] = t[1] = Type::optvartop(); rb(env, m, ASTString("is_same"), t, b_is_same); } { std::vector<Type> t(1); t[0] = Type::optvartop(); rb(env, m, ASTString("fix"), t, b_fix_bool); rb(env, m, ASTString("fix"), t, b_fix_int); rb(env, m, ASTString("fix"), t, b_fix_set); rb(env, m, ASTString("fix"), t, b_fix_float); } { std::vector<Type> t(1); t[0] = Type::optvartop(1); rb(env, m, ASTString("fix"), t, b_fix_array); } { std::vector<Type> t(2); t[0] = Type::optvartop(); t[1] = Type::ann(); rb(env, m, ASTString("has_ann"), t, b_has_ann); t[0] = Type::varsetint(); rb(env, m, ASTString("has_ann"), t, b_has_ann); Type setoftop; setoftop.bt(Type::BT_TOP); setoftop.st(Type::ST_SET); setoftop.ti(Type::TI_PAR); setoftop.ot(Type::OT_PRESENT); t[0] = setoftop; rb(env, m, ASTString("has_ann"), t, b_has_ann); } { std::vector<Type> t(2); t[0] = Type::optvartop(); t[1] = Type::ann(); rb(env, m, ASTString("annotate"), t, b_annotate); t[0] = Type::varsetint(); rb(env, m, ASTString("annotate"), t, b_annotate); Type setoftop; setoftop.bt(Type::BT_TOP); setoftop.st(Type::ST_SET); setoftop.ti(Type::TI_PAR); setoftop.ot(Type::OT_PRESENT); t[0] = setoftop; rb(env, m, ASTString("annotate"), t, b_annotate); } { std::vector<Type> t(1); t[0] = Type::parint(); rb(env, m, ASTString("int2float"), t, b_int2float); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("ceil"), t, b_ceil); rb(env, m, ASTString("floor"), t, b_floor); rb(env, m, ASTString("round"), t, b_round); rb(env, m, ASTString("log10"), t, b_log10); rb(env, m, ASTString("log2"), t, b_log2); rb(env, m, ASTString("ln"), t, b_ln); rb(env, m, ASTString("exp"), t, b_exp); rb(env, m, ASTString("sqrt"), t, b_sqrt); t.push_back(Type::parfloat()); rb(env, m, ASTString("log"), t, b_log); rb(env, m, ASTString("pow"), t, b_pow); } { std::vector<Type> t(1); t[0] = Type::parfloat(1); rb(env, m, constants().ids.sum, t, b_sum_float); rb(env, m, ASTString("product"), t, b_product_float); } { std::vector<Type> t(1); t[0] = Type::parfloat(1); rb(env, m, ASTString("min"), t, b_float_min); rb(env, m, ASTString("max"), t, b_float_max);
t[0] = Type::parfloat(); t.push_back(Type::parfloat()); rb(env, m, ASTString("min"), t, b_float_min); rb(env, m, ASTString("max"), t, b_float_max); } { std::vector<Type> t(1); t[0] = Type::parsetint(); rb(env, m, ASTString("set2array"), t, b_set2array); } { std::vector<Type> t(1); t[0] = Type::parstring(); rb(env, m, ASTString("string_length"), t, b_string_length); } { rb(env, m, ASTString("file_path"), std::vector<Type>(), b_file_path); } { std::vector<Type> t(1); t[0] = Type::vartop(); rb(env, m, ASTString("show"), t, b_show); rb(env, m, ASTString("showJSON"), t, b_show_json); t[0] = Type::vartop(); t[0].st(Type::ST_SET); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("show"), t, b_show); rb(env, m, ASTString("showJSON"), t, b_show_json); t[0] = Type::vartop(-1); rb(env, m, ASTString("show"), t, b_show); rb(env, m, ASTString("showJSON"), t, b_show_json); } { std::vector<Type> t(1); t[0] = Type::parstring(); rb(env, m, ASTString("showDznId"), t, b_show_dzn_id); } { std::vector<Type> t(3); t[0] = t[1] = Type::parint(); t[2] = Type::vartop(); rb(env, m, ASTString("format"), t, b_format); t[2] = Type::vartop(); t[2].st(Type::ST_SET); t[2].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("format"), t, b_format); t[2] = Type::vartop(-1); rb(env, m, ASTString("format"), t, b_format); } { std::vector<Type> t(2); t[0] = Type::parint(); t[1] = Type::vartop(); rb(env, m, ASTString("format"), t, b_format); t[1] = Type::vartop(); t[1].st(Type::ST_SET); t[1].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("format"), t, b_format); t[1] = Type::vartop(-1); rb(env, m, ASTString("format"), t, b_format); t[1] = Type::parstring(); rb(env, m, ASTString("format_justify_string"), t, b_format_justify_string); } { std::vector<Type> t; rb(env, m, ASTString("outputJSON"), t, b_output_json); rb(env, m, ASTString("outputJSONParameters"), t, b_output_json_parameters); } { std::vector<Type> t(2); t[0] = Type::parint(); t[1] = Type::varint(); rb(env, m, ASTString("show_int"), t, b_show_int); } { std::vector<Type> t(3); t[0] = Type::parint(); t[1] = Type::parint(); t[2] = Type::varfloat(); rb(env, m, ASTString("show_float"), t, b_show_float); } { std::vector<Type> t(1); t[0] = Type::parstring(1); rb(env, m, ASTString("concat"), t, b_concat); } { std::vector<Type> t(2); t[0] = Type::parstring(); t[1] = Type::parstring(1); rb(env, m, ASTString("join"), t, b_join); } { std::vector<Type> t(2); t[0] = Type::varint(); t[1] = Type::varint(); rb(env, m, ASTString("compute_div_bounds"), t, b_compute_div_bounds); } { std::vector<Type> t(1); t[0] = Type::parsetint(1); rb(env, m, ASTString("array_intersect"), t, b_array_intersect); rb(env, m, ASTString("array_union"), t, b_array_union); } { std::vector<Type> t(1); t[0] = Type::parint(); t[0].ot(Type::OT_OPTIONAL); t[0].bt(Type::BT_TOP); rb(env, m, ASTString("occurs"), t, b_occurs); rb(env, m, ASTString("deopt"), t, b_deopt_expr); t[0].bt(Type::BT_INT); rb(env, m, ASTString("deopt"), t, b_deopt_int); t[0].bt(Type::BT_BOOL); rb(env, m, ASTString("deopt"), t, b_deopt_bool); t[0].bt(Type::BT_FLOAT); rb(env, m, ASTString("deopt"), t, b_deopt_float); t[0].bt(Type::BT_STRING); rb(env, m, ASTString("deopt"), t, b_deopt_string); t[0].bt(Type::BT_INT); t[0].st(Type::ST_SET); rb(env, m, ASTString("deopt"), t, b_deopt_intset); } { std::vector<Type> t(2); t[0] = Type::varbot(1); t[1] = Type::parint(1); rb(env, m, ASTString("sort_by"), t, b_sort_by_int); t[0] = Type::bot(1); rb(env, m, ASTString("sort_by"), t, b_sort_by_int); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("sort_by"), t, b_sort_by_int); } { std::vector<Type> t(2); t[0] = Type::varbot(1); t[1] = Type::parfloat(1); rb(env, m, ASTString("sort_by"), t, b_sort_by_float); t[0] = Type::bot(1); rb(env, m, ASTString("sort_by"), t, b_sort_by_float); t[0].ot(Type::OT_OPTIONAL); rb(env, m, ASTString("sort_by"), t, b_sort_by_float); } { std::vector<Type> t(1); t[0] = Type::parint(1); rb(env, m, ASTString("sort"), t, b_sort); rb(env, m, ASTString("arg_min"), t, b_arg_min_int); rb(env, m, ASTString("arg_max"), t, b_arg_max_int); t[0] = Type::parbool(1); rb(env, m, ASTString("sort"), t, b_sort); rb(env, m, ASTString("arg_min"), t, b_arg_min_bool); rb(env, m, ASTString("arg_max"), t, b_arg_max_bool); t[0] = Type::parfloat(1); rb(env, m, ASTString("sort"), t, b_sort); rb(env, m, ASTString("arg_min"), t, b_arg_min_float); rb(env, m, ASTString("arg_max"), t, b_arg_max_float); } { std::vector<Type> t(1); t[0] = Type::parint(1); rb(env, m, ASTString("inverse"), t, b_inverse, true); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("atan"), t, b_atan); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("cos"), t, b_cos); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("sin"), t, b_sin); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("asin"), t, b_asin); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("acos"), t, b_acos); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("tan"), t, b_tan); } { std::vector<Type> t(2); t[0] = Type::parfloat(); t[1] = Type::parfloat(); rb(env, m, ASTString("normal"), t, b_normal_float_float); t[0] = Type::parint(); rb(env, m, ASTString("normal"), t, b_normal_int_float); } { std::vector<Type> t(2); t[0] = Type::parfloat(); t[1] = Type::parfloat(); rb(env, m, ASTString("uniform"), t, b_uniform_float); t[0] = Type::parint(); t[1] = Type::parint(); rb(env, m, ASTString("uniform"), t, b_uniform_int); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("poisson"), t, b_poisson_float); t[0] = Type::parint(); rb(env, m, ASTString("poisson"), t, b_poisson_int); } { std::vector<Type> t(2); t[0] = Type::parfloat(); t[1] = Type::parfloat(); rb(env, m, ASTString("gamma"), t, b_gamma_float_float); t[0] = Type::parint(); rb(env, m, ASTString("gamma"), t, b_gamma_int_float); } { std::vector<Type> t(2); t[0] = Type::parfloat(); t[1] = Type::parfloat(); rb(env, m, ASTString("weibull"), t, b_weibull_float_float); t[0] = Type::parint(); rb(env, m, ASTString("weibull"), t, b_weibull_int_float); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("exponential"), t, b_exponential_float); t[0] = Type::parint(); rb(env, m, ASTString("exponential"), t, b_exponential_int); } { std::vector<Type> t(2); t[0] = Type::parfloat(); t[1] = Type::parfloat(); rb(env, m, ASTString("lognormal"), t, b_lognormal_float_float); t[0] = Type::parint(); rb(env, m, ASTString("lognormal"), t, b_lognormal_int_float); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("chisquared"), t, b_chisquared_float); t[0] = Type::parint(); rb(env, m, ASTString("chisquared"), t, b_chisquared_int); } { std::vector<Type> t(2); t[0] = Type::parfloat(); t[1] = Type::parfloat(); rb(env, m, ASTString("cauchy"), t, b_cauchy_float_float); t[0] = Type::parint(); rb(env, m, ASTString("cauchy"), t, b_cauchy_int_float); } { std::vector<Type> t(2); t[0] = Type::parfloat(); t[1] = Type::parfloat(); rb(env, m, ASTString("fdistribution"), t, b_fdistribution_float_float); t[0] = Type::parint(); t[1] = Type::parint(); rb(env, m, ASTString("fdistribution"), t, b_fdistribution_int_int); } { std::vector<Type> t(1); t[0] = Type::parfloat(); rb(env, m, ASTString("tdistribution"), t, b_tdistribution_float); t[0] = Type::parint(); rb(env, m, ASTString("tdistribution"), t, b_tdistribution_int); } { std::vector<Type> t(1); t[0] = Type::parint(1); rb(env, m, ASTString("discrete_distribution"), t, b_discrete_distribution); } { std::vector<Type> t(1); t[0] = Type::parint(); rb(env, m, ASTString("bernoulli"), t, b_bernoulli); } { std::vector<Type> t(2); t[0] = Type::parint(); t[1] = Type::parfloat(); rb(env, m, ASTString("binomial"), t, b_binomial); } { std::vector<Type> t(2); t[0] = Type::parsetint(); t[1] = Type::parint(); rb(env, m, ASTString("to_enum"), t, b_to_enum); rb(env, m, ASTString("enum_next"), t, b_enum_next); rb(env, m, ASTString("enum_prev"), t, b_enum_prev); } { rb(env, m, ASTString("mzn_compiler_version"), std::vector<Type>(), b_mzn_compiler_version); } { std::vector<Type> t(2); t[0] = Type::varint(1); t[1] = Type::parstring(); rb(env, m, ASTString("fzn_regular"), t, b_regular_from_string, true); } { rb(env, m, ASTString("showCheckerOutput"), {}, b_show_checker_output); }}
} // namespace MiniZinc