import java.util.concurrent.locks.ReentrantLock;
class SharedResource {
private final ReentrantLock lock = new ReentrantLock();
private int resource = 0;
public void increment() {
lock.lock();
try {
resource++;
} finally {
lock.unlock();
}
}
public int getResource() {
return resource;
}
}
public class ReentrantLockTest {
public static void main(String[] args) throws InterruptedException {
SharedResource sharedResource = new SharedResource();
Thread t1 = new Thread(() -> {
for (int i = 0; i < 1000; i++) {
sharedResource.increment();
}
});
Thread t2 = new Thread(() -> {
for (int i = 0; i < 1000; i++) {
sharedResource.increment();
}
});
t1.start();
t2.start();
t1.join();
t2.join();
System.out.println("Final resource value: " + sharedResource.getResource());
}
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?