Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
package org.codehaus.groovy.util;
public abstract class AbstractConcurrentMap extends AbstractConcurrentMapBase {
public AbstractConcurrentMap(Object segmentInfo) {
super(segmentInfo);
}
public Segment segmentFor (int hash) {
return (Segment) super.segmentFor(hash);
}
public V get(K key) {
int hash = hash(key);
return (V) segmentFor(hash).get(key, hash);
}
public Entry getOrPut(K key, V value) {
int hash = hash(key);
return segmentFor(hash).getOrPut(key, hash, value);
}
public void put(K key, V value) {
int hash = hash(key);
segmentFor(hash).put(key, hash, value);
}
public void remove(K key) {
int hash = hash(key);
segmentFor(hash).remove(key, hash);
}
public abstract static class Segment extends AbstractConcurrentMapBase.Segment {
private static final long serialVersionUID = 5192533863182570468L;
protected Segment(int initialCapacity) {
super(initialCapacity);
}
public final V get(K key, int hash) {
Object[] tab = table;
Object o = tab[hash & (tab.length - 1)];
if (o != null) {
if (o instanceof Entry) {
Entry e = (Entry) o;
if (e.isEqual(key, hash)) {
return e.getValue();
}
}
else {
Object arr [] = (Object[]) o;
for (int i = 0; i < arr.length; i++) {
Entry e = (Entry) arr[i];
if (e != null && e.isEqual(key, hash)) {
return e.getValue();
}
}
}
}
return null;
}
public final Entry getOrPut(K key, int hash, V value) {
Object[] tab = table;
Object o = tab[hash & (tab.length - 1)];
if (o != null) {
if (o instanceof Entry) {
Entry e = (Entry) o;
if (e.isEqual(key, hash)) {
return e;
}
}
else {
Object arr [] = (Object[]) o;
for (int i = 0; i < arr.length; i++) {
Entry e = (Entry) arr[i];
if (e != null && e.isEqual(key, hash)) {
return e;
}
}
}
}
return put(key, hash, value);
}
public final Entry put(K key, int hash, V value) {
lock();
try {
rehashIfThresholdExceeded();
Object[] tab = table;
int index = hash & (tab.length - 1);
Object o = tab[index];
if (o != null) {
if (o instanceof Entry) {
Entry e = (Entry) o;
if (e.isEqual(key, hash)) {
e.setValue(value);
return e;
}
else {
Object arr [] = new Object [2];
final Entry ee = createEntry(key, hash, value);
arr [0] = ee;
arr [1] = e;
tab[index] = arr;
count++;
return ee;
}
}
else {
Object arr [] = (Object[]) o;
for (int i = 0; i < arr.length; i++) {
Entry e = (Entry) arr[i];
if (e != null && e.isEqual(key, hash)) {
e.setValue(value);
return e;
}
}
final Entry ee = createEntry(key, hash, value);
for (int i = 0; i < arr.length; i++) {
Entry e = (Entry) arr[i];
if (e == null) {
arr [i] = ee;
count++;
return ee;
}
}
Object newArr [] = new Object[arr.length+1];
newArr [0] = ee;
System.arraycopy(arr, 0, newArr, 1, arr.length);
tab [index] = newArr;
count++;
return ee;
}
}
Entry e = createEntry(key, hash, value);
tab[index] = e;
count++; // write-volatile
return e;
} finally {
unlock();
}
}
public void remove(K key, int hash) {
lock();
try {
int c = count-1;
final Object[] tab = table;
final int index = hash & (tab.length - 1);
Object o = tab[index];
if (o != null) {
if (o instanceof Entry) {
if (((Entry)o).isEqual(key, hash)) {
tab[index] = null;
count = c;
}
}
else {
Object arr [] = (Object[]) o;
for (int i = 0; i < arr.length; i++) {
Entry e = (Entry) arr[i];
if (e != null && e.isEqual(key, hash)) {
arr [i] = null;
count = c;
break;
}
}
}
}
}
finally {
unlock();
}
}
protected abstract Entry createEntry(K key, int hash, V value);
}
public interface Entry extends AbstractConcurrentMapBase.Entry{
boolean isEqual(K key, int hash);
}
}
