Codota Logo
uk.ac.ebi.intact.model.visitor
Code IndexAdd Codota to your IDE (free)

How to use uk.ac.ebi.intact.model.visitor

Best Java code snippets using uk.ac.ebi.intact.model.visitor (Showing top 20 results out of 315)

  • Add the Codota plugin to your IDE and get smart completions
private void myMethod () {
BufferedReader b =
  • Codota IconInputStream in;new BufferedReader(new InputStreamReader(in))
  • Codota IconReader in;new BufferedReader(in)
  • Codota IconFile file;new BufferedReader(new FileReader(file))
  • Smart code suggestions by Codota
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseInstitution(Institution institution, IntactVisitor ... visitors) {
  if (institution == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitInstitution(institution);
  }
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

public DefaultTraverser() {
  this.recursionChecker = new RecursionChecker();
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseConfidence(Confidence confidence, IntactVisitor... visitors) {
  if (confidence == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitConfidence(confidence);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(confidence)) {
    return;
  }
  traverse(confidence.getCvConfidenceType(), visitors);
}

origin: uk.ac.ebi.intact.core/intact-core

protected void traverseAnnotation(Annotation annotation, IntactVisitor... visitors) {
  if (annotation == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitAnnotation(annotation);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(annotation)) {
    return;
  }
  traverse(annotation.getCvTopic(), visitors);
  traverse(annotation.getOwner(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseAlias(Alias alias, IntactVisitor... visitors) {
  if (alias == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitAlias(alias);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(alias)) {
    return;
  }
  traverse(alias.getCvAliasType(), visitors);
  traverse(alias.getOwner(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseBioSource(BioSource bioSource, IntactVisitor ... visitors) {
  if (bioSource == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitBioSource(bioSource);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(bioSource)) {
    return;
  }
  traverse(bioSource.getCvCellType(), visitors);
  traverse(bioSource.getCvTissue(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseInteractor(Interactor interactor, IntactVisitor ... visitors) {
  if (interactor == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitInteractor(interactor);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(interactor)) {
    return;
  }
  traverse(interactor.getCvInteractorType(), visitors);
  traverse(interactor.getBioSource(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseParameter(Parameter parameter, IntactVisitor... visitors) {
  if (parameter == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitParameter(parameter);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(parameter)) {
    return;
  }
  traverse(parameter.getCvParameterType(), visitors);
  traverse(parameter.getCvParameterUnit(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseRange(Range range, IntactVisitor... visitors) {
  if (range == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitRange(range);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(range)) {
    return;
  }
  traverse(range.getFromCvFuzzyType(), visitors);
  traverse(range.getToCvFuzzyType(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseXref(Xref xref, IntactVisitor... visitors) {
  if (xref == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitXref(xref);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(xref)) {
    return;
  }
  traverse(xref.getCvXrefQualifier(), visitors);
  traverse(xref.getCvDatabase(), visitors);
  traverse(xref.getOwner(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseExperiment(Experiment experiment, IntactVisitor ... visitors) {
  if (experiment == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitExperiment(experiment);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(experiment)) {
    return;
  }
  traverse(experiment.getCvIdentification(), visitors);
  traverse(experiment.getCvInteraction(), visitors);
  traverse(experiment.getBioSource(), visitors);
  traverse(experiment.getPublication(), visitors);
  traverse(experiment.getInteractions(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traversePublication(Publication publication, IntactVisitor ... visitors) {
  if (publication == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitPublication(publication);
    traverse(publication.getExperiments(), visitors);
  }
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseAnnotation(Annotation annotation, IntactVisitor... visitors) {
  if (annotation == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitAnnotation(annotation);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(annotation)) {
    return;
  }
  traverse(annotation.getCvTopic(), visitors);
  traverse(annotation.getOwner(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseAlias(Alias alias, IntactVisitor... visitors) {
  if (alias == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitAlias(alias);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(alias)) {
    return;
  }
  traverse(alias.getCvAliasType(), visitors);
  traverse(alias.getOwner(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseBioSource(BioSource bioSource, IntactVisitor ... visitors) {
  if (bioSource == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitBioSource(bioSource);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(bioSource)) {
    return;
  }
  traverse(bioSource.getCvCellType(), visitors);
  traverse(bioSource.getCvTissue(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseInteractor(Interactor interactor, IntactVisitor ... visitors) {
  if (interactor == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitInteractor(interactor);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(interactor)) {
    return;
  }
  traverse(interactor.getCvInteractorType(), visitors);
  traverse(interactor.getBioSource(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core

protected void traverseConfidence(Confidence confidence, IntactVisitor... visitors) {
  if (confidence == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitConfidence(confidence);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(confidence)) {
    return;
  }
  traverse(confidence.getCvConfidenceType(), visitors);
}

origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseParameter(Parameter parameter, IntactVisitor... visitors) {
  if (parameter == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitParameter(parameter);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(parameter)) {
    return;
  }
  traverse(parameter.getCvParameterType(), visitors);
  traverse(parameter.getCvParameterUnit(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseRange(Range range, IntactVisitor... visitors) {
  if (range == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitRange(range);
  }
  // check if this element has been traversed already, to avoid cyclic recursion
  if (recursionChecker.isAlreadyTraversed(range)) {
    return;
  }
  traverse(range.getFromCvFuzzyType(), visitors);
  traverse(range.getToCvFuzzyType(), visitors);
}
origin: uk.ac.ebi.intact.core/intact-core-readonly

protected void traverseInstitution(Institution institution, IntactVisitor ... visitors) {
  if (institution == null) return;
  for (IntactVisitor visitor : visitors) {
    visitor.visitInstitution(institution);
  }
}
uk.ac.ebi.intact.model.visitor

Most used classes

  • DefaultTraverser
  • DefaultTraverser$RecursionChecker
  • HierarchyAware
  • IntactVisitor
  • JTreeBuilderVisitor
  • IntactObjectTraverser
Codota Logo
  • Products

    Search for Java codeSearch for JavaScript codeEnterprise
  • IDE Plugins

    IntelliJ IDEAWebStormAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogCodota Academy Plugin user guide Terms of usePrivacy policyJava Code IndexJavascript Code Index
Get Codota for your IDE now