默认情况下，锁计数器不会被收集。
每一列的高度基于慢锁计数的值，它与图中的所有列有关。
The height of each column is based on the value of the slow lock count and is relative to all the columns in the graph.
带有非常慢的计数的锁都可能影响性能。
Any locks with high slow counts are likely to affect performance.
需要对这些统计数据做一下关于锁被请求的方式 的简短说明。
These statistics require a brief explanation of how locks can be acquired.
这些统计数据包括锁被请求的方式、锁被持有的总时间以及锁被持有的平均时间。
These statistics include how the lock was acquired, the total amount of time the lock was held, and the average amount of time that the lock was held.
因为本例中的写操作违反了使用volatile的第一个条件，因此不能使用volatile安全地实现计数器——您必须使用锁。
Because the writes in this case violate the first condition for using volatile, you cannot use volatile to safely implement the counter — you must use locking.
size的实现将不得不依次获取各个bucket的锁，对该bucket中的节点进行计数，释放锁，然后继续到下一个bucket。
An implementation of size would have to sequentially acquire the lock for each bucket, count the number of nodes in that bucket, and release the lock and move on to the next bucket.
希望看到这里，你应该对二进制信号量，计数信号量和互斥锁的区别有了清晰的认识。
Hopefully you should now be clear about the core differences between the Binary Semaphore, General (counting) Semaphore and the Mutex.
乐观锁而不是使用一个计数器进行沟通时，已更新某个对象，或是否更新了。
Optimistic locking instead USES a counter to communicate when an object has been updated, or to verify whether an update has happened.
若计数器值为0，则整张卡的数据被锁死，只可读出，不可写入或更改且无法继续核对密码；
If the counter value is 0, then the whole card data to be locked, the only readable, not write or could not continue to check and change your password;
若计数器值为0，则整张卡的数据被锁死，只可读出，不可写入或更改且无法继续核对密码；
If the counter value is 0, then the whole card data to be locked, the only readable, not write or could not continue to check and change your password;
应用推荐