本文整理汇总了Java中org.gbif.api.vocabulary.Rank.equals方法的典型用法代码示例。如果您正苦于以下问题：Java Rank.equals方法的具体用法？Java Rank.equals怎么用？Java Rank.equals使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类org.gbif.api.vocabulary.Rank的用法示例。
在下文中一共展示了Rank.equals方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: assertParentsContain
import org.gbif.api.vocabulary.Rank; //导入方法依赖的package包/类
@Override
public void assertParentsContain(int usageKey, @Nullable Rank parentRank, String parent) {
try {
boolean found = false;
for (NameUsage p : usageService.listParents(usageKey, null)) {
if (parent.equalsIgnoreCase(p.getCanonicalOrScientificName()) && (parentRank == null || parentRank.equals(p.getRank()))) {
found = true;
break;
}
}
Assert.assertTrue(found);
} catch (AssertionError e) {
valid = false;
LOG.error("Classification for usage {} missing {}", usageKey, parent, e);
}
}
示例2: findUsagesByCanonical
import org.gbif.api.vocabulary.Rank; //导入方法依赖的package包/类
private List<NubUsage> findUsagesByCanonical(String name, @Nullable Rank rank) {
List<NubUsage> matches = Lists.newArrayList();
try (Transaction tx = db.beginTx()) {
for (Node n : db.dao().findByName(name)) {
NubUsage u = db.dao().readNub(n);
if (rank == null || rank.equals(u.rank)) {
matches.add(u);
}
}
}
return matches;
}
示例3: findUsagesByCanonical
import org.gbif.api.vocabulary.Rank; //导入方法依赖的package包/类
private List<NameUsage> findUsagesByCanonical(String name, @Nullable Rank rank) {
// avoid paging and do a large, single page
PagingRequest req = new PagingRequest(0, 1000);
List<NameUsage> matches = Lists.newArrayList();
for (NameUsage u : usageService.listByCanonicalName(null, name, req, Constants.NUB_DATASET_KEY).getResults()) {
if (rank == null || rank.equals(u.getRank())) {
matches.add(u);
}
}
return matches;
}
示例4: rankSimilarity
import org.gbif.api.vocabulary.Rank; //导入方法依赖的package包/类
private int rankSimilarity(Rank query, Rank ref) {
int similarity = 0;
if (ref != null) {
// rate ranks lower that are not represented in the canonical, e.g. cultivars
if (ref.isRestrictedToCode() == NomenclaturalCode.CULTIVARS) {
similarity -= 7;
} else if (Rank.STRAIN == ref) {
similarity -= 7;
}
if (ref.isUncomparable()) {
// this also includes informal again
similarity -= 3;
}
if (query != null) {
// both ranks exist. Compare directly
if (query.equals(ref)) {
similarity += 10;
} else if (Rank.INFRASPECIFIC_NAME == query && ref.isInfraspecific()
|| Rank.INFRASPECIFIC_NAME == ref && query.isInfraspecific()) {
// unspecific infraspecific rank
similarity += 5;
} else if (Rank.INFRASUBSPECIFIC_NAME == query && ref.isInfraspecific() && ref != Rank.SUBSPECIES
|| Rank.INFRASUBSPECIFIC_NAME == ref && query.isInfraspecific() && query != Rank.SUBSPECIES) {
// unspecific infrasubspecific rank
similarity += 5;
} else if (query.isUncomparable()) {
// uncomparable query ranks
similarity -= 5;
} else if (ref == Rank.SPECIES && query.isInfraspecific() || ref.isSupraspecific() && query.isSpeciesOrBelow()
|| query == Rank.SPECIES && ref.isInfraspecific() || query.isSupraspecific() && ref.isSpeciesOrBelow()) {
// not good, different number of epithets means rather unalike
similarity -= 25;
} else {
// rate lower the further away the ranks are
similarity -= Math.abs(ref.ordinal() - query.ordinal());
}
}
} else if (query != null) {
// reference has no rank, rate it lower
similarity -= 1;
}
return minMax(-25, 5, similarity);
}