Java 类it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet 实例源码

public Attribute(int attributeId, List<String> attributeTypes, PruningStatistics pruningStatistics) {
    this.attributeId = attributeId;

    int numAttributes = attributeTypes.size();
    this.referenced = new IntLinkedOpenHashSet(numAttributes);
    this.dependents = new IntLinkedOpenHashSet(numAttributes);

    for (int i = 0; i < numAttributes; i++) {
        if ((i != this.attributeId) && (DatabaseUtils.matchSameDataTypeClass(attributeTypes.get(i), attributeTypes.get(this.attributeId)))) {
            if (pruningStatistics.isValid(i, this.attributeId))
                this.dependents.add(i);
            if (pruningStatistics.isValid(this.attributeId, i))
                this.referenced.add(i);
        }
    }
}

/**
 * Returns the permutation to obtain the re-ranking
 *
 * @return permutation to obtain the re-ranking
 */
public int[] rerankPermutation() {

    List<Tuple2od<I>> list = recommendation.getItems();

    IntList perm = new IntArrayList();
    IntLinkedOpenHashSet remainingI = new IntLinkedOpenHashSet();
    IntStream.range(0, list.size()).forEach(remainingI::add);

    while (!remainingI.isEmpty() && perm.size() < min(maxLength, cutoff)) {
        int bestI = selectItem(remainingI, list);

        perm.add(bestI);
        remainingI.remove(bestI);

        update(list.get(bestI));
    }

    while (perm.size() < min(maxLength, list.size())) {
        perm.add(remainingI.removeFirstInt());
    }

    return perm.toIntArray();
}

public Attribute(int attributeId, List<String> attributeTypes, RelationalInputGenerator inputGenerator, int inputRowLimit, int relativeAttributeIndex, File tempFolder, long maxMemoryUsage, int memoryCheckFrequency) throws AlgorithmExecutionException {
    this.attributeId = attributeId;

    int numAttributes = attributeTypes.size();
    this.referenced = new IntLinkedOpenHashSet(numAttributes);
    this.dependents = new IntLinkedOpenHashSet(numAttributes);
    for (int i = 0; i < numAttributes; i++) {
        if ((i != this.attributeId) && (DatabaseUtils.matchSameDataTypeClass(attributeTypes.get(i), attributeTypes.get(this.attributeId)))) {
            this.referenced.add(i);
            this.dependents.add(i);
        }
    }

    try {
        // Read, sort and write attribute
        TPMMS.sortToDisk(inputGenerator, inputRowLimit, tempFolder.getPath() + File.separator + attributeId, relativeAttributeIndex, maxMemoryUsage, memoryCheckFrequency);

        // Open reader on written values
        this.valueReader = FileUtils.buildFileReader(tempFolder.getPath() + File.separator + attributeId); // TODO: Use Metanome temp file functionality here
        this.currentValue = ""; // currentValue must not be null, otherwise no nextValue will be read!
        this.nextValue();
    }
    catch (IOException e) {
        e.printStackTrace();
        throw new AlgorithmExecutionException(e.getMessage());
    }
}

Attribute(final int id, final String tableName, final String columnName,
    final ReadPointer readPointer) {

  this.id = id;
  this.readPointer = readPointer;
  this.tableName = tableName;
  this.columnName = columnName;
  dependent = new IntLinkedOpenHashSet();
  referenced = new IntLinkedOpenHashSet();
}

public Attribute(int attributeId, List<String> attributeTypes) {
    this.attributeId = attributeId;

    int numAttributes = attributeTypes.size();
    this.referenced = new IntLinkedOpenHashSet(numAttributes);
    this.dependents = new IntLinkedOpenHashSet(numAttributes);

    for (int i = 0; i < numAttributes; i++) {
        if ((i != this.attributeId) && (DatabaseUtils.matchSameDataTypeClass(attributeTypes.get(i), attributeTypes.get(this.attributeId)))) {
                this.dependents.add(i);
                this.referenced.add(i);
        }
    }
}

public IntLinkedOpenHashSet getReferenced() {
    return this.referenced;
}

public IntLinkedOpenHashSet getDependents() {
    return this.dependents;
}

public IntLinkedOpenHashSet getReferenced() {
    return this.referenced;
}

public IntLinkedOpenHashSet getDependents() {
    return this.dependents;
}

public IntLinkedOpenHashSet getReferenced() {
    return this.referenced;
}

public IntLinkedOpenHashSet getDependents() {
    return this.dependents;
}

public void put(T key, int value) {
    IntCollection collection = map.computeIfAbsent(key, k -> new IntLinkedOpenHashSet(2, .75f));
    collection.add(value);
}