| alloc_cost | SetJoinParallel | |
| ALPHA | SetJoinParallel | |
| candidateNum | SetJoinParallel | |
| coe | SetJoinParallel | |
| coePart | SetJoinParallel | |
| cosine(ui x, ui y) | SetJoinParallel | inline |
| det | SetJoinParallel | |
| dice(ui x, ui y) | SetJoinParallel | inline |
| discreteCacheIdx | SetJoinParallel | |
| earlyTerminated | SetJoinParallel | |
| earlyTerminatedEmpty | SetJoinParallel | |
| emptyPairs | SetJoinParallel | |
| featureValueCache | SetJoinParallel | |
| find_cost | SetJoinParallel | |
| findSimPairsRS() | SetJoinParallel | |
| findSimPairsSelf() | SetJoinParallel | |
| flagIC | SetJoinParallel | |
| getResultPairsAmount() | SetJoinParallel | inline |
| GreedyFindCandidateAndSimPairs(const int &tid, const int indexLenGrp, const ui rid, ui record_length, const std::vector< ui > &p_keys, const std::vector< ui > &od_keys, const std::vector< ui > &odk_st) | SetJoinParallel | |
| groupA | SetJoinParallel | |
| groupB | SetJoinParallel | |
| grpIdA | SetJoinParallel | |
| grpIdB | SetJoinParallel | |
| hashInFind_cost | SetJoinParallel | |
| idMapA | SetJoinParallel | |
| idMapB | SetJoinParallel | |
| ifRS | SetJoinParallel | |
| index(double threshold) | SetJoinParallel | |
| index_cost | SetJoinParallel | |
| isHeap | SetJoinParallel | |
| isWeightedComp | SetJoinParallel | |
| jaccard(ui x, ui y) | SetJoinParallel | inline |
| listlens | SetJoinParallel | |
| maxHeapSize | SetJoinParallel | |
| maxIndexPartNum | SetJoinParallel | |
| mem_cost | SetJoinParallel | |
| mergeResults(std::vector< std::pair< int, int > > &finalPairs) | SetJoinParallel | inline |
| normalFunc | SetJoinParallel | |
| overlapFunc | SetJoinParallel | |
| overlapRS(ui x, ui y, int posx=0, int posy=0, int current_overlap=0) | SetJoinParallel | inline |
| overlapRSIC(ui x, ui y, int posx=0, int posy=0, int current_overlap=0) | SetJoinParallel | inline |
| overlapSelf(ui x, ui y, int posx=0, int posy=0, int current_overlap=0) | SetJoinParallel | inline |
| overlapSelfIC(ui x, ui y, int posx=0, int posy=0, int current_overlap=0) | SetJoinParallel | inline |
| query_dataset | SetJoinParallel | |
| query_maxSize | SetJoinParallel | |
| query_minSize | SetJoinParallel | |
| query_n | SetJoinParallel | |
| query_weights | SetJoinParallel | |
| queryEmpty | SetJoinParallel | |
| reportLargestGroup() | SetJoinParallel | inline |
| reportTimeCost() | SetJoinParallel | inline |
| resizeData(std::vector< std::vector< ui > > &dataset) | SetJoinParallel | inline |
| result_pairs | SetJoinParallel | |
| result_pairs_ | SetJoinParallel | |
| resultNum | SetJoinParallel | |
| revIdMapA | SetJoinParallel | |
| revIdMapB | SetJoinParallel | |
| search_cost | SetJoinParallel | |
| SetJoinParallel(const std::vector< std::vector< ui > > &sorted_records, const std::vector< double > &recwt, const std::vector< double > &_wordwt, double _det, ui _maxHeapSize=0, bool _isWeightedComp=false) | SetJoinParallel | inline |
| SetJoinParallel(const std::vector< std::vector< ui > > &work_records, const std::vector< std::vector< ui > > &query_records, const std::vector< double > &workwt, const std::vector< double > &querywt, const std::vector< double > &_wordwt, double _det, ui _maxHeapSize=0, bool _isWeightedComp=false) | SetJoinParallel | inline |
| showPara() const | SetJoinParallel | inline |
| simFType | SetJoinParallel | |
| typeMap | SetJoinParallel | |
| verif_cost | SetJoinParallel | |
| weightedCosine(ui x, ui y) | SetJoinParallel | inline |
| weightedDice(ui x, ui y) | SetJoinParallel | inline |
| weightedFunc | SetJoinParallel | |
| weightedJaccard(ui x, ui y) | SetJoinParallel | inline |
| weightedOverlap(ui x, ui y) | SetJoinParallel | inline |
| wordwt | SetJoinParallel | |
| work_dataset | SetJoinParallel | |
| work_maxSize | SetJoinParallel | |
| work_minSize | SetJoinParallel | |
| work_n | SetJoinParallel | |
| work_weights | SetJoinParallel | |
| workEmpty | SetJoinParallel | |
| workLength | SetJoinParallel | |
| ~SetJoinParallel()=default | SetJoinParallel | |
1.12.0