mirror of
https://github.com/tiennm99/java-design-patterns.git
synced 2026-05-18 21:25:52 +00:00
Anurag Agarwal
1fdc650545
* Reduces checkstyle errors in marker * Reduces checkstyle errors in master-worker-pattern * Reduces checkstyle errors in mediator * Reduces checkstyle errors in memento * Reduces checkstyle errors in model-view-controller * Reduces checkstyle errors in model-view-presenter * Reduces checkstyle errors in module * Reduces checkstyle errors in monad * Reduces checkstyle errors in monostate * Reduces checkstyle errors in multiton * Reduces checkstyle errors in mute-idiom * Reduces checkstyle errors in mutex
50 lines
2.0 KiB
Java
50 lines
2.0 KiB
Java
/*
|
|
* The MIT License
|
|
* Copyright © 2014-2019 Ilkka Seppälä
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
* THE SOFTWARE.
|
|
*/
|
|
|
|
package com.iluwatar.mutex;
|
|
|
|
/**
|
|
* A Mutex prevents multiple threads from accessing a resource simultaneously.
|
|
*
|
|
* <p>In this example we have two thieves who are taking beans from a jar. Only one thief can take
|
|
* a bean at a time. This is ensured by a Mutex lock which must be acquired in order to access the
|
|
* jar. Each thief attempts to acquire the lock, take a bean and then release the lock. If the lock
|
|
* has already been acquired, the thief will be prevented from continuing (blocked) until the lock
|
|
* has been released. The thieves stop taking beans once there are no beans left to take.
|
|
*/
|
|
public class App {
|
|
|
|
/**
|
|
* main method.
|
|
*/
|
|
public static void main(String[] args) {
|
|
Mutex mutex = new Mutex();
|
|
Jar jar = new Jar(1000, mutex);
|
|
Thief peter = new Thief("Peter", jar);
|
|
Thief john = new Thief("John", jar);
|
|
peter.start();
|
|
john.start();
|
|
}
|
|
|
|
}
|