当前位置: 首页>>代码示例>>Java>>正文


Java IntLinkedOpenHashSet类代码示例

本文整理汇总了Java中it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet的典型用法代码示例。如果您正苦于以下问题:Java IntLinkedOpenHashSet类的具体用法?Java IntLinkedOpenHashSet怎么用?Java IntLinkedOpenHashSet使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。


IntLinkedOpenHashSet类属于it.unimi.dsi.fastutil.ints包,在下文中一共展示了IntLinkedOpenHashSet类的8个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: Attribute

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
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);
		}
	}
}
 
开发者ID:HPI-Information-Systems,项目名称:metanome-algorithms,代码行数:17,代码来源:Attribute.java

示例2: rerankPermutation

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
/**
 * 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();
}
 
开发者ID:RankSys,项目名称:RankSys,代码行数:29,代码来源:GreedyReranker.java

示例3: Attribute

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
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());
	}
}
 
开发者ID:HPI-Information-Systems,项目名称:metanome-algorithms,代码行数:28,代码来源:Attribute.java

示例4: Attribute

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
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();
}
 
开发者ID:HPI-Information-Systems,项目名称:AdvancedDataProfilingSeminar,代码行数:11,代码来源:Attribute.java

示例5: Attribute

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
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);
		}
	}
}
 
开发者ID:HPI-Information-Systems,项目名称:AdvancedDataProfilingSeminar,代码行数:15,代码来源:Attribute.java

示例6: getReferenced

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
public IntLinkedOpenHashSet getReferenced() {
	return this.referenced;
}
 
开发者ID:HPI-Information-Systems,项目名称:metanome-algorithms,代码行数:4,代码来源:Attribute.java

示例7: getDependents

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
public IntLinkedOpenHashSet getDependents() {
	return this.dependents;
}
 
开发者ID:HPI-Information-Systems,项目名称:metanome-algorithms,代码行数:4,代码来源:Attribute.java

示例8: put

import it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet; //导入依赖的package包/类
public void put(T key, int value) {
    IntCollection collection = map.computeIfAbsent(key, k -> new IntLinkedOpenHashSet(2, .75f));
    collection.add(value);
}
 
开发者ID:CodeCrafter47,项目名称:BungeeTabListPlus,代码行数:5,代码来源:Object2IntHashMultimap.java


注:本文中的it.unimi.dsi.fastutil.ints.IntLinkedOpenHashSet类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。