Vwwxrf

2D counterpart of std::array in C++17

Meaning of "SEVERA INDEOVI VAS" from 3rd Century slab

Provisioning profile doesn't include the application-identifier and keychain-access-groups entitlements

Science-fiction short story where space navy wanted hospital ships and settlers had guns mounted everywhere

Identifying the interval from A♭ to D♯

Why do Australian milk farmers need to protest supermarkets' milk price?

Is it true that real estate prices mainly go up?

How to deal with taxi scam when on vacation?

Why doesn't using two cd commands in bash script execute the second command?

How to write cleanly even if my character uses expletive language?

At what level can a dragon innately cast its spells?

Splitting string ID code into various parts

Use of プラトニック in this sentence?

Make a transparent 448*448 image

Life insurance that covers only simultaneous/dual deaths

Define, (actually define) the "stability" and "energy" of a compound

Why are the outputs of printf and std::cout different

Latest web browser compatible with Windows 98

How could a scammer know the apps on my phone / iTunes account?

How do I hide Chekhov's Gun?

Co-worker team leader wants to inject his friend's awful software into our development. What should I say to our common boss?

Happy pi day, everyone!

How to simplify this time periods definition interface?

Why did it take so long to abandon sail after steamships were demonstrated?

Allocate Resource Effectively

Resource Pool implementation with ReentrantLock and ConditionMax heap in Javajava.util.concurrent bounded resuable resource implementationFacade pattern usage with JDBC-resource on GlassfishUsing PostgreSQL effectively with a banking appResource caching in Java with soft referencesSieve32Fast - A very fast, memory efficient, multi-threaded Sieve of EratosthenesDisposable resource: lazy allocationAndroid Internal Resource ReaderMinecraft resource calculator

-1

$begingroup$

I have module called printer allocator (PrinterAllocator) which will allocate the next available printer to the requester.

import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.List;

public class PrinterAllocator 

 private static final int TOTAL_AVAILABLE_PRINTERS = 25;
 private BitSet bitSet = new BitSet( TOTAL_AVAILABLE_PRINTERS );

 public PrinterAllocator() 
 List<Integer> unassignedPriters = new ArrayList<>( Arrays.asList( 1, 2, 3, 24 ) ); // but this array will be fetched from database
 unassignedPriters.forEach( printerId -> bitSet.set( printerId - 1 ) );
 

 public int getNextPrinter() 
 int index = bitSet.nextClearBit( 0 ) + 1;
 bitSet.set( index );
 return index + 1;
 

 public boolean hasEnoughPrinters(int printersNeeded)
 /* point 1*/
 return bitSet.cardinality()+printersNeeded<=TOTAL_AVAILABLE_PRINTERS;
 

Point 1: I am unable to replace 'point 1' with following code

 return bitSet.cardinality()+printersNeeded<=bitSet.size()


 (or)

return bitSet.cardinality()+printersNeeded<=bitSet.length();

Because bitSet.size() and bitSet.length() has a different meaning that is size() != length() != TOTAL_AVAILABLE_PRINTERS

Any better Idea to implement PrinterAllocator with/without bitset

java bitset

share

asked 5 mins ago

Dinesh KumarDinesh Kumar

11

New contributor

Dinesh Kumar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

-1

$begingroup$

I have module called printer allocator (PrinterAllocator) which will allocate the next available printer to the requester.

import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.List;

public class PrinterAllocator 

 private static final int TOTAL_AVAILABLE_PRINTERS = 25;
 private BitSet bitSet = new BitSet( TOTAL_AVAILABLE_PRINTERS );

 public PrinterAllocator() 
 List<Integer> unassignedPriters = new ArrayList<>( Arrays.asList( 1, 2, 3, 24 ) ); // but this array will be fetched from database
 unassignedPriters.forEach( printerId -> bitSet.set( printerId - 1 ) );
 

 public int getNextPrinter() 
 int index = bitSet.nextClearBit( 0 ) + 1;
 bitSet.set( index );
 return index + 1;
 

 public boolean hasEnoughPrinters(int printersNeeded)
 /* point 1*/
 return bitSet.cardinality()+printersNeeded<=TOTAL_AVAILABLE_PRINTERS;
 

Point 1: I am unable to replace 'point 1' with following code

 return bitSet.cardinality()+printersNeeded<=bitSet.size()


 (or)

return bitSet.cardinality()+printersNeeded<=bitSet.length();

Because bitSet.size() and bitSet.length() has a different meaning that is size() != length() != TOTAL_AVAILABLE_PRINTERS

Any better Idea to implement PrinterAllocator with/without bitset

java bitset

share

asked 5 mins ago

Dinesh KumarDinesh Kumar

11

New contributor

Dinesh Kumar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

I have module called printer allocator (PrinterAllocator) which will allocate the next available printer to the requester.

import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.List;

public class PrinterAllocator 

 private static final int TOTAL_AVAILABLE_PRINTERS = 25;
 private BitSet bitSet = new BitSet( TOTAL_AVAILABLE_PRINTERS );

 public PrinterAllocator() 
 List<Integer> unassignedPriters = new ArrayList<>( Arrays.asList( 1, 2, 3, 24 ) ); // but this array will be fetched from database
 unassignedPriters.forEach( printerId -> bitSet.set( printerId - 1 ) );
 

 public int getNextPrinter() 
 int index = bitSet.nextClearBit( 0 ) + 1;
 bitSet.set( index );
 return index + 1;
 

 public boolean hasEnoughPrinters(int printersNeeded)
 /* point 1*/
 return bitSet.cardinality()+printersNeeded<=TOTAL_AVAILABLE_PRINTERS;
 

Point 1: I am unable to replace 'point 1' with following code

 return bitSet.cardinality()+printersNeeded<=bitSet.size()


 (or)

return bitSet.cardinality()+printersNeeded<=bitSet.length();

Because bitSet.size() and bitSet.length() has a different meaning that is size() != length() != TOTAL_AVAILABLE_PRINTERS

Any better Idea to implement PrinterAllocator with/without bitset

java bitset

share

asked 5 mins ago

Dinesh KumarDinesh Kumar

11

New contributor

Dinesh Kumar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.List;

public class PrinterAllocator 

 private static final int TOTAL_AVAILABLE_PRINTERS = 25;
 private BitSet bitSet = new BitSet( TOTAL_AVAILABLE_PRINTERS );

 public PrinterAllocator() 
 List<Integer> unassignedPriters = new ArrayList<>( Arrays.asList( 1, 2, 3, 24 ) ); // but this array will be fetched from database
 unassignedPriters.forEach( printerId -> bitSet.set( printerId - 1 ) );
 

 public int getNextPrinter() 
 int index = bitSet.nextClearBit( 0 ) + 1;
 bitSet.set( index );
 return index + 1;
 

 public boolean hasEnoughPrinters(int printersNeeded)
 /* point 1*/
 return bitSet.cardinality()+printersNeeded<=TOTAL_AVAILABLE_PRINTERS;
 

 return bitSet.cardinality()+printersNeeded<=bitSet.size()


 (or)

return bitSet.cardinality()+printersNeeded<=bitSet.length();

share

asked 5 mins ago

Dinesh KumarDinesh Kumar

11

New contributor

Dinesh Kumar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 5 mins ago

Dinesh KumarDinesh Kumar

11

New contributor

Dinesh Kumar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 mins ago

Dinesh KumarDinesh Kumar

11

New contributor

Dinesh Kumar is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 5 mins ago

Dinesh KumarDinesh Kumar

11