12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639 |
- #include "mkql_computation_node_ut.h"
- #include <yql/essentials/minikql/mkql_runtime_version.h>
- #include <yql/essentials/minikql/comp_nodes/mkql_grace_join_imp.h>
- #include <yql/essentials/minikql/computation/mock_spiller_factory_ut.h>
- #include <chrono>
- #include <iostream>
- #include <cstring>
- #include <vector>
- #include <cassert>
- #include <cstdlib>
- #include <stdlib.h>
- #include <random>
- #include <util/system/compiler.h>
- #include <util/stream/null.h>
- #include <util/system/mem_info.h>
- #include <cstdint>
- namespace NKikimr {
- namespace NMiniKQL {
- constexpr bool IsVerbose = false;
- #define CTEST (IsVerbose ? Cerr : Cnull)
- Y_UNIT_TEST_SUITE(TMiniKQLGraceJoinMemTest) {
- Y_UNIT_TEST(TestMem1) {
- const ui64 TupleSize = 1024;
- const ui64 NBuckets = 128;
- const ui64 NTuples = 100000;
- const ui64 BucketSize = (2* NTuples * (TupleSize + 1) ) / NBuckets;
- ui64 *bigTuple = (ui64 * ) malloc(TupleSize * sizeof(ui64));
- ui64 *buckets[NBuckets];
- ui64 tuplesPos[NBuckets];
- std::mt19937_64 rng;
- std::uniform_int_distribution<ui64> dist(0, 10000 - 1);
- for (ui64 i = 0; i < TupleSize; i++)
- {
- bigTuple[i] = dist(rng);
- }
- ui64 bucket = 0;
- ui64 milliseconds = 0;
- const ui64 BitsForData = 30;
- char* a = (char * )malloc(1 << BitsForData);
- char* b = (char *) malloc(1 << BitsForData);
- UNIT_ASSERT(a);
- UNIT_ASSERT(b);
- memset(a, 1, 1 << BitsForData);
- memset(b, 2, 1 << BitsForData);
- std::chrono::steady_clock::time_point begin01 = std::chrono::steady_clock::now();
- memcpy(b, a, 1 << BitsForData);
- std::chrono::steady_clock::time_point end01 = std::chrono::steady_clock::now();
- UNIT_ASSERT(*a == 1);
- UNIT_ASSERT(*b == 1);
- Y_DO_NOT_OPTIMIZE_AWAY(a);
- Y_DO_NOT_OPTIMIZE_AWAY(b);
- ui64 microseconds = std::chrono::duration_cast<std::chrono::microseconds>(end01 - begin01).count();
- CTEST << "Time for memcpy = " << microseconds << "[microseconds]" << Endl;
- CTEST << "Data size = " << (1<<BitsForData) / (1024 * 1024) << "[MB]" << Endl;
- CTEST << "Memcpy speed = " << ( (1<<BitsForData) ) / (microseconds) << "MB/sec" << Endl;
- CTEST << Endl;
- std::vector<std::vector<ui64>> vec_buckets;
- vec_buckets.resize(NBuckets);
- for (ui64 i = 0; i < NBuckets; i++)
- {
- vec_buckets[i].resize(2 * TupleSize * NTuples / (NBuckets - 1), 0);
- vec_buckets[i].clear();
- // vec_buckets[i].reserve( 2 * TupleSize * NTuples / (NBuckets - 1));
- }
- for (ui64 i = 0; i < NBuckets; i++) {
- buckets[i] = (ui64 * ) malloc( (BucketSize * sizeof(ui64) * 32) / 32);
- memset( buckets[i], 1, (BucketSize * sizeof(ui64) * 32) / 32);
- tuplesPos[i] = 0;
- }
- std::chrono::steady_clock::time_point begin02 = std::chrono::steady_clock::now();
- std::uniform_int_distribution<ui64> bucketDist(0, NBuckets - 1);
- for (ui64 i = 0; i < NTuples; i++)
- {
- bucket = i % NBuckets;
- // bucket = bucketDist(rng);
- std::vector<ui64> &curr_vec = vec_buckets[bucket];
- curr_vec.insert(curr_vec.end(), bigTuple, bigTuple + TupleSize);
- }
- std::chrono::steady_clock::time_point end02 = std::chrono::steady_clock::now();
- milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(end02 - begin02).count();
- CTEST << "Time for std::insert = " << milliseconds << "[ms]" << Endl;
- CTEST << "Total MB = " << (TupleSize * NTuples * sizeof(ui64) / (1024 * 1024)) << Endl;
- CTEST << "std::insert speed = " << (TupleSize * NTuples * sizeof(ui64) * 1000) / (milliseconds * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- std::chrono::steady_clock::time_point begin03 = std::chrono::steady_clock::now();
- for (ui64 i = 0; i < NTuples; i++)
- {
- bucket = i % NBuckets;
- // bucket = bucketDist(rng);
- ui64 * dst = buckets[bucket] + tuplesPos[bucket];
- std::memcpy(dst, bigTuple, TupleSize*sizeof(ui64));
- tuplesPos[bucket] += TupleSize;
- }
- std::chrono::steady_clock::time_point end03 = std::chrono::steady_clock::now();
- milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- CTEST << "Time for std::memcpy = " << milliseconds << "[ms]" << Endl;
- CTEST << "Total MB = " << (TupleSize * NTuples * sizeof(ui64) / (1024 * 1024)) << Endl;
- CTEST << "std:memcpy speed = " << (TupleSize * NTuples * sizeof(ui64) * 1000) / (milliseconds * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- for (ui64 i = 0; i < NBuckets; i++) {
- tuplesPos[i] = 0;
- }
- std::chrono::steady_clock::time_point begin04 = std::chrono::steady_clock::now();
- for (ui64 i = 0; i < NTuples; i++)
- {
- bucket = bucketDist(rng);
- ui64 * dst = buckets[bucket] + tuplesPos[bucket];
- ui64 *dst1 = dst + 1;
- ui64 *dst2 = dst + 2;
- ui64 *dst3 = dst + 3;
- ui64 *src = bigTuple;
- ui64 *src1 = bigTuple + 1;
- ui64 *src2 = bigTuple + 2;
- ui64 *src3 = bigTuple + 3;
- for (ui64 i = 0; i < TupleSize; i += 4)
- {
- *dst++ = *src++;
- *dst1++ = *src1++;
- *dst2++ = *src2++;
- *dst3++ = *src3++;
- }
- tuplesPos[bucket] += TupleSize;
- }
- std::chrono::steady_clock::time_point end04 = std::chrono::steady_clock::now();
- milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(end04 - begin04).count();
- CTEST << "Time for loop copy = " << milliseconds << "[ms]" << Endl;
- CTEST << "Total MB = " << (TupleSize * NTuples * sizeof(ui64) / (1024 * 1024)) << Endl;
- CTEST << "Loop copy speed = " << (TupleSize * NTuples * sizeof(ui64) * 1000) / (milliseconds * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- for (ui64 i = 0; i < NBuckets; i++) {
- free(buckets[i]);
- }
- free(b);
- free(a);
- free(bigTuple);
- UNIT_ASSERT(true);
- }
- }
- Y_UNIT_TEST_SUITE(TMiniKQLGraceJoinImpTest) {
- constexpr ui64 BigTableTuples = 600000;
- constexpr ui64 SmallTableTuples = 150000;
- constexpr ui64 BigTupleSize = 40;
- Y_UNIT_TEST_TWIN(TestTryToPreallocateMemoryForJoin, EXCEPTION) {
- TSetup<false> setup;
- ui64 tuple[11] = {0,1,2,3,4,5,6,7,8,9,10};
- ui32 strSizes[2] = {4, 4};
- char * strVals[] = {(char *)"aaaaa", (char *)"bbbb"};
- char * bigStrVal[] = {(char *)"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
- (char *)"bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb"};
- ui32 bigStrSize[2] = {151, 151};
- GraceJoin::TTable bigTable(1,1,1,1);
- GraceJoin::TTable smallTable(1,1,1,1);
- GraceJoin::TTable joinTable(1,1,1,1);
- const ui64 TupleSize = 1024;
- ui64 bigTuple[TupleSize];
- std::mt19937_64 rng; // deterministic PRNG
- std::uniform_int_distribution<ui64> dist(0, 10000 - 1);
- for (ui64 i = 0; i < TupleSize; i++) {
- bigTuple[i] = dist(rng);
- }
- std::uniform_int_distribution<ui64> smallDist(0, SmallTableTuples - 1);
- smallTable.AddTuple(tuple, bigStrVal, bigStrSize);
- for ( ui64 i = 0; i < SmallTableTuples + 1; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- smallTable.AddTuple(tuple, strVals, strSizes);
- }
- for ( ui64 i = 0; i < BigTableTuples; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- bigTable.AddTuple(tuple, strVals, strSizes);
- }
- ui64 allocationsCount = 0;
- if (EXCEPTION) {
- TlsAllocState->SetLimit(1);
- TlsAllocState->SetIncreaseMemoryLimitCallback([&allocationsCount](ui64, ui64 required) {
- // Preallocate memory for some buckets before fail
- if (allocationsCount++ > 5) {
- throw TMemoryLimitExceededException();
- }
- TlsAllocState->SetLimit(required);
- });
- }
- bool preallocationResult = joinTable.TryToPreallocateMemoryForJoin(smallTable, bigTable, EJoinKind::Inner, true, true);
- UNIT_ASSERT_EQUAL(preallocationResult, !EXCEPTION);
- }
- Y_UNIT_TEST_LLVM(TestImp1) {
- TSetup<LLVM> setup;
- ui64 tuple[11] = {0,1,2,3,4,5,6,7,8,9,10};
- ui32 strSizes[2] = {4, 4};
- char * strVals[] = {(char *)"aaaaa", (char *)"bbbb"};
- char * bigStrVal[] = {(char *)"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
- (char *)"bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb"};
- ui32 bigStrSize[2] = {151, 151};
- NMemInfo::TMemInfo mi = NMemInfo::GetMemInfo();
- CTEST << "Mem usage before tables tuples added (MB): " << mi.RSS / (1024 * 1024) << Endl;
- GraceJoin::TTable bigTable(1,1,1,1);
- GraceJoin::TTable smallTable(1,1,1,1);
- GraceJoin::TTable joinTable(1,1,1,1);
- std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
- const ui64 TupleSize = 1024;
- ui64 bigTuple[TupleSize];
- std::mt19937_64 rng; // deterministic PRNG
- std::uniform_int_distribution<ui64> dist(0, 10000 - 1);
- for (ui64 i = 0; i < TupleSize; i++) {
- bigTuple[i] = dist(rng);
- }
- ui64 milliseconds = 0;
- std::uniform_int_distribution<ui64> smallDist(0, SmallTableTuples - 1);
- std::chrono::steady_clock::time_point begin03 = std::chrono::steady_clock::now();
- smallTable.AddTuple(tuple, bigStrVal, bigStrSize);
- for ( ui64 i = 0; i < SmallTableTuples + 1; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- smallTable.AddTuple(tuple, strVals, strSizes);
- }
- for ( ui64 i = 0; i < BigTableTuples; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- bigTable.AddTuple(tuple, strVals, strSizes);
- }
- std::chrono::steady_clock::time_point end03 = std::chrono::steady_clock::now();
- milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- CTEST << "Time for hash = " << milliseconds << "[ms]" << Endl;
- CTEST << "Adding tuples speed: " << (BigTupleSize * (BigTableTuples + SmallTableTuples) * 1000) / ( milliseconds * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- mi = NMemInfo::GetMemInfo();
- CTEST << "Mem usage after tables tuples added (MB): " << mi.RSS / (1024 * 1024) << Endl;
- bigTable.Clear();
- smallTable.Clear();
- begin03 = std::chrono::steady_clock::now();
- smallTable.AddTuple(tuple, bigStrVal, bigStrSize);
- for ( ui64 i = 0; i < SmallTableTuples + 1; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- smallTable.AddTuple(tuple, strVals, strSizes);
- }
- for ( ui64 i = 0; i < BigTableTuples; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- bigTable.AddTuple(tuple, strVals, strSizes);
- }
- end03 = std::chrono::steady_clock::now();
- milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- CTEST << "Time for hash = " << milliseconds << "[ms]" << Endl;
- CTEST << "Adding tuples speed: " << (BigTupleSize * (BigTableTuples + SmallTableTuples) * 1000) / ( milliseconds * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- mi = NMemInfo::GetMemInfo();
- CTEST << "Mem usage after tables tuples added (MB): " << mi.RSS / (1024 * 1024) << Endl;
- std::vector<ui64> vals1, vals2;
- std::vector<char *> strVals1, strVals2;
- std::vector<ui32> strSizes1, strSizes2;
- GraceJoin::TupleData td1, td2;
- vals1.resize(100);
- vals2.resize(100);
- strVals1.resize(100);
- strVals2.resize(100);
- strSizes1.resize(100);
- strSizes2.resize(100);
- td1.IntColumns = vals1.data();
- td1.StrColumns = strVals1.data();
- td1.StrSizes = strSizes1.data();
- td2.IntColumns = vals2.data();
- td2.StrColumns = strVals2.data();
- td2.StrSizes = strSizes2.data();
- ui64 numBigTuples = 0;
- bigTable.ResetIterator();
- std::chrono::steady_clock::time_point begin04 = std::chrono::steady_clock::now();
- while(bigTable.NextTuple(td1)) { numBigTuples++; }
- CTEST << "Num of big tuples 1: " << numBigTuples << Endl;
- std::chrono::steady_clock::time_point end04 = std::chrono::steady_clock::now();
- CTEST << "Time for get 1 = " << std::chrono::duration_cast<std::chrono::milliseconds>(end04 - begin04).count() << "[ms]" << Endl;
- CTEST << Endl;
- numBigTuples = 0;
- bigTable.ResetIterator();
- std::chrono::steady_clock::time_point begin041 = std::chrono::steady_clock::now();
- while(bigTable.NextTuple(td2)) { numBigTuples++; }
- CTEST << "Num of big tuples 2: " << numBigTuples << Endl;
- std::chrono::steady_clock::time_point end041 = std::chrono::steady_clock::now();
- CTEST << "Time for get 2 = " << std::chrono::duration_cast<std::chrono::milliseconds>(end041 - begin041).count() << "[ms]" << Endl;
- CTEST << Endl;
- std::chrono::steady_clock::time_point begin05 = std::chrono::steady_clock::now();
- joinTable.Join(smallTable,bigTable);
- std::chrono::steady_clock::time_point end05 = std::chrono::steady_clock::now();
- CTEST << "Time for join = " << std::chrono::duration_cast<std::chrono::milliseconds>(end05 - begin05).count() << "[ms]" << Endl;
- CTEST << Endl;
- mi = NMemInfo::GetMemInfo();
- CTEST << "Mem usage after tables join (MB): " << mi.RSS / (1024 * 1024) << Endl;
- joinTable.ResetIterator();
- ui64 numJoinedTuples = 0;
- std::chrono::steady_clock::time_point begin042 = std::chrono::steady_clock::now();
- while(joinTable.NextJoinedData(td1, td2)) { numJoinedTuples++; }
- CTEST << "Num of joined tuples : " << numJoinedTuples << Endl;
- std::chrono::steady_clock::time_point end042 = std::chrono::steady_clock::now();
- CTEST << "Time for get joined tuples: = " << std::chrono::duration_cast<std::chrono::milliseconds>(end042 - begin042).count() << "[ms]" << Endl;
- CTEST << Endl;
- std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();
- CTEST << "Time difference = " << std::chrono::duration_cast<std::chrono::milliseconds>(end - begin).count() << "[ms]" << Endl;
- CTEST << Endl;
- }
- Y_UNIT_TEST_LLVM(TestImp1Batch) {
- TSetup<LLVM> setup;
- ui64 tuple[11] = {0,1,2,3,4,5,6,7,8,9,10};
- ui32 strSizes[2] = {4, 4};
- char * strVals[] = {(char *)"aaaaa", (char *)"bbbb"};
- char * bigStrVal[] = {(char *)"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
- (char *)"bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb"};
- ui32 bigStrSize[2] = {151, 151};
- NMemInfo::TMemInfo mi = NMemInfo::GetMemInfo();
- CTEST << "Mem usage before tables tuples added (MB): " << mi.RSS / (1024 * 1024) << Endl;
- GraceJoin::TTable bigTable(1,1,1,1);
- GraceJoin::TTable smallTable(1,1,1,1);
- GraceJoin::TTable joinTable(1,1,1,1);
- std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
- const ui64 TupleSize = 1024;
- ui64 bigTuple[TupleSize];
- std::mt19937_64 rng; // deterministic PRNG
- std::uniform_int_distribution<ui64> dist(0, 10000 - 1);
- for (ui64 i = 0; i < TupleSize; i++) {
- bigTuple[i] = dist(rng);
- }
- ui64 millisecondsAdd = 0;
- ui64 millisecondsJoin = 0;
- ui64 millisecondsNextJoinTuple = 0;
- ui64 millisecondsNextTuple = 0;
- const ui64 BatchTuples = 100000;
- std::uniform_int_distribution<ui64> smallDist(0, SmallTableTuples - 1);
- {
- std::chrono::steady_clock::time_point begin03 = std::chrono::steady_clock::now();
- smallTable.AddTuple(tuple, bigStrVal, bigStrSize);
- for ( ui64 i = 0; i < SmallTableTuples + 1; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- smallTable.AddTuple(tuple, strVals, strSizes);
- }
- std::chrono::steady_clock::time_point end03 = std::chrono::steady_clock::now();
- millisecondsAdd += std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- }
- for ( ui64 pos = 0; pos < BigTableTuples; ) {
- std::chrono::steady_clock::time_point begin03 = std::chrono::steady_clock::now();
- ui64 limit = std::min(pos + BatchTuples, BigTableTuples);
- for (; pos < limit; ++pos) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- bigTable.AddTuple(tuple, strVals, strSizes);
- }
- bigTable.Clear();
- std::chrono::steady_clock::time_point end03 = std::chrono::steady_clock::now();
- millisecondsAdd += std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- }
- CTEST << "Time for hash = " << millisecondsAdd << "[ms]" << Endl;
- CTEST << "Adding tuples speed: " << (BigTupleSize * (BigTableTuples + SmallTableTuples) * 1000) / ( millisecondsAdd * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- mi = NMemInfo::GetMemInfo();
- CTEST << "Mem usage after tables tuples added (MB): " << mi.RSS / (1024 * 1024) << Endl;
- millisecondsAdd = 0;
- smallTable.Clear();
- {
- auto begin03 = std::chrono::steady_clock::now();
- smallTable.AddTuple(tuple, bigStrVal, bigStrSize);
- for ( ui64 i = 0; i < SmallTableTuples + 1; i++) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- smallTable.AddTuple(tuple, strVals, strSizes);
- }
- auto end03 = std::chrono::steady_clock::now();
- millisecondsAdd += std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- }
- std::vector<ui64> vals1, vals2;
- std::vector<char *> strVals1, strVals2;
- std::vector<ui32> strSizes1, strSizes2;
- GraceJoin::TupleData td1, td2;
- vals1.resize(100);
- vals2.resize(100);
- strVals1.resize(100);
- strVals2.resize(100);
- strSizes1.resize(100);
- strSizes2.resize(100);
- td1.IntColumns = vals1.data();
- td1.StrColumns = strVals1.data();
- td1.StrSizes = strSizes1.data();
- td2.IntColumns = vals2.data();
- td2.StrColumns = strVals2.data();
- td2.StrSizes = strSizes2.data();
- ui64 numJoinedTuples = 0;
- ui64 numBigTuples = 0;
- for ( ui64 pos = 0; pos < BigTableTuples; ) {
- std::chrono::steady_clock::time_point begin03 = std::chrono::steady_clock::now();
- bigTable.Clear();
- ui64 limit = std::min(pos + BatchTuples, BigTableTuples);
- for (; pos < limit; ++pos) {
- tuple[1] = smallDist(rng);
- tuple[2] = tuple[1];
- bigTable.AddTuple(tuple, strVals, strSizes);
- }
- auto end03 = std::chrono::steady_clock::now();
- millisecondsAdd += std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- bigTable.ResetIterator();
- std::chrono::steady_clock::time_point begin04 = std::chrono::steady_clock::now();
- while(bigTable.NextTuple(td1)) { numBigTuples++; }
- std::chrono::steady_clock::time_point end04 = std::chrono::steady_clock::now();
- millisecondsNextTuple += std::chrono::duration_cast<std::chrono::milliseconds>(end04 - begin04).count();
- std::chrono::steady_clock::time_point begin05 = std::chrono::steady_clock::now();
- joinTable.Join(smallTable, bigTable, EJoinKind::Inner, false, pos < BigTableTuples);
- std::chrono::steady_clock::time_point end05 = std::chrono::steady_clock::now();
- millisecondsJoin += std::chrono::duration_cast<std::chrono::milliseconds>(end05 - begin05).count();
- joinTable.ResetIterator();
- std::chrono::steady_clock::time_point begin042 = std::chrono::steady_clock::now();
- while(joinTable.NextJoinedData(td1, td2)) { numJoinedTuples++; }
- std::chrono::steady_clock::time_point end042 = std::chrono::steady_clock::now();
- millisecondsNextJoinTuple += std::chrono::duration_cast<std::chrono::milliseconds>(end042 - begin042).count();
- }
- std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();
- CTEST << "Num of big tuples 1: " << numBigTuples << Endl;
- CTEST << "Time for get 1 = " << millisecondsNextTuple << "[ms]" << Endl;
- CTEST << Endl;
- CTEST << "Time for join = " << millisecondsJoin << "[ms]" << Endl;
- CTEST << Endl;
- CTEST << "Time for get joined tuples: = " << millisecondsNextJoinTuple << "[ms]" << Endl;
- CTEST << Endl;
- mi = NMemInfo::GetMemInfo();
- CTEST << "Mem usage after tables add and join (MB): " << mi.RSS / (1024 * 1024) << Endl;
- CTEST << "Time for hash = " << millisecondsAdd << "[ms]" << Endl;
- CTEST << "Adding tuples speed: " << (BigTupleSize * (BigTableTuples + SmallTableTuples) * 1000) / ( millisecondsAdd * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- CTEST << "Num of joined tuples : " << numJoinedTuples << Endl;
- CTEST << "Time difference = " << std::chrono::duration_cast<std::chrono::milliseconds>(end - begin).count() << "[ms]" << Endl;
- CTEST << Endl;
- }
- }
- Y_UNIT_TEST_SUITE(TMiniKQLGraceJoinAnyTest) {
- Y_UNIT_TEST_LLVM(TestImp2) {
- TSetup<LLVM> setup;
- ui64 tuple[11] = {0,1,2,3,4,5,6,7,8,9,10};
- ui32 strSizes[2] = {4, 4};
- char * strVals[] = {(char *)"aaaaa", (char *)"bbbb"};
- char * bigStrVal[] = {(char *)"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
- (char *)"bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb"};
- ui32 bigStrSize[2] = {151, 151};
- GraceJoin::TTable bigTable (1,1,1,1,0,0,1, nullptr, true);
- GraceJoin::TTable smallTable(1,1,1,1,0,0,1, nullptr, true);
- GraceJoin::TTable joinTable (1,1,1,1,0,0,1, nullptr, true);
- std::mt19937_64 rng;
- std::uniform_int_distribution<ui64> dist(0, 10000 - 1);
- std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
- const ui64 TupleSize = 1024;
- ui64 bigTuple[TupleSize];
- for (ui64 i = 0; i < TupleSize; i++) {
- bigTuple[i] = dist(rng);
- }
- ui64 milliseconds = 0;
- const ui64 BigTableTuples = 600000;
- const ui64 SmallTableTuples = 150000;
- const ui64 BigTupleSize = 40;
- std::uniform_int_distribution<ui64> smallDist(0, SmallTableTuples - 1);
- std::chrono::steady_clock::time_point begin03 = std::chrono::steady_clock::now();
- smallTable.AddTuple(tuple, bigStrVal, bigStrSize);
- for ( ui64 i = 0; i < SmallTableTuples + 1; i++) {
- tuple[1] = i;
- tuple[2] = tuple[1];
- smallTable.AddTuple(tuple, strVals, strSizes);
- }
- for ( ui64 i = 0; i < BigTableTuples; i++) {
- tuple[1] = i % SmallTableTuples;
- tuple[2] = tuple[1];
- bigTable.AddTuple(tuple, strVals, strSizes);
- }
- std::chrono::steady_clock::time_point end03 = std::chrono::steady_clock::now();
- milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- CTEST << "Time for hash = " << milliseconds << "[ms]" << Endl;
- CTEST << "Adding tuples speed: " << (BigTupleSize * (BigTableTuples + SmallTableTuples) * 1000) / ( milliseconds * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- std::vector<ui64> vals1, vals2;
- std::vector<char *> strVals1, strVals2;
- std::vector<ui32> strSizes1, strSizes2;
- GraceJoin::TupleData td1, td2;
- vals1.resize(100);
- vals2.resize(100);
- strVals1.resize(100);
- strVals2.resize(100);
- strSizes1.resize(100);
- strSizes2.resize(100);
- td1.IntColumns = vals1.data();
- td1.StrColumns = strVals1.data();
- td1.StrSizes = strSizes1.data();
- td2.IntColumns = vals2.data();
- td2.StrColumns = strVals2.data();
- td2.StrSizes = strSizes2.data();
- ui64 numBigTuples = 0;
- bigTable.ResetIterator();
- std::chrono::steady_clock::time_point begin04 = std::chrono::steady_clock::now();
- while(bigTable.NextTuple(td1)) { numBigTuples++; }
- CTEST << "Num of big tuples 1: " << numBigTuples << Endl;
- std::chrono::steady_clock::time_point end04 = std::chrono::steady_clock::now();
- CTEST << "Time for get 1 = " << std::chrono::duration_cast<std::chrono::milliseconds>(end04 - begin04).count() << "[ms]" << Endl;
- CTEST << Endl;
- numBigTuples = 0;
- bigTable.ResetIterator();
- std::chrono::steady_clock::time_point begin041 = std::chrono::steady_clock::now();
- while(bigTable.NextTuple(td2)) { numBigTuples++; }
- CTEST << "Num of big tuples 2: " << numBigTuples << Endl;
- std::chrono::steady_clock::time_point end041 = std::chrono::steady_clock::now();
- CTEST << "Time for get 2 = " << std::chrono::duration_cast<std::chrono::milliseconds>(end041 - begin041).count() << "[ms]" << Endl;
- CTEST << Endl;
- std::chrono::steady_clock::time_point begin05 = std::chrono::steady_clock::now();
- joinTable.Join(smallTable,bigTable);
- std::chrono::steady_clock::time_point end05 = std::chrono::steady_clock::now();
- CTEST << "Time for join = " << std::chrono::duration_cast<std::chrono::milliseconds>(end05 - begin05).count() << "[ms]" << Endl;
- CTEST << Endl;
- joinTable.ResetIterator();
- ui64 numJoinedTuples = 0;
- std::chrono::steady_clock::time_point begin042 = std::chrono::steady_clock::now();
- while(joinTable.NextJoinedData(td1, td2)) { numJoinedTuples++; }
- CTEST << "Num of joined tuples : " << numJoinedTuples << Endl;
- std::chrono::steady_clock::time_point end042 = std::chrono::steady_clock::now();
- CTEST << "Time for get joined tuples: = " << std::chrono::duration_cast<std::chrono::milliseconds>(end042 - begin042).count() << "[ms]" << Endl;
- CTEST << Endl;
- std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();
- CTEST << "Time difference = " << std::chrono::duration_cast<std::chrono::milliseconds>(end - begin).count() << "[ms]" << Endl;
- CTEST << Endl;
- }
- }
- Y_UNIT_TEST_SUITE(TMiniKQLGraceSelfJoinTest) {
- Y_UNIT_TEST_LLVM(TestImp3) {
- TSetup<LLVM> setup;
- ui64 tuple[11] = {0,1,2,3,4,5,6,7,8,9,10};
- ui32 strSizes[2] = {4, 4};
- char * strVals[] = {(char *)"aaaaa", (char *)"bbbb"};
- char * bigStrVal[] = {(char *)"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
- (char *)"bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb"};
- ui32 bigStrSize[2] = {151, 151};
- GraceJoin::TTable bigTable (1,1,1,1,0,0,1, nullptr, false);
- GraceJoin::TTable smallTable(1,1,1,1,0,0,1, nullptr, false);
- GraceJoin::TTable joinTable (1,1,1,1,0,0,1, nullptr, false);
- std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
- const ui64 TupleSize = 1024;
- ui64 bigTuple[TupleSize];
- std::mt19937_64 rng;
- std::uniform_int_distribution<ui64> dist(0, 10000 - 1);
- for (ui64 i = 0; i < TupleSize; i++) {
- bigTuple[i] = dist(rng);
- }
- ui64 milliseconds = 0;
- const ui64 BigTableTuples = 600000;
- const ui64 SmallTableTuples = 150000;
- const ui64 BigTupleSize = 40;
- std::chrono::steady_clock::time_point begin03 = std::chrono::steady_clock::now();
- smallTable.AddTuple(tuple, bigStrVal, bigStrSize);
- for ( ui64 i = 0; i < SmallTableTuples + 1; i++) {
- tuple[1] = i;
- tuple[2] = tuple[1];
- smallTable.AddTuple(tuple, strVals, strSizes);
- }
- for ( ui64 i = 0; i < BigTableTuples; i++) {
- tuple[1] = i % SmallTableTuples;
- tuple[2] = tuple[1];
- bigTable.AddTuple(tuple, strVals, strSizes);
- }
- std::chrono::steady_clock::time_point end03 = std::chrono::steady_clock::now();
- milliseconds = std::chrono::duration_cast<std::chrono::milliseconds>(end03 - begin03).count();
- CTEST << "Time for hash = " << milliseconds << "[ms]" << Endl;
- CTEST << "Adding tuples speed: " << (BigTupleSize * (BigTableTuples + SmallTableTuples) * 1000) / ( milliseconds * 1024 * 1024) << "MB/sec" << Endl;
- CTEST << Endl;
- std::vector<ui64> vals1, vals2;
- std::vector<char *> strVals1, strVals2;
- std::vector<ui32> strSizes1, strSizes2;
- GraceJoin::TupleData td1, td2;
- vals1.resize(100);
- vals2.resize(100);
- strVals1.resize(100);
- strVals2.resize(100);
- strSizes1.resize(100);
- strSizes2.resize(100);
- td1.IntColumns = vals1.data();
- td1.StrColumns = strVals1.data();
- td1.StrSizes = strSizes1.data();
- td2.IntColumns = vals2.data();
- td2.StrColumns = strVals2.data();
- td2.StrSizes = strSizes2.data();
- ui64 numBigTuples = 0;
- bigTable.ResetIterator();
- std::chrono::steady_clock::time_point begin04 = std::chrono::steady_clock::now();
- while(bigTable.NextTuple(td1)) { numBigTuples++; }
- CTEST << "Num of big tuples 1: " << numBigTuples << Endl;
- std::chrono::steady_clock::time_point end04 = std::chrono::steady_clock::now();
- CTEST << "Time for get 1 = " << std::chrono::duration_cast<std::chrono::milliseconds>(end04 - begin04).count() << "[ms]" << Endl;
- CTEST << Endl;
- numBigTuples = 0;
- bigTable.ResetIterator();
- std::chrono::steady_clock::time_point begin041 = std::chrono::steady_clock::now();
- while(bigTable.NextTuple(td2)) { numBigTuples++; }
- CTEST << "Num of big tuples 2: " << numBigTuples << Endl;
- std::chrono::steady_clock::time_point end041 = std::chrono::steady_clock::now();
- CTEST << "Time for get 2 = " << std::chrono::duration_cast<std::chrono::milliseconds>(end041 - begin041).count() << "[ms]" << Endl;
- CTEST << Endl;
- std::chrono::steady_clock::time_point begin05 = std::chrono::steady_clock::now();
- joinTable.Join(bigTable,bigTable);
- std::chrono::steady_clock::time_point end05 = std::chrono::steady_clock::now();
- CTEST << "Time for join = " << std::chrono::duration_cast<std::chrono::milliseconds>(end05 - begin05).count() << "[ms]" << Endl;
- CTEST << Endl;
- joinTable.ResetIterator();
- ui64 numJoinedTuples = 0;
- std::chrono::steady_clock::time_point begin042 = std::chrono::steady_clock::now();
- while(joinTable.NextJoinedData(td1, td2)) { numJoinedTuples++; }
- CTEST << "Num of joined tuples : " << numJoinedTuples << Endl;
- std::chrono::steady_clock::time_point end042 = std::chrono::steady_clock::now();
- CTEST << "Time for get joined tuples: = " << std::chrono::duration_cast<std::chrono::milliseconds>(end042 - begin042).count() << "[ms]" << Endl;
- CTEST << Endl;
- std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();
- CTEST << "Time difference = " << std::chrono::duration_cast<std::chrono::milliseconds>(end - begin).count() << "[ms]" << Endl;
- CTEST << Endl;
- }
- }
- #if !defined(MKQL_RUNTIME_VERSION) || MKQL_RUNTIME_VERSION >= 40u
- Y_UNIT_TEST_SUITE(TMiniKQLSelfJoinTest) {
- Y_UNIT_TEST_LLVM_SPILLING(TestInner1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(4);
- const auto key4 = pb.NewDataLiteral<ui32>(4);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3}),
- pb.NewTuple({key4, payload4})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceSelfJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Inner, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceSelfJoin", "GraceSelfJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("C"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("X"), TString("C"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("X"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("B"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), TString("A"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 6);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestDiffKeys) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(4);
- const auto key4 = pb.NewDataLiteral<ui32>(4);
- const auto key11 = pb.NewDataLiteral<ui32>(1);
- const auto key21 = pb.NewDataLiteral<ui32>(1);
- const auto key31 = pb.NewDataLiteral<ui32>(2);
- const auto key41 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, key11, payload1}),
- pb.NewTuple({key2, key21, payload2}),
- pb.NewTuple({key3, key31, payload3}),
- pb.NewTuple({key4, key41, payload4})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceSelfJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)}; }),
- EJoinKind::Inner, {0U}, {1U}, {2U, 0U}, {2U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceSelfJoin", "GraceSelfJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), TString("A"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), TString("B"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("C"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 3);
- }
- }
- }
- #endif
- Y_UNIT_TEST_SUITE(TMiniKQLGraceJoinTest) {
- Y_UNIT_TEST_LLVM_SPILLING(TestInner1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(4);
- const auto key4 = pb.NewDataLiteral<ui32>(4);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Inner, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Z"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 3);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestInnerDoubleCondition1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(4);
- const auto key4 = pb.NewDataLiteral<ui32>(4);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType1 = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto tupleType2 = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType1, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType2, {
- pb.NewTuple({key2, key2, payload4}),
- pb.NewTuple({key3, key2, payload5}),
- pb.NewTuple({key4, key1, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)}; }),
- EJoinKind::Inner, {0U, 0U}, {0U, 1U}, {1U, 0U}, {2U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 1);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestInnerManyKeyStrings) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A1");
- const auto key2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A2");
- const auto key3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A3");
- const auto key4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B1");
- const auto key5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B2");
- const auto key6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B3");
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType1 = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto tupleType2 = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType1, {
- pb.NewTuple({key1, key4, payload1}),
- pb.NewTuple({key2, key5, payload2}),
- pb.NewTuple({key3, key6, payload3})
- });
- const auto list2 = pb.NewList(tupleType2, {
- pb.NewTuple({key4, key1, payload4}),
- pb.NewTuple({key5, key2, payload5}),
- pb.NewTuple({key6, key6, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)}; }),
- EJoinKind::Inner, {0U, 1U}, {1U, 0U}, {1U, 0U}, {2U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B2"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B1"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestInnerManyKeyUuid) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("A1A1A1A1A1A1A1A1");
- const auto key2 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("A2A2A2A2A2A2A2A2");
- const auto key3 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("A3A3A3A3A3A3A3A3");
- const auto key4 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("B1B1B1B1B1B1B1B1");
- const auto key5 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("B2B2B2B2B2B2B2B2");
- const auto key6 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("B3B3B3B3B3B3B3B3");
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("AAAAAAAAAAAAAAAA");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("BBBBBBBBBBBBBBBB");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("CCCCCCCCCCCCCCCC");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("XXXXXXXXXXXXXXXX");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("YYYYYYYYYYYYYYYY");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::Uuid>("ZZZZZZZZZZZZZZZZ");
- const auto tupleType1 = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id),
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id),
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id)
- });
- const auto tupleType2 = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id),
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id),
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id)
- });
- const auto list1 = pb.NewList(tupleType1, {
- pb.NewTuple({key1, key4, payload1}),
- pb.NewTuple({key2, key5, payload2}),
- pb.NewTuple({key3, key6, payload3})
- });
- const auto list2 = pb.NewList(tupleType2, {
- pb.NewTuple({key4, key1, payload4}),
- pb.NewTuple({key5, key2, payload5}),
- pb.NewTuple({key6, key6, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id),
- pb.NewDataType(NUdf::TDataType<NUdf::TUuid>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U), pb.Nth(item, 2U)}; }),
- EJoinKind::Inner, {0U, 1U}, {1U, 0U}, {1U, 0U}, {2U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(
- TString("B2B2B2B2B2B2B2B2"),
- TString("YYYYYYYYYYYYYYYY")
- )], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(
- TString("B1B1B1B1B1B1B1B1"),
- TString("XXXXXXXXXXXXXXXX")
- )], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestInnerStringKey1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("1");
- const auto key2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("2");
- const auto key3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("4");
- const auto key4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("4");
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Inner, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Z"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 3);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TMiniKQLGraceJoinTestInnerMulti1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Inner, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), TString(t1.AsStringRef()) )];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 4);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestLeft1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(3);
- const auto key4 = pb.NewDataLiteral<ui32>(4);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Left, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- // use empty TString as replacement for NULL
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- UNIT_ASSERT(!t0 || !t0.AsStringRef().Empty()); // ensure no empty strings
- UNIT_ASSERT(!t1 || !t1.AsStringRef().Empty());
- ++u[std::make_pair(t0 ? TString(t0.AsStringRef()) : TString(), t1 ? TString(t1.AsStringRef()) : TString())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), TString())], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 3);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestLeftMulti1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Left, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- UNIT_ASSERT(!t0 || !t0.AsStringRef().Empty()); // ensure no empty strings
- UNIT_ASSERT(!t1 || !t1.AsStringRef().Empty());
- ++u[std::make_pair(t0 ? TString(t0.AsStringRef()) : TString(), t1 ? TString(t1.AsStringRef()) : TString())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), TString())], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 5);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestLeftSemi1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::LeftSemi, {0U}, {0U}, {1U, 0U, 0U, 1U}, {}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui32>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1.Get<ui32>())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), 2)], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), 2)], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestLeftOnly1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto key5 = pb.NewDataLiteral<ui32>(4);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("D");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload7 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3}),
- pb.NewTuple({key4, payload4}),
- pb.NewTuple({key5, payload4})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload5}),
- pb.NewTuple({key3, payload6}),
- pb.NewTuple({key4, payload7})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::LeftOnly, {0U}, {0U}, {1U, 0U, 0U, 1U}, {}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui32>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1.Get<ui32>())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("D"), 4)], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), 1)], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestLeftSemiWithNullKey1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key0 = pb.NewEmptyOptional(pb.NewDataType(NUdf::TDataType<ui32>::Id, true));
- const auto key1 = pb.NewOptional(pb.NewDataLiteral<ui32>(1));
- const auto key2 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key3 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key4 = pb.NewOptional(pb.NewDataLiteral<ui32>(3));
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id, true),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload4}),
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload3}),
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::LeftSemi, {0U}, {0U}, {1U, 0U, 0U, 1U}, {}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui32>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1.Get<ui32>())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), 2)], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), 2)], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestLeftOnlyWithNullKey1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key0 = pb.NewEmptyOptional(pb.NewDataType(NUdf::TDataType<ui32>::Id, true));
- const auto key1 = pb.NewOptional(pb.NewDataLiteral<ui32>(1));
- const auto key2 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key3 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key4 = pb.NewOptional(pb.NewDataLiteral<ui32>(3));
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id, true),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload4}),
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload3}),
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::LeftOnly, {0U}, {0U}, {1U, 0U, 0U, 1U}, {}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui64>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1 ? t1.Get<ui32>() : std::numeric_limits<ui64>::max())];
- // replace NULL with <ui64>::max()
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), 1)], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("X"), std::numeric_limits<ui64>::max())], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestRight1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(3);
- const auto key4 = pb.NewDataLiteral<ui32>(4);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Right, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- UNIT_ASSERT(!t0 || !t0.AsStringRef().Empty()); // ensure no empty strings
- UNIT_ASSERT(!t1 || !t1.AsStringRef().Empty());
- ++u[std::make_pair(t0 ? TString(t0.AsStringRef()) : TString(), t1 ? TString(t1.AsStringRef()) : TString())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString(), TString("Z"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 3);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestRightOnly1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::RightOnly, {0U}, {0U}, {}, {1U, 0U, 0U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui32>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1.Get<ui32>())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("Z"), 3)], 1);
- UNIT_ASSERT_EQUAL(u.size(), 1);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestRightSemi1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::RightSemi, {0U}, {0U}, {}, {1U, 0U, 0U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui32>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1.Get<ui32>())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("X"), 2)], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("Y"), 2)], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestRightMulti1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Right, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- UNIT_ASSERT(!t0 || !t0.AsStringRef().Empty()); // ensure no empty strings
- UNIT_ASSERT(!t1 || !t1.AsStringRef().Empty());
- ++u[std::make_pair(t0 ? TString(t0.AsStringRef()) : TString(), t1 ? TString(t1.AsStringRef()) : TString())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString(), TString("Z"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 5);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestRightSemiWithNullKey1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key0 = pb.NewEmptyOptional(pb.NewDataType(NUdf::TDataType<ui32>::Id, true));
- const auto key1 = pb.NewOptional(pb.NewDataLiteral<ui32>(1));
- const auto key2 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key3 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key4 = pb.NewOptional(pb.NewDataLiteral<ui32>(3));
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id, true),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload4}),
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload3}),
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::RightSemi, {0U}, {0U}, {}, {1U, 0U, 0U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui32>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1.Get<ui32>())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("X"), 2)], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("Y"), 2)], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestRightOnlyWithNullKey1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key0 = pb.NewEmptyOptional(pb.NewDataType(NUdf::TDataType<ui32>::Id, true));
- const auto key1 = pb.NewOptional(pb.NewDataLiteral<ui32>(1));
- const auto key2 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key3 = pb.NewOptional(pb.NewDataLiteral<ui32>(2));
- const auto key4 = pb.NewOptional(pb.NewDataLiteral<ui32>(3));
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id, true),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload4}),
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key0, payload3}),
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<ui32>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::RightOnly, {0U}, {0U}, {}, {1U, 0U, 0U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, ui64>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- ++u[std::make_pair(TString(t0.AsStringRef()), t1 ? t1.Get<ui32>() : std::numeric_limits<ui64>::max())];
- // replace NULL with <ui64>::max()
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("Z"), 3)], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), std::numeric_limits<ui64>::max())], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestFull1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Full, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- UNIT_ASSERT(!t0 || !t0.AsStringRef().Empty()); // ensure no empty strings
- UNIT_ASSERT(!t1 || !t1.AsStringRef().Empty());
- ++u[std::make_pair(t0 ? TString(t0.AsStringRef()) : TString(), t1 ? TString(t1.AsStringRef()) : TString())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("B"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("X"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("C"), TString("Y"))], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), TString())], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString(), TString("Z"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 6);
- }
- }
- Y_UNIT_TEST_LLVM_SPILLING(TestExclusion1) {
- if (SPILLING && RuntimeVersion < 50) return;
- for (ui32 pass = 0; pass < 1; ++pass) {
- TSetup<LLVM, SPILLING> setup;
- TProgramBuilder& pb = *setup.PgmBuilder;
- const auto key1 = pb.NewDataLiteral<ui32>(1);
- const auto key2 = pb.NewDataLiteral<ui32>(2);
- const auto key3 = pb.NewDataLiteral<ui32>(2);
- const auto key4 = pb.NewDataLiteral<ui32>(3);
- const auto payload1 = pb.NewDataLiteral<NUdf::EDataSlot::String>("A");
- const auto payload2 = pb.NewDataLiteral<NUdf::EDataSlot::String>("B");
- const auto payload3 = pb.NewDataLiteral<NUdf::EDataSlot::String>("C");
- const auto payload4 = pb.NewDataLiteral<NUdf::EDataSlot::String>("X");
- const auto payload5 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Y");
- const auto payload6 = pb.NewDataLiteral<NUdf::EDataSlot::String>("Z");
- const auto tupleType = pb.NewTupleType({
- pb.NewDataType(NUdf::TDataType<ui32>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- });
- const auto list1 = pb.NewList(tupleType, {
- pb.NewTuple({key1, payload1}),
- pb.NewTuple({key2, payload2}),
- pb.NewTuple({key3, payload3})
- });
- const auto list2 = pb.NewList(tupleType, {
- pb.NewTuple({key2, payload4}),
- pb.NewTuple({key3, payload5}),
- pb.NewTuple({key4, payload6})
- });
- const auto resultType = pb.NewFlowType(pb.NewMultiType({
- pb.NewDataType(NUdf::TDataType<char*>::Id),
- pb.NewDataType(NUdf::TDataType<char*>::Id)
- }));
- const auto pgmReturn = pb.Collect(pb.NarrowMap(pb.GraceJoin(
- pb.ExpandMap(pb.ToFlow(list1), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- pb.ExpandMap(pb.ToFlow(list2), [&](TRuntimeNode item) -> TRuntimeNode::TList { return {pb.Nth(item, 0U), pb.Nth(item, 1U)}; }),
- EJoinKind::Exclusion, {0U}, {0U}, {1U, 0U}, {1U, 1U}, resultType),
- [&](TRuntimeNode::TList items) -> TRuntimeNode { return pb.NewTuple(items); })
- );
- if (SPILLING) {
- setup.RenameCallable(pgmReturn, "GraceJoin", "GraceJoinWithSpilling");
- }
- const auto graph = setup.BuildGraph(pgmReturn);
- if (SPILLING) {
- graph->GetContext().SpillerFactory = std::make_shared<TMockSpillerFactory>();
- }
- const auto iterator = graph->GetValue().GetListIterator();
- NUdf::TUnboxedValue tuple;
- std::map<std::pair<TString, TString>, ui32> u;
- while (iterator.Next(tuple)) {
- auto t0 = tuple.GetElement(0);
- auto t1 = tuple.GetElement(1);
- UNIT_ASSERT(!t0 || !t0.AsStringRef().Empty()); // ensure no empty strings
- UNIT_ASSERT(!t1 || !t1.AsStringRef().Empty());
- ++u[std::make_pair(t0 ? TString(t0.AsStringRef()) : TString(), t1 ? TString(t1.AsStringRef()) : TString())];
- }
- UNIT_ASSERT(!iterator.Next(tuple));
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString("A"), TString())], 1);
- UNIT_ASSERT_EQUAL(u[std::make_pair(TString(), TString("Z"))], 1);
- UNIT_ASSERT_EQUAL(u.size(), 2);
- }
- }
- }
- }
- }
|