Searched refs:bins (Results 1 – 5 of 5) sorted by relevance
74 std::vector<bin_packer*> bins; // the array of bin packers variable101 my_bin_packer = bins[bin_index]; in operator ()()318 bins.resize(num_bin_packers); in main()320 bins[i] = new bin_packer(g, 1, bin_filler(i, &the_value_pool)); in main()321 oneapi::tbb::flow::make_edge(the_value_pool, *(bins[i])); in main()322 oneapi::tbb::flow::make_edge(oneapi::tbb::flow::output_port<0>(*(bins[i])), in main()324 oneapi::tbb::flow::make_edge(oneapi::tbb::flow::output_port<1>(*(bins[i])), in main()332 delete bins[i]; in main()
2 … that performs binpacking of `N` integer values into a near-optimal number of bins of capacity `V`.4 …bins according to a best-fit policy. Items that cannot be made to fit are rejected and returned to…
186 BitMaskBins bins; variable188 void registerBin(int regBin) { bins.set(regBin, 1); } in registerBin()189 int getMinUsedBin(int start) const { return bins.getMinTrue(start); } in getMinUsedBin()190 void reset() { bins.reset(); } in reset()
1600 Block *block = bins[index].pop(); in get()1602 MALLOC_ITT_SYNC_ACQUIRED(bins+index); in get()1612 MALLOC_ITT_SYNC_RELEASING(bins+index); in put()1613 bins[index].push(block); in put()1619 new (bins+i) LifoList(); in reset()1626 Block* block = bins[i].grab(); in cleanup()1627 MALLOC_ITT_SYNC_ACQUIRED(bins+i); in cleanup()1639 MALLOC_ITT_SYNC_RELEASING(bins+i); in cleanup()1640 bins[i].push(block); in cleanup()
280 LifoList bins[numBlockBinLimit]; variable