1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578 |
- #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_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);
- }
- }
- }
- }
- }
|