import org.gradle.internal.hash.HashCode;
import org.gradle.internal.snapshot.FileSystemLocationSnapshot;

import javax.annotation.Nullable;
import java.io.IOException;

public interface ResourceSnapshotterCacheService {
    @Nullable
    HashCode hashFile(FileSystemLocationSnapshot snapshot, FileSystemLocationSnapshotHasher hasher, HashCode configurationHash) throws IOException;

    @Nullable

    @Override
    public V put(final K key, final V value) {
        int hashCode = 0;
        int index = 0;

        if (key != null) {
            hashCode = key.hashCode();
            index = (hashCode & 0x7FFFFFFF) % mapTable.length;
            for (Entry<K, V> e = mapTable[index]; e != null; e = e.next) {
                if (e.hashCode == hashCode && key.equals(e.key)) {
                    return swapValue(e, value);

import org.gradle.internal.component.model.PersistentModuleSource;
import org.gradle.internal.hash.HashCode;

public class ModuleDescriptorHashModuleSource implements PersistentModuleSource {
    public static final int CODEC_ID = 2;
    private final HashCode descriptorHash;
    private final boolean changingModule;

    public ModuleDescriptorHashModuleSource(HashCode descriptorHash, boolean changingModule) {
        this.descriptorHash = descriptorHash;

        return Objects.equal(value, other.value) && type == other.type && arguments.equals(other.arguments);
    }

    @Override
    public int hashCode() {
        return super.hashCode() ^ (value == null ? 0 : value.hashCode()) ^ type.hashCode() ^ arguments.hashCode();
    }

    }

    @Override
    public int hashCode() {
        int result = counter != null ? counter.hashCode() : 0;
        result = 31 * result + (value != null ? value.hashCode() : 0);
        result = 31 * result + (minimum != null ? minimum.hashCode() : 0);
        result = 31 * result + (maximum != null ? maximum.hashCode() : 0);
        return result;
    }

    public Optional<HashCode> hashContent(InputStream inputStream) throws IOException {
        return hash(inputStream);
    }

    /**
     * Hash the contents of the provided file, normalizing line endings.
     *
     * @param file The file to hash
     * @return An {@link Optional} containing the {@link HashCode} or empty if the file is binary
     * @throws IOException
     */

    int expectedHashCode = 0;
    for (E element : getSampleElements()) {
      expectedHashCode += ((element == null) ? 0 : element.hashCode());
    }
    assertEquals(
        "A Set's hashCode() should be the sum of those of its elements.",
        expectedHashCode,
        getSet().hashCode());
  }

  @CollectionSize.Require(absent = CollectionSize.ZERO)
  @CollectionFeature.Require(ALLOWS_NULL_VALUES)

    return super.equals(obj);
  }

  /**
   * By default delegates to {@link Object#hashCode}. The dynamic proxies' {@code hashCode()} will
   * delegate to this method. Subclasses can override this method to provide custom equality.
   */
  @Override
  public int hashCode() {
    return super.hashCode();
  }

  /**

            return false;
        }

        DefaultGroupExclude that = (DefaultGroupExclude) o;

        if (hashCode != that.hashCode) {
            return false;
        }
        return group.equals(that.group);

    }

    @Override
    public int hashCode() {
        return group.hashCode();
    }

    @Override
    public String toString() {
        return "{\"exclude group\" : \"" + group + "\"}";

        }

        DefaultModuleIdExclude that = (DefaultModuleIdExclude) o;

        if (hashCode != that.hashCode) {
            return false;
        }
        return moduleId.equals(that.moduleId);

    }

    @Override
    public int hashCode() {
        return moduleId.hashCode();
    }

    @Override
    public String toString() {